@omg-dev/app 0.5.1 → 0.6.2

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.
Files changed (114) hide show
  1. package/dist-lib/{ChangelogPage-BzsTWlhq.js → ChangelogPage-CirRyMnC.js} +54 -1
  2. package/dist-lib/{File-B-qYa2zY.js → File-DQRr5F_e.js} +1761 -1826
  3. package/dist-lib/FileEditor-BrI3dfcp.js +6895 -0
  4. package/dist-lib/FileTreePane-J8P-OiHb.js +8413 -0
  5. package/dist-lib/{FileViewer-Clmf04v1.js → FileViewer-DRrfus7c.js} +1 -1
  6. package/dist-lib/{SessionFilesPanel-K4lGGdJ4.js → SessionFilesPanel-W4QKB0HL.js} +64 -64
  7. package/dist-lib/{TermView-CWr-zJmM.js → TermView-CoD-VkHs.js} +495 -520
  8. package/dist-lib/{abnfDiagram-VRR7QNED-Chn1Z_p9.js → abnfDiagram-VRR7QNED-CiXfOnAu.js} +4 -4
  9. package/dist-lib/{arc-B652oHQ-.js → arc-QOMNKQA5.js} +1 -1
  10. package/dist-lib/{architectureDiagram-ZJ3FMSHR-CMatArpz.js → architectureDiagram-ZJ3FMSHR-BcFBTmfD.js} +2059 -2064
  11. package/dist-lib/{blockDiagram-677ZJIJ3-CEOPfI9A.js → blockDiagram-677ZJIJ3-Qj8-RIV3.js} +920 -925
  12. package/dist-lib/{c4Diagram-LMCZKHZV-DcUHrESL.js → c4Diagram-LMCZKHZV-BpinEmj4.js} +598 -593
  13. package/dist-lib/{channel-B5lJFbed.js → channel-D6YHMmF7.js} +1 -1
  14. package/dist-lib/{chat-engine-P0yDhFOX.js → chat-engine-CRzDKNTH.js} +1173 -1218
  15. package/dist-lib/chunk-2Q5K7J3B-CFSi414U.js +18 -0
  16. package/dist-lib/{chunk-32BRIVSS-IYmNSvH8.js → chunk-32BRIVSS-DvywQiCk.js} +1 -1
  17. package/dist-lib/{chunk-5VM5RSS4-DO2g-xIj.js → chunk-5VM5RSS4-xd6XuI9Q.js} +1 -1
  18. package/dist-lib/{chunk-BO2N2NFS-kYiI5SD9.js → chunk-BO2N2NFS-BbJdm-59.js} +4892 -4903
  19. package/dist-lib/{chunk-EX3LRPZG-N96wfks9.js → chunk-EX3LRPZG-BLDKx-Yg.js} +507 -514
  20. package/dist-lib/chunk-JWPE2WC7-DnwG7Xzp.js +8 -0
  21. package/dist-lib/chunk-MOJQB5TN-BrENeFT5.js +670 -0
  22. package/dist-lib/chunk-RYQCIY6F-I-J4fVFd.js +313 -0
  23. package/dist-lib/{chunk-V7JOEXUC-DQwf2vkP.js → chunk-V7JOEXUC-Bkakcs1-.js} +458 -453
  24. package/dist-lib/chunk-VR4S4FIN-BDq3jZ0m.js +19 -0
  25. package/dist-lib/{chunk-XXDRQBXY-Ccv4aRcn.js → chunk-XXDRQBXY-DRKeYnrF.js} +1 -1
  26. package/dist-lib/{classDiagram-v2-EOCWNBFH-DOn-rhuL.js → classDiagram-OUVF2IWQ-DISUfvR5.js} +2 -2
  27. package/dist-lib/{classDiagram-OUVF2IWQ-DOn-rhuL.js → classDiagram-v2-EOCWNBFH-DISUfvR5.js} +2 -2
  28. package/dist-lib/{coding-agents-page-DCafIpWL.js → coding-agents-page-OER8HHRF.js} +152 -131
  29. package/dist-lib/computer-page-D9cSNLa9.js +8990 -0
  30. package/dist-lib/{cose-bilkent-JH36ORCC-C-tACTrT.js → cose-bilkent-JH36ORCC-DCfmoChv.js} +281 -281
  31. package/dist-lib/{create-BrnHvSDE.js → create-CBk9uwJH.js} +2 -2
  32. package/dist-lib/cynefin-VYW2F7L2-XAY3mHv8.js +24430 -0
  33. package/dist-lib/{cynefinDiagram-TSTJHNR4-Be7CamD2.js → cynefinDiagram-TSTJHNR4-CrgvPEr1.js} +3 -3
  34. package/dist-lib/{cytoscape.esm-B0ledd6M.js → cytoscape.esm-BB6Ga9He.js} +3 -3
  35. package/dist-lib/dagre-VKFMJZFB-CE5k06mJ.js +343 -0
  36. package/dist-lib/{diagram-FQU43EPY-Jg12ow4Z.js → diagram-FQU43EPY-gOcCiJEN.js} +136 -139
  37. package/dist-lib/diagram-G47NLZAW-BVJLfRsd.js +531 -0
  38. package/dist-lib/diagram-NH7WQ7WH-u6QnHasL.js +145 -0
  39. package/dist-lib/diagram-OA4YK3LP-D4Kcl3uM.js +350 -0
  40. package/dist-lib/{diagram-WEI45ONY-D1kKPOc_.js → diagram-WEI45ONY-6a__oIb0.js} +38 -42
  41. package/dist-lib/{ebnfDiagram-CCIWWBDH-BhQWrGMc.js → ebnfDiagram-CCIWWBDH-PXSrB6lG.js} +4 -4
  42. package/dist-lib/{embedded-CLYU5z7h.js → embedded-DqTPdMCh.js} +10561 -10581
  43. package/dist-lib/{engine-compile-BeDRSL6Y.js → engine-compile-D_stzVMa.js} +2939 -2991
  44. package/dist-lib/{erDiagram-Q63AITRT-D2q6Nmwa.js → erDiagram-Q63AITRT-BbsttUCs.js} +286 -284
  45. package/dist-lib/flowDiagram-23GEKE2U-CX5x3zVA.js +1641 -0
  46. package/dist-lib/{ganttDiagram-NO4QXBWP-C_Lj-cJB.js → ganttDiagram-NO4QXBWP-Bq0aSPs8.js} +2 -2
  47. package/dist-lib/gitGraphDiagram-IHSO6WYX-BjAezjIv.js +815 -0
  48. package/dist-lib/{graph-B68L3K2T.js → graph-DAHC4kPm.js} +2 -2
  49. package/dist-lib/{highlighted-body-OFNGDK62-C2DGVKV8.js → highlighted-body-OFNGDK62-DWhG_ijx.js} +1 -1
  50. package/dist-lib/index-B0neMIbR.js +16520 -0
  51. package/dist-lib/index-BBC0E3Qg.js +4994 -0
  52. package/dist-lib/{index-Dtkd4mEk.js → index-CE7H8LiZ.js} +2 -2
  53. package/dist-lib/{index-DWkBvb-9.js → index-FgVvPpIY.js} +2 -2
  54. package/dist-lib/index.js +1 -1
  55. package/dist-lib/{infoDiagram-FWYZ7A6U-BbUkT0KS.js → infoDiagram-FWYZ7A6U-Bo_FNR91.js} +2 -2
  56. package/dist-lib/ishikawaDiagram-FXEZZL3T-C5bGD-Eb.js +624 -0
  57. package/dist-lib/{journeyDiagram-5HDEW3XC-CgykmVSC.js → journeyDiagram-5HDEW3XC-C8qM7SxF.js} +4 -4
  58. package/dist-lib/kanban-definition-HUTT4EX6-C-EK5Puz.js +724 -0
  59. package/dist-lib/{katex-jHfnQmlp.js → katex-DoRnZ_sp.js} +1 -1
  60. package/dist-lib/keyboard-Yfa1ETse.js +21 -0
  61. package/dist-lib/{layout-BGrtsiRL.js → layout-DBbo_M5I.js} +2 -2
  62. package/dist-lib/{linear-B5ZSwawJ.js → linear-zGzX0-I0.js} +1 -1
  63. package/dist-lib/{map-hbfFlSln.js → map-DRdzG8Ho.js} +1 -1
  64. package/dist-lib/mermaid-GHXKKRXX-hOE9C3qW.js +4 -0
  65. package/dist-lib/{mindmap-definition-LN4V7U3C-CfhfeEht.js → mindmap-definition-LN4V7U3C-DlVCRx6k.js} +310 -311
  66. package/dist-lib/{pegDiagram-2B236MQR-CYDAJHPF.js → pegDiagram-2B236MQR-DrKNikeG.js} +4 -4
  67. package/dist-lib/{pieDiagram-ENE6RG2P-udKxQm4p.js → pieDiagram-ENE6RG2P-Fm_jc0HL.js} +83 -84
  68. package/dist-lib/quadrantDiagram-ABIIQ3AL-zDRY0VtB.js +1029 -0
  69. package/dist-lib/{railroadDiagram-RFXS5EU6-q0Svkmuy.js → railroadDiagram-RFXS5EU6-BQuFX39y.js} +4 -4
  70. package/dist-lib/{requirementDiagram-TGXJPOKE-tNxRI1gc.js → requirementDiagram-TGXJPOKE-BWwBQZXn.js} +269 -268
  71. package/dist-lib/{resume-session-sheet-CHwpwguS.js → resume-session-sheet-bjDJmwq6.js} +2 -3
  72. package/dist-lib/sankeyDiagram-HTMAVEWB-BjRyuB6L.js +859 -0
  73. package/dist-lib/{sequenceDiagram-DBY2YBRQ-Dvl2_CXL.js → sequenceDiagram-DBY2YBRQ-69pcw_2M.js} +892 -899
  74. package/dist-lib/{session-token-usage-BUz6b-IB.js → session-token-usage-D2zDt9P7.js} +82 -83
  75. package/dist-lib/{shadow-text-size-CBCTdbYU.js → shadow-text-size-smWA4wIU.js} +1 -2
  76. package/dist-lib/{shipped-page-CXy85bsL.js → shipped-page-Cr7dCCc2.js} +232 -235
  77. package/dist-lib/sizeCapture-X5ZJPWSS-DqkV8s1N.js +46 -0
  78. package/dist-lib/{stateDiagram-2N3HPSRC-CnWB7HvU.js → stateDiagram-2N3HPSRC-0vE3REl_.js} +4 -4
  79. package/dist-lib/{stateDiagram-v2-6OUMAXLB-DnZ0UI2p.js → stateDiagram-v2-6OUMAXLB-u_56Obsh.js} +2 -2
  80. package/dist-lib/{streamdown-response-CUB9sK6V.js → streamdown-response-Qq9_RgFv.js} +290 -297
  81. package/dist-lib/styles.css +1 -1
  82. package/dist-lib/swimlanes-5IMT3BWC-H0raIBd1.js +5332 -0
  83. package/dist-lib/{swimlanesDiagram-G3AALYLV-CKyOeqF_.js → swimlanesDiagram-G3AALYLV-By52HaDu.js} +2 -2
  84. package/dist-lib/timeline-definition-FHXFAJF6-h1LLYUQk.js +1055 -0
  85. package/dist-lib/vennDiagram-L72KCM5P-B4wDw_Kh.js +1578 -0
  86. package/dist-lib/wardleyDiagram-EHGQE667-DLMBGiwD.js +678 -0
  87. package/dist-lib/{xychartDiagram-FW5EYKEG-m3s7caPv.js → xychartDiagram-FW5EYKEG-BHvf5Noj.js} +526 -496
  88. package/package.json +4 -3
  89. package/dist-lib/FileEditor-BIz0qCyW.js +0 -6892
  90. package/dist-lib/FileTreePane-BG2k7gTc.js +0 -8422
  91. package/dist-lib/chunk-2Q5K7J3B-Ex8Ly28R.js +0 -15
  92. package/dist-lib/chunk-JWPE2WC7-DFPBClX_.js +0 -9
  93. package/dist-lib/chunk-MOJQB5TN-dusfI9ob.js +0 -664
  94. package/dist-lib/chunk-RYQCIY6F-fkeERzIG.js +0 -315
  95. package/dist-lib/chunk-VR4S4FIN-hOZG7eF3.js +0 -20
  96. package/dist-lib/cynefin-VYW2F7L2-DQXPWaog.js +0 -23853
  97. package/dist-lib/dagre-VKFMJZFB-BhCjK7XQ.js +0 -346
  98. package/dist-lib/diagram-G47NLZAW-C3_z2t6T.js +0 -530
  99. package/dist-lib/diagram-NH7WQ7WH-DUdK08IT.js +0 -143
  100. package/dist-lib/diagram-OA4YK3LP-TUUyRYY3.js +0 -353
  101. package/dist-lib/flowDiagram-23GEKE2U-DU3S3biU.js +0 -1645
  102. package/dist-lib/gitGraphDiagram-IHSO6WYX-CvGu0XAR.js +0 -828
  103. package/dist-lib/index-DcwavxA1.js +0 -5062
  104. package/dist-lib/index-JkCQXUYs.js +0 -16566
  105. package/dist-lib/ishikawaDiagram-FXEZZL3T-D_Y6Tuyb.js +0 -622
  106. package/dist-lib/kanban-definition-HUTT4EX6-CPFLTskY.js +0 -726
  107. package/dist-lib/mermaid-GHXKKRXX-Ox_2d3uB.js +0 -4
  108. package/dist-lib/quadrantDiagram-ABIIQ3AL-BmDmLczk.js +0 -1025
  109. package/dist-lib/sankeyDiagram-HTMAVEWB-B9Bl7f2P.js +0 -847
  110. package/dist-lib/sizeCapture-X5ZJPWSS-B1EeO3N9.js +0 -47
  111. package/dist-lib/swimlanes-5IMT3BWC-CvqDJcS9.js +0 -5353
  112. package/dist-lib/timeline-definition-FHXFAJF6-b15X0Oru.js +0 -1066
  113. package/dist-lib/vennDiagram-L72KCM5P-C4lh5m77.js +0 -1585
  114. package/dist-lib/wardleyDiagram-EHGQE667-Cev6fT_D.js +0 -684
@@ -1,17 +1,17 @@
1
- import { _ as V, l as k, d as lt } from "./index-JkCQXUYs.js";
2
- import { c as tt } from "./cytoscape.esm-B0ledd6M.js";
1
+ import { _ as V, l as k, d as lt } from "./index-B0neMIbR.js";
2
+ import { c as tt } from "./cytoscape.esm-BB6Ga9He.js";
3
3
  import { g as gt } from "./_commonjsHelpers-C6fGbg64.js";
4
4
  var Z = { exports: {} }, $ = { exports: {} }, Q = { exports: {} }, ut = Q.exports, j;
5
5
  function ft() {
6
6
  return j || (j = 1, (function(G, b) {
7
- (function(I, T) {
8
- G.exports = T();
7
+ (function(I, L) {
8
+ G.exports = L();
9
9
  })(ut, function() {
10
10
  return (
11
11
  /******/
12
12
  (function(N) {
13
13
  var I = {};
14
- function T(o) {
14
+ function L(o) {
15
15
  if (I[o])
16
16
  return I[o].exports;
17
17
  var e = I[o] = {
@@ -23,12 +23,12 @@ function ft() {
23
23
  exports: {}
24
24
  /******/
25
25
  };
26
- return N[o].call(e.exports, e, e.exports, T), e.l = !0, e.exports;
26
+ return N[o].call(e.exports, e, e.exports, L), e.l = !0, e.exports;
27
27
  }
28
- return T.m = N, T.c = I, T.i = function(o) {
28
+ return L.m = N, L.c = I, L.i = function(o) {
29
29
  return o;
30
- }, T.d = function(o, e, t) {
31
- T.o(o, e) || Object.defineProperty(o, e, {
30
+ }, L.d = function(o, e, t) {
31
+ L.o(o, e) || Object.defineProperty(o, e, {
32
32
  /******/
33
33
  configurable: !1,
34
34
  /******/
@@ -37,7 +37,7 @@ function ft() {
37
37
  get: t
38
38
  /******/
39
39
  });
40
- }, T.n = function(o) {
40
+ }, L.n = function(o) {
41
41
  var e = o && o.__esModule ? (
42
42
  /******/
43
43
  function() {
@@ -49,22 +49,22 @@ function ft() {
49
49
  return o;
50
50
  }
51
51
  );
52
- return T.d(e, "a", e), e;
53
- }, T.o = function(o, e) {
52
+ return L.d(e, "a", e), e;
53
+ }, L.o = function(o, e) {
54
54
  return Object.prototype.hasOwnProperty.call(o, e);
55
- }, T.p = "", T(T.s = 26);
55
+ }, L.p = "", L(L.s = 26);
56
56
  })([
57
57
  /* 0 */
58
58
  /***/
59
- (function(N, I, T) {
59
+ (function(N, I, L) {
60
60
  function o() {
61
61
  }
62
62
  o.QUALITY = 1, o.DEFAULT_CREATE_BENDS_AS_NEEDED = !1, o.DEFAULT_INCREMENTAL = !1, o.DEFAULT_ANIMATION_ON_LAYOUT = !0, o.DEFAULT_ANIMATION_DURING_LAYOUT = !1, o.DEFAULT_ANIMATION_PERIOD = 50, o.DEFAULT_UNIFORM_LEAF_NODE_SIZES = !1, o.DEFAULT_GRAPH_MARGIN = 15, o.NODE_DIMENSIONS_INCLUDE_LABELS = !1, o.SIMPLE_NODE_SIZE = 40, o.SIMPLE_NODE_HALF_SIZE = o.SIMPLE_NODE_SIZE / 2, o.EMPTY_COMPOUND_NODE_SIZE = 40, o.MIN_EDGE_LENGTH = 1, o.WORLD_BOUNDARY = 1e6, o.INITIAL_WORLD_BOUNDARY = o.WORLD_BOUNDARY / 1e3, o.WORLD_CENTER_X = 1200, o.WORLD_CENTER_Y = 900, N.exports = o;
63
63
  }),
64
64
  /* 1 */
65
65
  /***/
66
- (function(N, I, T) {
67
- var o = T(2), e = T(8), t = T(9);
66
+ (function(N, I, L) {
67
+ var o = L(2), e = L(8), t = L(9);
68
68
  function i(g, n, d) {
69
69
  o.call(this, d), this.isOverlapingSourceAndTarget = !1, this.vGraphObject = d, this.bendpoints = [], this.source = g, this.target = n;
70
70
  }
@@ -113,7 +113,7 @@ function ft() {
113
113
  }),
114
114
  /* 2 */
115
115
  /***/
116
- (function(N, I, T) {
116
+ (function(N, I, L) {
117
117
  function o(e) {
118
118
  this.vGraphObject = e;
119
119
  }
@@ -121,8 +121,8 @@ function ft() {
121
121
  }),
122
122
  /* 3 */
123
123
  /***/
124
- (function(N, I, T) {
125
- var o = T(2), e = T(10), t = T(13), i = T(0), l = T(16), g = T(4);
124
+ (function(N, I, L) {
125
+ var o = L(2), e = L(10), t = L(13), i = L(0), l = L(16), g = L(4);
126
126
  function n(r, h, a, p) {
127
127
  a == null && p == null && (p = h), o.call(this, p), r.graphManager != null && (r = r.graphManager), this.estimatedSize = e.MIN_VALUE, this.inclusionTreeDepth = e.MAX_VALUE, this.vGraphObject = p, this.edges = [], this.graphManager = r, a != null && h != null ? this.rect = new t(h.x, h.y, a.width, a.height) : this.rect = new t();
128
128
  }
@@ -252,7 +252,7 @@ function ft() {
252
252
  }),
253
253
  /* 4 */
254
254
  /***/
255
- (function(N, I, T) {
255
+ (function(N, I, L) {
256
256
  function o(e, t) {
257
257
  e == null && t == null ? (this.x = 0, this.y = 0) : (this.x = e, this.y = t);
258
258
  }
@@ -274,8 +274,8 @@ function ft() {
274
274
  }),
275
275
  /* 5 */
276
276
  /***/
277
- (function(N, I, T) {
278
- var o = T(2), e = T(10), t = T(0), i = T(6), l = T(3), g = T(1), n = T(13), d = T(12), r = T(11);
277
+ (function(N, I, L) {
278
+ var o = L(2), e = L(10), t = L(0), i = L(6), l = L(3), g = L(1), n = L(13), d = L(12), r = L(11);
279
279
  function h(p, v, D) {
280
280
  o.call(this, D), this.estimatedSize = e.MIN_VALUE, this.margin = t.DEFAULT_GRAPH_MARGIN, this.edges = [], this.nodes = [], this.isConnected = !1, this.parent = p, v != null && v instanceof i ? this.graphManager = v : v != null && v instanceof Layout && (this.graphManager = v.graphManager);
281
281
  }
@@ -309,12 +309,12 @@ function ft() {
309
309
  throw "Node already in graph!";
310
310
  return u.owner = this, this.getNodes().push(u), u;
311
311
  } else {
312
- var E = p;
312
+ var T = p;
313
313
  if (!(this.getNodes().indexOf(v) > -1 && this.getNodes().indexOf(D) > -1))
314
314
  throw "Source or target not in graph!";
315
315
  if (!(v.owner == D.owner && v.owner == this))
316
316
  throw "Both owners must be this graph!";
317
- return v.owner != D.owner ? null : (E.source = v, E.target = D, E.isInterGraph = !1, this.getEdges().push(E), v.edges.push(E), D != v && D.edges.push(E), E);
317
+ return v.owner != D.owner ? null : (T.source = v, T.target = D, T.isInterGraph = !1, this.getEdges().push(T), v.edges.push(T), D != v && D.edges.push(T), T);
318
318
  }
319
319
  }, h.prototype.remove = function(p) {
320
320
  var v = p;
@@ -325,7 +325,7 @@ function ft() {
325
325
  throw "Owner graph is invalid!";
326
326
  if (this.graphManager == null)
327
327
  throw "Owner graph manager is invalid!";
328
- for (var D = v.edges.slice(), u, E = D.length, y = 0; y < E; y++)
328
+ for (var D = v.edges.slice(), u, T = D.length, y = 0; y < T; y++)
329
329
  u = D[y], u.isInterGraph ? this.graphManager.remove(u) : u.source.owner.remove(u);
330
330
  var O = this.nodes.indexOf(v);
331
331
  if (O == -1)
@@ -349,24 +349,24 @@ function ft() {
349
349
  u.source.owner.getEdges().splice(O, 1);
350
350
  }
351
351
  }, h.prototype.updateLeftTop = function() {
352
- for (var p = e.MAX_VALUE, v = e.MAX_VALUE, D, u, E, y = this.getNodes(), O = y.length, s = 0; s < O; s++) {
352
+ for (var p = e.MAX_VALUE, v = e.MAX_VALUE, D, u, T, y = this.getNodes(), O = y.length, s = 0; s < O; s++) {
353
353
  var f = y[s];
354
354
  D = f.getTop(), u = f.getLeft(), p > D && (p = D), v > u && (v = u);
355
355
  }
356
- return p == e.MAX_VALUE ? null : (y[0].getParent().paddingLeft != null ? E = y[0].getParent().paddingLeft : E = this.margin, this.left = v - E, this.top = p - E, new d(this.left, this.top));
356
+ return p == e.MAX_VALUE ? null : (y[0].getParent().paddingLeft != null ? T = y[0].getParent().paddingLeft : T = this.margin, this.left = v - T, this.top = p - T, new d(this.left, this.top));
357
357
  }, h.prototype.updateBounds = function(p) {
358
- for (var v = e.MAX_VALUE, D = -e.MAX_VALUE, u = e.MAX_VALUE, E = -e.MAX_VALUE, y, O, s, f, c, L = this.nodes, A = L.length, m = 0; m < A; m++) {
359
- var C = L[m];
360
- p && C.child != null && C.updateBounds(), y = C.getLeft(), O = C.getRight(), s = C.getTop(), f = C.getBottom(), v > y && (v = y), D < O && (D = O), u > s && (u = s), E < f && (E = f);
358
+ for (var v = e.MAX_VALUE, D = -e.MAX_VALUE, u = e.MAX_VALUE, T = -e.MAX_VALUE, y, O, s, f, c, E = this.nodes, A = E.length, m = 0; m < A; m++) {
359
+ var C = E[m];
360
+ p && C.child != null && C.updateBounds(), y = C.getLeft(), O = C.getRight(), s = C.getTop(), f = C.getBottom(), v > y && (v = y), D < O && (D = O), u > s && (u = s), T < f && (T = f);
361
361
  }
362
- var R = new n(v, u, D - v, E - u);
363
- v == e.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), L[0].getParent().paddingLeft != null ? c = L[0].getParent().paddingLeft : c = this.margin, this.left = R.x - c, this.right = R.x + R.width + c, this.top = R.y - c, this.bottom = R.y + R.height + c;
362
+ var R = new n(v, u, D - v, T - u);
363
+ v == e.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), E[0].getParent().paddingLeft != null ? c = E[0].getParent().paddingLeft : c = this.margin, this.left = R.x - c, this.right = R.x + R.width + c, this.top = R.y - c, this.bottom = R.y + R.height + c;
364
364
  }, h.calculateBounds = function(p) {
365
- for (var v = e.MAX_VALUE, D = -e.MAX_VALUE, u = e.MAX_VALUE, E = -e.MAX_VALUE, y, O, s, f, c = p.length, L = 0; L < c; L++) {
366
- var A = p[L];
367
- y = A.getLeft(), O = A.getRight(), s = A.getTop(), f = A.getBottom(), v > y && (v = y), D < O && (D = O), u > s && (u = s), E < f && (E = f);
365
+ for (var v = e.MAX_VALUE, D = -e.MAX_VALUE, u = e.MAX_VALUE, T = -e.MAX_VALUE, y, O, s, f, c = p.length, E = 0; E < c; E++) {
366
+ var A = p[E];
367
+ y = A.getLeft(), O = A.getRight(), s = A.getTop(), f = A.getBottom(), v > y && (v = y), D < O && (D = O), u > s && (u = s), T < f && (T = f);
368
368
  }
369
- var m = new n(v, u, D - v, E - u);
369
+ var m = new n(v, u, D - v, T - u);
370
370
  return m;
371
371
  }, h.prototype.getInclusionTreeDepth = function() {
372
372
  return this == this.graphManager.getRoot() ? 1 : this.parent.getInclusionTreeDepth();
@@ -376,8 +376,8 @@ function ft() {
376
376
  return this.estimatedSize;
377
377
  }, h.prototype.calcEstimatedSize = function() {
378
378
  for (var p = 0, v = this.nodes, D = v.length, u = 0; u < D; u++) {
379
- var E = v[u];
380
- p += E.calcEstimatedSize();
379
+ var T = v[u];
380
+ p += T.calcEstimatedSize();
381
381
  }
382
382
  return p == 0 ? this.estimatedSize = t.EMPTY_COMPOUND_NODE_SIZE : this.estimatedSize = p / Math.sqrt(this.nodes.length), this.estimatedSize;
383
383
  }, h.prototype.updateConnected = function() {
@@ -386,16 +386,16 @@ function ft() {
386
386
  this.isConnected = !0;
387
387
  return;
388
388
  }
389
- var v = new r(), D = /* @__PURE__ */ new Set(), u = this.nodes[0], E, y, O = u.withChildren();
389
+ var v = new r(), D = /* @__PURE__ */ new Set(), u = this.nodes[0], T, y, O = u.withChildren();
390
390
  for (O.forEach(function(m) {
391
391
  v.push(m), D.add(m);
392
392
  }); v.length !== 0; ) {
393
- u = v.shift(), E = u.getEdges();
394
- for (var s = E.length, f = 0; f < s; f++) {
395
- var c = E[f];
393
+ u = v.shift(), T = u.getEdges();
394
+ for (var s = T.length, f = 0; f < s; f++) {
395
+ var c = T[f];
396
396
  if (y = c.getOtherEndInGraph(u, this), y != null && !D.has(y)) {
397
- var L = y.withChildren();
398
- L.forEach(function(m) {
397
+ var E = y.withChildren();
398
+ E.forEach(function(m) {
399
399
  v.push(m), D.add(m);
400
400
  });
401
401
  }
@@ -411,10 +411,10 @@ function ft() {
411
411
  }),
412
412
  /* 6 */
413
413
  /***/
414
- (function(N, I, T) {
415
- var o, e = T(1);
414
+ (function(N, I, L) {
415
+ var o, e = L(1);
416
416
  function t(i) {
417
- o = T(5), this.layout = i, this.graphs = [], this.edges = [];
417
+ o = L(5), this.layout = i, this.graphs = [], this.edges = [];
418
418
  }
419
419
  t.prototype.addRoot = function() {
420
420
  var i = this.layout.newGraph(), l = this.layout.newNode(null), g = this.add(i, l);
@@ -606,8 +606,8 @@ function ft() {
606
606
  }),
607
607
  /* 7 */
608
608
  /***/
609
- (function(N, I, T) {
610
- var o = T(0);
609
+ (function(N, I, L) {
610
+ var o = L(0);
611
611
  function e() {
612
612
  }
613
613
  for (var t in o)
@@ -616,8 +616,8 @@ function ft() {
616
616
  }),
617
617
  /* 8 */
618
618
  /***/
619
- (function(N, I, T) {
620
- var o = T(12);
619
+ (function(N, I, L) {
620
+ var o = L(12);
621
621
  function e() {
622
622
  }
623
623
  e.calcSeparationAmount = function(t, i, l, g) {
@@ -635,10 +635,10 @@ function ft() {
635
635
  var g = t.getCenterX(), n = t.getCenterY(), d = i.getCenterX(), r = i.getCenterY();
636
636
  if (t.intersects(i))
637
637
  return l[0] = g, l[1] = n, l[2] = d, l[3] = r, !0;
638
- var h = t.getX(), a = t.getY(), p = t.getRight(), v = t.getX(), D = t.getBottom(), u = t.getRight(), E = t.getWidthHalf(), y = t.getHeightHalf(), O = i.getX(), s = i.getY(), f = i.getRight(), c = i.getX(), L = i.getBottom(), A = i.getRight(), m = i.getWidthHalf(), C = i.getHeightHalf(), R = !1, M = !1;
638
+ var h = t.getX(), a = t.getY(), p = t.getRight(), v = t.getX(), D = t.getBottom(), u = t.getRight(), T = t.getWidthHalf(), y = t.getHeightHalf(), O = i.getX(), s = i.getY(), f = i.getRight(), c = i.getX(), E = i.getBottom(), A = i.getRight(), m = i.getWidthHalf(), C = i.getHeightHalf(), R = !1, M = !1;
639
639
  if (g === d) {
640
640
  if (n > r)
641
- return l[0] = g, l[1] = a, l[2] = d, l[3] = L, !1;
641
+ return l[0] = g, l[1] = a, l[2] = d, l[3] = E, !1;
642
642
  if (n < r)
643
643
  return l[0] = g, l[1] = D, l[2] = d, l[3] = s, !1;
644
644
  } else if (n === r) {
@@ -648,7 +648,7 @@ function ft() {
648
648
  return l[0] = p, l[1] = n, l[2] = O, l[3] = r, !1;
649
649
  } else {
650
650
  var S = t.height / t.width, Y = i.height / i.width, w = (r - n) / (d - g), x = void 0, F = void 0, U = void 0, P = void 0, _ = void 0, X = void 0;
651
- if (-S === w ? g > d ? (l[0] = v, l[1] = D, R = !0) : (l[0] = p, l[1] = a, R = !0) : S === w && (g > d ? (l[0] = h, l[1] = a, R = !0) : (l[0] = u, l[1] = D, R = !0)), -Y === w ? d > g ? (l[2] = c, l[3] = L, M = !0) : (l[2] = f, l[3] = s, M = !0) : Y === w && (d > g ? (l[2] = O, l[3] = s, M = !0) : (l[2] = A, l[3] = L, M = !0)), R && M)
651
+ if (-S === w ? g > d ? (l[0] = v, l[1] = D, R = !0) : (l[0] = p, l[1] = a, R = !0) : S === w && (g > d ? (l[0] = h, l[1] = a, R = !0) : (l[0] = u, l[1] = D, R = !0)), -Y === w ? d > g ? (l[2] = c, l[3] = E, M = !0) : (l[2] = f, l[3] = s, M = !0) : Y === w && (d > g ? (l[2] = O, l[3] = s, M = !0) : (l[2] = A, l[3] = E, M = !0)), R && M)
652
652
  return !1;
653
653
  if (g > d ? n > r ? (x = this.getCardinalDirection(S, w, 4), F = this.getCardinalDirection(Y, w, 2)) : (x = this.getCardinalDirection(-S, w, 3), F = this.getCardinalDirection(-Y, w, 1)) : n > r ? (x = this.getCardinalDirection(-S, w, 1), F = this.getCardinalDirection(-Y, w, 3)) : (x = this.getCardinalDirection(S, w, 2), F = this.getCardinalDirection(Y, w, 4)), !R)
654
654
  switch (x) {
@@ -656,13 +656,13 @@ function ft() {
656
656
  P = a, U = g + -y / w, l[0] = U, l[1] = P;
657
657
  break;
658
658
  case 2:
659
- U = u, P = n + E * w, l[0] = U, l[1] = P;
659
+ U = u, P = n + T * w, l[0] = U, l[1] = P;
660
660
  break;
661
661
  case 3:
662
662
  P = D, U = g + y / w, l[0] = U, l[1] = P;
663
663
  break;
664
664
  case 4:
665
- U = v, P = n + -E * w, l[0] = U, l[1] = P;
665
+ U = v, P = n + -T * w, l[0] = U, l[1] = P;
666
666
  break;
667
667
  }
668
668
  if (!M)
@@ -674,7 +674,7 @@ function ft() {
674
674
  _ = A, X = r + m * w, l[2] = _, l[3] = X;
675
675
  break;
676
676
  case 3:
677
- X = L, _ = d + C / w, l[2] = _, l[3] = X;
677
+ X = E, _ = d + C / w, l[2] = _, l[3] = X;
678
678
  break;
679
679
  case 4:
680
680
  _ = c, X = r + -m * w, l[2] = _, l[3] = X;
@@ -687,8 +687,8 @@ function ft() {
687
687
  }, e.getIntersection = function(t, i, l, g) {
688
688
  if (g == null)
689
689
  return this.getIntersection2(t, i, l);
690
- var n = t.x, d = t.y, r = i.x, h = i.y, a = l.x, p = l.y, v = g.x, D = g.y, u = void 0, E = void 0, y = void 0, O = void 0, s = void 0, f = void 0, c = void 0, L = void 0, A = void 0;
691
- return y = h - d, s = n - r, c = r * d - n * h, O = D - p, f = a - v, L = v * p - a * D, A = y * f - O * s, A === 0 ? null : (u = (s * L - f * c) / A, E = (O * c - y * L) / A, new o(u, E));
690
+ var n = t.x, d = t.y, r = i.x, h = i.y, a = l.x, p = l.y, v = g.x, D = g.y, u = void 0, T = void 0, y = void 0, O = void 0, s = void 0, f = void 0, c = void 0, E = void 0, A = void 0;
691
+ return y = h - d, s = n - r, c = r * d - n * h, O = D - p, f = a - v, E = v * p - a * D, A = y * f - O * s, A === 0 ? null : (u = (s * E - f * c) / A, T = (O * c - y * E) / A, new o(u, T));
692
692
  }, e.angleOfVector = function(t, i, l, g) {
693
693
  var n = void 0;
694
694
  return t !== l ? (n = Math.atan((g - i) / (l - t)), l < t ? n += Math.PI : g < i && (n += this.TWO_PI)) : g < i ? n = this.ONE_AND_HALF_PI : n = this.HALF_PI, n;
@@ -696,13 +696,13 @@ function ft() {
696
696
  var n = t.x, d = t.y, r = i.x, h = i.y, a = l.x, p = l.y, v = g.x, D = g.y, u = (r - n) * (D - p) - (v - a) * (h - d);
697
697
  if (u === 0)
698
698
  return !1;
699
- var E = ((D - p) * (v - n) + (a - v) * (D - d)) / u, y = ((d - h) * (v - n) + (r - n) * (D - d)) / u;
700
- return 0 < E && E < 1 && 0 < y && y < 1;
699
+ var T = ((D - p) * (v - n) + (a - v) * (D - d)) / u, y = ((d - h) * (v - n) + (r - n) * (D - d)) / u;
700
+ return 0 < T && T < 1 && 0 < y && y < 1;
701
701
  }, e.HALF_PI = 0.5 * Math.PI, e.ONE_AND_HALF_PI = 1.5 * Math.PI, e.TWO_PI = 2 * Math.PI, e.THREE_PI = 3 * Math.PI, N.exports = e;
702
702
  }),
703
703
  /* 9 */
704
704
  /***/
705
- (function(N, I, T) {
705
+ (function(N, I, L) {
706
706
  function o() {
707
707
  }
708
708
  o.sign = function(e) {
@@ -715,14 +715,14 @@ function ft() {
715
715
  }),
716
716
  /* 10 */
717
717
  /***/
718
- (function(N, I, T) {
718
+ (function(N, I, L) {
719
719
  function o() {
720
720
  }
721
721
  o.MAX_VALUE = 2147483647, o.MIN_VALUE = -2147483648, N.exports = o;
722
722
  }),
723
723
  /* 11 */
724
724
  /***/
725
- (function(N, I, T) {
725
+ (function(N, I, L) {
726
726
  var o = /* @__PURE__ */ (function() {
727
727
  function n(d, r) {
728
728
  for (var h = 0; h < r.length; h++) {
@@ -748,7 +748,7 @@ function ft() {
748
748
  }, g = (function() {
749
749
  function n(d) {
750
750
  var r = this;
751
- e(this, n), this.length = 0, this.head = null, this.tail = null, d != null && d.forEach(function(h) {
751
+ e(this, n), this.length = 0, this.head = null, this.tail = null, d?.forEach(function(h) {
752
752
  return r.push(h);
753
753
  });
754
754
  }
@@ -836,7 +836,7 @@ function ft() {
836
836
  }),
837
837
  /* 12 */
838
838
  /***/
839
- (function(N, I, T) {
839
+ (function(N, I, L) {
840
840
  function o(e, t, i) {
841
841
  this.x = null, this.y = null, e == null && t == null && i == null ? (this.x = 0, this.y = 0) : typeof e == "number" && typeof t == "number" && i == null ? (this.x = e, this.y = t) : e.constructor.name == "Point" && t == null && i == null && (i = e, this.x = i.x, this.y = i.y);
842
842
  }
@@ -864,7 +864,7 @@ function ft() {
864
864
  }),
865
865
  /* 13 */
866
866
  /***/
867
- (function(N, I, T) {
867
+ (function(N, I, L) {
868
868
  function o(e, t, i, l) {
869
869
  this.x = 0, this.y = 0, this.width = 0, this.height = 0, e != null && t != null && i != null && l != null && (this.x = e, this.y = t, this.width = i, this.height = l);
870
870
  }
@@ -910,7 +910,7 @@ function ft() {
910
910
  }),
911
911
  /* 14 */
912
912
  /***/
913
- (function(N, I, T) {
913
+ (function(N, I, L) {
914
914
  var o = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(t) {
915
915
  return typeof t;
916
916
  } : function(t) {
@@ -929,7 +929,7 @@ function ft() {
929
929
  }),
930
930
  /* 15 */
931
931
  /***/
932
- (function(N, I, T) {
932
+ (function(N, I, L) {
933
933
  function o(a) {
934
934
  if (Array.isArray(a)) {
935
935
  for (var p = 0, v = Array(a.length); p < a.length; p++)
@@ -938,7 +938,7 @@ function ft() {
938
938
  } else
939
939
  return Array.from(a);
940
940
  }
941
- var e = T(0), t = T(6), i = T(3), l = T(1), g = T(5), n = T(4), d = T(17), r = T(27);
941
+ var e = L(0), t = L(6), i = L(3), l = L(1), g = L(5), n = L(4), d = L(17), r = L(27);
942
942
  function h(a) {
943
943
  r.call(this), this.layoutQuality = e.QUALITY, this.createBendsAsNeeded = e.DEFAULT_CREATE_BENDS_AS_NEEDED, this.incremental = e.DEFAULT_INCREMENTAL, this.animationOnLayout = e.DEFAULT_ANIMATION_ON_LAYOUT, this.animationDuringLayout = e.DEFAULT_ANIMATION_DURING_LAYOUT, this.animationPeriod = e.DEFAULT_ANIMATION_PERIOD, this.uniformLeafNodeSizes = e.DEFAULT_UNIFORM_LEAF_NODE_SIZES, this.edgeToDummyNodes = /* @__PURE__ */ new Map(), this.graphManager = new t(this), this.isLayoutFinished = !1, this.isSubLayout = !1, this.isRemoteUse = !1, a != null && (this.isRemoteUse = a);
944
944
  }
@@ -988,10 +988,10 @@ function ft() {
988
988
  u.update(p);
989
989
  }
990
990
  } else if (a instanceof l) {
991
- var E = a;
992
- if (E.vGraphObject != null) {
993
- var y = E.vGraphObject;
994
- y.update(E);
991
+ var T = a;
992
+ if (T.vGraphObject != null) {
993
+ var y = T.vGraphObject;
994
+ y.update(T);
995
995
  }
996
996
  } else if (a instanceof g) {
997
997
  var O = a;
@@ -1009,8 +1009,8 @@ function ft() {
1009
1009
  var p = new d(), v = this.graphManager.getRoot().updateLeftTop();
1010
1010
  if (v != null) {
1011
1011
  p.setWorldOrgX(a.x), p.setWorldOrgY(a.y), p.setDeviceOrgX(v.x), p.setDeviceOrgY(v.y);
1012
- for (var D = this.getAllNodes(), u, E = 0; E < D.length; E++)
1013
- u = D[E], u.transform(p);
1012
+ for (var D = this.getAllNodes(), u, T = 0; T < D.length; T++)
1013
+ u = D[T], u.transform(p);
1014
1014
  }
1015
1015
  }
1016
1016
  }, h.prototype.positionNodesRandomly = function(a) {
@@ -1024,16 +1024,16 @@ function ft() {
1024
1024
  v[u].getChild() != null && (D = !1);
1025
1025
  if (!D)
1026
1026
  return a;
1027
- var E = /* @__PURE__ */ new Set(), y = [], O = /* @__PURE__ */ new Map(), s = [];
1027
+ var T = /* @__PURE__ */ new Set(), y = [], O = /* @__PURE__ */ new Map(), s = [];
1028
1028
  for (s = s.concat(v); s.length > 0 && p; ) {
1029
1029
  for (y.push(s[0]); y.length > 0 && p; ) {
1030
1030
  var f = y[0];
1031
- y.splice(0, 1), E.add(f);
1031
+ y.splice(0, 1), T.add(f);
1032
1032
  for (var c = f.getEdges(), u = 0; u < c.length; u++) {
1033
- var L = c[u].getOtherEnd(f);
1034
- if (O.get(f) != L)
1035
- if (!E.has(L))
1036
- y.push(L), O.set(L, f);
1033
+ var E = c[u].getOtherEnd(f);
1034
+ if (O.get(f) != E)
1035
+ if (!T.has(E))
1036
+ y.push(E), O.set(E, f);
1037
1037
  else {
1038
1038
  p = !1;
1039
1039
  break;
@@ -1043,22 +1043,22 @@ function ft() {
1043
1043
  if (!p)
1044
1044
  a = [];
1045
1045
  else {
1046
- var A = [].concat(o(E));
1046
+ var A = [].concat(o(T));
1047
1047
  a.push(A);
1048
1048
  for (var u = 0; u < A.length; u++) {
1049
1049
  var m = A[u], C = s.indexOf(m);
1050
1050
  C > -1 && s.splice(C, 1);
1051
1051
  }
1052
- E = /* @__PURE__ */ new Set(), O = /* @__PURE__ */ new Map();
1052
+ T = /* @__PURE__ */ new Set(), O = /* @__PURE__ */ new Map();
1053
1053
  }
1054
1054
  }
1055
1055
  return a;
1056
1056
  }, h.prototype.createDummyNodesForBendpoints = function(a) {
1057
1057
  for (var p = [], v = a.source, D = this.graphManager.calcLowestCommonAncestor(a.source, a.target), u = 0; u < a.bendpoints.length; u++) {
1058
- var E = this.newNode(null);
1059
- E.setRect(new Point(0, 0), new Dimension(1, 1)), D.add(E);
1058
+ var T = this.newNode(null);
1059
+ T.setRect(new Point(0, 0), new Dimension(1, 1)), D.add(T);
1060
1060
  var y = this.newEdge(null);
1061
- this.graphManager.add(y, v, E), p.add(E), v = E;
1061
+ this.graphManager.add(y, v, T), p.add(T), v = T;
1062
1062
  }
1063
1063
  var y = this.newEdge(null);
1064
1064
  return this.graphManager.add(y, v, a.target), this.edgeToDummyNodes.set(a, p), a.isInterGraph() ? this.graphManager.remove(a) : D.remove(a), p;
@@ -1069,8 +1069,8 @@ function ft() {
1069
1069
  var v = a[p];
1070
1070
  if (v.bendpoints.length > 0) {
1071
1071
  for (var D = this.edgeToDummyNodes.get(v), u = 0; u < D.length; u++) {
1072
- var E = D[u], y = new n(E.getCenterX(), E.getCenterY()), O = v.bendpoints.get(u);
1073
- O.x = y.x, O.y = y.y, E.getOwner().remove(E);
1072
+ var T = D[u], y = new n(T.getCenterX(), T.getCenterY()), O = v.bendpoints.get(u);
1073
+ O.x = y.x, O.y = y.y, T.getOwner().remove(T);
1074
1074
  }
1075
1075
  this.graphManager.add(v, v.source, v.target);
1076
1076
  }
@@ -1079,8 +1079,8 @@ function ft() {
1079
1079
  if (v != null && D != null) {
1080
1080
  var u = p;
1081
1081
  if (a <= 50) {
1082
- var E = p / v;
1083
- u -= (p - E) / 50 * (50 - a);
1082
+ var T = p / v;
1083
+ u -= (p - T) / 50 * (50 - a);
1084
1084
  } else {
1085
1085
  var y = p * D;
1086
1086
  u += (y - p) / 50 * (a - 50);
@@ -1093,8 +1093,8 @@ function ft() {
1093
1093
  }, h.findCenterOfTree = function(a) {
1094
1094
  var p = [];
1095
1095
  p = p.concat(a);
1096
- var v = [], D = /* @__PURE__ */ new Map(), u = !1, E = null;
1097
- (p.length == 1 || p.length == 2) && (u = !0, E = p[0]);
1096
+ var v = [], D = /* @__PURE__ */ new Map(), u = !1, T = null;
1097
+ (p.length == 1 || p.length == 2) && (u = !0, T = p[0]);
1098
1098
  for (var y = 0; y < p.length; y++) {
1099
1099
  var O = p[y], s = O.getNeighborsList().size;
1100
1100
  D.set(O, O.getNeighborsList().size), s == 1 && v.push(O);
@@ -1104,8 +1104,8 @@ function ft() {
1104
1104
  var c = [];
1105
1105
  c = c.concat(f), f = [];
1106
1106
  for (var y = 0; y < p.length; y++) {
1107
- var O = p[y], L = p.indexOf(O);
1108
- L >= 0 && p.splice(L, 1);
1107
+ var O = p[y], E = p.indexOf(O);
1108
+ E >= 0 && p.splice(E, 1);
1109
1109
  var A = O.getNeighborsList();
1110
1110
  A.forEach(function(R) {
1111
1111
  if (v.indexOf(R) < 0) {
@@ -1114,16 +1114,16 @@ function ft() {
1114
1114
  }
1115
1115
  });
1116
1116
  }
1117
- v = v.concat(f), (p.length == 1 || p.length == 2) && (u = !0, E = p[0]);
1117
+ v = v.concat(f), (p.length == 1 || p.length == 2) && (u = !0, T = p[0]);
1118
1118
  }
1119
- return E;
1119
+ return T;
1120
1120
  }, h.prototype.setGraphManager = function(a) {
1121
1121
  this.graphManager = a;
1122
1122
  }, N.exports = h;
1123
1123
  }),
1124
1124
  /* 16 */
1125
1125
  /***/
1126
- (function(N, I, T) {
1126
+ (function(N, I, L) {
1127
1127
  function o() {
1128
1128
  }
1129
1129
  o.seed = 1, o.x = 0, o.nextDouble = function() {
@@ -1132,8 +1132,8 @@ function ft() {
1132
1132
  }),
1133
1133
  /* 17 */
1134
1134
  /***/
1135
- (function(N, I, T) {
1136
- var o = T(4);
1135
+ (function(N, I, L) {
1136
+ var o = L(4);
1137
1137
  function e(t, i) {
1138
1138
  this.lworldOrgX = 0, this.lworldOrgY = 0, this.ldeviceOrgX = 0, this.ldeviceOrgY = 0, this.lworldExtX = 1, this.lworldExtY = 1, this.ldeviceExtX = 1, this.ldeviceExtY = 1;
1139
1139
  }
@@ -1188,7 +1188,7 @@ function ft() {
1188
1188
  }),
1189
1189
  /* 18 */
1190
1190
  /***/
1191
- (function(N, I, T) {
1191
+ (function(N, I, L) {
1192
1192
  function o(r) {
1193
1193
  if (Array.isArray(r)) {
1194
1194
  for (var h = 0, a = Array(r.length); h < r.length; h++)
@@ -1197,7 +1197,7 @@ function ft() {
1197
1197
  } else
1198
1198
  return Array.from(r);
1199
1199
  }
1200
- var e = T(15), t = T(7), i = T(0), l = T(8), g = T(9);
1200
+ var e = L(15), t = L(7), i = L(0), l = L(8), g = L(9);
1201
1201
  function n() {
1202
1202
  e.call(this), this.useSmartIdealEdgeLengthCalculation = t.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.idealEdgeLength = t.DEFAULT_EDGE_LENGTH, this.springConstant = t.DEFAULT_SPRING_STRENGTH, this.repulsionConstant = t.DEFAULT_REPULSION_STRENGTH, this.gravityConstant = t.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = t.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = t.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = t.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.displacementThresholdPerNode = 3 * t.DEFAULT_EDGE_LENGTH / 100, this.coolingFactor = t.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.initialCoolingFactor = t.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.totalDisplacement = 0, this.oldTotalDisplacement = 0, this.maxIterations = t.MAX_ITERATIONS;
1203
1203
  }
@@ -1207,8 +1207,8 @@ function ft() {
1207
1207
  n.prototype.initParameters = function() {
1208
1208
  e.prototype.initParameters.call(this, arguments), this.totalIterations = 0, this.notAnimatedIterations = 0, this.useFRGridVariant = t.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION, this.grid = [];
1209
1209
  }, n.prototype.calcIdealEdgeLengths = function() {
1210
- for (var r, h, a, p, v, D, u = this.getGraphManager().getAllEdges(), E = 0; E < u.length; E++)
1211
- r = u[E], r.idealLength = this.idealEdgeLength, r.isInterGraph && (a = r.getSource(), p = r.getTarget(), v = r.getSourceInLca().getEstimatedSize(), D = r.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (r.idealLength += v + D - 2 * i.SIMPLE_NODE_SIZE), h = r.getLca().getInclusionTreeDepth(), r.idealLength += t.DEFAULT_EDGE_LENGTH * t.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (a.getInclusionTreeDepth() + p.getInclusionTreeDepth() - 2 * h));
1210
+ for (var r, h, a, p, v, D, u = this.getGraphManager().getAllEdges(), T = 0; T < u.length; T++)
1211
+ r = u[T], r.idealLength = this.idealEdgeLength, r.isInterGraph && (a = r.getSource(), p = r.getTarget(), v = r.getSourceInLca().getEstimatedSize(), D = r.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (r.idealLength += v + D - 2 * i.SIMPLE_NODE_SIZE), h = r.getLca().getInclusionTreeDepth(), r.idealLength += t.DEFAULT_EDGE_LENGTH * t.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (a.getInclusionTreeDepth() + p.getInclusionTreeDepth() - 2 * h));
1212
1212
  }, n.prototype.initSpringEmbedder = function() {
1213
1213
  var r = this.getAllNodes().length;
1214
1214
  this.incremental ? (r > t.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * t.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (r - t.ADAPTATION_LOWER_NODE_LIMIT) / (t.ADAPTATION_UPPER_NODE_LIMIT - t.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - t.COOLING_ADAPTATION_FACTOR))), this.maxNodeDisplacement = t.MAX_NODE_DISPLACEMENT_INCREMENTAL) : (r > t.ADAPTATION_LOWER_NODE_LIMIT ? this.coolingFactor = Math.max(t.COOLING_ADAPTATION_FACTOR, 1 - (r - t.ADAPTATION_LOWER_NODE_LIMIT) / (t.ADAPTATION_UPPER_NODE_LIMIT - t.ADAPTATION_LOWER_NODE_LIMIT) * (1 - t.COOLING_ADAPTATION_FACTOR)) : this.coolingFactor = 1, this.initialCoolingFactor = this.coolingFactor, this.maxNodeDisplacement = t.MAX_NODE_DISPLACEMENT), this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations), this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length, this.repulsionRange = this.calcRepulsionRange();
@@ -1216,10 +1216,10 @@ function ft() {
1216
1216
  for (var r = this.getAllEdges(), h, a = 0; a < r.length; a++)
1217
1217
  h = r[a], this.calcSpringForce(h, h.idealLength);
1218
1218
  }, n.prototype.calcRepulsionForces = function() {
1219
- var r = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, h = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, a, p, v, D, u = this.getAllNodes(), E;
1219
+ var r = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, h = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, a, p, v, D, u = this.getAllNodes(), T;
1220
1220
  if (this.useFRGridVariant)
1221
- for (this.totalIterations % t.GRID_CALCULATION_CHECK_PERIOD == 1 && r && this.updateGrid(), E = /* @__PURE__ */ new Set(), a = 0; a < u.length; a++)
1222
- v = u[a], this.calculateRepulsionForceOfANode(v, E, r, h), E.add(v);
1221
+ for (this.totalIterations % t.GRID_CALCULATION_CHECK_PERIOD == 1 && r && this.updateGrid(), T = /* @__PURE__ */ new Set(), a = 0; a < u.length; a++)
1222
+ v = u[a], this.calculateRepulsionForceOfANode(v, T, r, h), T.add(v);
1223
1223
  else
1224
1224
  for (a = 0; a < u.length; a++)
1225
1225
  for (v = u[a], p = a + 1; p < u.length; p++)
@@ -1231,23 +1231,23 @@ function ft() {
1231
1231
  for (var r = this.getAllNodes(), h, a = 0; a < r.length; a++)
1232
1232
  h = r[a], h.move();
1233
1233
  }, n.prototype.calcSpringForce = function(r, h) {
1234
- var a = r.getSource(), p = r.getTarget(), v, D, u, E;
1234
+ var a = r.getSource(), p = r.getTarget(), v, D, u, T;
1235
1235
  if (this.uniformLeafNodeSizes && a.getChild() == null && p.getChild() == null)
1236
1236
  r.updateLengthSimple();
1237
1237
  else if (r.updateLength(), r.isOverlapingSourceAndTarget)
1238
1238
  return;
1239
- v = r.getLength(), v != 0 && (D = this.springConstant * (v - h), u = D * (r.lengthX / v), E = D * (r.lengthY / v), a.springForceX += u, a.springForceY += E, p.springForceX -= u, p.springForceY -= E);
1239
+ v = r.getLength(), v != 0 && (D = this.springConstant * (v - h), u = D * (r.lengthX / v), T = D * (r.lengthY / v), a.springForceX += u, a.springForceY += T, p.springForceX -= u, p.springForceY -= T);
1240
1240
  }, n.prototype.calcRepulsionForce = function(r, h) {
1241
- var a = r.getRect(), p = h.getRect(), v = new Array(2), D = new Array(4), u, E, y, O, s, f, c;
1241
+ var a = r.getRect(), p = h.getRect(), v = new Array(2), D = new Array(4), u, T, y, O, s, f, c;
1242
1242
  if (a.intersects(p)) {
1243
1243
  l.calcSeparationAmount(a, p, v, t.DEFAULT_EDGE_LENGTH / 2), f = 2 * v[0], c = 2 * v[1];
1244
- var L = r.noOfChildren * h.noOfChildren / (r.noOfChildren + h.noOfChildren);
1245
- r.repulsionForceX -= L * f, r.repulsionForceY -= L * c, h.repulsionForceX += L * f, h.repulsionForceY += L * c;
1244
+ var E = r.noOfChildren * h.noOfChildren / (r.noOfChildren + h.noOfChildren);
1245
+ r.repulsionForceX -= E * f, r.repulsionForceY -= E * c, h.repulsionForceX += E * f, h.repulsionForceY += E * c;
1246
1246
  } else
1247
- this.uniformLeafNodeSizes && r.getChild() == null && h.getChild() == null ? (u = p.getCenterX() - a.getCenterX(), E = p.getCenterY() - a.getCenterY()) : (l.getIntersection(a, p, D), u = D[2] - D[0], E = D[3] - D[1]), Math.abs(u) < t.MIN_REPULSION_DIST && (u = g.sign(u) * t.MIN_REPULSION_DIST), Math.abs(E) < t.MIN_REPULSION_DIST && (E = g.sign(E) * t.MIN_REPULSION_DIST), y = u * u + E * E, O = Math.sqrt(y), s = this.repulsionConstant * r.noOfChildren * h.noOfChildren / y, f = s * u / O, c = s * E / O, r.repulsionForceX -= f, r.repulsionForceY -= c, h.repulsionForceX += f, h.repulsionForceY += c;
1247
+ this.uniformLeafNodeSizes && r.getChild() == null && h.getChild() == null ? (u = p.getCenterX() - a.getCenterX(), T = p.getCenterY() - a.getCenterY()) : (l.getIntersection(a, p, D), u = D[2] - D[0], T = D[3] - D[1]), Math.abs(u) < t.MIN_REPULSION_DIST && (u = g.sign(u) * t.MIN_REPULSION_DIST), Math.abs(T) < t.MIN_REPULSION_DIST && (T = g.sign(T) * t.MIN_REPULSION_DIST), y = u * u + T * T, O = Math.sqrt(y), s = this.repulsionConstant * r.noOfChildren * h.noOfChildren / y, f = s * u / O, c = s * T / O, r.repulsionForceX -= f, r.repulsionForceY -= c, h.repulsionForceX += f, h.repulsionForceY += c;
1248
1248
  }, n.prototype.calcGravitationalForce = function(r) {
1249
- var h, a, p, v, D, u, E, y;
1250
- h = r.getOwner(), a = (h.getRight() + h.getLeft()) / 2, p = (h.getTop() + h.getBottom()) / 2, v = r.getCenterX() - a, D = r.getCenterY() - p, u = Math.abs(v) + r.getWidth() / 2, E = Math.abs(D) + r.getHeight() / 2, r.getOwner() == this.graphManager.getRoot() ? (y = h.getEstimatedSize() * this.gravityRangeFactor, (u > y || E > y) && (r.gravitationForceX = -this.gravityConstant * v, r.gravitationForceY = -this.gravityConstant * D)) : (y = h.getEstimatedSize() * this.compoundGravityRangeFactor, (u > y || E > y) && (r.gravitationForceX = -this.gravityConstant * v * this.compoundGravityConstant, r.gravitationForceY = -this.gravityConstant * D * this.compoundGravityConstant));
1249
+ var h, a, p, v, D, u, T, y;
1250
+ h = r.getOwner(), a = (h.getRight() + h.getLeft()) / 2, p = (h.getTop() + h.getBottom()) / 2, v = r.getCenterX() - a, D = r.getCenterY() - p, u = Math.abs(v) + r.getWidth() / 2, T = Math.abs(D) + r.getHeight() / 2, r.getOwner() == this.graphManager.getRoot() ? (y = h.getEstimatedSize() * this.gravityRangeFactor, (u > y || T > y) && (r.gravitationForceX = -this.gravityConstant * v, r.gravitationForceY = -this.gravityConstant * D)) : (y = h.getEstimatedSize() * this.compoundGravityRangeFactor, (u > y || T > y) && (r.gravitationForceX = -this.gravityConstant * v * this.compoundGravityConstant, r.gravitationForceY = -this.gravityConstant * D * this.compoundGravityConstant));
1251
1251
  }, n.prototype.isConverged = function() {
1252
1252
  var r, h = !1;
1253
1253
  return this.totalIterations > this.maxIterations / 3 && (h = Math.abs(this.totalDisplacement - this.oldTotalDisplacement) < 2), r = this.totalDisplacement < this.totalDisplacementThreshold, this.oldTotalDisplacement = this.totalDisplacement, r || h;
@@ -1268,9 +1268,9 @@ function ft() {
1268
1268
  }, n.prototype.addNodeToGrid = function(r, h, a) {
1269
1269
  var p = 0, v = 0, D = 0, u = 0;
1270
1270
  p = parseInt(Math.floor((r.getRect().x - h) / this.repulsionRange)), v = parseInt(Math.floor((r.getRect().width + r.getRect().x - h) / this.repulsionRange)), D = parseInt(Math.floor((r.getRect().y - a) / this.repulsionRange)), u = parseInt(Math.floor((r.getRect().height + r.getRect().y - a) / this.repulsionRange));
1271
- for (var E = p; E <= v; E++)
1271
+ for (var T = p; T <= v; T++)
1272
1272
  for (var y = D; y <= u; y++)
1273
- this.grid[E][y].push(r), r.setGridCoordinates(p, v, D, u);
1273
+ this.grid[T][y].push(r), r.setGridCoordinates(p, v, D, u);
1274
1274
  }, n.prototype.updateGrid = function() {
1275
1275
  var r, h, a = this.getAllNodes();
1276
1276
  for (this.grid = this.calcGrid(this.graphManager.getRoot()), r = 0; r < a.length; r++)
@@ -1279,27 +1279,27 @@ function ft() {
1279
1279
  if (this.totalIterations % t.GRID_CALCULATION_CHECK_PERIOD == 1 && a || p) {
1280
1280
  var v = /* @__PURE__ */ new Set();
1281
1281
  r.surrounding = new Array();
1282
- for (var D, u = this.grid, E = r.startX - 1; E < r.finishX + 2; E++)
1282
+ for (var D, u = this.grid, T = r.startX - 1; T < r.finishX + 2; T++)
1283
1283
  for (var y = r.startY - 1; y < r.finishY + 2; y++)
1284
- if (!(E < 0 || y < 0 || E >= u.length || y >= u[0].length)) {
1285
- for (var O = 0; O < u[E][y].length; O++)
1286
- if (D = u[E][y][O], !(r.getOwner() != D.getOwner() || r == D) && !h.has(D) && !v.has(D)) {
1284
+ if (!(T < 0 || y < 0 || T >= u.length || y >= u[0].length)) {
1285
+ for (var O = 0; O < u[T][y].length; O++)
1286
+ if (D = u[T][y][O], !(r.getOwner() != D.getOwner() || r == D) && !h.has(D) && !v.has(D)) {
1287
1287
  var s = Math.abs(r.getCenterX() - D.getCenterX()) - (r.getWidth() / 2 + D.getWidth() / 2), f = Math.abs(r.getCenterY() - D.getCenterY()) - (r.getHeight() / 2 + D.getHeight() / 2);
1288
1288
  s <= this.repulsionRange && f <= this.repulsionRange && v.add(D);
1289
1289
  }
1290
1290
  }
1291
1291
  r.surrounding = [].concat(o(v));
1292
1292
  }
1293
- for (E = 0; E < r.surrounding.length; E++)
1294
- this.calcRepulsionForce(r, r.surrounding[E]);
1293
+ for (T = 0; T < r.surrounding.length; T++)
1294
+ this.calcRepulsionForce(r, r.surrounding[T]);
1295
1295
  }, n.prototype.calcRepulsionRange = function() {
1296
1296
  return 0;
1297
1297
  }, N.exports = n;
1298
1298
  }),
1299
1299
  /* 19 */
1300
1300
  /***/
1301
- (function(N, I, T) {
1302
- var o = T(1), e = T(7);
1301
+ (function(N, I, L) {
1302
+ var o = L(1), e = L(7);
1303
1303
  function t(l, g, n) {
1304
1304
  o.call(this, l, g, n), this.idealLength = e.DEFAULT_EDGE_LENGTH;
1305
1305
  }
@@ -1310,8 +1310,8 @@ function ft() {
1310
1310
  }),
1311
1311
  /* 20 */
1312
1312
  /***/
1313
- (function(N, I, T) {
1314
- var o = T(3);
1313
+ (function(N, I, L) {
1314
+ var o = L(3);
1315
1315
  function e(i, l, g, n) {
1316
1316
  o.call(this, i, l, g, n), this.springForceX = 0, this.springForceY = 0, this.repulsionForceX = 0, this.repulsionForceY = 0, this.gravitationForceX = 0, this.gravitationForceY = 0, this.displacementX = 0, this.displacementY = 0, this.startX = 0, this.finishX = 0, this.startY = 0, this.finishY = 0, this.surrounding = [];
1317
1317
  }
@@ -1324,7 +1324,7 @@ function ft() {
1324
1324
  }),
1325
1325
  /* 21 */
1326
1326
  /***/
1327
- (function(N, I, T) {
1327
+ (function(N, I, L) {
1328
1328
  function o(e, t) {
1329
1329
  this.width = 0, this.height = 0, e !== null && t !== null && (this.height = t, this.width = e);
1330
1330
  }
@@ -1340,8 +1340,8 @@ function ft() {
1340
1340
  }),
1341
1341
  /* 22 */
1342
1342
  /***/
1343
- (function(N, I, T) {
1344
- var o = T(14);
1343
+ (function(N, I, L) {
1344
+ var o = L(14);
1345
1345
  function e() {
1346
1346
  this.map = {}, this.keys = [];
1347
1347
  }
@@ -1359,8 +1359,8 @@ function ft() {
1359
1359
  }),
1360
1360
  /* 23 */
1361
1361
  /***/
1362
- (function(N, I, T) {
1363
- var o = T(14);
1362
+ (function(N, I, L) {
1363
+ var o = L(14);
1364
1364
  function e() {
1365
1365
  this.set = {};
1366
1366
  }
@@ -1391,7 +1391,7 @@ function ft() {
1391
1391
  }),
1392
1392
  /* 24 */
1393
1393
  /***/
1394
- (function(N, I, T) {
1394
+ (function(N, I, L) {
1395
1395
  var o = /* @__PURE__ */ (function() {
1396
1396
  function l(g, n) {
1397
1397
  for (var d = 0; d < n.length; d++) {
@@ -1407,7 +1407,7 @@ function ft() {
1407
1407
  if (!(l instanceof g))
1408
1408
  throw new TypeError("Cannot call a class as a function");
1409
1409
  }
1410
- var t = T(11), i = (function() {
1410
+ var t = L(11), i = (function() {
1411
1411
  function l(g, n) {
1412
1412
  e(this, l), (n !== null || n !== void 0) && (this.compareFunction = this._defaultCompareFunction);
1413
1413
  var d = void 0;
@@ -1461,7 +1461,7 @@ function ft() {
1461
1461
  }),
1462
1462
  /* 25 */
1463
1463
  /***/
1464
- (function(N, I, T) {
1464
+ (function(N, I, L) {
1465
1465
  var o = /* @__PURE__ */ (function() {
1466
1466
  function i(l, g) {
1467
1467
  for (var n = 0; n < g.length; n++) {
@@ -1570,14 +1570,14 @@ function ft() {
1570
1570
  }),
1571
1571
  /* 26 */
1572
1572
  /***/
1573
- (function(N, I, T) {
1573
+ (function(N, I, L) {
1574
1574
  var o = function() {
1575
1575
  };
1576
- o.FDLayout = T(18), o.FDLayoutConstants = T(7), o.FDLayoutEdge = T(19), o.FDLayoutNode = T(20), o.DimensionD = T(21), o.HashMap = T(22), o.HashSet = T(23), o.IGeometry = T(8), o.IMath = T(9), o.Integer = T(10), o.Point = T(12), o.PointD = T(4), o.RandomSeed = T(16), o.RectangleD = T(13), o.Transform = T(17), o.UniqueIDGeneretor = T(14), o.Quicksort = T(24), o.LinkedList = T(11), o.LGraphObject = T(2), o.LGraph = T(5), o.LEdge = T(1), o.LGraphManager = T(6), o.LNode = T(3), o.Layout = T(15), o.LayoutConstants = T(0), o.NeedlemanWunsch = T(25), N.exports = o;
1576
+ o.FDLayout = L(18), o.FDLayoutConstants = L(7), o.FDLayoutEdge = L(19), o.FDLayoutNode = L(20), o.DimensionD = L(21), o.HashMap = L(22), o.HashSet = L(23), o.IGeometry = L(8), o.IMath = L(9), o.Integer = L(10), o.Point = L(12), o.PointD = L(4), o.RandomSeed = L(16), o.RectangleD = L(13), o.Transform = L(17), o.UniqueIDGeneretor = L(14), o.Quicksort = L(24), o.LinkedList = L(11), o.LGraphObject = L(2), o.LGraph = L(5), o.LEdge = L(1), o.LGraphManager = L(6), o.LNode = L(3), o.Layout = L(15), o.LayoutConstants = L(0), o.NeedlemanWunsch = L(25), N.exports = o;
1577
1577
  }),
1578
1578
  /* 27 */
1579
1579
  /***/
1580
- (function(N, I, T) {
1580
+ (function(N, I, L) {
1581
1581
  function o() {
1582
1582
  this.listeners = [];
1583
1583
  }
@@ -1608,17 +1608,17 @@ function ft() {
1608
1608
  var ct = $.exports, z;
1609
1609
  function pt() {
1610
1610
  return z || (z = 1, (function(G, b) {
1611
- (function(I, T) {
1612
- G.exports = T(ft());
1611
+ (function(I, L) {
1612
+ G.exports = L(ft());
1613
1613
  })(ct, function(N) {
1614
1614
  return (
1615
1615
  /******/
1616
1616
  (function(I) {
1617
- var T = {};
1617
+ var L = {};
1618
1618
  function o(e) {
1619
- if (T[e])
1620
- return T[e].exports;
1621
- var t = T[e] = {
1619
+ if (L[e])
1620
+ return L[e].exports;
1621
+ var t = L[e] = {
1622
1622
  /******/
1623
1623
  i: e,
1624
1624
  /******/
@@ -1629,7 +1629,7 @@ function pt() {
1629
1629
  };
1630
1630
  return I[e].call(t.exports, t, t.exports, o), t.l = !0, t.exports;
1631
1631
  }
1632
- return o.m = I, o.c = T, o.i = function(e) {
1632
+ return o.m = I, o.c = L, o.i = function(e) {
1633
1633
  return e;
1634
1634
  }, o.d = function(e, t, i) {
1635
1635
  o.o(e, t) || Object.defineProperty(e, t, {
@@ -1660,12 +1660,12 @@ function pt() {
1660
1660
  })([
1661
1661
  /* 0 */
1662
1662
  /***/
1663
- (function(I, T) {
1663
+ (function(I, L) {
1664
1664
  I.exports = N;
1665
1665
  }),
1666
1666
  /* 1 */
1667
1667
  /***/
1668
- (function(I, T, o) {
1668
+ (function(I, L, o) {
1669
1669
  var e = o(0).FDLayoutConstants;
1670
1670
  function t() {
1671
1671
  }
@@ -1675,7 +1675,7 @@ function pt() {
1675
1675
  }),
1676
1676
  /* 2 */
1677
1677
  /***/
1678
- (function(I, T, o) {
1678
+ (function(I, L, o) {
1679
1679
  var e = o(0).FDLayoutEdge;
1680
1680
  function t(l, g, n) {
1681
1681
  e.call(this, l, g, n);
@@ -1687,7 +1687,7 @@ function pt() {
1687
1687
  }),
1688
1688
  /* 3 */
1689
1689
  /***/
1690
- (function(I, T, o) {
1690
+ (function(I, L, o) {
1691
1691
  var e = o(0).LGraph;
1692
1692
  function t(l, g, n) {
1693
1693
  e.call(this, l, g, n);
@@ -1699,7 +1699,7 @@ function pt() {
1699
1699
  }),
1700
1700
  /* 4 */
1701
1701
  /***/
1702
- (function(I, T, o) {
1702
+ (function(I, L, o) {
1703
1703
  var e = o(0).LGraphManager;
1704
1704
  function t(l) {
1705
1705
  e.call(this, l);
@@ -1711,7 +1711,7 @@ function pt() {
1711
1711
  }),
1712
1712
  /* 5 */
1713
1713
  /***/
1714
- (function(I, T, o) {
1714
+ (function(I, L, o) {
1715
1715
  var e = o(0).FDLayoutNode, t = o(0).IMath;
1716
1716
  function i(g, n, d, r) {
1717
1717
  e.call(this, g, n, d, r);
@@ -1743,8 +1743,8 @@ function pt() {
1743
1743
  }),
1744
1744
  /* 6 */
1745
1745
  /***/
1746
- (function(I, T, o) {
1747
- var e = o(0).FDLayout, t = o(4), i = o(3), l = o(5), g = o(2), n = o(1), d = o(0).FDLayoutConstants, r = o(0).LayoutConstants, h = o(0).Point, a = o(0).PointD, p = o(0).Layout, v = o(0).Integer, D = o(0).IGeometry, u = o(0).LGraph, E = o(0).Transform;
1746
+ (function(I, L, o) {
1747
+ var e = o(0).FDLayout, t = o(4), i = o(3), l = o(5), g = o(2), n = o(1), d = o(0).FDLayoutConstants, r = o(0).LayoutConstants, h = o(0).Point, a = o(0).PointD, p = o(0).Layout, v = o(0).Integer, D = o(0).IGeometry, u = o(0).LGraph, T = o(0).Transform;
1748
1748
  function y() {
1749
1749
  e.call(this), this.toBeTiled = {};
1750
1750
  }
@@ -1780,8 +1780,8 @@ function pt() {
1780
1780
  this.positionNodesRadially(s);
1781
1781
  else {
1782
1782
  this.reduceTrees(), this.graphManager.resetAllNodesToApplyGravitation();
1783
- var f = new Set(this.getAllNodes()), c = this.nodesWithGravity.filter(function(L) {
1784
- return f.has(L);
1783
+ var f = new Set(this.getAllNodes()), c = this.nodesWithGravity.filter(function(E) {
1784
+ return f.has(E);
1785
1785
  });
1786
1786
  this.graphManager.setAllNodesToApplyGravitation(c), this.positionNodesRandomly();
1787
1787
  }
@@ -1818,17 +1818,17 @@ function pt() {
1818
1818
  return !0;
1819
1819
  this.afterGrowthIterations % 10 == 0 && (this.graphManager.updateBounds(), this.updateGrid()), this.coolingFactor = d.DEFAULT_COOLING_FACTOR_INCREMENTAL * ((100 - this.afterGrowthIterations) / 100), this.afterGrowthIterations++;
1820
1820
  }
1821
- var c = !this.isTreeGrowing && !this.isGrowthFinished, L = this.growTreeIterations % 10 == 1 && this.isTreeGrowing || this.afterGrowthIterations % 10 == 1 && this.isGrowthFinished;
1822
- return this.totalDisplacement = 0, this.graphManager.updateBounds(), this.calcSpringForces(), this.calcRepulsionForces(c, L), this.calcGravitationalForces(), this.moveNodes(), this.animate(), !1;
1821
+ var c = !this.isTreeGrowing && !this.isGrowthFinished, E = this.growTreeIterations % 10 == 1 && this.isTreeGrowing || this.afterGrowthIterations % 10 == 1 && this.isGrowthFinished;
1822
+ return this.totalDisplacement = 0, this.graphManager.updateBounds(), this.calcSpringForces(), this.calcRepulsionForces(c, E), this.calcGravitationalForces(), this.moveNodes(), this.animate(), !1;
1823
1823
  }, y.prototype.getPositionsData = function() {
1824
1824
  for (var s = this.graphManager.getAllNodes(), f = {}, c = 0; c < s.length; c++) {
1825
- var L = s[c].rect, A = s[c].id;
1825
+ var E = s[c].rect, A = s[c].id;
1826
1826
  f[A] = {
1827
1827
  id: A,
1828
- x: L.getCenterX(),
1829
- y: L.getCenterY(),
1830
- w: L.width,
1831
- h: L.height
1828
+ x: E.getCenterX(),
1829
+ y: E.getCenterY(),
1830
+ w: E.width,
1831
+ h: E.height
1832
1832
  };
1833
1833
  }
1834
1834
  return f;
@@ -1843,8 +1843,8 @@ function pt() {
1843
1843
  this.graphManager.updateBounds();
1844
1844
  }
1845
1845
  }, y.prototype.calculateNodesToApplyGravitationTo = function() {
1846
- var s = [], f, c = this.graphManager.getGraphs(), L = c.length, A;
1847
- for (A = 0; A < L; A++)
1846
+ var s = [], f, c = this.graphManager.getGraphs(), E = c.length, A;
1847
+ for (A = 0; A < E; A++)
1848
1848
  f = c[A], f.updateConnected(), f.isConnected || (s = s.concat(f.getNodes()));
1849
1849
  return s;
1850
1850
  }, y.prototype.createBendpoints = function() {
@@ -1852,11 +1852,11 @@ function pt() {
1852
1852
  s = s.concat(this.graphManager.getAllEdges());
1853
1853
  var f = /* @__PURE__ */ new Set(), c;
1854
1854
  for (c = 0; c < s.length; c++) {
1855
- var L = s[c];
1856
- if (!f.has(L)) {
1857
- var A = L.getSource(), m = L.getTarget();
1855
+ var E = s[c];
1856
+ if (!f.has(E)) {
1857
+ var A = E.getSource(), m = E.getTarget();
1858
1858
  if (A == m)
1859
- L.getBendpoints().push(new a()), L.getBendpoints().push(new a()), this.createDummyNodesForBendpoints(L), f.add(L);
1859
+ E.getBendpoints().push(new a()), E.getBendpoints().push(new a()), this.createDummyNodesForBendpoints(E), f.add(E);
1860
1860
  else {
1861
1861
  var C = [];
1862
1862
  if (C = C.concat(A.getEdgeListToNode(m)), C = C.concat(m.getEdgeListToNode(A)), !f.has(C[0])) {
@@ -1877,16 +1877,16 @@ function pt() {
1877
1877
  break;
1878
1878
  }
1879
1879
  }, y.prototype.positionNodesRadially = function(s) {
1880
- for (var f = new h(0, 0), c = Math.ceil(Math.sqrt(s.length)), L = 0, A = 0, m = 0, C = new a(0, 0), R = 0; R < s.length; R++) {
1881
- R % c == 0 && (m = 0, A = L, R != 0 && (A += n.DEFAULT_COMPONENT_SEPERATION), L = 0);
1880
+ for (var f = new h(0, 0), c = Math.ceil(Math.sqrt(s.length)), E = 0, A = 0, m = 0, C = new a(0, 0), R = 0; R < s.length; R++) {
1881
+ R % c == 0 && (m = 0, A = E, R != 0 && (A += n.DEFAULT_COMPONENT_SEPERATION), E = 0);
1882
1882
  var M = s[R], S = p.findCenterOfTree(M);
1883
- f.x = m, f.y = A, C = y.radialLayout(M, S, f), C.y > L && (L = Math.floor(C.y)), m = Math.floor(C.x + n.DEFAULT_COMPONENT_SEPERATION);
1883
+ f.x = m, f.y = A, C = y.radialLayout(M, S, f), C.y > E && (E = Math.floor(C.y)), m = Math.floor(C.x + n.DEFAULT_COMPONENT_SEPERATION);
1884
1884
  }
1885
1885
  this.transform(new a(r.WORLD_CENTER_X - C.x / 2, r.WORLD_CENTER_Y - C.y / 2));
1886
1886
  }, y.radialLayout = function(s, f, c) {
1887
- var L = Math.max(this.maxDiagonalInTree(s), n.DEFAULT_RADIAL_SEPARATION);
1888
- y.branchRadialLayout(f, null, 0, 359, 0, L);
1889
- var A = u.calculateBounds(s), m = new E();
1887
+ var E = Math.max(this.maxDiagonalInTree(s), n.DEFAULT_RADIAL_SEPARATION);
1888
+ y.branchRadialLayout(f, null, 0, 359, 0, E);
1889
+ var A = u.calculateBounds(s), m = new T();
1890
1890
  m.setDeviceOrgX(A.getMinX()), m.setDeviceOrgY(A.getMinY()), m.setWorldOrgX(c.x), m.setWorldOrgY(c.y);
1891
1891
  for (var C = 0; C < s.length; C++) {
1892
1892
  var R = s[C];
@@ -1894,8 +1894,8 @@ function pt() {
1894
1894
  }
1895
1895
  var M = new a(A.getMaxX(), A.getMaxY());
1896
1896
  return m.inverseTransformPoint(M);
1897
- }, y.branchRadialLayout = function(s, f, c, L, A, m) {
1898
- var C = (L - c + 1) / 2;
1897
+ }, y.branchRadialLayout = function(s, f, c, E, A, m) {
1898
+ var C = (E - c + 1) / 2;
1899
1899
  C < 0 && (C += 180);
1900
1900
  var R = (C + c) % 360, M = R * D.TWO_PI / 360, S = A * Math.cos(M), Y = A * Math.sin(M);
1901
1901
  s.setCenter(S, Y);
@@ -1910,7 +1910,7 @@ function pt() {
1910
1910
  H >= 0 && w.splice(H, 1), U--, x--;
1911
1911
  }
1912
1912
  f != null ? P = (w.indexOf(_[0]) + 1) % U : P = 0;
1913
- for (var W = Math.abs(L - c) / x, B = P; F != x; B = ++B % U) {
1913
+ for (var W = Math.abs(E - c) / x, B = P; F != x; B = ++B % U) {
1914
1914
  var K = w[B].getOtherEnd(s);
1915
1915
  if (K != f) {
1916
1916
  var q = (c + F * W) % 360, ht = (q + W) % 360;
@@ -1919,7 +1919,7 @@ function pt() {
1919
1919
  }
1920
1920
  }, y.maxDiagonalInTree = function(s) {
1921
1921
  for (var f = v.MIN_VALUE, c = 0; c < s.length; c++) {
1922
- var L = s[c], A = L.getDiagonal();
1922
+ var E = s[c], A = E.getDiagonal();
1923
1923
  A > f && (f = A);
1924
1924
  }
1925
1925
  return f;
@@ -1928,8 +1928,8 @@ function pt() {
1928
1928
  }, y.prototype.groupZeroDegreeMembers = function() {
1929
1929
  var s = this, f = {};
1930
1930
  this.memberGroups = {}, this.idToDummyNode = {};
1931
- for (var c = [], L = this.graphManager.getAllNodes(), A = 0; A < L.length; A++) {
1932
- var m = L[A], C = m.getParent();
1931
+ for (var c = [], E = this.graphManager.getAllNodes(), A = 0; A < E.length; A++) {
1932
+ var m = E[A], C = m.getParent();
1933
1933
  this.getNodeDegreeWithChildren(m) === 0 && (C.id == null || !this.getToBeTiled(C)) && c.push(m);
1934
1934
  }
1935
1935
  for (var A = 0; A < c.length; A++) {
@@ -1959,19 +1959,19 @@ function pt() {
1959
1959
  }, y.prototype.clearZeroDegreeMembers = function() {
1960
1960
  var s = this, f = this.tiledZeroDegreePack = [];
1961
1961
  Object.keys(this.memberGroups).forEach(function(c) {
1962
- var L = s.idToDummyNode[c];
1963
- f[c] = s.tileNodes(s.memberGroups[c], L.paddingLeft + L.paddingRight), L.rect.width = f[c].width, L.rect.height = f[c].height;
1962
+ var E = s.idToDummyNode[c];
1963
+ f[c] = s.tileNodes(s.memberGroups[c], E.paddingLeft + E.paddingRight), E.rect.width = f[c].width, E.rect.height = f[c].height;
1964
1964
  });
1965
1965
  }, y.prototype.repopulateCompounds = function() {
1966
1966
  for (var s = this.compoundOrder.length - 1; s >= 0; s--) {
1967
- var f = this.compoundOrder[s], c = f.id, L = f.paddingLeft, A = f.paddingTop;
1968
- this.adjustLocations(this.tiledMemberPack[c], f.rect.x, f.rect.y, L, A);
1967
+ var f = this.compoundOrder[s], c = f.id, E = f.paddingLeft, A = f.paddingTop;
1968
+ this.adjustLocations(this.tiledMemberPack[c], f.rect.x, f.rect.y, E, A);
1969
1969
  }
1970
1970
  }, y.prototype.repopulateZeroDegreeMembers = function() {
1971
1971
  var s = this, f = this.tiledZeroDegreePack;
1972
1972
  Object.keys(f).forEach(function(c) {
1973
- var L = s.idToDummyNode[c], A = L.paddingLeft, m = L.paddingTop;
1974
- s.adjustLocations(f[c], L.rect.x, L.rect.y, A, m);
1973
+ var E = s.idToDummyNode[c], A = E.paddingLeft, m = E.paddingTop;
1974
+ s.adjustLocations(f[c], E.rect.x, E.rect.y, A, m);
1975
1975
  });
1976
1976
  }, y.prototype.getToBeTiled = function(s) {
1977
1977
  var f = s.id;
@@ -1980,8 +1980,8 @@ function pt() {
1980
1980
  var c = s.getChild();
1981
1981
  if (c == null)
1982
1982
  return this.toBeTiled[f] = !1, !1;
1983
- for (var L = c.getNodes(), A = 0; A < L.length; A++) {
1984
- var m = L[A];
1983
+ for (var E = c.getNodes(), A = 0; A < E.length; A++) {
1984
+ var m = E[A];
1985
1985
  if (this.getNodeDegree(m) > 0)
1986
1986
  return this.toBeTiled[f] = !1, !1;
1987
1987
  if (m.getChild() == null) {
@@ -1994,8 +1994,8 @@ function pt() {
1994
1994
  return this.toBeTiled[f] = !0, !0;
1995
1995
  }, y.prototype.getNodeDegree = function(s) {
1996
1996
  s.id;
1997
- for (var f = s.getEdges(), c = 0, L = 0; L < f.length; L++) {
1998
- var A = f[L];
1997
+ for (var f = s.getEdges(), c = 0, E = 0; E < f.length; E++) {
1998
+ var A = f[E];
1999
1999
  A.getSource().id !== A.getTarget().id && (c = c + 1);
2000
2000
  }
2001
2001
  return c;
@@ -2003,8 +2003,8 @@ function pt() {
2003
2003
  var f = this.getNodeDegree(s);
2004
2004
  if (s.getChild() == null)
2005
2005
  return f;
2006
- for (var c = s.getChild().getNodes(), L = 0; L < c.length; L++) {
2007
- var A = c[L];
2006
+ for (var c = s.getChild().getNodes(), E = 0; E < c.length; E++) {
2007
+ var A = c[E];
2008
2008
  f += this.getNodeDegreeWithChildren(A);
2009
2009
  }
2010
2010
  return f;
@@ -2015,8 +2015,8 @@ function pt() {
2015
2015
  var c = s[f];
2016
2016
  c.getChild() != null && this.fillCompexOrderByDFS(c.getChild().getNodes()), this.getToBeTiled(c) && this.compoundOrder.push(c);
2017
2017
  }
2018
- }, y.prototype.adjustLocations = function(s, f, c, L, A) {
2019
- f += L, c += A;
2018
+ }, y.prototype.adjustLocations = function(s, f, c, E, A) {
2019
+ f += E, c += A;
2020
2020
  for (var m = f, C = 0; C < s.rows.length; C++) {
2021
2021
  var R = s.rows[C];
2022
2022
  f = m;
@@ -2028,12 +2028,12 @@ function pt() {
2028
2028
  }
2029
2029
  }, y.prototype.tileCompoundMembers = function(s, f) {
2030
2030
  var c = this;
2031
- this.tiledMemberPack = [], Object.keys(s).forEach(function(L) {
2032
- var A = f[L];
2033
- c.tiledMemberPack[L] = c.tileNodes(s[L], A.paddingLeft + A.paddingRight), A.rect.width = c.tiledMemberPack[L].width, A.rect.height = c.tiledMemberPack[L].height;
2031
+ this.tiledMemberPack = [], Object.keys(s).forEach(function(E) {
2032
+ var A = f[E];
2033
+ c.tiledMemberPack[E] = c.tileNodes(s[E], A.paddingLeft + A.paddingRight), A.rect.width = c.tiledMemberPack[E].width, A.rect.height = c.tiledMemberPack[E].height;
2034
2034
  });
2035
2035
  }, y.prototype.tileNodes = function(s, f) {
2036
- var c = n.TILING_PADDING_VERTICAL, L = n.TILING_PADDING_HORIZONTAL, A = {
2036
+ var c = n.TILING_PADDING_VERTICAL, E = n.TILING_PADDING_HORIZONTAL, A = {
2037
2037
  rows: [],
2038
2038
  rowWidth: [],
2039
2039
  rowHeight: [],
@@ -2041,7 +2041,7 @@ function pt() {
2041
2041
  height: f,
2042
2042
  // assume minHeight equals to minWidth
2043
2043
  verticalPadding: c,
2044
- horizontalPadding: L
2044
+ horizontalPadding: E
2045
2045
  };
2046
2046
  s.sort(function(R, M) {
2047
2047
  return R.rect.width * R.rect.height > M.rect.width * M.rect.height ? -1 : R.rect.width * R.rect.height < M.rect.width * M.rect.height ? 1 : 0;
@@ -2051,8 +2051,8 @@ function pt() {
2051
2051
  A.rows.length == 0 ? this.insertNodeToRow(A, C, 0, f) : this.canAddHorizontal(A, C.rect.width, C.rect.height) ? this.insertNodeToRow(A, C, this.getShortestRowIndex(A), f) : this.insertNodeToRow(A, C, A.rows.length, f), this.shiftToLastRow(A);
2052
2052
  }
2053
2053
  return A;
2054
- }, y.prototype.insertNodeToRow = function(s, f, c, L) {
2055
- var A = L;
2054
+ }, y.prototype.insertNodeToRow = function(s, f, c, E) {
2055
+ var A = E;
2056
2056
  if (c == s.rows.length) {
2057
2057
  var m = [];
2058
2058
  s.rows.push(m), s.rowWidth.push(A), s.rowHeight.push(0);
@@ -2064,31 +2064,31 @@ function pt() {
2064
2064
  var M = 0;
2065
2065
  R > s.rowHeight[c] && (M = s.rowHeight[c], s.rowHeight[c] = R, M = s.rowHeight[c] - M), s.height += M, s.rows[c].push(f);
2066
2066
  }, y.prototype.getShortestRowIndex = function(s) {
2067
- for (var f = -1, c = Number.MAX_VALUE, L = 0; L < s.rows.length; L++)
2068
- s.rowWidth[L] < c && (f = L, c = s.rowWidth[L]);
2067
+ for (var f = -1, c = Number.MAX_VALUE, E = 0; E < s.rows.length; E++)
2068
+ s.rowWidth[E] < c && (f = E, c = s.rowWidth[E]);
2069
2069
  return f;
2070
2070
  }, y.prototype.getLongestRowIndex = function(s) {
2071
- for (var f = -1, c = Number.MIN_VALUE, L = 0; L < s.rows.length; L++)
2072
- s.rowWidth[L] > c && (f = L, c = s.rowWidth[L]);
2071
+ for (var f = -1, c = Number.MIN_VALUE, E = 0; E < s.rows.length; E++)
2072
+ s.rowWidth[E] > c && (f = E, c = s.rowWidth[E]);
2073
2073
  return f;
2074
2074
  }, y.prototype.canAddHorizontal = function(s, f, c) {
2075
- var L = this.getShortestRowIndex(s);
2076
- if (L < 0)
2075
+ var E = this.getShortestRowIndex(s);
2076
+ if (E < 0)
2077
2077
  return !0;
2078
- var A = s.rowWidth[L];
2078
+ var A = s.rowWidth[E];
2079
2079
  if (A + s.horizontalPadding + f <= s.width) return !0;
2080
2080
  var m = 0;
2081
- s.rowHeight[L] < c && L > 0 && (m = c + s.verticalPadding - s.rowHeight[L]);
2081
+ s.rowHeight[E] < c && E > 0 && (m = c + s.verticalPadding - s.rowHeight[E]);
2082
2082
  var C;
2083
2083
  s.width - A >= f + s.horizontalPadding ? C = (s.height + m) / (A + f + s.horizontalPadding) : C = (s.height + m) / s.width, m = c + s.verticalPadding;
2084
2084
  var R;
2085
2085
  return s.width < f ? R = (s.height + m) / f : R = (s.height + m) / s.width, R < 1 && (R = 1 / R), C < 1 && (C = 1 / C), C < R;
2086
2086
  }, y.prototype.shiftToLastRow = function(s) {
2087
- var f = this.getLongestRowIndex(s), c = s.rowWidth.length - 1, L = s.rows[f], A = L[L.length - 1], m = A.width + s.horizontalPadding;
2087
+ var f = this.getLongestRowIndex(s), c = s.rowWidth.length - 1, E = s.rows[f], A = E[E.length - 1], m = A.width + s.horizontalPadding;
2088
2088
  if (s.width - s.rowWidth[c] > m && f != c) {
2089
- L.splice(-1, 1), s.rows[c].push(A), s.rowWidth[f] = s.rowWidth[f] - m, s.rowWidth[c] = s.rowWidth[c] + m, s.width = s.rowWidth[instance.getLongestRowIndex(s)];
2090
- for (var C = Number.MIN_VALUE, R = 0; R < L.length; R++)
2091
- L[R].height > C && (C = L[R].height);
2089
+ E.splice(-1, 1), s.rows[c].push(A), s.rowWidth[f] = s.rowWidth[f] - m, s.rowWidth[c] = s.rowWidth[c] + m, s.width = s.rowWidth[instance.getLongestRowIndex(s)];
2090
+ for (var C = Number.MIN_VALUE, R = 0; R < E.length; R++)
2091
+ E[R].height > C && (C = E[R].height);
2092
2092
  f > 0 && (C += s.verticalPadding);
2093
2093
  var M = s.rowHeight[f] + s.rowHeight[c];
2094
2094
  s.rowHeight[f] = C, s.rowHeight[c] < A.height + s.verticalPadding && (s.rowHeight[c] = A.height + s.verticalPadding);
@@ -2101,10 +2101,10 @@ function pt() {
2101
2101
  n.TILE && (this.repopulateZeroDegreeMembers(), this.repopulateCompounds());
2102
2102
  }, y.prototype.reduceTrees = function() {
2103
2103
  for (var s = [], f = !0, c; f; ) {
2104
- var L = this.graphManager.getAllNodes(), A = [];
2104
+ var E = this.graphManager.getAllNodes(), A = [];
2105
2105
  f = !1;
2106
- for (var m = 0; m < L.length; m++)
2107
- c = L[m], c.getEdges().length == 1 && !c.getEdges()[0].isInterGraph && c.getChild() == null && (A.push([c, c.getEdges()[0], c.getOwner()]), f = !0);
2106
+ for (var m = 0; m < E.length; m++)
2107
+ c = E[m], c.getEdges().length == 1 && !c.getEdges()[0].isInterGraph && c.getChild() == null && (A.push([c, c.getEdges()[0], c.getOwner()]), f = !0);
2108
2108
  if (f == !0) {
2109
2109
  for (var C = [], R = 0; R < A.length; R++)
2110
2110
  A[R][0].getEdges().length == 1 && (C.push(A[R]), A[R][0].getOwner().remove(A[R][0]));
@@ -2113,12 +2113,12 @@ function pt() {
2113
2113
  }
2114
2114
  this.prunedNodesAll = s;
2115
2115
  }, y.prototype.growTree = function(s) {
2116
- for (var f = s.length, c = s[f - 1], L, A = 0; A < c.length; A++)
2117
- L = c[A], this.findPlaceforPrunedNode(L), L[2].add(L[0]), L[2].add(L[1], L[1].source, L[1].target);
2116
+ for (var f = s.length, c = s[f - 1], E, A = 0; A < c.length; A++)
2117
+ E = c[A], this.findPlaceforPrunedNode(E), E[2].add(E[0]), E[2].add(E[1], E[1].source, E[1].target);
2118
2118
  s.splice(s.length - 1, 1), this.graphManager.resetAllNodes(), this.graphManager.resetAllEdges();
2119
2119
  }, y.prototype.findPlaceforPrunedNode = function(s) {
2120
- var f, c, L = s[0];
2121
- L == s[1].source ? c = s[1].target : c = s[1].source;
2120
+ var f, c, E = s[0];
2121
+ E == s[1].source ? c = s[1].target : c = s[1].source;
2122
2122
  var A = c.startX, m = c.finishX, C = c.startY, R = c.finishY, M = 0, S = 0, Y = 0, w = 0, x = [M, Y, S, w];
2123
2123
  if (C > 0)
2124
2124
  for (var F = A; F <= m; F++)
@@ -2144,12 +2144,12 @@ function pt() {
2144
2144
  f = H;
2145
2145
  } else
2146
2146
  f = _;
2147
- f == 0 ? L.setCenter(c.getCenterX(), c.getCenterY() - c.getHeight() / 2 - d.DEFAULT_EDGE_LENGTH - L.getHeight() / 2) : f == 1 ? L.setCenter(c.getCenterX() + c.getWidth() / 2 + d.DEFAULT_EDGE_LENGTH + L.getWidth() / 2, c.getCenterY()) : f == 2 ? L.setCenter(c.getCenterX(), c.getCenterY() + c.getHeight() / 2 + d.DEFAULT_EDGE_LENGTH + L.getHeight() / 2) : L.setCenter(c.getCenterX() - c.getWidth() / 2 - d.DEFAULT_EDGE_LENGTH - L.getWidth() / 2, c.getCenterY());
2147
+ f == 0 ? E.setCenter(c.getCenterX(), c.getCenterY() - c.getHeight() / 2 - d.DEFAULT_EDGE_LENGTH - E.getHeight() / 2) : f == 1 ? E.setCenter(c.getCenterX() + c.getWidth() / 2 + d.DEFAULT_EDGE_LENGTH + E.getWidth() / 2, c.getCenterY()) : f == 2 ? E.setCenter(c.getCenterX(), c.getCenterY() + c.getHeight() / 2 + d.DEFAULT_EDGE_LENGTH + E.getHeight() / 2) : E.setCenter(c.getCenterX() - c.getWidth() / 2 - d.DEFAULT_EDGE_LENGTH - E.getWidth() / 2, c.getCenterY());
2148
2148
  }, I.exports = y;
2149
2149
  }),
2150
2150
  /* 7 */
2151
2151
  /***/
2152
- (function(I, T, o) {
2152
+ (function(I, L, o) {
2153
2153
  var e = {};
2154
2154
  e.layoutBase = o(0), e.CoSEConstants = o(1), e.CoSEEdge = o(2), e.CoSEGraph = o(3), e.CoSEGraphManager = o(4), e.CoSELayout = o(6), e.CoSENode = o(5), I.exports = e;
2155
2155
  })
@@ -2162,17 +2162,17 @@ function pt() {
2162
2162
  var dt = Z.exports, J;
2163
2163
  function vt() {
2164
2164
  return J || (J = 1, (function(G, b) {
2165
- (function(I, T) {
2166
- G.exports = T(pt());
2165
+ (function(I, L) {
2166
+ G.exports = L(pt());
2167
2167
  })(dt, function(N) {
2168
2168
  return (
2169
2169
  /******/
2170
2170
  (function(I) {
2171
- var T = {};
2171
+ var L = {};
2172
2172
  function o(e) {
2173
- if (T[e])
2174
- return T[e].exports;
2175
- var t = T[e] = {
2173
+ if (L[e])
2174
+ return L[e].exports;
2175
+ var t = L[e] = {
2176
2176
  /******/
2177
2177
  i: e,
2178
2178
  /******/
@@ -2183,7 +2183,7 @@ function vt() {
2183
2183
  };
2184
2184
  return I[e].call(t.exports, t, t.exports, o), t.l = !0, t.exports;
2185
2185
  }
2186
- return o.m = I, o.c = T, o.i = function(e) {
2186
+ return o.m = I, o.c = L, o.i = function(e) {
2187
2187
  return e;
2188
2188
  }, o.d = function(e, t, i) {
2189
2189
  o.o(e, t) || Object.defineProperty(e, t, {
@@ -2214,12 +2214,12 @@ function vt() {
2214
2214
  })([
2215
2215
  /* 0 */
2216
2216
  /***/
2217
- (function(I, T) {
2217
+ (function(I, L) {
2218
2218
  I.exports = N;
2219
2219
  }),
2220
2220
  /* 1 */
2221
2221
  /***/
2222
- (function(I, T, o) {
2222
+ (function(I, L, o) {
2223
2223
  var e = o(0).layoutBase.LayoutConstants, t = o(0).layoutBase.FDLayoutConstants, i = o(0).CoSEConstants, l = o(0).CoSELayout, g = o(0).CoSENode, n = o(0).layoutBase.PointD, d = o(0).layoutBase.DimensionD, r = {
2224
2224
  // Called on `layoutready`
2225
2225
  ready: function() {
@@ -2274,12 +2274,12 @@ function vt() {
2274
2274
  initialEnergyOnIncremental: 0.5
2275
2275
  };
2276
2276
  function h(D, u) {
2277
- var E = {};
2277
+ var T = {};
2278
2278
  for (var y in D)
2279
- E[y] = D[y];
2279
+ T[y] = D[y];
2280
2280
  for (var y in u)
2281
- E[y] = u[y];
2282
- return E;
2281
+ T[y] = u[y];
2282
+ return T;
2283
2283
  }
2284
2284
  function a(D) {
2285
2285
  this.options = h(r, D), p(this.options);
@@ -2288,7 +2288,7 @@ function vt() {
2288
2288
  u.nodeRepulsion != null && (i.DEFAULT_REPULSION_STRENGTH = t.DEFAULT_REPULSION_STRENGTH = u.nodeRepulsion), u.idealEdgeLength != null && (i.DEFAULT_EDGE_LENGTH = t.DEFAULT_EDGE_LENGTH = u.idealEdgeLength), u.edgeElasticity != null && (i.DEFAULT_SPRING_STRENGTH = t.DEFAULT_SPRING_STRENGTH = u.edgeElasticity), u.nestingFactor != null && (i.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = t.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = u.nestingFactor), u.gravity != null && (i.DEFAULT_GRAVITY_STRENGTH = t.DEFAULT_GRAVITY_STRENGTH = u.gravity), u.numIter != null && (i.MAX_ITERATIONS = t.MAX_ITERATIONS = u.numIter), u.gravityRange != null && (i.DEFAULT_GRAVITY_RANGE_FACTOR = t.DEFAULT_GRAVITY_RANGE_FACTOR = u.gravityRange), u.gravityCompound != null && (i.DEFAULT_COMPOUND_GRAVITY_STRENGTH = t.DEFAULT_COMPOUND_GRAVITY_STRENGTH = u.gravityCompound), u.gravityRangeCompound != null && (i.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = t.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = u.gravityRangeCompound), u.initialEnergyOnIncremental != null && (i.DEFAULT_COOLING_FACTOR_INCREMENTAL = t.DEFAULT_COOLING_FACTOR_INCREMENTAL = u.initialEnergyOnIncremental), u.quality == "draft" ? e.QUALITY = 0 : u.quality == "proof" ? e.QUALITY = 2 : e.QUALITY = 1, i.NODE_DIMENSIONS_INCLUDE_LABELS = t.NODE_DIMENSIONS_INCLUDE_LABELS = e.NODE_DIMENSIONS_INCLUDE_LABELS = u.nodeDimensionsIncludeLabels, i.DEFAULT_INCREMENTAL = t.DEFAULT_INCREMENTAL = e.DEFAULT_INCREMENTAL = !u.randomize, i.ANIMATE = t.ANIMATE = e.ANIMATE = u.animate, i.TILE = u.tile, i.TILING_PADDING_VERTICAL = typeof u.tilingPaddingVertical == "function" ? u.tilingPaddingVertical.call() : u.tilingPaddingVertical, i.TILING_PADDING_HORIZONTAL = typeof u.tilingPaddingHorizontal == "function" ? u.tilingPaddingHorizontal.call() : u.tilingPaddingHorizontal;
2289
2289
  };
2290
2290
  a.prototype.run = function() {
2291
- var D, u, E = this.options;
2291
+ var D, u, T = this.options;
2292
2292
  this.idToLNode = {};
2293
2293
  var y = this.layout = new l(), O = this;
2294
2294
  O.stopped = !1, this.cy = this.options.cy, this.cy.trigger({ type: "layoutstart", layout: this });
@@ -2296,8 +2296,8 @@ function vt() {
2296
2296
  this.gm = s;
2297
2297
  var f = this.options.eles.nodes(), c = this.options.eles.edges();
2298
2298
  this.root = s.addRoot(), this.processChildrenList(this.root, this.getTopMostNodes(f), y);
2299
- for (var L = 0; L < c.length; L++) {
2300
- var A = c[L], m = this.idToLNode[A.data("source")], C = this.idToLNode[A.data("target")];
2299
+ for (var E = 0; E < c.length; E++) {
2300
+ var A = c[E], m = this.idToLNode[A.data("source")], C = this.idToLNode[A.data("target")];
2301
2301
  if (m !== C && m.getEdgesBetween(C).length == 0) {
2302
2302
  var R = s.add(y.newEdge(), m, C);
2303
2303
  R.id = A.id();
@@ -2312,7 +2312,7 @@ function vt() {
2312
2312
  };
2313
2313
  }, S = function Y() {
2314
2314
  for (var w = function() {
2315
- E.fit && E.cy.fit(E.eles, E.padding), D || (D = !0, O.cy.one("layoutready", E.ready), O.cy.trigger({ type: "layoutready", layout: O }));
2315
+ T.fit && T.cy.fit(T.eles, T.padding), D || (D = !0, O.cy.one("layoutready", T.ready), O.cy.trigger({ type: "layoutready", layout: O }));
2316
2316
  }, x = O.options.refresh, F, U = 0; U < x && !F; U++)
2317
2317
  F = O.stopped || O.layout.tick();
2318
2318
  if (F) {
@@ -2320,7 +2320,7 @@ function vt() {
2320
2320
  return;
2321
2321
  }
2322
2322
  var P = O.layout.getPositionsData();
2323
- E.eles.nodes().positions(function(_, X) {
2323
+ T.eles.nodes().positions(function(_, X) {
2324
2324
  if (typeof _ == "number" && (_ = X), !_.isParent()) {
2325
2325
  for (var H = _.id(), W = P[H], B = _; W == null && (W = P[B.data("parent")] || P["DummyCompound_" + B.data("parent")], P[H] = W, B = B.parent()[0], B != null); )
2326
2326
  ;
@@ -2338,8 +2338,8 @@ function vt() {
2338
2338
  O.options.animate === "during" && (u = requestAnimationFrame(S));
2339
2339
  }), y.runLayout(), this.options.animate !== "during" && (O.options.eles.nodes().not(":parent").layoutPositions(O, O.options, M), D = !1), this;
2340
2340
  }, a.prototype.getTopMostNodes = function(D) {
2341
- for (var u = {}, E = 0; E < D.length; E++)
2342
- u[D[E].id()] = !0;
2341
+ for (var u = {}, T = 0; T < D.length; T++)
2342
+ u[D[T].id()] = !0;
2343
2343
  var y = D.filter(function(O, s) {
2344
2344
  typeof O == "number" && (O = s);
2345
2345
  for (var f = O.parent()[0]; f != null; ) {
@@ -2350,18 +2350,18 @@ function vt() {
2350
2350
  return !0;
2351
2351
  });
2352
2352
  return y;
2353
- }, a.prototype.processChildrenList = function(D, u, E) {
2353
+ }, a.prototype.processChildrenList = function(D, u, T) {
2354
2354
  for (var y = u.length, O = 0; O < y; O++) {
2355
- var s = u[O], f = s.children(), c, L = s.layoutDimensions({
2355
+ var s = u[O], f = s.children(), c, E = s.layoutDimensions({
2356
2356
  nodeDimensionsIncludeLabels: this.options.nodeDimensionsIncludeLabels
2357
2357
  });
2358
- if (s.outerWidth() != null && s.outerHeight() != null ? c = D.add(new g(E.graphManager, new n(s.position("x") - L.w / 2, s.position("y") - L.h / 2), new d(parseFloat(L.w), parseFloat(L.h)))) : c = D.add(new g(this.graphManager)), c.id = s.data("id"), c.paddingLeft = parseInt(s.css("padding")), c.paddingTop = parseInt(s.css("padding")), c.paddingRight = parseInt(s.css("padding")), c.paddingBottom = parseInt(s.css("padding")), this.options.nodeDimensionsIncludeLabels && s.isParent()) {
2358
+ if (s.outerWidth() != null && s.outerHeight() != null ? c = D.add(new g(T.graphManager, new n(s.position("x") - E.w / 2, s.position("y") - E.h / 2), new d(parseFloat(E.w), parseFloat(E.h)))) : c = D.add(new g(this.graphManager)), c.id = s.data("id"), c.paddingLeft = parseInt(s.css("padding")), c.paddingTop = parseInt(s.css("padding")), c.paddingRight = parseInt(s.css("padding")), c.paddingBottom = parseInt(s.css("padding")), this.options.nodeDimensionsIncludeLabels && s.isParent()) {
2359
2359
  var A = s.boundingBox({ includeLabels: !0, includeNodes: !1 }).w, m = s.boundingBox({ includeLabels: !0, includeNodes: !1 }).h, C = s.css("text-halign");
2360
2360
  c.labelWidth = A, c.labelHeight = m, c.labelPos = C;
2361
2361
  }
2362
2362
  if (this.idToLNode[s.data("id")] = c, isNaN(c.rect.x) && (c.rect.x = 0), isNaN(c.rect.y) && (c.rect.y = 0), f != null && f.length > 0) {
2363
2363
  var R;
2364
- R = E.getGraphManager().add(E.newGraph(), c), this.processChildrenList(R, f, E);
2364
+ R = T.getGraphManager().add(T.newGraph(), c), this.processChildrenList(R, f, T);
2365
2365
  }
2366
2366
  }
2367
2367
  }, a.prototype.stop = function() {
@@ -2390,8 +2390,8 @@ function et(G, b) {
2390
2390
  width: N.width,
2391
2391
  padding: N.padding ?? 0
2392
2392
  };
2393
- Object.keys(N).forEach((T) => {
2394
- ["id", "label", "height", "width", "padding", "x", "y"].includes(T) || (I[T] = N[T]);
2393
+ Object.keys(N).forEach((L) => {
2394
+ ["id", "label", "height", "width", "padding", "x", "y"].includes(L) || (I[L] = N[L]);
2395
2395
  }), b.add({
2396
2396
  group: "nodes",
2397
2397
  data: I,
@@ -2410,8 +2410,8 @@ function rt(G, b) {
2410
2410
  source: N.start,
2411
2411
  target: N.end
2412
2412
  };
2413
- Object.keys(N).forEach((T) => {
2414
- ["id", "start", "end"].includes(T) || (I[T] = N[T]);
2413
+ Object.keys(N).forEach((L) => {
2414
+ ["id", "start", "end"].includes(L) || (I[L] = N[L]);
2415
2415
  }), b.add({
2416
2416
  group: "edges",
2417
2417
  data: I
@@ -2439,14 +2439,14 @@ function it(G) {
2439
2439
  return { w: e.width, h: e.height };
2440
2440
  };
2441
2441
  });
2442
- const T = {
2442
+ const L = {
2443
2443
  name: "cose-bilkent",
2444
2444
  // @ts-ignore Types for cose-bilkent are not correct?
2445
2445
  quality: "proof",
2446
2446
  styleEnabled: !1,
2447
2447
  animate: !1
2448
2448
  };
2449
- I.layout(T).run(), I.ready((o) => {
2449
+ I.layout(L).run(), I.ready((o) => {
2450
2450
  k.info("Cytoscape ready", o), b(I);
2451
2451
  });
2452
2452
  });
@@ -2454,20 +2454,20 @@ function it(G) {
2454
2454
  V(it, "createCytoscapeInstance");
2455
2455
  function nt(G) {
2456
2456
  return G.nodes().map((b) => {
2457
- const N = b.data(), I = b.position(), T = {
2457
+ const N = b.data(), I = b.position(), L = {
2458
2458
  id: N.id,
2459
2459
  x: I.x,
2460
2460
  y: I.y
2461
2461
  };
2462
2462
  return Object.keys(N).forEach((o) => {
2463
- o !== "id" && (T[o] = N[o]);
2464
- }), T;
2463
+ o !== "id" && (L[o] = N[o]);
2464
+ }), L;
2465
2465
  });
2466
2466
  }
2467
2467
  V(nt, "extractPositionedNodes");
2468
2468
  function ot(G) {
2469
2469
  return G.edges().map((b) => {
2470
- const N = b.data(), I = b._private.rscratch, T = {
2470
+ const N = b.data(), I = b._private.rscratch, L = {
2471
2471
  id: N.id,
2472
2472
  source: N.source,
2473
2473
  target: N.target,
@@ -2479,8 +2479,8 @@ function ot(G) {
2479
2479
  endY: I.endY
2480
2480
  };
2481
2481
  return Object.keys(N).forEach((o) => {
2482
- ["id", "source", "target"].includes(o) || (T[o] = N[o]);
2483
- }), T;
2482
+ ["id", "source", "target"].includes(o) || (L[o] = N[o]);
2483
+ }), L;
2484
2484
  });
2485
2485
  }
2486
2486
  V(ot, "extractPositionedEdges");
@@ -2488,10 +2488,10 @@ async function st(G, b) {
2488
2488
  k.debug("Starting cose-bilkent layout algorithm");
2489
2489
  try {
2490
2490
  at(G);
2491
- const N = await it(G), I = nt(N), T = ot(N);
2492
- return k.debug(`Layout completed: ${I.length} nodes, ${T.length} edges`), {
2491
+ const N = await it(G), I = nt(N), L = ot(N);
2492
+ return k.debug(`Layout completed: ${I.length} nodes, ${L.length} edges`), {
2493
2493
  nodes: I,
2494
- edges: T
2494
+ edges: L
2495
2495
  };
2496
2496
  } catch (N) {
2497
2497
  throw k.error("Error in cose-bilkent layout algorithm:", N), N;
@@ -2515,7 +2515,7 @@ V(at, "validateLayoutData");
2515
2515
  var Lt = /* @__PURE__ */ V(async (G, b, {
2516
2516
  insertCluster: N,
2517
2517
  insertEdge: I,
2518
- insertEdgeLabel: T,
2518
+ insertEdgeLabel: L,
2519
2519
  insertMarkers: o,
2520
2520
  insertNode: e,
2521
2521
  log: t,
@@ -2527,48 +2527,48 @@ var Lt = /* @__PURE__ */ V(async (G, b, {
2527
2527
  t.debug("Inserting nodes into DOM for dimension calculation"), await Promise.all(
2528
2528
  G.nodes.map(async (u) => {
2529
2529
  if (u.isGroup) {
2530
- const E = { ...u };
2531
- n[u.id] = E, g[u.id] = E, await N(r, u);
2530
+ const T = { ...u };
2531
+ n[u.id] = T, g[u.id] = T, await N(r, u);
2532
2532
  } else {
2533
- const E = { ...u };
2534
- g[u.id] = E;
2533
+ const T = { ...u };
2534
+ g[u.id] = T;
2535
2535
  const y = await e(p, u, {
2536
2536
  config: G.config,
2537
2537
  dir: G.direction || "TB"
2538
2538
  }), O = y.node().getBBox();
2539
- E.width = O.width, E.height = O.height, E.domId = y, t.debug(`Node ${u.id} dimensions: ${O.width}x${O.height}`);
2539
+ T.width = O.width, T.height = O.height, T.domId = y, t.debug(`Node ${u.id} dimensions: ${O.width}x${O.height}`);
2540
2540
  }
2541
2541
  })
2542
2542
  ), t.debug("Running cose-bilkent layout algorithm");
2543
2543
  const v = {
2544
2544
  ...G,
2545
2545
  nodes: G.nodes.map((u) => {
2546
- const E = g[u.id];
2546
+ const T = g[u.id];
2547
2547
  return {
2548
2548
  ...u,
2549
- width: E.width,
2550
- height: E.height
2549
+ width: T.width,
2550
+ height: T.height
2551
2551
  };
2552
2552
  })
2553
2553
  }, D = await st(v, G.config);
2554
2554
  t.debug("Positioning nodes based on layout results"), D.nodes.forEach((u) => {
2555
- const E = g[u.id];
2556
- E != null && E.domId && (E.domId.attr(
2555
+ const T = g[u.id];
2556
+ T?.domId && (T.domId.attr(
2557
2557
  "transform",
2558
2558
  `translate(${u.x}, ${u.y})`
2559
- ), E.x = u.x, E.y = u.y, t.debug(`Positioned node ${E.id} at center (${u.x}, ${u.y})`));
2559
+ ), T.x = u.x, T.y = u.y, t.debug(`Positioned node ${T.id} at center (${u.x}, ${u.y})`));
2560
2560
  }), D.edges.forEach((u) => {
2561
- const E = G.edges.find((y) => y.id === u.id);
2562
- E && (E.points = [
2561
+ const T = G.edges.find((y) => y.id === u.id);
2562
+ T && (T.points = [
2563
2563
  { x: u.startX, y: u.startY },
2564
2564
  { x: u.midX, y: u.midY },
2565
2565
  { x: u.endX, y: u.endY }
2566
2566
  ]);
2567
2567
  }), t.debug("Inserting and positioning edges"), await Promise.all(
2568
2568
  G.edges.map(async (u) => {
2569
- await T(a, u);
2570
- const E = g[u.start ?? ""], y = g[u.end ?? ""];
2571
- if (E && y) {
2569
+ await L(a, u);
2570
+ const T = g[u.start ?? ""], y = g[u.end ?? ""];
2571
+ if (T && y) {
2572
2572
  const O = D.edges.find((s) => s.id === u.id);
2573
2573
  if (O) {
2574
2574
  t.debug("APA01 positionedEdge", O);
@@ -2577,7 +2577,7 @@ var Lt = /* @__PURE__ */ V(async (G, b, {
2577
2577
  s,
2578
2578
  n,
2579
2579
  G.type,
2580
- E,
2580
+ T,
2581
2581
  y,
2582
2582
  G.diagramId
2583
2583
  );
@@ -2586,7 +2586,7 @@ var Lt = /* @__PURE__ */ V(async (G, b, {
2586
2586
  const s = {
2587
2587
  ...u,
2588
2588
  points: [
2589
- { x: E.x || 0, y: E.y || 0 },
2589
+ { x: T.x || 0, y: T.y || 0 },
2590
2590
  { x: y.x || 0, y: y.y || 0 }
2591
2591
  ]
2592
2592
  }, f = I(
@@ -2594,7 +2594,7 @@ var Lt = /* @__PURE__ */ V(async (G, b, {
2594
2594
  s,
2595
2595
  n,
2596
2596
  G.type,
2597
- E,
2597
+ T,
2598
2598
  y,
2599
2599
  G.diagramId
2600
2600
  );