@altimateai/ui-components 0.0.77-beta.3 → 0.0.77-beta.5

package/dist/dagre-6UL2VRFP.js

@@ -1,4 +1,4 @@
-import { a1 as b, bh as F, bi as Y, bj as H, bk as _, ad as i, a7 as V, bl as U, bm as $, b6 as q, bb as z, b7 as P, b5 as K, bn as Q, bo as W, bp as Z } from "./CoachForm.js";
+import { _ as X, aq as F, ar as Y, as as _, at as H, l as i, d as V, au as q, av as U, af as $, ak as z, ag as P, ae as K, aw as Q, ax as W, ay as Z } from "./CoachForm.js";
 import { G as B } from "./graph.js";
 import { l as I } from "./layout.js";
 import { i as x } from "./_baseUniq.js";
@@ -28,15 +28,15 @@ function ne(e) {
     return x(t.name) || (o.name = t.name), x(n) || (o.value = n), o;
   });
 }
-var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ b(() => {
-  N.clear(), J.clear(), f.clear();
-}, "clear"), O = /* @__PURE__ */ b((e, t) => {
-  const n = N.get(t) || [];
+var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ X(() => {
+  b.clear(), J.clear(), f.clear();
+}, "clear"), O = /* @__PURE__ */ X((e, t) => {
+  const n = b.get(t) || [];
   return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
-}, "isDescendant"), se = /* @__PURE__ */ b((e, t) => {
-  const n = N.get(t) || [];
+}, "isDescendant"), se = /* @__PURE__ */ X((e, t) => {
+  const n = b.get(t) || [];
   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) || O(e.v, t) || O(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
-}, "edgeInCluster"), G = /* @__PURE__ */ b((e, t, n, o) => {
+}, "edgeInCluster"), G = /* @__PURE__ */ X((e, t, n, o) => {
   i.warn(
     "Copying children of ",
     e,
@@ -63,10 +63,10 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE
       const u = t.edges(a);
       i.debug("Copying Edges", u), u.forEach((l) => {
         i.info("Edge", l);
-        const v = t.edge(l.v, l.w, l.name);
-        i.info("Edge data", v, o);
+        const h = t.edge(l.v, l.w, l.name);
+        i.info("Edge data", h, o);
         try {
-          se(l, o) ? (i.info("Copying as ", l.v, l.w, v, l.name), n.setEdge(l.v, l.w, v, l.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
+          se(l, o) ? (i.info("Copying as ", l.v, l.w, h, l.name), n.setEdge(l.v, l.w, h, l.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
             "Skipping copy of edge ",
             l.v,
             "-->",
@@ -83,16 +83,16 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE
     }
     i.debug("Removing node", a), t.removeNode(a);
   });
-}, "copy"), R = /* @__PURE__ */ b((e, t) => {
+}, "copy"), R = /* @__PURE__ */ X((e, t) => {
   const n = t.children(e);
   let o = [...n];
   for (const c of n)
     J.set(c, e), o = [...o, ...R(c, t)];
   return o;
-}, "extractDescendants"), ie = /* @__PURE__ */ b((e, t, n) => {
+}, "extractDescendants"), ie = /* @__PURE__ */ X((e, t, n) => {
   const o = e.edges().filter((l) => l.v === t || l.w === t), c = e.edges().filter((l) => l.v === n || l.w === n), a = o.map((l) => ({ v: l.v === t ? n : l.v, w: l.w === t ? t : l.w })), r = c.map((l) => ({ v: l.v, w: l.w }));
-  return a.filter((l) => r.some((v) => l.v === v.v && l.w === v.w));
-}, "findCommonEdges"), D = /* @__PURE__ */ b((e, t, n) => {
+  return a.filter((l) => r.some((h) => l.v === h.v && l.w === h.w));
+}, "findCommonEdges"), D = /* @__PURE__ */ X((e, t, n) => {
   const o = t.children(e);
   if (i.trace("Searching children of id ", e, o), o.length < 1)
     return e;
@@ -106,7 +106,7 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE
         return r;
   }
   return c;
-}, "findNonClusterChild"), k = /* @__PURE__ */ b((e) => !f.has(e) || !f.get(e).externalConnections ? e : f.has(e) ? f.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ b((e, t) => {
+}, "findNonClusterChild"), k = /* @__PURE__ */ X((e) => !f.has(e) || !f.get(e).externalConnections ? e : f.has(e) ? f.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ X((e, t) => {
   if (!e || t > 10) {
     i.debug("Opting out, no graph ");
     return;
@@ -118,13 +118,13 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE
       n,
       " Replacement id in edges: ",
       D(n, e, n)
-    ), N.set(n, R(n, e)), f.set(n, { id: D(n, e, n), clusterData: e.node(n) }));
+    ), b.set(n, R(n, e)), f.set(n, { id: D(n, e, n), clusterData: e.node(n) }));
   }), e.nodes().forEach(function(n) {
     const o = e.children(n), c = e.edges();
-    o.length > 0 ? (i.debug("Cluster identified", n, N), c.forEach((a) => {
+    o.length > 0 ? (i.debug("Cluster identified", n, b), c.forEach((a) => {
       const r = O(a.v, n), u = O(a.w, n);
-      r ^ u && (i.warn("Edge: ", a, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", N.get(n)), f.get(n).externalConnections = !0);
-    })) : i.debug("Not a cluster ", n, N);
+      r ^ u && (i.warn("Edge: ", a, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", b.get(n)), f.get(n).externalConnections = !0);
+    })) : i.debug("Not a cluster ", n, b);
   });
   for (let n of f.keys()) {
     const o = f.get(n).id, c = e.parent(o);
@@ -156,7 +156,7 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE
       i.warn("Fix Replacing with XXX", c, a, n.name), e.setEdge(c, a, o, n.name);
     }
   }), i.warn("Adjusted Graph", p(e)), T(e, 0), i.trace(f);
-}, "adjustClustersAndEdges"), T = /* @__PURE__ */ b((e, t) => {
+}, "adjustClustersAndEdges"), T = /* @__PURE__ */ X((e, t) => {
   var c, a;
   if (i.warn("extractor - ", t, p(e), e.children("D")), t > 10) {
     i.error("Bailing out");
@@ -193,7 +193,7 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE
       );
       let l = e.graph().rankdir === "TB" ? "LR" : "TB";
       (a = (c = f.get(r)) == null ? void 0 : c.clusterData) != null && a.dir && (l = f.get(r).clusterData.dir, i.warn("Fixing dir", f.get(r).clusterData.dir, l));
-      const v = new B({
+      const h = new B({
         multigraph: !0,
         compound: !0
       }).setGraph({
@@ -205,13 +205,13 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE
       }).setDefaultEdgeLabel(function() {
         return {};
       });
-      i.warn("Old graph before copy", p(e)), G(r, e, v, r), e.setNode(r, {
+      i.warn("Old graph before copy", p(e)), G(r, e, h, r), e.setNode(r, {
         clusterNode: !0,
         id: r,
         clusterData: f.get(r).clusterData,
         label: f.get(r).label,
-        graph: v
-      }), i.warn("New graph after copy node: (", r, ")", p(v)), i.debug("Old graph after copy", p(e));
+        graph: h
+      }), i.warn("New graph after copy node: (", r, ")", p(h)), i.debug("Old graph after copy", p(e));
     } else
       i.warn(
         "Cluster ** ",
@@ -230,7 +230,7 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE
     const u = e.node(r);
     i.warn(" Now next level", r, u), u != null && u.clusterNode && T(u.graph, t + 1);
   }
-}, "extractor"), M = /* @__PURE__ */ b((e, t) => {
+}, "extractor"), M = /* @__PURE__ */ X((e, t) => {
   if (t.length === 0)
     return [];
   let n = Object.assign([], t);
@@ -238,13 +238,13 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE
     const c = e.children(o), a = M(e, c);
     n = [...n, ...a];
   }), n;
-}, "sorter"), oe = /* @__PURE__ */ b((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ b(async (e, t, n, o, c, a) => {
+}, "sorter"), oe = /* @__PURE__ */ X((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ X(async (e, t, n, o, c, a) => {
   i.warn("Graph in recursive render:XAX", p(t), c);
   const r = t.graph().rankdir;
   i.trace("Dir in recursive render - dir:", r);
   const u = e.insert("g").attr("class", "root");
   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 l = u.insert("g").attr("class", "clusters"), v = u.insert("g").attr("class", "edgePaths"), C = u.insert("g").attr("class", "edgeLabels"), g = u.insert("g").attr("class", "nodes");
+  const l = u.insert("g").attr("class", "clusters"), h = u.insert("g").attr("class", "edgePaths"), C = u.insert("g").attr("class", "edgeLabels"), g = u.insert("g").attr("class", "nodes");
   await Promise.all(
     t.nodes().map(async function(d) {
       const s = t.node(d);
@@ -270,15 +270,15 @@ Parent cluster`,
           ranksep: w + 25,
           nodesep: m
         });
-        const E = await j(
+        const N = await j(
           g,
           s.graph,
           n,
           o,
           t.node(d),
           a
-        ), S = E.elem;
-        U(s, S), s.diff = E.diff || 0, i.info(
+        ), S = N.elem;
+        q(s, S), s.diff = N.diff || 0, i.info(
           "New compound node after recursive render XAX",
           d,
           "width",
@@ -288,7 +288,7 @@ Parent cluster`,
           s.height
           // node.x,
           // node.y
-        ), $(S, s);
+        ), U(S, s);
       } else
         t.children(d).length > 0 ? (i.trace(
           "Cluster - the non recursive path XBX",
@@ -298,9 +298,9 @@ Parent cluster`,
           s.width,
           "Graph:",
           t
-        ), i.trace(D(s.id, t)), f.set(s.id, { id: D(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", d, g, t.node(d), r), await q(g, t.node(d), { config: a, dir: r }));
+        ), i.trace(D(s.id, t)), f.set(s.id, { id: D(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", d, g, t.node(d), r), await $(g, t.node(d), { config: a, dir: r }));
     })
-  ), await (/* @__PURE__ */ b(async () => {
+  ), await (/* @__PURE__ */ X(async () => {
     const d = t.edges().map(async function(s) {
       const w = t.edge(s.v, s.w, s.name);
       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(
@@ -316,7 +316,7 @@ Parent cluster`,
     });
     await Promise.all(d);
   }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(p(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(p(t)));
-  let y = 0, { subGraphTitleTotalMargin: X } = z(a);
+  let E = 0, { subGraphTitleTotalMargin: y } = z(a);
   return await Promise.all(
     oe(t).map(async function(d) {
       var w;
@@ -329,7 +329,7 @@ Parent cluster`,
         " height: ",
         s.height
       ), s != null && s.clusterNode)
-        s.y += X, i.info(
+        s.y += y, i.info(
           "A tainted cluster node XBX1",
           d,
           s.id,
@@ -349,12 +349,12 @@ Parent cluster`,
           s.width,
           s.height,
           t.parent(d)
-        ), s.height += X, t.node(s.parentId);
-        const m = (s == null ? void 0 : s.padding) / 2 || 0, E = ((w = s == null ? void 0 : s.labelBBox) == null ? void 0 : w.height) || 0, S = E - m || 0;
-        i.debug("OffsetY", S, "labelHeight", E, "halfPadding", m), await K(l, s), f.get(s.id).node = s;
+        ), s.height += y, t.node(s.parentId);
+        const m = (s == null ? void 0 : s.padding) / 2 || 0, N = ((w = s == null ? void 0 : s.labelBBox) == null ? void 0 : w.height) || 0, S = N - m || 0;
+        i.debug("OffsetY", S, "labelHeight", N, "halfPadding", m), await K(l, s), f.get(s.id).node = s;
       } else {
         const m = t.node(s.parentId);
-        s.y += X / 2, i.info(
+        s.y += y / 2, i.info(
           "A regular node XBX1 - using the padding",
           s.id,
           "parent",
@@ -374,37 +374,37 @@ Parent cluster`,
     })
   ), t.edges().forEach(function(d) {
     const s = t.edge(d);
-    i.info("Edge " + d.v + " -> " + d.w + ": " + JSON.stringify(s), s), s.points.forEach((S) => S.y += X / 2);
+    i.info("Edge " + d.v + " -> " + d.w + ": " + JSON.stringify(s), s), s.points.forEach((S) => S.y += y / 2);
     const w = t.node(d.v);
     var m = t.node(d.w);
-    const E = Q(v, s, f, n, w, m, o);
-    W(s, E);
+    const N = Q(h, s, f, n, w, m, o);
+    W(s, N);
   }), t.nodes().forEach(function(d) {
     const s = t.node(d);
-    i.info(d, s.type, s.diff), s.isGroup && (y = s.diff);
-  }), i.warn("Returning from recursive render XAX", u, y), { elem: u, diff: y };
-}, "recursiveRender"), ge = /* @__PURE__ */ b(async (e, t) => {
-  var a, r, u, l, v, C;
+    i.info(d, s.type, s.diff), s.isGroup && (E = s.diff);
+  }), i.warn("Returning from recursive render XAX", u, E), { elem: u, diff: E };
+}, "recursiveRender"), ge = /* @__PURE__ */ X(async (e, t) => {
+  var a, r, u, l, h, C;
   const n = new B({
     multigraph: !0,
     compound: !0
   }).setGraph({
     rankdir: e.direction,
     nodesep: ((a = e.config) == null ? void 0 : a.nodeSpacing) || ((u = (r = e.config) == null ? void 0 : r.flowchart) == null ? void 0 : u.nodeSpacing) || e.nodeSpacing,
-    ranksep: ((l = e.config) == null ? void 0 : l.rankSpacing) || ((C = (v = e.config) == null ? void 0 : v.flowchart) == null ? void 0 : C.rankSpacing) || e.rankSpacing,
+    ranksep: ((l = e.config) == null ? void 0 : l.rankSpacing) || ((C = (h = e.config) == null ? void 0 : h.flowchart) == null ? void 0 : C.rankSpacing) || e.rankSpacing,
     marginx: 8,
     marginy: 8
   }).setDefaultEdgeLabel(function() {
     return {};
   }), o = t.select("g");
-  F(o, e.markers, e.type, e.diagramId), Y(), H(), _(), te(), e.nodes.forEach((g) => {
+  F(o, e.markers, e.type, e.diagramId), Y(), _(), H(), te(), e.nodes.forEach((g) => {
     n.setNode(g.id, { ...g }), g.parentId && n.setParent(g.id, g.parentId);
   }), i.debug("Edges:", e.edges), e.edges.forEach((g) => {
     if (g.start === g.end) {
-      const h = g.start, y = h + "---" + h + "---1", X = h + "---" + h + "---2", d = n.node(h);
-      n.setNode(y, {
-        domId: y,
-        id: y,
+      const v = g.start, E = v + "---" + v + "---1", y = v + "---" + v + "---2", d = n.node(v);
+      n.setNode(E, {
+        domId: E,
+        id: E,
         parentId: d.parentId,
         labelStyle: "",
         label: "",
@@ -414,9 +414,9 @@ Parent cluster`,
         style: "",
         width: 10,
         height: 10
-      }), n.setParent(y, d.parentId), n.setNode(X, {
-        domId: X,
-        id: X,
+      }), n.setParent(E, d.parentId), n.setNode(y, {
+        domId: y,
+        id: y,
         parentId: d.parentId,
         labelStyle: "",
         padding: 0,
@@ -426,9 +426,9 @@ Parent cluster`,
         style: "",
         width: 10,
         height: 10
-      }), n.setParent(X, d.parentId);
+      }), n.setParent(y, d.parentId);
       const s = structuredClone(g), w = structuredClone(g), m = structuredClone(g);
-      s.label = "", s.arrowTypeEnd = "none", s.id = h + "-cyclic-special-1", w.arrowTypeStart = "none", w.arrowTypeEnd = "none", w.id = h + "-cyclic-special-mid", m.label = "", d.isGroup && (s.fromCluster = h, m.toCluster = h), m.id = h + "-cyclic-special-2", m.arrowTypeStart = "none", n.setEdge(h, y, s, h + "-cyclic-special-0"), n.setEdge(y, X, w, h + "-cyclic-special-1"), n.setEdge(X, h, m, h + "-cyc<lic-special-2");
+      s.label = "", s.arrowTypeEnd = "none", s.id = v + "-cyclic-special-1", w.arrowTypeStart = "none", w.arrowTypeEnd = "none", w.id = v + "-cyclic-special-mid", m.label = "", d.isGroup && (s.fromCluster = v, m.toCluster = v), m.id = v + "-cyclic-special-2", m.arrowTypeStart = "none", n.setEdge(v, E, s, v + "-cyclic-special-0"), n.setEdge(E, y, w, v + "-cyclic-special-1"), n.setEdge(y, v, m, v + "-cyc<lic-special-2");
     } else
       n.setEdge(g.start, g.end, { ...g }, g.id);
   }), i.warn("Graph at first:", JSON.stringify(p(n))), re(n), i.warn("Graph after XAX:", JSON.stringify(p(n)));

package/dist/dayjs.min.js

@@ -1,6 +1,6 @@
 import { j as R } from "./index2.js";
 import { forwardRef as q } from "react";
-import { g as B } from "./Stack.js";
+import { a as B } from "./Stack.js";
 import { c as tt, g as et } from "./redux-toolkit.modern.js";
 const nt = q(
   ({ className: T, isOpen: H = !1, children: v, ...g }, L) => H ? /* @__PURE__ */ R.jsx("div", { ref: L, className: B("al-transition-all", T), ...g, children: v }) : null

package/dist/diagram-PSM6KHXK.js

@@ -1,4 +1,4 @@
-import { a3 as he, a4 as ue, ag as pe, ah as fe, a5 as ge, a6 as me, a1 as w, aw as te, av as ae, bK as ye, an as Se, au as ve, ad as J, az as xe, ae as be, bL as P } from "./CoachForm.js";
+import { s as he, g as ue, m as pe, n as fe, b as ge, c as me, _ as w, D as te, C as ae, bP as ye, r as Se, B as ve, l as J, G as xe, j as be, bQ as P } from "./CoachForm.js";
 import { s as we } from "./chunk-QN33PNHL.js";
 import { p as Ce } from "./chunk-4BX2VUAB.js";
 import { p as Te } from "./mermaid-parser.core.js";
@@ -48,12 +48,12 @@ function Me(t) {
     a.value = l;
   });
 }
-function ze(t) {
+function _e(t) {
   return this.eachBefore(function(a) {
     a.children && a.children.sort(t);
   });
 }
-function _e(t) {
+function ze(t) {
   for (var a = this, l = Ve(a, t), n = [a]; a !== l; )
     a = a.parent, n.push(a);
   for (var o = n.length; t !== l; )
@@ -96,16 +96,16 @@ function* Ee() {
           l.push(n[o]);
   while (l.length);
 }
-function Q(t, a) {
+function K(t, a) {
   t instanceof Map ? (t = [void 0, t], a === void 0 && (a = Ie)) : a === void 0 && (a = He);
-  for (var l = new K(t), n, o = [l], s, d, h, g; n = o.pop(); )
+  for (var l = new Q(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 K(d[h])), s.parent = n, s.depth = n.depth + 1;
+        o.push(s = d[h] = new Q(d[h])), s.parent = n, s.depth = n.depth + 1;
   return l.eachBefore(Ge);
 }
 function We() {
-  return Q(this).eachBefore(Oe);
+  return K(this).eachBefore(Oe);
 }
 function He(t) {
   return t.children;
@@ -122,19 +122,19 @@ function Ge(t) {
     t.height = a;
   while ((t = t.parent) && t.height < ++a);
 }
-function K(t) {
+function Q(t) {
   this.data = t, this.depth = this.height = 0, this.parent = null;
 }
-K.prototype = Q.prototype = {
-  constructor: K,
+Q.prototype = K.prototype = {
+  constructor: Q,
   count: $e,
   each: Ae,
   eachAfter: ke,
   eachBefore: Fe,
   find: Ne,
   sum: Me,
-  sort: ze,
-  path: _e,
+  sort: _e,
+  path: ze,
   ancestors: De,
   descendants: Pe,
   leaves: Be,
@@ -142,22 +142,22 @@ K.prototype = Q.prototype = {
   copy: We,
   [Symbol.iterator]: Ee
 };
-function qe(t) {
+function je(t) {
   if (typeof t != "function") throw new Error();
   return t;
 }
 function G() {
   return 0;
 }
-function q(t) {
+function j(t) {
   return function() {
     return t;
   };
 }
-function Xe(t) {
+function qe(t) {
   t.x0 = Math.round(t.x0), t.y0 = Math.round(t.y0), t.x1 = Math.round(t.x1), t.y1 = Math.round(t.y1);
 }
-function je(t, a, l, n, o) {
+function Xe(t, a, l, n, o) {
   for (var s = t.children, d, h = -1, g = s.length, c = t.value && (n - a) / t.value; ++h < g; )
     d = s[h], d.y0 = l, d.y1 = o, d.x0 = a, d.x1 = a += d.value * c;
 }
@@ -165,7 +165,7 @@ 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 Ke = (1 + Math.sqrt(5)) / 2;
+var Qe = (1 + Math.sqrt(5)) / 2;
 function Ue(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, E, M; u < r; ) {
     x = o - l, S = s - n;
@@ -179,7 +179,7 @@ function Ue(t, a, l, n, o, s) {
       }
       V = k;
     }
-    d.push(g = { value: p, dice: x < S, children: h.slice(u, b) }), g.dice ? je(g, l, n, o, v ? n += S * p / v : s) : Ye(g, l, n, v ? l += x * p / v : o, s), v -= p, u = b;
+    d.push(g = { value: p, dice: x < S, children: h.slice(u, b) }), g.dice ? Xe(g, l, n, o, v ? n += S * p / v : s) : Ye(g, l, n, v ? l += x * p / v : o, s), v -= p, u = b;
   }
   return d;
 }
@@ -190,11 +190,11 @@ const Ze = function t(a) {
   return l.ratio = function(n) {
     return t((n = +n) > 1 ? n : 1);
   }, l;
-}(Ke);
+}(Qe);
 function Je() {
   var t = Ze, a = !1, l = 1, n = 1, o = [0], s = G, d = G, h = G, g = G, c = G;
   function u(r) {
-    return r.x0 = r.y0 = 0, r.x1 = l, r.y1 = n, r.eachBefore(b), o = [0], a && r.eachBefore(Xe), r;
+    return r.x0 = r.y0 = 0, r.x1 = l, r.y1 = n, r.eachBefore(b), o = [0], a && r.eachBefore(qe), r;
   }
   function b(r) {
     var x = o[r.depth], S = r.x0 + x, v = r.y0 + x, p = r.x1 - x, m = r.y1 - x;
@@ -205,21 +205,21 @@ function Je() {
   }, u.size = function(r) {
     return arguments.length ? (l = +r[0], n = +r[1], u) : [l, n];
   }, u.tile = function(r) {
-    return arguments.length ? (t = qe(r), u) : t;
+    return arguments.length ? (t = je(r), u) : t;
   }, u.padding = function(r) {
     return arguments.length ? u.paddingInner(r).paddingOuter(r) : u.paddingInner();
   }, u.paddingInner = function(r) {
-    return arguments.length ? (s = typeof r == "function" ? r : q(+r), u) : s;
+    return arguments.length ? (s = typeof r == "function" ? r : j(+r), u) : s;
   }, u.paddingOuter = function(r) {
     return arguments.length ? u.paddingTop(r).paddingRight(r).paddingBottom(r).paddingLeft(r) : u.paddingTop();
   }, u.paddingTop = function(r) {
-    return arguments.length ? (d = typeof r == "function" ? r : q(+r), u) : d;
+    return arguments.length ? (d = typeof r == "function" ? r : j(+r), u) : d;
   }, u.paddingRight = function(r) {
-    return arguments.length ? (h = typeof r == "function" ? r : q(+r), u) : h;
+    return arguments.length ? (h = typeof r == "function" ? r : j(+r), u) : h;
   }, u.paddingBottom = function(r) {
-    return arguments.length ? (g = typeof r == "function" ? r : q(+r), u) : g;
+    return arguments.length ? (g = typeof r == "function" ? r : j(+r), u) : g;
   }, u.paddingLeft = function(r) {
-    return arguments.length ? (c = typeof r == "function" ? r : q(+r), u) : c;
+    return arguments.length ? (c = typeof r == "function" ? r : j(+r), u) : c;
   }, u;
 }
 var R, ne = (R = class {
@@ -280,7 +280,7 @@ function le(t) {
   }), a;
 }
 w(le, "buildHierarchy");
-var Qe = /* @__PURE__ */ w((t, a) => {
+var Ke = /* @__PURE__ */ w((t, a) => {
   Ce(t, a);
   const l = [];
   for (const s of t.TreemapRows ?? [])
@@ -317,12 +317,12 @@ var Qe = /* @__PURE__ */ w((t, a) => {
         throw new Error(
           "parser.parser?.yy was not a TreemapDB. This is due to a bug within Mermaid, please report this issue at https://github.com/mermaid-js/mermaid/issues."
         );
-      Qe(n, o);
+      Ke(n, o);
     } catch (l) {
       throw J.error("Error parsing treemap:", l), l;
     }
   }, "parse")
-}, tt = 10, B = 10, X = 25, at = /* @__PURE__ */ w((t, a, l, n) => {
+}, tt = 10, B = 10, q = 25, at = /* @__PURE__ */ w((t, a, l, n) => {
   const o = n.db, s = o.getConfig(), d = s.padding ?? tt, h = o.getDiagramTitle(), g = o.getRoot(), { themeVariables: c } = te();
   if (!g)
     return;
@@ -387,15 +387,15 @@ var Qe = /* @__PURE__ */ w((t, a) => {
     c.cScaleLabel11
   ]);
   h && b.append("text").attr("x", S / 2).attr("y", u / 2).attr("class", "treemapTitle").attr("text-anchor", "middle").attr("dominant-baseline", "middle").text(h);
-  const V = b.append("g").attr("transform", `translate(0, ${u})`).attr("class", "treemapContainer"), E = Q(g).sum((e) => e.value ?? 0).sort((e, i) => (i.value ?? 0) - (e.value ?? 0)), ee = Je().size([r, x]).paddingTop(
-    (e) => e.children && e.children.length > 0 ? X + B : 0
+  const V = b.append("g").attr("transform", `translate(0, ${u})`).attr("class", "treemapContainer"), E = K(g).sum((e) => e.value ?? 0).sort((e, i) => (i.value ?? 0) - (e.value ?? 0)), ee = Je().size([r, x]).paddingTop(
+    (e) => e.children && e.children.length > 0 ? q + B : 0
   ).paddingInner(d).paddingLeft((e) => e.children && e.children.length > 0 ? B : 0).paddingRight((e) => e.children && e.children.length > 0 ? B : 0).paddingBottom((e) => e.children && e.children.length > 0 ? B : 0).round(!0)(E), se = ee.descendants().filter((e) => e.children && e.children.length > 0), W = V.selectAll(".treemapSection").data(se).enter().append("g").attr("class", "treemapSection").attr("transform", (e) => `translate(${e.x0},${e.y0})`);
-  W.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", X).attr("class", "treemapSectionHeader").attr("fill", "none").attr("fill-opacity", 0.6).attr("stroke-width", 0.6).attr("style", (e) => e.depth === 0 ? "display: none;" : ""), W.append("clipPath").attr("id", (e, i) => `clip-section-${a}-${i}`).append("rect").attr("width", (e) => Math.max(0, e.x1 - e.x0 - 12)).attr("height", X), W.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", (e) => e.y1 - e.y0).attr("class", (e, i) => `treemapSection section${i}`).attr("fill", (e) => m(e.data.name)).attr("fill-opacity", 0.6).attr("stroke", (e) => N(e.data.name)).attr("stroke-width", 2).attr("stroke-opacity", 0.4).attr("style", (e) => {
+  W.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", q).attr("class", "treemapSectionHeader").attr("fill", "none").attr("fill-opacity", 0.6).attr("stroke-width", 0.6).attr("style", (e) => e.depth === 0 ? "display: none;" : ""), W.append("clipPath").attr("id", (e, i) => `clip-section-${a}-${i}`).append("rect").attr("width", (e) => Math.max(0, e.x1 - e.x0 - 12)).attr("height", q), W.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", (e) => e.y1 - e.y0).attr("class", (e, i) => `treemapSection section${i}`).attr("fill", (e) => m(e.data.name)).attr("fill-opacity", 0.6).attr("stroke", (e) => N(e.data.name)).attr("stroke-width", 2).attr("stroke-opacity", 0.4).attr("style", (e) => {
     if (e.depth === 0)
       return "display: none;";
     const i = P({ cssCompiledStyles: e.data.cssCompiledStyles });
     return i.nodeStyles + ";" + i.borderStyles.join(";");
-  }), W.append("text").attr("class", "treemapSectionLabel").attr("x", 6).attr("y", X / 2).attr("dominant-baseline", "middle").text((e) => e.depth === 0 ? "" : e.data.name).attr("font-weight", "bold").attr("style", (e) => {
+  }), W.append("text").attr("class", "treemapSectionLabel").attr("x", 6).attr("y", q / 2).attr("dominant-baseline", "middle").text((e) => e.depth === 0 ? "" : e.data.name).attr("font-weight", "bold").attr("style", (e) => {
     if (e.depth === 0)
       return "display: none;";
     const i = "dominant-baseline: middle; font-size: 12px; fill:" + k(e.data.name) + "; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;", f = P({ cssCompiledStyles: e.data.cssCompiledStyles });
@@ -421,14 +421,14 @@ var Qe = /* @__PURE__ */ w((t, a) => {
           break;
       }
     }
-  }), s.showValues !== !1 && W.append("text").attr("class", "treemapSectionValue").attr("x", (e) => e.x1 - e.x0 - 10).attr("y", X / 2).attr("text-anchor", "end").attr("dominant-baseline", "middle").text((e) => e.value ? p(e.value) : "").attr("font-style", "italic").attr("style", (e) => {
+  }), s.showValues !== !1 && W.append("text").attr("class", "treemapSectionValue").attr("x", (e) => e.x1 - e.x0 - 10).attr("y", q / 2).attr("text-anchor", "end").attr("dominant-baseline", "middle").text((e) => e.value ? p(e.value) : "").attr("font-style", "italic").attr("style", (e) => {
     if (e.depth === 0)
       return "display: none;";
     const i = "text-anchor: end; dominant-baseline: middle; font-size: 10px; fill:" + k(e.data.name) + "; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;", f = P({ cssCompiledStyles: e.data.cssCompiledStyles });
     return i + f.labelStyles.replace("color:", "fill:");
   });
-  const ie = ee.leaves(), j = V.selectAll(".treemapLeafGroup").data(ie).enter().append("g").attr("class", (e, i) => `treemapNode treemapLeafGroup leaf${i}${e.data.classSelector ? ` ${e.data.classSelector}` : ""}x`).attr("transform", (e) => `translate(${e.x0},${e.y0})`);
-  j.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", (e) => e.y1 - e.y0).attr("class", "treemapLeaf").attr("fill", (e) => e.parent ? m(e.parent.data.name) : m(e.data.name)).attr("style", (e) => P({ cssCompiledStyles: e.data.cssCompiledStyles }).nodeStyles).attr("fill-opacity", 0.3).attr("stroke", (e) => e.parent ? m(e.parent.data.name) : m(e.data.name)).attr("stroke-width", 3), j.append("clipPath").attr("id", (e, i) => `clip-${a}-${i}`).append("rect").attr("width", (e) => Math.max(0, e.x1 - e.x0 - 4)).attr("height", (e) => Math.max(0, e.y1 - e.y0 - 4)), j.append("text").attr("class", "treemapLabel").attr("x", (e) => (e.x1 - e.x0) / 2).attr("y", (e) => (e.y1 - e.y0) / 2).attr("style", (e) => {
+  const ie = ee.leaves(), X = V.selectAll(".treemapLeafGroup").data(ie).enter().append("g").attr("class", (e, i) => `treemapNode treemapLeafGroup leaf${i}${e.data.classSelector ? ` ${e.data.classSelector}` : ""}x`).attr("transform", (e) => `translate(${e.x0},${e.y0})`);
+  X.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", (e) => e.y1 - e.y0).attr("class", "treemapLeaf").attr("fill", (e) => e.parent ? m(e.parent.data.name) : m(e.data.name)).attr("style", (e) => P({ cssCompiledStyles: e.data.cssCompiledStyles }).nodeStyles).attr("fill-opacity", 0.3).attr("stroke", (e) => e.parent ? m(e.parent.data.name) : m(e.data.name)).attr("stroke-width", 3), X.append("clipPath").attr("id", (e, i) => `clip-${a}-${i}`).append("rect").attr("width", (e) => Math.max(0, e.x1 - e.x0 - 4)).attr("height", (e) => Math.max(0, e.y1 - e.y0 - 4)), X.append("text").attr("class", "treemapLabel").attr("x", (e) => (e.x1 - e.x0) / 2).attr("y", (e) => (e.y1 - e.y0) / 2).attr("style", (e) => {
     const i = "text-anchor: middle; dominant-baseline: middle; font-size: 38px;fill:" + k(e.data.name) + ";", f = P({ cssCompiledStyles: e.data.cssCompiledStyles });
     return i + f.labelStyles.replace("color:", "fill:");
   }).attr("clip-path", (e, i) => `url(#clip-${a}-${i})`).text((e) => e.data.name).each(function(e) {
@@ -438,20 +438,20 @@ var Qe = /* @__PURE__ */ w((t, a) => {
       return;
     }
     let y = parseInt(i.style("font-size"), 10);
-    const z = 8, T = 28, L = 0.6, _ = 6, H = 2;
-    for (; $.getComputedTextLength() > D && y > z; )
+    const _ = 8, T = 28, L = 0.6, z = 6, H = 2;
+    for (; $.getComputedTextLength() > D && y > _; )
       y--, i.style("font-size", `${y}px`);
     let I = Math.max(
-      _,
+      z,
       Math.min(T, Math.round(y * L))
     ), U = y + H + I;
-    for (; U > F && y > z && (y--, I = Math.max(
-      _,
+    for (; U > F && y > _ && (y--, I = Math.max(
+      z,
       Math.min(T, Math.round(y * L))
-    ), !(I < _ && y === z)); )
+    ), !(I < z && y === _)); )
       i.style("font-size", `${y}px`), U = y + H + I;
-    i.style("font-size", `${y}px`), ($.getComputedTextLength() > D || y < z || 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) {
+    i.style("font-size", `${y}px`), ($.getComputedTextLength() > D || y < _ || F < y) && i.style("display", "none");
+  }), s.showValues !== !1 && X.append("text").attr("class", "treemapValue").attr("x", (i) => (i.x1 - i.x0) / 2).attr("y", function(i) {
     return (i.y1 - i.y0) / 2;
   }).attr("style", (i) => {
     const f = "text-anchor: middle; dominant-baseline: hanging; font-size: 28px;fill:" + k(i.data.name) + ";", C = P({ cssCompiledStyles: i.data.cssCompiledStyles });
@@ -467,15 +467,15 @@ var Qe = /* @__PURE__ */ w((t, a) => {
       f.style("display", "none");
       return;
     }
-    const A = parseFloat($.style("font-size")), D = 28, F = 0.6, y = 6, z = 2, T = Math.max(
+    const A = parseFloat($.style("font-size")), D = 28, F = 0.6, y = 6, _ = 2, T = Math.max(
       y,
       Math.min(D, Math.round(A * F))
     );
     f.style("font-size", `${T}px`);
-    const _ = (i.y1 - i.y0) / 2 + A / 2 + z;
-    f.attr("y", _);
+    const z = (i.y1 - i.y0) / 2 + A / 2 + _;
+    f.attr("y", z);
     const H = i.x1 - i.x0, ce = i.y1 - i.y0 - 4, de = H - 2 * 4;
-    f.node().getComputedTextLength() > de || _ + T > ce || T < y ? f.style("display", "none") : f.style("display", null);
+    f.node().getComputedTextLength() > de || z + T > ce || T < y ? f.style("display", "none") : f.style("display", null);
   });
   const oe = s.diagramPadding ?? 8;
   we(b, oe, "flowchart", (s == null ? void 0 : s.useMaxWidth) || !1);