@kestra-io/ui-libs 0.0.206 → 0.0.208
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/kestra-index.cjs.js +7 -7
- package/dist/kestra-index.cjs.js.map +1 -1
- package/dist/kestra-index.es.js +113 -112
- package/dist/kestra-index.es.js.map +1 -1
- package/dist/ui-libs.css +1 -1
- package/dist/utils/VueFlowUtils.d.ts.map +1 -1
- package/package.json +1 -1
- package/src/components/nodes/BasicNode.vue +1 -1
- package/src/utils/VueFlowUtils.ts +1 -0
package/dist/kestra-index.es.js
CHANGED
|
@@ -347,14 +347,14 @@ function Zm() {
|
|
|
347
347
|
if (dl) return Lr;
|
|
348
348
|
dl = 1;
|
|
349
349
|
var e = us(), t = um(), n = Wn(), r = Nf(), i = Xm(), a = ys(), o = 1, s = 2, l = "[object Boolean]", u = "[object Date]", c = "[object Error]", d = "[object Map]", f = "[object Number]", h = "[object RegExp]", w = "[object Set]", _ = "[object String]", v = "[object Symbol]", p = "[object ArrayBuffer]", g = "[object DataView]", y = e ? e.prototype : void 0, m = y ? y.valueOf : void 0;
|
|
350
|
-
function C(S, b, N, R, D,
|
|
350
|
+
function C(S, b, N, R, D, B, q) {
|
|
351
351
|
switch (N) {
|
|
352
352
|
case g:
|
|
353
353
|
if (S.byteLength != b.byteLength || S.byteOffset != b.byteOffset)
|
|
354
354
|
return !1;
|
|
355
355
|
S = S.buffer, b = b.buffer;
|
|
356
356
|
case p:
|
|
357
|
-
return !(S.byteLength != b.byteLength || !
|
|
357
|
+
return !(S.byteLength != b.byteLength || !B(new t(S), new t(b)));
|
|
358
358
|
case l:
|
|
359
359
|
case u:
|
|
360
360
|
case f:
|
|
@@ -374,7 +374,7 @@ function Zm() {
|
|
|
374
374
|
if (V)
|
|
375
375
|
return V == b;
|
|
376
376
|
R |= s, q.set(S, b);
|
|
377
|
-
var P = r(Z(S), Z(b), R, D,
|
|
377
|
+
var P = r(Z(S), Z(b), R, D, B, q);
|
|
378
378
|
return q.delete(S), P;
|
|
379
379
|
case v:
|
|
380
380
|
if (m)
|
|
@@ -430,13 +430,13 @@ function Qm() {
|
|
|
430
430
|
function w(_, v, p, g, y, m) {
|
|
431
431
|
var C = a(_), S = a(v), b = C ? c : i(_), N = S ? c : i(v);
|
|
432
432
|
b = b == u ? d : b, N = N == u ? d : N;
|
|
433
|
-
var R = b == d, D = N == d,
|
|
434
|
-
if (
|
|
433
|
+
var R = b == d, D = N == d, B = b == N;
|
|
434
|
+
if (B && o(_)) {
|
|
435
435
|
if (!o(v))
|
|
436
436
|
return !1;
|
|
437
437
|
C = !0, R = !1;
|
|
438
438
|
}
|
|
439
|
-
if (
|
|
439
|
+
if (B && !R)
|
|
440
440
|
return m || (m = new e()), C || s(_) ? t(_, v, p, g, y, m) : n(_, v, b, p, g, y, m);
|
|
441
441
|
if (!(p & l)) {
|
|
442
442
|
var q = R && h.call(_, "__wrapped__"), Z = D && h.call(v, "__wrapped__");
|
|
@@ -445,7 +445,7 @@ function Qm() {
|
|
|
445
445
|
return m || (m = new e()), y(re, V, p, g, m);
|
|
446
446
|
}
|
|
447
447
|
}
|
|
448
|
-
return
|
|
448
|
+
return B ? (m || (m = new e()), r(_, v, p, g, y, m)) : !1;
|
|
449
449
|
}
|
|
450
450
|
return Or = w, Or;
|
|
451
451
|
}
|
|
@@ -2947,12 +2947,12 @@ function $1() {
|
|
|
2947
2947
|
e(v, g, R);
|
|
2948
2948
|
return;
|
|
2949
2949
|
}
|
|
2950
|
-
var D = C ? C(b, N, g + "", v, p, S) : void 0,
|
|
2951
|
-
if (
|
|
2950
|
+
var D = C ? C(b, N, g + "", v, p, S) : void 0, B = D === void 0;
|
|
2951
|
+
if (B) {
|
|
2952
2952
|
var q = o(N), Z = !q && l(N), re = !q && !Z && f(N);
|
|
2953
|
-
D = N, q || Z || re ? o(b) ? D = b : s(b) ? D = r(b) : Z ? (
|
|
2953
|
+
D = N, q || Z || re ? o(b) ? D = b : s(b) ? D = r(b) : Z ? (B = !1, D = t(N, !0)) : re ? (B = !1, D = n(N, !0)) : D = [] : d(N) || a(N) ? (D = b, a(b) ? D = w(b) : (!c(b) || u(b)) && (D = i(N))) : B = !1;
|
|
2954
2954
|
}
|
|
2955
|
-
|
|
2955
|
+
B && (S.set(N, D), m(D, N, y, C, S), S.delete(N)), e(v, g, D);
|
|
2956
2956
|
}
|
|
2957
2957
|
return $a = _, $a;
|
|
2958
2958
|
}
|
|
@@ -3694,10 +3694,10 @@ function u_() {
|
|
|
3694
3694
|
}
|
|
3695
3695
|
function c(y, m, C) {
|
|
3696
3696
|
var S = y.node(C), b = S.parent, N = !0, R = m.edge(C, b), D = 0;
|
|
3697
|
-
return R || (N = !1, R = m.edge(b, C)), D = R.weight, e.forEach(m.nodeEdges(C), function(
|
|
3698
|
-
var q =
|
|
3697
|
+
return R || (N = !1, R = m.edge(b, C)), D = R.weight, e.forEach(m.nodeEdges(C), function(B) {
|
|
3698
|
+
var q = B.v === C, Z = q ? B.w : B.v;
|
|
3699
3699
|
if (Z !== b) {
|
|
3700
|
-
var re = q === N, V = m.edge(
|
|
3700
|
+
var re = q === N, V = m.edge(B).weight;
|
|
3701
3701
|
if (D += re ? V : -V, p(y, C, Z)) {
|
|
3702
3702
|
var P = y.edge(C, Z).cutvalue;
|
|
3703
3703
|
D += re ? -P : P;
|
|
@@ -3722,10 +3722,10 @@ function u_() {
|
|
|
3722
3722
|
function w(y, m, C) {
|
|
3723
3723
|
var S = C.v, b = C.w;
|
|
3724
3724
|
m.hasEdge(S, b) || (S = C.w, b = C.v);
|
|
3725
|
-
var N = y.node(S), R = y.node(b), D = N,
|
|
3726
|
-
N.lim > R.lim && (D = R,
|
|
3725
|
+
var N = y.node(S), R = y.node(b), D = N, B = !1;
|
|
3726
|
+
N.lim > R.lim && (D = R, B = !0);
|
|
3727
3727
|
var q = e.filter(m.edges(), function(Z) {
|
|
3728
|
-
return
|
|
3728
|
+
return B === g(y, y.node(Z.v), D) && B !== g(y, y.node(Z.w), D);
|
|
3729
3729
|
});
|
|
3730
3730
|
return e.minBy(q, function(Z) {
|
|
3731
3731
|
return n(m, Z);
|
|
@@ -4294,9 +4294,9 @@ function S_() {
|
|
|
4294
4294
|
var y = {};
|
|
4295
4295
|
function m(C, S) {
|
|
4296
4296
|
var b = 0, N = 0, R = C.length, D = e.last(S);
|
|
4297
|
-
return e.forEach(S, function(
|
|
4298
|
-
var Z = a(p,
|
|
4299
|
-
(Z ||
|
|
4297
|
+
return e.forEach(S, function(B, q) {
|
|
4298
|
+
var Z = a(p, B), re = Z ? p.node(Z).order : R;
|
|
4299
|
+
(Z || B === D) && (e.forEach(S.slice(N, q + 1), function(V) {
|
|
4300
4300
|
e.forEach(p.predecessors(V), function(P) {
|
|
4301
4301
|
var ie = p.node(P), J = ie.order;
|
|
4302
4302
|
(J < b || re < J) && !(ie.dummy && p.node(V).dummy) && o(y, P, V);
|
|
@@ -4309,19 +4309,19 @@ function S_() {
|
|
|
4309
4309
|
function i(p, g) {
|
|
4310
4310
|
var y = {};
|
|
4311
4311
|
function m(S, b, N, R, D) {
|
|
4312
|
-
var
|
|
4312
|
+
var B;
|
|
4313
4313
|
e.forEach(e.range(b, N), function(q) {
|
|
4314
|
-
|
|
4314
|
+
B = S[q], p.node(B).dummy && e.forEach(p.predecessors(B), function(Z) {
|
|
4315
4315
|
var re = p.node(Z);
|
|
4316
|
-
re.dummy && (re.order < R || re.order > D) && o(y, Z,
|
|
4316
|
+
re.dummy && (re.order < R || re.order > D) && o(y, Z, B);
|
|
4317
4317
|
});
|
|
4318
4318
|
});
|
|
4319
4319
|
}
|
|
4320
4320
|
function C(S, b) {
|
|
4321
4321
|
var N = -1, R, D = 0;
|
|
4322
|
-
return e.forEach(b, function(
|
|
4323
|
-
if (p.node(
|
|
4324
|
-
var Z = p.predecessors(
|
|
4322
|
+
return e.forEach(b, function(B, q) {
|
|
4323
|
+
if (p.node(B).dummy === "border") {
|
|
4324
|
+
var Z = p.predecessors(B);
|
|
4325
4325
|
Z.length && (R = p.node(Z[0]).order, m(b, D, q, N, R), D = q, N = R);
|
|
4326
4326
|
}
|
|
4327
4327
|
m(b, D, b.length, R, S.length);
|
|
@@ -4359,13 +4359,13 @@ function S_() {
|
|
|
4359
4359
|
}), e.forEach(g, function(N) {
|
|
4360
4360
|
var R = -1;
|
|
4361
4361
|
e.forEach(N, function(D) {
|
|
4362
|
-
var
|
|
4363
|
-
if (
|
|
4364
|
-
|
|
4362
|
+
var B = m(D);
|
|
4363
|
+
if (B.length) {
|
|
4364
|
+
B = e.sortBy(B, function(P) {
|
|
4365
4365
|
return b[P];
|
|
4366
4366
|
});
|
|
4367
|
-
for (var q = (
|
|
4368
|
-
var V =
|
|
4367
|
+
for (var q = (B.length - 1) / 2, Z = Math.floor(q), re = Math.ceil(q); Z <= re; ++Z) {
|
|
4368
|
+
var V = B[Z];
|
|
4369
4369
|
S[D] === D && R < b[V] && !s(y, D, V) && (S[V] = D, S[D] = C[D] = C[V], R = b[V]);
|
|
4370
4370
|
}
|
|
4371
4371
|
}
|
|
@@ -4383,13 +4383,13 @@ function S_() {
|
|
|
4383
4383
|
return Math.max(Z, S[re.v] + b.edge(re));
|
|
4384
4384
|
}, 0);
|
|
4385
4385
|
}
|
|
4386
|
-
function
|
|
4386
|
+
function B(q) {
|
|
4387
4387
|
var Z = b.outEdges(q).reduce(function(V, P) {
|
|
4388
4388
|
return Math.min(V, S[P.w] - b.edge(P));
|
|
4389
4389
|
}, Number.POSITIVE_INFINITY), re = p.node(q);
|
|
4390
4390
|
Z !== Number.POSITIVE_INFINITY && re.borderType !== N && (S[q] = Math.max(S[q], Z));
|
|
4391
4391
|
}
|
|
4392
|
-
return R(D, b.predecessors.bind(b)), R(
|
|
4392
|
+
return R(D, b.predecessors.bind(b)), R(B, b.successors.bind(b)), e.forEach(m, function(q) {
|
|
4393
4393
|
S[q] = S[y[q]];
|
|
4394
4394
|
}), S;
|
|
4395
4395
|
}
|
|
@@ -4398,10 +4398,10 @@ function S_() {
|
|
|
4398
4398
|
return e.forEach(g, function(N) {
|
|
4399
4399
|
var R;
|
|
4400
4400
|
e.forEach(N, function(D) {
|
|
4401
|
-
var
|
|
4402
|
-
if (C.setNode(
|
|
4403
|
-
var q = y[R], Z = C.edge(q,
|
|
4404
|
-
C.setEdge(q,
|
|
4401
|
+
var B = y[D];
|
|
4402
|
+
if (C.setNode(B), R) {
|
|
4403
|
+
var q = y[R], Z = C.edge(q, B);
|
|
4404
|
+
C.setEdge(q, B, Math.max(b(p, D, R), Z || 0));
|
|
4405
4405
|
}
|
|
4406
4406
|
R = D;
|
|
4407
4407
|
});
|
|
@@ -4422,8 +4422,8 @@ function S_() {
|
|
|
4422
4422
|
e.forEach(["l", "r"], function(b) {
|
|
4423
4423
|
var N = S + b, R = p[N], D;
|
|
4424
4424
|
if (R !== g) {
|
|
4425
|
-
var
|
|
4426
|
-
D = b === "l" ? m - e.min(
|
|
4425
|
+
var B = e.values(R);
|
|
4426
|
+
D = b === "l" ? m - e.min(B) : C - e.max(B), D && (p[N] = e.mapValues(R, function(q) {
|
|
4427
4427
|
return q + D;
|
|
4428
4428
|
}));
|
|
4429
4429
|
}
|
|
@@ -4448,16 +4448,16 @@ function S_() {
|
|
|
4448
4448
|
N === "r" && (C = e.map(C, function(q) {
|
|
4449
4449
|
return e.values(q).reverse();
|
|
4450
4450
|
}));
|
|
4451
|
-
var R = (b === "u" ? p.predecessors : p.successors).bind(p), D = l(p, C, y, R),
|
|
4451
|
+
var R = (b === "u" ? p.predecessors : p.successors).bind(p), D = l(p, C, y, R), B = u(
|
|
4452
4452
|
p,
|
|
4453
4453
|
C,
|
|
4454
4454
|
D.root,
|
|
4455
4455
|
D.align,
|
|
4456
4456
|
N === "r"
|
|
4457
4457
|
);
|
|
4458
|
-
N === "r" && (
|
|
4458
|
+
N === "r" && (B = e.mapValues(B, function(q) {
|
|
4459
4459
|
return -q;
|
|
4460
|
-
})), m[b + N] =
|
|
4460
|
+
})), m[b + N] = B;
|
|
4461
4461
|
});
|
|
4462
4462
|
});
|
|
4463
4463
|
var S = d(p, m);
|
|
@@ -4539,7 +4539,7 @@ function L_() {
|
|
|
4539
4539
|
$(" makeSpaceForEdgeLabels", function() {
|
|
4540
4540
|
D(I);
|
|
4541
4541
|
}), $(" removeSelfEdges", function() {
|
|
4542
|
-
|
|
4542
|
+
G(I);
|
|
4543
4543
|
}), $(" acyclic", function() {
|
|
4544
4544
|
t.run(I);
|
|
4545
4545
|
}), $(" nestingGraph.run", function() {
|
|
@@ -4547,7 +4547,7 @@ function L_() {
|
|
|
4547
4547
|
}), $(" rank", function() {
|
|
4548
4548
|
r(f.asNonCompoundGraph(I));
|
|
4549
4549
|
}), $(" injectEdgeLabelProxies", function() {
|
|
4550
|
-
|
|
4550
|
+
B(I);
|
|
4551
4551
|
}), $(" removeEmptyRanks", function() {
|
|
4552
4552
|
o(I);
|
|
4553
4553
|
}), $(" nestingGraph.cleanup", function() {
|
|
@@ -4636,7 +4636,7 @@ function L_() {
|
|
|
4636
4636
|
Y.minlen *= 2, Y.labelpos.toLowerCase() !== "c" && ($.rankdir === "TB" || $.rankdir === "BT" ? Y.width += Y.labeloffset : Y.height += Y.labeloffset);
|
|
4637
4637
|
});
|
|
4638
4638
|
}
|
|
4639
|
-
function
|
|
4639
|
+
function B(I) {
|
|
4640
4640
|
e.forEach(I.edges(), function($) {
|
|
4641
4641
|
var H = I.edge($);
|
|
4642
4642
|
if (H.width && H.height) {
|
|
@@ -4715,7 +4715,7 @@ function L_() {
|
|
|
4715
4715
|
I.node($).dummy === "border" && I.removeNode($);
|
|
4716
4716
|
});
|
|
4717
4717
|
}
|
|
4718
|
-
function
|
|
4718
|
+
function G(I) {
|
|
4719
4719
|
e.forEach(I.edges(), function($) {
|
|
4720
4720
|
if ($.v === $.w) {
|
|
4721
4721
|
var H = I.node($.v);
|
|
@@ -4985,7 +4985,7 @@ const Cd = /* @__PURE__ */ ps(I_), Lt = "root.Triggers", $o = {
|
|
|
4985
4985
|
) ? "warning" : null;
|
|
4986
4986
|
},
|
|
4987
4987
|
generateGraph(e, t, n, r, i, a, o, s, l, u, c, d, f) {
|
|
4988
|
-
var b, N, R, D,
|
|
4988
|
+
var b, N, R, D, B, q, Z, re, V, P, ie, J;
|
|
4989
4989
|
const h = [], w = [$t + Lt];
|
|
4990
4990
|
if (!r || i && !this.flowHaveTasks(i)) {
|
|
4991
4991
|
h.push({
|
|
@@ -5038,15 +5038,15 @@ const Cd = /* @__PURE__ */ ps(I_), Lt = "root.Triggers", $o = {
|
|
|
5038
5038
|
s,
|
|
5039
5039
|
l,
|
|
5040
5040
|
u
|
|
5041
|
-
), v = {}, p = r.clusters || [], g = p.map((
|
|
5042
|
-
r.nodes.concat(u).map((
|
|
5041
|
+
), v = {}, p = r.clusters || [], g = p.map((G) => G.cluster), y = g.filter((G) => G.type.endsWith("SubflowGraphCluster")).map((G) => G.taskNode.uid), m = Object.fromEntries(
|
|
5042
|
+
r.nodes.concat(u).map((G) => [G.uid, G])
|
|
5043
5043
|
);
|
|
5044
|
-
for (const
|
|
5045
|
-
if (!s[
|
|
5046
|
-
((N = (b =
|
|
5047
|
-
for (const I of
|
|
5048
|
-
v[I] =
|
|
5049
|
-
const le =
|
|
5044
|
+
for (const G of p)
|
|
5045
|
+
if (!s[G.cluster.uid] && !l.has(G.cluster.uid)) {
|
|
5046
|
+
((N = (b = G.cluster.taskNode) == null ? void 0 : b.task) == null ? void 0 : N.type) === "io.kestra.core.tasks.flows.Dag" && y.push(G.cluster.taskNode.uid);
|
|
5047
|
+
for (const I of G.nodes)
|
|
5048
|
+
v[I] = G.cluster;
|
|
5049
|
+
const le = G.cluster.uid, ke = _.node(le), je = G.parents ? G.parents[G.parents.length - 1] : void 0, Qe = this.computeClusterColor(G.cluster);
|
|
5050
5050
|
h.push({
|
|
5051
5051
|
id: le,
|
|
5052
5052
|
type: "cluster",
|
|
@@ -5062,65 +5062,66 @@ const Cd = /* @__PURE__ */ ps(I_), Lt = "root.Triggers", $o = {
|
|
|
5062
5062
|
data: {
|
|
5063
5063
|
collapsable: !0,
|
|
5064
5064
|
color: Qe,
|
|
5065
|
-
taskNode:
|
|
5066
|
-
unused:
|
|
5065
|
+
taskNode: G.cluster.taskNode,
|
|
5066
|
+
unused: G.cluster.taskNode ? m[G.cluster.taskNode.uid].unused : !1
|
|
5067
5067
|
},
|
|
5068
5068
|
class: `ks-topology-${Qe}-border rounded p-2`
|
|
5069
5069
|
});
|
|
5070
5070
|
}
|
|
5071
|
-
for (const
|
|
5072
|
-
if (!a.includes(
|
|
5073
|
-
const le = _.node(
|
|
5071
|
+
for (const G of r.nodes.concat(u))
|
|
5072
|
+
if (!a.includes(G.uid)) {
|
|
5073
|
+
const le = _.node(G.uid);
|
|
5074
5074
|
let ke = "task";
|
|
5075
|
-
this.isClusterRootOrEnd(
|
|
5076
|
-
const je = this.nodeColor(
|
|
5077
|
-
(I) =>
|
|
5075
|
+
this.isClusterRootOrEnd(G) ? ke = "dot" : G.type.includes("GraphTrigger") ? ke = "trigger" : G.type === "collapsedcluster" && (ke = "collapsedcluster");
|
|
5076
|
+
const je = this.nodeColor(G, l), Qe = c || ((D = (R = G.task) == null ? void 0 : R.type) == null ? void 0 : D.includes("$")) || y.some(
|
|
5077
|
+
(I) => G.uid.startsWith(I + ".")
|
|
5078
5078
|
);
|
|
5079
5079
|
h.push({
|
|
5080
|
-
id:
|
|
5080
|
+
id: G.uid,
|
|
5081
5081
|
type: ke,
|
|
5082
5082
|
position: this.getNodePosition(
|
|
5083
5083
|
le,
|
|
5084
|
-
v[
|
|
5084
|
+
v[G.uid] ? _.node(v[G.uid].uid) : void 0
|
|
5085
5085
|
),
|
|
5086
5086
|
style: {
|
|
5087
|
-
width: this.getNodeWidth(
|
|
5088
|
-
height: this.getNodeHeight(
|
|
5087
|
+
width: this.getNodeWidth(G) + "px",
|
|
5088
|
+
height: this.getNodeHeight(G) + "px"
|
|
5089
5089
|
},
|
|
5090
5090
|
sourcePosition: o ? ze.Right : ze.Bottom,
|
|
5091
5091
|
targetPosition: o ? ze.Left : ze.Top,
|
|
5092
|
-
parentNode: v[
|
|
5092
|
+
parentNode: v[G.uid] ? v[G.uid].uid : void 0,
|
|
5093
5093
|
draggable: ke === "task" ? !Qe : !1,
|
|
5094
5094
|
data: {
|
|
5095
|
-
node:
|
|
5096
|
-
|
|
5097
|
-
|
|
5098
|
-
|
|
5095
|
+
node: G,
|
|
5096
|
+
parent: v[G.uid] ? v[G.uid] : void 0,
|
|
5097
|
+
namespace: ((Z = (q = (B = v[G.uid]) == null ? void 0 : B.taskNode) == null ? void 0 : q.task) == null ? void 0 : Z.namespace) ?? n,
|
|
5098
|
+
flowId: ((P = (V = (re = v[G.uid]) == null ? void 0 : re.taskNode) == null ? void 0 : V.task) == null ? void 0 : P.flowId) ?? t,
|
|
5099
|
+
isFlowable: ((ie = v[G.uid]) == null ? void 0 : ie.uid) === $t + G.uid && !G.type.endsWith("SubflowGraphTask"),
|
|
5099
5100
|
color: je,
|
|
5100
5101
|
expandable: this.isExpandableTask(
|
|
5101
|
-
|
|
5102
|
+
G,
|
|
5102
5103
|
v,
|
|
5103
5104
|
s,
|
|
5104
5105
|
f
|
|
5105
5106
|
),
|
|
5106
5107
|
isReadOnly: Qe,
|
|
5107
|
-
iconComponent: this.isCollapsedCluster(
|
|
5108
|
-
executionId:
|
|
5109
|
-
unused:
|
|
5108
|
+
iconComponent: this.isCollapsedCluster(G) ? "lightning-bolt" : null,
|
|
5109
|
+
executionId: G.executionId,
|
|
5110
|
+
unused: G.unused
|
|
5110
5111
|
},
|
|
5111
|
-
class:
|
|
5112
|
+
class: G.type === "collapsedcluster" ? `ks-topology-${je}-border rounded` : ""
|
|
5112
5113
|
});
|
|
5113
5114
|
}
|
|
5114
|
-
const C = g.filter((
|
|
5115
|
-
for (const
|
|
5115
|
+
const C = g.filter((G) => G.taskNode).map((G) => G.taskNode.uid), S = r.edges ?? [];
|
|
5116
|
+
for (const G of S) {
|
|
5116
5117
|
const le = this.replaceIfCollapsed(
|
|
5117
|
-
|
|
5118
|
-
|
|
5118
|
+
G.source,
|
|
5119
|
+
G.target,
|
|
5119
5120
|
s,
|
|
5120
5121
|
a
|
|
5121
5122
|
);
|
|
5122
5123
|
if (le) {
|
|
5123
|
-
const ke = this.getEdgeColor(
|
|
5124
|
+
const ke = this.getEdgeColor(G, m, v);
|
|
5124
5125
|
h.push({
|
|
5125
5126
|
id: le.source + "|" + le.target,
|
|
5126
5127
|
source: le.source,
|
|
@@ -5133,14 +5134,14 @@ const Cd = /* @__PURE__ */ ps(I_), Lt = "root.Triggers", $o = {
|
|
|
5133
5134
|
},
|
|
5134
5135
|
data: {
|
|
5135
5136
|
haveAdd: !c && d && this.haveAdd(
|
|
5136
|
-
|
|
5137
|
+
G,
|
|
5137
5138
|
m,
|
|
5138
5139
|
C,
|
|
5139
5140
|
y
|
|
5140
5141
|
),
|
|
5141
|
-
haveDashArray: m[
|
|
5142
|
+
haveDashArray: m[G.source].type.endsWith("GraphTrigger") || m[G.target].type.endsWith("GraphTrigger") || G.source.startsWith(Lt),
|
|
5142
5143
|
color: ke,
|
|
5143
|
-
unused:
|
|
5144
|
+
unused: G.unused
|
|
5144
5145
|
},
|
|
5145
5146
|
style: {
|
|
5146
5147
|
zIndex: 10
|
|
@@ -5524,7 +5525,7 @@ function iy(e, t = {}) {
|
|
|
5524
5525
|
return !1;
|
|
5525
5526
|
const ee = () => {
|
|
5526
5527
|
const Oe = k.currentPeek();
|
|
5527
|
-
return Oe === "{" ? p(k.peek()) : Oe === "@" || Oe === "|" || Oe === ":" || Oe === "." || Oe === gt || !Oe ? !1 : Oe === We ? (k.peek(), ee()) :
|
|
5528
|
+
return Oe === "{" ? p(k.peek()) : Oe === "@" || Oe === "|" || Oe === ":" || Oe === "." || Oe === gt || !Oe ? !1 : Oe === We ? (k.peek(), ee()) : B(k, !1);
|
|
5528
5529
|
}, Te = ee();
|
|
5529
5530
|
return k.resetPeek(), Te;
|
|
5530
5531
|
}
|
|
@@ -5533,7 +5534,7 @@ function iy(e, t = {}) {
|
|
|
5533
5534
|
const T = k.currentPeek() === "|";
|
|
5534
5535
|
return k.resetPeek(), T;
|
|
5535
5536
|
}
|
|
5536
|
-
function
|
|
5537
|
+
function B(k, T = !0) {
|
|
5537
5538
|
const x = (Te = !1, Oe = "") => {
|
|
5538
5539
|
const ce = k.currentPeek();
|
|
5539
5540
|
return ce === "{" || ce === "@" || !ce ? Te : ce === "|" ? !(Oe === gt || Oe === We) : ce === gt ? (k.peek(), x(!0, gt)) : ce === We ? (k.peek(), x(!0, We)) : !0;
|
|
@@ -5574,14 +5575,14 @@ function iy(e, t = {}) {
|
|
|
5574
5575
|
function J(k) {
|
|
5575
5576
|
return q(k, ie);
|
|
5576
5577
|
}
|
|
5577
|
-
function
|
|
5578
|
+
function G(k) {
|
|
5578
5579
|
const T = k.charCodeAt(0);
|
|
5579
5580
|
return T >= 48 && T <= 57 || // 0-9
|
|
5580
5581
|
T >= 65 && T <= 70 || // A-F
|
|
5581
5582
|
T >= 97 && T <= 102;
|
|
5582
5583
|
}
|
|
5583
5584
|
function le(k) {
|
|
5584
|
-
return q(k,
|
|
5585
|
+
return q(k, G);
|
|
5585
5586
|
}
|
|
5586
5587
|
function ke(k) {
|
|
5587
5588
|
let T = "", x = "";
|
|
@@ -5596,7 +5597,7 @@ function iy(e, t = {}) {
|
|
|
5596
5597
|
if (x === "{" || x === "}" || x === "@" || x === "|" || !x)
|
|
5597
5598
|
break;
|
|
5598
5599
|
if (x === gt || x === We)
|
|
5599
|
-
if (
|
|
5600
|
+
if (B(k))
|
|
5600
5601
|
T += x, k.next();
|
|
5601
5602
|
else {
|
|
5602
5603
|
if (D(k))
|
|
@@ -5782,7 +5783,7 @@ function iy(e, t = {}) {
|
|
|
5782
5783
|
default: {
|
|
5783
5784
|
if (D(k))
|
|
5784
5785
|
return x = f(T, 1, xe(k)), T.braceNest = 0, T.inLinked = !1, x;
|
|
5785
|
-
if (
|
|
5786
|
+
if (B(k))
|
|
5786
5787
|
return f(T, 0, je(k));
|
|
5787
5788
|
break;
|
|
5788
5789
|
}
|
|
@@ -6866,7 +6867,7 @@ let xd = 0;
|
|
|
6866
6867
|
function sE(e = {}) {
|
|
6867
6868
|
const t = we(e.onWarn) ? e.onWarn : It, n = X(e.version) ? e.version : Qy, r = X(e.locale) || we(e.locale) ? e.locale : xn, i = we(r) ? xn : r, a = $e(e.fallbackLocale) || fe(e.fallbackLocale) || X(e.fallbackLocale) || e.fallbackLocale === !1 ? e.fallbackLocale : i, o = fe(e.messages) ? e.messages : Fo(i), s = fe(e.datetimeFormats) ? e.datetimeFormats : Fo(i), l = fe(e.numberFormats) ? e.numberFormats : Fo(i), u = Ve(Ee(), e.modifiers, eE()), c = e.pluralRules || Ee(), d = we(e.missing) ? e.missing : null, f = Ie(e.missingWarn) || $n(e.missingWarn) ? e.missingWarn : !0, h = Ie(e.fallbackWarn) || $n(e.fallbackWarn) ? e.fallbackWarn : !0, w = !!e.fallbackFormat, _ = !!e.unresolving, v = we(e.postTranslation) ? e.postTranslation : null, p = fe(e.processor) ? e.processor : null, g = Ie(e.warnHtmlMessage) ? e.warnHtmlMessage : !0, y = !!e.escapeParameter, m = we(e.messageCompiler) ? e.messageCompiler : bh;
|
|
6868
6869
|
process.env.NODE_ENV !== "production" && we(e.messageCompiler) && B_(Ft(Ke.EXPERIMENTAL_CUSTOM_MESSAGE_COMPILER));
|
|
6869
|
-
const C = we(e.messageResolver) ? e.messageResolver : Ch || Yy, S = we(e.localeFallbacker) ? e.localeFallbacker : wh || Vy, b = me(e.fallbackContext) ? e.fallbackContext : void 0, N = e, R = me(N.__datetimeFormatters) ? N.__datetimeFormatters : /* @__PURE__ */ new Map(), D = me(N.__numberFormatters) ? N.__numberFormatters : /* @__PURE__ */ new Map(),
|
|
6870
|
+
const C = we(e.messageResolver) ? e.messageResolver : Ch || Yy, S = we(e.localeFallbacker) ? e.localeFallbacker : wh || Vy, b = me(e.fallbackContext) ? e.fallbackContext : void 0, N = e, R = me(N.__datetimeFormatters) ? N.__datetimeFormatters : /* @__PURE__ */ new Map(), D = me(N.__numberFormatters) ? N.__numberFormatters : /* @__PURE__ */ new Map(), B = me(N.__meta) ? N.__meta : {};
|
|
6870
6871
|
xd++;
|
|
6871
6872
|
const q = {
|
|
6872
6873
|
version: n,
|
|
@@ -6890,9 +6891,9 @@ function sE(e = {}) {
|
|
|
6890
6891
|
localeFallbacker: S,
|
|
6891
6892
|
fallbackContext: b,
|
|
6892
6893
|
onWarn: t,
|
|
6893
|
-
__meta:
|
|
6894
|
+
__meta: B
|
|
6894
6895
|
};
|
|
6895
|
-
return q.datetimeFormats = s, q.numberFormats = l, q.__datetimeFormatters = R, q.__numberFormatters = D, process.env.NODE_ENV !== "production" && (q.__v_emitter = N.__v_emitter != null ? N.__v_emitter : void 0), (process.env.NODE_ENV !== "production" || __INTLIFY_PROD_DEVTOOLS__) && My(q, n,
|
|
6896
|
+
return q.datetimeFormats = s, q.numberFormats = l, q.__datetimeFormatters = R, q.__numberFormatters = D, process.env.NODE_ENV !== "production" && (q.__v_emitter = N.__v_emitter != null ? N.__v_emitter : void 0), (process.env.NODE_ENV !== "production" || __INTLIFY_PROD_DEVTOOLS__) && My(q, n, B), q;
|
|
6896
6897
|
}
|
|
6897
6898
|
const Fo = (e) => ({ [e]: Ee() });
|
|
6898
6899
|
function or(e, t) {
|
|
@@ -7170,7 +7171,7 @@ function Wd(e, ...t) {
|
|
|
7170
7171
|
}, N = ot(m) ? m : Rh(e, l, g, m, C, b);
|
|
7171
7172
|
if (S)
|
|
7172
7173
|
return m;
|
|
7173
|
-
const R = bE(e, g, y, u), D = gE(R),
|
|
7174
|
+
const R = bE(e, g, y, u), D = gE(R), B = _E(e, N, D), q = r ? r(B, l) : B;
|
|
7174
7175
|
if (process.env.NODE_ENV !== "production" || __INTLIFY_PROD_DEVTOOLS__) {
|
|
7175
7176
|
const Z = {
|
|
7176
7177
|
timestamp: Date.now(),
|
|
@@ -7640,7 +7641,7 @@ function qE(e = {}) {
|
|
|
7640
7641
|
set: (A) => {
|
|
7641
7642
|
b.locale = A, s.value = A;
|
|
7642
7643
|
}
|
|
7643
|
-
}),
|
|
7644
|
+
}), B = pe({
|
|
7644
7645
|
get: () => l.value,
|
|
7645
7646
|
set: (A) => {
|
|
7646
7647
|
b.fallbackLocale = A, l.value = A, un(b, s.value, A);
|
|
@@ -7658,7 +7659,7 @@ function qE(e = {}) {
|
|
|
7658
7659
|
function J(A) {
|
|
7659
7660
|
A !== null && (p = Xd(A)), v = A, b.missing = p;
|
|
7660
7661
|
}
|
|
7661
|
-
function
|
|
7662
|
+
function G(A, U) {
|
|
7662
7663
|
return A !== "translate" || !U.resolvedMessage;
|
|
7663
7664
|
}
|
|
7664
7665
|
const le = (A, U, ge, Ne, Dt, Cn) => {
|
|
@@ -7672,7 +7673,7 @@ function qE(e = {}) {
|
|
|
7672
7673
|
if (ge !== "translate exists" && // for not `te` (e.g `t`)
|
|
7673
7674
|
Fe(Yt) && Yt === ar || ge === "translate exists" && !Yt) {
|
|
7674
7675
|
const [Pt, Fp] = U();
|
|
7675
|
-
if (process.env.NODE_ENV !== "production" && t && X(Pt) &&
|
|
7676
|
+
if (process.env.NODE_ENV !== "production" && t && X(Pt) && G(ge, Fp) && (w && (or(h, Pt) || Lh(f, Pt)) && It(Rs(Ot.FALLBACK_TO_ROOT, {
|
|
7676
7677
|
key: Pt,
|
|
7677
7678
|
type: ge
|
|
7678
7679
|
})), process.env.NODE_ENV !== "production")) {
|
|
@@ -7805,7 +7806,7 @@ function qE(e = {}) {
|
|
|
7805
7806
|
const ce = {
|
|
7806
7807
|
id: Yd,
|
|
7807
7808
|
locale: D,
|
|
7808
|
-
fallbackLocale:
|
|
7809
|
+
fallbackLocale: B,
|
|
7809
7810
|
get inheritLocale() {
|
|
7810
7811
|
return o;
|
|
7811
7812
|
},
|
|
@@ -9666,11 +9667,11 @@ const A0 = { class: "icon rounded" }, R0 = { class: "node-content" }, D0 = { cla
|
|
|
9666
9667
|
}
|
|
9667
9668
|
},
|
|
9668
9669
|
classes() {
|
|
9669
|
-
var e;
|
|
9670
|
+
var e, t, n, r;
|
|
9670
9671
|
return {
|
|
9671
9672
|
"unused-path": this.data.unused,
|
|
9672
9673
|
[`border-${this.borderColor}`]: this.borderColor,
|
|
9673
|
-
disabled: (e = this.data.node.task) == null ? void 0 : e.disabled,
|
|
9674
|
+
disabled: ((e = this.data.node.task) == null ? void 0 : e.disabled) || ((r = (n = (t = this.data.parent) == null ? void 0 : t.taskNode) == null ? void 0 : n.task) == null ? void 0 : r.disabled),
|
|
9674
9675
|
[this.$attrs.class]: !0
|
|
9675
9676
|
};
|
|
9676
9677
|
},
|
|
@@ -9776,7 +9777,7 @@ const A0 = { class: "icon rounded" }, R0 = { class: "node-content" }, D0 = { cla
|
|
|
9776
9777
|
])
|
|
9777
9778
|
], 34));
|
|
9778
9779
|
}
|
|
9779
|
-
}), ip = /* @__PURE__ */ Q(q0, [["__scopeId", "data-v-
|
|
9780
|
+
}), ip = /* @__PURE__ */ Q(q0, [["__scopeId", "data-v-d71af44b"]]), F0 = ["innerHTML"], V0 = /* @__PURE__ */ Re({
|
|
9780
9781
|
__name: "Duration",
|
|
9781
9782
|
props: {
|
|
9782
9783
|
histories: {}
|
|
@@ -11381,12 +11382,12 @@ const zw = {
|
|
|
11381
11382
|
}
|
|
11382
11383
|
return V.filter((J) => J.type === "trigger").length > 0 ? "triggererror" : null;
|
|
11383
11384
|
}, N = (V, P, ie = !1) => {
|
|
11384
|
-
const J = n.flowGraph.clusters.find((le) => le.cluster.uid.endsWith(V)),
|
|
11385
|
-
w.value.add(
|
|
11385
|
+
const J = n.flowGraph.clusters.find((le) => le.cluster.uid.endsWith(V)), G = V.replace($t, "");
|
|
11386
|
+
w.value.add(G), h.value = h.value.concat(J.nodes.filter((le) => le !== G || ie)), h.value = h.value.concat([J.cluster.uid]), f.value = {
|
|
11386
11387
|
...f.value,
|
|
11387
|
-
[J.cluster.uid]:
|
|
11388
|
-
[J.start]:
|
|
11389
|
-
[J.end]:
|
|
11388
|
+
[J.cluster.uid]: G,
|
|
11389
|
+
[J.start]: G,
|
|
11390
|
+
[J.end]: G
|
|
11390
11391
|
};
|
|
11391
11392
|
for (let le of J.nodes)
|
|
11392
11393
|
n.flowGraph.clusters.map((ke) => ke.cluster.uid).includes(le) && N(le, !1, !0);
|
|
@@ -11403,13 +11404,13 @@ const zw = {
|
|
|
11403
11404
|
return;
|
|
11404
11405
|
}
|
|
11405
11406
|
f.value = {}, h.value = [], _.value = [], w.value.delete(V.id), w.value.forEach((ie) => N(ie, !1, !1)), g();
|
|
11406
|
-
}, D = document.getElementsByTagName("html")[0].className.indexOf("dark") >= 0,
|
|
11407
|
+
}, D = document.getElementsByTagName("html")[0].className.indexOf("dark") >= 0, B = ve(!0), q = ve(!1), Z = () => q.value = !q.value;
|
|
11407
11408
|
function re(V) {
|
|
11408
11409
|
if (!d.value) {
|
|
11409
11410
|
console.warn("Flow not found");
|
|
11410
11411
|
return;
|
|
11411
11412
|
}
|
|
11412
|
-
|
|
11413
|
+
B.value = !1, v(d.value, { type: V, shouldDownload: !0 }).then(() => B.value = !0).finally(() => q.value = !1);
|
|
11413
11414
|
}
|
|
11414
11415
|
return (V, P) => (E(), ue(W(Um), {
|
|
11415
11416
|
id: e.id,
|
|
@@ -11473,7 +11474,7 @@ const zw = {
|
|
|
11473
11474
|
K(W(yb), {
|
|
11474
11475
|
"pattern-color": D ? W(at)("--bs-grey-500") : W(at)("--bs-grey-300")
|
|
11475
11476
|
}, null, 8, ["pattern-color"]),
|
|
11476
|
-
|
|
11477
|
+
B.value ? (E(), ue(W(Hm), {
|
|
11477
11478
|
key: 0,
|
|
11478
11479
|
"show-interactive": !1
|
|
11479
11480
|
}, {
|
|
@@ -12441,7 +12442,7 @@ type: "${r.pluginType}"
|
|
|
12441
12442
|
var m;
|
|
12442
12443
|
window.removeEventListener("hashchange", s), (m = u.value) == null || m.dispose();
|
|
12443
12444
|
}), (m, C) => {
|
|
12444
|
-
var S, b, N, R, D,
|
|
12445
|
+
var S, b, N, R, D, B;
|
|
12445
12446
|
return E(), L("div", Ck, [
|
|
12446
12447
|
O("div", null, [
|
|
12447
12448
|
(S = m.schema.properties) != null && S.$beta ? (E(), L("div", wk, C[0] || (C[0] = [
|
|
@@ -12531,7 +12532,7 @@ type: "${r.pluginType}"
|
|
|
12531
12532
|
]),
|
|
12532
12533
|
_: 3
|
|
12533
12534
|
}, 8, ["properties"])) : M("", !0),
|
|
12534
|
-
(
|
|
12535
|
+
(B = m.schema.properties) != null && B.$metrics ? (E(), ue(In, {
|
|
12535
12536
|
key: 3,
|
|
12536
12537
|
class: "plugin-section",
|
|
12537
12538
|
properties: d.value,
|