@notmrabhi/flowforge 0.1.8 → 0.1.9

package/dist/{templateSkeletons-BT6obP5g.js → templateSkeletons-CZ7m_Cjb.js}

@@ -1,19 +1,19 @@
-import { jsxs as m, jsx as f, Fragment as Rt } from "react/jsx-runtime";
-import P, { useRef as pt, useEffect as ie, useState as M, useMemo as W, useCallback as Y } from "react";
+import { jsxs as m, jsx as f, Fragment as Lt } from "react/jsx-runtime";
+import P, { useRef as pt, useEffect as ie, useState as j, useMemo as W, useCallback as Y } from "react";
 import _r, { useStore as Tr, useReactFlow as Nr, Background as Cr, Controls as Sr, MiniMap as Ir } from "reactflow";
 import "reactflow/dist/style.css";
-import { e as Or, G as jr, E as Mr, P as Fr, L as zr, d as Dr, f as Lr } from "./GatewayBranchEdge-C9tybnDE.js";
-import { Dialog as Rr, Box as te, Drawer as Ar, IconButton as bt, Button as yt } from "@mui/material";
+import { e as Or, G as Mr, E as jr, P as Fr, L as zr, d as Rr, f as Dr } from "./GatewayBranchEdge-D6o2Dnkd.js";
+import { Dialog as Lr, Box as te, Drawer as Ar, IconButton as bt, Button as yt } from "@mui/material";
 import { MdClose as Pr, MdCalendarToday as Br, MdBolt as Wr, MdArrowBack as Gr, MdChevronRight as At, MdAddCircleOutline as $r, MdApps as Yr, MdErrorOutline as Kr, MdAccountTree as Ur, MdAdd as Vr, MdSearch as Hr, MdCategory as qr, MdCancel as Pt, MdError as Bt, MdCheckCircle as Wt, MdPlayArrow as Gt, MdHourglassEmpty as Xr, MdSchedule as mt, MdPerson as Jr, MdExpandLess as Zr, MdExpandMore as Qr } from "react-icons/md";
 import { GrTrigger as en } from "react-icons/gr";
 import { BiCollapse as tn, BiExpand as rn } from "react-icons/bi";
-import { a as nn } from "./index-DO5qci03.js";
+import { a as nn } from "./index-D6g2IXSf.js";
 import { m as on } from "./messages-CO299wPN.js";
 import { T as sn, E as q } from "./canvasTokens-CAD6G24b.js";
-var $t = Object.defineProperty, ln = (e, t, r) => t in e ? $t(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r, an = (e, t) => {
+var $t = Object.defineProperty, ln = (e, t, r) => t in e ? $t(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r, dn = (e, t) => {
   for (var r in t) $t(e, r, { get: t[r], enumerable: !0 });
-}, dn = (e, t, r) => ln(e, t + "", r), Yt = {};
-an(Yt, { Graph: () => G, alg: () => Ve, json: () => Ut, version: () => fn });
+}, an = (e, t, r) => ln(e, t + "", r), Yt = {};
+dn(Yt, { Graph: () => G, alg: () => Ve, json: () => Ut, version: () => fn });
 var cn = Object.defineProperty, Kt = (e, t) => {
   for (var r in t) cn(e, r, { get: t[r], enumerable: !0 });
 }, G = class {
@@ -147,14 +147,14 @@ var cn = Object.defineProperty, Kt = (e, t) => {
     return e.reduce((r, n) => (t !== void 0 ? this.setEdge(r, n, t) : this.setEdge(r, n), n)), this;
   }
   setEdge(e, t, r, n) {
-    let o, i, s, l, d = !1;
-    typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, s = e.name, arguments.length === 2 && (l = t, d = !0)) : (o = e, i = t, s = n, arguments.length > 2 && (l = r, d = !0)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s);
-    let a = ge(this._isDirected, o, i, s);
-    if (a in this._edgeLabels) return d && (this._edgeLabels[a] = l), this;
+    let o, i, s, l, a = !1;
+    typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, s = e.name, arguments.length === 2 && (l = t, a = !0)) : (o = e, i = t, s = n, arguments.length > 2 && (l = r, a = !0)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s);
+    let d = ge(this._isDirected, o, i, s);
+    if (d in this._edgeLabels) return a && (this._edgeLabels[d] = l), this;
     if (s !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false");
-    this.setNode(o), this.setNode(i), this._edgeLabels[a] = d ? l : this._defaultEdgeLabelFn(o, i, s);
+    this.setNode(o), this.setNode(i), this._edgeLabels[d] = a ? l : this._defaultEdgeLabelFn(o, i, s);
     let c = un(this._isDirected, o, i, s);
-    return o = c.v, i = c.w, Object.freeze(c), this._edgeObjs[a] = c, wt(this._preds[i], o), wt(this._sucs[o], i), this._in[i][a] = c, this._out[o][a] = c, this._edgeCount++, this;
+    return o = c.v, i = c.w, Object.freeze(c), this._edgeObjs[d] = c, wt(this._preds[i], o), wt(this._sucs[o], i), this._in[i][d] = c, this._out[o][d] = c, this._edgeCount++, this;
   }
   edge(e, t, r) {
     let n = arguments.length === 1 ? Fe(this._isDirected, e) : ge(this._isDirected, e, t, r);
@@ -246,7 +246,7 @@ function bn(e) {
   }), t;
 }
 var Ve = {};
-Kt(Ve, { CycleException: () => _e, bellmanFord: () => Vt, components: () => wn, dijkstra: () => xe, dijkstraAll: () => kn, findCycles: () => xn, floydWarshall: () => Tn, isAcyclic: () => Cn, postorder: () => In, preorder: () => On, prim: () => jn, shortestPaths: () => Mn, tarjan: () => qt, topsort: () => Xt });
+Kt(Ve, { CycleException: () => _e, bellmanFord: () => Vt, components: () => wn, dijkstra: () => xe, dijkstraAll: () => kn, findCycles: () => xn, floydWarshall: () => Tn, isAcyclic: () => Cn, postorder: () => In, preorder: () => On, prim: () => Mn, shortestPaths: () => jn, tarjan: () => qt, topsort: () => Xt });
 var yn = () => 1;
 function Vt(e, t, r, n) {
   return mn(e, String(t), r || yn, n || function(o) {
@@ -254,14 +254,14 @@ function Vt(e, t, r, n) {
   });
 }
 function mn(e, t, r, n) {
-  let o = {}, i, s = 0, l = e.nodes(), d = function(u) {
+  let o = {}, i, s = 0, l = e.nodes(), a = function(u) {
     let h = r(u);
     o[u.v].distance + h < o[u.w].distance && (o[u.w] = { distance: o[u.v].distance + h, predecessor: u.v }, i = !0);
-  }, a = function() {
+  }, d = function() {
     l.forEach(function(u) {
       n(u).forEach(function(h) {
         let g = h.v === u ? h.v : h.w, b = g === h.v ? h.w : h.v;
-        d({ v: g, w: b });
+        a({ v: g, w: b });
       });
     });
   };
@@ -270,8 +270,8 @@ function mn(e, t, r, n) {
     o[u] = { distance: h, predecessor: "" };
   });
   let c = l.length;
-  for (let u = 1; u < c && (i = !1, s++, a(), !!i); u++) ;
-  if (s === c - 1 && (i = !1, a(), i)) throw new Error("The graph contains a negative weight cycle");
+  for (let u = 1; u < c && (i = !1, s++, d(), !!i); u++) ;
+  if (s === c - 1 && (i = !1, d(), i)) throw new Error("The graph contains a negative weight cycle");
   return o;
 }
 function wn(e) {
@@ -344,15 +344,15 @@ function xe(e, t, r, n) {
   return En(e, String(t), r || vn, n || o);
 }
 function En(e, t, r, n) {
-  let o = {}, i = new Ht(), s, l, d = function(a) {
-    let c = a.v !== s ? a.v : a.w, u = o[c], h = r(a), g = l.distance + h;
-    if (h < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + a + " Weight: " + h);
+  let o = {}, i = new Ht(), s, l, a = function(d) {
+    let c = d.v !== s ? d.v : d.w, u = o[c], h = r(d), g = l.distance + h;
+    if (h < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + d + " Weight: " + h);
     g < u.distance && (u.distance = g, u.predecessor = s, i.decrease(c, g));
   };
-  for (e.nodes().forEach(function(a) {
-    let c = a === t ? 0 : Number.POSITIVE_INFINITY;
-    o[a] = { distance: c, predecessor: "" }, i.add(a, c);
-  }); i.size() > 0 && (s = i.removeMin(), l = o[s], l.distance !== Number.POSITIVE_INFINITY); ) n(s).forEach(d);
+  for (e.nodes().forEach(function(d) {
+    let c = d === t ? 0 : Number.POSITIVE_INFINITY;
+    o[d] = { distance: c, predecessor: "" }, i.add(d, c);
+  }); i.size() > 0 && (s = i.removeMin(), l = o[s], l.distance !== Number.POSITIVE_INFINITY); ) n(s).forEach(a);
   return o;
 }
 function kn(e, t, r) {
@@ -364,14 +364,14 @@ function qt(e) {
   let t = 0, r = [], n = {}, o = [];
   function i(s) {
     let l = n[s] = { onStack: !0, lowlink: t, index: t++ };
-    if (r.push(s), e.successors(s).forEach(function(d) {
-      d in n ? n[d].onStack && (l.lowlink = Math.min(l.lowlink, n[d].index)) : (i(d), l.lowlink = Math.min(l.lowlink, n[d].lowlink));
+    if (r.push(s), e.successors(s).forEach(function(a) {
+      a in n ? n[a].onStack && (l.lowlink = Math.min(l.lowlink, n[a].index)) : (i(a), l.lowlink = Math.min(l.lowlink, n[a].lowlink));
     }), l.lowlink === l.index) {
-      let d = [], a;
+      let a = [], d;
       do
-        a = r.pop(), n[a].onStack = !1, d.push(a);
-      while (s !== a);
-      o.push(d);
+        d = r.pop(), n[d].onStack = !1, a.push(d);
+      while (s !== d);
+      o.push(a);
     }
   }
   return e.nodes().forEach(function(s) {
@@ -395,15 +395,15 @@ function Nn(e, t, r) {
     n[i] = {}, n[i][i] = { distance: 0, predecessor: "" }, o.forEach(function(s) {
       i !== s && (n[i][s] = { distance: Number.POSITIVE_INFINITY, predecessor: "" });
     }), r(i).forEach(function(s) {
-      let l = s.v === i ? s.w : s.v, d = t(s);
-      n[i][l] = { distance: d, predecessor: i };
+      let l = s.v === i ? s.w : s.v, a = t(s);
+      n[i][l] = { distance: a, predecessor: i };
     });
   }), o.forEach(function(i) {
     let s = n[i];
     o.forEach(function(l) {
-      let d = n[l];
-      o.forEach(function(a) {
-        let c = d[i], u = s[a], h = d[a], g = c.distance + u.distance;
+      let a = n[l];
+      o.forEach(function(d) {
+        let c = a[i], u = s[d], h = a[d], g = c.distance + u.distance;
         g < h.distance && (h.distance = g, h.predecessor = u.predecessor);
       });
     });
@@ -435,8 +435,8 @@ function Cn(e) {
 function Sn(e, t, r, n, o) {
   Array.isArray(t) || (t = [t]);
   let i = (l) => {
-    var d;
-    return (d = e.isDirected() ? e.successors(l) : e.neighbors(l)) != null ? d : [];
+    var a;
+    return (a = e.isDirected() ? e.successors(l) : e.neighbors(l)) != null ? a : [];
   }, s = {};
   return t.forEach(function(l) {
     if (!e.hasNode(l)) throw new Error("Graph does not have node: " + l);
@@ -459,18 +459,18 @@ function In(e, t) {
 function On(e, t) {
   return Zt(e, t, "pre");
 }
-function jn(e, t) {
+function Mn(e, t) {
   let r = new G(), n = {}, o = new Ht(), i;
-  function s(d) {
-    let a = d.v === i ? d.w : d.v, c = o.priority(a);
+  function s(a) {
+    let d = a.v === i ? a.w : a.v, c = o.priority(d);
     if (c !== void 0) {
-      let u = t(d);
-      u < c && (n[a] = i, o.decrease(a, u));
+      let u = t(a);
+      u < c && (n[d] = i, o.decrease(d, u));
     }
   }
   if (e.nodeCount() === 0) return r;
-  e.nodes().forEach(function(d) {
-    o.add(d, Number.POSITIVE_INFINITY), r.setNode(d);
+  e.nodes().forEach(function(a) {
+    o.add(a, Number.POSITIVE_INFINITY), r.setNode(a);
   }), o.decrease(e.nodes()[0], 0);
   let l = !1;
   for (; o.size() > 0; ) {
@@ -483,7 +483,7 @@ function jn(e, t) {
   }
   return r;
 }
-function Mn(e, t, r, n) {
+function jn(e, t, r, n) {
   return Fn(e, t, r, n ?? ((o) => {
     let i = e.outEdges(o);
     return i ?? [];
@@ -494,8 +494,8 @@ function Fn(e, t, r, n) {
   let o = !1, i = e.nodes();
   for (let s = 0; s < i.length; s++) {
     let l = n(i[s]);
-    for (let d = 0; d < l.length; d++) {
-      let a = l[d], c = a.v === i[s] ? a.v : a.w, u = c === a.v ? a.w : a.v;
+    for (let a = 0; a < l.length; a++) {
+      let d = l[a], c = d.v === i[s] ? d.v : d.w, u = c === d.v ? d.w : d.v;
       r({ v: c, w: u }) < 0 && (o = !0);
     }
     if (o) return Vt(e, t, r, n);
@@ -525,8 +525,8 @@ function Qt(e) {
 function Et(e, t) {
   let r = e.x, n = e.y, o = t.x - r, i = t.y - n, s = e.width / 2, l = e.height / 2;
   if (!o && !i) throw new Error("Not possible to find intersection inside of the rectangle");
-  let d, a;
-  return Math.abs(i) * s > Math.abs(o) * l ? (i < 0 && (l = -l), d = l * o / i, a = l) : (o < 0 && (s = -s), d = s, a = s * i / o), { x: r + d, y: n + a };
+  let a, d;
+  return Math.abs(i) * s > Math.abs(o) * l ? (i < 0 && (l = -l), a = l * o / i, d = l) : (o < 0 && (s = -s), a = s, d = s * i / o), { x: r + a, y: n + d };
 }
 function ye(e) {
   let t = pe(tr(e) + 1).map(() => []);
@@ -535,7 +535,7 @@ function ye(e) {
     o !== void 0 && (t[o] || (t[o] = []), t[o][n.order] = r);
   }), t;
 }
-function Dn(e) {
+function Rn(e) {
   let t = e.nodes().map((n) => {
     let o = e.node(n).rank;
     return o === void 0 ? Number.MAX_VALUE : o;
@@ -545,7 +545,7 @@ function Dn(e) {
     Object.hasOwn(o, "rank") && (o.rank -= r);
   });
 }
-function Ln(e) {
+function Dn(e) {
   let t = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), r = K(Math.min, t), n = [];
   e.nodes().forEach((s) => {
     let l = e.node(s).rank - r;
@@ -553,14 +553,14 @@ function Ln(e) {
   });
   let o = 0, i = e.graph().nodeRankFactor;
   Array.from(n).forEach((s, l) => {
-    s === void 0 && l % i !== 0 ? --o : s !== void 0 && o && s.forEach((d) => e.node(d).rank += o);
+    s === void 0 && l % i !== 0 ? --o : s !== void 0 && o && s.forEach((a) => e.node(a).rank += o);
   });
 }
 function kt(e, t, r, n) {
   let o = { width: 0, height: 0 };
   return arguments.length >= 4 && (o.rank = r, o.order = n), fe(e, "border", o, t);
 }
-function Rn(e, t = er) {
+function Ln(e, t = er) {
   let r = [];
   for (let n = 0; n < e.length; n += t) {
     let o = e.slice(n, n + t);
@@ -571,7 +571,7 @@ function Rn(e, t = er) {
 var er = 65535;
 function K(e, t) {
   if (t.length > er) {
-    let r = Rn(t);
+    let r = Ln(t);
     return e(...r.map((n) => e(...n)));
   } else return e(...t);
 }
@@ -626,7 +626,7 @@ function Bn(e, t) {
 }
 var Ce = "\0", Wn = "3.0.0", Gn = class {
   constructor() {
-    dn(this, "_sentinel");
+    an(this, "_sentinel");
     let e = {};
     e._next = e._prev = e, this._sentinel = e;
   }
@@ -663,7 +663,7 @@ function Vn(e, t, r) {
     for (; l = s.dequeue(); ) ze(e, t, r, l);
     for (; l = i.dequeue(); ) ze(e, t, r, l);
     if (e.nodeCount()) {
-      for (let d = t.length - 2; d > 0; --d) if (l = (n = t[d]) == null ? void 0 : n.dequeue(), l) {
+      for (let a = t.length - 2; a > 0; --a) if (l = (n = t[a]) == null ? void 0 : n.dequeue(), l) {
         o = o.concat(ze(e, t, r, l, !0) || []);
         break;
       }
@@ -674,11 +674,11 @@ function Vn(e, t, r) {
 function ze(e, t, r, n, o) {
   let i = [], s = o ? i : void 0;
   return (e.inEdges(n.v) || []).forEach((l) => {
-    let d = e.edge(l), a = e.node(l.v);
-    o && i.push({ v: l.v, w: l.w }), a.out -= d, Ge(t, r, a);
+    let a = e.edge(l), d = e.node(l.v);
+    o && i.push({ v: l.v, w: l.w }), d.out -= a, Ge(t, r, d);
   }), (e.outEdges(n.v) || []).forEach((l) => {
-    let d = e.edge(l), a = l.w, c = e.node(a);
-    c.in -= d, Ge(t, r, c);
+    let a = e.edge(l), d = l.w, c = e.node(d);
+    c.in -= a, Ge(t, r, c);
   }), e.removeNode(n.v), s;
 }
 function Hn(e, t) {
@@ -686,10 +686,10 @@ function Hn(e, t) {
   e.nodes().forEach((l) => {
     r.setNode(l, { v: l, in: 0, out: 0 });
   }), e.edges().forEach((l) => {
-    let d = r.edge(l.v, l.w) || 0, a = t(l), c = d + a;
+    let a = r.edge(l.v, l.w) || 0, d = t(l), c = a + d;
     r.setEdge(l.v, l.w, c);
     let u = r.node(l.v), h = r.node(l.w);
-    o = Math.max(o, u.out += a), n = Math.max(n, h.in += a);
+    o = Math.max(o, u.out += d), n = Math.max(n, h.in += d);
   });
   let i = qn(o + n + 3).map(() => new Yn()), s = n + 1;
   return r.nodes().forEach((l) => {
@@ -737,11 +737,11 @@ function Qn(e) {
   e.graph().dummyChains = [], e.edges().forEach((t) => eo(e, t));
 }
 function eo(e, t) {
-  let r = t.v, n = e.node(r).rank, o = t.w, i = e.node(o).rank, s = t.name, l = e.edge(t), d = l.labelRank;
+  let r = t.v, n = e.node(r).rank, o = t.w, i = e.node(o).rank, s = t.name, l = e.edge(t), a = l.labelRank;
   if (i === n + 1) return;
   e.removeEdge(t);
-  let a, c, u;
-  for (u = 0, ++n; n < i; ++u, ++n) l.points = [], c = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: n }, a = fe(e, "edge", c, "_d"), n === d && (c.width = l.width, c.height = l.height, c.dummy = "edge-label", c.labelpos = l.labelpos), e.setEdge(r, a, { weight: l.weight }, s), u === 0 && e.graph().dummyChains.push(a), r = a;
+  let d, c, u;
+  for (u = 0, ++n; n < i; ++u, ++n) l.points = [], c = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: n }, d = fe(e, "edge", c, "_d"), n === a && (c.width = l.width, c.height = l.height, c.dummy = "edge-label", c.labelpos = l.labelpos), e.setEdge(r, d, { weight: l.weight }, s), u === 0 && e.graph().dummyChains.push(d), r = d;
   e.setEdge(r, o, { weight: l.weight }, s);
 }
 function to(e) {
@@ -756,7 +756,7 @@ function qe(e) {
     let o = e.node(n);
     if (Object.hasOwn(t, n)) return o.rank;
     t[n] = !0;
-    let i = e.outEdges(n), s = i ? i.map((d) => d == null ? Number.POSITIVE_INFINITY : r(d.w) - e.edge(d).minlen) : [], l = K(Math.min, s);
+    let i = e.outEdges(n), s = i ? i.map((a) => a == null ? Number.POSITIVE_INFINITY : r(a.w) - e.edge(a).minlen) : [], l = K(Math.min, s);
     return l === Number.POSITIVE_INFINITY && (l = 0), o.rank = l;
   }
   e.sources().forEach(r);
@@ -798,14 +798,14 @@ se.initLowLimValues = Je;
 se.initCutValues = Xe;
 se.calcCutValue = ir;
 se.leaveEdge = lr;
-se.enterEdge = ar;
-se.exchangeEdges = dr;
+se.enterEdge = dr;
+se.exchangeEdges = ar;
 function se(e) {
   e = zn(e), qe(e);
   let t = or(e);
   Je(t), Xe(t, e);
   let r, n;
-  for (; r = lr(t); ) n = ar(t, e, r), dr(t, e, r, n);
+  for (; r = lr(t); ) n = dr(t, e, r), ar(t, e, r, n);
 }
 function Xe(e, t) {
   let r = lo(e, e.nodes());
@@ -819,10 +819,10 @@ function ir(e, t, r) {
   let n = e.node(r).parent, o = !0, i = t.edge(r, n), s = 0;
   i || (o = !1, i = t.edge(n, r)), s = i.weight;
   let l = t.nodeEdges(r);
-  return l && l.forEach((d) => {
-    let a = d.v === r, c = a ? d.w : d.v;
+  return l && l.forEach((a) => {
+    let d = a.v === r, c = d ? a.w : a.v;
     if (c !== n) {
-      let u = a === o, h = t.edge(d).weight;
+      let u = d === o, h = t.edge(a).weight;
       if (s += u ? h : -h, fo(e, r, c)) {
         let g = e.edge(r, c).cutvalue;
         s += u ? -g : g;
@@ -837,20 +837,20 @@ function sr(e, t, r, n, o) {
   let i = r, s = e.node(n);
   t[n] = !0;
   let l = e.neighbors(n);
-  return l && l.forEach((d) => {
-    Object.hasOwn(t, d) || (r = sr(e, t, r, d, n));
+  return l && l.forEach((a) => {
+    Object.hasOwn(t, a) || (r = sr(e, t, r, a, n));
   }), s.low = i, s.lim = r++, o ? s.parent = o : delete s.parent, r;
 }
 function lr(e) {
   return e.edges().find((t) => e.edge(t).cutvalue < 0);
 }
-function ar(e, t, r) {
+function dr(e, t, r) {
   let n = r.v, o = r.w;
   t.hasEdge(n, o) || (n = r.w, o = r.v);
-  let i = e.node(n), s = e.node(o), l = i, d = !1;
-  return i.lim > s.lim && (l = s, d = !0), t.edges().filter((a) => d === _t(e, e.node(a.v), l) && d !== _t(e, e.node(a.w), l)).reduce((a, c) => ue(t, c) < ue(t, a) ? c : a);
+  let i = e.node(n), s = e.node(o), l = i, a = !1;
+  return i.lim > s.lim && (l = s, a = !0), t.edges().filter((d) => a === _t(e, e.node(d.v), l) && a !== _t(e, e.node(d.w), l)).reduce((d, c) => ue(t, c) < ue(t, d) ? c : d);
 }
-function dr(e, t, r, n) {
+function ar(e, t, r, n) {
   let o = r.v, i = r.w;
   e.removeEdge(o, i), e.setEdge(n.v, n.w, {}), Je(e), Xe(e, t), uo(e, t);
 }
@@ -900,29 +900,29 @@ var yo = mo;
 function mo(e) {
   let t = vo(e);
   e.graph().dummyChains.forEach((r) => {
-    let n = e.node(r), o = n.edgeObj, i = wo(e, t, o.v, o.w), s = i.path, l = i.lca, d = 0, a = s[d], c = !0;
+    let n = e.node(r), o = n.edgeObj, i = wo(e, t, o.v, o.w), s = i.path, l = i.lca, a = 0, d = s[a], c = !0;
     for (; r !== o.w; ) {
       if (n = e.node(r), c) {
-        for (; (a = s[d]) !== l && e.node(a).maxRank < n.rank; ) d++;
-        a === l && (c = !1);
+        for (; (d = s[a]) !== l && e.node(d).maxRank < n.rank; ) a++;
+        d === l && (c = !1);
       }
       if (!c) {
-        for (; d < s.length - 1 && e.node(s[d + 1]).minRank <= n.rank; ) d++;
-        a = s[d];
+        for (; a < s.length - 1 && e.node(s[a + 1]).minRank <= n.rank; ) a++;
+        d = s[a];
       }
-      a !== void 0 && e.setParent(r, a), r = e.successors(r)[0];
+      d !== void 0 && e.setParent(r, d), r = e.successors(r)[0];
     }
   });
 }
 function wo(e, t, r, n) {
-  let o = [], i = [], s = Math.min(t[r].low, t[n].low), l = Math.max(t[r].lim, t[n].lim), d;
-  d = r;
+  let o = [], i = [], s = Math.min(t[r].low, t[n].low), l = Math.max(t[r].lim, t[n].lim), a;
+  a = r;
   do
-    d = e.parent(d), o.push(d);
-  while (d && (t[d].low > s || l > t[d].lim));
-  let a = d, c = n;
-  for (; (c = e.parent(c)) !== a; ) i.push(c);
-  return { path: o.concat(i.reverse()), lca: a };
+    a = e.parent(a), o.push(a);
+  while (a && (t[a].low > s || l > t[a].lim));
+  let d = a, c = n;
+  for (; (c = e.parent(c)) !== d; ) i.push(c);
+  return { path: o.concat(i.reverse()), lca: d };
 }
 function vo(e) {
   let t = {}, r = 0;
@@ -940,18 +940,18 @@ function Eo(e) {
 }
 function cr(e, t, r, n, o, i, s) {
   var l;
-  let d = e.children(s);
-  if (!d.length) {
+  let a = e.children(s);
+  if (!a.length) {
     s !== t && e.setEdge(t, s, { weight: 0, minlen: r });
     return;
   }
-  let a = kt(e, "_bt"), c = kt(e, "_bb"), u = e.node(s);
-  e.setParent(a, s), u.borderTop = a, e.setParent(c, s), u.borderBottom = c, d.forEach((h) => {
+  let d = kt(e, "_bt"), c = kt(e, "_bb"), u = e.node(s);
+  e.setParent(d, s), u.borderTop = d, e.setParent(c, s), u.borderBottom = c, a.forEach((h) => {
     var g;
     cr(e, t, r, n, o, i, h);
     let b = e.node(h), y = b.borderTop ? b.borderTop : h, p = b.borderBottom ? b.borderBottom : h, v = b.borderTop ? n : 2 * n, N = y !== p ? 1 : o - ((g = i[s]) != null ? g : 0) + 1;
-    e.setEdge(a, y, { weight: v, minlen: N, nestingEdge: !0 }), e.setEdge(p, c, { weight: v, minlen: N, nestingEdge: !0 });
-  }), e.parent(s) || e.setEdge(t, a, { weight: 0, minlen: o + ((l = i[s]) != null ? l : 0) });
+    e.setEdge(d, y, { weight: v, minlen: N, nestingEdge: !0 }), e.setEdge(p, c, { weight: v, minlen: N, nestingEdge: !0 });
+  }), e.parent(s) || e.setEdge(t, d, { weight: 0, minlen: o + ((l = i[s]) != null ? l : 0) });
 }
 function ko(e) {
   let t = {};
@@ -982,8 +982,8 @@ function No(e) {
   e.children(Ce).forEach(t);
 }
 function Nt(e, t, r, n, o, i) {
-  let s = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], d = fe(e, "border", s, r);
-  o[t][i] = d, e.setParent(d, n), l && e.setEdge(l, d, { weight: 1 });
+  let s = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], a = fe(e, "border", s, r);
+  o[t][i] = a, e.setParent(a, n), l && e.setEdge(l, a, { weight: 1 });
 }
 function Co(e) {
   var t;
@@ -1003,59 +1003,59 @@ function Ct(e) {
   e.width = e.height, e.height = t;
 }
 function Io(e) {
-  e.nodes().forEach((t) => De(e.node(t))), e.edges().forEach((t) => {
+  e.nodes().forEach((t) => Re(e.node(t))), e.edges().forEach((t) => {
     var r;
     let n = e.edge(t);
-    (r = n.points) == null || r.forEach(De), Object.hasOwn(n, "y") && De(n);
+    (r = n.points) == null || r.forEach(Re), Object.hasOwn(n, "y") && Re(n);
   });
 }
-function De(e) {
+function Re(e) {
   e.y = -e.y;
 }
 function Oo(e) {
-  e.nodes().forEach((t) => Le(e.node(t))), e.edges().forEach((t) => {
+  e.nodes().forEach((t) => De(e.node(t))), e.edges().forEach((t) => {
     var r;
     let n = e.edge(t);
-    (r = n.points) == null || r.forEach(Le), Object.hasOwn(n, "x") && Le(n);
+    (r = n.points) == null || r.forEach(De), Object.hasOwn(n, "x") && De(n);
   });
 }
-function Le(e) {
+function De(e) {
   let t = e.x;
   e.x = e.y, e.y = t;
 }
-function jo(e) {
+function Mo(e) {
   let t = {}, r = e.nodes().filter((l) => !e.children(l).length), n = r.map((l) => e.node(l).rank), o = K(Math.max, n), i = pe(o + 1).map(() => []);
   function s(l) {
     if (t[l]) return;
     t[l] = !0;
-    let d = e.node(l);
-    i[d.rank].push(l);
-    let a = e.successors(l);
-    a && a.forEach(s);
+    let a = e.node(l);
+    i[a.rank].push(l);
+    let d = e.successors(l);
+    d && d.forEach(s);
   }
-  return r.sort((l, d) => e.node(l).rank - e.node(d).rank).forEach(s), i;
+  return r.sort((l, a) => e.node(l).rank - e.node(a).rank).forEach(s), i;
 }
-function Mo(e, t) {
+function jo(e, t) {
   let r = 0;
   for (let n = 1; n < t.length; ++n) r += Fo(e, t[n - 1], t[n]);
   return r;
 }
 function Fo(e, t, r) {
-  let n = Bn(r, r.map((a, c) => c)), o = t.flatMap((a) => {
-    let c = e.outEdges(a);
+  let n = Bn(r, r.map((d, c) => c)), o = t.flatMap((d) => {
+    let c = e.outEdges(d);
     return c ? c.map((u) => ({ pos: n[u.w], weight: e.edge(u).weight })).sort((u, h) => u.pos - h.pos) : [];
   }), i = 1;
   for (; i < r.length; ) i <<= 1;
   let s = 2 * i - 1;
   i -= 1;
-  let l = new Array(s).fill(0), d = 0;
-  return o.forEach((a) => {
-    let c = a.pos + i;
-    l[c] += a.weight;
+  let l = new Array(s).fill(0), a = 0;
+  return o.forEach((d) => {
+    let c = d.pos + i;
+    l[c] += d.weight;
     let u = 0;
-    for (; c > 0; ) c % 2 && (u += l[c + 1]), c = c - 1 >> 1, l[c] += a.weight;
-    d += a.weight * u;
-  }), d;
+    for (; c > 0; ) c % 2 && (u += l[c + 1]), c = c - 1 >> 1, l[c] += d.weight;
+    a += d.weight * u;
+  }), a;
 }
 function zo(e, t = []) {
   return t.map((r) => {
@@ -1063,14 +1063,14 @@ function zo(e, t = []) {
     if (!n || !n.length) return { v: r };
     {
       let o = n.reduce((i, s) => {
-        let l = e.edge(s), d = e.node(s.v);
-        return { sum: i.sum + l.weight * d.order, weight: i.weight + l.weight };
+        let l = e.edge(s), a = e.node(s.v);
+        return { sum: i.sum + l.weight * a.order, weight: i.weight + l.weight };
       }, { sum: 0, weight: 0 });
       return { v: r, barycenter: o.sum / o.weight, weight: o.weight };
     }
   });
 }
-function Do(e, t) {
+function Ro(e, t) {
   let r = {};
   e.forEach((o, i) => {
     let s = { indegree: 0, in: [], out: [], vs: [o.v], i };
@@ -1080,13 +1080,13 @@ function Do(e, t) {
     i !== void 0 && s !== void 0 && (s.indegree++, i.out.push(s));
   });
   let n = Object.values(r).filter((o) => !o.indegree);
-  return Lo(n);
+  return Do(n);
 }
-function Lo(e) {
+function Do(e) {
   let t = [];
   function r(o) {
     return (i) => {
-      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Ro(o, i);
+      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Lo(o, i);
     };
   }
   function n(o) {
@@ -1100,17 +1100,17 @@ function Lo(e) {
   }
   return t.filter((o) => !o.merged).map((o) => Te(o, ["vs", "i", "barycenter", "weight"]));
 }
-function Ro(e, t) {
+function Lo(e, t) {
   let r = 0, n = 0;
   e.weight && (r += e.barycenter * e.weight, n += e.weight), t.weight && (r += t.barycenter * t.weight, n += t.weight), e.vs = t.vs.concat(e.vs), e.barycenter = r / n, e.weight = n, e.i = Math.min(t.i, e.i), t.merged = !0;
 }
 function Ao(e, t) {
-  let r = An(e, (c) => Object.hasOwn(c, "barycenter")), n = r.lhs, o = r.rhs.sort((c, u) => u.i - c.i), i = [], s = 0, l = 0, d = 0;
-  n.sort(Po(!!t)), d = St(i, o, d), n.forEach((c) => {
-    d += c.vs.length, i.push(c.vs), s += c.barycenter * c.weight, l += c.weight, d = St(i, o, d);
+  let r = An(e, (c) => Object.hasOwn(c, "barycenter")), n = r.lhs, o = r.rhs.sort((c, u) => u.i - c.i), i = [], s = 0, l = 0, a = 0;
+  n.sort(Po(!!t)), a = St(i, o, a), n.forEach((c) => {
+    a += c.vs.length, i.push(c.vs), s += c.barycenter * c.weight, l += c.weight, a = St(i, o, a);
   });
-  let a = { vs: i.flat(1) };
-  return l && (a.barycenter = s / l, a.weight = l), a;
+  let d = { vs: i.flat(1) };
+  return l && (d.barycenter = s / l, d.weight = l), d;
 }
 function St(e, t, r) {
   let n;
@@ -1121,17 +1121,17 @@ function Po(e) {
   return (t, r) => t.barycenter < r.barycenter ? -1 : t.barycenter > r.barycenter ? 1 : e ? r.i - t.i : t.i - r.i;
 }
 function fr(e, t, r, n) {
-  let o = e.children(t), i = e.node(t), s = i ? i.borderLeft : void 0, l = i ? i.borderRight : void 0, d = {};
+  let o = e.children(t), i = e.node(t), s = i ? i.borderLeft : void 0, l = i ? i.borderRight : void 0, a = {};
   s && (o = o.filter((h) => h !== s && h !== l));
-  let a = zo(e, o);
-  a.forEach((h) => {
+  let d = zo(e, o);
+  d.forEach((h) => {
     if (e.children(h.v).length) {
       let g = fr(e, h.v, r, n);
-      d[h.v] = g, Object.hasOwn(g, "barycenter") && Wo(h, g);
+      a[h.v] = g, Object.hasOwn(g, "barycenter") && Wo(h, g);
     }
   });
-  let c = Do(a, r);
-  Bo(c, d);
+  let c = Ro(d, r);
+  Bo(c, a);
   let u = Ao(c, n);
   if (s && l) {
     u.vs = [s, u.vs, l].flat(1);
@@ -1155,11 +1155,11 @@ function Go(e, t, r, n) {
   n || (n = e.nodes());
   let o = $o(e), i = new G({ compound: !0 }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
   return n.forEach((s) => {
-    let l = e.node(s), d = e.parent(s);
+    let l = e.node(s), a = e.parent(s);
     if (l.rank === t || l.minRank <= t && t <= l.maxRank) {
-      i.setNode(s), i.setParent(s, d || o);
-      let a = e[r](s);
-      a && a.forEach((c) => {
+      i.setNode(s), i.setParent(s, a || o);
+      let d = e[r](s);
+      d && d.forEach((c) => {
         let u = c.v === s ? c.w : c.v, h = i.edge(u, s), g = h !== void 0 ? h.weight : 0;
         i.setEdge(u, s, { weight: e.edge(c).weight + g });
       }), Object.hasOwn(l, "minRank") && i.setNode(s, { borderLeft: l.borderLeft[t], borderRight: l.borderRight[t] });
@@ -1174,10 +1174,10 @@ function $o(e) {
 function Yo(e, t, r) {
   let n = {}, o;
   r.forEach((i) => {
-    let s = e.parent(i), l, d;
+    let s = e.parent(i), l, a;
     for (; s; ) {
-      if (l = e.parent(s), l ? (d = n[l], n[l] = s) : (d = o, o = s), d && d !== s) {
-        t.setEdge(d, s);
+      if (l = e.parent(s), l ? (a = n[l], n[l] = s) : (a = o, o = s), a && a !== s) {
+        t.setEdge(a, s);
         return;
       }
       s = l;
@@ -1189,12 +1189,12 @@ function hr(e, t = {}) {
     t.customOrder(e, hr);
     return;
   }
-  let r = tr(e), n = It(e, pe(1, r + 1), "inEdges"), o = It(e, pe(r - 1, -1, -1), "outEdges"), i = jo(e);
+  let r = tr(e), n = It(e, pe(1, r + 1), "inEdges"), o = It(e, pe(r - 1, -1, -1), "outEdges"), i = Mo(e);
   if (Ot(e, i), t.disableOptimalOrderHeuristic) return;
-  let s = Number.POSITIVE_INFINITY, l, d = t.constraints || [];
-  for (let a = 0, c = 0; c < 4; ++a, ++c) {
-    Ko(a % 2 ? n : o, a % 4 >= 2, d), i = ye(e);
-    let u = Mo(e, i);
+  let s = Number.POSITIVE_INFINITY, l, a = t.constraints || [];
+  for (let d = 0, c = 0; c < 4; ++d, ++c) {
+    Ko(d % 2 ? n : o, d % 4 >= 2, a), i = ye(e);
+    let u = jo(e, i);
     u < s ? (c = 0, l = Object.assign({}, i), s = u) : u === s && (l = structuredClone(i));
   }
   Ot(e, l);
@@ -1216,7 +1216,7 @@ function Ko(e, t, r) {
   e.forEach(function(o) {
     r.forEach((l) => n.setEdge(l.left, l.right));
     let i = o.graph().root, s = fr(o, i, n, t);
-    s.vs.forEach((l, d) => o.node(l).order = d), Yo(o, n, s.vs);
+    s.vs.forEach((l, a) => o.node(l).order = a), Yo(o, n, s.vs);
   });
 }
 function Ot(e, t) {
@@ -1225,10 +1225,10 @@ function Ot(e, t) {
 function Uo(e, t) {
   let r = {};
   function n(o, i) {
-    let s = 0, l = 0, d = o.length, a = i[i.length - 1];
+    let s = 0, l = 0, a = o.length, d = i[i.length - 1];
     return i.forEach((c, u) => {
-      let h = Ho(e, c), g = h ? e.node(h).order : d;
-      (h || c === a) && (i.slice(l, u + 1).forEach((b) => {
+      let h = Ho(e, c), g = h ? e.node(h).order : a;
+      (h || c === d) && (i.slice(l, u + 1).forEach((b) => {
         let y = e.predecessors(b);
         y && y.forEach((p) => {
           let v = e.node(p), N = v.order;
@@ -1241,7 +1241,7 @@ function Uo(e, t) {
 }
 function Vo(e, t) {
   let r = {};
-  function n(i, s, l, d, a) {
+  function n(i, s, l, a, d) {
     pe(s, l).forEach((c) => {
       let u = i[c];
       if (u !== void 0 && e.node(u).dummy) {
@@ -1249,23 +1249,23 @@ function Vo(e, t) {
         h && h.forEach((g) => {
           if (g === void 0) return;
           let b = e.node(g);
-          b.dummy && (b.order < d || b.order > a) && gr(r, g, u);
+          b.dummy && (b.order < a || b.order > d) && gr(r, g, u);
         });
       }
     });
   }
   function o(i, s) {
-    let l = -1, d = -1, a = 0;
+    let l = -1, a = -1, d = 0;
     return s.forEach((c, u) => {
       if (e.node(c).dummy === "border") {
         let h = e.predecessors(c);
         if (h && h.length) {
           let g = h[0];
           if (g === void 0) return;
-          d = e.node(g).order, n(s, a, u, l, d), a = u, l = d;
+          a = e.node(g).order, n(s, d, u, l, a), d = u, l = a;
         }
       }
-      n(s, a, s.length, d, i.length);
+      n(s, d, s.length, a, i.length);
     }), s;
   }
   return t.length && t.reduce(o), r;
@@ -1295,13 +1295,13 @@ function qo(e, t, r) {
 function Xo(e, t, r, n) {
   let o = {}, i = {}, s = {};
   return t.forEach((l) => {
-    l.forEach((d, a) => {
-      o[d] = d, i[d] = d, s[d] = a;
+    l.forEach((a, d) => {
+      o[a] = a, i[a] = a, s[a] = d;
     });
   }), t.forEach((l) => {
-    let d = -1;
-    l.forEach((a) => {
-      let c = n(a);
+    let a = -1;
+    l.forEach((d) => {
+      let c = n(d);
       if (c && c.length) {
         let u = c.sort((g, b) => {
           let y = s[g], p = s[b];
@@ -1311,9 +1311,9 @@ function Xo(e, t, r, n) {
           let y = u[g];
           if (y === void 0) continue;
           let p = s[y];
-          if (p !== void 0 && i[a] === a && d < p && !qo(r, a, y)) {
+          if (p !== void 0 && i[d] === d && a < p && !qo(r, d, y)) {
             let v = o[y];
-            v !== void 0 && (i[y] = a, i[a] = o[a] = v, d = p);
+            v !== void 0 && (i[y] = d, i[d] = o[d] = v, a = p);
           }
         }
       }
@@ -1322,7 +1322,7 @@ function Xo(e, t, r, n) {
 }
 function Jo(e, t, r, n, o = !1) {
   let i = {}, s = Zo(e, t, r, o), l = o ? "borderLeft" : "borderRight";
-  function d(g, b) {
+  function a(g, b) {
     let y = s.nodes().slice(), p = {}, v = y.pop();
     for (; v; ) {
       if (p[v]) g(v);
@@ -1333,7 +1333,7 @@ function Jo(e, t, r, n, o = !1) {
       v = y.pop();
     }
   }
-  function a(g) {
+  function d(g) {
     let b = s.inEdges(g);
     b ? i[g] = b.reduce((y, p) => {
       var v;
@@ -1344,8 +1344,8 @@ function Jo(e, t, r, n, o = !1) {
   function c(g) {
     let b = s.outEdges(g), y = Number.POSITIVE_INFINITY;
     b && (y = b.reduce((v, N) => {
-      let O = i[N.w], j = s.edge(N);
-      return Math.min(v, (O !== void 0 ? O : 0) - (j !== void 0 ? j : 0));
+      let O = i[N.w], M = s.edge(N);
+      return Math.min(v, (O !== void 0 ? O : 0) - (M !== void 0 ? M : 0));
     }, Number.POSITIVE_INFINITY));
     let p = e.node(g);
     y !== Number.POSITIVE_INFINITY && p.borderType !== l && (i[g] = Math.max(i[g] !== void 0 ? i[g] : 0, y));
@@ -1356,7 +1356,7 @@ function Jo(e, t, r, n, o = !1) {
   function h(g) {
     return s.successors(g) || [];
   }
-  return d(a, u), d(c, h), Object.keys(n).forEach((g) => {
+  return a(d, u), a(c, h), Object.keys(n).forEach((g) => {
     var b;
     let y = r[g];
     y !== void 0 && (i[g] = (b = i[y]) != null ? b : 0);
@@ -1365,18 +1365,18 @@ function Jo(e, t, r, n, o = !1) {
 function Zo(e, t, r, n) {
   let o = new G(), i = e.graph(), s = ni(i.nodesep, i.edgesep, n);
   return t.forEach((l) => {
-    let d;
-    l.forEach((a) => {
-      let c = r[a];
+    let a;
+    l.forEach((d) => {
+      let c = r[d];
       if (c !== void 0) {
-        if (o.setNode(c), d !== void 0) {
-          let u = r[d];
+        if (o.setNode(c), a !== void 0) {
+          let u = r[a];
           if (u !== void 0) {
             let h = o.edge(u, c);
-            o.setEdge(u, c, Math.max(s(e, a, d), h || 0));
+            o.setEdge(u, c, Math.max(s(e, d, a), h || 0));
           }
         }
-        d = a;
+        a = d;
       }
     });
   }), o;
@@ -1384,9 +1384,9 @@ function Zo(e, t, r, n) {
 function Qo(e, t) {
   return Object.values(t).reduce((r, n) => {
     let o = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
-    Object.entries(n).forEach(([l, d]) => {
-      let a = oi(e, l) / 2;
-      o = Math.max(d + a, o), i = Math.min(d - a, i);
+    Object.entries(n).forEach(([l, a]) => {
+      let d = oi(e, l) / 2;
+      o = Math.max(a + d, o), i = Math.min(a - d, i);
     });
     let s = o - i;
     return s < r[0] && (r = [s, n]), r;
@@ -1396,10 +1396,10 @@ function ei(e, t) {
   let r = Object.values(t), n = K(Math.min, r), o = K(Math.max, r);
   ["u", "d"].forEach((i) => {
     ["l", "r"].forEach((s) => {
-      let l = i + s, d = e[l];
-      if (!d || d === t) return;
-      let a = Object.values(d), c = n - K(Math.min, a);
-      s !== "l" && (c = o - K(Math.max, a)), c && (e[l] = Ne(d, (u) => u + c));
+      let l = i + s, a = e[l];
+      if (!a || a === t) return;
+      let d = Object.values(a), c = n - K(Math.min, d);
+      s !== "l" && (c = o - K(Math.max, d)), c && (e[l] = Ne(a, (u) => u + c));
     });
   });
 }
@@ -1408,13 +1408,13 @@ function ti(e, t = void 0) {
   return r ? Ne(r, (n, o) => {
     var i, s;
     if (t) {
-      let d = t.toLowerCase(), a = e[d];
-      if (a && a[o] !== void 0) return a[o];
+      let a = t.toLowerCase(), d = e[a];
+      if (d && d[o] !== void 0) return d[o];
     }
-    let l = Object.values(e).map((d) => {
-      let a = d[o];
-      return a !== void 0 ? a : 0;
-    }).sort((d, a) => d - a);
+    let l = Object.values(e).map((a) => {
+      let d = a[o];
+      return d !== void 0 ? d : 0;
+    }).sort((a, d) => a - d);
     return (((i = l[1]) != null ? i : 0) + ((s = l[2]) != null ? s : 0)) / 2;
   }) : {};
 }
@@ -1423,8 +1423,8 @@ function ri(e) {
   ["u", "d"].forEach((s) => {
     o = s === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((l) => {
       l === "r" && (o = o.map((c) => Object.values(c).reverse()));
-      let d = Xo(e, o, r, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), a = Jo(e, o, d.root, d.align, l === "r");
-      l === "r" && (a = Ne(a, (c) => -c)), n[s + l] = a;
+      let a = Xo(e, o, r, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), d = Jo(e, o, a.root, a.align, l === "r");
+      l === "r" && (d = Ne(d, (c) => -c)), n[s + l] = d;
     });
   });
   let i = Qo(e, n);
@@ -1432,24 +1432,24 @@ function ri(e) {
 }
 function ni(e, t, r) {
   return (n, o, i) => {
-    let s = n.node(o), l = n.node(i), d = 0, a;
-    if (d += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
+    let s = n.node(o), l = n.node(i), a = 0, d;
+    if (a += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
       case "l":
-        a = -s.width / 2;
+        d = -s.width / 2;
         break;
       case "r":
-        a = s.width / 2;
+        d = s.width / 2;
         break;
     }
-    if (a && (d += r ? a : -a), a = void 0, d += (s.dummy ? t : e) / 2, d += (l.dummy ? t : e) / 2, d += l.width / 2, Object.hasOwn(l, "labelpos")) switch (l.labelpos.toLowerCase()) {
+    if (d && (a += r ? d : -d), d = void 0, a += (s.dummy ? t : e) / 2, a += (l.dummy ? t : e) / 2, a += l.width / 2, Object.hasOwn(l, "labelpos")) switch (l.labelpos.toLowerCase()) {
       case "l":
-        a = l.width / 2;
+        d = l.width / 2;
         break;
       case "r":
-        a = -l.width / 2;
+        d = -l.width / 2;
         break;
     }
-    return a && (d += r ? a : -a), d;
+    return d && (a += r ? d : -d), a;
   };
 }
 function oi(e, t) {
@@ -1461,14 +1461,14 @@ function ii(e) {
 function si(e) {
   let t = ye(e), r = e.graph(), n = r.ranksep, o = r.rankalign, i = 0;
   t.forEach((s) => {
-    let l = s.reduce((d, a) => {
+    let l = s.reduce((a, d) => {
       var c;
-      let u = (c = e.node(a).height) != null ? c : 0;
-      return d > u ? d : u;
+      let u = (c = e.node(d).height) != null ? c : 0;
+      return a > u ? a : u;
     }, 0);
-    s.forEach((d) => {
-      let a = e.node(d);
-      o === "top" ? a.y = i + a.height / 2 : o === "bottom" ? a.y = i + l - a.height / 2 : a.y = i + l / 2;
+    s.forEach((a) => {
+      let d = e.node(a);
+      o === "top" ? d.y = i + d.height / 2 : o === "bottom" ? d.y = i + l - d.height / 2 : d.y = i + l / 2;
     }), i += l + n;
   });
 }
@@ -1476,13 +1476,13 @@ function li(e, t = {}) {
   let r = t.debugTiming ? rr : nr;
   return r("layout", () => {
     let n = r("  buildLayoutGraph", () => yi(e));
-    return r("  runLayout", () => ai(n, r, t)), r("  updateInputGraph", () => di(e, n)), n;
+    return r("  runLayout", () => di(n, r, t)), r("  updateInputGraph", () => ai(e, n)), n;
   });
 }
-function ai(e, t, r) {
-  t("    makeSpaceForEdgeLabels", () => mi(e)), t("    removeSelfEdges", () => Ci(e)), t("    acyclic", () => Xn(e)), t("    nestingGraph.run", () => Eo(e)), t("    rank", () => ho(Qt(e))), t("    injectEdgeLabelProxies", () => wi(e)), t("    removeEmptyRanks", () => Ln(e)), t("    nestingGraph.cleanup", () => _o(e)), t("    normalizeRanks", () => Dn(e)), t("    assignRankMinMax", () => vi(e)), t("    removeEdgeLabelProxies", () => Ei(e)), t("    normalize.run", () => Qn(e)), t("    parentDummyChains", () => yo(e)), t("    addBorderSegments", () => To(e)), t("    order", () => hr(e, r)), t("    insertSelfEdges", () => Si(e)), t("    adjustCoordinateSystem", () => Co(e)), t("    position", () => ii(e)), t("    positionSelfEdges", () => Ii(e)), t("    removeBorderNodes", () => Ni(e)), t("    normalize.undo", () => to(e)), t("    fixupEdgeLabelCoords", () => _i(e)), t("    undoCoordinateSystem", () => So(e)), t("    translateGraph", () => ki(e)), t("    assignNodeIntersects", () => xi(e)), t("    reversePoints", () => Ti(e)), t("    acyclic.undo", () => Zn(e));
+function di(e, t, r) {
+  t("    makeSpaceForEdgeLabels", () => mi(e)), t("    removeSelfEdges", () => Ci(e)), t("    acyclic", () => Xn(e)), t("    nestingGraph.run", () => Eo(e)), t("    rank", () => ho(Qt(e))), t("    injectEdgeLabelProxies", () => wi(e)), t("    removeEmptyRanks", () => Dn(e)), t("    nestingGraph.cleanup", () => _o(e)), t("    normalizeRanks", () => Rn(e)), t("    assignRankMinMax", () => vi(e)), t("    removeEdgeLabelProxies", () => Ei(e)), t("    normalize.run", () => Qn(e)), t("    parentDummyChains", () => yo(e)), t("    addBorderSegments", () => To(e)), t("    order", () => hr(e, r)), t("    insertSelfEdges", () => Si(e)), t("    adjustCoordinateSystem", () => Co(e)), t("    position", () => ii(e)), t("    positionSelfEdges", () => Ii(e)), t("    removeBorderNodes", () => Ni(e)), t("    normalize.undo", () => to(e)), t("    fixupEdgeLabelCoords", () => _i(e)), t("    undoCoordinateSystem", () => So(e)), t("    translateGraph", () => ki(e)), t("    assignNodeIntersects", () => xi(e)), t("    reversePoints", () => Ti(e)), t("    acyclic.undo", () => Zn(e));
 }
-function di(e, t) {
+function ai(e, t) {
   e.nodes().forEach((r) => {
     let n = e.node(r), o = t.node(r);
     n && (n.x = o.x, n.y = o.y, n.order = o.order, n.rank = o.rank, t.children(r).length && (n.width = o.width, n.height = o.height));
@@ -1491,19 +1491,19 @@ function di(e, t) {
     n.points = o.points, Object.hasOwn(o, "x") && (n.x = o.x, n.y = o.y);
   }), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
 }
-var ci = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], ui = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, fi = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], hi = ["width", "height", "rank"], jt = { width: 0, height: 0 }, gi = ["minlen", "weight", "width", "height", "labeloffset"], pi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, bi = ["labelpos"];
+var ci = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], ui = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, fi = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], hi = ["width", "height", "rank"], Mt = { width: 0, height: 0 }, gi = ["minlen", "weight", "width", "height", "labeloffset"], pi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, bi = ["labelpos"];
 function yi(e) {
   let t = new G({ multigraph: !0, compound: !0 }), r = Ae(e.graph());
-  return t.setGraph(Object.assign({}, ui, Re(r, ci), Te(r, fi))), e.nodes().forEach((n) => {
-    let o = Ae(e.node(n)), i = Re(o, hi);
-    Object.keys(jt).forEach((l) => {
-      i[l] === void 0 && (i[l] = jt[l]);
+  return t.setGraph(Object.assign({}, ui, Le(r, ci), Te(r, fi))), e.nodes().forEach((n) => {
+    let o = Ae(e.node(n)), i = Le(o, hi);
+    Object.keys(Mt).forEach((l) => {
+      i[l] === void 0 && (i[l] = Mt[l]);
     }), t.setNode(n, i);
     let s = e.parent(n);
     s !== void 0 && t.setParent(n, s);
   }), e.edges().forEach((n) => {
     let o = Ae(e.edge(n));
-    t.setEdge(n, Object.assign({}, pi, Re(o, gi), Te(o, bi)));
+    t.setEdge(n, Object.assign({}, pi, Le(o, gi), Te(o, bi)));
   }), t;
 }
 function mi(e) {
@@ -1540,18 +1540,18 @@ function Ei(e) {
 }
 function ki(e) {
   let t = Number.POSITIVE_INFINITY, r = 0, n = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), s = i.marginx || 0, l = i.marginy || 0;
-  function d(a) {
-    let c = a.x, u = a.y, h = a.width, g = a.height;
+  function a(d) {
+    let c = d.x, u = d.y, h = d.width, g = d.height;
     t = Math.min(t, c - h / 2), r = Math.max(r, c + h / 2), n = Math.min(n, u - g / 2), o = Math.max(o, u + g / 2);
   }
-  e.nodes().forEach((a) => d(e.node(a))), e.edges().forEach((a) => {
-    let c = e.edge(a);
-    Object.hasOwn(c, "x") && d(c);
-  }), t -= s, n -= l, e.nodes().forEach((a) => {
-    let c = e.node(a);
+  e.nodes().forEach((d) => a(e.node(d))), e.edges().forEach((d) => {
+    let c = e.edge(d);
+    Object.hasOwn(c, "x") && a(c);
+  }), t -= s, n -= l, e.nodes().forEach((d) => {
+    let c = e.node(d);
     c.x -= t, c.y -= n;
-  }), e.edges().forEach((a) => {
-    let c = e.edge(a);
+  }), e.edges().forEach((d) => {
+    let c = e.edge(d);
     c.points.forEach((u) => {
       u.x -= t, u.y -= n;
     }), Object.hasOwn(c, "x") && (c.x -= t), Object.hasOwn(c, "y") && (c.y -= n);
@@ -1615,12 +1615,12 @@ function Ii(e) {
   e.nodes().forEach((t) => {
     let r = e.node(t);
     if (r.dummy === "selfedge") {
-      let n = r, o = e.node(n.e.v), i = o.x + o.width / 2, s = o.y, l = r.x - i, d = o.height / 2;
-      e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [{ x: i + 2 * l / 3, y: s - d }, { x: i + 5 * l / 6, y: s - d }, { x: i + l, y: s }, { x: i + 5 * l / 6, y: s + d }, { x: i + 2 * l / 3, y: s + d }], n.label.x = r.x, n.label.y = r.y;
+      let n = r, o = e.node(n.e.v), i = o.x + o.width / 2, s = o.y, l = r.x - i, a = o.height / 2;
+      e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [{ x: i + 2 * l / 3, y: s - a }, { x: i + 5 * l / 6, y: s - a }, { x: i + l, y: s }, { x: i + 5 * l / 6, y: s + a }, { x: i + 2 * l / 3, y: s + a }], n.label.x = r.x, n.label.y = r.y;
     }
   });
 }
-function Re(e, t) {
+function Le(e, t) {
   return Ne(Te(e, t), Number);
 }
 function Ae(e) {
@@ -1638,32 +1638,32 @@ function Oi(e) {
     r.setNode(i, { rank: "same" }), n.reduce((s, l) => (r.setEdge(s, l, { style: "invis" }), l));
   }), r;
 }
-var ji = { graphlib: Yt, version: Wn, layout: li, debug: Oi, util: { time: rr, notime: nr } }, Mt = ji;
+var Mi = { graphlib: Yt, version: Wn, layout: li, debug: Oi, util: { time: rr, notime: nr } }, jt = Mi;
 /*! For license information please see dagre.esm.js.LEGAL.txt */
-const Mi = (e) => {
+const ji = (e) => {
   const t = [];
   return e.nodeInternals.forEach((r, n) => t.push(`${n}:${r.height ?? 0}`)), t.join(",");
 }, Fi = ({ onHeightsReady: e, nodeCount: t }) => {
-  const r = Tr(Mi), n = pt("");
+  const r = Tr(ji), n = pt("");
   pt(0);
   const { fitView: o } = Nr();
   return ie(() => {
     if (!r || r === n.current) return;
     const i = {};
     for (const s of r.split(",")) {
-      const [l, d] = s.split(":"), a = Number(d);
-      l && a > 0 && (i[l] = a);
+      const [l, a] = s.split(":"), d = Number(a);
+      l && d > 0 && (i[l] = d);
     }
     Object.keys(i).length !== 0 && (n.current = r, e(i));
   }, [r]), null;
 }, Se = ({ isOpen: e, onClose: t, title: r, icon: n, children: o, footer: i, width: s = 600 }) => {
-  const [l, d] = M(!1), a = () => d((h) => !h), c = () => /* @__PURE__ */ m(te, { sx: { display: "flex", alignItems: "center", p: 2, pt: 3, borderBottom: "1px solid #e0e0e0", mb: 0, flexShrink: 0 }, children: [
+  const [l, a] = j(!1), d = () => a((h) => !h), c = () => /* @__PURE__ */ m(te, { sx: { display: "flex", alignItems: "center", p: 2, pt: 3, borderBottom: "1px solid #e0e0e0", mb: 0, flexShrink: 0 }, children: [
     n && /* @__PURE__ */ f(te, { sx: { mr: 1.5, display: "flex", alignItems: "center", fontSize: "1.25rem", color: "#1DBF60" }, children: n }),
-    /* @__PURE__ */ f("span", { style: { flexGrow: 1, fontSize: "0.875rem", fontWeight: 500, color: "#212121" }, children: r }),
-    /* @__PURE__ */ f(bt, { onClick: a, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ f(tn, {}) : /* @__PURE__ */ f(rn, {}) }),
+    /* @__PURE__ */ f("span", { style: { flexGrow: 1, fontSize: 14, fontWeight: 600, color: "#212121" }, children: r }),
+    /* @__PURE__ */ f(bt, { onClick: d, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ f(tn, {}) : /* @__PURE__ */ f(rn, {}) }),
     /* @__PURE__ */ f(bt, { onClick: t, size: "small", "data-testid": "close-drawer-button", children: /* @__PURE__ */ f(Pr, {}) })
   ] }), u = () => i ? /* @__PURE__ */ f(te, { sx: { flexShrink: 0, p: 2, borderTop: "1px solid #e0e0e0", display: "flex", justifyContent: "flex-end", gap: 2 }, children: i }) : null;
-  return l ? /* @__PURE__ */ m(Rr, { open: e, onClose: t, maxWidth: !1, fullWidth: !0, PaperProps: { sx: { display: "flex", flexDirection: "column", height: "80vh", boxShadow: 24, width: "750px", maxWidth: "100%" } }, children: [
+  return l ? /* @__PURE__ */ m(Lr, { open: e, onClose: t, maxWidth: !1, fullWidth: !0, PaperProps: { sx: { display: "flex", flexDirection: "column", height: "80vh", boxShadow: 24, width: "750px", maxWidth: "100%" } }, children: [
     /* @__PURE__ */ f(c, {}),
     /* @__PURE__ */ f(te, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
     /* @__PURE__ */ f(u, {})
@@ -1733,7 +1733,7 @@ const Mi = (e) => {
 ] }) }), Pe = {
   cursor: "pointer",
   transition: "background 0.15s"
-}, Be = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", Di = ({ open: e, availableDescriptors: t, messages: r, onSelect: n, onClose: o }) => {
+}, Be = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", Ri = ({ open: e, availableDescriptors: t, messages: r, onSelect: n, onClose: o }) => {
   const { apps: i, ungrouped: s } = W(() => {
     const u = /* @__PURE__ */ new Map(), h = [];
     for (const g of t)
@@ -1749,20 +1749,20 @@ const Mi = (e) => {
       } else
         h.push(g);
     return { apps: [...u.values()], ungrouped: h };
-  }, [t]), [l, d] = M(null), a = l ? i.find((u) => u.key === l) ?? null : null;
+  }, [t]), [l, a] = j(null), d = l ? i.find((u) => u.key === l) ?? null : null;
   ie(() => {
-    e || d(null);
+    e || a(null);
   }, [e]), ie(() => {
-    d(null);
+    a(null);
   }, [t]);
-  const c = !a;
+  const c = !d;
   return /* @__PURE__ */ f(
     Se,
     {
       isOpen: e,
       onClose: o,
-      title: c ? r.addStepTitle : a.label,
-      icon: c ? /* @__PURE__ */ f($r, {}) : a.icon ?? /* @__PURE__ */ f(Yr, {}),
+      title: c ? r.addStepTitle : d.label,
+      icon: c ? /* @__PURE__ */ f($r, {}) : d.icon ?? /* @__PURE__ */ f(Yr, {}),
       width: 500,
       children: /* @__PURE__ */ m(te, { sx: { p: 2 }, children: [
         !c && /* @__PURE__ */ m(
@@ -1770,9 +1770,9 @@ const Mi = (e) => {
           {
             role: "button",
             tabIndex: 0,
-            onClick: () => d(null),
+            onClick: () => a(null),
             onKeyDown: (u) => {
-              u.key === "Enter" && d(null);
+              u.key === "Enter" && a(null);
             },
             className: "ff-d-flex ff-align-items-center ff-gap-1 ff-mb-3",
             style: { cursor: "pointer", color: "#0066cc", fontSize: 13, fontWeight: 500, width: "fit-content" },
@@ -1782,18 +1782,18 @@ const Mi = (e) => {
             ]
           }
         ),
-        /* @__PURE__ */ f("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: c ? r.chooseAction : `Pick an action from ${a.label}` }),
-        /* @__PURE__ */ f("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ m(Rt, { children: [
+        /* @__PURE__ */ f("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: c ? r.chooseAction : `Pick an action from ${d.label}` }),
+        /* @__PURE__ */ f("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ m(Lt, { children: [
           i.map((u) => /* @__PURE__ */ m(
             "div",
             {
               className: Be,
               style: Pe,
-              onClick: () => d(u.key),
+              onClick: () => a(u.key),
               role: "button",
               tabIndex: 0,
               onKeyDown: (h) => {
-                h.key === "Enter" && d(u.key);
+                h.key === "Enter" && a(u.key);
               },
               onMouseEnter: (h) => {
                 h.currentTarget.style.background = "#f5f5f5";
@@ -1804,7 +1804,7 @@ const Mi = (e) => {
               children: [
                 u.icon && /* @__PURE__ */ f("div", { style: { flexShrink: 0 }, children: u.icon }),
                 /* @__PURE__ */ m("div", { style: { flex: 1, minWidth: 0 }, children: [
-                  /* @__PURE__ */ f("div", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: u.label }),
+                  /* @__PURE__ */ f("div", { style: { fontSize: 14, fontWeight: 600, color: "#212121" }, children: u.label }),
                   /* @__PURE__ */ f("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 }, children: u.description ?? `${u.descriptors.length} action${u.descriptors.length === 1 ? "" : "s"}` })
                 ] }),
                 /* @__PURE__ */ f(At, { size: 18, color: "#9e9e9e" })
@@ -1839,7 +1839,7 @@ const Mi = (e) => {
           i.length === 0 && s.length === 0 && /* @__PURE__ */ f("p", { className: "ff-text-muted ff-text-center", style: { fontSize: 13 }, children: r.noActions })
         ] }) : (
           /* Stage 2 — actions for the selected app */
-          a.descriptors.map((u) => /* @__PURE__ */ m(
+          d.descriptors.map((u) => /* @__PURE__ */ m(
             "div",
             {
               className: Be,
@@ -1867,39 +1867,26 @@ const Mi = (e) => {
       ] })
     }
   );
-}, Ft = "_conditionConfig", Li = ({ open: e, nodeId: t, descriptor: r, initialValues: n, messages: o, onSave: i, onClose: s }) => {
-  const [l, d] = M([]), [a, c] = M(!1), [u, h] = M(null), [g, b] = M({});
+}, Ft = "_conditionConfig", Di = ({ open: e, nodeId: t, descriptor: r, initialValues: n, messages: o, onSave: i, onClose: s }) => {
+  const [l, a] = j([]), [d, c] = j(!1), [u, h] = j(null), [g, b] = j({});
   ie(() => {
     b((n == null ? void 0 : n[Ft]) ?? {});
   }, [n, t]), ie(() => {
     let N = !1;
     if (h(null), !r || !t) {
-      d([]), c(!1);
+      a([]), c(!1);
       return;
     }
     const O = r.formSchema;
-    return typeof O == "function" ? (c(!0), O(t).then((j) => {
-      N || (d(j), c(!1));
-    }).catch((j) => {
-      N || (d([]), h(j instanceof Error ? j.message : "Unable to load configuration."), c(!1));
-    })) : (d(O), c(!1)), () => {
+    return typeof O == "function" ? (c(!0), O(t).then((M) => {
+      N || (a(M), c(!1));
+    }).catch((M) => {
+      N || (a([]), h(M instanceof Error ? M.message : "Unable to load configuration."), c(!1));
+    })) : (a(O), c(!1)), () => {
       N = !0;
     };
   }, [r, t]);
-  const y = t ? `node-config-form-${t}` : "node-config-form", p = !a && !u && l.length > 0;
-  console.log("[FF-NCD] render", {
-    open: e,
-    nodeId: t,
-    descriptorType: r == null ? void 0 : r.type,
-    schemaLength: l.length,
-    schemaFieldTypes: l.map((N) => `${N.id}:${N.type}`),
-    loading: a,
-    error: u,
-    hasForm: p,
-    initialValues: n,
-    conditionConfigKeys: Object.keys(g)
-  });
-  const v = p ? /* @__PURE__ */ m(Rt, { children: [
+  const y = t ? `node-config-form-${t}` : "node-config-form", p = !d && !u && l.length > 0, v = p ? /* @__PURE__ */ m(Lt, { children: [
     /* @__PURE__ */ f(yt, { type: "button", variant: "outlined", size: "small", onClick: s, children: o.cancel }),
     /* @__PURE__ */ f(yt, { type: "submit", form: y, variant: "contained", size: "small", children: o.save })
   ] }) : null;
@@ -1913,9 +1900,9 @@ const Mi = (e) => {
       width: 500,
       footer: v,
       children: /* @__PURE__ */ m(te, { sx: { p: 2 }, children: [
-        a && /* @__PURE__ */ f("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.loadingConfiguration }),
-        !a && u && /* @__PURE__ */ f("p", { style: { fontSize: 13, color: "#d32f2f" }, children: u }),
-        !a && !u && l.length === 0 && /* @__PURE__ */ f("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.noConfigurationNeeded }),
+        d && /* @__PURE__ */ f("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.loadingConfiguration }),
+        !d && u && /* @__PURE__ */ f("p", { style: { fontSize: 13, color: "#d32f2f" }, children: u }),
+        !d && !u && l.length === 0 && /* @__PURE__ */ f("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.noConfigurationNeeded }),
         p && /* @__PURE__ */ f(
           nn,
           {
@@ -1934,14 +1921,14 @@ const Mi = (e) => {
       ] })
     }
   );
-}, Ri = ({
+}, Li = ({
   isOpen: e,
   onClose: t,
   workflowId: r,
   workflowLabel: n,
   onFetchWorkflow: o
 }) => {
-  const [i, s] = M({ status: "idle" });
+  const [i, s] = j({ status: "idle" });
   return ie(() => {
     if (!e || !r) {
       s({ status: "idle" });
@@ -1972,7 +1959,7 @@ const Mi = (e) => {
     }
   );
 }, Ai = ({ state: e }) => {
-  const [t, r] = M(null), [n, o] = M(null);
+  const [t, r] = j(null), [n, o] = j(null);
   return ie(() => {
     Promise.all([
       Promise.resolve().then(() => Yi).then((i) => i.default),
@@ -2001,11 +1988,11 @@ const Mi = (e) => {
   delayNode: 80,
   notificationNode: 80
 }, Pi = {
-  plusEdge: Dr,
+  plusEdge: Rr,
   labelPlusEdge: zr,
   plainEdge: Fr,
-  edgeWithPlusLabel: Mr,
-  gatewayBranchEdge: jr
+  edgeWithPlusLabel: jr,
+  gatewayBranchEdge: Mr
 };
 function zt() {
   return [
@@ -2015,41 +2002,41 @@ function zt() {
   ];
 }
 function Bi(e, t, r, n = "TB") {
-  const o = new Mt.graphlib.Graph();
+  const o = new jt.graphlib.Graph();
   return o.setGraph({ rankdir: n, ranksep: 70, nodesep: 50 }), o.setDefaultEdgeLabel(() => ({})), e.forEach((i) => {
     const s = r[i.id] ?? { width: be, height: Ke[i.type ?? ""] ?? 80 };
     o.setNode(i.id, { width: s.width, height: s.height });
-  }), t.forEach((i) => o.setEdge(i.source, i.target)), Mt.layout(o), e.map((i) => {
-    var a, c;
-    const s = o.node(i.id), l = ((a = r[i.id]) == null ? void 0 : a.width) ?? be, d = ((c = r[i.id]) == null ? void 0 : c.height) ?? Ke[i.type ?? ""] ?? 80;
-    return { ...i, position: { x: s.x - l / 2, y: s.y - d / 2 } };
+  }), t.forEach((i) => o.setEdge(i.source, i.target)), jt.layout(o), e.map((i) => {
+    var d, c;
+    const s = o.node(i.id), l = ((d = r[i.id]) == null ? void 0 : d.width) ?? be, a = ((c = r[i.id]) == null ? void 0 : c.height) ?? Ke[i.type ?? ""] ?? 80;
+    return { ...i, position: { x: s.x - l / 2, y: s.y - a / 2 } };
   });
 }
 const oe = (e) => e === "filter" || e === "approval";
 function Wi(e, t, r, n) {
-  const s = $e, l = 30, d = 30, a = {}, c = {}, u = /* @__PURE__ */ new Map();
+  const s = $e, l = 30, a = 30, d = {}, c = {}, u = /* @__PURE__ */ new Map();
   for (const p of e) u.set(p.id, p);
   for (const p of Object.values(t))
     for (const v of Object.values(p))
       for (const N of v) u.set(N.id, N);
   const h = (p, v, N) => {
     const O = n[p] ?? { width: be, height: 80 };
-    return a[p] = { x: v - O.width / 2, y: N }, N + O.height;
+    return d[p] = { x: v - O.width / 2, y: N }, N + O.height;
   }, g = (p, v, N) => {
     let O = N;
-    for (const j of p)
-      O = h(j.id, v, O) + s, oe(j.kind) && t[j.id] && (O = b(j.id, v, O));
+    for (const M of p)
+      O = h(M.id, v, O) + s, oe(M.kind) && t[M.id] && (O = b(M.id, v, O));
     return O;
   }, b = (p, v, N) => {
-    const O = v + 180, j = t[p], F = Object.keys(j), B = u.get(p), re = (B == null ? void 0 : B.branchLabels) ?? { pass: "Pass", fail: "Fail" }, he = a[p], z = n[p] ?? { height: 80 }, me = he.y + z.height, we = [];
+    const O = v + 180, M = t[p], F = Object.keys(M), B = u.get(p), re = (B == null ? void 0 : B.branchLabels) ?? { pass: "Pass", fail: "Fail" }, he = d[p], z = n[p] ?? { height: 80 }, me = he.y + z.height, we = [];
     let U = N;
     return F.forEach((le, X) => {
-      const D = j[le], J = U;
+      const R = M[le], J = U;
       we.push({
         y: J - me,
         label: re[le] ?? le,
         isPass: X === 0
-      }), U = g(D, O, U + d), X < F.length - 1 && (U += l);
+      }), U = g(R, O, U + a), X < F.length - 1 && (U += l);
     }), c[p] = {
       branches: we,
       height: U - me,
@@ -2060,11 +2047,11 @@ function Wi(e, t, r, n) {
   for (const p of e)
     y = h(p.id, 400, y) + s, oe(p.kind) && t[p.id] && (y = b(p.id, 400, y));
   return {
-    nodes: r.map((p) => a[p.id] ? { ...p, position: a[p.id] } : p),
+    nodes: r.map((p) => d[p.id] ? { ...p, position: d[p.id] } : p),
     railSpecs: c
   };
 }
-function Dt(e) {
+function Rt(e) {
   return {
     id: e.id,
     type: e.reactFlowType,
@@ -2089,12 +2076,12 @@ function Gi(e, t, r, n, o) {
   };
 }
 function $i(e, t, r, n, o = {}, i = "TB", s = "horizontal") {
-  const l = o.edgeColor ?? "#b0bec5", d = [], a = [], c = (b, y) => {
+  const l = o.edgeColor ?? "#b0bec5", a = [], d = [], c = (b, y) => {
     const p = t[b];
     if (!p) return;
-    const N = y ?? { pass: "Pass", fail: "Fail" }, O = Object.keys(p), j = (F, B, re, he) => {
+    const N = y ?? { pass: "Pass", fail: "Fail" }, O = Object.keys(p), M = (F, B, re, he) => {
       if (F.length !== 0) {
-        F.forEach((z) => d.push(Dt(z))), a.push({
+        F.forEach((z) => a.push(Rt(z))), d.push({
           id: `e-${b}-${B}-start`,
           source: b,
           target: F[0].id,
@@ -2103,21 +2090,21 @@ function $i(e, t, r, n, o = {}, i = "TB", s = "horizontal") {
           data: { branch: B, filterId: b, label: re, isFirst: he === 0, onAddStepClick: r, verticalRouting: s === "vertical" }
         });
         for (let z = 1; z < F.length; z++)
-          oe(F[z - 1].kind) || a.push(Gi(F[z - 1], F[z], l, r, { filterId: b, branch: B }));
+          oe(F[z - 1].kind) || d.push(Gi(F[z - 1], F[z], l, r, { filterId: b, branch: B }));
         for (const z of F)
           oe(z.kind) && t[z.id] && c(z.id, z.branchLabels);
       }
     };
     O.forEach((F, B) => {
-      j(p[F], F, N[F] ?? F, B);
+      M(p[F], F, N[F] ?? F, B);
     });
   };
   for (let b = 0; b < e.length; b++) {
     const y = e[b];
-    if (d.push(Dt(y)), b > 0) {
+    if (a.push(Rt(y)), b > 0) {
       const p = e[b - 1], v = p.kind === "start" || p.kind === "addTrigger";
       if (p.kind === "filter" || p.kind === "approval") continue;
-      a.push({
+      d.push({
         id: `e-${p.id}-${y.id}`,
         source: p.id,
         target: y.id,
@@ -2132,7 +2119,7 @@ function $i(e, t, r, n, o = {}, i = "TB", s = "horizontal") {
     (y.kind === "filter" || y.kind === "approval") && t[y.id] && c(y.id, y.branchLabels);
   }
   const u = {};
-  if (d.forEach((b) => {
+  if (a.forEach((b) => {
     u[b.id] = {
       width: be,
       height: n[b.id] ?? Ke[b.type ?? ""] ?? 80
@@ -2140,27 +2127,27 @@ function $i(e, t, r, n, o = {}, i = "TB", s = "horizontal") {
   }), !(Object.keys(t).length > 0)) {
     if (i === "LR") {
       let N = Ye;
-      return { nodes: d.map((j) => {
-        const F = u[j.id].width, B = u[j.id].height, re = { ...j, position: { x: N, y: 300 - B / 2 } };
+      return { nodes: a.map((M) => {
+        const F = u[M.id].width, B = u[M.id].height, re = { ...M, position: { x: N, y: 300 - B / 2 } };
         return N += F + $e, re;
-      }), edges: a };
+      }), edges: d };
     }
     const b = 400;
     let y = Ye;
-    return { nodes: d.map((v) => {
+    return { nodes: a.map((v) => {
       const N = u[v.id].height, O = { ...v, position: { x: b - be / 2, y } };
       return y += N + $e, O;
-    }), edges: a };
+    }), edges: d };
   }
   if (s === "vertical") {
-    const { nodes: b, railSpecs: y } = Wi(e, t, d, u);
+    const { nodes: b, railSpecs: y } = Wi(e, t, a, u);
     return { nodes: b.map(
       (v) => y[v.id] ? { ...v, data: { ...v.data, _branchRail: y[v.id] } } : v
-    ), edges: a };
+    ), edges: d };
   }
-  return { nodes: Bi(d, a, u, i), edges: a };
+  return { nodes: Bi(a, d, u, i), edges: d };
 }
-const Lt = ({
+const Dt = ({
   nodeRegistry: e,
   templateRegistry: t,
   initialValue: r,
@@ -2169,8 +2156,8 @@ const Lt = ({
   onSave: i,
   readOnly: s = !1,
   theme: l = {},
-  messages: d,
-  canvasOptions: a = {},
+  messages: a,
+  canvasOptions: d = {},
   renderTriggerSelector: c,
   renderNodePicker: u,
   renderNodeConfig: h,
@@ -2183,7 +2170,7 @@ const Lt = ({
   const {
     fitView: N = !0,
     fitViewPadding: O = 0.3,
-    showControls: j = !0,
+    showControls: M = !0,
     showMiniMap: F = !1,
     panOnScroll: B = !0,
     zoomOnScroll: re = !1,
@@ -2193,28 +2180,28 @@ const Lt = ({
     snapGrid: we = [15, 15],
     branchLayout: U = "horizontal",
     nodeBody: le = "full"
-  } = a, X = W(() => on(d), [d]), [D, J] = M(() => (r == null ? void 0 : r.slots) ?? zt()), [V, Z] = M(() => (r == null ? void 0 : r.branches) ?? {}), [ae, $] = M(null), [Ie, Ze] = M(null), [de, ve] = M(null), [Oe, Qe] = M(null), [Ee, et] = M(null), [Q, tt] = M(() => {
+  } = d, X = W(() => on(a), [a]), [R, J] = j(() => (r == null ? void 0 : r.slots) ?? zt()), [V, Z] = j(() => (r == null ? void 0 : r.branches) ?? {}), [de, $] = j(null), [Ie, Ze] = j(null), [ae, ve] = j(null), [Oe, Qe] = j(null), [Ee, et] = j(null), [Q, tt] = j(() => {
     const w = r == null ? void 0 : r.slots.find((k) => k.kind === "triggerFixed"), E = w != null && w.id.startsWith("trigger-") ? w.id.slice(8) : void 0;
     return E ? t.lookup(E) ?? null : null;
-  }), [rt, br] = M({}), yr = Y((w) => {
+  }), [rt, br] = j({}), yr = Y((w) => {
     br(w);
   }, []), mr = W(() => ({ ...Or, ...n }), [n]), wr = W(() => ({ ...Pi, ...o }), [o]), vr = W(() => {
-    const w = D.filter((k) => k.kind === "userTask").length, E = Object.values(V).flatMap((k) => Object.values(k).flat()).filter((k) => k.kind === "userTask").length;
+    const w = R.filter((k) => k.kind === "userTask").length, E = Object.values(V).flatMap((k) => Object.values(k).flat()).filter((k) => k.kind === "userTask").length;
     return w + E;
-  }, [D, V]), nt = b ?? (Q == null ? void 0 : Q.maxTasks), ot = nt !== void 0 && vr >= nt, ne = Y((w) => {
-    const E = D.find((k) => k.id === w);
+  }, [R, V]), nt = b ?? (Q == null ? void 0 : Q.maxTasks), ot = nt !== void 0 && vr >= nt, ne = Y((w) => {
+    const E = R.find((k) => k.id === w);
     if (E) return E;
     for (const k of Object.values(V)) {
       const C = Object.values(k).flat().find((x) => x.id === w);
       if (C) return C;
     }
     return null;
-  }, [D, V]), je = Y((w) => {
+  }, [R, V]), Me = Y((w) => {
     s || (Ze(w), $("nodeConfig"));
   }, [s]), it = Y((w) => {
     if (!s) {
-      if (D.some((E) => E.id === w)) {
-        const E = D.find((k) => k.id === w);
+      if (R.some((E) => E.id === w)) {
+        const E = R.find((k) => k.id === w);
         if ((E == null ? void 0 : E.kind) === "triggerFixed") {
           J(zt()), Z({}), tt(null);
           return;
@@ -2242,13 +2229,13 @@ const Lt = ({
             const T = C[x][_], S = T.findIndex((A) => A.id === w);
             if (S === -1 || T[S].kind === "end") continue;
             const I = T[S];
-            let L = T.filter((A) => A.id !== w);
-            return I.kind === "filter" && ((I.id in C ? k([I], C) : []).forEach((R) => delete C[R]), delete C[I.id], L.some((R) => R.kind === "end") || (L = [...L, { id: `end-${x}-${_}`, kind: "end", reactFlowType: "endNode" }])), C[x] = { ...C[x], [_]: L }, C;
+            let D = T.filter((A) => A.id !== w);
+            return I.kind === "filter" && ((I.id in C ? k([I], C) : []).forEach((L) => delete C[L]), delete C[I.id], D.some((L) => L.kind === "end") || (D = [...D, { id: `end-${x}-${_}`, kind: "end", reactFlowType: "endNode" }])), C[x] = { ...C[x], [_]: D }, C;
           }
         return C;
       });
     }
-  }, [s, D]), Me = Y(() => {
+  }, [s, R]), je = Y(() => {
     s || $("triggerSelect");
   }, [s]), st = Y((w, E) => {
     s || ot || (ve(w), Qe(E.filterId && E.branch ? { filterId: E.filterId, branch: E.branch } : null), $("nodePicker"));
@@ -2264,11 +2251,11 @@ const Lt = ({
       },
       { id: "end", kind: "end", reactFlowType: "endNode" }
     ]);
-  }, []), at = Y(() => {
+  }, []), dt = Y(() => {
     const w = e.list();
-    return (Q != null && Q.availableTasks ? w.filter((k) => Q.availableTasks.includes(k.type)) : w).filter((k) => k.maxPerWorkflow === void 0 ? !0 : D.filter((x) => x.descriptorType === k.type).length + Object.values(V).flatMap((x) => Object.values(x).flat()).filter((x) => x.descriptorType === k.type).length < k.maxPerWorkflow);
-  }, [e, Q, D, V]), dt = Y((w) => {
-    if (!de) return;
+    return (Q != null && Q.availableTasks ? w.filter((k) => Q.availableTasks.includes(k.type)) : w).filter((k) => k.maxPerWorkflow === void 0 ? !0 : R.filter((x) => x.descriptorType === k.type).length + Object.values(V).flatMap((x) => Object.values(x).flat()).filter((x) => x.descriptorType === k.type).length < k.maxPerWorkflow);
+  }, [e, Q, R, V]), at = Y((w) => {
+    if (!ae) return;
     const E = `${w.type}-${Date.now()}`, k = w.reactFlowType === "filterNode" || w.reactFlowType === "approvalNode" || w.reactFlowType === "conditionBranchNode", C = w.branchLabels ?? { pass: "Pass", fail: "Fail" }, x = {
       id: E,
       kind: k ? w.reactFlowType === "approvalNode" ? "approval" : "filter" : "userTask",
@@ -2284,7 +2271,7 @@ const Lt = ({
       Z((S) => {
         const I = [...S[_][T]];
         if (k) {
-          const ee = I.filter((ce) => ce.kind !== "end"), gt = ee.findIndex((ce) => ce.id === de), xr = gt === -1 ? ee.length : gt + 1;
+          const ee = I.filter((ce) => ce.kind !== "end"), gt = ee.findIndex((ce) => ce.id === ae), xr = gt === -1 ? ee.length : gt + 1;
           return ee.splice(xr, 0, x), {
             ...S,
             [_]: { ...S[_], [T]: ee },
@@ -2293,12 +2280,12 @@ const Lt = ({
             )
           };
         }
-        const L = I.findIndex((ee) => ee.id === de), A = I.findIndex((ee) => ee.kind === "end"), R = L === -1 ? A === -1 ? I.length : A : L + 1;
-        return I.splice(R, 0, x), { ...S, [_]: { ...S[_], [T]: I } };
+        const D = I.findIndex((ee) => ee.id === ae), A = I.findIndex((ee) => ee.kind === "end"), L = D === -1 ? A === -1 ? I.length : A : D + 1;
+        return I.splice(L, 0, x), { ...S, [_]: { ...S[_], [T]: I } };
       });
     } else
       k ? (J((_) => {
-        const T = _.findIndex((I) => I.id === de);
+        const T = _.findIndex((I) => I.id === ae);
         return [..._.filter((I) => I.kind !== "end").slice(0, T + 1), x];
       }), Z((_) => ({
         ..._,
@@ -2306,24 +2293,24 @@ const Lt = ({
           Object.keys(C).map((T) => [T, [{ id: `end-${E}-${T}`, kind: "end", reactFlowType: "endNode" }]])
         )
       }))) : J((_) => {
-        const T = _.findIndex((S) => S.id === de);
+        const T = _.findIndex((S) => S.id === ae);
         return T === -1 ? _ : [..._.slice(0, T + 1), x, ..._.slice(T + 1)];
       });
     ve(null), Qe(null), Ze(E), $("nodeConfig");
-  }, [de, Oe]), ct = Y((w, E) => {
+  }, [ae, Oe]), ct = Y((w, E) => {
     const k = (x) => {
       const _ = ne(w);
       if ((_ == null ? void 0 : _.descriptorType) !== "conditionBranch") return x;
-      const T = E.branchConfigs ?? [], S = T.map((R) => R.key).filter(Boolean);
+      const T = E.branchConfigs ?? [], S = T.map((L) => L.key).filter(Boolean);
       if (S.length === 0) return x;
-      const I = x[w] ?? {}, L = {};
-      S.forEach((R) => {
-        L[R] = I[R] ?? [{ id: `end-${w}-${R}`, kind: "end", reactFlowType: "endNode" }];
+      const I = x[w] ?? {}, D = {};
+      S.forEach((L) => {
+        D[L] = I[L] ?? [{ id: `end-${w}-${L}`, kind: "end", reactFlowType: "endNode" }];
       });
       const A = {};
-      return T.forEach((R) => {
-        R.key && (A[R.key] = R.label || R.key);
-      }), { ...x, [w]: L };
+      return T.forEach((L) => {
+        L.key && (A[L.key] = L.label || L.key);
+      }), { ...x, [w]: D };
     }, C = (x, _) => {
       if (x.descriptorType !== "conditionBranch") return { ...x, formData: _ };
       const T = _.branchConfigs ?? [], S = {};
@@ -2331,7 +2318,7 @@ const Lt = ({
         I.key && (S[I.key] = I.label || I.key);
       }), { ...x, formData: _, branchLabels: S };
     };
-    if (D.some((x) => x.id === w)) {
+    if (R.some((x) => x.id === w)) {
       Z((x) => {
         const _ = k(x);
         return J((T) => {
@@ -2344,16 +2331,16 @@ const Lt = ({
     Z((x) => {
       const T = { ...k(x) };
       for (const S of Object.keys(T)) {
-        const I = (L) => L.map((A) => A.id === w ? C(A, E) : A);
-        for (const L of Object.keys(T[S]))
-          if (T[S][L].some((A) => A.id === w))
-            return T[S] = { ...T[S], [L]: I(T[S][L]) }, i == null || i({ slots: D, branches: T }), T;
+        const I = (D) => D.map((A) => A.id === w ? C(A, E) : A);
+        for (const D of Object.keys(T[S]))
+          if (T[S][D].some((A) => A.id === w))
+            return T[S] = { ...T[S], [D]: I(T[S][D]) }, i == null || i({ slots: R, branches: T }), T;
       }
       return T;
     });
-  }, [D, V, ne, i]), H = W(() => ne(Ie ?? ""), [ne, Ie]), ut = W(() => H != null && H.descriptorType ? e.forType(H.descriptorType) ?? null : null, [H, e]), { nodes: ft, edges: Er } = W(
-    () => $i(D, V, s ? null : st, rt, l, y, U),
-    [D, V, s, st, rt, l, y, U]
+  }, [R, V, ne, i]), H = W(() => ne(Ie ?? ""), [ne, Ie]), ut = W(() => H != null && H.descriptorType ? e.forType(H.descriptorType) ?? null : null, [H, e]), { nodes: ft, edges: Er } = W(
+    () => $i(R, V, s ? null : st, rt, l, y, U),
+    [R, V, s, st, rt, l, y, U]
   ), ht = W(() => {
     const w = p ? new Map(p.steps.map((E) => [E.nodeId, E])) : null;
     return ft.map((E) => {
@@ -2368,9 +2355,9 @@ const Lt = ({
         et({ workflowId: C, workflowLabel: ((_ = x == null ? void 0 : x.formData) == null ? void 0 : _.workflowLabel) ?? void 0 });
       }), Object.keys(k).length > 0 ? { ...E, data: { ...E.data, ...k } } : E;
     });
-  }, [ft, p, v, ne]), kr = W(() => ({ onEditNode: je, onDeleteNode: it, onAddStep: () => {
-  }, onClickAddTrigger: Me, messages: X, nodeRegistry: e, nodeBody: le }), [je, it, Me, X, e, le]);
-  return /* @__PURE__ */ f(Lr.Provider, { value: kr, children: /* @__PURE__ */ m(
+  }, [ft, p, v, ne]), kr = W(() => ({ onEditNode: Me, onDeleteNode: it, onAddStep: () => {
+  }, onClickAddTrigger: je, messages: X, nodeRegistry: e, nodeBody: le }), [Me, it, je, X, e, le]);
+  return /* @__PURE__ */ f(Dr.Provider, { value: kr, children: /* @__PURE__ */ m(
     "div",
     {
       style: {
@@ -2409,7 +2396,7 @@ const Lt = ({
             proOptions: { hideAttribution: !0 },
             onNodeClick: (w, E) => {
               const k = ne(E.id);
-              k && (g != null && g(k) || (k.kind === "addTrigger" || k.kind === "triggerFixed" ? Me() : (k.kind === "userTask" || k.kind === "filter" || k.kind === "approval") && je(E.id)));
+              k && (g != null && g(k) || (k.kind === "addTrigger" || k.kind === "triggerFixed" ? je() : (k.kind === "userTask" || k.kind === "filter" || k.kind === "approval") && Me(E.id)));
             },
             children: [
               l.background !== "none" && /* @__PURE__ */ f(
@@ -2420,21 +2407,21 @@ const Lt = ({
                   gap: 20
                 }
               ),
-              j && /* @__PURE__ */ f(Sr, { showInteractive: !1 }),
+              M && /* @__PURE__ */ f(Sr, { showInteractive: !1 }),
               F && /* @__PURE__ */ f(Ir, { zoomable: !0, pannable: !0 }),
               /* @__PURE__ */ f(Fi, { onHeightsReady: yr, nodeCount: ht.length })
             ]
           }
         ),
-        c ? ae === "triggerSelect" && c(t.list(), lt, () => $(null)) : /* @__PURE__ */ f(zi, { open: ae === "triggerSelect", templates: t.list(), messages: X, onSelect: lt, onClose: () => $(null) }),
-        u ? ae === "nodePicker" && u(at(), dt, () => {
+        c ? de === "triggerSelect" && c(t.list(), lt, () => $(null)) : /* @__PURE__ */ f(zi, { open: de === "triggerSelect", templates: t.list(), messages: X, onSelect: lt, onClose: () => $(null) }),
+        u ? de === "nodePicker" && u(dt(), at, () => {
           $(null), ve(null);
-        }) : /* @__PURE__ */ f(Di, { open: ae === "nodePicker", availableDescriptors: at(), messages: X, onSelect: dt, onClose: () => {
+        }) : /* @__PURE__ */ f(Ri, { open: de === "nodePicker", availableDescriptors: dt(), messages: X, onSelect: at, onClose: () => {
           $(null), ve(null);
         } }),
-        h ? ae === "nodeConfig" && h(ut ?? void 0, H, ct, () => $(null)) : /* @__PURE__ */ f(Li, { open: ae === "nodeConfig", nodeId: Ie, descriptor: ut, initialValues: H == null ? void 0 : H.formData, messages: X, onSave: ct, onClose: () => $(null) }),
+        h ? de === "nodeConfig" && h(ut ?? void 0, H, ct, () => $(null)) : /* @__PURE__ */ f(Di, { open: de === "nodeConfig", nodeId: Ie, descriptor: ut, initialValues: H == null ? void 0 : H.formData, messages: X, onSave: ct, onClose: () => $(null) }),
         v && Ee && /* @__PURE__ */ f(
-          Ri,
+          Li,
           {
             isOpen: !!Ee,
             onClose: () => et(null),
@@ -2448,8 +2435,8 @@ const Lt = ({
   ) });
 }, Yi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  WorkflowCanvas: Lt,
-  default: Lt
+  WorkflowCanvas: Dt,
+  default: Dt
 }, Symbol.toStringTag, { value: "Module" })), We = "All";
 function Ki({ template: e, onSelect: t }) {
   var o, i;
@@ -2511,23 +2498,23 @@ const ls = ({
   onSelectTemplate: t,
   onStartFromScratch: r
 }) => {
-  const [n, o] = M(""), [i, s] = M(We), l = W(() => {
-    const a = /* @__PURE__ */ new Set();
+  const [n, o] = j(""), [i, s] = j(We), l = W(() => {
+    const d = /* @__PURE__ */ new Set();
     return e.forEach((c) => {
-      c.category && a.add(c.category);
-    }), [We, ...Array.from(a)];
-  }, [e]), d = W(() => {
-    let a = e;
-    if (i !== We && (a = a.filter((c) => c.category === i)), n.trim()) {
+      c.category && d.add(c.category);
+    }), [We, ...Array.from(d)];
+  }, [e]), a = W(() => {
+    let d = e;
+    if (i !== We && (d = d.filter((c) => c.category === i)), n.trim()) {
       const c = n.toLowerCase();
-      a = a.filter(
+      d = d.filter(
         (u) => {
           var h, g;
           return u.label.toLowerCase().includes(c) || ((h = u.description) == null ? void 0 : h.toLowerCase().includes(c)) || ((g = u.tags) == null ? void 0 : g.some((b) => b.toLowerCase().includes(c)));
         }
       );
     }
-    return [...a].sort((c, u) => (u.popularity ?? 0) - (c.popularity ?? 0));
+    return [...d].sort((c, u) => (u.popularity ?? 0) - (c.popularity ?? 0));
   }, [e, i, n]);
   return /* @__PURE__ */ m("div", { style: { display: "flex", flexDirection: "column", height: "100%", fontFamily: "inherit" }, children: [
     /* @__PURE__ */ m("div", { style: { padding: "24px 24px 0", borderBottom: "1px solid #f0f0f0", paddingBottom: 16 }, children: [
@@ -2554,36 +2541,36 @@ const ls = ({
           "input",
           {
             value: n,
-            onChange: (a) => o(a.target.value),
+            onChange: (d) => o(d.target.value),
             placeholder: "Search templates...",
             style: { border: "none", background: "transparent", outline: "none", fontSize: 14, color: "#212121", flex: 1 }
           }
         )
       ] }),
-      l.length > 1 && /* @__PURE__ */ f("div", { style: { display: "flex", gap: 4, flexWrap: "wrap" }, children: l.map((a) => /* @__PURE__ */ f(
+      l.length > 1 && /* @__PURE__ */ f("div", { style: { display: "flex", gap: 4, flexWrap: "wrap" }, children: l.map((d) => /* @__PURE__ */ f(
         "button",
         {
-          onClick: () => s(a),
+          onClick: () => s(d),
           style: {
             padding: "4px 12px",
             borderRadius: 20,
             border: "1.5px solid",
-            borderColor: i === a ? "#1976d2" : "#e0e0e0",
-            background: i === a ? "#e3f2fd" : "#fff",
-            color: i === a ? "#1565c0" : "#616161",
+            borderColor: i === d ? "#1976d2" : "#e0e0e0",
+            background: i === d ? "#e3f2fd" : "#fff",
+            color: i === d ? "#1565c0" : "#616161",
             fontSize: 12,
-            fontWeight: i === a ? 600 : 400,
+            fontWeight: i === d ? 600 : 400,
             cursor: "pointer"
           },
-          children: a
+          children: d
         },
-        a
+        d
       )) })
     ] }),
-    /* @__PURE__ */ f("div", { style: { flex: 1, overflowY: "auto", padding: 24 }, children: d.length === 0 ? /* @__PURE__ */ m("div", { style: { textAlign: "center", padding: "40px 0", color: "#9e9e9e" }, children: [
+    /* @__PURE__ */ f("div", { style: { flex: 1, overflowY: "auto", padding: 24 }, children: a.length === 0 ? /* @__PURE__ */ m("div", { style: { textAlign: "center", padding: "40px 0", color: "#9e9e9e" }, children: [
       /* @__PURE__ */ f(qr, { size: 36, style: { marginBottom: 8 } }),
       /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 14 }, children: "No templates found" })
-    ] }) : /* @__PURE__ */ f("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 }, children: d.map((a) => /* @__PURE__ */ f(Ki, { template: a, onSelect: () => t(a) }, a.triggerKey)) }) })
+    ] }) : /* @__PURE__ */ f("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 }, children: a.map((d) => /* @__PURE__ */ f(Ki, { template: d, onSelect: () => t(d) }, d.triggerKey)) }) })
   ] });
 }, ke = {
   running: { label: "Running", color: q.running, icon: P.createElement(Gt, { size: 14 }) },
@@ -2613,7 +2600,7 @@ function pr(e, t) {
   }
 }
 function Vi({ step: e }) {
-  const [t, r] = M(!1), n = Ui[e.status], o = !!(e.inputs || e.outputs || e.error);
+  const [t, r] = j(!1), n = Ui[e.status], o = !!(e.inputs || e.outputs || e.error);
   return /* @__PURE__ */ m("div", { style: { borderBottom: "1px solid #f5f5f5" }, children: [
     /* @__PURE__ */ m(
       "div",
@@ -2688,9 +2675,9 @@ function Hi({ record: e, selected: t, onSelect: r }) {
     }
   );
 }
-const as = ({ records: e, onViewOnCanvas: t }) => {
+const ds = ({ records: e, onViewOnCanvas: t }) => {
   var s;
-  const [r, n] = M(((s = e[0]) == null ? void 0 : s.id) ?? null), o = e.find((l) => l.id === r) ?? null, i = [...e].sort((l, d) => new Date(d.triggeredAt).getTime() - new Date(l.triggeredAt).getTime());
+  const [r, n] = j(((s = e[0]) == null ? void 0 : s.id) ?? null), o = e.find((l) => l.id === r) ?? null, i = [...e].sort((l, a) => new Date(a.triggeredAt).getTime() - new Date(l.triggeredAt).getTime());
   return e.length === 0 ? /* @__PURE__ */ m("div", { style: { display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", height: 300, color: "#9e9e9e", gap: 8 }, children: [
     /* @__PURE__ */ f(mt, { size: 36 }),
     /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 14 }, children: "No executions yet" }),
@@ -2741,7 +2728,7 @@ const as = ({ records: e, onViewOnCanvas: t }) => {
           o.steps.length,
           ")"
         ] }),
-        o.steps.map((l, d) => /* @__PURE__ */ f(Vi, { step: l }, `${l.nodeId}-${d}`))
+        o.steps.map((l, a) => /* @__PURE__ */ f(Vi, { step: l }, `${l.nodeId}-${a}`))
       ] }),
       o.inputs && Object.keys(o.inputs).length > 0 && /* @__PURE__ */ f("div", { style: { padding: "10px 16px" }, children: /* @__PURE__ */ m("details", { children: [
         /* @__PURE__ */ f("summary", { style: { cursor: "pointer", fontSize: 12, fontWeight: 600, color: "#757575", marginBottom: 6 }, children: "TRIGGER INPUTS" }),
@@ -2749,7 +2736,7 @@ const as = ({ records: e, onViewOnCanvas: t }) => {
       ] }) })
     ] }) : /* @__PURE__ */ f("div", { style: { display: "flex", alignItems: "center", justifyContent: "center", height: "100%", color: "#9e9e9e", fontSize: 14 }, children: "Select a run to see details" }) })
   ] });
-}, ds = {
+}, as = {
   slots: [
     { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
     { id: "trigger-END_USER_CREATION", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "New User Registration", nodeData: { label: "New User Registration" } },
@@ -2801,12 +2788,12 @@ const as = ({ records: e, onViewOnCanvas: t }) => {
   branches: {}
 };
 export {
-  Lt as F,
-  Ri as S,
-  as as W,
+  Dt as F,
+  Li as S,
+  ds as W,
   ls as a,
   cs as b,
   us as o,
-  ds as u,
+  as as u,
   fs as w
 };