@notmrabhi/flowforge 0.1.15 → 0.1.16

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.
@@ -1,2925 +0,0 @@
1
- import { jsxs as y, jsx as f, Fragment as be } from "react/jsx-runtime";
2
- import G, { useRef as mt, useEffect as re, useState as M, useCallback as U, useMemo as $ } from "react";
3
- import Nr, { useStore as Cr, useReactFlow as Sr, Background as Ir, Controls as Or, MiniMap as Mr } from "reactflow";
4
- import "reactflow/dist/style.css";
5
- import { e as jr, G as zr, E as Fr, P as Dr, L as Lr, d as Rr, f as Ar } from "./GatewayBranchEdge-DH-aHDPm.js";
6
- import { Dialog as Pr, Box as J, Drawer as Br, IconButton as wt, Button as _e, CircularProgress as Wr } from "@mui/material";
7
- import Gr from "react-select";
8
- import { MdClose as $r, MdCalendarToday as Yr, MdBolt as Kr, MdArrowBack as Pt, MdChevronRight as Bt, MdAddCircleOutline as Ur, MdApps as Vr, MdErrorOutline as Hr, MdAccountTree as qr, MdAdd as Xr, MdSearch as Jr, MdCategory as Zr, MdCancel as Wt, MdError as Gt, MdCheckCircle as $t, MdPlayArrow as Yt, MdHourglassEmpty as Qr, MdSchedule as vt, MdPerson as en, MdExpandLess as tn, MdExpandMore as rn } from "react-icons/md";
9
- import { GrTrigger as nn } from "react-icons/gr";
10
- import { BiCollapse as on, BiExpand as sn } from "react-icons/bi";
11
- import { j as ln, b as an } from "./index-CxVqPygT.js";
12
- import { m as dn } from "./messages-CO299wPN.js";
13
- import { T as cn, E as Z } from "./canvasTokens-CAD6G24b.js";
14
- var Kt = Object.defineProperty, un = (e, t, r) => t in e ? Kt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r, fn = (e, t) => {
15
- for (var r in t) Kt(e, r, { get: t[r], enumerable: !0 });
16
- }, hn = (e, t, r) => un(e, t + "", r), Ut = {};
17
- fn(Ut, { Graph: () => Y, alg: () => Xe, json: () => Ht, version: () => bn });
18
- var gn = Object.defineProperty, Vt = (e, t) => {
19
- for (var r in t) gn(e, r, { get: t[r], enumerable: !0 });
20
- }, Y = class {
21
- constructor(e) {
22
- this._isDirected = !0, this._isMultigraph = !1, this._isCompound = !1, this._nodes = {}, this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {}, this._nodeCount = 0, this._edgeCount = 0, this._defaultNodeLabelFn = () => {
23
- }, this._defaultEdgeLabelFn = () => {
24
- }, e && (this._isDirected = "directed" in e ? e.directed : !0, this._isMultigraph = "multigraph" in e ? e.multigraph : !1, this._isCompound = "compound" in e ? e.compound : !1), this._isCompound && (this._parent = {}, this._children = {}, this._children["\0"] = {});
25
- }
26
- isDirected() {
27
- return this._isDirected;
28
- }
29
- isMultigraph() {
30
- return this._isMultigraph;
31
- }
32
- isCompound() {
33
- return this._isCompound;
34
- }
35
- setGraph(e) {
36
- return this._label = e, this;
37
- }
38
- graph() {
39
- return this._label;
40
- }
41
- setDefaultNodeLabel(e) {
42
- return typeof e != "function" ? this._defaultNodeLabelFn = () => e : this._defaultNodeLabelFn = e, this;
43
- }
44
- nodeCount() {
45
- return this._nodeCount;
46
- }
47
- nodes() {
48
- return Object.keys(this._nodes);
49
- }
50
- sources() {
51
- return this.nodes().filter((e) => Object.keys(this._in[e]).length === 0);
52
- }
53
- sinks() {
54
- return this.nodes().filter((e) => Object.keys(this._out[e]).length === 0);
55
- }
56
- setNodes(e, t) {
57
- return e.forEach((r) => {
58
- t !== void 0 ? this.setNode(r, t) : this.setNode(r);
59
- }), this;
60
- }
61
- setNode(e, t) {
62
- return e in this._nodes ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = "\0", this._children[e] = {}, this._children["\0"][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
63
- }
64
- node(e) {
65
- return this._nodes[e];
66
- }
67
- hasNode(e) {
68
- return e in this._nodes;
69
- }
70
- removeNode(e) {
71
- if (e in this._nodes) {
72
- let t = (r) => this.removeEdge(this._edgeObjs[r]);
73
- delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], this.children(e).forEach((r) => {
74
- this.setParent(r);
75
- }), delete this._children[e]), Object.keys(this._in[e]).forEach(t), delete this._in[e], delete this._preds[e], Object.keys(this._out[e]).forEach(t), delete this._out[e], delete this._sucs[e], --this._nodeCount;
76
- }
77
- return this;
78
- }
79
- setParent(e, t) {
80
- if (!this._isCompound) throw new Error("Cannot set parent in a non-compound graph");
81
- if (t === void 0) t = "\0";
82
- else {
83
- t += "";
84
- for (let r = t; r !== void 0; r = this.parent(r)) if (r === e) throw new Error("Setting " + t + " as parent of " + e + " would create a cycle");
85
- this.setNode(t);
86
- }
87
- return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
88
- }
89
- parent(e) {
90
- if (this._isCompound) {
91
- let t = this._parent[e];
92
- if (t !== "\0") return t;
93
- }
94
- }
95
- children(e = "\0") {
96
- if (this._isCompound) {
97
- let t = this._children[e];
98
- if (t) return Object.keys(t);
99
- } else {
100
- if (e === "\0") return this.nodes();
101
- if (this.hasNode(e)) return [];
102
- }
103
- return [];
104
- }
105
- predecessors(e) {
106
- let t = this._preds[e];
107
- if (t) return Object.keys(t);
108
- }
109
- successors(e) {
110
- let t = this._sucs[e];
111
- if (t) return Object.keys(t);
112
- }
113
- neighbors(e) {
114
- let t = this.predecessors(e);
115
- if (t) {
116
- let r = new Set(t);
117
- for (let n of this.successors(e)) r.add(n);
118
- return Array.from(r.values());
119
- }
120
- }
121
- isLeaf(e) {
122
- let t;
123
- return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), t.length === 0;
124
- }
125
- filterNodes(e) {
126
- let t = new this.constructor({ directed: this._isDirected, multigraph: this._isMultigraph, compound: this._isCompound });
127
- t.setGraph(this.graph()), Object.entries(this._nodes).forEach(([o, i]) => {
128
- e(o) && t.setNode(o, i);
129
- }), Object.values(this._edgeObjs).forEach((o) => {
130
- t.hasNode(o.v) && t.hasNode(o.w) && t.setEdge(o, this.edge(o));
131
- });
132
- let r = {}, n = (o) => {
133
- let i = this.parent(o);
134
- return !i || t.hasNode(i) ? (r[o] = i ?? void 0, i ?? void 0) : i in r ? r[i] : n(i);
135
- };
136
- return this._isCompound && t.nodes().forEach((o) => t.setParent(o, n(o))), t;
137
- }
138
- setDefaultEdgeLabel(e) {
139
- return typeof e != "function" ? this._defaultEdgeLabelFn = () => e : this._defaultEdgeLabelFn = e, this;
140
- }
141
- edgeCount() {
142
- return this._edgeCount;
143
- }
144
- edges() {
145
- return Object.values(this._edgeObjs);
146
- }
147
- setPath(e, t) {
148
- return e.reduce((r, n) => (t !== void 0 ? this.setEdge(r, n, t) : this.setEdge(r, n), n)), this;
149
- }
150
- setEdge(e, t, r, n) {
151
- let o, i, s, l, d = !1;
152
- typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, s = e.name, arguments.length === 2 && (l = t, d = !0)) : (o = e, i = t, s = n, arguments.length > 2 && (l = r, d = !0)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s);
153
- let a = pe(this._isDirected, o, i, s);
154
- if (a in this._edgeLabels) return d && (this._edgeLabels[a] = l), this;
155
- if (s !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false");
156
- this.setNode(o), this.setNode(i), this._edgeLabels[a] = d ? l : this._defaultEdgeLabelFn(o, i, s);
157
- let c = pn(this._isDirected, o, i, s);
158
- return o = c.v, i = c.w, Object.freeze(c), this._edgeObjs[a] = c, Et(this._preds[i], o), Et(this._sucs[o], i), this._in[i][a] = c, this._out[o][a] = c, this._edgeCount++, this;
159
- }
160
- edge(e, t, r) {
161
- let n = arguments.length === 1 ? Le(this._isDirected, e) : pe(this._isDirected, e, t, r);
162
- return this._edgeLabels[n];
163
- }
164
- edgeAsObj(e, t, r) {
165
- let n = arguments.length === 1 ? this.edge(e) : this.edge(e, t, r);
166
- return typeof n != "object" ? { label: n } : n;
167
- }
168
- hasEdge(e, t, r) {
169
- return (arguments.length === 1 ? Le(this._isDirected, e) : pe(this._isDirected, e, t, r)) in this._edgeLabels;
170
- }
171
- removeEdge(e, t, r) {
172
- let n = arguments.length === 1 ? Le(this._isDirected, e) : pe(this._isDirected, e, t, r), o = this._edgeObjs[n];
173
- if (o) {
174
- let i = o.v, s = o.w;
175
- delete this._edgeLabels[n], delete this._edgeObjs[n], kt(this._preds[s], i), kt(this._sucs[i], s), delete this._in[s][n], delete this._out[i][n], this._edgeCount--;
176
- }
177
- return this;
178
- }
179
- inEdges(e, t) {
180
- return this.isDirected() ? this.filterEdges(this._in[e], e, t) : this.nodeEdges(e, t);
181
- }
182
- outEdges(e, t) {
183
- return this.isDirected() ? this.filterEdges(this._out[e], e, t) : this.nodeEdges(e, t);
184
- }
185
- nodeEdges(e, t) {
186
- if (e in this._nodes) return this.filterEdges({ ...this._in[e], ...this._out[e] }, e, t);
187
- }
188
- _removeFromParentsChildList(e) {
189
- delete this._children[this._parent[e]][e];
190
- }
191
- filterEdges(e, t, r) {
192
- if (!e) return;
193
- let n = Object.values(e);
194
- return r ? n.filter((o) => o.v === t && o.w === r || o.v === r && o.w === t) : n;
195
- }
196
- };
197
- function Et(e, t) {
198
- e[t] ? e[t]++ : e[t] = 1;
199
- }
200
- function kt(e, t) {
201
- e[t] !== void 0 && !--e[t] && delete e[t];
202
- }
203
- function pe(e, t, r, n) {
204
- let o = "" + t, i = "" + r;
205
- if (!e && o > i) {
206
- let s = o;
207
- o = i, i = s;
208
- }
209
- return o + "" + i + "" + (n === void 0 ? "\0" : n);
210
- }
211
- function pn(e, t, r, n) {
212
- let o = "" + t, i = "" + r;
213
- if (!e && o > i) {
214
- let l = o;
215
- o = i, i = l;
216
- }
217
- let s = { v: o, w: i };
218
- return n && (s.name = n), s;
219
- }
220
- function Le(e, t) {
221
- return pe(e, t.v, t.w, t.name);
222
- }
223
- var bn = "4.0.1", Ht = {};
224
- Vt(Ht, { read: () => vn, write: () => yn });
225
- function yn(e) {
226
- let t = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: mn(e), edges: wn(e) }, r = e.graph();
227
- return r !== void 0 && (t.value = structuredClone(r)), t;
228
- }
229
- function mn(e) {
230
- return e.nodes().map((t) => {
231
- let r = e.node(t), n = e.parent(t), o = { v: t };
232
- return r !== void 0 && (o.value = r), n !== void 0 && (o.parent = n), o;
233
- });
234
- }
235
- function wn(e) {
236
- return e.edges().map((t) => {
237
- let r = e.edge(t), n = { v: t.v, w: t.w };
238
- return t.name !== void 0 && (n.name = t.name), r !== void 0 && (n.value = r), n;
239
- });
240
- }
241
- function vn(e) {
242
- let t = new Y(e.options);
243
- return e.value !== void 0 && t.setGraph(e.value), e.nodes.forEach((r) => {
244
- t.setNode(r.v, r.value), r.parent && t.setParent(r.v, r.parent);
245
- }), e.edges.forEach((r) => {
246
- t.setEdge({ v: r.v, w: r.w, name: r.name }, r.value);
247
- }), t;
248
- }
249
- var Xe = {};
250
- Vt(Xe, { CycleException: () => Ce, bellmanFord: () => qt, components: () => xn, dijkstra: () => Ne, dijkstraAll: () => Nn, findCycles: () => Cn, floydWarshall: () => In, isAcyclic: () => Mn, postorder: () => zn, preorder: () => Fn, prim: () => Dn, shortestPaths: () => Ln, tarjan: () => Jt, topsort: () => Zt });
251
- var En = () => 1;
252
- function qt(e, t, r, n) {
253
- return kn(e, String(t), r || En, n || function(o) {
254
- return e.outEdges(o);
255
- });
256
- }
257
- function kn(e, t, r, n) {
258
- let o = {}, i, s = 0, l = e.nodes(), d = function(u) {
259
- let h = r(u);
260
- o[u.v].distance + h < o[u.w].distance && (o[u.w] = { distance: o[u.v].distance + h, predecessor: u.v }, i = !0);
261
- }, a = function() {
262
- l.forEach(function(u) {
263
- n(u).forEach(function(h) {
264
- let g = h.v === u ? h.v : h.w, p = g === h.v ? h.w : h.v;
265
- d({ v: g, w: p });
266
- });
267
- });
268
- };
269
- l.forEach(function(u) {
270
- let h = u === t ? 0 : Number.POSITIVE_INFINITY;
271
- o[u] = { distance: h, predecessor: "" };
272
- });
273
- let c = l.length;
274
- for (let u = 1; u < c && (i = !1, s++, a(), !!i); u++) ;
275
- if (s === c - 1 && (i = !1, a(), i)) throw new Error("The graph contains a negative weight cycle");
276
- return o;
277
- }
278
- function xn(e) {
279
- let t = {}, r = [], n;
280
- function o(i) {
281
- i in t || (t[i] = !0, n.push(i), e.successors(i).forEach(o), e.predecessors(i).forEach(o));
282
- }
283
- return e.nodes().forEach(function(i) {
284
- n = [], o(i), n.length && r.push(n);
285
- }), r;
286
- }
287
- var Xt = class {
288
- constructor() {
289
- this._arr = [], this._keyIndices = {};
290
- }
291
- size() {
292
- return this._arr.length;
293
- }
294
- keys() {
295
- return this._arr.map((e) => e.key);
296
- }
297
- has(e) {
298
- return e in this._keyIndices;
299
- }
300
- priority(e) {
301
- let t = this._keyIndices[e];
302
- if (t !== void 0) return this._arr[t].priority;
303
- }
304
- min() {
305
- if (this.size() === 0) throw new Error("Queue underflow");
306
- return this._arr[0].key;
307
- }
308
- add(e, t) {
309
- let r = this._keyIndices, n = String(e);
310
- if (!(n in r)) {
311
- let o = this._arr, i = o.length;
312
- return r[n] = i, o.push({ key: n, priority: t }), this._decrease(i), !0;
313
- }
314
- return !1;
315
- }
316
- removeMin() {
317
- this._swap(0, this._arr.length - 1);
318
- let e = this._arr.pop();
319
- return delete this._keyIndices[e.key], this._heapify(0), e.key;
320
- }
321
- decrease(e, t) {
322
- let r = this._keyIndices[e];
323
- if (r === void 0) throw new Error(`Key not found: ${e}`);
324
- let n = this._arr[r].priority;
325
- if (t > n) throw new Error(`New priority is greater than current priority. Key: ${e} Old: ${n} New: ${t}`);
326
- this._arr[r].priority = t, this._decrease(r);
327
- }
328
- _heapify(e) {
329
- let t = this._arr, r = 2 * e, n = r + 1, o = e;
330
- r < t.length && (o = t[r].priority < t[o].priority ? r : o, n < t.length && (o = t[n].priority < t[o].priority ? n : o), o !== e && (this._swap(e, o), this._heapify(o)));
331
- }
332
- _decrease(e) {
333
- let t = this._arr, r = t[e].priority, n;
334
- for (; e !== 0 && (n = e >> 1, !(t[n].priority < r)); ) this._swap(e, n), e = n;
335
- }
336
- _swap(e, t) {
337
- let r = this._arr, n = this._keyIndices, o = r[e], i = r[t];
338
- r[e] = i, r[t] = o, n[i.key] = e, n[o.key] = t;
339
- }
340
- }, Tn = () => 1;
341
- function Ne(e, t, r, n) {
342
- let o = function(i) {
343
- return e.outEdges(i);
344
- };
345
- return _n(e, String(t), r || Tn, n || o);
346
- }
347
- function _n(e, t, r, n) {
348
- let o = {}, i = new Xt(), s, l, d = function(a) {
349
- let c = a.v !== s ? a.v : a.w, u = o[c], h = r(a), g = l.distance + h;
350
- if (h < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + a + " Weight: " + h);
351
- g < u.distance && (u.distance = g, u.predecessor = s, i.decrease(c, g));
352
- };
353
- for (e.nodes().forEach(function(a) {
354
- let c = a === t ? 0 : Number.POSITIVE_INFINITY;
355
- o[a] = { distance: c, predecessor: "" }, i.add(a, c);
356
- }); i.size() > 0 && (s = i.removeMin(), l = o[s], l.distance !== Number.POSITIVE_INFINITY); ) n(s).forEach(d);
357
- return o;
358
- }
359
- function Nn(e, t, r) {
360
- return e.nodes().reduce(function(n, o) {
361
- return n[o] = Ne(e, o, t, r), n;
362
- }, {});
363
- }
364
- function Jt(e) {
365
- let t = 0, r = [], n = {}, o = [];
366
- function i(s) {
367
- let l = n[s] = { onStack: !0, lowlink: t, index: t++ };
368
- if (r.push(s), e.successors(s).forEach(function(d) {
369
- d in n ? n[d].onStack && (l.lowlink = Math.min(l.lowlink, n[d].index)) : (i(d), l.lowlink = Math.min(l.lowlink, n[d].lowlink));
370
- }), l.lowlink === l.index) {
371
- let d = [], a;
372
- do
373
- a = r.pop(), n[a].onStack = !1, d.push(a);
374
- while (s !== a);
375
- o.push(d);
376
- }
377
- }
378
- return e.nodes().forEach(function(s) {
379
- s in n || i(s);
380
- }), o;
381
- }
382
- function Cn(e) {
383
- return Jt(e).filter(function(t) {
384
- return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
385
- });
386
- }
387
- var Sn = () => 1;
388
- function In(e, t, r) {
389
- return On(e, t || Sn, r || function(n) {
390
- return e.outEdges(n);
391
- });
392
- }
393
- function On(e, t, r) {
394
- let n = {}, o = e.nodes();
395
- return o.forEach(function(i) {
396
- n[i] = {}, n[i][i] = { distance: 0, predecessor: "" }, o.forEach(function(s) {
397
- i !== s && (n[i][s] = { distance: Number.POSITIVE_INFINITY, predecessor: "" });
398
- }), r(i).forEach(function(s) {
399
- let l = s.v === i ? s.w : s.v, d = t(s);
400
- n[i][l] = { distance: d, predecessor: i };
401
- });
402
- }), o.forEach(function(i) {
403
- let s = n[i];
404
- o.forEach(function(l) {
405
- let d = n[l];
406
- o.forEach(function(a) {
407
- let c = d[i], u = s[a], h = d[a], g = c.distance + u.distance;
408
- g < h.distance && (h.distance = g, h.predecessor = u.predecessor);
409
- });
410
- });
411
- }), n;
412
- }
413
- var Ce = class extends Error {
414
- constructor(...e) {
415
- super(...e);
416
- }
417
- };
418
- function Zt(e) {
419
- let t = {}, r = {}, n = [];
420
- function o(i) {
421
- if (i in r) throw new Ce();
422
- i in t || (r[i] = !0, t[i] = !0, e.predecessors(i).forEach(o), delete r[i], n.push(i));
423
- }
424
- if (e.sinks().forEach(o), Object.keys(t).length !== e.nodeCount()) throw new Ce();
425
- return n;
426
- }
427
- function Mn(e) {
428
- try {
429
- Zt(e);
430
- } catch (t) {
431
- if (t instanceof Ce) return !1;
432
- throw t;
433
- }
434
- return !0;
435
- }
436
- function jn(e, t, r, n, o) {
437
- Array.isArray(t) || (t = [t]);
438
- let i = (l) => {
439
- var d;
440
- return (d = e.isDirected() ? e.successors(l) : e.neighbors(l)) != null ? d : [];
441
- }, s = {};
442
- return t.forEach(function(l) {
443
- if (!e.hasNode(l)) throw new Error("Graph does not have node: " + l);
444
- o = Qt(e, l, r === "post", s, i, n, o);
445
- }), o;
446
- }
447
- function Qt(e, t, r, n, o, i, s) {
448
- return t in n || (n[t] = !0, r || (s = i(s, t)), o(t).forEach(function(l) {
449
- s = Qt(e, l, r, n, o, i, s);
450
- }), r && (s = i(s, t))), s;
451
- }
452
- function er(e, t, r) {
453
- return jn(e, t, r, function(n, o) {
454
- return n.push(o), n;
455
- }, []);
456
- }
457
- function zn(e, t) {
458
- return er(e, t, "post");
459
- }
460
- function Fn(e, t) {
461
- return er(e, t, "pre");
462
- }
463
- function Dn(e, t) {
464
- let r = new Y(), n = {}, o = new Xt(), i;
465
- function s(d) {
466
- let a = d.v === i ? d.w : d.v, c = o.priority(a);
467
- if (c !== void 0) {
468
- let u = t(d);
469
- u < c && (n[a] = i, o.decrease(a, u));
470
- }
471
- }
472
- if (e.nodeCount() === 0) return r;
473
- e.nodes().forEach(function(d) {
474
- o.add(d, Number.POSITIVE_INFINITY), r.setNode(d);
475
- }), o.decrease(e.nodes()[0], 0);
476
- let l = !1;
477
- for (; o.size() > 0; ) {
478
- if (i = o.removeMin(), i in n) r.setEdge(i, n[i]);
479
- else {
480
- if (l) throw new Error("Input graph is not connected: " + e);
481
- l = !0;
482
- }
483
- e.nodeEdges(i).forEach(s);
484
- }
485
- return r;
486
- }
487
- function Ln(e, t, r, n) {
488
- return Rn(e, t, r, n ?? ((o) => {
489
- let i = e.outEdges(o);
490
- return i ?? [];
491
- }));
492
- }
493
- function Rn(e, t, r, n) {
494
- if (r === void 0) return Ne(e, t, r, n);
495
- let o = !1, i = e.nodes();
496
- for (let s = 0; s < i.length; s++) {
497
- let l = n(i[s]);
498
- for (let d = 0; d < l.length; d++) {
499
- let a = l[d], c = a.v === i[s] ? a.v : a.w, u = c === a.v ? a.w : a.v;
500
- r({ v: c, w: u }) < 0 && (o = !0);
501
- }
502
- if (o) return qt(e, t, r, n);
503
- }
504
- return Ne(e, t, r, n);
505
- }
506
- function he(e, t, r, n) {
507
- let o = n;
508
- for (; e.hasNode(o); ) o = Je(n);
509
- return r.dummy = t, e.setNode(o, r), o;
510
- }
511
- function An(e) {
512
- let t = new Y().setGraph(e.graph());
513
- return e.nodes().forEach((r) => t.setNode(r, e.node(r))), e.edges().forEach((r) => {
514
- let n = t.edge(r.v, r.w) || { weight: 0, minlen: 1 }, o = e.edge(r);
515
- t.setEdge(r.v, r.w, { weight: n.weight + o.weight, minlen: Math.max(n.minlen, o.minlen) });
516
- }), t;
517
- }
518
- function tr(e) {
519
- let t = new Y({ multigraph: e.isMultigraph() }).setGraph(e.graph());
520
- return e.nodes().forEach((r) => {
521
- e.children(r).length || t.setNode(r, e.node(r));
522
- }), e.edges().forEach((r) => {
523
- t.setEdge(r, e.edge(r));
524
- }), t;
525
- }
526
- function xt(e, t) {
527
- let r = e.x, n = e.y, o = t.x - r, i = t.y - n, s = e.width / 2, l = e.height / 2;
528
- if (!o && !i) throw new Error("Not possible to find intersection inside of the rectangle");
529
- let d, a;
530
- return Math.abs(i) * s > Math.abs(o) * l ? (i < 0 && (l = -l), d = l * o / i, a = l) : (o < 0 && (s = -s), d = s, a = s * i / o), { x: r + d, y: n + a };
531
- }
532
- function we(e) {
533
- let t = ye(nr(e) + 1).map(() => []);
534
- return e.nodes().forEach((r) => {
535
- let n = e.node(r), o = n.rank;
536
- o !== void 0 && (t[o] || (t[o] = []), t[o][n.order] = r);
537
- }), t;
538
- }
539
- function Pn(e) {
540
- let t = e.nodes().map((n) => {
541
- let o = e.node(n).rank;
542
- return o === void 0 ? Number.MAX_VALUE : o;
543
- }), r = V(Math.min, t);
544
- e.nodes().forEach((n) => {
545
- let o = e.node(n);
546
- Object.hasOwn(o, "rank") && (o.rank -= r);
547
- });
548
- }
549
- function Bn(e) {
550
- let t = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), r = V(Math.min, t), n = [];
551
- e.nodes().forEach((s) => {
552
- let l = e.node(s).rank - r;
553
- n[l] || (n[l] = []), n[l].push(s);
554
- });
555
- let o = 0, i = e.graph().nodeRankFactor;
556
- Array.from(n).forEach((s, l) => {
557
- s === void 0 && l % i !== 0 ? --o : s !== void 0 && o && s.forEach((d) => e.node(d).rank += o);
558
- });
559
- }
560
- function Tt(e, t, r, n) {
561
- let o = { width: 0, height: 0 };
562
- return arguments.length >= 4 && (o.rank = r, o.order = n), he(e, "border", o, t);
563
- }
564
- function Wn(e, t = rr) {
565
- let r = [];
566
- for (let n = 0; n < e.length; n += t) {
567
- let o = e.slice(n, n + t);
568
- r.push(o);
569
- }
570
- return r;
571
- }
572
- var rr = 65535;
573
- function V(e, t) {
574
- if (t.length > rr) {
575
- let r = Wn(t);
576
- return e(...r.map((n) => e(...n)));
577
- } else return e(...t);
578
- }
579
- function nr(e) {
580
- let t = e.nodes().map((r) => {
581
- let n = e.node(r).rank;
582
- return n === void 0 ? Number.MIN_VALUE : n;
583
- });
584
- return V(Math.max, t);
585
- }
586
- function Gn(e, t) {
587
- let r = { lhs: [], rhs: [] };
588
- return e.forEach((n) => {
589
- t(n) ? r.lhs.push(n) : r.rhs.push(n);
590
- }), r;
591
- }
592
- function or(e, t) {
593
- let r = Date.now();
594
- try {
595
- return t();
596
- } finally {
597
- console.log(e + " time: " + (Date.now() - r) + "ms");
598
- }
599
- }
600
- function ir(e, t) {
601
- return t();
602
- }
603
- var $n = 0;
604
- function Je(e) {
605
- let t = ++$n;
606
- return e + ("" + t);
607
- }
608
- function ye(e, t, r = 1) {
609
- t == null && (t = e, e = 0);
610
- let n = (i) => i < t;
611
- r < 0 && (n = (i) => t < i);
612
- let o = [];
613
- for (let i = e; n(i); i += r) o.push(i);
614
- return o;
615
- }
616
- function Se(e, t) {
617
- let r = {};
618
- for (let n of t) e[n] !== void 0 && (r[n] = e[n]);
619
- return r;
620
- }
621
- function Ie(e, t) {
622
- let r;
623
- return typeof t == "string" ? r = (n) => n[t] : r = t, Object.entries(e).reduce((n, [o, i]) => (n[o] = r(i, o), n), {});
624
- }
625
- function Yn(e, t) {
626
- return e.reduce((r, n, o) => (r[n] = t[o], r), {});
627
- }
628
- var Oe = "\0", Kn = "3.0.0", Un = class {
629
- constructor() {
630
- hn(this, "_sentinel");
631
- let e = {};
632
- e._next = e._prev = e, this._sentinel = e;
633
- }
634
- dequeue() {
635
- let e = this._sentinel, t = e._prev;
636
- if (t !== e) return _t(t), t;
637
- }
638
- enqueue(e) {
639
- let t = this._sentinel;
640
- e._prev && e._next && _t(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
641
- }
642
- toString() {
643
- let e = [], t = this._sentinel, r = t._prev;
644
- for (; r !== t; ) e.push(JSON.stringify(r, Vn)), r = r._prev;
645
- return "[" + e.join(", ") + "]";
646
- }
647
- };
648
- function _t(e) {
649
- e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
650
- }
651
- function Vn(e, t) {
652
- if (e !== "_next" && e !== "_prev") return t;
653
- }
654
- var Hn = Un, qn = () => 1;
655
- function Xn(e, t) {
656
- if (e.nodeCount() <= 1) return [];
657
- let r = Zn(e, t || qn);
658
- return Jn(r.graph, r.buckets, r.zeroIdx).flatMap((n) => e.outEdges(n.v, n.w) || []);
659
- }
660
- function Jn(e, t, r) {
661
- var n;
662
- let o = [], i = t[t.length - 1], s = t[0], l;
663
- for (; e.nodeCount(); ) {
664
- for (; l = s.dequeue(); ) Re(e, t, r, l);
665
- for (; l = i.dequeue(); ) Re(e, t, r, l);
666
- if (e.nodeCount()) {
667
- for (let d = t.length - 2; d > 0; --d) if (l = (n = t[d]) == null ? void 0 : n.dequeue(), l) {
668
- o = o.concat(Re(e, t, r, l, !0) || []);
669
- break;
670
- }
671
- }
672
- }
673
- return o;
674
- }
675
- function Re(e, t, r, n, o) {
676
- let i = [], s = o ? i : void 0;
677
- return (e.inEdges(n.v) || []).forEach((l) => {
678
- let d = e.edge(l), a = e.node(l.v);
679
- o && i.push({ v: l.v, w: l.w }), a.out -= d, Ke(t, r, a);
680
- }), (e.outEdges(n.v) || []).forEach((l) => {
681
- let d = e.edge(l), a = l.w, c = e.node(a);
682
- c.in -= d, Ke(t, r, c);
683
- }), e.removeNode(n.v), s;
684
- }
685
- function Zn(e, t) {
686
- let r = new Y(), n = 0, o = 0;
687
- e.nodes().forEach((l) => {
688
- r.setNode(l, { v: l, in: 0, out: 0 });
689
- }), e.edges().forEach((l) => {
690
- let d = r.edge(l.v, l.w) || 0, a = t(l), c = d + a;
691
- r.setEdge(l.v, l.w, c);
692
- let u = r.node(l.v), h = r.node(l.w);
693
- o = Math.max(o, u.out += a), n = Math.max(n, h.in += a);
694
- });
695
- let i = Qn(o + n + 3).map(() => new Hn()), s = n + 1;
696
- return r.nodes().forEach((l) => {
697
- Ke(i, s, r.node(l));
698
- }), { graph: r, buckets: i, zeroIdx: s };
699
- }
700
- function Ke(e, t, r) {
701
- var n, o, i;
702
- r.out ? r.in ? (i = e[r.out - r.in + t]) == null || i.enqueue(r) : (o = e[e.length - 1]) == null || o.enqueue(r) : (n = e[0]) == null || n.enqueue(r);
703
- }
704
- function Qn(e) {
705
- let t = [];
706
- for (let r = 0; r < e; r++) t.push(r);
707
- return t;
708
- }
709
- function eo(e) {
710
- (e.graph().acyclicer === "greedy" ? Xn(e, t(e)) : to(e)).forEach((r) => {
711
- let n = e.edge(r);
712
- e.removeEdge(r), n.forwardName = r.name, n.reversed = !0, e.setEdge(r.w, r.v, n, Je("rev"));
713
- });
714
- function t(r) {
715
- return (n) => r.edge(n).weight;
716
- }
717
- }
718
- function to(e) {
719
- let t = [], r = {}, n = {};
720
- function o(i) {
721
- Object.hasOwn(n, i) || (n[i] = !0, r[i] = !0, e.outEdges(i).forEach((s) => {
722
- Object.hasOwn(r, s.w) ? t.push(s) : o(s.w);
723
- }), delete r[i]);
724
- }
725
- return e.nodes().forEach(o), t;
726
- }
727
- function ro(e) {
728
- e.edges().forEach((t) => {
729
- let r = e.edge(t);
730
- if (r.reversed) {
731
- e.removeEdge(t);
732
- let n = r.forwardName;
733
- delete r.reversed, delete r.forwardName, e.setEdge(t.w, t.v, r, n);
734
- }
735
- });
736
- }
737
- function no(e) {
738
- e.graph().dummyChains = [], e.edges().forEach((t) => oo(e, t));
739
- }
740
- function oo(e, t) {
741
- let r = t.v, n = e.node(r).rank, o = t.w, i = e.node(o).rank, s = t.name, l = e.edge(t), d = l.labelRank;
742
- if (i === n + 1) return;
743
- e.removeEdge(t);
744
- let a, c, u;
745
- for (u = 0, ++n; n < i; ++u, ++n) l.points = [], c = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: n }, a = he(e, "edge", c, "_d"), n === d && (c.width = l.width, c.height = l.height, c.dummy = "edge-label", c.labelpos = l.labelpos), e.setEdge(r, a, { weight: l.weight }, s), u === 0 && e.graph().dummyChains.push(a), r = a;
746
- e.setEdge(r, o, { weight: l.weight }, s);
747
- }
748
- function io(e) {
749
- e.graph().dummyChains.forEach((t) => {
750
- let r = e.node(t), n = r.edgeLabel, o;
751
- for (e.setEdge(r.edgeObj, n); r.dummy; ) o = e.successors(t)[0], e.removeNode(t), n.points.push({ x: r.x, y: r.y }), r.dummy === "edge-label" && (n.x = r.x, n.y = r.y, n.width = r.width, n.height = r.height), t = o, r = e.node(t);
752
- });
753
- }
754
- function Ze(e) {
755
- let t = {};
756
- function r(n) {
757
- let o = e.node(n);
758
- if (Object.hasOwn(t, n)) return o.rank;
759
- t[n] = !0;
760
- let i = e.outEdges(n), s = i ? i.map((d) => d == null ? Number.POSITIVE_INFINITY : r(d.w) - e.edge(d).minlen) : [], l = V(Math.min, s);
761
- return l === Number.POSITIVE_INFINITY && (l = 0), o.rank = l;
762
- }
763
- e.sources().forEach(r);
764
- }
765
- function fe(e, t) {
766
- return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
767
- }
768
- var sr = so;
769
- function so(e) {
770
- let t = new Y({ directed: !1 }), r = e.nodes();
771
- if (r.length === 0) throw new Error("Graph must have at least one node");
772
- let n = r[0], o = e.nodeCount();
773
- t.setNode(n, {});
774
- let i, s;
775
- for (; lo(t, e) < o && (i = ao(t, e), !!i); ) s = t.hasNode(i.v) ? fe(e, i) : -fe(e, i), co(t, e, s);
776
- return t;
777
- }
778
- function lo(e, t) {
779
- function r(n) {
780
- let o = t.nodeEdges(n);
781
- o && o.forEach((i) => {
782
- let s = i.v, l = n === s ? i.w : s;
783
- !e.hasNode(l) && !fe(t, i) && (e.setNode(l, {}), e.setEdge(n, l, {}), r(l));
784
- });
785
- }
786
- return e.nodes().forEach(r), e.nodeCount();
787
- }
788
- function ao(e, t) {
789
- return t.edges().reduce((r, n) => {
790
- let o = Number.POSITIVE_INFINITY;
791
- return e.hasNode(n.v) !== e.hasNode(n.w) && (o = fe(t, n)), o < r[0] ? [o, n] : r;
792
- }, [Number.POSITIVE_INFINITY, null])[1];
793
- }
794
- function co(e, t, r) {
795
- e.nodes().forEach((n) => t.node(n).rank += r);
796
- }
797
- var { preorder: uo, postorder: fo } = Xe, ho = le;
798
- le.initLowLimValues = et;
799
- le.initCutValues = Qe;
800
- le.calcCutValue = lr;
801
- le.leaveEdge = dr;
802
- le.enterEdge = cr;
803
- le.exchangeEdges = ur;
804
- function le(e) {
805
- e = An(e), Ze(e);
806
- let t = sr(e);
807
- et(t), Qe(t, e);
808
- let r, n;
809
- for (; r = dr(t); ) n = cr(t, e, r), ur(t, e, r, n);
810
- }
811
- function Qe(e, t) {
812
- let r = fo(e, e.nodes());
813
- r = r.slice(0, r.length - 1), r.forEach((n) => go(e, t, n));
814
- }
815
- function go(e, t, r) {
816
- let n = e.node(r).parent, o = e.edge(r, n);
817
- o.cutvalue = lr(e, t, r);
818
- }
819
- function lr(e, t, r) {
820
- let n = e.node(r).parent, o = !0, i = t.edge(r, n), s = 0;
821
- i || (o = !1, i = t.edge(n, r)), s = i.weight;
822
- let l = t.nodeEdges(r);
823
- return l && l.forEach((d) => {
824
- let a = d.v === r, c = a ? d.w : d.v;
825
- if (c !== n) {
826
- let u = a === o, h = t.edge(d).weight;
827
- if (s += u ? h : -h, bo(e, r, c)) {
828
- let g = e.edge(r, c).cutvalue;
829
- s += u ? -g : g;
830
- }
831
- }
832
- }), s;
833
- }
834
- function et(e, t) {
835
- arguments.length < 2 && (t = e.nodes()[0]), ar(e, {}, 1, t);
836
- }
837
- function ar(e, t, r, n, o) {
838
- let i = r, s = e.node(n);
839
- t[n] = !0;
840
- let l = e.neighbors(n);
841
- return l && l.forEach((d) => {
842
- Object.hasOwn(t, d) || (r = ar(e, t, r, d, n));
843
- }), s.low = i, s.lim = r++, o ? s.parent = o : delete s.parent, r;
844
- }
845
- function dr(e) {
846
- return e.edges().find((t) => e.edge(t).cutvalue < 0);
847
- }
848
- function cr(e, t, r) {
849
- let n = r.v, o = r.w;
850
- t.hasEdge(n, o) || (n = r.w, o = r.v);
851
- let i = e.node(n), s = e.node(o), l = i, d = !1;
852
- return i.lim > s.lim && (l = s, d = !0), t.edges().filter((a) => d === Nt(e, e.node(a.v), l) && d !== Nt(e, e.node(a.w), l)).reduce((a, c) => fe(t, c) < fe(t, a) ? c : a);
853
- }
854
- function ur(e, t, r, n) {
855
- let o = r.v, i = r.w;
856
- e.removeEdge(o, i), e.setEdge(n.v, n.w, {}), et(e), Qe(e, t), po(e, t);
857
- }
858
- function po(e, t) {
859
- let r = e.nodes().find((o) => !e.node(o).parent);
860
- if (!r) return;
861
- let n = uo(e, [r]);
862
- n = n.slice(1), n.forEach((o) => {
863
- let i = e.node(o).parent, s = t.edge(o, i), l = !1;
864
- s || (s = t.edge(i, o), l = !0), t.node(o).rank = t.node(i).rank + (l ? s.minlen : -s.minlen);
865
- });
866
- }
867
- function bo(e, t, r) {
868
- return e.hasEdge(t, r);
869
- }
870
- function Nt(e, t, r) {
871
- return r.low <= t.lim && t.lim <= r.lim;
872
- }
873
- var yo = mo;
874
- function mo(e) {
875
- let t = e.graph().ranker;
876
- if (typeof t == "function") return t(e);
877
- switch (t) {
878
- case "network-simplex":
879
- Ct(e);
880
- break;
881
- case "tight-tree":
882
- vo(e);
883
- break;
884
- case "longest-path":
885
- wo(e);
886
- break;
887
- case "none":
888
- break;
889
- default:
890
- Ct(e);
891
- }
892
- }
893
- var wo = Ze;
894
- function vo(e) {
895
- Ze(e), sr(e);
896
- }
897
- function Ct(e) {
898
- ho(e);
899
- }
900
- var Eo = ko;
901
- function ko(e) {
902
- let t = To(e);
903
- e.graph().dummyChains.forEach((r) => {
904
- let n = e.node(r), o = n.edgeObj, i = xo(e, t, o.v, o.w), s = i.path, l = i.lca, d = 0, a = s[d], c = !0;
905
- for (; r !== o.w; ) {
906
- if (n = e.node(r), c) {
907
- for (; (a = s[d]) !== l && e.node(a).maxRank < n.rank; ) d++;
908
- a === l && (c = !1);
909
- }
910
- if (!c) {
911
- for (; d < s.length - 1 && e.node(s[d + 1]).minRank <= n.rank; ) d++;
912
- a = s[d];
913
- }
914
- a !== void 0 && e.setParent(r, a), r = e.successors(r)[0];
915
- }
916
- });
917
- }
918
- function xo(e, t, r, n) {
919
- let o = [], i = [], s = Math.min(t[r].low, t[n].low), l = Math.max(t[r].lim, t[n].lim), d;
920
- d = r;
921
- do
922
- d = e.parent(d), o.push(d);
923
- while (d && (t[d].low > s || l > t[d].lim));
924
- let a = d, c = n;
925
- for (; (c = e.parent(c)) !== a; ) i.push(c);
926
- return { path: o.concat(i.reverse()), lca: a };
927
- }
928
- function To(e) {
929
- let t = {}, r = 0;
930
- function n(o) {
931
- let i = r;
932
- e.children(o).forEach(n), t[o] = { low: i, lim: r++ };
933
- }
934
- return e.children(Oe).forEach(n), t;
935
- }
936
- function _o(e) {
937
- let t = he(e, "root", {}, "_root"), r = No(e), n = Object.values(r), o = V(Math.max, n) - 1, i = 2 * o + 1;
938
- e.graph().nestingRoot = t, e.edges().forEach((l) => e.edge(l).minlen *= i);
939
- let s = Co(e) + 1;
940
- e.children(Oe).forEach((l) => fr(e, t, i, s, o, r, l)), e.graph().nodeRankFactor = i;
941
- }
942
- function fr(e, t, r, n, o, i, s) {
943
- var l;
944
- let d = e.children(s);
945
- if (!d.length) {
946
- s !== t && e.setEdge(t, s, { weight: 0, minlen: r });
947
- return;
948
- }
949
- let a = Tt(e, "_bt"), c = Tt(e, "_bb"), u = e.node(s);
950
- e.setParent(a, s), u.borderTop = a, e.setParent(c, s), u.borderBottom = c, d.forEach((h) => {
951
- var g;
952
- fr(e, t, r, n, o, i, h);
953
- let p = e.node(h), m = p.borderTop ? p.borderTop : h, b = p.borderBottom ? p.borderBottom : h, v = p.borderTop ? n : 2 * n, T = m !== b ? 1 : o - ((g = i[s]) != null ? g : 0) + 1;
954
- e.setEdge(a, m, { weight: v, minlen: T, nestingEdge: !0 }), e.setEdge(b, c, { weight: v, minlen: T, nestingEdge: !0 });
955
- }), e.parent(s) || e.setEdge(t, a, { weight: 0, minlen: o + ((l = i[s]) != null ? l : 0) });
956
- }
957
- function No(e) {
958
- let t = {};
959
- function r(n, o) {
960
- let i = e.children(n);
961
- i && i.length && i.forEach((s) => r(s, o + 1)), t[n] = o;
962
- }
963
- return e.children(Oe).forEach((n) => r(n, 1)), t;
964
- }
965
- function Co(e) {
966
- return e.edges().reduce((t, r) => t + e.edge(r).weight, 0);
967
- }
968
- function So(e) {
969
- let t = e.graph();
970
- e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((r) => {
971
- e.edge(r).nestingEdge && e.removeEdge(r);
972
- });
973
- }
974
- var Io = Oo;
975
- function Oo(e) {
976
- function t(r) {
977
- let n = e.children(r), o = e.node(r);
978
- if (n.length && n.forEach(t), Object.hasOwn(o, "minRank")) {
979
- o.borderLeft = [], o.borderRight = [];
980
- for (let i = o.minRank, s = o.maxRank + 1; i < s; ++i) St(e, "borderLeft", "_bl", r, o, i), St(e, "borderRight", "_br", r, o, i);
981
- }
982
- }
983
- e.children(Oe).forEach(t);
984
- }
985
- function St(e, t, r, n, o, i) {
986
- let s = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], d = he(e, "border", s, r);
987
- o[t][i] = d, e.setParent(d, n), l && e.setEdge(l, d, { weight: 1 });
988
- }
989
- function Mo(e) {
990
- var t;
991
- let r = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
992
- (r === "lr" || r === "rl") && hr(e);
993
- }
994
- function jo(e) {
995
- var t;
996
- let r = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
997
- (r === "bt" || r === "rl") && zo(e), (r === "lr" || r === "rl") && (Fo(e), hr(e));
998
- }
999
- function hr(e) {
1000
- e.nodes().forEach((t) => It(e.node(t))), e.edges().forEach((t) => It(e.edge(t)));
1001
- }
1002
- function It(e) {
1003
- let t = e.width;
1004
- e.width = e.height, e.height = t;
1005
- }
1006
- function zo(e) {
1007
- e.nodes().forEach((t) => Ae(e.node(t))), e.edges().forEach((t) => {
1008
- var r;
1009
- let n = e.edge(t);
1010
- (r = n.points) == null || r.forEach(Ae), Object.hasOwn(n, "y") && Ae(n);
1011
- });
1012
- }
1013
- function Ae(e) {
1014
- e.y = -e.y;
1015
- }
1016
- function Fo(e) {
1017
- e.nodes().forEach((t) => Pe(e.node(t))), e.edges().forEach((t) => {
1018
- var r;
1019
- let n = e.edge(t);
1020
- (r = n.points) == null || r.forEach(Pe), Object.hasOwn(n, "x") && Pe(n);
1021
- });
1022
- }
1023
- function Pe(e) {
1024
- let t = e.x;
1025
- e.x = e.y, e.y = t;
1026
- }
1027
- function Do(e) {
1028
- let t = {}, r = e.nodes().filter((l) => !e.children(l).length), n = r.map((l) => e.node(l).rank), o = V(Math.max, n), i = ye(o + 1).map(() => []);
1029
- function s(l) {
1030
- if (t[l]) return;
1031
- t[l] = !0;
1032
- let d = e.node(l);
1033
- i[d.rank].push(l);
1034
- let a = e.successors(l);
1035
- a && a.forEach(s);
1036
- }
1037
- return r.sort((l, d) => e.node(l).rank - e.node(d).rank).forEach(s), i;
1038
- }
1039
- function Lo(e, t) {
1040
- let r = 0;
1041
- for (let n = 1; n < t.length; ++n) r += Ro(e, t[n - 1], t[n]);
1042
- return r;
1043
- }
1044
- function Ro(e, t, r) {
1045
- let n = Yn(r, r.map((a, c) => c)), o = t.flatMap((a) => {
1046
- let c = e.outEdges(a);
1047
- return c ? c.map((u) => ({ pos: n[u.w], weight: e.edge(u).weight })).sort((u, h) => u.pos - h.pos) : [];
1048
- }), i = 1;
1049
- for (; i < r.length; ) i <<= 1;
1050
- let s = 2 * i - 1;
1051
- i -= 1;
1052
- let l = new Array(s).fill(0), d = 0;
1053
- return o.forEach((a) => {
1054
- let c = a.pos + i;
1055
- l[c] += a.weight;
1056
- let u = 0;
1057
- for (; c > 0; ) c % 2 && (u += l[c + 1]), c = c - 1 >> 1, l[c] += a.weight;
1058
- d += a.weight * u;
1059
- }), d;
1060
- }
1061
- function Ao(e, t = []) {
1062
- return t.map((r) => {
1063
- let n = e.inEdges(r);
1064
- if (!n || !n.length) return { v: r };
1065
- {
1066
- let o = n.reduce((i, s) => {
1067
- let l = e.edge(s), d = e.node(s.v);
1068
- return { sum: i.sum + l.weight * d.order, weight: i.weight + l.weight };
1069
- }, { sum: 0, weight: 0 });
1070
- return { v: r, barycenter: o.sum / o.weight, weight: o.weight };
1071
- }
1072
- });
1073
- }
1074
- function Po(e, t) {
1075
- let r = {};
1076
- e.forEach((o, i) => {
1077
- let s = { indegree: 0, in: [], out: [], vs: [o.v], i };
1078
- o.barycenter !== void 0 && (s.barycenter = o.barycenter, s.weight = o.weight), r[o.v] = s;
1079
- }), t.edges().forEach((o) => {
1080
- let i = r[o.v], s = r[o.w];
1081
- i !== void 0 && s !== void 0 && (s.indegree++, i.out.push(s));
1082
- });
1083
- let n = Object.values(r).filter((o) => !o.indegree);
1084
- return Bo(n);
1085
- }
1086
- function Bo(e) {
1087
- let t = [];
1088
- function r(o) {
1089
- return (i) => {
1090
- i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Wo(o, i);
1091
- };
1092
- }
1093
- function n(o) {
1094
- return (i) => {
1095
- i.in.push(o), --i.indegree === 0 && e.push(i);
1096
- };
1097
- }
1098
- for (; e.length; ) {
1099
- let o = e.pop();
1100
- t.push(o), o.in.reverse().forEach(r(o)), o.out.forEach(n(o));
1101
- }
1102
- return t.filter((o) => !o.merged).map((o) => Se(o, ["vs", "i", "barycenter", "weight"]));
1103
- }
1104
- function Wo(e, t) {
1105
- let r = 0, n = 0;
1106
- e.weight && (r += e.barycenter * e.weight, n += e.weight), t.weight && (r += t.barycenter * t.weight, n += t.weight), e.vs = t.vs.concat(e.vs), e.barycenter = r / n, e.weight = n, e.i = Math.min(t.i, e.i), t.merged = !0;
1107
- }
1108
- function Go(e, t) {
1109
- let r = Gn(e, (c) => Object.hasOwn(c, "barycenter")), n = r.lhs, o = r.rhs.sort((c, u) => u.i - c.i), i = [], s = 0, l = 0, d = 0;
1110
- n.sort($o(!!t)), d = Ot(i, o, d), n.forEach((c) => {
1111
- d += c.vs.length, i.push(c.vs), s += c.barycenter * c.weight, l += c.weight, d = Ot(i, o, d);
1112
- });
1113
- let a = { vs: i.flat(1) };
1114
- return l && (a.barycenter = s / l, a.weight = l), a;
1115
- }
1116
- function Ot(e, t, r) {
1117
- let n;
1118
- for (; t.length && (n = t[t.length - 1]).i <= r; ) t.pop(), e.push(n.vs), r++;
1119
- return r;
1120
- }
1121
- function $o(e) {
1122
- return (t, r) => t.barycenter < r.barycenter ? -1 : t.barycenter > r.barycenter ? 1 : e ? r.i - t.i : t.i - r.i;
1123
- }
1124
- function gr(e, t, r, n) {
1125
- let o = e.children(t), i = e.node(t), s = i ? i.borderLeft : void 0, l = i ? i.borderRight : void 0, d = {};
1126
- s && (o = o.filter((h) => h !== s && h !== l));
1127
- let a = Ao(e, o);
1128
- a.forEach((h) => {
1129
- if (e.children(h.v).length) {
1130
- let g = gr(e, h.v, r, n);
1131
- d[h.v] = g, Object.hasOwn(g, "barycenter") && Ko(h, g);
1132
- }
1133
- });
1134
- let c = Po(a, r);
1135
- Yo(c, d);
1136
- let u = Go(c, n);
1137
- if (s && l) {
1138
- u.vs = [s, u.vs, l].flat(1);
1139
- let h = e.predecessors(s);
1140
- if (h && h.length) {
1141
- let g = e.node(h[0]), p = e.predecessors(l), m = e.node(p[0]);
1142
- Object.hasOwn(u, "barycenter") || (u.barycenter = 0, u.weight = 0), u.barycenter = (u.barycenter * u.weight + g.order + m.order) / (u.weight + 2), u.weight += 2;
1143
- }
1144
- }
1145
- return u;
1146
- }
1147
- function Yo(e, t) {
1148
- e.forEach((r) => {
1149
- r.vs = r.vs.flatMap((n) => t[n] ? t[n].vs : n);
1150
- });
1151
- }
1152
- function Ko(e, t) {
1153
- e.barycenter !== void 0 ? (e.barycenter = (e.barycenter * e.weight + t.barycenter * t.weight) / (e.weight + t.weight), e.weight += t.weight) : (e.barycenter = t.barycenter, e.weight = t.weight);
1154
- }
1155
- function Uo(e, t, r, n) {
1156
- n || (n = e.nodes());
1157
- let o = Vo(e), i = new Y({ compound: !0 }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
1158
- return n.forEach((s) => {
1159
- let l = e.node(s), d = e.parent(s);
1160
- if (l.rank === t || l.minRank <= t && t <= l.maxRank) {
1161
- i.setNode(s), i.setParent(s, d || o);
1162
- let a = e[r](s);
1163
- a && a.forEach((c) => {
1164
- let u = c.v === s ? c.w : c.v, h = i.edge(u, s), g = h !== void 0 ? h.weight : 0;
1165
- i.setEdge(u, s, { weight: e.edge(c).weight + g });
1166
- }), Object.hasOwn(l, "minRank") && i.setNode(s, { borderLeft: l.borderLeft[t], borderRight: l.borderRight[t] });
1167
- }
1168
- }), i;
1169
- }
1170
- function Vo(e) {
1171
- let t;
1172
- for (; e.hasNode(t = Je("_root")); ) ;
1173
- return t;
1174
- }
1175
- function Ho(e, t, r) {
1176
- let n = {}, o;
1177
- r.forEach((i) => {
1178
- let s = e.parent(i), l, d;
1179
- for (; s; ) {
1180
- if (l = e.parent(s), l ? (d = n[l], n[l] = s) : (d = o, o = s), d && d !== s) {
1181
- t.setEdge(d, s);
1182
- return;
1183
- }
1184
- s = l;
1185
- }
1186
- });
1187
- }
1188
- function pr(e, t = {}) {
1189
- if (typeof t.customOrder == "function") {
1190
- t.customOrder(e, pr);
1191
- return;
1192
- }
1193
- let r = nr(e), n = Mt(e, ye(1, r + 1), "inEdges"), o = Mt(e, ye(r - 1, -1, -1), "outEdges"), i = Do(e);
1194
- if (jt(e, i), t.disableOptimalOrderHeuristic) return;
1195
- let s = Number.POSITIVE_INFINITY, l, d = t.constraints || [];
1196
- for (let a = 0, c = 0; c < 4; ++a, ++c) {
1197
- qo(a % 2 ? n : o, a % 4 >= 2, d), i = we(e);
1198
- let u = Lo(e, i);
1199
- u < s ? (c = 0, l = Object.assign({}, i), s = u) : u === s && (l = structuredClone(i));
1200
- }
1201
- jt(e, l);
1202
- }
1203
- function Mt(e, t, r) {
1204
- let n = /* @__PURE__ */ new Map(), o = (i, s) => {
1205
- n.has(i) || n.set(i, []), n.get(i).push(s);
1206
- };
1207
- for (let i of e.nodes()) {
1208
- let s = e.node(i);
1209
- if (typeof s.rank == "number" && o(s.rank, i), typeof s.minRank == "number" && typeof s.maxRank == "number") for (let l = s.minRank; l <= s.maxRank; l++) l !== s.rank && o(l, i);
1210
- }
1211
- return t.map(function(i) {
1212
- return Uo(e, i, r, n.get(i) || []);
1213
- });
1214
- }
1215
- function qo(e, t, r) {
1216
- let n = new Y();
1217
- e.forEach(function(o) {
1218
- r.forEach((l) => n.setEdge(l.left, l.right));
1219
- let i = o.graph().root, s = gr(o, i, n, t);
1220
- s.vs.forEach((l, d) => o.node(l).order = d), Ho(o, n, s.vs);
1221
- });
1222
- }
1223
- function jt(e, t) {
1224
- Object.values(t).forEach((r) => r.forEach((n, o) => e.node(n).order = o));
1225
- }
1226
- function Xo(e, t) {
1227
- let r = {};
1228
- function n(o, i) {
1229
- let s = 0, l = 0, d = o.length, a = i[i.length - 1];
1230
- return i.forEach((c, u) => {
1231
- let h = Zo(e, c), g = h ? e.node(h).order : d;
1232
- (h || c === a) && (i.slice(l, u + 1).forEach((p) => {
1233
- let m = e.predecessors(p);
1234
- m && m.forEach((b) => {
1235
- let v = e.node(b), T = v.order;
1236
- (T < s || g < T) && !(v.dummy && e.node(p).dummy) && br(r, b, p);
1237
- });
1238
- }), l = u + 1, s = g);
1239
- }), i;
1240
- }
1241
- return t.length && t.reduce(n), r;
1242
- }
1243
- function Jo(e, t) {
1244
- let r = {};
1245
- function n(i, s, l, d, a) {
1246
- ye(s, l).forEach((c) => {
1247
- let u = i[c];
1248
- if (u !== void 0 && e.node(u).dummy) {
1249
- let h = e.predecessors(u);
1250
- h && h.forEach((g) => {
1251
- if (g === void 0) return;
1252
- let p = e.node(g);
1253
- p.dummy && (p.order < d || p.order > a) && br(r, g, u);
1254
- });
1255
- }
1256
- });
1257
- }
1258
- function o(i, s) {
1259
- let l = -1, d = -1, a = 0;
1260
- return s.forEach((c, u) => {
1261
- if (e.node(c).dummy === "border") {
1262
- let h = e.predecessors(c);
1263
- if (h && h.length) {
1264
- let g = h[0];
1265
- if (g === void 0) return;
1266
- d = e.node(g).order, n(s, a, u, l, d), a = u, l = d;
1267
- }
1268
- }
1269
- n(s, a, s.length, d, i.length);
1270
- }), s;
1271
- }
1272
- return t.length && t.reduce(o), r;
1273
- }
1274
- function Zo(e, t) {
1275
- if (e.node(t).dummy) {
1276
- let r = e.predecessors(t);
1277
- if (r) return r.find((n) => e.node(n).dummy);
1278
- }
1279
- }
1280
- function br(e, t, r) {
1281
- if (t > r) {
1282
- let o = t;
1283
- t = r, r = o;
1284
- }
1285
- let n = e[t];
1286
- n || (e[t] = n = {}), n[r] = !0;
1287
- }
1288
- function Qo(e, t, r) {
1289
- if (t > r) {
1290
- let o = t;
1291
- t = r, r = o;
1292
- }
1293
- let n = e[t];
1294
- return n !== void 0 && Object.hasOwn(n, r);
1295
- }
1296
- function ei(e, t, r, n) {
1297
- let o = {}, i = {}, s = {};
1298
- return t.forEach((l) => {
1299
- l.forEach((d, a) => {
1300
- o[d] = d, i[d] = d, s[d] = a;
1301
- });
1302
- }), t.forEach((l) => {
1303
- let d = -1;
1304
- l.forEach((a) => {
1305
- let c = n(a);
1306
- if (c && c.length) {
1307
- let u = c.sort((g, p) => {
1308
- let m = s[g], b = s[p];
1309
- return (m !== void 0 ? m : 0) - (b !== void 0 ? b : 0);
1310
- }), h = (u.length - 1) / 2;
1311
- for (let g = Math.floor(h), p = Math.ceil(h); g <= p; ++g) {
1312
- let m = u[g];
1313
- if (m === void 0) continue;
1314
- let b = s[m];
1315
- if (b !== void 0 && i[a] === a && d < b && !Qo(r, a, m)) {
1316
- let v = o[m];
1317
- v !== void 0 && (i[m] = a, i[a] = o[a] = v, d = b);
1318
- }
1319
- }
1320
- }
1321
- });
1322
- }), { root: o, align: i };
1323
- }
1324
- function ti(e, t, r, n, o = !1) {
1325
- let i = {}, s = ri(e, t, r, o), l = o ? "borderLeft" : "borderRight";
1326
- function d(g, p) {
1327
- let m = s.nodes().slice(), b = {}, v = m.pop();
1328
- for (; v; ) {
1329
- if (b[v]) g(v);
1330
- else {
1331
- b[v] = !0, m.push(v);
1332
- for (let T of p(v)) m.push(T);
1333
- }
1334
- v = m.pop();
1335
- }
1336
- }
1337
- function a(g) {
1338
- let p = s.inEdges(g);
1339
- p ? i[g] = p.reduce((m, b) => {
1340
- var v;
1341
- let T = (v = i[b.v]) != null ? v : 0, S = s.edge(b);
1342
- return Math.max(m, T + (S !== void 0 ? S : 0));
1343
- }, 0) : i[g] = 0;
1344
- }
1345
- function c(g) {
1346
- let p = s.outEdges(g), m = Number.POSITIVE_INFINITY;
1347
- p && (m = p.reduce((v, T) => {
1348
- let S = i[T.w], z = s.edge(T);
1349
- return Math.min(v, (S !== void 0 ? S : 0) - (z !== void 0 ? z : 0));
1350
- }, Number.POSITIVE_INFINITY));
1351
- let b = e.node(g);
1352
- m !== Number.POSITIVE_INFINITY && b.borderType !== l && (i[g] = Math.max(i[g] !== void 0 ? i[g] : 0, m));
1353
- }
1354
- function u(g) {
1355
- return s.predecessors(g) || [];
1356
- }
1357
- function h(g) {
1358
- return s.successors(g) || [];
1359
- }
1360
- return d(a, u), d(c, h), Object.keys(n).forEach((g) => {
1361
- var p;
1362
- let m = r[g];
1363
- m !== void 0 && (i[g] = (p = i[m]) != null ? p : 0);
1364
- }), i;
1365
- }
1366
- function ri(e, t, r, n) {
1367
- let o = new Y(), i = e.graph(), s = li(i.nodesep, i.edgesep, n);
1368
- return t.forEach((l) => {
1369
- let d;
1370
- l.forEach((a) => {
1371
- let c = r[a];
1372
- if (c !== void 0) {
1373
- if (o.setNode(c), d !== void 0) {
1374
- let u = r[d];
1375
- if (u !== void 0) {
1376
- let h = o.edge(u, c);
1377
- o.setEdge(u, c, Math.max(s(e, a, d), h || 0));
1378
- }
1379
- }
1380
- d = a;
1381
- }
1382
- });
1383
- }), o;
1384
- }
1385
- function ni(e, t) {
1386
- return Object.values(t).reduce((r, n) => {
1387
- let o = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
1388
- Object.entries(n).forEach(([l, d]) => {
1389
- let a = ai(e, l) / 2;
1390
- o = Math.max(d + a, o), i = Math.min(d - a, i);
1391
- });
1392
- let s = o - i;
1393
- return s < r[0] && (r = [s, n]), r;
1394
- }, [Number.POSITIVE_INFINITY, null])[1];
1395
- }
1396
- function oi(e, t) {
1397
- let r = Object.values(t), n = V(Math.min, r), o = V(Math.max, r);
1398
- ["u", "d"].forEach((i) => {
1399
- ["l", "r"].forEach((s) => {
1400
- let l = i + s, d = e[l];
1401
- if (!d || d === t) return;
1402
- let a = Object.values(d), c = n - V(Math.min, a);
1403
- s !== "l" && (c = o - V(Math.max, a)), c && (e[l] = Ie(d, (u) => u + c));
1404
- });
1405
- });
1406
- }
1407
- function ii(e, t = void 0) {
1408
- let r = e.ul;
1409
- return r ? Ie(r, (n, o) => {
1410
- var i, s;
1411
- if (t) {
1412
- let d = t.toLowerCase(), a = e[d];
1413
- if (a && a[o] !== void 0) return a[o];
1414
- }
1415
- let l = Object.values(e).map((d) => {
1416
- let a = d[o];
1417
- return a !== void 0 ? a : 0;
1418
- }).sort((d, a) => d - a);
1419
- return (((i = l[1]) != null ? i : 0) + ((s = l[2]) != null ? s : 0)) / 2;
1420
- }) : {};
1421
- }
1422
- function si(e) {
1423
- let t = we(e), r = Object.assign(Xo(e, t), Jo(e, t)), n = {}, o;
1424
- ["u", "d"].forEach((s) => {
1425
- o = s === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((l) => {
1426
- l === "r" && (o = o.map((c) => Object.values(c).reverse()));
1427
- let d = ei(e, o, r, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), a = ti(e, o, d.root, d.align, l === "r");
1428
- l === "r" && (a = Ie(a, (c) => -c)), n[s + l] = a;
1429
- });
1430
- });
1431
- let i = ni(e, n);
1432
- return oi(n, i), ii(n, e.graph().align);
1433
- }
1434
- function li(e, t, r) {
1435
- return (n, o, i) => {
1436
- let s = n.node(o), l = n.node(i), d = 0, a;
1437
- if (d += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
1438
- case "l":
1439
- a = -s.width / 2;
1440
- break;
1441
- case "r":
1442
- a = s.width / 2;
1443
- break;
1444
- }
1445
- if (a && (d += r ? a : -a), a = void 0, d += (s.dummy ? t : e) / 2, d += (l.dummy ? t : e) / 2, d += l.width / 2, Object.hasOwn(l, "labelpos")) switch (l.labelpos.toLowerCase()) {
1446
- case "l":
1447
- a = l.width / 2;
1448
- break;
1449
- case "r":
1450
- a = -l.width / 2;
1451
- break;
1452
- }
1453
- return a && (d += r ? a : -a), d;
1454
- };
1455
- }
1456
- function ai(e, t) {
1457
- return e.node(t).width;
1458
- }
1459
- function di(e) {
1460
- e = tr(e), ci(e), Object.entries(si(e)).forEach(([t, r]) => e.node(t).x = r);
1461
- }
1462
- function ci(e) {
1463
- let t = we(e), r = e.graph(), n = r.ranksep, o = r.rankalign, i = 0;
1464
- t.forEach((s) => {
1465
- let l = s.reduce((d, a) => {
1466
- var c;
1467
- let u = (c = e.node(a).height) != null ? c : 0;
1468
- return d > u ? d : u;
1469
- }, 0);
1470
- s.forEach((d) => {
1471
- let a = e.node(d);
1472
- o === "top" ? a.y = i + a.height / 2 : o === "bottom" ? a.y = i + l - a.height / 2 : a.y = i + l / 2;
1473
- }), i += l + n;
1474
- });
1475
- }
1476
- function ui(e, t = {}) {
1477
- let r = t.debugTiming ? or : ir;
1478
- return r("layout", () => {
1479
- let n = r(" buildLayoutGraph", () => Ei(e));
1480
- return r(" runLayout", () => fi(n, r, t)), r(" updateInputGraph", () => hi(e, n)), n;
1481
- });
1482
- }
1483
- function fi(e, t, r) {
1484
- t(" makeSpaceForEdgeLabels", () => ki(e)), t(" removeSelfEdges", () => Mi(e)), t(" acyclic", () => eo(e)), t(" nestingGraph.run", () => _o(e)), t(" rank", () => yo(tr(e))), t(" injectEdgeLabelProxies", () => xi(e)), t(" removeEmptyRanks", () => Bn(e)), t(" nestingGraph.cleanup", () => So(e)), t(" normalizeRanks", () => Pn(e)), t(" assignRankMinMax", () => Ti(e)), t(" removeEdgeLabelProxies", () => _i(e)), t(" normalize.run", () => no(e)), t(" parentDummyChains", () => Eo(e)), t(" addBorderSegments", () => Io(e)), t(" order", () => pr(e, r)), t(" insertSelfEdges", () => ji(e)), t(" adjustCoordinateSystem", () => Mo(e)), t(" position", () => di(e)), t(" positionSelfEdges", () => zi(e)), t(" removeBorderNodes", () => Oi(e)), t(" normalize.undo", () => io(e)), t(" fixupEdgeLabelCoords", () => Si(e)), t(" undoCoordinateSystem", () => jo(e)), t(" translateGraph", () => Ni(e)), t(" assignNodeIntersects", () => Ci(e)), t(" reversePoints", () => Ii(e)), t(" acyclic.undo", () => ro(e));
1485
- }
1486
- function hi(e, t) {
1487
- e.nodes().forEach((r) => {
1488
- let n = e.node(r), o = t.node(r);
1489
- n && (n.x = o.x, n.y = o.y, n.order = o.order, n.rank = o.rank, t.children(r).length && (n.width = o.width, n.height = o.height));
1490
- }), e.edges().forEach((r) => {
1491
- let n = e.edge(r), o = t.edge(r);
1492
- n.points = o.points, Object.hasOwn(o, "x") && (n.x = o.x, n.y = o.y);
1493
- }), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
1494
- }
1495
- var gi = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], pi = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, bi = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], yi = ["width", "height", "rank"], zt = { width: 0, height: 0 }, mi = ["minlen", "weight", "width", "height", "labeloffset"], wi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, vi = ["labelpos"];
1496
- function Ei(e) {
1497
- let t = new Y({ multigraph: !0, compound: !0 }), r = We(e.graph());
1498
- return t.setGraph(Object.assign({}, pi, Be(r, gi), Se(r, bi))), e.nodes().forEach((n) => {
1499
- let o = We(e.node(n)), i = Be(o, yi);
1500
- Object.keys(zt).forEach((l) => {
1501
- i[l] === void 0 && (i[l] = zt[l]);
1502
- }), t.setNode(n, i);
1503
- let s = e.parent(n);
1504
- s !== void 0 && t.setParent(n, s);
1505
- }), e.edges().forEach((n) => {
1506
- let o = We(e.edge(n));
1507
- t.setEdge(n, Object.assign({}, wi, Be(o, mi), Se(o, vi)));
1508
- }), t;
1509
- }
1510
- function ki(e) {
1511
- let t = e.graph();
1512
- t.ranksep /= 2, e.edges().forEach((r) => {
1513
- let n = e.edge(r);
1514
- n.minlen *= 2, n.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? n.width += n.labeloffset : n.height += n.labeloffset);
1515
- });
1516
- }
1517
- function xi(e) {
1518
- e.edges().forEach((t) => {
1519
- let r = e.edge(t);
1520
- if (r.width && r.height) {
1521
- let n = e.node(t.v), o = { rank: (e.node(t.w).rank - n.rank) / 2 + n.rank, e: t };
1522
- he(e, "edge-proxy", o, "_ep");
1523
- }
1524
- });
1525
- }
1526
- function Ti(e) {
1527
- let t = 0;
1528
- e.nodes().forEach((r) => {
1529
- let n = e.node(r);
1530
- n.borderTop && (n.minRank = e.node(n.borderTop).rank, n.maxRank = e.node(n.borderBottom).rank, t = Math.max(t, n.maxRank));
1531
- }), e.graph().maxRank = t;
1532
- }
1533
- function _i(e) {
1534
- e.nodes().forEach((t) => {
1535
- let r = e.node(t);
1536
- if (r.dummy === "edge-proxy") {
1537
- let n = r;
1538
- e.edge(n.e).labelRank = r.rank, e.removeNode(t);
1539
- }
1540
- });
1541
- }
1542
- function Ni(e) {
1543
- let t = Number.POSITIVE_INFINITY, r = 0, n = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), s = i.marginx || 0, l = i.marginy || 0;
1544
- function d(a) {
1545
- let c = a.x, u = a.y, h = a.width, g = a.height;
1546
- t = Math.min(t, c - h / 2), r = Math.max(r, c + h / 2), n = Math.min(n, u - g / 2), o = Math.max(o, u + g / 2);
1547
- }
1548
- e.nodes().forEach((a) => d(e.node(a))), e.edges().forEach((a) => {
1549
- let c = e.edge(a);
1550
- Object.hasOwn(c, "x") && d(c);
1551
- }), t -= s, n -= l, e.nodes().forEach((a) => {
1552
- let c = e.node(a);
1553
- c.x -= t, c.y -= n;
1554
- }), e.edges().forEach((a) => {
1555
- let c = e.edge(a);
1556
- c.points.forEach((u) => {
1557
- u.x -= t, u.y -= n;
1558
- }), Object.hasOwn(c, "x") && (c.x -= t), Object.hasOwn(c, "y") && (c.y -= n);
1559
- }), i.width = r - t + s, i.height = o - n + l;
1560
- }
1561
- function Ci(e) {
1562
- e.edges().forEach((t) => {
1563
- let r = e.edge(t), n = e.node(t.v), o = e.node(t.w), i, s;
1564
- r.points ? (i = r.points[0], s = r.points[r.points.length - 1]) : (r.points = [], i = o, s = n), r.points.unshift(xt(n, i)), r.points.push(xt(o, s));
1565
- });
1566
- }
1567
- function Si(e) {
1568
- e.edges().forEach((t) => {
1569
- let r = e.edge(t);
1570
- if (Object.hasOwn(r, "x")) switch ((r.labelpos === "l" || r.labelpos === "r") && (r.width -= r.labeloffset), r.labelpos) {
1571
- case "l":
1572
- r.x -= r.width / 2 + r.labeloffset;
1573
- break;
1574
- case "r":
1575
- r.x += r.width / 2 + r.labeloffset;
1576
- break;
1577
- }
1578
- });
1579
- }
1580
- function Ii(e) {
1581
- e.edges().forEach((t) => {
1582
- let r = e.edge(t);
1583
- r.reversed && r.points.reverse();
1584
- });
1585
- }
1586
- function Oi(e) {
1587
- e.nodes().forEach((t) => {
1588
- if (e.children(t).length) {
1589
- let r = e.node(t), n = e.node(r.borderTop), o = e.node(r.borderBottom), i = e.node(r.borderLeft[r.borderLeft.length - 1]), s = e.node(r.borderRight[r.borderRight.length - 1]);
1590
- r.width = Math.abs(s.x - i.x), r.height = Math.abs(o.y - n.y), r.x = i.x + r.width / 2, r.y = n.y + r.height / 2;
1591
- }
1592
- }), e.nodes().forEach((t) => {
1593
- e.node(t).dummy === "border" && e.removeNode(t);
1594
- });
1595
- }
1596
- function Mi(e) {
1597
- e.edges().forEach((t) => {
1598
- if (t.v === t.w) {
1599
- let r = e.node(t.v);
1600
- r.selfEdges || (r.selfEdges = []), r.selfEdges.push({ e: t, label: e.edge(t) }), e.removeEdge(t);
1601
- }
1602
- });
1603
- }
1604
- function ji(e) {
1605
- we(e).forEach((t) => {
1606
- let r = 0;
1607
- t.forEach((n, o) => {
1608
- let i = e.node(n);
1609
- i.order = o + r, (i.selfEdges || []).forEach((s) => {
1610
- he(e, "selfedge", { width: s.label.width, height: s.label.height, rank: i.rank, order: o + ++r, e: s.e, label: s.label }, "_se");
1611
- }), delete i.selfEdges;
1612
- });
1613
- });
1614
- }
1615
- function zi(e) {
1616
- e.nodes().forEach((t) => {
1617
- let r = e.node(t);
1618
- if (r.dummy === "selfedge") {
1619
- let n = r, o = e.node(n.e.v), i = o.x + o.width / 2, s = o.y, l = r.x - i, d = o.height / 2;
1620
- e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [{ x: i + 2 * l / 3, y: s - d }, { x: i + 5 * l / 6, y: s - d }, { x: i + l, y: s }, { x: i + 5 * l / 6, y: s + d }, { x: i + 2 * l / 3, y: s + d }], n.label.x = r.x, n.label.y = r.y;
1621
- }
1622
- });
1623
- }
1624
- function Be(e, t) {
1625
- return Ie(Se(e, t), Number);
1626
- }
1627
- function We(e) {
1628
- let t = {};
1629
- return e && Object.entries(e).forEach(([r, n]) => {
1630
- typeof r == "string" && (r = r.toLowerCase()), t[r] = n;
1631
- }), t;
1632
- }
1633
- function Fi(e) {
1634
- let t = we(e), r = new Y({ compound: !0, multigraph: !0 }).setGraph({});
1635
- return e.nodes().forEach((n) => {
1636
- r.setNode(n, { label: n }), r.setParent(n, "layer" + e.node(n).rank);
1637
- }), e.edges().forEach((n) => r.setEdge(n.v, n.w, {}, n.name)), t.forEach((n, o) => {
1638
- let i = "layer" + o;
1639
- r.setNode(i, { rank: "same" }), n.reduce((s, l) => (r.setEdge(s, l, { style: "invis" }), l));
1640
- }), r;
1641
- }
1642
- var Di = { graphlib: Ut, version: Kn, layout: ui, debug: Fi, util: { time: or, notime: ir } }, Ft = Di;
1643
- /*! For license information please see dagre.esm.js.LEGAL.txt */
1644
- const Li = (e) => {
1645
- const t = [];
1646
- return e.nodeInternals.forEach((r, n) => t.push(`${n}:${r.height ?? 0}`)), t.join(",");
1647
- }, Ri = ({ onHeightsReady: e, nodeCount: t }) => {
1648
- const r = Cr(Li), n = mt("");
1649
- mt(0);
1650
- const { fitView: o } = Sr();
1651
- return re(() => {
1652
- if (!r || r === n.current) return;
1653
- const i = {};
1654
- for (const s of r.split(",")) {
1655
- const [l, d] = s.split(":"), a = Number(d);
1656
- l && a > 0 && (i[l] = a);
1657
- }
1658
- Object.keys(i).length !== 0 && (n.current = r, e(i));
1659
- }, [r]), null;
1660
- }, Me = ({ isOpen: e, onClose: t, title: r, icon: n, children: o, footer: i, width: s = 600 }) => {
1661
- const [l, d] = M(!1), a = () => d((h) => !h), c = () => /* @__PURE__ */ y(J, { sx: { display: "flex", alignItems: "center", p: 2, pt: 3, borderBottom: "1px solid #e0e0e0", mb: 0, flexShrink: 0 }, children: [
1662
- n && /* @__PURE__ */ f(J, { sx: { mr: 1.5, display: "flex", alignItems: "center", fontSize: "1.25rem", color: "#1DBF60" }, children: n }),
1663
- /* @__PURE__ */ f("span", { style: { flexGrow: 1, fontSize: 14, fontWeight: 500, color: "#212121" }, children: r }),
1664
- /* @__PURE__ */ f(wt, { onClick: a, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ f(on, {}) : /* @__PURE__ */ f(sn, {}) }),
1665
- /* @__PURE__ */ f(wt, { onClick: t, size: "small", "data-testid": "close-drawer-button", children: /* @__PURE__ */ f($r, {}) })
1666
- ] }), u = () => i ? /* @__PURE__ */ f(J, { sx: { flexShrink: 0, p: 2, borderTop: "1px solid #e0e0e0", display: "flex", justifyContent: "flex-end", gap: 2 }, children: i }) : null;
1667
- return l ? /* @__PURE__ */ y(Pr, { open: e, onClose: t, maxWidth: !1, fullWidth: !0, PaperProps: { sx: { display: "flex", flexDirection: "column", height: "80vh", boxShadow: 24, width: "750px", maxWidth: "100%" } }, children: [
1668
- /* @__PURE__ */ f(c, {}),
1669
- /* @__PURE__ */ f(J, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
1670
- /* @__PURE__ */ f(u, {})
1671
- ] }) : /* @__PURE__ */ y(
1672
- Br,
1673
- {
1674
- anchor: "right",
1675
- open: e,
1676
- onClose: t,
1677
- variant: "persistent",
1678
- sx: { zIndex: 900 },
1679
- ModalProps: { keepMounted: !1 },
1680
- PaperProps: {
1681
- sx: {
1682
- width: s,
1683
- position: "fixed",
1684
- top: "64px",
1685
- height: "calc(100% - 74px)",
1686
- right: "10px",
1687
- borderRadius: "8px",
1688
- border: "1px solid #bdbdbd",
1689
- boxShadow: "none",
1690
- zIndex: 900,
1691
- display: "flex",
1692
- flexDirection: "column"
1693
- }
1694
- },
1695
- children: [
1696
- /* @__PURE__ */ f(c, {}),
1697
- /* @__PURE__ */ f(J, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
1698
- /* @__PURE__ */ f(u, {})
1699
- ]
1700
- }
1701
- );
1702
- }, Ai = ({
1703
- open: e,
1704
- templates: t,
1705
- messages: r,
1706
- onSelect: n,
1707
- onClose: o,
1708
- loadTriggerSources: i
1709
- }) => {
1710
- const [s, l] = M("trigger"), [d, a] = M(null), [c, u] = M([]), [h, g] = M([]), [p, m] = M(!1), [b, v] = M(null);
1711
- re(() => {
1712
- e || (l("trigger"), a(null), u([]), g([]), m(!1), v(null));
1713
- }, [e]);
1714
- const T = U(async (F) => {
1715
- if (!i) {
1716
- n(F);
1717
- return;
1718
- }
1719
- a(F), m(!0), v(null);
1720
- try {
1721
- const D = await i(F.triggerKey);
1722
- if (!D || D.length === 0) {
1723
- n(F);
1724
- return;
1725
- }
1726
- u(D), l("sources");
1727
- } catch (D) {
1728
- v(D instanceof Error ? D.message : "Failed to load sources.");
1729
- } finally {
1730
- m(!1);
1731
- }
1732
- }, [i, n]), S = () => {
1733
- l("trigger"), a(null), u([]), g([]), v(null);
1734
- }, z = () => {
1735
- d && n(d, h);
1736
- }, j = s === "sources" && d, B = j ? /* @__PURE__ */ y(be, { children: [
1737
- /* @__PURE__ */ f(_e, { type: "button", variant: "outlined", size: "small", onClick: S, children: r.cancel ?? "Back" }),
1738
- /* @__PURE__ */ f(
1739
- _e,
1740
- {
1741
- type: "button",
1742
- variant: "contained",
1743
- size: "small",
1744
- onClick: z,
1745
- disabled: h.length === 0,
1746
- children: r.save ?? "Continue"
1747
- }
1748
- )
1749
- ] }) : null;
1750
- return /* @__PURE__ */ f(
1751
- Me,
1752
- {
1753
- isOpen: e,
1754
- onClose: o,
1755
- title: j ? d.label : r.addTriggerTitle,
1756
- icon: /* @__PURE__ */ f(nn, {}),
1757
- width: 500,
1758
- footer: B,
1759
- children: /* @__PURE__ */ y(J, { sx: { p: 2 }, children: [
1760
- !j && /* @__PURE__ */ y(be, { children: [
1761
- /* @__PURE__ */ f("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: r.chooseTrigger }),
1762
- /* @__PURE__ */ y("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: [
1763
- t.map((F) => /* @__PURE__ */ y(
1764
- "div",
1765
- {
1766
- className: "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-start ff-gap-3",
1767
- style: { cursor: p ? "wait" : "pointer", transition: "background 0.15s", opacity: p ? 0.6 : 1 },
1768
- onClick: () => !p && T(F),
1769
- role: "button",
1770
- tabIndex: 0,
1771
- onKeyDown: (D) => {
1772
- D.key === "Enter" && !p && T(F);
1773
- },
1774
- onMouseEnter: (D) => {
1775
- p || (D.currentTarget.style.background = "#f5f5f5");
1776
- },
1777
- onMouseLeave: (D) => {
1778
- D.currentTarget.style.background = "";
1779
- },
1780
- children: [
1781
- /* @__PURE__ */ f("div", { style: { color: F.triggerCategory === "scheduler" ? "#1976d2" : "#f57c00", marginTop: 2, flexShrink: 0 }, children: F.triggerCategory === "scheduler" ? /* @__PURE__ */ f(Yr, { size: 18 }) : /* @__PURE__ */ f(Kr, { size: 18 }) }),
1782
- /* @__PURE__ */ y("div", { children: [
1783
- /* @__PURE__ */ f("div", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: F.label }),
1784
- F.description && /* @__PURE__ */ f("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 }, children: F.description })
1785
- ] })
1786
- ]
1787
- },
1788
- F.triggerKey
1789
- )),
1790
- t.length === 0 && /* @__PURE__ */ f("p", { className: "ff-text-muted ff-text-center", style: { fontSize: 13 }, children: r.noTriggers })
1791
- ] }),
1792
- p && /* @__PURE__ */ y(J, { sx: { display: "flex", alignItems: "center", gap: 1, mt: 2, fontSize: 12, color: "#64748b" }, children: [
1793
- /* @__PURE__ */ f(Wr, { size: 14 }),
1794
- /* @__PURE__ */ f("span", { children: "Loading sources for the selected trigger…" })
1795
- ] }),
1796
- b && /* @__PURE__ */ f("p", { style: { fontSize: 12, color: "#d32f2f", marginTop: 12 }, children: b })
1797
- ] }),
1798
- j && /* @__PURE__ */ y(be, { children: [
1799
- /* @__PURE__ */ y(
1800
- "div",
1801
- {
1802
- role: "button",
1803
- tabIndex: 0,
1804
- onClick: S,
1805
- onKeyDown: (F) => {
1806
- F.key === "Enter" && S();
1807
- },
1808
- className: "ff-d-flex ff-align-items-center ff-gap-1 ff-mb-3",
1809
- style: { cursor: "pointer", color: "#0066cc", fontSize: 13, fontWeight: 500, width: "fit-content" },
1810
- children: [
1811
- /* @__PURE__ */ f(Pt, { size: 16 }),
1812
- /* @__PURE__ */ f("span", { children: r.addTriggerTitle })
1813
- ]
1814
- }
1815
- ),
1816
- /* @__PURE__ */ y("p", { className: "ff-text-muted ff-mb-2", style: { fontSize: 13 }, children: [
1817
- "Pick one or more sources for ",
1818
- /* @__PURE__ */ f("strong", { children: d.label }),
1819
- ":"
1820
- ] }),
1821
- /* @__PURE__ */ f(
1822
- Gr,
1823
- {
1824
- isMulti: !0,
1825
- options: c,
1826
- value: h,
1827
- onChange: (F) => g(F ?? []),
1828
- placeholder: "Select sources…",
1829
- menuPosition: "fixed",
1830
- menuPortalTarget: typeof document < "u" ? document.body : void 0,
1831
- styles: ln(!1, !0)
1832
- }
1833
- )
1834
- ] })
1835
- ] })
1836
- }
1837
- );
1838
- }, Ge = {
1839
- cursor: "pointer",
1840
- transition: "background 0.15s"
1841
- }, $e = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", Pi = ({ open: e, availableDescriptors: t, messages: r, onSelect: n, onClose: o }) => {
1842
- const { apps: i, ungrouped: s } = $(() => {
1843
- const u = /* @__PURE__ */ new Map(), h = [];
1844
- for (const g of t)
1845
- if (g.app) {
1846
- const p = u.get(g.app.key);
1847
- p ? p.descriptors.push(g) : u.set(g.app.key, {
1848
- key: g.app.key,
1849
- label: g.app.label,
1850
- icon: g.app.icon,
1851
- description: g.app.description,
1852
- descriptors: [g]
1853
- });
1854
- } else
1855
- h.push(g);
1856
- return { apps: [...u.values()], ungrouped: h };
1857
- }, [t]), [l, d] = M(null), a = l ? i.find((u) => u.key === l) ?? null : null;
1858
- re(() => {
1859
- e || d(null);
1860
- }, [e]), re(() => {
1861
- d(null);
1862
- }, [t]);
1863
- const c = !a;
1864
- return /* @__PURE__ */ f(
1865
- Me,
1866
- {
1867
- isOpen: e,
1868
- onClose: o,
1869
- title: c ? r.addStepTitle : a.label,
1870
- icon: c ? /* @__PURE__ */ f(Ur, {}) : a.icon ?? /* @__PURE__ */ f(Vr, {}),
1871
- width: 500,
1872
- children: /* @__PURE__ */ y(J, { sx: { p: 2 }, children: [
1873
- !c && /* @__PURE__ */ y(
1874
- "div",
1875
- {
1876
- role: "button",
1877
- tabIndex: 0,
1878
- onClick: () => d(null),
1879
- onKeyDown: (u) => {
1880
- u.key === "Enter" && d(null);
1881
- },
1882
- className: "ff-d-flex ff-align-items-center ff-gap-1 ff-mb-3",
1883
- style: { cursor: "pointer", color: "#0066cc", fontSize: 13, fontWeight: 500, width: "fit-content" },
1884
- children: [
1885
- /* @__PURE__ */ f(Pt, { size: 16 }),
1886
- /* @__PURE__ */ f("span", { children: r.addStepTitle })
1887
- ]
1888
- }
1889
- ),
1890
- /* @__PURE__ */ f("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: c ? r.chooseAction : `Pick an action from ${a.label}` }),
1891
- /* @__PURE__ */ f("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ y(be, { children: [
1892
- i.map((u) => /* @__PURE__ */ y(
1893
- "div",
1894
- {
1895
- className: $e,
1896
- style: Ge,
1897
- onClick: () => d(u.key),
1898
- role: "button",
1899
- tabIndex: 0,
1900
- onKeyDown: (h) => {
1901
- h.key === "Enter" && d(u.key);
1902
- },
1903
- onMouseEnter: (h) => {
1904
- h.currentTarget.style.background = "#f5f5f5";
1905
- },
1906
- onMouseLeave: (h) => {
1907
- h.currentTarget.style.background = "";
1908
- },
1909
- children: [
1910
- u.icon && /* @__PURE__ */ f("div", { style: { flexShrink: 0 }, children: u.icon }),
1911
- /* @__PURE__ */ y("div", { style: { flex: 1, minWidth: 0 }, children: [
1912
- /* @__PURE__ */ f("div", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: u.label }),
1913
- /* @__PURE__ */ f("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 }, children: u.description ?? `${u.descriptors.length} action${u.descriptors.length === 1 ? "" : "s"}` })
1914
- ] }),
1915
- /* @__PURE__ */ f(Bt, { size: 18, color: "#9e9e9e" })
1916
- ]
1917
- },
1918
- `app-${u.key}`
1919
- )),
1920
- s.map((u) => /* @__PURE__ */ y(
1921
- "div",
1922
- {
1923
- className: $e,
1924
- style: Ge,
1925
- onClick: () => n(u),
1926
- role: "button",
1927
- tabIndex: 0,
1928
- onKeyDown: (h) => {
1929
- h.key === "Enter" && n(u);
1930
- },
1931
- onMouseEnter: (h) => {
1932
- h.currentTarget.style.background = "#f5f5f5";
1933
- },
1934
- onMouseLeave: (h) => {
1935
- h.currentTarget.style.background = "";
1936
- },
1937
- children: [
1938
- u.icon && /* @__PURE__ */ f("div", { style: { flexShrink: 0 }, children: u.icon }),
1939
- /* @__PURE__ */ f("span", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: u.label })
1940
- ]
1941
- },
1942
- u.type
1943
- )),
1944
- i.length === 0 && s.length === 0 && /* @__PURE__ */ f("p", { className: "ff-text-muted ff-text-center", style: { fontSize: 13 }, children: r.noActions })
1945
- ] }) : (
1946
- /* Stage 2 — actions for the selected app */
1947
- a.descriptors.map((u) => /* @__PURE__ */ y(
1948
- "div",
1949
- {
1950
- className: $e,
1951
- style: Ge,
1952
- onClick: () => n(u),
1953
- role: "button",
1954
- tabIndex: 0,
1955
- onKeyDown: (h) => {
1956
- h.key === "Enter" && n(u);
1957
- },
1958
- onMouseEnter: (h) => {
1959
- h.currentTarget.style.background = "#f5f5f5";
1960
- },
1961
- onMouseLeave: (h) => {
1962
- h.currentTarget.style.background = "";
1963
- },
1964
- children: [
1965
- u.icon && /* @__PURE__ */ f("div", { style: { flexShrink: 0 }, children: u.icon }),
1966
- /* @__PURE__ */ f("span", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: u.label })
1967
- ]
1968
- },
1969
- u.type
1970
- ))
1971
- ) })
1972
- ] })
1973
- }
1974
- );
1975
- }, Dt = "_conditionConfig", Bi = ({ open: e, nodeId: t, descriptor: r, initialValues: n, messages: o, onSave: i, onClose: s }) => {
1976
- const [l, d] = M([]), [a, c] = M(!1), [u, h] = M(null), [g, p] = M({});
1977
- re(() => {
1978
- p((n == null ? void 0 : n[Dt]) ?? {});
1979
- }, [n, t]), re(() => {
1980
- let T = !1;
1981
- if (h(null), !r || !t) {
1982
- d([]), c(!1);
1983
- return;
1984
- }
1985
- const S = r.formSchema;
1986
- return typeof S == "function" ? (c(!0), S(t).then((z) => {
1987
- T || (d(z), c(!1));
1988
- }).catch((z) => {
1989
- T || (d([]), h(z instanceof Error ? z.message : "Unable to load configuration."), c(!1));
1990
- })) : (d(S), c(!1)), () => {
1991
- T = !0;
1992
- };
1993
- }, [r, t]);
1994
- const m = t ? `node-config-form-${t}` : "node-config-form", b = !a && !u && l.length > 0, v = b ? /* @__PURE__ */ y(be, { children: [
1995
- /* @__PURE__ */ f(_e, { type: "button", variant: "outlined", size: "small", onClick: s, children: o.cancel }),
1996
- /* @__PURE__ */ f(_e, { type: "submit", form: m, variant: "contained", size: "small", children: o.save })
1997
- ] }) : null;
1998
- return /* @__PURE__ */ f(
1999
- Me,
2000
- {
2001
- isOpen: e,
2002
- onClose: s,
2003
- title: (r == null ? void 0 : r.label) ?? o.configureStep,
2004
- icon: r == null ? void 0 : r.icon,
2005
- width: 500,
2006
- footer: v,
2007
- children: /* @__PURE__ */ y(J, { sx: { p: 2 }, children: [
2008
- a && /* @__PURE__ */ f("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.loadingConfiguration }),
2009
- !a && u && /* @__PURE__ */ f("p", { style: { fontSize: 13, color: "#d32f2f" }, children: u }),
2010
- !a && !u && l.length === 0 && /* @__PURE__ */ f("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.noConfigurationNeeded }),
2011
- b && /* @__PURE__ */ f(
2012
- an,
2013
- {
2014
- schema: { layout: "flat", fields: l },
2015
- initialValues: n ?? {},
2016
- formId: m,
2017
- conditionConfig: g,
2018
- onConditionConfigChange: p,
2019
- onSubmit: (T) => {
2020
- if (!t) return;
2021
- const S = Object.keys(g).length > 0;
2022
- i(t, { ...T, [Dt]: S ? g : void 0 }), s();
2023
- }
2024
- }
2025
- )
2026
- ] })
2027
- }
2028
- );
2029
- }, Wi = ({
2030
- isOpen: e,
2031
- onClose: t,
2032
- workflowId: r,
2033
- workflowLabel: n,
2034
- onFetchWorkflow: o
2035
- }) => {
2036
- const [i, s] = M({ status: "idle" });
2037
- return re(() => {
2038
- if (!e || !r) {
2039
- s({ status: "idle" });
2040
- return;
2041
- }
2042
- s({ status: "loading" }), o(r).then((l) => s({ status: "loaded", state: l })).catch((l) => s({ status: "error", message: (l == null ? void 0 : l.message) ?? "Failed to load workflow" }));
2043
- }, [e, r, o]), /* @__PURE__ */ f(
2044
- Me,
2045
- {
2046
- isOpen: e,
2047
- onClose: t,
2048
- title: n ? `Preview: ${n}` : "Sub-Workflow Preview",
2049
- icon: /* @__PURE__ */ f(qr, { size: 18, color: "#00695c" }),
2050
- width: 700,
2051
- children: /* @__PURE__ */ y("div", { style: { height: "100%", display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", padding: 24 }, children: [
2052
- i.status === "idle" && /* @__PURE__ */ f("span", { style: { color: "#9e9e9e", fontSize: 14 }, children: "Select a workflow to preview" }),
2053
- i.status === "loading" && /* @__PURE__ */ y("div", { style: { textAlign: "center", color: "#9e9e9e" }, children: [
2054
- /* @__PURE__ */ f("div", { style: { width: 32, height: 32, borderRadius: "50%", border: "3px solid #e0e0e0", borderTopColor: "#00897b", animation: "spin 0.8s linear infinite", margin: "0 auto 12px" } }),
2055
- /* @__PURE__ */ f("span", { style: { fontSize: 14 }, children: "Loading workflow…" }),
2056
- /* @__PURE__ */ f("style", { children: "@keyframes spin { to { transform: rotate(360deg); } }" })
2057
- ] }),
2058
- i.status === "error" && /* @__PURE__ */ y("div", { style: { textAlign: "center", color: "#c62828" }, children: [
2059
- /* @__PURE__ */ f(Hr, { size: 32, style: { marginBottom: 8 } }),
2060
- /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 14 }, children: i.message })
2061
- ] }),
2062
- i.status === "loaded" && /* @__PURE__ */ f("div", { style: { width: "100%", flex: 1 }, children: /* @__PURE__ */ f(Gi, { state: i.state }) })
2063
- ] })
2064
- }
2065
- );
2066
- }, Gi = ({ state: e }) => {
2067
- const [t, r] = M(null), [n, o] = M(null);
2068
- return re(() => {
2069
- Promise.all([
2070
- Promise.resolve().then(() => Hi).then((i) => i.default),
2071
- import("./nodeRegistry.js").then((i) => i.nodeTypeRegistry),
2072
- import("./templateRegistry.js").then((i) => i.templateRegistry)
2073
- ]).then(([i, s, l]) => {
2074
- r(() => i), o({ nodeTypeRegistry: s, templateRegistry: l });
2075
- });
2076
- }, []), !t || !n ? /* @__PURE__ */ f("div", { style: { color: "#9e9e9e", fontSize: 13, textAlign: "center" }, children: "Loading canvas…" }) : /* @__PURE__ */ f("div", { style: { width: "100%", height: 480, border: "1px solid #e0e0e0", borderRadius: 8, overflow: "hidden" }, children: /* @__PURE__ */ f(
2077
- t,
2078
- {
2079
- nodeRegistry: n.nodeTypeRegistry,
2080
- templateRegistry: n.templateRegistry,
2081
- initialValue: e,
2082
- readOnly: !0
2083
- }
2084
- ) });
2085
- }, me = 350, Ue = 70, Ve = 60, He = {
2086
- startNode: 40,
2087
- endNode: 40,
2088
- addTriggerNode: 56,
2089
- triggerNode: 110,
2090
- actionNode: 90,
2091
- filterNode: 90,
2092
- approvalNode: 90,
2093
- delayNode: 80,
2094
- notificationNode: 80
2095
- }, $i = {
2096
- plusEdge: Rr,
2097
- labelPlusEdge: Lr,
2098
- plainEdge: Dr,
2099
- edgeWithPlusLabel: Fr,
2100
- gatewayBranchEdge: zr
2101
- };
2102
- function Lt() {
2103
- return [
2104
- { id: "start", kind: "start", reactFlowType: "startNode" },
2105
- { id: "addTrigger", kind: "addTrigger", reactFlowType: "addTriggerNode" },
2106
- { id: "end", kind: "end", reactFlowType: "endNode" }
2107
- ];
2108
- }
2109
- function Yi(e, t, r, n = "TB") {
2110
- const o = new Ft.graphlib.Graph();
2111
- return o.setGraph({ rankdir: n, ranksep: 70, nodesep: 50 }), o.setDefaultEdgeLabel(() => ({})), e.forEach((i) => {
2112
- const s = r[i.id] ?? { width: me, height: He[i.type ?? ""] ?? 80 };
2113
- o.setNode(i.id, { width: s.width, height: s.height });
2114
- }), t.forEach((i) => o.setEdge(i.source, i.target)), Ft.layout(o), e.map((i) => {
2115
- var a, c;
2116
- const s = o.node(i.id), l = ((a = r[i.id]) == null ? void 0 : a.width) ?? me, d = ((c = r[i.id]) == null ? void 0 : c.height) ?? He[i.type ?? ""] ?? 80;
2117
- return { ...i, position: { x: s.x - l / 2, y: s.y - d / 2 } };
2118
- });
2119
- }
2120
- const se = (e) => e === "filter" || e === "approval";
2121
- function Ki(e, t, r, n) {
2122
- const s = Ue, l = 30, d = 30, a = {}, c = {}, u = /* @__PURE__ */ new Map();
2123
- for (const b of e) u.set(b.id, b);
2124
- for (const b of Object.values(t))
2125
- for (const v of Object.values(b))
2126
- for (const T of v) u.set(T.id, T);
2127
- const h = (b, v, T) => {
2128
- const S = n[b] ?? { width: me, height: 80 };
2129
- return a[b] = { x: v - S.width / 2, y: T }, T + S.height;
2130
- }, g = (b, v, T) => {
2131
- let S = T;
2132
- for (const z of b)
2133
- S = h(z.id, v, S) + s, se(z.kind) && t[z.id] && (S = p(z.id, v, S));
2134
- return S;
2135
- }, p = (b, v, T) => {
2136
- const S = v + 180, z = t[b], j = Object.keys(z), B = u.get(b), F = (B == null ? void 0 : B.branchLabels) ?? { pass: "Pass", fail: "Fail" }, D = a[b], L = n[b] ?? { height: 80 }, ve = D.y + L.height, Ee = [];
2137
- let Q = T;
2138
- return j.forEach((ae, ge) => {
2139
- const ne = z[ae], R = Q;
2140
- Ee.push({
2141
- y: R - ve,
2142
- label: F[ae] ?? ae,
2143
- isPass: ge === 0
2144
- }), Q = g(ne, S, Q + d), ge < j.length - 1 && (Q += l);
2145
- }), c[b] = {
2146
- branches: Ee,
2147
- height: Q - ve,
2148
- indent: 180
2149
- }, Q;
2150
- };
2151
- let m = Ve;
2152
- for (const b of e)
2153
- m = h(b.id, 400, m) + s, se(b.kind) && t[b.id] && (m = p(b.id, 400, m));
2154
- return {
2155
- nodes: r.map((b) => a[b.id] ? { ...b, position: a[b.id] } : b),
2156
- railSpecs: c
2157
- };
2158
- }
2159
- function Rt(e) {
2160
- return {
2161
- id: e.id,
2162
- type: e.reactFlowType,
2163
- position: { x: 0, y: 0 },
2164
- data: { ...e.nodeData, ...e.formData, descriptorType: e.descriptorType },
2165
- draggable: !1,
2166
- selectable: !1
2167
- };
2168
- }
2169
- function Ui(e, t, r, n, o) {
2170
- return {
2171
- id: `e-${e.id}-${t.id}`,
2172
- source: e.id,
2173
- target: t.id,
2174
- type: "plusEdge",
2175
- style: { stroke: r },
2176
- data: {
2177
- onAddStepClick: n,
2178
- referenceNodeType: e.reactFlowType,
2179
- ...o ?? {}
2180
- }
2181
- };
2182
- }
2183
- function Vi(e, t, r, n, o = {}, i = "TB", s = "horizontal") {
2184
- const l = o.edgeColor ?? "#b0bec5", d = [], a = [], c = (p, m) => {
2185
- const b = t[p];
2186
- if (!b) return;
2187
- const T = m ?? { pass: "Pass", fail: "Fail" }, S = Object.keys(b), z = (j, B, F, D) => {
2188
- if (j.length !== 0) {
2189
- j.forEach((L) => d.push(Rt(L))), a.push({
2190
- id: `e-${p}-${B}-start`,
2191
- source: p,
2192
- target: j[0].id,
2193
- type: "gatewayBranchEdge",
2194
- style: { stroke: l },
2195
- data: { branch: B, filterId: p, label: F, isFirst: D === 0, onAddStepClick: r, verticalRouting: s === "vertical" }
2196
- });
2197
- for (let L = 1; L < j.length; L++)
2198
- se(j[L - 1].kind) || a.push(Ui(j[L - 1], j[L], l, r, { filterId: p, branch: B }));
2199
- for (const L of j)
2200
- se(L.kind) && t[L.id] && c(L.id, L.branchLabels);
2201
- }
2202
- };
2203
- S.forEach((j, B) => {
2204
- z(b[j], j, T[j] ?? j, B);
2205
- });
2206
- };
2207
- for (let p = 0; p < e.length; p++) {
2208
- const m = e[p];
2209
- if (d.push(Rt(m)), p > 0) {
2210
- const b = e[p - 1], v = b.kind === "start" || b.kind === "addTrigger";
2211
- if (b.kind === "filter" || b.kind === "approval") continue;
2212
- a.push({
2213
- id: `e-${b.id}-${m.id}`,
2214
- source: b.id,
2215
- target: m.id,
2216
- type: v ? "plainEdge" : "plusEdge",
2217
- style: { stroke: l },
2218
- data: v ? {} : {
2219
- onAddStepClick: r,
2220
- referenceNodeType: b.reactFlowType
2221
- }
2222
- });
2223
- }
2224
- (m.kind === "filter" || m.kind === "approval") && t[m.id] && c(m.id, m.branchLabels);
2225
- }
2226
- const u = {};
2227
- if (d.forEach((p) => {
2228
- u[p.id] = {
2229
- width: me,
2230
- height: n[p.id] ?? He[p.type ?? ""] ?? 80
2231
- };
2232
- }), !(Object.keys(t).length > 0)) {
2233
- if (i === "LR") {
2234
- let T = Ve;
2235
- return { nodes: d.map((z) => {
2236
- const j = u[z.id].width, B = u[z.id].height, F = { ...z, position: { x: T, y: 300 - B / 2 } };
2237
- return T += j + Ue, F;
2238
- }), edges: a };
2239
- }
2240
- const p = 400;
2241
- let m = Ve;
2242
- return { nodes: d.map((v) => {
2243
- const T = u[v.id].height, S = { ...v, position: { x: p - me / 2, y: m } };
2244
- return m += T + Ue, S;
2245
- }), edges: a };
2246
- }
2247
- if (s === "vertical") {
2248
- const { nodes: p, railSpecs: m } = Ki(e, t, d, u);
2249
- return { nodes: p.map(
2250
- (v) => m[v.id] ? { ...v, data: { ...v.data, _branchRail: m[v.id] } } : v
2251
- ), edges: a };
2252
- }
2253
- return { nodes: Yi(d, a, u, i), edges: a };
2254
- }
2255
- const At = ({
2256
- nodeRegistry: e,
2257
- templateRegistry: t,
2258
- initialValue: r,
2259
- nodeTypes: n,
2260
- edgeTypes: o,
2261
- onSave: i,
2262
- readOnly: s = !1,
2263
- theme: l = {},
2264
- messages: d,
2265
- canvasOptions: a = {},
2266
- renderTriggerSelector: c,
2267
- loadTriggerSources: u,
2268
- renderNodePicker: h,
2269
- renderNodeConfig: g,
2270
- onNodeClick: p,
2271
- maxNodes: m,
2272
- layoutDirection: b = "TB",
2273
- executionRecord: v,
2274
- onFetchWorkflow: T
2275
- }) => {
2276
- const {
2277
- fitView: S = !0,
2278
- fitViewPadding: z = 0.3,
2279
- showControls: j = !0,
2280
- showMiniMap: B = !1,
2281
- panOnScroll: F = !0,
2282
- zoomOnScroll: D = !1,
2283
- minZoom: L = 0.25,
2284
- maxZoom: ve = 2,
2285
- snapToGrid: Ee = !1,
2286
- snapGrid: Q = [15, 15],
2287
- branchLayout: ae = "horizontal",
2288
- nodeBody: ge = "full"
2289
- } = a, ne = $(() => dn(d), [d]), [R, oe] = M(() => (r == null ? void 0 : r.slots) ?? Lt()), [H, q] = M(() => (r == null ? void 0 : r.branches) ?? {}), [de, K] = M(null), [je, tt] = M(null), [ce, ke] = M(null), [ze, rt] = M(null), [xe, nt] = M(null), [ee, ot] = M(() => {
2290
- const w = r == null ? void 0 : r.slots.find((x) => x.kind === "triggerFixed"), E = w != null && w.id.startsWith("trigger-") ? w.id.slice(8) : void 0;
2291
- return E ? t.lookup(E) ?? null : null;
2292
- }), [it, mr] = M({}), wr = U((w) => {
2293
- mr(w);
2294
- }, []), vr = $(() => ({ ...jr, ...n }), [n]), Er = $(() => ({ ...$i, ...o }), [o]), kr = $(() => {
2295
- const w = R.filter((x) => x.kind === "userTask").length, E = Object.values(H).flatMap((x) => Object.values(x).flat()).filter((x) => x.kind === "userTask").length;
2296
- return w + E;
2297
- }, [R, H]), st = m ?? (ee == null ? void 0 : ee.maxTasks), lt = st !== void 0 && kr >= st, ie = U((w) => {
2298
- const E = R.find((x) => x.id === w);
2299
- if (E) return E;
2300
- for (const x of Object.values(H)) {
2301
- const C = Object.values(x).flat().find((k) => k.id === w);
2302
- if (C) return C;
2303
- }
2304
- return null;
2305
- }, [R, H]), Fe = U((w) => {
2306
- s || (tt(w), K("nodeConfig"));
2307
- }, [s]), at = U((w) => {
2308
- if (!s) {
2309
- if (R.some((E) => E.id === w)) {
2310
- const E = R.find((x) => x.id === w);
2311
- if ((E == null ? void 0 : E.kind) === "triggerFixed") {
2312
- oe(Lt()), q({}), ot(null);
2313
- return;
2314
- }
2315
- oe((x) => {
2316
- const C = x.filter((k) => k.id !== w);
2317
- return se((E == null ? void 0 : E.kind) ?? "") && !C.some((k) => k.kind === "end") ? [...C, { id: "end", kind: "end", reactFlowType: "endNode" }] : C;
2318
- }), q((x) => {
2319
- const C = { ...x }, k = (_) => {
2320
- C[_] && (Object.values(C[_]).flat().filter((N) => se(N.kind)).forEach((N) => k(N.id)), delete C[_]);
2321
- };
2322
- return k(w), C;
2323
- });
2324
- return;
2325
- }
2326
- q((E) => {
2327
- const x = (k, _) => {
2328
- const N = [];
2329
- for (const I of k)
2330
- se(I.kind) && _[I.id] && (N.push(I.id), Object.values(_[I.id]).forEach((O) => N.push(...x(O, _))));
2331
- return N;
2332
- }, C = { ...E };
2333
- for (const k of Object.keys(C))
2334
- for (const _ of Object.keys(C[k])) {
2335
- const N = C[k][_], I = N.findIndex((W) => W.id === w);
2336
- if (I === -1 || N[I].kind === "end") continue;
2337
- const O = N[I];
2338
- let A = N.filter((W) => W.id !== w);
2339
- return O.kind === "filter" && ((O.id in C ? x([O], C) : []).forEach((P) => delete C[P]), delete C[O.id], A.some((P) => P.kind === "end") || (A = [...A, { id: `end-${k}-${_}`, kind: "end", reactFlowType: "endNode" }])), C[k] = { ...C[k], [_]: A }, C;
2340
- }
2341
- return C;
2342
- });
2343
- }
2344
- }, [s, R]), De = U(() => {
2345
- s || K("triggerSelect");
2346
- }, [s]), dt = U((w, E) => {
2347
- s || lt || (ke(w), rt(E.filterId && E.branch ? { filterId: E.filterId, branch: E.branch } : null), K("nodePicker"));
2348
- }, [s, lt]), ct = U((w, E) => {
2349
- if (ot(w), K(null), w.skeletonState) {
2350
- const C = (w.skeletonState.slots ?? []).map((k) => k.kind === "triggerFixed" && Array.isArray(E) && E.length > 0 ? {
2351
- ...k,
2352
- nodeData: {
2353
- ...k.nodeData ?? {},
2354
- sources: E
2355
- }
2356
- } : k);
2357
- q(w.skeletonState.branches ?? {}), oe(C);
2358
- return;
2359
- }
2360
- q({});
2361
- const x = Array.isArray(E) && E.length > 0;
2362
- oe([
2363
- { id: "start", kind: "start", reactFlowType: "startNode" },
2364
- {
2365
- id: `trigger-${w.triggerKey}`,
2366
- kind: "triggerFixed",
2367
- reactFlowType: "triggerNode",
2368
- nodeData: {
2369
- label: w.label,
2370
- source: w.source,
2371
- eventType: w.triggerKey,
2372
- type: w.triggerCategory === "scheduler" ? "scheduler" : "event",
2373
- ...x && { sources: E }
2374
- },
2375
- deletable: !1
2376
- },
2377
- { id: "end", kind: "end", reactFlowType: "endNode" }
2378
- ]);
2379
- }, []), ut = U(() => {
2380
- const w = e.list();
2381
- return (ee != null && ee.availableTasks ? w.filter((x) => ee.availableTasks.includes(x.type)) : w).filter((x) => x.maxPerWorkflow === void 0 ? !0 : R.filter((k) => k.descriptorType === x.type).length + Object.values(H).flatMap((k) => Object.values(k).flat()).filter((k) => k.descriptorType === x.type).length < x.maxPerWorkflow);
2382
- }, [e, ee, R, H]), ft = U((w) => {
2383
- if (!ce) return;
2384
- const E = `${w.type}-${Date.now()}`, x = w.reactFlowType === "filterNode" || w.reactFlowType === "approvalNode" || w.reactFlowType === "conditionBranchNode", C = w.branchLabels ?? { pass: "Pass", fail: "Fail" }, k = {
2385
- id: E,
2386
- kind: x ? w.reactFlowType === "approvalNode" ? "approval" : "filter" : "userTask",
2387
- reactFlowType: w.reactFlowType,
2388
- descriptorType: w.type,
2389
- formData: {},
2390
- nodeData: { title: w.label },
2391
- deletable: !0,
2392
- branchLabels: C
2393
- };
2394
- if (ze) {
2395
- const { filterId: _, branch: N } = ze;
2396
- q((I) => {
2397
- const O = [...I[_][N]];
2398
- if (x) {
2399
- const te = O.filter((ue) => ue.kind !== "end"), yt = te.findIndex((ue) => ue.id === ce), _r = yt === -1 ? te.length : yt + 1;
2400
- return te.splice(_r, 0, k), {
2401
- ...I,
2402
- [_]: { ...I[_], [N]: te },
2403
- [E]: Object.fromEntries(
2404
- Object.keys(C).map((ue) => [ue, [{ id: `end-${E}-${ue}`, kind: "end", reactFlowType: "endNode" }]])
2405
- )
2406
- };
2407
- }
2408
- const A = O.findIndex((te) => te.id === ce), W = O.findIndex((te) => te.kind === "end"), P = A === -1 ? W === -1 ? O.length : W : A + 1;
2409
- return O.splice(P, 0, k), { ...I, [_]: { ...I[_], [N]: O } };
2410
- });
2411
- } else
2412
- x ? (oe((_) => {
2413
- const N = _.findIndex((O) => O.id === ce);
2414
- return [..._.filter((O) => O.kind !== "end").slice(0, N + 1), k];
2415
- }), q((_) => ({
2416
- ..._,
2417
- [E]: Object.fromEntries(
2418
- Object.keys(C).map((N) => [N, [{ id: `end-${E}-${N}`, kind: "end", reactFlowType: "endNode" }]])
2419
- )
2420
- }))) : oe((_) => {
2421
- const N = _.findIndex((I) => I.id === ce);
2422
- return N === -1 ? _ : [..._.slice(0, N + 1), k, ..._.slice(N + 1)];
2423
- });
2424
- ke(null), rt(null), tt(E), K("nodeConfig");
2425
- }, [ce, ze]), ht = U((w, E) => {
2426
- const x = (k) => {
2427
- const _ = ie(w);
2428
- if ((_ == null ? void 0 : _.descriptorType) !== "conditionBranch") return k;
2429
- const N = E.branchConfigs ?? [], I = N.map((P) => P.key).filter(Boolean);
2430
- if (I.length === 0) return k;
2431
- const O = k[w] ?? {}, A = {};
2432
- I.forEach((P) => {
2433
- A[P] = O[P] ?? [{ id: `end-${w}-${P}`, kind: "end", reactFlowType: "endNode" }];
2434
- });
2435
- const W = {};
2436
- return N.forEach((P) => {
2437
- P.key && (W[P.key] = P.label || P.key);
2438
- }), { ...k, [w]: A };
2439
- }, C = (k, _) => {
2440
- if (k.descriptorType !== "conditionBranch") return { ...k, formData: _ };
2441
- const N = _.branchConfigs ?? [], I = {};
2442
- return N.forEach((O) => {
2443
- O.key && (I[O.key] = O.label || O.key);
2444
- }), { ...k, formData: _, branchLabels: I };
2445
- };
2446
- if (R.some((k) => k.id === w)) {
2447
- q((k) => {
2448
- const _ = x(k);
2449
- return oe((N) => {
2450
- const I = N.map((O) => O.id === w ? C(O, E) : O);
2451
- return i == null || i({ slots: I, branches: _ }), I;
2452
- }), _;
2453
- });
2454
- return;
2455
- }
2456
- q((k) => {
2457
- const N = { ...x(k) };
2458
- for (const I of Object.keys(N)) {
2459
- const O = (A) => A.map((W) => W.id === w ? C(W, E) : W);
2460
- for (const A of Object.keys(N[I]))
2461
- if (N[I][A].some((W) => W.id === w))
2462
- return N[I] = { ...N[I], [A]: O(N[I][A]) }, i == null || i({ slots: R, branches: N }), N;
2463
- }
2464
- return N;
2465
- });
2466
- }, [R, H, ie, i]), X = $(() => ie(je ?? ""), [ie, je]), gt = $(() => X != null && X.descriptorType ? e.forType(X.descriptorType) ?? null : null, [X, e]), { nodes: pt, edges: xr } = $(
2467
- () => Vi(R, H, s ? null : dt, it, l, b, ae),
2468
- [R, H, s, dt, it, l, b, ae]
2469
- ), bt = $(() => {
2470
- const w = v ? new Map(v.steps.map((E) => [E.nodeId, E])) : null;
2471
- return pt.map((E) => {
2472
- let x = {};
2473
- if (w) {
2474
- const C = w.get(E.id);
2475
- C && (x = { _executionStatus: C.status, _executionError: C.error });
2476
- }
2477
- return E.type === "subWorkflowNode" && T && (x.onPreview = (C) => {
2478
- var _;
2479
- const k = ie(E.id);
2480
- nt({ workflowId: C, workflowLabel: ((_ = k == null ? void 0 : k.formData) == null ? void 0 : _.workflowLabel) ?? void 0 });
2481
- }), Object.keys(x).length > 0 ? { ...E, data: { ...E.data, ...x } } : E;
2482
- });
2483
- }, [pt, v, T, ie]), Tr = $(() => ({ onEditNode: Fe, onDeleteNode: at, onAddStep: () => {
2484
- }, onClickAddTrigger: De, messages: ne, nodeRegistry: e, nodeBody: ge }), [Fe, at, De, ne, e, ge]);
2485
- return /* @__PURE__ */ f(Ar.Provider, { value: Tr, children: /* @__PURE__ */ y(
2486
- "div",
2487
- {
2488
- className: "flowforge-canvas",
2489
- style: {
2490
- width: "100%",
2491
- height: "100%",
2492
- position: "relative",
2493
- // CSS variable consumed by edge SCSS for primary/hover color
2494
- "--ff-primary": l.primaryColor ?? "#1dbf60",
2495
- "--ff-edge-color": l.edgeColor ?? "#b0bec5",
2496
- "--ff-text": l.textColor ?? "#212121",
2497
- "--ff-muted": l.mutedTextColor ?? "#9ca3af",
2498
- "--ff-surface": l.surfaceColor ?? "#fff",
2499
- "--ff-border": l.borderColor ?? "#dee2e6",
2500
- "--ff-danger": l.dangerColor ?? "#d32f2f",
2501
- "--ff-radius": `${l.borderRadius ?? 6}px`,
2502
- "--ff-font-family": l.fontFamily
2503
- },
2504
- children: [
2505
- /* @__PURE__ */ y(
2506
- Nr,
2507
- {
2508
- nodes: bt,
2509
- edges: xr,
2510
- nodeTypes: vr,
2511
- edgeTypes: Er,
2512
- fitView: S,
2513
- fitViewOptions: { padding: z },
2514
- nodesDraggable: !1,
2515
- nodesConnectable: !1,
2516
- panOnScroll: F,
2517
- zoomOnScroll: D,
2518
- minZoom: L,
2519
- maxZoom: ve,
2520
- snapToGrid: Ee,
2521
- snapGrid: Q,
2522
- proOptions: { hideAttribution: !0 },
2523
- onNodeClick: (w, E) => {
2524
- const x = ie(E.id);
2525
- x && (p != null && p(x) || (x.kind === "addTrigger" || x.kind === "triggerFixed" ? De() : (x.kind === "userTask" || x.kind === "filter" || x.kind === "approval") && Fe(E.id)));
2526
- },
2527
- children: [
2528
- l.background !== "none" && /* @__PURE__ */ f(
2529
- Ir,
2530
- {
2531
- variant: l.background,
2532
- color: l.backgroundColor ?? "#e0e0e0",
2533
- gap: 20
2534
- }
2535
- ),
2536
- j && /* @__PURE__ */ f(Or, { showInteractive: !1 }),
2537
- B && /* @__PURE__ */ f(Mr, { zoomable: !0, pannable: !0 }),
2538
- /* @__PURE__ */ f(Ri, { onHeightsReady: wr, nodeCount: bt.length })
2539
- ]
2540
- }
2541
- ),
2542
- c ? de === "triggerSelect" && c(t.list(), ct, () => K(null)) : /* @__PURE__ */ f(Ai, { open: de === "triggerSelect", templates: t.list(), messages: ne, onSelect: ct, onClose: () => K(null), loadTriggerSources: u }),
2543
- h ? de === "nodePicker" && h(ut(), ft, () => {
2544
- K(null), ke(null);
2545
- }) : /* @__PURE__ */ f(Pi, { open: de === "nodePicker", availableDescriptors: ut(), messages: ne, onSelect: ft, onClose: () => {
2546
- K(null), ke(null);
2547
- } }),
2548
- g ? de === "nodeConfig" && g(gt ?? void 0, X, ht, () => K(null)) : /* @__PURE__ */ f(Bi, { open: de === "nodeConfig", nodeId: je, descriptor: gt, initialValues: X == null ? void 0 : X.formData, messages: ne, onSave: ht, onClose: () => K(null) }),
2549
- T && xe && /* @__PURE__ */ f(
2550
- Wi,
2551
- {
2552
- isOpen: !!xe,
2553
- onClose: () => nt(null),
2554
- workflowId: xe.workflowId,
2555
- workflowLabel: xe.workflowLabel,
2556
- onFetchWorkflow: T
2557
- }
2558
- )
2559
- ]
2560
- }
2561
- ) });
2562
- }, Hi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
2563
- __proto__: null,
2564
- WorkflowCanvas: At,
2565
- default: At
2566
- }, Symbol.toStringTag, { value: "Module" })), Ye = "All";
2567
- function qi({ template: e, onSelect: t }) {
2568
- var o, i;
2569
- const r = e.triggerCategory ? cn[e.triggerCategory] : null, n = ((o = e.skeletonState) == null ? void 0 : o.slots.filter((s) => s.kind === "userTask").length) ?? 0;
2570
- return /* @__PURE__ */ y(
2571
- "div",
2572
- {
2573
- role: "button",
2574
- tabIndex: 0,
2575
- onClick: t,
2576
- onKeyDown: (s) => {
2577
- (s.key === "Enter" || s.key === " ") && t();
2578
- },
2579
- style: {
2580
- border: "1.5px solid #e0e0e0",
2581
- borderRadius: 10,
2582
- padding: "16px",
2583
- background: "#fff",
2584
- cursor: "pointer",
2585
- transition: "border-color 0.15s, box-shadow 0.15s",
2586
- display: "flex",
2587
- flexDirection: "column",
2588
- gap: 8,
2589
- outline: "none"
2590
- },
2591
- onMouseEnter: (s) => {
2592
- s.currentTarget.style.borderColor = "#1976d2", s.currentTarget.style.boxShadow = "0 2px 8px rgba(25,118,210,0.12)";
2593
- },
2594
- onMouseLeave: (s) => {
2595
- s.currentTarget.style.borderColor = "#e0e0e0", s.currentTarget.style.boxShadow = "none";
2596
- },
2597
- children: [
2598
- /* @__PURE__ */ y("div", { style: { display: "flex", alignItems: "flex-start", gap: 10 }, children: [
2599
- e.icon && /* @__PURE__ */ f("div", { style: { flexShrink: 0, width: 36, height: 36, borderRadius: 8, background: "#f5f5f5", display: "flex", alignItems: "center", justifyContent: "center" }, children: e.icon }),
2600
- /* @__PURE__ */ y("div", { style: { flex: 1, minWidth: 0 }, children: [
2601
- /* @__PURE__ */ f("div", { style: { fontWeight: 600, fontSize: 14, color: "#212121", marginBottom: 2 }, children: e.label }),
2602
- e.description && /* @__PURE__ */ f("div", { style: { fontSize: 12, color: "#757575", lineHeight: 1.4, display: "-webkit-box", WebkitLineClamp: 2, WebkitBoxOrient: "vertical", overflow: "hidden" }, children: e.description })
2603
- ] })
2604
- ] }),
2605
- /* @__PURE__ */ y("div", { style: { display: "flex", alignItems: "center", flexWrap: "wrap", gap: 4 }, children: [
2606
- r && /* @__PURE__ */ f("span", { style: { fontSize: 10, fontWeight: 600, padding: "2px 7px", borderRadius: 10, background: r.bg, color: r.color }, children: r.label }),
2607
- (i = e.tags) == null ? void 0 : i.map((s) => /* @__PURE__ */ f("span", { style: { fontSize: 10, padding: "2px 7px", borderRadius: 10, background: "#f5f5f5", color: "#616161" }, children: s }, s)),
2608
- n > 0 && /* @__PURE__ */ y("span", { style: { fontSize: 10, color: "#9e9e9e", marginLeft: "auto" }, children: [
2609
- n,
2610
- " step",
2611
- n !== 1 ? "s" : ""
2612
- ] })
2613
- ] }),
2614
- e.author && /* @__PURE__ */ y("div", { style: { fontSize: 11, color: "#bdbdbd" }, children: [
2615
- "by ",
2616
- e.author
2617
- ] })
2618
- ]
2619
- }
2620
- );
2621
- }
2622
- const fs = ({
2623
- templates: e,
2624
- onSelectTemplate: t,
2625
- onStartFromScratch: r
2626
- }) => {
2627
- const [n, o] = M(""), [i, s] = M(Ye), l = $(() => {
2628
- const a = /* @__PURE__ */ new Set();
2629
- return e.forEach((c) => {
2630
- c.category && a.add(c.category);
2631
- }), [Ye, ...Array.from(a)];
2632
- }, [e]), d = $(() => {
2633
- let a = e;
2634
- if (i !== Ye && (a = a.filter((c) => c.category === i)), n.trim()) {
2635
- const c = n.toLowerCase();
2636
- a = a.filter(
2637
- (u) => {
2638
- var h, g;
2639
- return u.label.toLowerCase().includes(c) || ((h = u.description) == null ? void 0 : h.toLowerCase().includes(c)) || ((g = u.tags) == null ? void 0 : g.some((p) => p.toLowerCase().includes(c)));
2640
- }
2641
- );
2642
- }
2643
- return [...a].sort((c, u) => (u.popularity ?? 0) - (c.popularity ?? 0));
2644
- }, [e, i, n]);
2645
- return /* @__PURE__ */ y("div", { style: { display: "flex", flexDirection: "column", height: "100%", fontFamily: "inherit" }, children: [
2646
- /* @__PURE__ */ y("div", { style: { padding: "24px 24px 0", borderBottom: "1px solid #f0f0f0", paddingBottom: 16 }, children: [
2647
- /* @__PURE__ */ y("div", { style: { display: "flex", alignItems: "center", justifyContent: "space-between", marginBottom: 16 }, children: [
2648
- /* @__PURE__ */ y("div", { children: [
2649
- /* @__PURE__ */ f("h2", { style: { margin: 0, fontSize: 20, fontWeight: 700, color: "#212121" }, children: "Workflow Templates" }),
2650
- /* @__PURE__ */ f("p", { style: { margin: "4px 0 0", fontSize: 13, color: "#757575" }, children: "Choose a pre-built template or start from scratch" })
2651
- ] }),
2652
- r && /* @__PURE__ */ y(
2653
- "button",
2654
- {
2655
- onClick: r,
2656
- style: { display: "flex", alignItems: "center", gap: 6, padding: "8px 16px", border: "1.5px solid #1976d2", borderRadius: 6, background: "#fff", color: "#1976d2", fontSize: 13, fontWeight: 600, cursor: "pointer" },
2657
- children: [
2658
- /* @__PURE__ */ f(Xr, { size: 16 }),
2659
- "Start from Scratch"
2660
- ]
2661
- }
2662
- )
2663
- ] }),
2664
- /* @__PURE__ */ y("div", { style: { display: "flex", alignItems: "center", gap: 8, background: "#f5f5f5", borderRadius: 8, padding: "8px 12px", marginBottom: 12 }, children: [
2665
- /* @__PURE__ */ f(Jr, { size: 18, color: "#9e9e9e" }),
2666
- /* @__PURE__ */ f(
2667
- "input",
2668
- {
2669
- value: n,
2670
- onChange: (a) => o(a.target.value),
2671
- placeholder: "Search templates...",
2672
- style: { border: "none", background: "transparent", outline: "none", fontSize: 14, color: "#212121", flex: 1 }
2673
- }
2674
- )
2675
- ] }),
2676
- l.length > 1 && /* @__PURE__ */ f("div", { style: { display: "flex", gap: 4, flexWrap: "wrap" }, children: l.map((a) => /* @__PURE__ */ f(
2677
- "button",
2678
- {
2679
- onClick: () => s(a),
2680
- style: {
2681
- padding: "4px 12px",
2682
- borderRadius: 20,
2683
- border: "1.5px solid",
2684
- borderColor: i === a ? "#1976d2" : "#e0e0e0",
2685
- background: i === a ? "#e3f2fd" : "#fff",
2686
- color: i === a ? "#1565c0" : "#616161",
2687
- fontSize: 12,
2688
- fontWeight: i === a ? 600 : 400,
2689
- cursor: "pointer"
2690
- },
2691
- children: a
2692
- },
2693
- a
2694
- )) })
2695
- ] }),
2696
- /* @__PURE__ */ f("div", { style: { flex: 1, overflowY: "auto", padding: 24 }, children: d.length === 0 ? /* @__PURE__ */ y("div", { style: { textAlign: "center", padding: "40px 0", color: "#9e9e9e" }, children: [
2697
- /* @__PURE__ */ f(Zr, { size: 36, style: { marginBottom: 8 } }),
2698
- /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 14 }, children: "No templates found" })
2699
- ] }) : /* @__PURE__ */ f("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 }, children: d.map((a) => /* @__PURE__ */ f(qi, { template: a, onSelect: () => t(a) }, a.triggerKey)) }) })
2700
- ] });
2701
- }, Te = {
2702
- running: { label: "Running", color: Z.running, icon: G.createElement(Yt, { size: 14 }) },
2703
- success: { label: "Success", color: Z.success, icon: G.createElement($t, { size: 14 }) },
2704
- failed: { label: "Failed", color: Z.failed, icon: G.createElement(Gt, { size: 14 }) },
2705
- cancelled: { label: "Cancelled", color: Z.cancelled, icon: G.createElement(Wt, { size: 14 }) }
2706
- }, Xi = {
2707
- pending: { color: Z.pending, icon: G.createElement(Qr, { size: 14 }) },
2708
- running: { color: Z.running, icon: G.createElement(Yt, { size: 14 }) },
2709
- success: { color: Z.success, icon: G.createElement($t, { size: 14 }) },
2710
- failed: { color: Z.failed, icon: G.createElement(Gt, { size: 14 }) },
2711
- skipped: { color: Z.skipped, icon: G.createElement(Wt, { size: 14 }) }
2712
- };
2713
- function qe(e) {
2714
- try {
2715
- return new Date(e).toLocaleString();
2716
- } catch {
2717
- return e;
2718
- }
2719
- }
2720
- function yr(e, t) {
2721
- try {
2722
- const r = new Date(t ?? (/* @__PURE__ */ new Date()).toISOString()).getTime() - new Date(e).getTime();
2723
- return r < 1e3 ? `${r}ms` : r < 6e4 ? `${(r / 1e3).toFixed(1)}s` : `${Math.floor(r / 6e4)}m ${Math.floor(r % 6e4 / 1e3)}s`;
2724
- } catch {
2725
- return "—";
2726
- }
2727
- }
2728
- function Ji({ step: e }) {
2729
- const [t, r] = M(!1), n = Xi[e.status], o = !!(e.inputs || e.outputs || e.error);
2730
- return /* @__PURE__ */ y("div", { style: { borderBottom: "1px solid #f5f5f5" }, children: [
2731
- /* @__PURE__ */ y(
2732
- "div",
2733
- {
2734
- style: { display: "flex", alignItems: "center", gap: 8, padding: "8px 12px", cursor: o ? "pointer" : "default" },
2735
- onClick: () => {
2736
- o && r((i) => !i);
2737
- },
2738
- role: o ? "button" : void 0,
2739
- tabIndex: o ? 0 : void 0,
2740
- onKeyDown: (i) => {
2741
- o && (i.key === "Enter" || i.key === " ") && r((s) => !s);
2742
- },
2743
- children: [
2744
- /* @__PURE__ */ f("span", { style: { color: n.color, flexShrink: 0 }, children: G.cloneElement(n.icon, { color: n.color }) }),
2745
- /* @__PURE__ */ f("span", { style: { flex: 1, fontSize: 13, color: "#212121" }, children: e.label || e.nodeId }),
2746
- e.branchTaken && /* @__PURE__ */ f("span", { style: { fontSize: 10, padding: "1px 6px", borderRadius: 10, background: "#e3f2fd", color: "#1565c0", fontWeight: 600 }, children: e.branchTaken }),
2747
- /* @__PURE__ */ f("span", { style: { fontSize: 11, color: "#9e9e9e", flexShrink: 0 }, children: e.startedAt ? yr(e.startedAt, e.completedAt) : "—" }),
2748
- o && /* @__PURE__ */ f("span", { style: { color: "#9e9e9e", flexShrink: 0 }, children: t ? G.createElement(tn, { size: 16 }) : G.createElement(rn, { size: 16 }) })
2749
- ]
2750
- }
2751
- ),
2752
- t && o && /* @__PURE__ */ y("div", { style: { padding: "0 12px 10px 32px", fontSize: 12 }, children: [
2753
- e.error && /* @__PURE__ */ f("div", { style: { padding: "6px 10px", borderRadius: 6, background: "#ffebee", color: "#c62828", marginBottom: 6 }, children: e.error }),
2754
- e.inputs && Object.keys(e.inputs).length > 0 && /* @__PURE__ */ y("details", { style: { marginBottom: 4 }, children: [
2755
- /* @__PURE__ */ f("summary", { style: { cursor: "pointer", color: "#616161", marginBottom: 4 }, children: "Inputs" }),
2756
- /* @__PURE__ */ f("pre", { style: { margin: 0, fontSize: 11, background: "#f5f5f5", padding: 8, borderRadius: 4, overflowX: "auto" }, children: JSON.stringify(e.inputs, null, 2) })
2757
- ] }),
2758
- e.outputs && Object.keys(e.outputs).length > 0 && /* @__PURE__ */ y("details", { children: [
2759
- /* @__PURE__ */ f("summary", { style: { cursor: "pointer", color: "#616161", marginBottom: 4 }, children: "Outputs" }),
2760
- /* @__PURE__ */ f("pre", { style: { margin: 0, fontSize: 11, background: "#f5f5f5", padding: 8, borderRadius: 4, overflowX: "auto" }, children: JSON.stringify(e.outputs, null, 2) })
2761
- ] })
2762
- ] })
2763
- ] });
2764
- }
2765
- function Zi({ record: e, selected: t, onSelect: r }) {
2766
- const n = Te[e.status];
2767
- return /* @__PURE__ */ y(
2768
- "div",
2769
- {
2770
- role: "button",
2771
- tabIndex: 0,
2772
- onClick: r,
2773
- onKeyDown: (o) => {
2774
- (o.key === "Enter" || o.key === " ") && r();
2775
- },
2776
- style: {
2777
- padding: "10px 14px",
2778
- borderBottom: "1px solid #f0f0f0",
2779
- cursor: "pointer",
2780
- background: t ? "#e3f2fd" : "#fff",
2781
- display: "flex",
2782
- alignItems: "center",
2783
- gap: 10,
2784
- outline: "none"
2785
- },
2786
- children: [
2787
- /* @__PURE__ */ f("span", { style: { color: n.color, flexShrink: 0 }, children: G.cloneElement(n.icon, { color: n.color, size: 16 }) }),
2788
- /* @__PURE__ */ y("div", { style: { flex: 1, minWidth: 0 }, children: [
2789
- /* @__PURE__ */ f("div", { style: { fontSize: 12, color: "#212121", fontWeight: t ? 600 : 400, whiteSpace: "nowrap", overflow: "hidden", textOverflow: "ellipsis" }, children: qe(e.triggeredAt) }),
2790
- /* @__PURE__ */ y("div", { style: { fontSize: 11, color: "#9e9e9e" }, children: [
2791
- e.triggeredBy ? `by ${e.triggeredBy}` : "System",
2792
- " · ",
2793
- e.steps.length,
2794
- " step",
2795
- e.steps.length !== 1 ? "s" : ""
2796
- ] })
2797
- ] }),
2798
- /* @__PURE__ */ f("span", { style: { fontSize: 11, fontWeight: 600, color: n.color, flexShrink: 0 }, children: n.label }),
2799
- /* @__PURE__ */ f(Bt, { size: 14, color: "#bdbdbd" })
2800
- ]
2801
- }
2802
- );
2803
- }
2804
- const hs = ({ records: e, onViewOnCanvas: t }) => {
2805
- var s;
2806
- const [r, n] = M(((s = e[0]) == null ? void 0 : s.id) ?? null), o = e.find((l) => l.id === r) ?? null, i = [...e].sort((l, d) => new Date(d.triggeredAt).getTime() - new Date(l.triggeredAt).getTime());
2807
- return e.length === 0 ? /* @__PURE__ */ y("div", { style: { display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", height: 300, color: "#9e9e9e", gap: 8 }, children: [
2808
- /* @__PURE__ */ f(vt, { size: 36 }),
2809
- /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 14 }, children: "No executions yet" }),
2810
- /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 12 }, children: "Run history will appear here" })
2811
- ] }) : /* @__PURE__ */ y("div", { style: { display: "flex", height: "100%", fontFamily: "inherit", border: "1px solid #e0e0e0", borderRadius: 8, overflow: "hidden" }, children: [
2812
- /* @__PURE__ */ y("div", { style: { width: 260, flexShrink: 0, borderRight: "1px solid #e0e0e0", overflowY: "auto", background: "#fafafa" }, children: [
2813
- /* @__PURE__ */ y("div", { style: { padding: "12px 14px", borderBottom: "1px solid #e0e0e0", fontWeight: 600, fontSize: 13, color: "#212121" }, children: [
2814
- "Run History (",
2815
- e.length,
2816
- ")"
2817
- ] }),
2818
- i.map((l) => /* @__PURE__ */ f(Zi, { record: l, selected: l.id === r, onSelect: () => n(l.id) }, l.id))
2819
- ] }),
2820
- /* @__PURE__ */ f("div", { style: { flex: 1, overflowY: "auto" }, children: o ? /* @__PURE__ */ y("div", { children: [
2821
- /* @__PURE__ */ y("div", { style: { padding: "16px 20px", borderBottom: "1px solid #f0f0f0", display: "flex", alignItems: "flex-start", justifyContent: "space-between", gap: 12 }, children: [
2822
- /* @__PURE__ */ y("div", { children: [
2823
- /* @__PURE__ */ y("div", { style: { display: "flex", alignItems: "center", gap: 8, marginBottom: 4 }, children: [
2824
- G.cloneElement(Te[o.status].icon, { color: Te[o.status].color, size: 18 }),
2825
- /* @__PURE__ */ f("span", { style: { fontWeight: 700, fontSize: 15, color: "#212121" }, children: Te[o.status].label })
2826
- ] }),
2827
- /* @__PURE__ */ y("div", { style: { fontSize: 12, color: "#757575", display: "flex", flexDirection: "column", gap: 2 }, children: [
2828
- /* @__PURE__ */ y("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
2829
- /* @__PURE__ */ f(vt, { size: 13 }),
2830
- " ",
2831
- qe(o.triggeredAt),
2832
- o.completedAt && ` → ${qe(o.completedAt)} (${yr(o.triggeredAt, o.completedAt)})`
2833
- ] }),
2834
- o.triggeredBy && /* @__PURE__ */ y("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
2835
- /* @__PURE__ */ f(en, { size: 13 }),
2836
- " ",
2837
- o.triggeredBy
2838
- ] })
2839
- ] })
2840
- ] }),
2841
- t && /* @__PURE__ */ f(
2842
- "button",
2843
- {
2844
- onClick: () => t(o),
2845
- style: { padding: "6px 12px", border: "1.5px solid #1976d2", borderRadius: 6, background: "#fff", color: "#1976d2", fontSize: 12, fontWeight: 600, cursor: "pointer", flexShrink: 0 },
2846
- children: "View on Canvas"
2847
- }
2848
- )
2849
- ] }),
2850
- o.error && /* @__PURE__ */ f("div", { style: { margin: "12px 16px", padding: "10px 14px", borderRadius: 6, background: "#ffebee", color: "#c62828", fontSize: 13 }, children: o.error }),
2851
- /* @__PURE__ */ y("div", { children: [
2852
- /* @__PURE__ */ y("div", { style: { padding: "10px 12px", fontSize: 12, fontWeight: 600, color: "#757575", borderBottom: "1px solid #f0f0f0" }, children: [
2853
- "STEPS (",
2854
- o.steps.length,
2855
- ")"
2856
- ] }),
2857
- o.steps.map((l, d) => /* @__PURE__ */ f(Ji, { step: l }, `${l.nodeId}-${d}`))
2858
- ] }),
2859
- o.inputs && Object.keys(o.inputs).length > 0 && /* @__PURE__ */ f("div", { style: { padding: "10px 16px" }, children: /* @__PURE__ */ y("details", { children: [
2860
- /* @__PURE__ */ f("summary", { style: { cursor: "pointer", fontSize: 12, fontWeight: 600, color: "#757575", marginBottom: 6 }, children: "TRIGGER INPUTS" }),
2861
- /* @__PURE__ */ f("pre", { style: { margin: 0, fontSize: 11, background: "#f5f5f5", padding: 10, borderRadius: 4, overflowX: "auto" }, children: JSON.stringify(o.inputs, null, 2) })
2862
- ] }) })
2863
- ] }) : /* @__PURE__ */ f("div", { style: { display: "flex", alignItems: "center", justifyContent: "center", height: "100%", color: "#9e9e9e", fontSize: 14 }, children: "Select a run to see details" }) })
2864
- ] });
2865
- }, gs = {
2866
- slots: [
2867
- { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
2868
- { id: "trigger-END_USER_CREATION", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "New User Registration", nodeData: { label: "New User Registration" } },
2869
- { id: "notification-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Welcome Email", nodeData: { title: "Welcome Email" } },
2870
- { id: "approval-1", kind: "approval", reactFlowType: "approvalNode", descriptorType: "approval", deletable: !0, label: "Manager Approval", branchLabels: { pass: "Approved", fail: "Rejected" } },
2871
- { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
2872
- ],
2873
- branches: {
2874
- "approval-1": {
2875
- pass: [{ id: "notification-pass-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Approval Confirmed", nodeData: { title: "Approval Confirmed" } }],
2876
- fail: [{ id: "notification-fail-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Rejection Notice", nodeData: { title: "Rejection Notice" } }]
2877
- }
2878
- }
2879
- }, ps = {
2880
- slots: [
2881
- { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
2882
- { id: "trigger-ACCESS_REQUEST", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "Access Request Submitted", nodeData: { label: "Access Request Submitted" } },
2883
- { id: "approval-1", kind: "approval", reactFlowType: "approvalNode", descriptorType: "approval", deletable: !0, label: "Access Approval", branchLabels: { pass: "Approved", fail: "Denied" } },
2884
- { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
2885
- ],
2886
- branches: {
2887
- "approval-1": {
2888
- pass: [
2889
- { id: "restApi-1", kind: "userTask", reactFlowType: "restApiNode", descriptorType: "restApi", deletable: !0, label: "Provision Access", nodeData: { title: "Provision Access" } },
2890
- { id: "notification-pass-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Access Granted Email", nodeData: { title: "Access Granted Email" } }
2891
- ],
2892
- fail: [
2893
- { id: "notification-fail-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Access Denied Email", nodeData: { title: "Access Denied Email" } }
2894
- ]
2895
- }
2896
- }
2897
- }, bs = {
2898
- slots: [
2899
- { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
2900
- { id: "trigger-USER_DEACTIVATION", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "User Deactivation", nodeData: { label: "User Deactivation" } },
2901
- { id: "delay-1", kind: "userTask", reactFlowType: "delayNode", descriptorType: "delay", deletable: !0, label: "Grace Period", nodeData: { title: "Grace Period", duration: 7, unit: "days" }, formData: { duration: 7, unit: "days" } },
2902
- { id: "notification-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Notify IT Team", nodeData: { title: "Notify IT Team" } },
2903
- { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
2904
- ],
2905
- branches: {}
2906
- }, ys = {
2907
- slots: [
2908
- { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
2909
- { id: "trigger-WEBHOOK_TRIGGER", kind: "triggerFixed", reactFlowType: "webhookTriggerNode", deletable: !0, label: "Incoming Webhook", nodeData: { label: "Incoming Webhook" } },
2910
- { id: "restApi-1", kind: "userTask", reactFlowType: "restApiNode", descriptorType: "restApi", deletable: !0, label: "Call External API", nodeData: { title: "Call External API" } },
2911
- { id: "notification-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Notify on Completion", nodeData: { title: "Notify on Completion" } },
2912
- { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
2913
- ],
2914
- branches: {}
2915
- };
2916
- export {
2917
- At as F,
2918
- Wi as S,
2919
- hs as W,
2920
- fs as a,
2921
- ps as b,
2922
- bs as o,
2923
- gs as u,
2924
- ys as w
2925
- };