@notmrabhi/flowforge 0.1.108 → 0.1.109
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/{WorkflowExecutionHistory-BrkL37Wb.js → WorkflowExecutionHistory-51ltkBpu.js} +2 -2
- package/dist/WorkflowExecutionHistory-51ltkBpu.js.map +1 -0
- package/dist/{WorkflowExecutionHistory-BBeVPYVc.js → WorkflowExecutionHistory-CxKMGSch.js} +268 -268
- package/dist/WorkflowExecutionHistory-CxKMGSch.js.map +1 -0
- package/dist/canvas.cjs +1 -1
- package/dist/canvas.js +1 -1
- package/dist/index.cjs +1 -1
- package/dist/index.js +1 -1
- package/package.json +1 -1
- package/dist/WorkflowExecutionHistory-BBeVPYVc.js.map +0 -1
- package/dist/WorkflowExecutionHistory-BrkL37Wb.js.map +0 -1
|
@@ -1,9 +1,9 @@
|
|
|
1
|
-
import { jsxs as w, jsx as u, Fragment as
|
|
2
|
-
import G, { useRef as Tt, useEffect as se, useState as L, useCallback as
|
|
1
|
+
import { jsxs as w, jsx as u, Fragment as Se } from "react/jsx-runtime";
|
|
2
|
+
import G, { useRef as Tt, useEffect as se, useState as L, useCallback as U, useMemo as V } from "react";
|
|
3
3
|
import Wn, { useStore as $n, useReactFlow as Gn, Background as Yn, Controls as Kn, MiniMap as Hn } from "reactflow";
|
|
4
4
|
import "reactflow/dist/style.css";
|
|
5
5
|
import { e as Un, G as Vn, E as qn, P as Xn, L as Jn, d as Zn, h as Qn } from "./GatewayBranchEdge-C023FhhW.js";
|
|
6
|
-
import { Dialog as er, Box as ne, Drawer as tr, IconButton as It, Button as
|
|
6
|
+
import { Dialog as er, Box as ne, Drawer as tr, IconButton as It, Button as Le, CircularProgress as nr } from "@mui/material";
|
|
7
7
|
import rr from "react-select";
|
|
8
8
|
import { MdClose as or, MdCalendarToday as ir, MdBolt as sr, MdArrowBack as Jt, MdChevronRight as Zt, MdAddCircleOutline as lr, MdApps as ar, MdErrorOutline as dr, MdAccountTree as cr, MdAdd as fr, MdSearch as ur, MdCategory as hr, MdCancel as Qt, MdError as en, MdCheckCircle as tn, MdPlayArrow as nn, MdHourglassEmpty as gr, MdSchedule as Ot, MdPerson as pr, MdExpandLess as yr, MdExpandMore as br } from "react-icons/md";
|
|
9
9
|
import { GrTrigger as mr } from "react-icons/gr";
|
|
@@ -15,7 +15,7 @@ import { T as Cr, E as re } from "./canvasTokens-CAD6G24b.js";
|
|
|
15
15
|
var rn = Object.defineProperty, Tr = (e, t, n) => t in e ? rn(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, Ir = (e, t) => {
|
|
16
16
|
for (var n in t) rn(e, n, { get: t[n], enumerable: !0 });
|
|
17
17
|
}, Or = (e, t, n) => Tr(e, t + "", n), on = {};
|
|
18
|
-
Ir(on, { Graph: () => q, alg: () =>
|
|
18
|
+
Ir(on, { Graph: () => q, alg: () => it, json: () => ln, version: () => zr });
|
|
19
19
|
var Mr = Object.defineProperty, sn = (e, t) => {
|
|
20
20
|
for (var n in t) Mr(e, n, { get: t[n], enumerable: !0 });
|
|
21
21
|
}, q = class {
|
|
@@ -151,7 +151,7 @@ var Mr = Object.defineProperty, sn = (e, t) => {
|
|
|
151
151
|
setEdge(e, t, n, r) {
|
|
152
152
|
let o, i, s, l, d = !1;
|
|
153
153
|
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 = r, arguments.length > 2 && (l = n, d = !0)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s);
|
|
154
|
-
let a =
|
|
154
|
+
let a = _e(this._isDirected, o, i, s);
|
|
155
155
|
if (a in this._edgeLabels) return d && (this._edgeLabels[a] = l), this;
|
|
156
156
|
if (s !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false");
|
|
157
157
|
this.setNode(o), this.setNode(i), this._edgeLabels[a] = d ? l : this._defaultEdgeLabelFn(o, i, s);
|
|
@@ -159,7 +159,7 @@ var Mr = Object.defineProperty, sn = (e, t) => {
|
|
|
159
159
|
return o = c.v, i = c.w, Object.freeze(c), this._edgeObjs[a] = c, Mt(this._preds[i], o), Mt(this._sucs[o], i), this._in[i][a] = c, this._out[o][a] = c, this._edgeCount++, this;
|
|
160
160
|
}
|
|
161
161
|
edge(e, t, n) {
|
|
162
|
-
let r = arguments.length === 1 ?
|
|
162
|
+
let r = arguments.length === 1 ? Ke(this._isDirected, e) : _e(this._isDirected, e, t, n);
|
|
163
163
|
return this._edgeLabels[r];
|
|
164
164
|
}
|
|
165
165
|
edgeAsObj(e, t, n) {
|
|
@@ -167,10 +167,10 @@ var Mr = Object.defineProperty, sn = (e, t) => {
|
|
|
167
167
|
return typeof r != "object" ? { label: r } : r;
|
|
168
168
|
}
|
|
169
169
|
hasEdge(e, t, n) {
|
|
170
|
-
return (arguments.length === 1 ?
|
|
170
|
+
return (arguments.length === 1 ? Ke(this._isDirected, e) : _e(this._isDirected, e, t, n)) in this._edgeLabels;
|
|
171
171
|
}
|
|
172
172
|
removeEdge(e, t, n) {
|
|
173
|
-
let r = arguments.length === 1 ?
|
|
173
|
+
let r = arguments.length === 1 ? Ke(this._isDirected, e) : _e(this._isDirected, e, t, n), o = this._edgeObjs[r];
|
|
174
174
|
if (o) {
|
|
175
175
|
let i = o.v, s = o.w;
|
|
176
176
|
delete this._edgeLabels[r], delete this._edgeObjs[r], jt(this._preds[s], i), jt(this._sucs[i], s), delete this._in[s][r], delete this._out[i][r], this._edgeCount--;
|
|
@@ -201,7 +201,7 @@ function Mt(e, t) {
|
|
|
201
201
|
function jt(e, t) {
|
|
202
202
|
e[t] !== void 0 && !--e[t] && delete e[t];
|
|
203
203
|
}
|
|
204
|
-
function
|
|
204
|
+
function _e(e, t, n, r) {
|
|
205
205
|
let o = "" + t, i = "" + n;
|
|
206
206
|
if (!e && o > i) {
|
|
207
207
|
let s = o;
|
|
@@ -218,8 +218,8 @@ function jr(e, t, n, r) {
|
|
|
218
218
|
let s = { v: o, w: i };
|
|
219
219
|
return r && (s.name = r), s;
|
|
220
220
|
}
|
|
221
|
-
function
|
|
222
|
-
return
|
|
221
|
+
function Ke(e, t) {
|
|
222
|
+
return _e(e, t.v, t.w, t.name);
|
|
223
223
|
}
|
|
224
224
|
var zr = "4.0.1", ln = {};
|
|
225
225
|
sn(ln, { read: () => Rr, write: () => Lr });
|
|
@@ -247,8 +247,8 @@ function Rr(e) {
|
|
|
247
247
|
t.setEdge({ v: n.v, w: n.w, name: n.name }, n.value);
|
|
248
248
|
}), t;
|
|
249
249
|
}
|
|
250
|
-
var
|
|
251
|
-
sn(
|
|
250
|
+
var it = {};
|
|
251
|
+
sn(it, { CycleException: () => Fe, bellmanFord: () => an, components: () => Dr, dijkstra: () => Pe, dijkstraAll: () => Gr, findCycles: () => Yr, floydWarshall: () => Hr, isAcyclic: () => Vr, postorder: () => Xr, preorder: () => Jr, prim: () => Zr, shortestPaths: () => Qr, tarjan: () => cn, topsort: () => fn });
|
|
252
252
|
var Ar = () => 1;
|
|
253
253
|
function an(e, t, n, r) {
|
|
254
254
|
return Br(e, String(t), n || Ar, r || function(o) {
|
|
@@ -339,7 +339,7 @@ var dn = class {
|
|
|
339
339
|
n[e] = i, n[t] = o, r[i.key] = e, r[o.key] = t;
|
|
340
340
|
}
|
|
341
341
|
}, Wr = () => 1;
|
|
342
|
-
function
|
|
342
|
+
function Pe(e, t, n, r) {
|
|
343
343
|
let o = function(i) {
|
|
344
344
|
return e.outEdges(i);
|
|
345
345
|
};
|
|
@@ -359,7 +359,7 @@ function $r(e, t, n, r) {
|
|
|
359
359
|
}
|
|
360
360
|
function Gr(e, t, n) {
|
|
361
361
|
return e.nodes().reduce(function(r, o) {
|
|
362
|
-
return r[o] =
|
|
362
|
+
return r[o] = Pe(e, o, t, n), r;
|
|
363
363
|
}, {});
|
|
364
364
|
}
|
|
365
365
|
function cn(e) {
|
|
@@ -411,7 +411,7 @@ function Ur(e, t, n) {
|
|
|
411
411
|
});
|
|
412
412
|
}), r;
|
|
413
413
|
}
|
|
414
|
-
var
|
|
414
|
+
var Fe = class extends Error {
|
|
415
415
|
constructor(...e) {
|
|
416
416
|
super(...e);
|
|
417
417
|
}
|
|
@@ -419,17 +419,17 @@ var Pe = class extends Error {
|
|
|
419
419
|
function fn(e) {
|
|
420
420
|
let t = {}, n = {}, r = [];
|
|
421
421
|
function o(i) {
|
|
422
|
-
if (i in n) throw new
|
|
422
|
+
if (i in n) throw new Fe();
|
|
423
423
|
i in t || (n[i] = !0, t[i] = !0, e.predecessors(i).forEach(o), delete n[i], r.push(i));
|
|
424
424
|
}
|
|
425
|
-
if (e.sinks().forEach(o), Object.keys(t).length !== e.nodeCount()) throw new
|
|
425
|
+
if (e.sinks().forEach(o), Object.keys(t).length !== e.nodeCount()) throw new Fe();
|
|
426
426
|
return r;
|
|
427
427
|
}
|
|
428
428
|
function Vr(e) {
|
|
429
429
|
try {
|
|
430
430
|
fn(e);
|
|
431
431
|
} catch (t) {
|
|
432
|
-
if (t instanceof
|
|
432
|
+
if (t instanceof Fe) return !1;
|
|
433
433
|
throw t;
|
|
434
434
|
}
|
|
435
435
|
return !0;
|
|
@@ -492,7 +492,7 @@ function Qr(e, t, n, r) {
|
|
|
492
492
|
}));
|
|
493
493
|
}
|
|
494
494
|
function eo(e, t, n, r) {
|
|
495
|
-
if (n === void 0) return
|
|
495
|
+
if (n === void 0) return Pe(e, t, n, r);
|
|
496
496
|
let o = !1, i = e.nodes();
|
|
497
497
|
for (let s = 0; s < i.length; s++) {
|
|
498
498
|
let l = r(i[s]);
|
|
@@ -502,11 +502,11 @@ function eo(e, t, n, r) {
|
|
|
502
502
|
}
|
|
503
503
|
if (o) return an(e, t, n, r);
|
|
504
504
|
}
|
|
505
|
-
return
|
|
505
|
+
return Pe(e, t, n, r);
|
|
506
506
|
}
|
|
507
|
-
function
|
|
507
|
+
function ve(e, t, n, r) {
|
|
508
508
|
let o = r;
|
|
509
|
-
for (; e.hasNode(o); ) o =
|
|
509
|
+
for (; e.hasNode(o); ) o = st(r);
|
|
510
510
|
return n.dummy = t, e.setNode(o, n), o;
|
|
511
511
|
}
|
|
512
512
|
function to(e) {
|
|
@@ -531,7 +531,7 @@ function zt(e, t) {
|
|
|
531
531
|
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: n + d, y: r + a };
|
|
532
532
|
}
|
|
533
533
|
function Te(e) {
|
|
534
|
-
let t =
|
|
534
|
+
let t = Ne(yn(e) + 1).map(() => []);
|
|
535
535
|
return e.nodes().forEach((n) => {
|
|
536
536
|
let r = e.node(n), o = r.rank;
|
|
537
537
|
o !== void 0 && (t[o] || (t[o] = []), t[o][r.order] = n);
|
|
@@ -560,7 +560,7 @@ function ro(e) {
|
|
|
560
560
|
}
|
|
561
561
|
function Lt(e, t, n, r) {
|
|
562
562
|
let o = { width: 0, height: 0 };
|
|
563
|
-
return arguments.length >= 4 && (o.rank = n, o.order = r),
|
|
563
|
+
return arguments.length >= 4 && (o.rank = n, o.order = r), ve(e, "border", o, t);
|
|
564
564
|
}
|
|
565
565
|
function oo(e, t = pn) {
|
|
566
566
|
let n = [];
|
|
@@ -602,11 +602,11 @@ function mn(e, t) {
|
|
|
602
602
|
return t();
|
|
603
603
|
}
|
|
604
604
|
var so = 0;
|
|
605
|
-
function
|
|
605
|
+
function st(e) {
|
|
606
606
|
let t = ++so;
|
|
607
607
|
return e + ("" + t);
|
|
608
608
|
}
|
|
609
|
-
function
|
|
609
|
+
function Ne(e, t, n = 1) {
|
|
610
610
|
t == null && (t = e, e = 0);
|
|
611
611
|
let r = (i) => i < t;
|
|
612
612
|
n < 0 && (r = (i) => t < i);
|
|
@@ -614,19 +614,19 @@ function Se(e, t, n = 1) {
|
|
|
614
614
|
for (let i = e; r(i); i += n) o.push(i);
|
|
615
615
|
return o;
|
|
616
616
|
}
|
|
617
|
-
function
|
|
617
|
+
function Re(e, t) {
|
|
618
618
|
let n = {};
|
|
619
619
|
for (let r of t) e[r] !== void 0 && (n[r] = e[r]);
|
|
620
620
|
return n;
|
|
621
621
|
}
|
|
622
|
-
function
|
|
622
|
+
function Ae(e, t) {
|
|
623
623
|
let n;
|
|
624
624
|
return typeof t == "string" ? n = (r) => r[t] : n = t, Object.entries(e).reduce((r, [o, i]) => (r[o] = n(i, o), r), {});
|
|
625
625
|
}
|
|
626
626
|
function lo(e, t) {
|
|
627
627
|
return e.reduce((n, r, o) => (n[r] = t[o], n), {});
|
|
628
628
|
}
|
|
629
|
-
var
|
|
629
|
+
var Be = "\0", ao = "3.0.0", co = class {
|
|
630
630
|
constructor() {
|
|
631
631
|
Or(this, "_sentinel");
|
|
632
632
|
let e = {};
|
|
@@ -662,25 +662,25 @@ function po(e, t, n) {
|
|
|
662
662
|
var r;
|
|
663
663
|
let o = [], i = t[t.length - 1], s = t[0], l;
|
|
664
664
|
for (; e.nodeCount(); ) {
|
|
665
|
-
for (; l = s.dequeue(); )
|
|
666
|
-
for (; l = i.dequeue(); )
|
|
665
|
+
for (; l = s.dequeue(); ) He(e, t, n, l);
|
|
666
|
+
for (; l = i.dequeue(); ) He(e, t, n, l);
|
|
667
667
|
if (e.nodeCount()) {
|
|
668
668
|
for (let d = t.length - 2; d > 0; --d) if (l = (r = t[d]) == null ? void 0 : r.dequeue(), l) {
|
|
669
|
-
o = o.concat(
|
|
669
|
+
o = o.concat(He(e, t, n, l, !0) || []);
|
|
670
670
|
break;
|
|
671
671
|
}
|
|
672
672
|
}
|
|
673
673
|
}
|
|
674
674
|
return o;
|
|
675
675
|
}
|
|
676
|
-
function
|
|
676
|
+
function He(e, t, n, r, o) {
|
|
677
677
|
let i = [], s = o ? i : void 0;
|
|
678
678
|
return (e.inEdges(r.v) || []).forEach((l) => {
|
|
679
679
|
let d = e.edge(l), a = e.node(l.v);
|
|
680
|
-
o && i.push({ v: l.v, w: l.w }), a.out -= d,
|
|
680
|
+
o && i.push({ v: l.v, w: l.w }), a.out -= d, et(t, n, a);
|
|
681
681
|
}), (e.outEdges(r.v) || []).forEach((l) => {
|
|
682
682
|
let d = e.edge(l), a = l.w, c = e.node(a);
|
|
683
|
-
c.in -= d,
|
|
683
|
+
c.in -= d, et(t, n, c);
|
|
684
684
|
}), e.removeNode(r.v), s;
|
|
685
685
|
}
|
|
686
686
|
function yo(e, t) {
|
|
@@ -695,10 +695,10 @@ function yo(e, t) {
|
|
|
695
695
|
});
|
|
696
696
|
let i = bo(o + r + 3).map(() => new uo()), s = r + 1;
|
|
697
697
|
return n.nodes().forEach((l) => {
|
|
698
|
-
|
|
698
|
+
et(i, s, n.node(l));
|
|
699
699
|
}), { graph: n, buckets: i, zeroIdx: s };
|
|
700
700
|
}
|
|
701
|
-
function
|
|
701
|
+
function et(e, t, n) {
|
|
702
702
|
var r, o, i;
|
|
703
703
|
n.out ? n.in ? (i = e[n.out - n.in + t]) == null || i.enqueue(n) : (o = e[e.length - 1]) == null || o.enqueue(n) : (r = e[0]) == null || r.enqueue(n);
|
|
704
704
|
}
|
|
@@ -710,7 +710,7 @@ function bo(e) {
|
|
|
710
710
|
function mo(e) {
|
|
711
711
|
(e.graph().acyclicer === "greedy" ? go(e, t(e)) : vo(e)).forEach((n) => {
|
|
712
712
|
let r = e.edge(n);
|
|
713
|
-
e.removeEdge(n), r.forwardName = n.name, r.reversed = !0, e.setEdge(n.w, n.v, r,
|
|
713
|
+
e.removeEdge(n), r.forwardName = n.name, r.reversed = !0, e.setEdge(n.w, n.v, r, st("rev"));
|
|
714
714
|
});
|
|
715
715
|
function t(n) {
|
|
716
716
|
return (r) => n.edge(r).weight;
|
|
@@ -743,7 +743,7 @@ function xo(e, t) {
|
|
|
743
743
|
if (i === r + 1) return;
|
|
744
744
|
e.removeEdge(t);
|
|
745
745
|
let a, c, f;
|
|
746
|
-
for (f = 0, ++r; r < i; ++f, ++r) l.points = [], c = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: r }, a =
|
|
746
|
+
for (f = 0, ++r; r < i; ++f, ++r) l.points = [], c = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: r }, a = ve(e, "edge", c, "_d"), r === d && (c.width = l.width, c.height = l.height, c.dummy = "edge-label", c.labelpos = l.labelpos), e.setEdge(n, a, { weight: l.weight }, s), f === 0 && e.graph().dummyChains.push(a), n = a;
|
|
747
747
|
e.setEdge(n, o, { weight: l.weight }, s);
|
|
748
748
|
}
|
|
749
749
|
function ko(e) {
|
|
@@ -752,7 +752,7 @@ function ko(e) {
|
|
|
752
752
|
for (e.setEdge(n.edgeObj, r); n.dummy; ) o = e.successors(t)[0], e.removeNode(t), r.points.push({ x: n.x, y: n.y }), n.dummy === "edge-label" && (r.x = n.x, r.y = n.y, r.width = n.width, r.height = n.height), t = o, n = e.node(t);
|
|
753
753
|
});
|
|
754
754
|
}
|
|
755
|
-
function
|
|
755
|
+
function lt(e) {
|
|
756
756
|
let t = {};
|
|
757
757
|
function n(r) {
|
|
758
758
|
let o = e.node(r);
|
|
@@ -795,21 +795,21 @@ function No(e, t) {
|
|
|
795
795
|
function Co(e, t, n) {
|
|
796
796
|
e.nodes().forEach((r) => t.node(r).rank += n);
|
|
797
797
|
}
|
|
798
|
-
var { preorder: To, postorder: Io } =
|
|
799
|
-
ue.initLowLimValues =
|
|
800
|
-
ue.initCutValues =
|
|
798
|
+
var { preorder: To, postorder: Io } = it, Oo = ue;
|
|
799
|
+
ue.initLowLimValues = dt;
|
|
800
|
+
ue.initCutValues = at;
|
|
801
801
|
ue.calcCutValue = wn;
|
|
802
802
|
ue.leaveEdge = xn;
|
|
803
803
|
ue.enterEdge = kn;
|
|
804
804
|
ue.exchangeEdges = _n;
|
|
805
805
|
function ue(e) {
|
|
806
|
-
e = to(e),
|
|
806
|
+
e = to(e), lt(e);
|
|
807
807
|
let t = vn(e);
|
|
808
|
-
|
|
808
|
+
dt(t), at(t, e);
|
|
809
809
|
let n, r;
|
|
810
810
|
for (; n = xn(t); ) r = kn(t, e, n), _n(t, e, n, r);
|
|
811
811
|
}
|
|
812
|
-
function
|
|
812
|
+
function at(e, t) {
|
|
813
813
|
let n = Io(e, e.nodes());
|
|
814
814
|
n = n.slice(0, n.length - 1), n.forEach((r) => Mo(e, t, r));
|
|
815
815
|
}
|
|
@@ -832,7 +832,7 @@ function wn(e, t, n) {
|
|
|
832
832
|
}
|
|
833
833
|
}), s;
|
|
834
834
|
}
|
|
835
|
-
function
|
|
835
|
+
function dt(e, t) {
|
|
836
836
|
arguments.length < 2 && (t = e.nodes()[0]), En(e, {}, 1, t);
|
|
837
837
|
}
|
|
838
838
|
function En(e, t, n, r, o) {
|
|
@@ -854,7 +854,7 @@ function kn(e, t, n) {
|
|
|
854
854
|
}
|
|
855
855
|
function _n(e, t, n, r) {
|
|
856
856
|
let o = n.v, i = n.w;
|
|
857
|
-
e.removeEdge(o, i), e.setEdge(r.v, r.w, {}),
|
|
857
|
+
e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), dt(e), at(e, t), jo(e, t);
|
|
858
858
|
}
|
|
859
859
|
function jo(e, t) {
|
|
860
860
|
let n = e.nodes().find((o) => !e.node(o).parent);
|
|
@@ -891,9 +891,9 @@ function Po(e) {
|
|
|
891
891
|
Rt(e);
|
|
892
892
|
}
|
|
893
893
|
}
|
|
894
|
-
var Fo =
|
|
894
|
+
var Fo = lt;
|
|
895
895
|
function Ro(e) {
|
|
896
|
-
|
|
896
|
+
lt(e), vn(e);
|
|
897
897
|
}
|
|
898
898
|
function Rt(e) {
|
|
899
899
|
Oo(e);
|
|
@@ -932,13 +932,13 @@ function Wo(e) {
|
|
|
932
932
|
let i = n;
|
|
933
933
|
e.children(o).forEach(r), t[o] = { low: i, lim: n++ };
|
|
934
934
|
}
|
|
935
|
-
return e.children(
|
|
935
|
+
return e.children(Be).forEach(r), t;
|
|
936
936
|
}
|
|
937
937
|
function $o(e) {
|
|
938
|
-
let t =
|
|
938
|
+
let t = ve(e, "root", {}, "_root"), n = Go(e), r = Object.values(n), o = Q(Math.max, r) - 1, i = 2 * o + 1;
|
|
939
939
|
e.graph().nestingRoot = t, e.edges().forEach((l) => e.edge(l).minlen *= i);
|
|
940
940
|
let s = Yo(e) + 1;
|
|
941
|
-
e.children(
|
|
941
|
+
e.children(Be).forEach((l) => Sn(e, t, i, s, o, n, l)), e.graph().nodeRankFactor = i;
|
|
942
942
|
}
|
|
943
943
|
function Sn(e, t, n, r, o, i, s) {
|
|
944
944
|
var l;
|
|
@@ -951,8 +951,8 @@ function Sn(e, t, n, r, o, i, s) {
|
|
|
951
951
|
e.setParent(a, s), f.borderTop = a, e.setParent(c, s), f.borderBottom = c, d.forEach((h) => {
|
|
952
952
|
var g;
|
|
953
953
|
Sn(e, t, n, r, o, i, h);
|
|
954
|
-
let E = e.node(h), m = E.borderTop ? E.borderTop : h, p = E.borderBottom ? E.borderBottom : h,
|
|
955
|
-
e.setEdge(a, m, { weight:
|
|
954
|
+
let E = e.node(h), m = E.borderTop ? E.borderTop : h, p = E.borderBottom ? E.borderBottom : h, x = E.borderTop ? r : 2 * r, k = m !== p ? 1 : o - ((g = i[s]) != null ? g : 0) + 1;
|
|
955
|
+
e.setEdge(a, m, { weight: x, minlen: k, nestingEdge: !0 }), e.setEdge(p, c, { weight: x, minlen: k, nestingEdge: !0 });
|
|
956
956
|
}), e.parent(s) || e.setEdge(t, a, { weight: 0, minlen: o + ((l = i[s]) != null ? l : 0) });
|
|
957
957
|
}
|
|
958
958
|
function Go(e) {
|
|
@@ -961,7 +961,7 @@ function Go(e) {
|
|
|
961
961
|
let i = e.children(r);
|
|
962
962
|
i && i.length && i.forEach((s) => n(s, o + 1)), t[r] = o;
|
|
963
963
|
}
|
|
964
|
-
return e.children(
|
|
964
|
+
return e.children(Be).forEach((r) => n(r, 1)), t;
|
|
965
965
|
}
|
|
966
966
|
function Yo(e) {
|
|
967
967
|
return e.edges().reduce((t, n) => t + e.edge(n).weight, 0);
|
|
@@ -981,10 +981,10 @@ function Uo(e) {
|
|
|
981
981
|
for (let i = o.minRank, s = o.maxRank + 1; i < s; ++i) At(e, "borderLeft", "_bl", n, o, i), At(e, "borderRight", "_br", n, o, i);
|
|
982
982
|
}
|
|
983
983
|
}
|
|
984
|
-
e.children(
|
|
984
|
+
e.children(Be).forEach(t);
|
|
985
985
|
}
|
|
986
986
|
function At(e, t, n, r, o, i) {
|
|
987
|
-
let s = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], d =
|
|
987
|
+
let s = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], d = ve(e, "border", s, n);
|
|
988
988
|
o[t][i] = d, e.setParent(d, r), l && e.setEdge(l, d, { weight: 1 });
|
|
989
989
|
}
|
|
990
990
|
function Vo(e) {
|
|
@@ -1005,28 +1005,28 @@ function Bt(e) {
|
|
|
1005
1005
|
e.width = e.height, e.height = t;
|
|
1006
1006
|
}
|
|
1007
1007
|
function Xo(e) {
|
|
1008
|
-
e.nodes().forEach((t) =>
|
|
1008
|
+
e.nodes().forEach((t) => Ue(e.node(t))), e.edges().forEach((t) => {
|
|
1009
1009
|
var n;
|
|
1010
1010
|
let r = e.edge(t);
|
|
1011
|
-
(n = r.points) == null || n.forEach(
|
|
1011
|
+
(n = r.points) == null || n.forEach(Ue), Object.hasOwn(r, "y") && Ue(r);
|
|
1012
1012
|
});
|
|
1013
1013
|
}
|
|
1014
|
-
function
|
|
1014
|
+
function Ue(e) {
|
|
1015
1015
|
e.y = -e.y;
|
|
1016
1016
|
}
|
|
1017
1017
|
function Jo(e) {
|
|
1018
|
-
e.nodes().forEach((t) =>
|
|
1018
|
+
e.nodes().forEach((t) => Ve(e.node(t))), e.edges().forEach((t) => {
|
|
1019
1019
|
var n;
|
|
1020
1020
|
let r = e.edge(t);
|
|
1021
|
-
(n = r.points) == null || n.forEach(
|
|
1021
|
+
(n = r.points) == null || n.forEach(Ve), Object.hasOwn(r, "x") && Ve(r);
|
|
1022
1022
|
});
|
|
1023
1023
|
}
|
|
1024
|
-
function
|
|
1024
|
+
function Ve(e) {
|
|
1025
1025
|
let t = e.x;
|
|
1026
1026
|
e.x = e.y, e.y = t;
|
|
1027
1027
|
}
|
|
1028
1028
|
function Zo(e) {
|
|
1029
|
-
let t = {}, n = e.nodes().filter((l) => !e.children(l).length), r = n.map((l) => e.node(l).rank), o = Q(Math.max, r), i =
|
|
1029
|
+
let t = {}, n = e.nodes().filter((l) => !e.children(l).length), r = n.map((l) => e.node(l).rank), o = Q(Math.max, r), i = Ne(o + 1).map(() => []);
|
|
1030
1030
|
function s(l) {
|
|
1031
1031
|
if (t[l]) return;
|
|
1032
1032
|
t[l] = !0;
|
|
@@ -1100,7 +1100,7 @@ function ri(e) {
|
|
|
1100
1100
|
let o = e.pop();
|
|
1101
1101
|
t.push(o), o.in.reverse().forEach(n(o)), o.out.forEach(r(o));
|
|
1102
1102
|
}
|
|
1103
|
-
return t.filter((o) => !o.merged).map((o) =>
|
|
1103
|
+
return t.filter((o) => !o.merged).map((o) => Re(o, ["vs", "i", "barycenter", "weight"]));
|
|
1104
1104
|
}
|
|
1105
1105
|
function oi(e, t) {
|
|
1106
1106
|
let n = 0, r = 0;
|
|
@@ -1170,7 +1170,7 @@ function di(e, t, n, r) {
|
|
|
1170
1170
|
}
|
|
1171
1171
|
function ci(e) {
|
|
1172
1172
|
let t;
|
|
1173
|
-
for (; e.hasNode(t =
|
|
1173
|
+
for (; e.hasNode(t = st("_root")); ) ;
|
|
1174
1174
|
return t;
|
|
1175
1175
|
}
|
|
1176
1176
|
function fi(e, t, n) {
|
|
@@ -1191,7 +1191,7 @@ function Tn(e, t = {}) {
|
|
|
1191
1191
|
t.customOrder(e, Tn);
|
|
1192
1192
|
return;
|
|
1193
1193
|
}
|
|
1194
|
-
let n = yn(e), r = Wt(e,
|
|
1194
|
+
let n = yn(e), r = Wt(e, Ne(1, n + 1), "inEdges"), o = Wt(e, Ne(n - 1, -1, -1), "outEdges"), i = Zo(e);
|
|
1195
1195
|
if ($t(e, i), t.disableOptimalOrderHeuristic) return;
|
|
1196
1196
|
let s = Number.POSITIVE_INFINITY, l, d = t.constraints || [];
|
|
1197
1197
|
for (let a = 0, c = 0; c < 4; ++a, ++c) {
|
|
@@ -1233,8 +1233,8 @@ function hi(e, t) {
|
|
|
1233
1233
|
(h || c === a) && (i.slice(l, f + 1).forEach((E) => {
|
|
1234
1234
|
let m = e.predecessors(E);
|
|
1235
1235
|
m && m.forEach((p) => {
|
|
1236
|
-
let
|
|
1237
|
-
(
|
|
1236
|
+
let x = e.node(p), k = x.order;
|
|
1237
|
+
(k < s || g < k) && !(x.dummy && e.node(E).dummy) && In(n, p, E);
|
|
1238
1238
|
});
|
|
1239
1239
|
}), l = f + 1, s = g);
|
|
1240
1240
|
}), i;
|
|
@@ -1244,7 +1244,7 @@ function hi(e, t) {
|
|
|
1244
1244
|
function gi(e, t) {
|
|
1245
1245
|
let n = {};
|
|
1246
1246
|
function r(i, s, l, d, a) {
|
|
1247
|
-
|
|
1247
|
+
Ne(s, l).forEach((c) => {
|
|
1248
1248
|
let f = i[c];
|
|
1249
1249
|
if (f !== void 0 && e.node(f).dummy) {
|
|
1250
1250
|
let h = e.predecessors(f);
|
|
@@ -1314,8 +1314,8 @@ function bi(e, t, n, r) {
|
|
|
1314
1314
|
if (m === void 0) continue;
|
|
1315
1315
|
let p = s[m];
|
|
1316
1316
|
if (p !== void 0 && i[a] === a && d < p && !yi(n, a, m)) {
|
|
1317
|
-
let
|
|
1318
|
-
|
|
1317
|
+
let x = o[m];
|
|
1318
|
+
x !== void 0 && (i[m] = a, i[a] = o[a] = x, d = p);
|
|
1319
1319
|
}
|
|
1320
1320
|
}
|
|
1321
1321
|
}
|
|
@@ -1325,29 +1325,29 @@ function bi(e, t, n, r) {
|
|
|
1325
1325
|
function mi(e, t, n, r, o = !1) {
|
|
1326
1326
|
let i = {}, s = vi(e, t, n, o), l = o ? "borderLeft" : "borderRight";
|
|
1327
1327
|
function d(g, E) {
|
|
1328
|
-
let m = s.nodes().slice(), p = {},
|
|
1329
|
-
for (;
|
|
1330
|
-
if (p[
|
|
1328
|
+
let m = s.nodes().slice(), p = {}, x = m.pop();
|
|
1329
|
+
for (; x; ) {
|
|
1330
|
+
if (p[x]) g(x);
|
|
1331
1331
|
else {
|
|
1332
|
-
p[
|
|
1333
|
-
for (let
|
|
1332
|
+
p[x] = !0, m.push(x);
|
|
1333
|
+
for (let k of E(x)) m.push(k);
|
|
1334
1334
|
}
|
|
1335
|
-
|
|
1335
|
+
x = m.pop();
|
|
1336
1336
|
}
|
|
1337
1337
|
}
|
|
1338
1338
|
function a(g) {
|
|
1339
1339
|
let E = s.inEdges(g);
|
|
1340
1340
|
E ? i[g] = E.reduce((m, p) => {
|
|
1341
|
-
var
|
|
1342
|
-
let
|
|
1343
|
-
return Math.max(m,
|
|
1341
|
+
var x;
|
|
1342
|
+
let k = (x = i[p.v]) != null ? x : 0, O = s.edge(p);
|
|
1343
|
+
return Math.max(m, k + (O !== void 0 ? O : 0));
|
|
1344
1344
|
}, 0) : i[g] = 0;
|
|
1345
1345
|
}
|
|
1346
1346
|
function c(g) {
|
|
1347
1347
|
let E = s.outEdges(g), m = Number.POSITIVE_INFINITY;
|
|
1348
|
-
E && (m = E.reduce((
|
|
1349
|
-
let O = i[
|
|
1350
|
-
return Math.min(
|
|
1348
|
+
E && (m = E.reduce((x, k) => {
|
|
1349
|
+
let O = i[k.w], z = s.edge(k);
|
|
1350
|
+
return Math.min(x, (O !== void 0 ? O : 0) - (z !== void 0 ? z : 0));
|
|
1351
1351
|
}, Number.POSITIVE_INFINITY));
|
|
1352
1352
|
let p = e.node(g);
|
|
1353
1353
|
m !== Number.POSITIVE_INFINITY && p.borderType !== l && (i[g] = Math.max(i[g] !== void 0 ? i[g] : 0, m));
|
|
@@ -1401,13 +1401,13 @@ function Ei(e, t) {
|
|
|
1401
1401
|
let l = i + s, d = e[l];
|
|
1402
1402
|
if (!d || d === t) return;
|
|
1403
1403
|
let a = Object.values(d), c = r - Q(Math.min, a);
|
|
1404
|
-
s !== "l" && (c = o - Q(Math.max, a)), c && (e[l] =
|
|
1404
|
+
s !== "l" && (c = o - Q(Math.max, a)), c && (e[l] = Ae(d, (f) => f + c));
|
|
1405
1405
|
});
|
|
1406
1406
|
});
|
|
1407
1407
|
}
|
|
1408
1408
|
function xi(e, t = void 0) {
|
|
1409
1409
|
let n = e.ul;
|
|
1410
|
-
return n ?
|
|
1410
|
+
return n ? Ae(n, (r, o) => {
|
|
1411
1411
|
var i, s;
|
|
1412
1412
|
if (t) {
|
|
1413
1413
|
let d = t.toLowerCase(), a = e[d];
|
|
@@ -1426,7 +1426,7 @@ function ki(e) {
|
|
|
1426
1426
|
o = s === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((l) => {
|
|
1427
1427
|
l === "r" && (o = o.map((c) => Object.values(c).reverse()));
|
|
1428
1428
|
let d = bi(e, o, n, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), a = mi(e, o, d.root, d.align, l === "r");
|
|
1429
|
-
l === "r" && (a =
|
|
1429
|
+
l === "r" && (a = Ae(a, (c) => -c)), r[s + l] = a;
|
|
1430
1430
|
});
|
|
1431
1431
|
});
|
|
1432
1432
|
let i = wi(e, r);
|
|
@@ -1495,17 +1495,17 @@ function Oi(e, t) {
|
|
|
1495
1495
|
}
|
|
1496
1496
|
var Mi = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], ji = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, zi = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], Li = ["width", "height", "rank"], Gt = { width: 0, height: 0 }, Pi = ["minlen", "weight", "width", "height", "labeloffset"], Fi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, Ri = ["labelpos"];
|
|
1497
1497
|
function Ai(e) {
|
|
1498
|
-
let t = new q({ multigraph: !0, compound: !0 }), n =
|
|
1499
|
-
return t.setGraph(Object.assign({}, ji,
|
|
1500
|
-
let o =
|
|
1498
|
+
let t = new q({ multigraph: !0, compound: !0 }), n = Xe(e.graph());
|
|
1499
|
+
return t.setGraph(Object.assign({}, ji, qe(n, Mi), Re(n, zi))), e.nodes().forEach((r) => {
|
|
1500
|
+
let o = Xe(e.node(r)), i = qe(o, Li);
|
|
1501
1501
|
Object.keys(Gt).forEach((l) => {
|
|
1502
1502
|
i[l] === void 0 && (i[l] = Gt[l]);
|
|
1503
1503
|
}), t.setNode(r, i);
|
|
1504
1504
|
let s = e.parent(r);
|
|
1505
1505
|
s !== void 0 && t.setParent(r, s);
|
|
1506
1506
|
}), e.edges().forEach((r) => {
|
|
1507
|
-
let o =
|
|
1508
|
-
t.setEdge(r, Object.assign({}, Fi,
|
|
1507
|
+
let o = Xe(e.edge(r));
|
|
1508
|
+
t.setEdge(r, Object.assign({}, Fi, qe(o, Pi), Re(o, Ri)));
|
|
1509
1509
|
}), t;
|
|
1510
1510
|
}
|
|
1511
1511
|
function Bi(e) {
|
|
@@ -1520,7 +1520,7 @@ function Di(e) {
|
|
|
1520
1520
|
let n = e.edge(t);
|
|
1521
1521
|
if (n.width && n.height) {
|
|
1522
1522
|
let r = e.node(t.v), o = { rank: (e.node(t.w).rank - r.rank) / 2 + r.rank, e: t };
|
|
1523
|
-
|
|
1523
|
+
ve(e, "edge-proxy", o, "_ep");
|
|
1524
1524
|
}
|
|
1525
1525
|
});
|
|
1526
1526
|
}
|
|
@@ -1608,7 +1608,7 @@ function qi(e) {
|
|
|
1608
1608
|
t.forEach((r, o) => {
|
|
1609
1609
|
let i = e.node(r);
|
|
1610
1610
|
i.order = o + n, (i.selfEdges || []).forEach((s) => {
|
|
1611
|
-
|
|
1611
|
+
ve(e, "selfedge", { width: s.label.width, height: s.label.height, rank: i.rank, order: o + ++n, e: s.e, label: s.label }, "_se");
|
|
1612
1612
|
}), delete i.selfEdges;
|
|
1613
1613
|
});
|
|
1614
1614
|
});
|
|
@@ -1622,10 +1622,10 @@ function Xi(e) {
|
|
|
1622
1622
|
}
|
|
1623
1623
|
});
|
|
1624
1624
|
}
|
|
1625
|
-
function
|
|
1626
|
-
return Re(
|
|
1625
|
+
function qe(e, t) {
|
|
1626
|
+
return Ae(Re(e, t), Number);
|
|
1627
1627
|
}
|
|
1628
|
-
function
|
|
1628
|
+
function Xe(e) {
|
|
1629
1629
|
let t = {};
|
|
1630
1630
|
return e && Object.entries(e).forEach(([n, r]) => {
|
|
1631
1631
|
typeof n == "string" && (n = n.toLowerCase()), t[n] = r;
|
|
@@ -1813,7 +1813,7 @@ function ns({
|
|
|
1813
1813
|
}
|
|
1814
1814
|
);
|
|
1815
1815
|
}
|
|
1816
|
-
const
|
|
1816
|
+
const Ce = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i, width: s = 720 }) => {
|
|
1817
1817
|
const [l, d] = L(!1), a = () => d((h) => !h), c = () => /* @__PURE__ */ w(ne, { sx: { display: "flex", alignItems: "center", p: 2, pt: 3, borderBottom: "1px solid #e0e0e0", mb: 0, flexShrink: 0 }, children: [
|
|
1818
1818
|
r && /* @__PURE__ */ u(ne, { sx: { mr: 1.5, display: "flex", alignItems: "center", fontSize: "1.25rem", color: "#1DBF60" }, children: r }),
|
|
1819
1819
|
/* @__PURE__ */ u("span", { style: { flexGrow: 1, fontSize: 14, fontWeight: 500, color: "#212121" }, children: n }),
|
|
@@ -1863,16 +1863,16 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
1863
1863
|
onClose: o,
|
|
1864
1864
|
loadTriggerSources: i
|
|
1865
1865
|
}) => {
|
|
1866
|
-
const [s, l] = L("trigger"), [d, a] = L(null), [c, f] = L([]), [h, g] = L([]), [E, m] = L(!1), [p,
|
|
1866
|
+
const [s, l] = L("trigger"), [d, a] = L(null), [c, f] = L([]), [h, g] = L([]), [E, m] = L(!1), [p, x] = L(null);
|
|
1867
1867
|
se(() => {
|
|
1868
|
-
e || (l("trigger"), a(null), f([]), g([]), m(!1),
|
|
1868
|
+
e || (l("trigger"), a(null), f([]), g([]), m(!1), x(null));
|
|
1869
1869
|
}, [e]);
|
|
1870
|
-
const
|
|
1870
|
+
const k = U(async (P) => {
|
|
1871
1871
|
if (!i) {
|
|
1872
1872
|
r(P);
|
|
1873
1873
|
return;
|
|
1874
1874
|
}
|
|
1875
|
-
a(P), m(!0),
|
|
1875
|
+
a(P), m(!0), x(null);
|
|
1876
1876
|
try {
|
|
1877
1877
|
const M = await i(P.triggerKey);
|
|
1878
1878
|
if (!M || M.length === 0) {
|
|
@@ -1881,18 +1881,18 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
1881
1881
|
}
|
|
1882
1882
|
f(M), l("sources");
|
|
1883
1883
|
} catch (M) {
|
|
1884
|
-
|
|
1884
|
+
x(M instanceof Error ? M.message : "Failed to load sources.");
|
|
1885
1885
|
} finally {
|
|
1886
1886
|
m(!1);
|
|
1887
1887
|
}
|
|
1888
1888
|
}, [i, r]), O = () => {
|
|
1889
|
-
l("trigger"), a(null), f([]), g([]),
|
|
1889
|
+
l("trigger"), a(null), f([]), g([]), x(null);
|
|
1890
1890
|
}, z = () => {
|
|
1891
1891
|
d && r(d, h);
|
|
1892
|
-
}, W = s === "sources" && d, $ = W ? /* @__PURE__ */ w(
|
|
1893
|
-
/* @__PURE__ */ u(
|
|
1892
|
+
}, W = s === "sources" && d, $ = W ? /* @__PURE__ */ w(Se, { children: [
|
|
1893
|
+
/* @__PURE__ */ u(Le, { type: "button", variant: "outlined", size: "small", onClick: O, children: n.cancel ?? "Back" }),
|
|
1894
1894
|
/* @__PURE__ */ u(
|
|
1895
|
-
|
|
1895
|
+
Le,
|
|
1896
1896
|
{
|
|
1897
1897
|
type: "button",
|
|
1898
1898
|
variant: "contained",
|
|
@@ -1904,7 +1904,7 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
1904
1904
|
)
|
|
1905
1905
|
] }) : null;
|
|
1906
1906
|
return /* @__PURE__ */ u(
|
|
1907
|
-
|
|
1907
|
+
Ce,
|
|
1908
1908
|
{
|
|
1909
1909
|
isOpen: e,
|
|
1910
1910
|
onClose: o,
|
|
@@ -1913,7 +1913,7 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
1913
1913
|
width: 500,
|
|
1914
1914
|
footer: $,
|
|
1915
1915
|
children: /* @__PURE__ */ w(ne, { sx: { p: 2 }, children: [
|
|
1916
|
-
!W && /* @__PURE__ */ w(
|
|
1916
|
+
!W && /* @__PURE__ */ w(Se, { children: [
|
|
1917
1917
|
/* @__PURE__ */ u("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: n.chooseTrigger }),
|
|
1918
1918
|
/* @__PURE__ */ w("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: [
|
|
1919
1919
|
t.map((P) => /* @__PURE__ */ w(
|
|
@@ -1921,11 +1921,11 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
1921
1921
|
{
|
|
1922
1922
|
className: "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-start ff-gap-3",
|
|
1923
1923
|
style: { cursor: E ? "wait" : "pointer", transition: "background 0.15s", opacity: E ? 0.6 : 1 },
|
|
1924
|
-
onClick: () => !E &&
|
|
1924
|
+
onClick: () => !E && k(P),
|
|
1925
1925
|
role: "button",
|
|
1926
1926
|
tabIndex: 0,
|
|
1927
1927
|
onKeyDown: (M) => {
|
|
1928
|
-
M.key === "Enter" && !E &&
|
|
1928
|
+
M.key === "Enter" && !E && k(P);
|
|
1929
1929
|
},
|
|
1930
1930
|
onMouseEnter: (M) => {
|
|
1931
1931
|
E || (M.currentTarget.style.background = "#f5f5f5");
|
|
@@ -1951,7 +1951,7 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
1951
1951
|
] }),
|
|
1952
1952
|
p && /* @__PURE__ */ u("p", { style: { fontSize: 12, color: "#d32f2f", marginTop: 12 }, children: p })
|
|
1953
1953
|
] }),
|
|
1954
|
-
W && /* @__PURE__ */ w(
|
|
1954
|
+
W && /* @__PURE__ */ w(Se, { children: [
|
|
1955
1955
|
/* @__PURE__ */ w(
|
|
1956
1956
|
"div",
|
|
1957
1957
|
{
|
|
@@ -1991,11 +1991,11 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
1991
1991
|
] })
|
|
1992
1992
|
}
|
|
1993
1993
|
);
|
|
1994
|
-
},
|
|
1994
|
+
}, Je = {
|
|
1995
1995
|
cursor: "pointer",
|
|
1996
1996
|
transition: "background 0.15s"
|
|
1997
|
-
},
|
|
1998
|
-
const { apps: i, ungrouped: s } =
|
|
1997
|
+
}, Ze = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", os = ({ open: e, availableDescriptors: t, messages: n, onSelect: r, onClose: o }) => {
|
|
1998
|
+
const { apps: i, ungrouped: s } = V(() => {
|
|
1999
1999
|
const f = /* @__PURE__ */ new Map(), h = [];
|
|
2000
2000
|
for (const g of t)
|
|
2001
2001
|
if (g.app) {
|
|
@@ -2018,7 +2018,7 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
2018
2018
|
}, [t]);
|
|
2019
2019
|
const c = !a;
|
|
2020
2020
|
return /* @__PURE__ */ u(
|
|
2021
|
-
|
|
2021
|
+
Ce,
|
|
2022
2022
|
{
|
|
2023
2023
|
isOpen: e,
|
|
2024
2024
|
onClose: o,
|
|
@@ -2044,12 +2044,12 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
2044
2044
|
}
|
|
2045
2045
|
),
|
|
2046
2046
|
/* @__PURE__ */ u("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: c ? n.chooseAction : `Pick an action from ${a.label}` }),
|
|
2047
|
-
/* @__PURE__ */ u("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ w(
|
|
2047
|
+
/* @__PURE__ */ u("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ w(Se, { children: [
|
|
2048
2048
|
i.map((f) => /* @__PURE__ */ w(
|
|
2049
2049
|
"div",
|
|
2050
2050
|
{
|
|
2051
|
-
className:
|
|
2052
|
-
style:
|
|
2051
|
+
className: Ze,
|
|
2052
|
+
style: Je,
|
|
2053
2053
|
onClick: () => d(f.key),
|
|
2054
2054
|
role: "button",
|
|
2055
2055
|
tabIndex: 0,
|
|
@@ -2076,8 +2076,8 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
2076
2076
|
s.map((f) => /* @__PURE__ */ w(
|
|
2077
2077
|
"div",
|
|
2078
2078
|
{
|
|
2079
|
-
className:
|
|
2080
|
-
style:
|
|
2079
|
+
className: Ze,
|
|
2080
|
+
style: Je,
|
|
2081
2081
|
onClick: () => r(f),
|
|
2082
2082
|
role: "button",
|
|
2083
2083
|
tabIndex: 0,
|
|
@@ -2103,8 +2103,8 @@ const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
|
|
|
2103
2103
|
a.descriptors.map((f) => /* @__PURE__ */ w(
|
|
2104
2104
|
"div",
|
|
2105
2105
|
{
|
|
2106
|
-
className:
|
|
2107
|
-
style:
|
|
2106
|
+
className: Ze,
|
|
2107
|
+
style: Je,
|
|
2108
2108
|
onClick: () => r(f),
|
|
2109
2109
|
role: "button",
|
|
2110
2110
|
tabIndex: 0,
|
|
@@ -2143,24 +2143,24 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
|
|
|
2143
2143
|
se(() => {
|
|
2144
2144
|
E((r == null ? void 0 : r[Kt]) ?? {});
|
|
2145
2145
|
}, [r, t]), se(() => {
|
|
2146
|
-
let
|
|
2146
|
+
let k = !1;
|
|
2147
2147
|
if (h(null), !n || !t || n.customPanel) {
|
|
2148
2148
|
d({ layout: "flat", fields: [] }), c(!1);
|
|
2149
2149
|
return;
|
|
2150
2150
|
}
|
|
2151
2151
|
const O = n.formSchema;
|
|
2152
2152
|
return typeof O == "function" ? (c(!0), O(t).then((z) => {
|
|
2153
|
-
|
|
2153
|
+
k || (d(Ht(z)), c(!1));
|
|
2154
2154
|
}).catch((z) => {
|
|
2155
|
-
|
|
2155
|
+
k || (d({ layout: "flat", fields: [] }), h(z instanceof Error ? z.message : "Unable to load configuration."), c(!1));
|
|
2156
2156
|
})) : (d(Ht(O)), c(!1)), () => {
|
|
2157
|
-
|
|
2157
|
+
k = !0;
|
|
2158
2158
|
};
|
|
2159
2159
|
}, [n, t]);
|
|
2160
|
-
const m = t ? `node-config-form-${t}` : "node-config-form", p = !a && !f && Ut(l),
|
|
2161
|
-
/* @__PURE__ */ u(
|
|
2160
|
+
const m = t ? `node-config-form-${t}` : "node-config-form", p = !a && !f && Ut(l), x = p ? /* @__PURE__ */ w(Se, { children: [
|
|
2161
|
+
/* @__PURE__ */ u(Le, { type: "button", variant: "text", size: "small", sx: { textTransform: "none", color: "#475569" }, onClick: s, children: o.cancel }),
|
|
2162
2162
|
/* @__PURE__ */ u(
|
|
2163
|
-
|
|
2163
|
+
Le,
|
|
2164
2164
|
{
|
|
2165
2165
|
type: "submit",
|
|
2166
2166
|
form: m,
|
|
@@ -2178,22 +2178,22 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
|
|
|
2178
2178
|
}
|
|
2179
2179
|
)
|
|
2180
2180
|
] }) : null;
|
|
2181
|
-
return n != null && n.customPanel && t ? /* @__PURE__ */ u(
|
|
2181
|
+
return n != null && n.customPanel && t ? /* @__PURE__ */ u(Ce, { isOpen: e, onClose: s, title: n.label ?? o.configureStep, icon: n.icon, width: 500, children: n.customPanel({
|
|
2182
2182
|
nodeId: t,
|
|
2183
2183
|
data: r ?? {},
|
|
2184
|
-
onSave: (
|
|
2185
|
-
i(t,
|
|
2184
|
+
onSave: (k) => {
|
|
2185
|
+
i(t, k), s();
|
|
2186
2186
|
},
|
|
2187
2187
|
onClose: s
|
|
2188
2188
|
}) }) : /* @__PURE__ */ u(
|
|
2189
|
-
|
|
2189
|
+
Ce,
|
|
2190
2190
|
{
|
|
2191
2191
|
isOpen: e,
|
|
2192
2192
|
onClose: s,
|
|
2193
2193
|
title: (n == null ? void 0 : n.label) ?? o.configureStep,
|
|
2194
2194
|
icon: n == null ? void 0 : n.icon,
|
|
2195
2195
|
width: 500,
|
|
2196
|
-
footer:
|
|
2196
|
+
footer: x,
|
|
2197
2197
|
children: /* @__PURE__ */ w(ne, { sx: { p: 2 }, children: [
|
|
2198
2198
|
a && /* @__PURE__ */ u("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.loadingConfiguration }),
|
|
2199
2199
|
!a && f && /* @__PURE__ */ u("p", { style: { fontSize: 13, color: "#d32f2f" }, children: f }),
|
|
@@ -2206,10 +2206,10 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
|
|
|
2206
2206
|
formId: m,
|
|
2207
2207
|
conditionConfig: g,
|
|
2208
2208
|
onConditionConfigChange: E,
|
|
2209
|
-
onSubmit: (
|
|
2209
|
+
onSubmit: (k) => {
|
|
2210
2210
|
if (!t) return;
|
|
2211
2211
|
const O = Object.keys(g).length > 0;
|
|
2212
|
-
i(t, { ...
|
|
2212
|
+
i(t, { ...k, [Kt]: O ? g : void 0 }), s();
|
|
2213
2213
|
}
|
|
2214
2214
|
}
|
|
2215
2215
|
)
|
|
@@ -2231,7 +2231,7 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
|
|
|
2231
2231
|
}
|
|
2232
2232
|
s({ status: "loading" }), o(n).then((l) => s({ status: "loaded", state: l })).catch((l) => s({ status: "error", message: (l == null ? void 0 : l.message) ?? "Failed to load workflow" }));
|
|
2233
2233
|
}, [e, n, o]), /* @__PURE__ */ u(
|
|
2234
|
-
|
|
2234
|
+
Ce,
|
|
2235
2235
|
{
|
|
2236
2236
|
isOpen: e,
|
|
2237
2237
|
onClose: t,
|
|
@@ -2272,7 +2272,7 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
|
|
|
2272
2272
|
readOnly: !0
|
|
2273
2273
|
}
|
|
2274
2274
|
) });
|
|
2275
|
-
},
|
|
2275
|
+
}, me = 350, tt = 70, nt = 60, rt = {
|
|
2276
2276
|
startNode: 40,
|
|
2277
2277
|
endNode: 40,
|
|
2278
2278
|
addTriggerNode: 56,
|
|
@@ -2299,59 +2299,59 @@ function Vt() {
|
|
|
2299
2299
|
function ds(e, t, n, r = "TB") {
|
|
2300
2300
|
const o = new Yt.graphlib.Graph();
|
|
2301
2301
|
return o.setGraph({ rankdir: r, ranksep: 70, nodesep: 50 }), o.setDefaultEdgeLabel(() => ({})), e.forEach((i) => {
|
|
2302
|
-
const s = n[i.id] ?? { width:
|
|
2302
|
+
const s = n[i.id] ?? { width: me, height: rt[i.type ?? ""] ?? 80 };
|
|
2303
2303
|
o.setNode(i.id, { width: s.width, height: s.height });
|
|
2304
2304
|
}), t.forEach((i) => o.setEdge(i.source, i.target)), Yt.layout(o), e.map((i) => {
|
|
2305
2305
|
var a, c;
|
|
2306
|
-
const s = o.node(i.id), l = ((a = n[i.id]) == null ? void 0 : a.width) ??
|
|
2306
|
+
const s = o.node(i.id), l = ((a = n[i.id]) == null ? void 0 : a.width) ?? me, d = ((c = n[i.id]) == null ? void 0 : c.height) ?? rt[i.type ?? ""] ?? 80;
|
|
2307
2307
|
return { ...i, position: { x: s.x - l / 2, y: s.y - d / 2 } };
|
|
2308
2308
|
});
|
|
2309
2309
|
}
|
|
2310
2310
|
const fe = (e) => e === "filter" || e === "approval";
|
|
2311
2311
|
function cs(e, t, n, r) {
|
|
2312
|
-
const s =
|
|
2312
|
+
const s = tt, l = 30, d = 30, a = {}, c = {}, f = /* @__PURE__ */ new Map();
|
|
2313
2313
|
for (const p of e) f.set(p.id, p);
|
|
2314
2314
|
for (const p of Object.values(t))
|
|
2315
|
-
for (const
|
|
2316
|
-
for (const
|
|
2317
|
-
const h = (p,
|
|
2318
|
-
const O = r[p] ?? { width:
|
|
2319
|
-
return a[p] = { x:
|
|
2320
|
-
}, g = (p,
|
|
2321
|
-
let O =
|
|
2315
|
+
for (const x of Object.values(p))
|
|
2316
|
+
for (const k of x) f.set(k.id, k);
|
|
2317
|
+
const h = (p, x, k) => {
|
|
2318
|
+
const O = r[p] ?? { width: me, height: 80 };
|
|
2319
|
+
return a[p] = { x: x - O.width / 2, y: k }, k + O.height;
|
|
2320
|
+
}, g = (p, x, k) => {
|
|
2321
|
+
let O = k;
|
|
2322
2322
|
for (const z of p)
|
|
2323
|
-
O = h(z.id,
|
|
2323
|
+
O = h(z.id, x, O) + s, fe(z.kind) && t[z.id] && (O = E(z.id, x, O));
|
|
2324
2324
|
return O;
|
|
2325
|
-
}, E = (p,
|
|
2326
|
-
const O =
|
|
2325
|
+
}, E = (p, x, k) => {
|
|
2326
|
+
const O = x + 180, z = t[p], W = Object.keys(z), $ = f.get(p), P = ($ == null ? void 0 : $.branchLabels) ?? { pass: "Pass", fail: "Fail" }, M = a[p], H = r[p] ?? { width: me, height: 80 }, oe = M.y + H.height;
|
|
2327
2327
|
if (($ == null ? void 0 : $.branchStyle) === "inline-gate") {
|
|
2328
|
-
const ie = [];
|
|
2329
|
-
let ee = M.y +
|
|
2328
|
+
const ie = [], he = x + H.width / 2 + 140;
|
|
2329
|
+
let ee = M.y + H.height / 2;
|
|
2330
2330
|
W.slice(1).forEach((ge) => {
|
|
2331
|
-
var
|
|
2331
|
+
var we, Ee;
|
|
2332
2332
|
ie.push({ y: ee - oe, label: P[ge] ?? ge, isPass: !1 });
|
|
2333
|
-
const
|
|
2334
|
-
ee = g(z[ge],
|
|
2333
|
+
const De = ee - (((Ee = r[(we = z[ge][0]) == null ? void 0 : we.id]) == null ? void 0 : Ee.height) ?? 50) / 2;
|
|
2334
|
+
ee = g(z[ge], he, De) + l;
|
|
2335
2335
|
});
|
|
2336
|
-
const
|
|
2337
|
-
return c[p] = { branches: ie, height: Math.max(ee,
|
|
2336
|
+
const Oe = g(z[W[0]], x, k);
|
|
2337
|
+
return c[p] = { branches: ie, height: Math.max(ee, Oe) - oe, indent: 180 }, Math.max(Oe, ee);
|
|
2338
2338
|
}
|
|
2339
2339
|
const le = [];
|
|
2340
|
-
let A =
|
|
2341
|
-
return W.forEach((ie,
|
|
2342
|
-
const
|
|
2340
|
+
let A = k;
|
|
2341
|
+
return W.forEach((ie, he) => {
|
|
2342
|
+
const Ie = z[ie], ee = A;
|
|
2343
2343
|
le.push({
|
|
2344
|
-
y:
|
|
2344
|
+
y: ee - oe,
|
|
2345
2345
|
label: P[ie] ?? ie,
|
|
2346
|
-
isPass:
|
|
2347
|
-
}), A = g(
|
|
2346
|
+
isPass: he === 0
|
|
2347
|
+
}), A = g(Ie, O, A + d), he < W.length - 1 && (A += l);
|
|
2348
2348
|
}), c[p] = {
|
|
2349
2349
|
branches: le,
|
|
2350
2350
|
height: A - oe,
|
|
2351
2351
|
indent: 180
|
|
2352
2352
|
}, A;
|
|
2353
2353
|
};
|
|
2354
|
-
let m =
|
|
2354
|
+
let m = nt;
|
|
2355
2355
|
for (const p of e)
|
|
2356
2356
|
m = h(p.id, 400, m) + s, fe(p.kind) && t[p.id] && (m = E(p.id, 400, m));
|
|
2357
2357
|
return {
|
|
@@ -2384,21 +2384,21 @@ function fs(e, t, n, r, o) {
|
|
|
2384
2384
|
};
|
|
2385
2385
|
}
|
|
2386
2386
|
function us(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
|
|
2387
|
-
const l = o.edgeColor ?? "#b0bec5", d = [], a = [], c = (m, p,
|
|
2388
|
-
const
|
|
2389
|
-
if (!
|
|
2390
|
-
const z = p ?? { pass: "Pass", fail: "Fail" }, W = Object.keys(
|
|
2387
|
+
const l = o.edgeColor ?? "#b0bec5", d = [], a = [], c = (m, p, x) => {
|
|
2388
|
+
const k = t[m];
|
|
2389
|
+
if (!k) return;
|
|
2390
|
+
const z = p ?? { pass: "Pass", fail: "Fail" }, W = Object.keys(k), $ = x === "inline-gate", P = (M, H, oe, le) => {
|
|
2391
2391
|
if (M.length !== 0) {
|
|
2392
2392
|
M.forEach((A) => d.push(qt(A))), $ && le === 0 ? a.push({
|
|
2393
|
-
id: `e-${m}-${
|
|
2393
|
+
id: `e-${m}-${H}-start`,
|
|
2394
2394
|
source: m,
|
|
2395
2395
|
sourceHandle: "pass",
|
|
2396
2396
|
target: M[0].id,
|
|
2397
2397
|
type: "plusEdge",
|
|
2398
2398
|
style: { stroke: l },
|
|
2399
|
-
data: { onAddStepClick: n, referenceNodeType: "filterNode", filterId: m, branch:
|
|
2399
|
+
data: { onAddStepClick: n, referenceNodeType: "filterNode", filterId: m, branch: H }
|
|
2400
2400
|
}) : a.push({
|
|
2401
|
-
id: `e-${m}-${
|
|
2401
|
+
id: `e-${m}-${H}-start`,
|
|
2402
2402
|
source: m,
|
|
2403
2403
|
// inline-gate Fail leaves the dedicated RIGHT handle so it routes out
|
|
2404
2404
|
// to the side instead of tangling with the Pass edge at the bottom.
|
|
@@ -2406,32 +2406,32 @@ function us(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
|
|
|
2406
2406
|
target: M[0].id,
|
|
2407
2407
|
type: "gatewayBranchEdge",
|
|
2408
2408
|
style: { stroke: l },
|
|
2409
|
-
data: { branch:
|
|
2409
|
+
data: { branch: H, filterId: m, label: oe, isFirst: le === 0, onAddStepClick: n, verticalRouting: s === "vertical" && !$, sideRouting: $ }
|
|
2410
2410
|
});
|
|
2411
2411
|
for (let A = 1; A < M.length; A++)
|
|
2412
|
-
fe(M[A - 1].kind) || a.push(fs(M[A - 1], M[A], l, n, { filterId: m, branch:
|
|
2412
|
+
fe(M[A - 1].kind) || a.push(fs(M[A - 1], M[A], l, n, { filterId: m, branch: H }));
|
|
2413
2413
|
for (const A of M)
|
|
2414
2414
|
fe(A.kind) && t[A.id] && c(A.id, A.branchLabels, A.branchStyle);
|
|
2415
2415
|
}
|
|
2416
2416
|
};
|
|
2417
|
-
W.forEach((M,
|
|
2418
|
-
P(
|
|
2417
|
+
W.forEach((M, H) => {
|
|
2418
|
+
P(k[M], M, z[M] ?? M, H);
|
|
2419
2419
|
});
|
|
2420
2420
|
};
|
|
2421
2421
|
for (let m = 0; m < e.length; m++) {
|
|
2422
2422
|
const p = e[m];
|
|
2423
2423
|
if (d.push(qt(p)), m > 0) {
|
|
2424
|
-
const
|
|
2425
|
-
if (
|
|
2424
|
+
const x = e[m - 1], k = x.kind === "start" || x.kind === "addTrigger";
|
|
2425
|
+
if (x.kind === "filter" || x.kind === "approval") continue;
|
|
2426
2426
|
a.push({
|
|
2427
|
-
id: `e-${
|
|
2428
|
-
source:
|
|
2427
|
+
id: `e-${x.id}-${p.id}`,
|
|
2428
|
+
source: x.id,
|
|
2429
2429
|
target: p.id,
|
|
2430
|
-
type:
|
|
2430
|
+
type: k ? "plainEdge" : "plusEdge",
|
|
2431
2431
|
style: { stroke: l },
|
|
2432
|
-
data:
|
|
2432
|
+
data: k ? {} : {
|
|
2433
2433
|
onAddStepClick: n,
|
|
2434
|
-
referenceNodeType:
|
|
2434
|
+
referenceNodeType: x.reactFlowType
|
|
2435
2435
|
}
|
|
2436
2436
|
});
|
|
2437
2437
|
}
|
|
@@ -2440,22 +2440,22 @@ function us(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
|
|
|
2440
2440
|
const f = {};
|
|
2441
2441
|
if (d.forEach((m) => {
|
|
2442
2442
|
f[m.id] = {
|
|
2443
|
-
width:
|
|
2444
|
-
height: r[m.id] ??
|
|
2443
|
+
width: me,
|
|
2444
|
+
height: r[m.id] ?? rt[m.type ?? ""] ?? 80
|
|
2445
2445
|
};
|
|
2446
2446
|
}), !(Object.keys(t).length > 0)) {
|
|
2447
2447
|
if (i === "LR") {
|
|
2448
|
-
let O =
|
|
2448
|
+
let O = nt;
|
|
2449
2449
|
return { nodes: d.map((W) => {
|
|
2450
2450
|
const $ = f[W.id].width, P = f[W.id].height, M = { ...W, position: { x: O, y: 300 - P / 2 } };
|
|
2451
|
-
return O += $ +
|
|
2451
|
+
return O += $ + tt, M;
|
|
2452
2452
|
}), edges: a };
|
|
2453
2453
|
}
|
|
2454
2454
|
const m = 400;
|
|
2455
|
-
let p =
|
|
2456
|
-
return { nodes: d.map((
|
|
2457
|
-
const O = f[
|
|
2458
|
-
return p += O +
|
|
2455
|
+
let p = nt;
|
|
2456
|
+
return { nodes: d.map((k) => {
|
|
2457
|
+
const O = f[k.id].height, z = { ...k, position: { x: m - me / 2, y: p } };
|
|
2458
|
+
return p += O + tt, z;
|
|
2459
2459
|
}), edges: a };
|
|
2460
2460
|
}
|
|
2461
2461
|
const g = e.some((m) => m.branchStyle === "inline-gate") || Object.values(t).some(
|
|
@@ -2464,7 +2464,7 @@ function us(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
|
|
|
2464
2464
|
if (s === "vertical" || g) {
|
|
2465
2465
|
const { nodes: m, railSpecs: p } = cs(e, t, d, f);
|
|
2466
2466
|
return { nodes: m.map(
|
|
2467
|
-
(
|
|
2467
|
+
(k) => p[k.id] ? { ...k, data: { ...k.data, _branchRail: p[k.id] } } : k
|
|
2468
2468
|
), edges: a };
|
|
2469
2469
|
}
|
|
2470
2470
|
return { nodes: ds(d, a, f, i), edges: a };
|
|
@@ -2487,39 +2487,39 @@ const Xt = ({
|
|
|
2487
2487
|
onNodeClick: E,
|
|
2488
2488
|
maxNodes: m,
|
|
2489
2489
|
layoutDirection: p = "TB",
|
|
2490
|
-
executionRecord:
|
|
2491
|
-
onFetchWorkflow:
|
|
2490
|
+
executionRecord: x,
|
|
2491
|
+
onFetchWorkflow: k,
|
|
2492
2492
|
hideHeader: O = !1,
|
|
2493
2493
|
workflowName: z,
|
|
2494
2494
|
onWorkflowNameChange: W,
|
|
2495
2495
|
onCancel: $,
|
|
2496
2496
|
workflowStatus: P,
|
|
2497
2497
|
workflowStatusColor: M,
|
|
2498
|
-
saveLabel:
|
|
2498
|
+
saveLabel: H,
|
|
2499
2499
|
optionsResolvers: oe
|
|
2500
2500
|
}) => {
|
|
2501
2501
|
const {
|
|
2502
2502
|
fitView: le = !0,
|
|
2503
2503
|
fitViewPadding: A = 0.3,
|
|
2504
2504
|
showControls: ie = !0,
|
|
2505
|
-
showMiniMap:
|
|
2506
|
-
panOnScroll:
|
|
2507
|
-
zoomOnScroll:
|
|
2508
|
-
minZoom:
|
|
2509
|
-
maxZoom:
|
|
2510
|
-
snapToGrid:
|
|
2511
|
-
snapGrid:
|
|
2505
|
+
showMiniMap: he = !1,
|
|
2506
|
+
panOnScroll: Ie = !0,
|
|
2507
|
+
zoomOnScroll: ee = !1,
|
|
2508
|
+
minZoom: Oe = 0.25,
|
|
2509
|
+
maxZoom: ge = 2,
|
|
2510
|
+
snapToGrid: De = !1,
|
|
2511
|
+
snapGrid: ct = [15, 15],
|
|
2512
2512
|
branchLayout: we = "horizontal",
|
|
2513
|
-
nodeBody:
|
|
2514
|
-
} = a,
|
|
2513
|
+
nodeBody: Ee = "full"
|
|
2514
|
+
} = a, xe = V(() => _r(d), [d]), [R, ae] = L(() => (n == null ? void 0 : n.slots) ?? Vt()), [Y, te] = L(() => (n == null ? void 0 : n.branches) ?? {}), [pe, X] = L(null), [We, ft] = L(null), [J, Me] = L(null), [de, ut] = L(null), [je, ht] = L(null), [j, gt] = L(() => {
|
|
2515
2515
|
const y = n == null ? void 0 : n.slots.find((S) => S.kind === "triggerFixed"), v = y != null && y.id.startsWith("trigger-") ? y.id.slice(8) : void 0;
|
|
2516
2516
|
return v ? t.lookup(v) ?? null : null;
|
|
2517
|
-
}), [pt, Mn] = L({}), jn =
|
|
2517
|
+
}), [pt, Mn] = L({}), jn = U((y) => {
|
|
2518
2518
|
Mn(y);
|
|
2519
|
-
}, []), zn =
|
|
2519
|
+
}, []), zn = V(() => ({ ...Un, ...r }), [r]), Ln = V(() => ({ ...as, ...o }), [o]), Pn = V(() => {
|
|
2520
2520
|
const y = R.filter((S) => S.kind === "userTask").length, v = Object.values(Y).flatMap((S) => Object.values(S).flat()).filter((S) => S.kind === "userTask").length;
|
|
2521
2521
|
return y + v;
|
|
2522
|
-
}, [R, Y]), yt = m ?? (j == null ? void 0 : j.maxTasks), bt = yt !== void 0 && Pn >= yt, ce =
|
|
2522
|
+
}, [R, Y]), yt = m ?? (j == null ? void 0 : j.maxTasks), bt = yt !== void 0 && Pn >= yt, ce = U((y) => {
|
|
2523
2523
|
const v = R.find((S) => S.id === y);
|
|
2524
2524
|
if (v) return v;
|
|
2525
2525
|
for (const S of Object.values(Y)) {
|
|
@@ -2527,9 +2527,9 @@ const Xt = ({
|
|
|
2527
2527
|
if (C) return C;
|
|
2528
2528
|
}
|
|
2529
2529
|
return null;
|
|
2530
|
-
}, [R, Y]),
|
|
2530
|
+
}, [R, Y]), $e = U((y) => {
|
|
2531
2531
|
s || (ft(y), X("nodeConfig"));
|
|
2532
|
-
}, [s]), mt =
|
|
2532
|
+
}, [s]), mt = U((y) => {
|
|
2533
2533
|
if (!s) {
|
|
2534
2534
|
if (R.some((v) => v.id === y)) {
|
|
2535
2535
|
const v = R.find((S) => S.id === y);
|
|
@@ -2566,11 +2566,11 @@ const Xt = ({
|
|
|
2566
2566
|
return C;
|
|
2567
2567
|
});
|
|
2568
2568
|
}
|
|
2569
|
-
}, [s, R]),
|
|
2569
|
+
}, [s, R]), Ge = U(() => {
|
|
2570
2570
|
s || X("triggerSelect");
|
|
2571
|
-
}, [s]), vt =
|
|
2572
|
-
s || bt || (
|
|
2573
|
-
}, [s, bt]), wt =
|
|
2571
|
+
}, [s]), vt = U((y, v) => {
|
|
2572
|
+
s || bt || (Me(y), ut(v.filterId && v.branch ? { filterId: v.filterId, branch: v.branch } : null), X("nodePicker"));
|
|
2573
|
+
}, [s, bt]), wt = U((y, v) => {
|
|
2574
2574
|
if (gt(y), X(null), y.skeletonState) {
|
|
2575
2575
|
const C = Array.isArray(v) && v.length > 0, T = (y.skeletonState.slots ?? []).map((b) => b.kind !== "triggerFixed" ? b : {
|
|
2576
2576
|
...b,
|
|
@@ -2602,7 +2602,7 @@ const Xt = ({
|
|
|
2602
2602
|
},
|
|
2603
2603
|
{ id: "end", kind: "end", reactFlowType: "endNode" }
|
|
2604
2604
|
]);
|
|
2605
|
-
}, []), Et =
|
|
2605
|
+
}, []), Et = U(() => {
|
|
2606
2606
|
var S;
|
|
2607
2607
|
const y = {
|
|
2608
2608
|
insertAfterSlot: null,
|
|
@@ -2618,17 +2618,17 @@ const Xt = ({
|
|
|
2618
2618
|
}
|
|
2619
2619
|
const v = R.findIndex((C) => C.id === J);
|
|
2620
2620
|
return y.upstreamSlots = v >= 0 ? R.slice(0, v + 1) : [], y.downstreamSlots = v >= 0 ? R.slice(v + 1) : [], y.insertAfterSlot = y.upstreamSlots[y.upstreamSlots.length - 1] ?? null, y;
|
|
2621
|
-
}, [R, Y, J, de, j]),
|
|
2621
|
+
}, [R, Y, J, de, j]), Ye = (y, v) => y.descriptorType === v || y.id === v || y.kind === v, xt = U(() => {
|
|
2622
2622
|
const y = e.list(), v = j != null && j.availableTasks ? y.filter((b) => j.availableTasks.includes(b.type)) : y, S = Et(), C = [
|
|
2623
2623
|
...R,
|
|
2624
2624
|
...Object.values(Y).flatMap((b) => Object.values(b).flat())
|
|
2625
|
-
], T = (b) => C.some((N) => b.some((_) =>
|
|
2625
|
+
], T = (b) => C.some((N) => b.some((_) => Ye(N, _)));
|
|
2626
2626
|
return v.filter((b) => b.maxPerWorkflow !== void 0 && R.filter((_) => _.descriptorType === b.type).length + Object.values(Y).flatMap((_) => Object.values(_).flat()).filter((_) => _.descriptorType === b.type).length >= b.maxPerWorkflow ? !1 : b.canInsert ? b.canInsert(S) : !(b.insertAfter && b.insertAfter.length > 0 && T(b.insertAfter) && !S.upstreamSlots.some(
|
|
2627
|
-
(_) => b.insertAfter.some((I) =>
|
|
2627
|
+
(_) => b.insertAfter.some((I) => Ye(_, I))
|
|
2628
2628
|
) || b.insertBefore && b.insertBefore.length > 0 && T(b.insertBefore) && !S.downstreamSlots.some(
|
|
2629
|
-
(_) => b.insertBefore.some((I) =>
|
|
2629
|
+
(_) => b.insertBefore.some((I) => Ye(_, I))
|
|
2630
2630
|
)));
|
|
2631
|
-
}, [e, j, R, Y, Et]), kt =
|
|
2631
|
+
}, [e, j, R, Y, Et]), kt = U((y) => {
|
|
2632
2632
|
if (!J) return;
|
|
2633
2633
|
const v = `${y.type}-${Date.now()}`, S = y.reactFlowType === "filterNode" || y.reactFlowType === "approvalNode" || y.reactFlowType === "conditionBranchNode", C = y.branchLabels ?? { pass: "Pass", fail: "Fail" }, T = {
|
|
2634
2634
|
id: v,
|
|
@@ -2646,7 +2646,7 @@ const Xt = ({
|
|
|
2646
2646
|
te((_) => {
|
|
2647
2647
|
const I = [..._[b][N]];
|
|
2648
2648
|
if (S) {
|
|
2649
|
-
const Z = I.filter((ye) => ye.kind !== "end"),
|
|
2649
|
+
const Z = I.filter((ye) => ye.kind !== "end"), ke = Z.findIndex((ye) => ye.id === J), Dn = ke === -1 ? Z.length : ke + 1;
|
|
2650
2650
|
return Z.splice(Dn, 0, T), {
|
|
2651
2651
|
..._,
|
|
2652
2652
|
[b]: { ..._[b], [N]: Z },
|
|
@@ -2666,8 +2666,8 @@ const Xt = ({
|
|
|
2666
2666
|
...F,
|
|
2667
2667
|
[v]: Object.fromEntries(
|
|
2668
2668
|
B.map((D, Z) => {
|
|
2669
|
-
const
|
|
2670
|
-
return b && Z === 0 && I.length > 0 ? [D, [...I,
|
|
2669
|
+
const ke = { id: `end-${v}-${D}`, kind: "end", reactFlowType: "endNode" };
|
|
2670
|
+
return b && Z === 0 && I.length > 0 ? [D, [...I, ke]] : [D, [ke]];
|
|
2671
2671
|
})
|
|
2672
2672
|
)
|
|
2673
2673
|
}));
|
|
@@ -2676,8 +2676,8 @@ const Xt = ({
|
|
|
2676
2676
|
const N = b.findIndex((_) => _.id === J);
|
|
2677
2677
|
return N === -1 ? b : [...b.slice(0, N + 1), T, ...b.slice(N + 1)];
|
|
2678
2678
|
});
|
|
2679
|
-
|
|
2680
|
-
}, [J, de]), _t =
|
|
2679
|
+
Me(null), ut(null), ft(v), X("nodeConfig");
|
|
2680
|
+
}, [J, de]), _t = U((y, v) => {
|
|
2681
2681
|
const S = (b) => {
|
|
2682
2682
|
const N = b.label || b.key;
|
|
2683
2683
|
switch (b.kind) {
|
|
@@ -2727,7 +2727,7 @@ const Xt = ({
|
|
|
2727
2727
|
}
|
|
2728
2728
|
return _;
|
|
2729
2729
|
});
|
|
2730
|
-
}, [R, Y, ce]), K =
|
|
2730
|
+
}, [R, Y, ce]), K = V(() => ce(We ?? ""), [ce, We]), St = V(() => {
|
|
2731
2731
|
if ((K == null ? void 0 : K.kind) === "triggerFixed") {
|
|
2732
2732
|
const y = (j == null ? void 0 : j.triggerCategory) === "scheduler", v = (j == null ? void 0 : j.triggerConfigTitle) ?? (y ? "Scheduler" : j == null ? void 0 : j.label) ?? "Trigger", S = j == null ? void 0 : j.triggerCustomPanel;
|
|
2733
2733
|
if (S)
|
|
@@ -2759,27 +2759,27 @@ const Xt = ({
|
|
|
2759
2759
|
} : null;
|
|
2760
2760
|
}
|
|
2761
2761
|
return K != null && K.descriptorType ? e.forType(K.descriptorType) ?? null : null;
|
|
2762
|
-
}, [K, e, j]), { nodes: Nt, edges: Fn } =
|
|
2762
|
+
}, [K, e, j]), { nodes: Nt, edges: Fn } = V(
|
|
2763
2763
|
() => us(R, Y, s ? null : vt, pt, l, p, we),
|
|
2764
2764
|
[R, Y, s, vt, pt, l, p, we]
|
|
2765
|
-
), Ct =
|
|
2766
|
-
const y =
|
|
2765
|
+
), Ct = V(() => {
|
|
2766
|
+
const y = x ? new Map(x.steps.map((v) => [v.nodeId, v])) : null;
|
|
2767
2767
|
return Nt.map((v) => {
|
|
2768
2768
|
let S = {};
|
|
2769
2769
|
if (y) {
|
|
2770
2770
|
const C = y.get(v.id);
|
|
2771
2771
|
C && (S = { _executionStatus: C.status, _executionError: C.error });
|
|
2772
2772
|
}
|
|
2773
|
-
return v.type === "subWorkflowNode" &&
|
|
2773
|
+
return v.type === "subWorkflowNode" && k && (S.onPreview = (C) => {
|
|
2774
2774
|
var b;
|
|
2775
2775
|
const T = ce(v.id);
|
|
2776
2776
|
ht({ workflowId: C, workflowLabel: ((b = T == null ? void 0 : T.formData) == null ? void 0 : b.workflowLabel) ?? void 0 });
|
|
2777
2777
|
}), Object.keys(S).length > 0 ? { ...v, data: { ...v.data, ...S } } : v;
|
|
2778
2778
|
});
|
|
2779
|
-
}, [Nt,
|
|
2780
|
-
}, onClickAddTrigger:
|
|
2779
|
+
}, [Nt, x, k, ce]), Rn = V(() => ({ onEditNode: $e, onDeleteNode: mt, onAddStep: () => {
|
|
2780
|
+
}, onClickAddTrigger: Ge, messages: xe, nodeRegistry: e, nodeBody: Ee, activeTemplate: j }), [$e, mt, Ge, xe, e, Ee, j]), An = U(async () => {
|
|
2781
2781
|
i && await i({ slots: R, branches: Y });
|
|
2782
|
-
}, [i, R, Y]), Bn =
|
|
2782
|
+
}, [i, R, Y]), Bn = V(() => Sr({
|
|
2783
2783
|
palette: {
|
|
2784
2784
|
primary: { main: l.primaryColor ?? "#1976d2" },
|
|
2785
2785
|
secondary: { main: l.secondaryColor ?? "#9c27b0" },
|
|
@@ -2822,7 +2822,7 @@ const Xt = ({
|
|
|
2822
2822
|
statusColor: M,
|
|
2823
2823
|
onSave: i ? An : void 0,
|
|
2824
2824
|
onCancel: $,
|
|
2825
|
-
saveLabel:
|
|
2825
|
+
saveLabel: H
|
|
2826
2826
|
}
|
|
2827
2827
|
),
|
|
2828
2828
|
/* @__PURE__ */ w("div", { style: { flex: 1, minHeight: 0, position: "relative" }, children: [
|
|
@@ -2837,16 +2837,16 @@ const Xt = ({
|
|
|
2837
2837
|
fitViewOptions: { padding: A },
|
|
2838
2838
|
nodesDraggable: !1,
|
|
2839
2839
|
nodesConnectable: !1,
|
|
2840
|
-
panOnScroll:
|
|
2841
|
-
zoomOnScroll:
|
|
2842
|
-
minZoom:
|
|
2843
|
-
maxZoom:
|
|
2844
|
-
snapToGrid:
|
|
2845
|
-
snapGrid:
|
|
2840
|
+
panOnScroll: Ie,
|
|
2841
|
+
zoomOnScroll: ee,
|
|
2842
|
+
minZoom: Oe,
|
|
2843
|
+
maxZoom: ge,
|
|
2844
|
+
snapToGrid: De,
|
|
2845
|
+
snapGrid: ct,
|
|
2846
2846
|
proOptions: { hideAttribution: !0 },
|
|
2847
2847
|
onNodeClick: (y, v) => {
|
|
2848
2848
|
const S = ce(v.id);
|
|
2849
|
-
S && (E != null && E(S) || (S.kind === "addTrigger" || S.kind === "triggerFixed" ?
|
|
2849
|
+
S && (E != null && E(S) || (S.kind === "addTrigger" || S.kind === "triggerFixed" ? Ge() : (S.kind === "userTask" || S.kind === "filter" || S.kind === "approval") && $e(v.id)));
|
|
2850
2850
|
},
|
|
2851
2851
|
children: [
|
|
2852
2852
|
l.background !== "none" && /* @__PURE__ */ u(
|
|
@@ -2858,26 +2858,26 @@ const Xt = ({
|
|
|
2858
2858
|
}
|
|
2859
2859
|
),
|
|
2860
2860
|
ie && /* @__PURE__ */ u(Kn, { showInteractive: !1 }),
|
|
2861
|
-
|
|
2861
|
+
he && /* @__PURE__ */ u(Hn, { zoomable: !0, pannable: !0 }),
|
|
2862
2862
|
/* @__PURE__ */ u(es, { onHeightsReady: jn, nodeCount: Ct.length })
|
|
2863
2863
|
]
|
|
2864
2864
|
}
|
|
2865
2865
|
),
|
|
2866
|
-
c ? pe === "triggerSelect" && c(t.list(), wt, () => X(null)) : /* @__PURE__ */ u(rs, { open: pe === "triggerSelect", templates: t.list(), messages:
|
|
2866
|
+
c ? pe === "triggerSelect" && c(t.list(), wt, () => X(null)) : /* @__PURE__ */ u(rs, { open: pe === "triggerSelect", templates: t.list(), messages: xe, onSelect: wt, onClose: () => X(null), loadTriggerSources: f }),
|
|
2867
2867
|
h ? pe === "nodePicker" && h(xt(), kt, () => {
|
|
2868
|
-
X(null),
|
|
2869
|
-
}) : /* @__PURE__ */ u(os, { open: pe === "nodePicker", availableDescriptors: xt(), messages:
|
|
2870
|
-
X(null),
|
|
2868
|
+
X(null), Me(null);
|
|
2869
|
+
}) : /* @__PURE__ */ u(os, { open: pe === "nodePicker", availableDescriptors: xt(), messages: xe, onSelect: kt, onClose: () => {
|
|
2870
|
+
X(null), Me(null);
|
|
2871
2871
|
} }),
|
|
2872
|
-
g ? pe === "nodeConfig" && g(St ?? void 0, K, _t, () => X(null)) : /* @__PURE__ */ u(is, { open: pe === "nodeConfig", nodeId:
|
|
2873
|
-
|
|
2872
|
+
g ? pe === "nodeConfig" && g(St ?? void 0, K, _t, () => X(null)) : /* @__PURE__ */ u(is, { open: pe === "nodeConfig", nodeId: We, descriptor: St, initialValues: K == null ? void 0 : K.formData, messages: xe, onSave: _t, onClose: () => X(null) }),
|
|
2873
|
+
k && je && /* @__PURE__ */ u(
|
|
2874
2874
|
ss,
|
|
2875
2875
|
{
|
|
2876
|
-
isOpen: !!
|
|
2876
|
+
isOpen: !!je,
|
|
2877
2877
|
onClose: () => ht(null),
|
|
2878
|
-
workflowId:
|
|
2879
|
-
workflowLabel:
|
|
2880
|
-
onFetchWorkflow:
|
|
2878
|
+
workflowId: je.workflowId,
|
|
2879
|
+
workflowLabel: je.workflowLabel,
|
|
2880
|
+
onFetchWorkflow: k
|
|
2881
2881
|
}
|
|
2882
2882
|
)
|
|
2883
2883
|
] })
|
|
@@ -2888,7 +2888,7 @@ const Xt = ({
|
|
|
2888
2888
|
__proto__: null,
|
|
2889
2889
|
WorkflowCanvas: Xt,
|
|
2890
2890
|
default: Xt
|
|
2891
|
-
}, Symbol.toStringTag, { value: "Module" })),
|
|
2891
|
+
}, Symbol.toStringTag, { value: "Module" })), Qe = "All";
|
|
2892
2892
|
function gs({ template: e, onSelect: t }) {
|
|
2893
2893
|
var o, i;
|
|
2894
2894
|
const n = e.triggerCategory ? Cr[e.triggerCategory] : null, r = ((o = e.skeletonState) == null ? void 0 : o.slots.filter((s) => s.kind === "userTask").length) ?? 0;
|
|
@@ -2949,14 +2949,14 @@ const js = ({
|
|
|
2949
2949
|
onSelectTemplate: t,
|
|
2950
2950
|
onStartFromScratch: n
|
|
2951
2951
|
}) => {
|
|
2952
|
-
const [r, o] = L(""), [i, s] = L(
|
|
2952
|
+
const [r, o] = L(""), [i, s] = L(Qe), l = V(() => {
|
|
2953
2953
|
const a = /* @__PURE__ */ new Set();
|
|
2954
2954
|
return e.forEach((c) => {
|
|
2955
2955
|
c.category && a.add(c.category);
|
|
2956
|
-
}), [
|
|
2957
|
-
}, [e]), d =
|
|
2956
|
+
}), [Qe, ...Array.from(a)];
|
|
2957
|
+
}, [e]), d = V(() => {
|
|
2958
2958
|
let a = e;
|
|
2959
|
-
if (i !==
|
|
2959
|
+
if (i !== Qe && (a = a.filter((c) => c.category === i)), r.trim()) {
|
|
2960
2960
|
const c = r.toLowerCase();
|
|
2961
2961
|
a = a.filter(
|
|
2962
2962
|
(f) => {
|
|
@@ -3023,7 +3023,7 @@ const js = ({
|
|
|
3023
3023
|
/* @__PURE__ */ u("p", { style: { margin: 0, fontSize: 14 }, children: "No templates found" })
|
|
3024
3024
|
] }) : /* @__PURE__ */ u("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 }, children: d.map((a) => /* @__PURE__ */ u(gs, { template: a, onSelect: () => t(a) }, a.triggerKey)) }) })
|
|
3025
3025
|
] });
|
|
3026
|
-
},
|
|
3026
|
+
}, ze = {
|
|
3027
3027
|
running: { label: "Running", color: re.running, icon: G.createElement(nn, { size: 14 }) },
|
|
3028
3028
|
success: { label: "Success", color: re.success, icon: G.createElement(tn, { size: 14 }) },
|
|
3029
3029
|
failed: { label: "Failed", color: re.failed, icon: G.createElement(en, { size: 14 }) },
|
|
@@ -3035,7 +3035,7 @@ const js = ({
|
|
|
3035
3035
|
failed: { color: re.failed, icon: G.createElement(en, { size: 14 }) },
|
|
3036
3036
|
skipped: { color: re.skipped, icon: G.createElement(Qt, { size: 14 }) }
|
|
3037
3037
|
};
|
|
3038
|
-
function
|
|
3038
|
+
function ot(e) {
|
|
3039
3039
|
try {
|
|
3040
3040
|
return new Date(e).toLocaleString();
|
|
3041
3041
|
} catch {
|
|
@@ -3088,7 +3088,7 @@ function ys({ step: e }) {
|
|
|
3088
3088
|
] });
|
|
3089
3089
|
}
|
|
3090
3090
|
function bs({ record: e, selected: t, onSelect: n }) {
|
|
3091
|
-
const r =
|
|
3091
|
+
const r = ze[e.status];
|
|
3092
3092
|
return /* @__PURE__ */ w(
|
|
3093
3093
|
"div",
|
|
3094
3094
|
{
|
|
@@ -3111,7 +3111,7 @@ function bs({ record: e, selected: t, onSelect: n }) {
|
|
|
3111
3111
|
children: [
|
|
3112
3112
|
/* @__PURE__ */ u("span", { style: { color: r.color, flexShrink: 0 }, children: G.cloneElement(r.icon, { color: r.color, size: 16 }) }),
|
|
3113
3113
|
/* @__PURE__ */ w("div", { style: { flex: 1, minWidth: 0 }, children: [
|
|
3114
|
-
/* @__PURE__ */ u("div", { style: { fontSize: 12, color: "#212121", fontWeight: t ? 600 : 400, whiteSpace: "nowrap", overflow: "hidden", textOverflow: "ellipsis" }, children:
|
|
3114
|
+
/* @__PURE__ */ u("div", { style: { fontSize: 12, color: "#212121", fontWeight: t ? 600 : 400, whiteSpace: "nowrap", overflow: "hidden", textOverflow: "ellipsis" }, children: ot(e.triggeredAt) }),
|
|
3115
3115
|
/* @__PURE__ */ w("div", { style: { fontSize: 11, color: "#9e9e9e" }, children: [
|
|
3116
3116
|
e.triggeredBy ? `by ${e.triggeredBy}` : "System",
|
|
3117
3117
|
" · ",
|
|
@@ -3146,15 +3146,15 @@ const zs = ({ records: e, onViewOnCanvas: t }) => {
|
|
|
3146
3146
|
/* @__PURE__ */ w("div", { style: { padding: "16px 20px", borderBottom: "1px solid #f0f0f0", display: "flex", alignItems: "flex-start", justifyContent: "space-between", gap: 12 }, children: [
|
|
3147
3147
|
/* @__PURE__ */ w("div", { children: [
|
|
3148
3148
|
/* @__PURE__ */ w("div", { style: { display: "flex", alignItems: "center", gap: 8, marginBottom: 4 }, children: [
|
|
3149
|
-
G.cloneElement(
|
|
3150
|
-
/* @__PURE__ */ u("span", { style: { fontWeight: 700, fontSize: 15, color: "#212121" }, children:
|
|
3149
|
+
G.cloneElement(ze[o.status].icon, { color: ze[o.status].color, size: 18 }),
|
|
3150
|
+
/* @__PURE__ */ u("span", { style: { fontWeight: 700, fontSize: 15, color: "#212121" }, children: ze[o.status].label })
|
|
3151
3151
|
] }),
|
|
3152
3152
|
/* @__PURE__ */ w("div", { style: { fontSize: 12, color: "#757575", display: "flex", flexDirection: "column", gap: 2 }, children: [
|
|
3153
3153
|
/* @__PURE__ */ w("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
|
|
3154
3154
|
/* @__PURE__ */ u(Ot, { size: 13 }),
|
|
3155
3155
|
" ",
|
|
3156
|
-
|
|
3157
|
-
o.completedAt && ` → ${
|
|
3156
|
+
ot(o.triggeredAt),
|
|
3157
|
+
o.completedAt && ` → ${ot(o.completedAt)} (${On(o.triggeredAt, o.completedAt)})`
|
|
3158
3158
|
] }),
|
|
3159
3159
|
o.triggeredBy && /* @__PURE__ */ w("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
|
|
3160
3160
|
/* @__PURE__ */ u(pr, { size: 13 }),
|
|
@@ -3195,4 +3195,4 @@ export {
|
|
|
3195
3195
|
ns as a,
|
|
3196
3196
|
js as b
|
|
3197
3197
|
};
|
|
3198
|
-
//# sourceMappingURL=WorkflowExecutionHistory-
|
|
3198
|
+
//# sourceMappingURL=WorkflowExecutionHistory-CxKMGSch.js.map
|