@kestra-io/ui-libs 0.0.299 → 0.0.300

package/dist/{VueFlowUtils-CVECjUbY.js → VueFlowUtils-Ca_LeFFY.js}

@@ -22,7 +22,8 @@ const uh = {
   ADD_ERROR: "addError",
   EXPAND_DEPENDENCIES: "expandDependencies",
   SHOW_CONDITION: "showCondition",
-  RUN_TASK: "runTask"
+  RUN_TASK: "runTask",
+  SHOW_CUSTOM_ACTION: "showCustomAction"
 }, ie = "cluster_", Z = {
   TASK_WIDTH: 184,
   TASK_HEIGHT: 44,
@@ -35,9 +36,9 @@ const uh = {
   TRIGGER_CLUSTER_WIDTH: 350,
   TRIGGER_CLUSTER_HEIGHT: 180
 };
-var xe, Ci;
+var Oe, Ci;
 function yf() {
-  if (Ci) return xe;
+  if (Ci) return Oe;
   Ci = 1;
   function e(a) {
     return function(u, n, r) {
@@ -49,29 +50,29 @@ function yf() {
       return u;
     };
   }
-  return xe = e, xe;
+  return Oe = e, Oe;
 }
-var Ne, xi;
+var xe, Oi;
 function si() {
-  if (xi) return Ne;
-  xi = 1;
+  if (Oi) return xe;
+  Oi = 1;
   var e = yf(), a = e();
-  return Ne = a, Ne;
+  return xe = a, xe;
 }
-var Oe, Ni;
+var Ne, xi;
 function oi() {
-  if (Ni) return Oe;
-  Ni = 1;
+  if (xi) return Ne;
+  xi = 1;
   var e = si(), a = ue();
   function u(n, r) {
     return n && e(n, r, a);
   }
-  return Oe = u, Oe;
+  return Ne = u, Ne;
 }
-var ke, Oi;
+var ke, Ni;
 function Ef() {
-  if (Oi) return ke;
-  Oi = 1;
+  if (Ni) return ke;
+  Ni = 1;
   var e = "__lodash_hash_undefined__";
   function a(u) {
     return this.__data__.set(u, e), this;
@@ -189,14 +190,14 @@ function If() {
   if (Di) return Be;
   Di = 1;
   var e = ri(), a = Qo(), u = pe(), n = ao(), r = Rf(), t = fi(), s = 1, i = 2, f = "[object Boolean]", d = "[object Date]", o = "[object Error]", c = "[object Map]", h = "[object Number]", l = "[object RegExp]", b = "[object Set]", p = "[object String]", v = "[object Symbol]", g = "[object ArrayBuffer]", m = "[object DataView]", _ = e ? e.prototype : void 0, y = _ ? _.valueOf : void 0;
-  function E(R, w, q, C, T, N, A) {
+  function E(R, w, q, C, T, x, A) {
     switch (q) {
       case m:
         if (R.byteLength != w.byteLength || R.byteOffset != w.byteOffset)
           return !1;
         R = R.buffer, w = w.buffer;
       case g:
-        return !(R.byteLength != w.byteLength || !N(new a(R), new a(w)));
+        return !(R.byteLength != w.byteLength || !x(new a(R), new a(w)));
       case f:
       case d:
       case h:
@@ -207,16 +208,16 @@ function If() {
       case p:
         return R == w + "";
       case c:
-        var O = r;
+        var N = r;
       case b:
         var P = C & s;
-        if (O || (O = t), R.size != w.size && !P)
+        if (N || (N = t), R.size != w.size && !P)
           return !1;
         var M = A.get(R);
         if (M)
           return M == w;
         C |= i, A.set(R, w);
-        var B = n(O(R), O(w), C, T, N, A);
+        var B = n(N(R), N(w), C, T, x, A);
         return A.delete(R), B;
       case v:
         if (y)
@@ -272,22 +273,22 @@ function Sf() {
   function b(p, v, g, m, _, y) {
     var E = t(p), R = t(v), w = E ? o : r(p), q = R ? o : r(v);
     w = w == d ? c : w, q = q == d ? c : q;
-    var C = w == c, T = q == c, N = w == q;
-    if (N && s(p)) {
+    var C = w == c, T = q == c, x = w == q;
+    if (x && s(p)) {
       if (!s(v))
         return !1;
       E = !0, C = !1;
     }
-    if (N && !C)
+    if (x && !C)
       return y || (y = new e()), E || i(p) ? a(p, v, g, m, _, y) : u(p, v, w, g, m, _, y);
     if (!(g & f)) {
-      var A = C && l.call(p, "__wrapped__"), O = T && l.call(v, "__wrapped__");
-      if (A || O) {
-        var P = A ? p.value() : p, M = O ? v.value() : v;
+      var A = C && l.call(p, "__wrapped__"), N = T && l.call(v, "__wrapped__");
+      if (A || N) {
+        var P = A ? p.value() : p, M = N ? v.value() : v;
         return y || (y = new e()), _(P, M, g, m, y);
       }
     }
-    return N ? (y || (y = new e()), n(p, v, g, m, _, y)) : !1;
+    return x ? (y || (y = new e()), n(p, v, g, m, _, y)) : !1;
   }
   return We = b, We;
 }
@@ -344,7 +345,7 @@ function uo() {
   return je = a, je;
 }
 var ze, ji;
-function xf() {
+function Of() {
   if (ji) return ze;
   ji = 1;
   var e = uo(), a = ue();
@@ -369,10 +370,10 @@ function so() {
   return Ke = e, Ke;
 }
 var Ye, Ki;
-function Nf() {
+function xf() {
   if (Ki) return Ye;
   Ki = 1;
-  var e = Cf(), a = xf(), u = so();
+  var e = Cf(), a = Of(), u = so();
   function n(r) {
     var t = a(r);
     return t.length == 1 && t[0][2] ? u(t[0][0], t[0][1]) : function(s) {
@@ -405,7 +406,7 @@ function ci() {
   return Xe = r, Xe;
 }
 var Ze, Xi;
-function Of() {
+function Nf() {
   if (Xi) return Ze;
   Xi = 1;
   var e = Xs(), a = "Expected a function";
@@ -427,7 +428,7 @@ var Qe, Zi;
 function kf() {
   if (Zi) return Qe;
   Zi = 1;
-  var e = Of(), a = 500;
+  var e = Nf(), a = 500;
   function u(n) {
     var r = e(n, function(s) {
       return t.size === a && t.clear(), s;
@@ -628,7 +629,7 @@ var pr, va;
 function $() {
   if (va) return pr;
   va = 1;
-  var e = Nf(), a = Gf(), u = ee(), n = U(), r = Df();
+  var e = xf(), a = Gf(), u = ee(), n = U(), r = Df();
   function t(s) {
     return typeof s == "function" ? s : s == null ? u : typeof s == "object" ? n(s) ? a(s[0], s[1]) : e(s) : r(s);
   }
@@ -822,9 +823,9 @@ function mo() {
   }
   return Cr = u, Cr;
 }
-var xr, Sa;
+var Or, Sa;
 function rd() {
-  if (Sa) return xr;
+  if (Sa) return Or;
   Sa = 1;
   var e = Js(), a = ti(), u = me(), n = U(), r = J(), t = ge(), s = tf(), i = _e(), f = "[object Map]", d = "[object Set]", o = Object.prototype, c = o.hasOwnProperty;
   function h(l) {
@@ -842,21 +843,21 @@ function rd() {
         return !1;
     return !0;
   }
-  return xr = h, xr;
+  return Or = h, Or;
 }
-var Nr, Ca;
+var xr, Ca;
 function bo() {
-  if (Ca) return Nr;
+  if (Ca) return xr;
   Ca = 1;
   function e(a) {
     return a === void 0;
   }
-  return Nr = e, Nr;
+  return xr = e, xr;
 }
-var Or, xa;
+var Nr, Oa;
 function yo() {
-  if (xa) return Or;
-  xa = 1;
+  if (Oa) return Nr;
+  Oa = 1;
   var e = we(), a = J();
   function u(n, r) {
     var t = -1, s = a(n) ? Array(n.length) : [];
@@ -864,12 +865,12 @@ function yo() {
       s[++t] = r(i, f, d);
     }), s;
   }
-  return Or = u, Or;
+  return Nr = u, Nr;
 }
-var kr, Na;
+var kr, xa;
 function Eo() {
-  if (Na) return kr;
-  Na = 1;
+  if (xa) return kr;
+  xa = 1;
   var e = ye(), a = $(), u = yo(), n = U();
   function r(t, s) {
     var i = n(t) ? e : u;
@@ -877,10 +878,10 @@ function Eo() {
   }
   return kr = r, kr;
 }
-var Ar, Oa;
+var Ar, Na;
 function nd() {
-  if (Oa) return Ar;
-  Oa = 1;
+  if (Na) return Ar;
+  Na = 1;
   function e(a, u, n, r) {
     var t = -1, s = a == null ? 0 : a.length;
     for (r && s && (n = a[++t]); ++t < s; )
@@ -1616,7 +1617,7 @@ function Co() {
   }, _n;
 }
 var mn, pu;
-function xo() {
+function Oo() {
   if (pu) return mn;
   pu = 1;
   var e = K(), a = Co();
@@ -1649,10 +1650,10 @@ function xo() {
   return mn;
 }
 var bn, gu;
-function xd() {
+function Od() {
   if (gu) return bn;
   gu = 1;
-  var e = xo(), a = K();
+  var e = Oo(), a = K();
   bn = u;
   function u(n, r, t) {
     return a.transform(n.nodes(), function(s, i) {
@@ -1662,7 +1663,7 @@ function xd() {
   return bn;
 }
 var yn, _u;
-function No() {
+function xo() {
   if (_u) return yn;
   _u = 1;
   var e = K();
@@ -1692,10 +1693,10 @@ function No() {
   return yn;
 }
 var En, mu;
-function Nd() {
+function xd() {
   if (mu) return En;
   mu = 1;
-  var e = K(), a = No();
+  var e = K(), a = xo();
   En = u;
   function u(n) {
     return e.filter(a(n), function(r) {
@@ -1705,7 +1706,7 @@ function Nd() {
   return En;
 }
 var qn, bu;
-function Od() {
+function Nd() {
   if (bu) return qn;
   bu = 1;
   var e = K();
@@ -1743,7 +1744,7 @@ function Od() {
   return qn;
 }
 var wn, yu;
-function Oo() {
+function No() {
   if (yu) return wn;
   yu = 1;
   var e = K();
@@ -1767,7 +1768,7 @@ var Rn, Eu;
 function kd() {
   if (Eu) return Rn;
   Eu = 1;
-  var e = Oo();
+  var e = No();
   Rn = a;
   function a(u) {
     try {
@@ -1859,37 +1860,37 @@ function Ld() {
   }
   return Cn;
 }
-var xn, Tu;
+var On, Tu;
 function Md() {
-  return Tu || (Tu = 1, xn = {
+  return Tu || (Tu = 1, On = {
     components: Cd(),
-    dijkstra: xo(),
-    dijkstraAll: xd(),
-    findCycles: Nd(),
-    floydWarshall: Od(),
+    dijkstra: Oo(),
+    dijkstraAll: Od(),
+    findCycles: xd(),
+    floydWarshall: Nd(),
     isAcyclic: kd(),
     postorder: Ad(),
     preorder: Pd(),
     prim: Ld(),
-    tarjan: No(),
-    topsort: Oo()
-  }), xn;
+    tarjan: xo(),
+    topsort: No()
+  }), On;
 }
-var Nn, Su;
+var xn, Su;
 function Gd() {
-  if (Su) return Nn;
+  if (Su) return xn;
   Su = 1;
   var e = Td();
-  return Nn = {
+  return xn = {
     Graph: e.Graph,
     json: Sd(),
     alg: Md(),
     version: e.version
-  }, Nn;
+  }, xn;
 }
-var On, Cu;
+var Nn, Cu;
 function Y() {
-  if (Cu) return On;
+  if (Cu) return Nn;
   Cu = 1;
   var e;
   if (typeof hi == "function")
@@ -1897,12 +1898,12 @@ function Y() {
       e = Gd();
     } catch {
     }
-  return e || (e = window.graphlib), On = e, On;
+  return e || (e = window.graphlib), Nn = e, Nn;
 }
-var kn, xu;
+var kn, Ou;
 function Ie() {
-  if (xu) return kn;
-  xu = 1;
+  if (Ou) return kn;
+  Ou = 1;
   var e = pe(), a = J(), u = ai(), n = Q();
   function r(t, s, i) {
     if (!n(i))
@@ -1912,10 +1913,10 @@ function Ie() {
   }
   return kn = r, kn;
 }
-var An, Nu;
+var An, xu;
 function Fd() {
-  if (Nu) return An;
-  Nu = 1;
+  if (xu) return An;
+  xu = 1;
   var e = Re(), a = pe(), u = Ie(), n = be(), r = Object.prototype, t = r.hasOwnProperty, s = e(function(i, f) {
     i = Object(i);
     var d = -1, o = f.length, c = o > 2 ? f[2] : void 0;
@@ -1928,10 +1929,10 @@ function Fd() {
   });
   return An = s, An;
 }
-var Pn, Ou;
+var Pn, Nu;
 function Dd() {
-  if (Ou) return Pn;
-  Ou = 1;
+  if (Nu) return Pn;
+  Nu = 1;
   var e = $(), a = J(), u = ue();
   function n(r) {
     return function(t, s, i) {
@@ -2162,12 +2163,12 @@ function Qd() {
       e(v, m, C);
       return;
     }
-    var T = E ? E(w, q, m + "", v, g, R) : void 0, N = T === void 0;
-    if (N) {
-      var A = s(q), O = !A && f(q), P = !A && !O && h(q);
-      T = q, A || O || P ? s(w) ? T = w : i(w) ? T = n(w) : O ? (N = !1, T = a(q, !0)) : P ? (N = !1, T = u(q, !0)) : T = [] : c(q) || t(q) ? (T = w, t(w) ? T = b(w) : (!o(w) || d(w)) && (T = r(q))) : N = !1;
+    var T = E ? E(w, q, m + "", v, g, R) : void 0, x = T === void 0;
+    if (x) {
+      var A = s(q), N = !A && f(q), P = !A && !N && h(q);
+      T = q, A || N || P ? s(w) ? T = w : i(w) ? T = n(w) : N ? (x = !1, T = a(q, !0)) : P ? (x = !1, T = u(q, !0)) : T = [] : c(q) || t(q) ? (T = w, t(w) ? T = b(w) : (!o(w) || d(w)) && (T = r(q))) : x = !1;
     }
-    N && (R.set(q, T), y(T, q, _, E, R), R.delete(q)), e(v, m, T);
+    x && (R.set(q, T), y(T, q, _, E, R), R.delete(q)), e(v, m, T);
   }
   return Qn = p, Qn;
 }
@@ -2849,12 +2850,12 @@ function ce() {
   }
   return Ct;
 }
-var xt, Ts;
+var Ot, Ts;
 function Fo() {
-  if (Ts) return xt;
+  if (Ts) return Ot;
   Ts = 1;
   var e = G(), a = Y().Graph, u = ce().slack;
-  xt = n;
+  Ot = n;
   function n(i) {
     var f = new a({ directed: !1 }), d = i.nodes()[0], o = i.nodeCount();
     f.setNode(d, {});
@@ -2882,14 +2883,14 @@ function Fo() {
       f.node(o).rank += d;
     });
   }
-  return xt;
+  return Ot;
 }
-var Nt, Ss;
+var xt, Ss;
 function Ic() {
-  if (Ss) return Nt;
+  if (Ss) return xt;
   Ss = 1;
   var e = G(), a = Fo(), u = ce().slack, n = ce().longestPath, r = Y().alg.preorder, t = Y().alg.postorder, s = H().simplify;
-  Nt = i, i.initLowLimValues = c, i.initCutValues = f, i.calcCutValue = o, i.leaveEdge = l, i.enterEdge = b, i.exchangeEdges = p;
+  xt = i, i.initLowLimValues = c, i.initCutValues = f, i.calcCutValue = o, i.leaveEdge = l, i.enterEdge = b, i.exchangeEdges = p;
   function i(_) {
     _ = s(_), n(_);
     var y = a(_);
@@ -2909,12 +2910,12 @@ function Ic() {
   }
   function o(_, y, E) {
     var R = _.node(E), w = R.parent, q = !0, C = y.edge(E, w), T = 0;
-    return C || (q = !1, C = y.edge(w, E)), T = C.weight, e.forEach(y.nodeEdges(E), function(N) {
-      var A = N.v === E, O = A ? N.w : N.v;
-      if (O !== w) {
-        var P = A === q, M = y.edge(N).weight;
-        if (T += P ? M : -M, g(_, E, O)) {
-          var B = _.edge(E, O).cutvalue;
+    return C || (q = !1, C = y.edge(w, E)), T = C.weight, e.forEach(y.nodeEdges(E), function(x) {
+      var A = x.v === E, N = A ? x.w : x.v;
+      if (N !== w) {
+        var P = A === q, M = y.edge(x).weight;
+        if (T += P ? M : -M, g(_, E, N)) {
+          var B = _.edge(E, N).cutvalue;
           T += P ? -B : B;
         }
       }
@@ -2937,13 +2938,13 @@ function Ic() {
   function b(_, y, E) {
     var R = E.v, w = E.w;
     y.hasEdge(R, w) || (R = E.w, w = E.v);
-    var q = _.node(R), C = _.node(w), T = q, N = !1;
-    q.lim > C.lim && (T = C, N = !0);
-    var A = e.filter(y.edges(), function(O) {
-      return N === m(_, _.node(O.v), T) && N !== m(_, _.node(O.w), T);
+    var q = _.node(R), C = _.node(w), T = q, x = !1;
+    q.lim > C.lim && (T = C, x = !0);
+    var A = e.filter(y.edges(), function(N) {
+      return x === m(_, _.node(N.v), T) && x !== m(_, _.node(N.w), T);
     });
-    return e.minBy(A, function(O) {
-      return u(y, O);
+    return e.minBy(A, function(N) {
+      return u(y, N);
     });
   }
   function p(_, y, E, R) {
@@ -2965,14 +2966,14 @@ function Ic() {
   function m(_, y, E) {
     return E.low <= y.lim && y.lim <= E.lim;
   }
-  return Nt;
+  return xt;
 }
-var Ot, Cs;
+var Nt, Cs;
 function Tc() {
-  if (Cs) return Ot;
+  if (Cs) return Nt;
   Cs = 1;
   var e = ce(), a = e.longestPath, u = Fo(), n = Ic();
-  Ot = r;
+  Nt = r;
   function r(f) {
     switch (f.graph().ranker) {
       case "network-simplex":
@@ -2995,12 +2996,12 @@ function Tc() {
   function i(f) {
     n(f);
   }
-  return Ot;
+  return Nt;
 }
-var kt, xs;
+var kt, Os;
 function Sc() {
-  if (xs) return kt;
-  xs = 1;
+  if (Os) return kt;
+  Os = 1;
   var e = G();
   kt = a;
   function a(r) {
@@ -3041,10 +3042,10 @@ function Sc() {
   }
   return kt;
 }
-var At, Ns;
+var At, xs;
 function Cc() {
-  if (Ns) return At;
-  Ns = 1;
+  if (xs) return At;
+  xs = 1;
   var e = G(), a = H();
   At = {
     run: u,
@@ -3107,10 +3108,10 @@ function Cc() {
   }
   return At;
 }
-var Pt, Os;
-function xc() {
-  if (Os) return Pt;
-  Os = 1;
+var Pt, Ns;
+function Oc() {
+  if (Ns) return Pt;
+  Ns = 1;
   var e = G(), a = H();
   Pt = u;
   function u(r) {
@@ -3131,7 +3132,7 @@ function xc() {
   return Pt;
 }
 var Lt, ks;
-function Nc() {
+function xc() {
   if (ks) return Lt;
   ks = 1;
   var e = G();
@@ -3184,7 +3185,7 @@ function Nc() {
   return Lt;
 }
 var Mt, As;
-function Oc() {
+function Nc() {
   if (As) return Mt;
   As = 1;
   var e = G();
@@ -3453,7 +3454,7 @@ var Vt, Us;
 function Dc() {
   if (Us) return Vt;
   Us = 1;
-  var e = G(), a = Oc(), u = kc(), n = Mc(), r = Gc(), t = Fc(), s = Y().Graph, i = H();
+  var e = G(), a = Nc(), u = kc(), n = Mc(), r = Gc(), t = Fc(), s = Y().Graph, i = H();
   Vt = f;
   function f(h) {
     var l = i.maxRank(h), b = d(h, e.range(1, l + 1), "inEdges"), p = d(h, e.range(l - 1, -1, -1), "outEdges"), v = a(h);
@@ -3509,9 +3510,9 @@ function Bc() {
     var _ = {};
     function y(E, R) {
       var w = 0, q = 0, C = E.length, T = e.last(R);
-      return e.forEach(R, function(N, A) {
-        var O = t(g, N), P = O ? g.node(O).order : C;
-        (O || N === T) && (e.forEach(R.slice(q, A + 1), function(M) {
+      return e.forEach(R, function(x, A) {
+        var N = t(g, x), P = N ? g.node(N).order : C;
+        (N || x === T) && (e.forEach(R.slice(q, A + 1), function(M) {
           e.forEach(g.predecessors(M), function(B) {
             var fe = g.node(B), de = fe.order;
             (de < w || P < de) && !(fe.dummy && g.node(M).dummy) && s(_, B, M);
@@ -3524,20 +3525,20 @@ function Bc() {
   function r(g, m) {
     var _ = {};
     function y(R, w, q, C, T) {
-      var N;
+      var x;
       e.forEach(e.range(w, q), function(A) {
-        N = R[A], g.node(N).dummy && e.forEach(g.predecessors(N), function(O) {
-          var P = g.node(O);
-          P.dummy && (P.order < C || P.order > T) && s(_, O, N);
+        x = R[A], g.node(x).dummy && e.forEach(g.predecessors(x), function(N) {
+          var P = g.node(N);
+          P.dummy && (P.order < C || P.order > T) && s(_, N, x);
         });
       });
     }
     function E(R, w) {
       var q = -1, C, T = 0;
-      return e.forEach(w, function(N, A) {
-        if (g.node(N).dummy === "border") {
-          var O = g.predecessors(N);
-          O.length && (C = g.node(O[0]).order, y(w, T, A, q, C), T = A, q = C);
+      return e.forEach(w, function(x, A) {
+        if (g.node(x).dummy === "border") {
+          var N = g.predecessors(x);
+          N.length && (C = g.node(N[0]).order, y(w, T, A, q, C), T = A, q = C);
         }
         y(w, T, w.length, C, R.length);
       }), w;
@@ -3574,13 +3575,13 @@ function Bc() {
     }), e.forEach(m, function(q) {
       var C = -1;
       e.forEach(q, function(T) {
-        var N = y(T);
-        if (N.length) {
-          N = e.sortBy(N, function(B) {
+        var x = y(T);
+        if (x.length) {
+          x = e.sortBy(x, function(B) {
             return w[B];
           });
-          for (var A = (N.length - 1) / 2, O = Math.floor(A), P = Math.ceil(A); O <= P; ++O) {
-            var M = N[O];
+          for (var A = (x.length - 1) / 2, N = Math.floor(A), P = Math.ceil(A); N <= P; ++N) {
+            var M = x[N];
             R[T] === T && C < w[M] && !i(_, T, M) && (R[M] = T, R[T] = E[T] = E[M], C = w[M]);
           }
         }
@@ -3589,22 +3590,22 @@ function Bc() {
   }
   function d(g, m, _, y, E) {
     var R = {}, w = o(g, m, _, E), q = E ? "borderLeft" : "borderRight";
-    function C(A, O) {
+    function C(A, N) {
       for (var P = w.nodes(), M = P.pop(), B = {}; M; )
-        B[M] ? A(M) : (B[M] = !0, P.push(M), P = P.concat(O(M))), M = P.pop();
+        B[M] ? A(M) : (B[M] = !0, P.push(M), P = P.concat(N(M))), M = P.pop();
     }
     function T(A) {
-      R[A] = w.inEdges(A).reduce(function(O, P) {
-        return Math.max(O, R[P.v] + w.edge(P));
+      R[A] = w.inEdges(A).reduce(function(N, P) {
+        return Math.max(N, R[P.v] + w.edge(P));
       }, 0);
     }
-    function N(A) {
-      var O = w.outEdges(A).reduce(function(M, B) {
+    function x(A) {
+      var N = w.outEdges(A).reduce(function(M, B) {
         return Math.min(M, R[B.w] - w.edge(B));
       }, Number.POSITIVE_INFINITY), P = g.node(A);
-      O !== Number.POSITIVE_INFINITY && P.borderType !== q && (R[A] = Math.max(R[A], O));
+      N !== Number.POSITIVE_INFINITY && P.borderType !== q && (R[A] = Math.max(R[A], N));
     }
-    return C(T, w.predecessors.bind(w)), C(N, w.successors.bind(w)), e.forEach(y, function(A) {
+    return C(T, w.predecessors.bind(w)), C(x, w.successors.bind(w)), e.forEach(y, function(A) {
       R[A] = R[_[A]];
     }), R;
   }
@@ -3613,10 +3614,10 @@ function Bc() {
     return e.forEach(m, function(q) {
       var C;
       e.forEach(q, function(T) {
-        var N = _[T];
-        if (E.setNode(N), C) {
-          var A = _[C], O = E.edge(A, N);
-          E.setEdge(A, N, Math.max(w(g, T, C), O || 0));
+        var x = _[T];
+        if (E.setNode(x), C) {
+          var A = _[C], N = E.edge(A, x);
+          E.setEdge(A, x, Math.max(w(g, T, C), N || 0));
         }
         C = T;
       });
@@ -3637,8 +3638,8 @@ function Bc() {
       e.forEach(["l", "r"], function(w) {
         var q = R + w, C = g[q], T;
         if (C !== m) {
-          var N = e.values(C);
-          T = w === "l" ? y - e.min(N) : E - e.max(N), T && (g[q] = e.mapValues(C, function(A) {
+          var x = e.values(C);
+          T = w === "l" ? y - e.min(x) : E - e.max(x), T && (g[q] = e.mapValues(C, function(A) {
             return A + T;
           }));
         }
@@ -3663,16 +3664,16 @@ function Bc() {
         q === "r" && (E = e.map(E, function(A) {
           return e.values(A).reverse();
         }));
-        var C = (w === "u" ? g.predecessors : g.successors).bind(g), T = f(g, E, _, C), N = d(
+        var C = (w === "u" ? g.predecessors : g.successors).bind(g), T = f(g, E, _, C), x = d(
           g,
           E,
           T.root,
           T.align,
           q === "r"
         );
-        q === "r" && (N = e.mapValues(N, function(A) {
+        q === "r" && (x = e.mapValues(x, function(A) {
           return -A;
-        })), y[w + q] = N;
+        })), y[w + q] = x;
       });
     });
     var R = c(g, y);
@@ -3735,17 +3736,17 @@ var Kt, Vs;
 function Wc() {
   if (Vs) return Kt;
   Vs = 1;
-  var e = G(), a = wc(), u = Rc(), n = Tc(), r = H().normalizeRanks, t = Sc(), s = H().removeEmptyRanks, i = Cc(), f = xc(), d = Nc(), o = Dc(), c = Uc(), h = H(), l = Y().Graph;
+  var e = G(), a = wc(), u = Rc(), n = Tc(), r = H().normalizeRanks, t = Sc(), s = H().removeEmptyRanks, i = Cc(), f = Oc(), d = xc(), o = Dc(), c = Uc(), h = H(), l = Y().Graph;
   Kt = b;
   function b(I, S) {
-    var x = S && S.debugTiming ? h.time : h.notime;
-    x("layout", function() {
-      var k = x("  buildLayoutGraph", function() {
+    var O = S && S.debugTiming ? h.time : h.notime;
+    O("layout", function() {
+      var k = O("  buildLayoutGraph", function() {
         return C(I);
       });
-      x("  runLayout", function() {
-        p(k, x);
-      }), x("  updateInputGraph", function() {
+      O("  runLayout", function() {
+        p(k, O);
+      }), O("  updateInputGraph", function() {
         v(I, k);
       });
     });
@@ -3762,7 +3763,7 @@ function Wc() {
     }), S("    rank", function() {
       n(h.asNonCompoundGraph(I));
     }), S("    injectEdgeLabelProxies", function() {
-      N(I);
+      x(I);
     }), S("    removeEmptyRanks", function() {
       s(I);
     }), S("    nestingGraph.cleanup", function() {
@@ -3772,7 +3773,7 @@ function Wc() {
     }), S("    assignRankMinMax", function() {
       A(I);
     }), S("    removeEdgeLabelProxies", function() {
-      O(I);
+      N(I);
     }), S("    normalize.run", function() {
       u.run(I);
     }), S("    parentDummyChains", function() {
@@ -3808,11 +3809,11 @@ function Wc() {
     });
   }
   function v(I, S) {
-    e.forEach(I.nodes(), function(x) {
-      var k = I.node(x), L = S.node(x);
-      k && (k.x = L.x, k.y = L.y, S.children(x).length && (k.width = L.width, k.height = L.height));
-    }), e.forEach(I.edges(), function(x) {
-      var k = I.edge(x), L = S.edge(x);
+    e.forEach(I.nodes(), function(O) {
+      var k = I.node(O), L = S.node(O);
+      k && (k.x = L.x, k.y = L.y, S.children(O).length && (k.width = L.width, k.height = L.height));
+    }), e.forEach(I.edges(), function(O) {
+      var k = I.edge(O), L = S.edge(O);
       k.points = L.points, e.has(L, "x") && (k.x = L.x, k.y = L.y);
     }), I.graph().width = S.graph().width, I.graph().height = S.graph().height;
   }
@@ -3825,12 +3826,12 @@ function Wc() {
     labelpos: "r"
   }, q = ["labelpos"];
   function C(I) {
-    var S = new l({ multigraph: !0, compound: !0 }), x = Ce(I.graph());
+    var S = new l({ multigraph: !0, compound: !0 }), O = Ce(I.graph());
     return S.setGraph(e.merge(
       {},
       m,
-      Se(x, g),
-      e.pick(x, _)
+      Se(O, g),
+      e.pick(O, _)
     )), e.forEach(I.nodes(), function(k) {
       var L = Ce(I.node(k));
       S.setNode(k, e.defaults(Se(L, y), E)), S.setParent(k, I.parent(k));
@@ -3846,15 +3847,15 @@ function Wc() {
   }
   function T(I) {
     var S = I.graph();
-    S.ranksep /= 2, e.forEach(I.edges(), function(x) {
-      var k = I.edge(x);
+    S.ranksep /= 2, e.forEach(I.edges(), function(O) {
+      var k = I.edge(O);
       k.minlen *= 2, k.labelpos.toLowerCase() !== "c" && (S.rankdir === "TB" || S.rankdir === "BT" ? k.width += k.labeloffset : k.height += k.labeloffset);
     });
   }
-  function N(I) {
+  function x(I) {
     e.forEach(I.edges(), function(S) {
-      var x = I.edge(S);
-      if (x.width && x.height) {
+      var O = I.edge(S);
+      if (O.width && O.height) {
         var k = I.node(S.v), L = I.node(S.w), F = { rank: (L.rank - k.rank) / 2 + k.rank, e: S };
         h.addDummyNode(I, "edge-proxy", F, "_ep");
       }
@@ -3862,22 +3863,22 @@ function Wc() {
   }
   function A(I) {
     var S = 0;
-    e.forEach(I.nodes(), function(x) {
-      var k = I.node(x);
+    e.forEach(I.nodes(), function(O) {
+      var k = I.node(O);
       k.borderTop && (k.minRank = I.node(k.borderTop).rank, k.maxRank = I.node(k.borderBottom).rank, S = e.max(S, k.maxRank));
     }), I.graph().maxRank = S;
   }
-  function O(I) {
+  function N(I) {
     e.forEach(I.nodes(), function(S) {
-      var x = I.node(S);
-      x.dummy === "edge-proxy" && (I.edge(x.e).labelRank = x.rank, I.removeNode(S));
+      var O = I.node(S);
+      O.dummy === "edge-proxy" && (I.edge(O.e).labelRank = O.rank, I.removeNode(S));
     });
   }
   function P(I) {
-    var S = Number.POSITIVE_INFINITY, x = 0, k = Number.POSITIVE_INFINITY, L = 0, F = I.graph(), D = F.marginx || 0, V = F.marginy || 0;
+    var S = Number.POSITIVE_INFINITY, O = 0, k = Number.POSITIVE_INFINITY, L = 0, F = I.graph(), D = F.marginx || 0, V = F.marginy || 0;
     function wi(j) {
       var W = j.x, te = j.y, Ri = j.width, Ii = j.height;
-      S = Math.min(S, W - Ri / 2), x = Math.max(x, W + Ri / 2), k = Math.min(k, te - Ii / 2), L = Math.max(L, te + Ii / 2);
+      S = Math.min(S, W - Ri / 2), O = Math.max(O, W + Ri / 2), k = Math.min(k, te - Ii / 2), L = Math.max(L, te + Ii / 2);
     }
     e.forEach(I.nodes(), function(j) {
       wi(I.node(j));
@@ -3892,39 +3893,39 @@ function Wc() {
       e.forEach(W.points, function(te) {
         te.x -= S, te.y -= k;
       }), e.has(W, "x") && (W.x -= S), e.has(W, "y") && (W.y -= k);
-    }), F.width = x - S + D, F.height = L - k + V;
+    }), F.width = O - S + D, F.height = L - k + V;
   }
   function M(I) {
     e.forEach(I.edges(), function(S) {
-      var x = I.edge(S), k = I.node(S.v), L = I.node(S.w), F, D;
-      x.points ? (F = x.points[0], D = x.points[x.points.length - 1]) : (x.points = [], F = L, D = k), x.points.unshift(h.intersectRect(k, F)), x.points.push(h.intersectRect(L, D));
+      var O = I.edge(S), k = I.node(S.v), L = I.node(S.w), F, D;
+      O.points ? (F = O.points[0], D = O.points[O.points.length - 1]) : (O.points = [], F = L, D = k), O.points.unshift(h.intersectRect(k, F)), O.points.push(h.intersectRect(L, D));
     });
   }
   function B(I) {
     e.forEach(I.edges(), function(S) {
-      var x = I.edge(S);
-      if (e.has(x, "x"))
-        switch ((x.labelpos === "l" || x.labelpos === "r") && (x.width -= x.labeloffset), x.labelpos) {
+      var O = I.edge(S);
+      if (e.has(O, "x"))
+        switch ((O.labelpos === "l" || O.labelpos === "r") && (O.width -= O.labeloffset), O.labelpos) {
           case "l":
-            x.x -= x.width / 2 + x.labeloffset;
+            O.x -= O.width / 2 + O.labeloffset;
             break;
           case "r":
-            x.x += x.width / 2 + x.labeloffset;
+            O.x += O.width / 2 + O.labeloffset;
             break;
         }
     });
   }
   function fe(I) {
     e.forEach(I.edges(), function(S) {
-      var x = I.edge(S);
-      x.reversed && x.points.reverse();
+      var O = I.edge(S);
+      O.reversed && O.points.reverse();
     });
   }
   function de(I) {
     e.forEach(I.nodes(), function(S) {
       if (I.children(S).length) {
-        var x = I.node(S), k = I.node(x.borderTop), L = I.node(x.borderBottom), F = I.node(e.last(x.borderLeft)), D = I.node(e.last(x.borderRight));
-        x.width = Math.abs(D.x - F.x), x.height = Math.abs(L.y - k.y), x.x = F.x + x.width / 2, x.y = k.y + x.height / 2;
+        var O = I.node(S), k = I.node(O.borderTop), L = I.node(O.borderBottom), F = I.node(e.last(O.borderLeft)), D = I.node(e.last(O.borderRight));
+        O.width = Math.abs(D.x - F.x), O.height = Math.abs(L.y - k.y), O.x = F.x + O.width / 2, O.y = k.y + O.height / 2;
       }
     }), e.forEach(I.nodes(), function(S) {
       I.node(S).dummy === "border" && I.removeNode(S);
@@ -3933,16 +3934,16 @@ function Wc() {
   function Yo(I) {
     e.forEach(I.edges(), function(S) {
       if (S.v === S.w) {
-        var x = I.node(S.v);
-        x.selfEdges || (x.selfEdges = []), x.selfEdges.push({ e: S, label: I.edge(S) }), I.removeEdge(S);
+        var O = I.node(S.v);
+        O.selfEdges || (O.selfEdges = []), O.selfEdges.push({ e: S, label: I.edge(S) }), I.removeEdge(S);
       }
     });
   }
   function $o(I) {
     var S = h.buildLayerMatrix(I);
-    e.forEach(S, function(x) {
+    e.forEach(S, function(O) {
       var k = 0;
-      e.forEach(x, function(L, F) {
+      e.forEach(O, function(L, F) {
         var D = I.node(L);
         D.order = F + k, e.forEach(D.selfEdges, function(V) {
           h.addDummyNode(I, "selfedge", {
@@ -3959,16 +3960,16 @@ function Wc() {
   }
   function Xo(I) {
     e.forEach(I.nodes(), function(S) {
-      var x = I.node(S);
-      if (x.dummy === "selfedge") {
-        var k = I.node(x.e.v), L = k.x + k.width / 2, F = k.y, D = x.x - L, V = k.height / 2;
-        I.setEdge(x.e, x.label), I.removeNode(S), x.label.points = [
+      var O = I.node(S);
+      if (O.dummy === "selfedge") {
+        var k = I.node(O.e.v), L = k.x + k.width / 2, F = k.y, D = O.x - L, V = k.height / 2;
+        I.setEdge(O.e, O.label), I.removeNode(S), O.label.points = [
           { x: L + 2 * D / 3, y: F - V },
           { x: L + 5 * D / 6, y: F - V },
           { x: L + D, y: F },
           { x: L + 5 * D / 6, y: F + V },
           { x: L + 2 * D / 3, y: F + V }
-        ], x.label.x = x.x, x.label.y = x.y;
+        ], O.label.x = O.x, O.label.y = O.y;
       }
     });
   }
@@ -3977,8 +3978,8 @@ function Wc() {
   }
   function Ce(I) {
     var S = {};
-    return e.forEach(I, function(x, k) {
-      S[k.toLowerCase()] = x;
+    return e.forEach(I, function(O, k) {
+      S[k.toLowerCase()] = O;
     }), S;
   }
   return Kt;
@@ -4272,16 +4273,16 @@ function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
   for (const q of m)
     if (!i[q.cluster.uid] && !f.has(q.cluster.uid)) {
       q.cluster.taskNode?.task?.type === "io.kestra.core.tasks.flows.Dag" && y.push(q.cluster.taskNode.uid);
-      for (const O of q.nodes)
-        g[O] = q.cluster;
-      const C = q.cluster.uid, T = v.node(C), N = q.parents ? q.parents[q.parents.length - 1] : void 0, A = jo(q.cluster);
+      for (const N of q.nodes)
+        g[N] = q.cluster;
+      const C = q.cluster.uid, T = v.node(C), x = q.parents ? q.parents[q.parents.length - 1] : void 0, A = jo(q.cluster);
       b.push({
         id: C,
         type: "cluster",
-        parentNode: N,
+        parentNode: x,
         position: he(
           T,
-          N ? v.node(N) : void 0
+          x ? v.node(x) : void 0
         ),
         style: {
           width: C === X && s ? Z.TRIGGER_CLUSTER_WIDTH + "px" : T.width + "px",
@@ -4301,15 +4302,15 @@ function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
       const C = v.node(q.uid);
       let T = "task";
       Qt(q) ? T = "dot" : q.type.endsWith("CustomGraphNode") ? T = "custom" : q.type.includes("GraphTrigger") ? T = "trigger" : q.type === "collapsedcluster" && (T = "collapsedcluster");
-      const N = Wo(q, f), A = o || q.task?.type?.includes("$") || y.some(
+      const x = Wo(q, f), A = o || q.task?.type?.includes("$") || y.some(
         (M) => q.uid.startsWith(M + ".")
-      ), O = g[q.uid], P = l(q, le, ve);
+      ), N = g[q.uid], P = l(q, le, ve);
       b.push({
         id: q.uid,
         type: T,
         position: he(
           C,
-          O ? v.node(O.uid) : void 0
+          N ? v.node(N.uid) : void 0
         ),
         style: {
           width: P.width + "px",
@@ -4317,15 +4318,15 @@ function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
         },
         sourcePosition: s ? z.Right : z.Bottom,
         targetPosition: s ? z.Left : z.Top,
-        parentNode: O ? O.uid : void 0,
+        parentNode: N ? N.uid : void 0,
         draggable: T === "task" ? !A : !1,
         data: {
           node: q,
-          parent: O || void 0,
-          namespace: O?.taskNode?.task?.namespace ?? u,
-          flowId: O?.taskNode?.task?.flowId ?? a,
-          isFlowable: O?.uid === ie + q.uid && !q.type.endsWith("SubflowGraphTask"),
-          color: N,
+          parent: N || void 0,
+          namespace: N?.taskNode?.task?.namespace ?? u,
+          flowId: N?.taskNode?.task?.flowId ?? a,
+          isFlowable: N?.uid === ie + q.uid && !q.type.endsWith("SubflowGraphTask"),
+          color: x,
           expandable: zo(
             q,
             g,
@@ -4337,7 +4338,7 @@ function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
           executionId: q.executionId,
           unused: q.unused
         },
-        class: q.type === "collapsedcluster" ? `ks-topology-${N}-border rounded` : ""
+        class: q.type === "collapsedcluster" ? `ks-topology-${x}-border rounded` : ""
       });
     }
   const R = _.filter((q) => q.taskNode).map((q) => q.taskNode.uid), w = n.edges ?? [];
@@ -4349,9 +4350,9 @@ function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
       t
     );
     if (C) {
-      const T = Vo(q, E, g), N = E[C.target]?.type ?? "", A = E[C.source]?.type ?? "";
-      let O;
-      typeof N == "string" && N.endsWith("GraphClusterRoot") ? O = "top" : typeof A == "string" && A.endsWith("GraphClusterEnd") && (O = "bottom"), b.push({
+      const T = Vo(q, E, g), x = E[C.target]?.type ?? "", A = E[C.source]?.type ?? "";
+      let N;
+      typeof x == "string" && x.endsWith("GraphClusterRoot") ? N = "top" : typeof A == "string" && A.endsWith("GraphClusterEnd") && (N = "bottom"), b.push({
         id: C.source + "|" + C.target,
         source: C.source,
         target: C.target,
@@ -4368,7 +4369,7 @@ function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
             R,
             y
           ),
-          edgeBoundary: O,
+          edgeBoundary: N,
           haveDashArray: E[q.source].type.endsWith("GraphTrigger") || E[q.target].type.endsWith("GraphTrigger") || q.source.startsWith(X),
           color: T,
           unused: q.unused
@@ -4500,4 +4501,4 @@ export {
   Ei as y,
   Te as z
 };
-//# sourceMappingURL=VueFlowUtils-CVECjUbY.js.map
+//# sourceMappingURL=VueFlowUtils-Ca_LeFFY.js.map