@kong-ui-public/documentation 1.1.2 → 1.1.4
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/{_basePickBy-zlkqRmFy-CQP0PMRw.js → _basePickBy-zlkqRmFy-Dq-PK6tA.js} +27 -27
- package/dist/_baseUniq-SAfYgIkf-DhYxnvgt.js +614 -0
- package/dist/{arc-CK9P6CkJ-B3oiAYoG.js → arc-CK9P6CkJ-lihx_wEv.js} +31 -31
- package/dist/{architecture-I3QFYML2-DJzmbE4M-BYAx4I-4.js → architecture-I3QFYML2-DJzmbE4M-B5s0Q1wg.js} +1 -1
- package/dist/{architectureDiagram-UYN6MBPD-DkZdgpXi-BC7nb0IZ.js → architectureDiagram-UYN6MBPD-DkZdgpXi-CC-fAW7y.js} +850 -850
- package/dist/{blockDiagram-ZHA2E4KO-DnCMGCMN-CU7ARVHN.js → blockDiagram-ZHA2E4KO-DnCMGCMN-B9tod6Dk.js} +477 -477
- package/dist/{c4Diagram-6F5ED5ID-D5yqWyf0-DEuKG0sN.js → c4Diagram-6F5ED5ID-D5yqWyf0-B1iuFSQ1.js} +203 -203
- package/dist/{channel-bVcNKbrJ-C4S-4qV3.js → channel-bVcNKbrJ-DEGmvXXN.js} +1 -1
- package/dist/{chunk-5HRBRIJM-BjQ8go1b-733bxiZ-.js → chunk-5HRBRIJM-BjQ8go1b-BszOhLz8.js} +4 -4
- package/dist/{chunk-7U56Z5CX-awhAxjZ0-DpUJ4fo1.js → chunk-7U56Z5CX-awhAxjZ0-CHd4qyz3.js} +120 -120
- package/dist/{chunk-ASOPGD6M-B5bA_saK-C3yF9T7p.js → chunk-ASOPGD6M-B5bA_saK-RaS3hIfR.js} +1 -1
- package/dist/{chunk-KFBOBJHC-nixdujtH-B4639Jmi.js → chunk-KFBOBJHC-nixdujtH-DCajFn7e.js} +1 -1
- package/dist/{chunk-T2TOU4HS-DqOVhIzl-piSN2Cjl.js → chunk-T2TOU4HS-DqOVhIzl-1waDvYDY.js} +229 -229
- package/dist/{chunk-TMUBEWPD-BRIzn5gH-SlHeKBx9.js → chunk-TMUBEWPD-BRIzn5gH-Ch1SRQ7H.js} +1 -1
- package/dist/{classDiagram-LNE6IOMH-fQzyXfo--C9LjXboP.js → classDiagram-LNE6IOMH-fQzyXfo--BpuwdnmV.js} +4 -4
- package/dist/{classDiagram-v2-MQ7JQ4JX-fQzyXfo--C9LjXboP.js → classDiagram-v2-MQ7JQ4JX-fQzyXfo--BpuwdnmV.js} +4 -4
- package/dist/{clone-_5SW34SG-DtUOH1l1.js → clone-_5SW34SG-BWxdvZXA.js} +1 -1
- package/dist/{cytoscape.esm-DAyNQ0qu-B7WxGuVh.js → cytoscape.esm-DAyNQ0qu-i5PnoWfE.js} +976 -976
- package/dist/{dagre-4EVJKHTY-CcAruc30-DaOjmyb6.js → dagre-4EVJKHTY-CcAruc30-H9W22Yky.js} +85 -85
- package/dist/{diagram-QW4FP2JN-DZT_0aFO-YCKYx1k-.js → diagram-QW4FP2JN-DZT_0aFO-AmG94tp5.js} +21 -21
- package/dist/documentation.es.js +1 -1
- package/dist/{erDiagram-6RL3IURR-BfgUC5jv-CS9Q9iKF.js → erDiagram-6RL3IURR-BfgUC5jv-BNzxBFoY.js} +201 -201
- package/dist/{flowDiagram-7ASYPVHJ-Bo9CnsE7-CkM-DJdr.js → flowDiagram-7ASYPVHJ-Bo9CnsE7-CSLq7kw9.js} +222 -222
- package/dist/{ganttDiagram-NTVNEXSI-8E9hjd6N-iN-VNXrV.js → ganttDiagram-NTVNEXSI-8E9hjd6N-CjQQCbaM.js} +16 -16
- package/dist/{gitGraph-YCYPL57B-BnErPIwo-DWobPBzL.js → gitGraph-YCYPL57B-BnErPIwo-DxQPpoWq.js} +1 -1
- package/dist/{gitGraphDiagram-NRZ2UAAF-B-t90-9e-Co4q5oQK.js → gitGraphDiagram-NRZ2UAAF-B-t90-9e-B6JY8bWo.js} +17 -17
- package/dist/{graph-BYZMvqpu-BpeF1PUA.js → graph-BYZMvqpu-CWGqkYZM.js} +43 -43
- package/dist/{index-ZM4BlVwk.js → index-BXOX6oou.js} +3487 -3487
- package/dist/{info-46DW6VJ7-DPpbx_vA-CnDg11wg.js → info-46DW6VJ7-DPpbx_vA-BmAPar7H.js} +1 -1
- package/dist/{infoDiagram-A4XQUW5V-Bo9uoOcA-WvvF1295.js → infoDiagram-A4XQUW5V-Bo9uoOcA-CtFRRRot.js} +2 -2
- package/dist/{journeyDiagram-G5WM74LC-BE7U42Ad-BFF_wJwi.js → journeyDiagram-G5WM74LC-BE7U42Ad-of9fN5Vr.js} +173 -173
- package/dist/{kanban-definition-QRCXZQQD-C-5-UNRm-LjA3yK5r.js → kanban-definition-QRCXZQQD-C-5-UNRm-DecJsseT.js} +168 -168
- package/dist/{katex-Qk2jHgyB-CF_fuFJb.js → katex-Qk2jHgyB-_qyJ_37x.js} +1054 -1054
- package/dist/{layout-BHI4imdk-DgoNZaqw.js → layout-BHI4imdk-BlkmyDbe.js} +19 -19
- package/dist/{linear-C2PheBya-wGRbEA3e.js → linear-C2PheBya-DijeUNjP.js} +2 -2
- package/dist/{mermaid-parser.core-Ce96PX3Q-DPc-bPXG.js → mermaid-parser.core-Ce96PX3Q-DtNzRUJ7.js} +32 -32
- package/dist/{mindmap-definition-GWI6TPTV-C98Syvj2-DOvfo2r8.js → mindmap-definition-GWI6TPTV-C98Syvj2-Btvji3Oh.js} +421 -421
- package/dist/{packet-W2GHVCYJ-BLiQbm7T-DbS7CM6G.js → packet-W2GHVCYJ-BLiQbm7T-E8ztaW67.js} +1 -1
- package/dist/{pie-BEWT4RHE-D3Mbo3mT-DB-aeuYE.js → pie-BEWT4RHE-D3Mbo3mT-BGVGE8TE.js} +1 -1
- package/dist/{pieDiagram-YF2LJOPJ-BJV27s9B-DS-nBsbY.js → pieDiagram-YF2LJOPJ-BJV27s9B-DVrzAwZP.js} +20 -20
- package/dist/{quadrantDiagram-OS5C2QUG-M57vVPSx-DMjI1wdt.js → quadrantDiagram-OS5C2QUG-M57vVPSx-DrN-qVPg.js} +131 -131
- package/dist/{requirementDiagram-MIRIMTAZ-D0KDg7rf-DeEsJ26T.js → requirementDiagram-MIRIMTAZ-D0KDg7rf-FCJNuddX.js} +77 -77
- package/dist/{sankeyDiagram-Y46BX6SQ-D6EdYPdp-BA6cRE1h.js → sankeyDiagram-Y46BX6SQ-D6EdYPdp-ClC_w0Hg.js} +108 -108
- package/dist/{sequenceDiagram-G6AWOVSC-B171TAb1-DMtStdxJ.js → sequenceDiagram-G6AWOVSC-B171TAb1-B6jBix6L.js} +181 -181
- package/dist/{stateDiagram-MAYHULR4-D7FUnT9_-Du3mnoL2.js → stateDiagram-MAYHULR4-D7FUnT9_-B7dSTUAT.js} +81 -81
- package/dist/{stateDiagram-v2-4JROLMXI-Cyc74STT-DR1h52WB.js → stateDiagram-v2-4JROLMXI-Cyc74STT-BhUBvhmS.js} +4 -4
- package/dist/{timeline-definition-U7ZMHBDA-Bw-dp1yf-BO9wUMSJ.js → timeline-definition-U7ZMHBDA-Bw-dp1yf-DAx9hgzp.js} +126 -126
- package/dist/{xychartDiagram-6QU3TZC5-CqbTSF5W-CwiL6udJ.js → xychartDiagram-6QU3TZC5-CqbTSF5W-Dy5Ia8cd.js} +70 -70
- package/package.json +2 -2
- package/dist/_baseUniq-SAfYgIkf-BO_CV6Oz.js +0 -614
|
@@ -1,14 +1,14 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import { m as
|
|
3
|
-
import { e as
|
|
4
|
-
import { D as
|
|
5
|
-
import { N as be } from "./cytoscape.esm-DAyNQ0qu-
|
|
6
|
-
var
|
|
7
|
-
function
|
|
1
|
+
import { _ as ot, a6 as We, a5 as $e, a7 as je, a8 as qe, aj as Qe, ak as Ze, aW as Je, bk as Ke, aq as tr, l as Re, bq as Ee, g as he, bw as fe, a9 as er, aE as rr, bx as ir, by as nr, aQ as or } from "./index-BXOX6oou.js";
|
|
2
|
+
import { m as ar } from "./chunk-TMUBEWPD-BRIzn5gH-Ch1SRQ7H.js";
|
|
3
|
+
import { e as sr } from "./chunk-KFBOBJHC-nixdujtH-DCajFn7e.js";
|
|
4
|
+
import { D as hr } from "./mermaid-parser.core-Ce96PX3Q-DtNzRUJ7.js";
|
|
5
|
+
import { N as be } from "./cytoscape.esm-DAyNQ0qu-i5PnoWfE.js";
|
|
6
|
+
var pe = { exports: {} }, ve = { exports: {} }, me = { exports: {} }, lr = me.exports, _e;
|
|
7
|
+
function cr() {
|
|
8
8
|
return _e || (_e = 1, function(A, U) {
|
|
9
9
|
(function(_, k) {
|
|
10
10
|
A.exports = k();
|
|
11
|
-
})(
|
|
11
|
+
})(lr, function() {
|
|
12
12
|
return (
|
|
13
13
|
/******/
|
|
14
14
|
function(_) {
|
|
@@ -29,14 +29,14 @@ function ci() {
|
|
|
29
29
|
}
|
|
30
30
|
return T.m = _, T.c = k, T.i = function(g) {
|
|
31
31
|
return g;
|
|
32
|
-
}, T.d = function(g, a,
|
|
32
|
+
}, T.d = function(g, a, i) {
|
|
33
33
|
T.o(g, a) || Object.defineProperty(g, a, {
|
|
34
34
|
/******/
|
|
35
35
|
configurable: !1,
|
|
36
36
|
/******/
|
|
37
37
|
enumerable: !0,
|
|
38
38
|
/******/
|
|
39
|
-
get:
|
|
39
|
+
get: i
|
|
40
40
|
/******/
|
|
41
41
|
});
|
|
42
42
|
}, T.n = function(g) {
|
|
@@ -66,38 +66,38 @@ function ci() {
|
|
|
66
66
|
/* 1 */
|
|
67
67
|
/***/
|
|
68
68
|
function(_, k, T) {
|
|
69
|
-
var g = T(2), a = T(8),
|
|
70
|
-
function
|
|
69
|
+
var g = T(2), a = T(8), i = T(9);
|
|
70
|
+
function r(l, n, v) {
|
|
71
71
|
g.call(this, v), this.isOverlapingSourceAndTarget = !1, this.vGraphObject = v, this.bendpoints = [], this.source = l, this.target = n;
|
|
72
72
|
}
|
|
73
|
-
|
|
73
|
+
r.prototype = Object.create(g.prototype);
|
|
74
74
|
for (var e in g)
|
|
75
|
-
|
|
76
|
-
|
|
75
|
+
r[e] = g[e];
|
|
76
|
+
r.prototype.getSource = function() {
|
|
77
77
|
return this.source;
|
|
78
|
-
},
|
|
78
|
+
}, r.prototype.getTarget = function() {
|
|
79
79
|
return this.target;
|
|
80
|
-
},
|
|
80
|
+
}, r.prototype.isInterGraph = function() {
|
|
81
81
|
return this.isInterGraph;
|
|
82
|
-
},
|
|
82
|
+
}, r.prototype.getLength = function() {
|
|
83
83
|
return this.length;
|
|
84
|
-
},
|
|
84
|
+
}, r.prototype.isOverlapingSourceAndTarget = function() {
|
|
85
85
|
return this.isOverlapingSourceAndTarget;
|
|
86
|
-
},
|
|
86
|
+
}, r.prototype.getBendpoints = function() {
|
|
87
87
|
return this.bendpoints;
|
|
88
|
-
},
|
|
88
|
+
}, r.prototype.getLca = function() {
|
|
89
89
|
return this.lca;
|
|
90
|
-
},
|
|
90
|
+
}, r.prototype.getSourceInLca = function() {
|
|
91
91
|
return this.sourceInLca;
|
|
92
|
-
},
|
|
92
|
+
}, r.prototype.getTargetInLca = function() {
|
|
93
93
|
return this.targetInLca;
|
|
94
|
-
},
|
|
94
|
+
}, r.prototype.getOtherEnd = function(l) {
|
|
95
95
|
if (this.source === l)
|
|
96
96
|
return this.target;
|
|
97
97
|
if (this.target === l)
|
|
98
98
|
return this.source;
|
|
99
99
|
throw "Node is not incident with this edge";
|
|
100
|
-
},
|
|
100
|
+
}, r.prototype.getOtherEndInGraph = function(l, n) {
|
|
101
101
|
for (var v = this.getOtherEnd(l), t = n.getGraphManager().getRoot(); ; ) {
|
|
102
102
|
if (v.getOwner() == n)
|
|
103
103
|
return v;
|
|
@@ -106,12 +106,12 @@ function ci() {
|
|
|
106
106
|
v = v.getOwner().getParent();
|
|
107
107
|
}
|
|
108
108
|
return null;
|
|
109
|
-
},
|
|
109
|
+
}, r.prototype.updateLength = function() {
|
|
110
110
|
var l = new Array(4);
|
|
111
|
-
this.isOverlapingSourceAndTarget = a.getIntersection(this.target.getRect(), this.source.getRect(), l), this.isOverlapingSourceAndTarget || (this.lengthX = l[0] - l[2], this.lengthY = l[1] - l[3], Math.abs(this.lengthX) < 1 && (this.lengthX =
|
|
112
|
-
},
|
|
113
|
-
this.lengthX = this.target.getCenterX() - this.source.getCenterX(), this.lengthY = this.target.getCenterY() - this.source.getCenterY(), Math.abs(this.lengthX) < 1 && (this.lengthX =
|
|
114
|
-
}, _.exports =
|
|
111
|
+
this.isOverlapingSourceAndTarget = a.getIntersection(this.target.getRect(), this.source.getRect(), l), this.isOverlapingSourceAndTarget || (this.lengthX = l[0] - l[2], this.lengthY = l[1] - l[3], Math.abs(this.lengthX) < 1 && (this.lengthX = i.sign(this.lengthX)), Math.abs(this.lengthY) < 1 && (this.lengthY = i.sign(this.lengthY)), this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY));
|
|
112
|
+
}, r.prototype.updateLengthSimple = function() {
|
|
113
|
+
this.lengthX = this.target.getCenterX() - this.source.getCenterX(), this.lengthY = this.target.getCenterY() - this.source.getCenterY(), Math.abs(this.lengthX) < 1 && (this.lengthX = i.sign(this.lengthX)), Math.abs(this.lengthY) < 1 && (this.lengthY = i.sign(this.lengthY)), this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY);
|
|
114
|
+
}, _.exports = r;
|
|
115
115
|
},
|
|
116
116
|
/* 2 */
|
|
117
117
|
/***/
|
|
@@ -124,9 +124,9 @@ function ci() {
|
|
|
124
124
|
/* 3 */
|
|
125
125
|
/***/
|
|
126
126
|
function(_, k, T) {
|
|
127
|
-
var g = T(2), a = T(10),
|
|
127
|
+
var g = T(2), a = T(10), i = T(13), r = T(0), e = T(16), l = T(5);
|
|
128
128
|
function n(t, s, h, u) {
|
|
129
|
-
h == null && u == null && (u = s), g.call(this, u), t.graphManager != null && (t = t.graphManager), this.estimatedSize = a.MIN_VALUE, this.inclusionTreeDepth = a.MAX_VALUE, this.vGraphObject = u, this.edges = [], this.graphManager = t, h != null && s != null ? this.rect = new
|
|
129
|
+
h == null && u == null && (u = s), g.call(this, u), t.graphManager != null && (t = t.graphManager), this.estimatedSize = a.MIN_VALUE, this.inclusionTreeDepth = a.MAX_VALUE, this.vGraphObject = u, this.edges = [], this.graphManager = t, h != null && s != null ? this.rect = new i(s.x, s.y, h.width, h.height) : this.rect = new i();
|
|
130
130
|
}
|
|
131
131
|
n.prototype = Object.create(g.prototype);
|
|
132
132
|
for (var v in g)
|
|
@@ -215,16 +215,16 @@ function ci() {
|
|
|
215
215
|
}, n.prototype.calcEstimatedSize = function() {
|
|
216
216
|
return this.child == null ? this.estimatedSize = (this.rect.width + this.rect.height) / 2 : (this.estimatedSize = this.child.calcEstimatedSize(), this.rect.width = this.estimatedSize, this.rect.height = this.estimatedSize, this.estimatedSize);
|
|
217
217
|
}, n.prototype.scatter = function() {
|
|
218
|
-
var t, s, h = -
|
|
219
|
-
t =
|
|
220
|
-
var c = -
|
|
221
|
-
s =
|
|
218
|
+
var t, s, h = -r.INITIAL_WORLD_BOUNDARY, u = r.INITIAL_WORLD_BOUNDARY;
|
|
219
|
+
t = r.WORLD_CENTER_X + e.nextDouble() * (u - h) + h;
|
|
220
|
+
var c = -r.INITIAL_WORLD_BOUNDARY, N = r.INITIAL_WORLD_BOUNDARY;
|
|
221
|
+
s = r.WORLD_CENTER_Y + e.nextDouble() * (N - c) + c, this.rect.x = t, this.rect.y = s;
|
|
222
222
|
}, n.prototype.updateBounds = function() {
|
|
223
223
|
if (this.getChild() == null)
|
|
224
224
|
throw "assert failed";
|
|
225
225
|
if (this.getChild().getNodes().length != 0) {
|
|
226
226
|
var t = this.getChild();
|
|
227
|
-
if (t.updateBounds(!0), this.rect.x = t.getLeft(), this.rect.y = t.getTop(), this.setWidth(t.getRight() - t.getLeft()), this.setHeight(t.getBottom() - t.getTop()),
|
|
227
|
+
if (t.updateBounds(!0), this.rect.x = t.getLeft(), this.rect.y = t.getTop(), this.setWidth(t.getRight() - t.getLeft()), this.setHeight(t.getBottom() - t.getTop()), r.NODE_DIMENSIONS_INCLUDE_LABELS) {
|
|
228
228
|
var s = t.getRight() - t.getLeft(), h = t.getBottom() - t.getTop();
|
|
229
229
|
this.labelWidth && (this.labelPosHorizontal == "left" ? (this.rect.x -= this.labelWidth, this.setWidth(s + this.labelWidth)) : this.labelPosHorizontal == "center" && this.labelWidth > s ? (this.rect.x -= (this.labelWidth - s) / 2, this.setWidth(this.labelWidth)) : this.labelPosHorizontal == "right" && this.setWidth(s + this.labelWidth)), this.labelHeight && (this.labelPosVertical == "top" ? (this.rect.y -= this.labelHeight, this.setHeight(h + this.labelHeight)) : this.labelPosVertical == "center" && this.labelHeight > h ? (this.rect.y -= (this.labelHeight - h) / 2, this.setHeight(this.labelHeight)) : this.labelPosVertical == "bottom" && this.setHeight(h + this.labelHeight));
|
|
230
230
|
}
|
|
@@ -235,9 +235,9 @@ function ci() {
|
|
|
235
235
|
return this.inclusionTreeDepth;
|
|
236
236
|
}, n.prototype.transform = function(t) {
|
|
237
237
|
var s = this.rect.x;
|
|
238
|
-
s >
|
|
238
|
+
s > r.WORLD_BOUNDARY ? s = r.WORLD_BOUNDARY : s < -r.WORLD_BOUNDARY && (s = -r.WORLD_BOUNDARY);
|
|
239
239
|
var h = this.rect.y;
|
|
240
|
-
h >
|
|
240
|
+
h > r.WORLD_BOUNDARY ? h = r.WORLD_BOUNDARY : h < -r.WORLD_BOUNDARY && (h = -r.WORLD_BOUNDARY);
|
|
241
241
|
var u = new l(s, h), c = t.inverseTransformPoint(u);
|
|
242
242
|
this.setLocation(c.x, c.y);
|
|
243
243
|
}, n.prototype.getLeft = function() {
|
|
@@ -258,15 +258,15 @@ function ci() {
|
|
|
258
258
|
var g = T(0);
|
|
259
259
|
function a() {
|
|
260
260
|
}
|
|
261
|
-
for (var
|
|
262
|
-
a[
|
|
261
|
+
for (var i in g)
|
|
262
|
+
a[i] = g[i];
|
|
263
263
|
a.MAX_ITERATIONS = 2500, a.DEFAULT_EDGE_LENGTH = 50, a.DEFAULT_SPRING_STRENGTH = 0.45, a.DEFAULT_REPULSION_STRENGTH = 4500, a.DEFAULT_GRAVITY_STRENGTH = 0.4, a.DEFAULT_COMPOUND_GRAVITY_STRENGTH = 1, a.DEFAULT_GRAVITY_RANGE_FACTOR = 3.8, a.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = 1.5, a.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION = !0, a.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION = !0, a.DEFAULT_COOLING_FACTOR_INCREMENTAL = 0.3, a.COOLING_ADAPTATION_FACTOR = 0.33, a.ADAPTATION_LOWER_NODE_LIMIT = 1e3, a.ADAPTATION_UPPER_NODE_LIMIT = 5e3, a.MAX_NODE_DISPLACEMENT_INCREMENTAL = 100, a.MAX_NODE_DISPLACEMENT = a.MAX_NODE_DISPLACEMENT_INCREMENTAL * 3, a.MIN_REPULSION_DIST = a.DEFAULT_EDGE_LENGTH / 10, a.CONVERGENCE_CHECK_PERIOD = 100, a.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = 0.1, a.MIN_EDGE_LENGTH = 1, a.GRID_CALCULATION_CHECK_PERIOD = 10, _.exports = a;
|
|
264
264
|
},
|
|
265
265
|
/* 5 */
|
|
266
266
|
/***/
|
|
267
267
|
function(_, k, T) {
|
|
268
|
-
function g(a,
|
|
269
|
-
a == null &&
|
|
268
|
+
function g(a, i) {
|
|
269
|
+
a == null && i == null ? (this.x = 0, this.y = 0) : (this.x = a, this.y = i);
|
|
270
270
|
}
|
|
271
271
|
g.prototype.getX = function() {
|
|
272
272
|
return this.x;
|
|
@@ -287,9 +287,9 @@ function ci() {
|
|
|
287
287
|
/* 6 */
|
|
288
288
|
/***/
|
|
289
289
|
function(_, k, T) {
|
|
290
|
-
var g = T(2), a = T(10),
|
|
290
|
+
var g = T(2), a = T(10), i = T(0), r = T(7), e = T(3), l = T(1), n = T(13), v = T(12), t = T(11);
|
|
291
291
|
function s(u, c, N) {
|
|
292
|
-
g.call(this, N), this.estimatedSize = a.MIN_VALUE, this.margin =
|
|
292
|
+
g.call(this, N), this.estimatedSize = a.MIN_VALUE, this.margin = i.DEFAULT_GRAPH_MARGIN, this.edges = [], this.nodes = [], this.isConnected = !1, this.parent = u, c != null && c instanceof r ? this.graphManager = c : c != null && c instanceof Layout && (this.graphManager = c.graphManager);
|
|
293
293
|
}
|
|
294
294
|
s.prototype = Object.create(g.prototype);
|
|
295
295
|
for (var h in g)
|
|
@@ -368,8 +368,8 @@ function ci() {
|
|
|
368
368
|
return u == a.MAX_VALUE ? null : (I[0].getParent().paddingLeft != null ? y = I[0].getParent().paddingLeft : y = this.margin, this.left = c - y, this.top = u - y, new v(this.left, this.top));
|
|
369
369
|
}, s.prototype.updateBounds = function(u) {
|
|
370
370
|
for (var c = a.MAX_VALUE, N = -a.MAX_VALUE, d = a.MAX_VALUE, y = -a.MAX_VALUE, I, w, Y, F, H, z = this.nodes, q = z.length, x = 0; x < q; x++) {
|
|
371
|
-
var
|
|
372
|
-
u &&
|
|
371
|
+
var it = z[x];
|
|
372
|
+
u && it.child != null && it.updateBounds(), I = it.getLeft(), w = it.getRight(), Y = it.getTop(), F = it.getBottom(), c > I && (c = I), N < w && (N = w), d > Y && (d = Y), y < F && (y = F);
|
|
373
373
|
}
|
|
374
374
|
var o = new n(c, d, N - c, y - d);
|
|
375
375
|
c == a.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), z[0].getParent().paddingLeft != null ? H = z[0].getParent().paddingLeft : H = this.margin, this.left = o.x - H, this.right = o.x + o.width + H, this.top = o.y - H, this.bottom = o.y + o.height + H;
|
|
@@ -391,7 +391,7 @@ function ci() {
|
|
|
391
391
|
var y = c[d];
|
|
392
392
|
u += y.calcEstimatedSize();
|
|
393
393
|
}
|
|
394
|
-
return u == 0 ? this.estimatedSize =
|
|
394
|
+
return u == 0 ? this.estimatedSize = i.EMPTY_COMPOUND_NODE_SIZE : this.estimatedSize = u / Math.sqrt(this.nodes.length), this.estimatedSize;
|
|
395
395
|
}, s.prototype.updateConnected = function() {
|
|
396
396
|
var u = this;
|
|
397
397
|
if (this.nodes.length == 0) {
|
|
@@ -425,27 +425,27 @@ function ci() {
|
|
|
425
425
|
/***/
|
|
426
426
|
function(_, k, T) {
|
|
427
427
|
var g, a = T(1);
|
|
428
|
-
function r
|
|
429
|
-
g = T(6), this.layout =
|
|
428
|
+
function i(r) {
|
|
429
|
+
g = T(6), this.layout = r, this.graphs = [], this.edges = [];
|
|
430
430
|
}
|
|
431
|
-
|
|
432
|
-
var
|
|
431
|
+
i.prototype.addRoot = function() {
|
|
432
|
+
var r = this.layout.newGraph(), e = this.layout.newNode(null), l = this.add(r, e);
|
|
433
433
|
return this.setRootGraph(l), this.rootGraph;
|
|
434
|
-
},
|
|
434
|
+
}, i.prototype.add = function(r, e, l, n, v) {
|
|
435
435
|
if (l == null && n == null && v == null) {
|
|
436
|
-
if (
|
|
436
|
+
if (r == null)
|
|
437
437
|
throw "Graph is null!";
|
|
438
438
|
if (e == null)
|
|
439
439
|
throw "Parent node is null!";
|
|
440
|
-
if (this.graphs.indexOf(
|
|
440
|
+
if (this.graphs.indexOf(r) > -1)
|
|
441
441
|
throw "Graph already in this graph mgr!";
|
|
442
|
-
if (this.graphs.push(
|
|
442
|
+
if (this.graphs.push(r), r.parent != null)
|
|
443
443
|
throw "Already has a parent!";
|
|
444
444
|
if (e.child != null)
|
|
445
445
|
throw "Already has a child!";
|
|
446
|
-
return
|
|
446
|
+
return r.parent = e, e.child = r, r;
|
|
447
447
|
} else {
|
|
448
|
-
v = l, n = e, l =
|
|
448
|
+
v = l, n = e, l = r;
|
|
449
449
|
var t = n.getOwner(), s = v.getOwner();
|
|
450
450
|
if (!(t != null && t.getGraphManager() == this))
|
|
451
451
|
throw "Source not in this graph mgr!";
|
|
@@ -461,9 +461,9 @@ function ci() {
|
|
|
461
461
|
throw "Edge already in source and/or target incidency list!";
|
|
462
462
|
return l.source.edges.push(l), l.target.edges.push(l), l;
|
|
463
463
|
}
|
|
464
|
-
},
|
|
465
|
-
if (
|
|
466
|
-
var e =
|
|
464
|
+
}, i.prototype.remove = function(r) {
|
|
465
|
+
if (r instanceof g) {
|
|
466
|
+
var e = r;
|
|
467
467
|
if (e.getGraphManager() != this)
|
|
468
468
|
throw "Graph not in this graph mgr";
|
|
469
469
|
if (!(e == this.rootGraph || e.parent != null && e.parent.graphManager == this))
|
|
@@ -481,8 +481,8 @@ function ci() {
|
|
|
481
481
|
e == this.rootGraph && this.setRootGraph(null);
|
|
482
482
|
var u = this.graphs.indexOf(e);
|
|
483
483
|
this.graphs.splice(u, 1), e.parent = null;
|
|
484
|
-
} else if (
|
|
485
|
-
if (n =
|
|
484
|
+
} else if (r instanceof a) {
|
|
485
|
+
if (n = r, n == null)
|
|
486
486
|
throw "Edge is null!";
|
|
487
487
|
if (!n.isInterGraph)
|
|
488
488
|
throw "Not an inter-graph edge!";
|
|
@@ -498,52 +498,52 @@ function ci() {
|
|
|
498
498
|
var u = n.source.owner.getGraphManager().edges.indexOf(n);
|
|
499
499
|
n.source.owner.getGraphManager().edges.splice(u, 1);
|
|
500
500
|
}
|
|
501
|
-
},
|
|
501
|
+
}, i.prototype.updateBounds = function() {
|
|
502
502
|
this.rootGraph.updateBounds(!0);
|
|
503
|
-
},
|
|
503
|
+
}, i.prototype.getGraphs = function() {
|
|
504
504
|
return this.graphs;
|
|
505
|
-
},
|
|
505
|
+
}, i.prototype.getAllNodes = function() {
|
|
506
506
|
if (this.allNodes == null) {
|
|
507
|
-
for (var
|
|
508
|
-
|
|
509
|
-
this.allNodes =
|
|
507
|
+
for (var r = [], e = this.getGraphs(), l = e.length, n = 0; n < l; n++)
|
|
508
|
+
r = r.concat(e[n].getNodes());
|
|
509
|
+
this.allNodes = r;
|
|
510
510
|
}
|
|
511
511
|
return this.allNodes;
|
|
512
|
-
},
|
|
512
|
+
}, i.prototype.resetAllNodes = function() {
|
|
513
513
|
this.allNodes = null;
|
|
514
|
-
},
|
|
514
|
+
}, i.prototype.resetAllEdges = function() {
|
|
515
515
|
this.allEdges = null;
|
|
516
|
-
},
|
|
516
|
+
}, i.prototype.resetAllNodesToApplyGravitation = function() {
|
|
517
517
|
this.allNodesToApplyGravitation = null;
|
|
518
|
-
},
|
|
518
|
+
}, i.prototype.getAllEdges = function() {
|
|
519
519
|
if (this.allEdges == null) {
|
|
520
|
-
var
|
|
520
|
+
var r = [], e = this.getGraphs();
|
|
521
521
|
e.length;
|
|
522
522
|
for (var l = 0; l < e.length; l++)
|
|
523
|
-
|
|
524
|
-
|
|
523
|
+
r = r.concat(e[l].getEdges());
|
|
524
|
+
r = r.concat(this.edges), this.allEdges = r;
|
|
525
525
|
}
|
|
526
526
|
return this.allEdges;
|
|
527
|
-
},
|
|
527
|
+
}, i.prototype.getAllNodesToApplyGravitation = function() {
|
|
528
528
|
return this.allNodesToApplyGravitation;
|
|
529
|
-
},
|
|
529
|
+
}, i.prototype.setAllNodesToApplyGravitation = function(r) {
|
|
530
530
|
if (this.allNodesToApplyGravitation != null)
|
|
531
531
|
throw "assert failed";
|
|
532
|
-
this.allNodesToApplyGravitation =
|
|
533
|
-
},
|
|
532
|
+
this.allNodesToApplyGravitation = r;
|
|
533
|
+
}, i.prototype.getRoot = function() {
|
|
534
534
|
return this.rootGraph;
|
|
535
|
-
},
|
|
536
|
-
if (
|
|
535
|
+
}, i.prototype.setRootGraph = function(r) {
|
|
536
|
+
if (r.getGraphManager() != this)
|
|
537
537
|
throw "Root not in this graph mgr!";
|
|
538
|
-
this.rootGraph =
|
|
539
|
-
},
|
|
538
|
+
this.rootGraph = r, r.parent == null && (r.parent = this.layout.newNode("Root node"));
|
|
539
|
+
}, i.prototype.getLayout = function() {
|
|
540
540
|
return this.layout;
|
|
541
|
-
},
|
|
542
|
-
if (!(
|
|
541
|
+
}, i.prototype.isOneAncestorOfOther = function(r, e) {
|
|
542
|
+
if (!(r != null && e != null))
|
|
543
543
|
throw "assert failed";
|
|
544
|
-
if (
|
|
544
|
+
if (r == e)
|
|
545
545
|
return !0;
|
|
546
|
-
var l =
|
|
546
|
+
var l = r.getOwner(), n;
|
|
547
547
|
do {
|
|
548
548
|
if (n = l.getParent(), n == null)
|
|
549
549
|
break;
|
|
@@ -556,41 +556,41 @@ function ci() {
|
|
|
556
556
|
do {
|
|
557
557
|
if (n = l.getParent(), n == null)
|
|
558
558
|
break;
|
|
559
|
-
if (n ==
|
|
559
|
+
if (n == r)
|
|
560
560
|
return !0;
|
|
561
561
|
if (l = n.getOwner(), l == null)
|
|
562
562
|
break;
|
|
563
563
|
} while (!0);
|
|
564
564
|
return !1;
|
|
565
|
-
},
|
|
566
|
-
for (var
|
|
567
|
-
if (
|
|
568
|
-
|
|
565
|
+
}, i.prototype.calcLowestCommonAncestors = function() {
|
|
566
|
+
for (var r, e, l, n, v, t = this.getAllEdges(), s = t.length, h = 0; h < s; h++) {
|
|
567
|
+
if (r = t[h], e = r.source, l = r.target, r.lca = null, r.sourceInLca = e, r.targetInLca = l, e == l) {
|
|
568
|
+
r.lca = e.getOwner();
|
|
569
569
|
continue;
|
|
570
570
|
}
|
|
571
|
-
for (n = e.getOwner();
|
|
572
|
-
for (
|
|
571
|
+
for (n = e.getOwner(); r.lca == null; ) {
|
|
572
|
+
for (r.targetInLca = l, v = l.getOwner(); r.lca == null; ) {
|
|
573
573
|
if (v == n) {
|
|
574
|
-
|
|
574
|
+
r.lca = v;
|
|
575
575
|
break;
|
|
576
576
|
}
|
|
577
577
|
if (v == this.rootGraph)
|
|
578
578
|
break;
|
|
579
|
-
if (
|
|
579
|
+
if (r.lca != null)
|
|
580
580
|
throw "assert failed";
|
|
581
|
-
|
|
581
|
+
r.targetInLca = v.getParent(), v = r.targetInLca.getOwner();
|
|
582
582
|
}
|
|
583
583
|
if (n == this.rootGraph)
|
|
584
584
|
break;
|
|
585
|
-
|
|
585
|
+
r.lca == null && (r.sourceInLca = n.getParent(), n = r.sourceInLca.getOwner());
|
|
586
586
|
}
|
|
587
|
-
if (
|
|
587
|
+
if (r.lca == null)
|
|
588
588
|
throw "assert failed";
|
|
589
589
|
}
|
|
590
|
-
},
|
|
591
|
-
if (
|
|
592
|
-
return
|
|
593
|
-
var l =
|
|
590
|
+
}, i.prototype.calcLowestCommonAncestor = function(r, e) {
|
|
591
|
+
if (r == e)
|
|
592
|
+
return r.getOwner();
|
|
593
|
+
var l = r.getOwner();
|
|
594
594
|
do {
|
|
595
595
|
if (l == null)
|
|
596
596
|
break;
|
|
@@ -605,17 +605,17 @@ function ci() {
|
|
|
605
605
|
l = l.getParent().getOwner();
|
|
606
606
|
} while (!0);
|
|
607
607
|
return l;
|
|
608
|
-
},
|
|
609
|
-
|
|
610
|
-
for (var l, n =
|
|
608
|
+
}, i.prototype.calcInclusionTreeDepths = function(r, e) {
|
|
609
|
+
r == null && e == null && (r = this.rootGraph, e = 1);
|
|
610
|
+
for (var l, n = r.getNodes(), v = n.length, t = 0; t < v; t++)
|
|
611
611
|
l = n[t], l.inclusionTreeDepth = e, l.child != null && this.calcInclusionTreeDepths(l.child, e + 1);
|
|
612
|
-
},
|
|
613
|
-
for (var
|
|
614
|
-
|
|
612
|
+
}, i.prototype.includesInvalidEdge = function() {
|
|
613
|
+
for (var r, e = [], l = this.edges.length, n = 0; n < l; n++)
|
|
614
|
+
r = this.edges[n], this.isOneAncestorOfOther(r.source, r.target) && e.push(r);
|
|
615
615
|
for (var n = 0; n < e.length; n++)
|
|
616
616
|
this.remove(e[n]);
|
|
617
617
|
return !1;
|
|
618
|
-
}, _.exports =
|
|
618
|
+
}, _.exports = i;
|
|
619
619
|
},
|
|
620
620
|
/* 8 */
|
|
621
621
|
/***/
|
|
@@ -623,22 +623,22 @@ function ci() {
|
|
|
623
623
|
var g = T(12);
|
|
624
624
|
function a() {
|
|
625
625
|
}
|
|
626
|
-
a.calcSeparationAmount = function(
|
|
627
|
-
if (!
|
|
626
|
+
a.calcSeparationAmount = function(i, r, e, l) {
|
|
627
|
+
if (!i.intersects(r))
|
|
628
628
|
throw "assert failed";
|
|
629
629
|
var n = new Array(2);
|
|
630
|
-
this.decideDirectionsForOverlappingNodes(
|
|
631
|
-
var v = Math.abs((
|
|
632
|
-
|
|
630
|
+
this.decideDirectionsForOverlappingNodes(i, r, n), e[0] = Math.min(i.getRight(), r.getRight()) - Math.max(i.x, r.x), e[1] = Math.min(i.getBottom(), r.getBottom()) - Math.max(i.y, r.y), i.getX() <= r.getX() && i.getRight() >= r.getRight() ? e[0] += Math.min(r.getX() - i.getX(), i.getRight() - r.getRight()) : r.getX() <= i.getX() && r.getRight() >= i.getRight() && (e[0] += Math.min(i.getX() - r.getX(), r.getRight() - i.getRight())), i.getY() <= r.getY() && i.getBottom() >= r.getBottom() ? e[1] += Math.min(r.getY() - i.getY(), i.getBottom() - r.getBottom()) : r.getY() <= i.getY() && r.getBottom() >= i.getBottom() && (e[1] += Math.min(i.getY() - r.getY(), r.getBottom() - i.getBottom()));
|
|
631
|
+
var v = Math.abs((r.getCenterY() - i.getCenterY()) / (r.getCenterX() - i.getCenterX()));
|
|
632
|
+
r.getCenterY() === i.getCenterY() && r.getCenterX() === i.getCenterX() && (v = 1);
|
|
633
633
|
var t = v * e[0], s = e[1] / v;
|
|
634
634
|
e[0] < s ? s = e[0] : t = e[1], e[0] = -1 * n[0] * (s / 2 + l), e[1] = -1 * n[1] * (t / 2 + l);
|
|
635
|
-
}, a.decideDirectionsForOverlappingNodes = function(
|
|
636
|
-
|
|
637
|
-
}, a.getIntersection2 = function(
|
|
638
|
-
var l =
|
|
639
|
-
if (
|
|
635
|
+
}, a.decideDirectionsForOverlappingNodes = function(i, r, e) {
|
|
636
|
+
i.getCenterX() < r.getCenterX() ? e[0] = -1 : e[0] = 1, i.getCenterY() < r.getCenterY() ? e[1] = -1 : e[1] = 1;
|
|
637
|
+
}, a.getIntersection2 = function(i, r, e) {
|
|
638
|
+
var l = i.getCenterX(), n = i.getCenterY(), v = r.getCenterX(), t = r.getCenterY();
|
|
639
|
+
if (i.intersects(r))
|
|
640
640
|
return e[0] = l, e[1] = n, e[2] = v, e[3] = t, !0;
|
|
641
|
-
var s =
|
|
641
|
+
var s = i.getX(), h = i.getY(), u = i.getRight(), c = i.getX(), N = i.getBottom(), d = i.getRight(), y = i.getWidthHalf(), I = i.getHeightHalf(), w = r.getX(), Y = r.getY(), F = r.getRight(), H = r.getX(), z = r.getBottom(), q = r.getRight(), x = r.getWidthHalf(), it = r.getHeightHalf(), o = !1, E = !1;
|
|
642
642
|
if (l === v) {
|
|
643
643
|
if (n > t)
|
|
644
644
|
return e[0] = l, e[1] = h, e[2] = v, e[3] = z, !1;
|
|
@@ -650,10 +650,10 @@ function ci() {
|
|
|
650
650
|
if (l < v)
|
|
651
651
|
return e[0] = u, e[1] = n, e[2] = w, e[3] = t, !1;
|
|
652
652
|
} else {
|
|
653
|
-
var
|
|
654
|
-
if (-
|
|
653
|
+
var f = i.height / i.width, p = r.height / r.width, m = (t - n) / (v - l), O = void 0, L = void 0, C = void 0, P = void 0, S = void 0, B = void 0;
|
|
654
|
+
if (-f === m ? l > v ? (e[0] = c, e[1] = N, o = !0) : (e[0] = u, e[1] = h, o = !0) : f === m && (l > v ? (e[0] = s, e[1] = h, o = !0) : (e[0] = d, e[1] = N, o = !0)), -p === m ? v > l ? (e[2] = H, e[3] = z, E = !0) : (e[2] = F, e[3] = Y, E = !0) : p === m && (v > l ? (e[2] = w, e[3] = Y, E = !0) : (e[2] = q, e[3] = z, E = !0)), o && E)
|
|
655
655
|
return !1;
|
|
656
|
-
if (l > v ? n > t ? (O = this.getCardinalDirection(
|
|
656
|
+
if (l > v ? n > t ? (O = this.getCardinalDirection(f, m, 4), L = this.getCardinalDirection(p, m, 2)) : (O = this.getCardinalDirection(-f, m, 3), L = this.getCardinalDirection(-p, m, 1)) : n > t ? (O = this.getCardinalDirection(-f, m, 1), L = this.getCardinalDirection(-p, m, 3)) : (O = this.getCardinalDirection(f, m, 2), L = this.getCardinalDirection(p, m, 4)), !o)
|
|
657
657
|
switch (O) {
|
|
658
658
|
case 1:
|
|
659
659
|
P = h, C = l + -I / m, e[0] = C, e[1] = P;
|
|
@@ -671,13 +671,13 @@ function ci() {
|
|
|
671
671
|
if (!E)
|
|
672
672
|
switch (L) {
|
|
673
673
|
case 1:
|
|
674
|
-
B = Y, S = v + -
|
|
674
|
+
B = Y, S = v + -it / m, e[2] = S, e[3] = B;
|
|
675
675
|
break;
|
|
676
676
|
case 2:
|
|
677
677
|
S = q, B = t + x * m, e[2] = S, e[3] = B;
|
|
678
678
|
break;
|
|
679
679
|
case 3:
|
|
680
|
-
B = z, S = v +
|
|
680
|
+
B = z, S = v + it / m, e[2] = S, e[3] = B;
|
|
681
681
|
break;
|
|
682
682
|
case 4:
|
|
683
683
|
S = H, B = t + -x * m, e[2] = S, e[3] = B;
|
|
@@ -685,24 +685,24 @@ function ci() {
|
|
|
685
685
|
}
|
|
686
686
|
}
|
|
687
687
|
return !1;
|
|
688
|
-
}, a.getCardinalDirection = function(
|
|
689
|
-
return
|
|
690
|
-
}, a.getIntersection = function(
|
|
688
|
+
}, a.getCardinalDirection = function(i, r, e) {
|
|
689
|
+
return i > r ? e : 1 + e % 4;
|
|
690
|
+
}, a.getIntersection = function(i, r, e, l) {
|
|
691
691
|
if (l == null)
|
|
692
|
-
return this.getIntersection2(
|
|
693
|
-
var n =
|
|
692
|
+
return this.getIntersection2(i, r, e);
|
|
693
|
+
var n = i.x, v = i.y, t = r.x, s = r.y, h = e.x, u = e.y, c = l.x, N = l.y, d = void 0, y = void 0, I = void 0, w = void 0, Y = void 0, F = void 0, H = void 0, z = void 0, q = void 0;
|
|
694
694
|
return I = s - v, Y = n - t, H = t * v - n * s, w = N - u, F = h - c, z = c * u - h * N, q = I * F - w * Y, q === 0 ? null : (d = (Y * z - F * H) / q, y = (w * H - I * z) / q, new g(d, y));
|
|
695
|
-
}, a.angleOfVector = function(
|
|
695
|
+
}, a.angleOfVector = function(i, r, e, l) {
|
|
696
696
|
var n = void 0;
|
|
697
|
-
return
|
|
698
|
-
}, a.doIntersect = function(
|
|
699
|
-
var n =
|
|
697
|
+
return i !== e ? (n = Math.atan((l - r) / (e - i)), e < i ? n += Math.PI : l < r && (n += this.TWO_PI)) : l < r ? n = this.ONE_AND_HALF_PI : n = this.HALF_PI, n;
|
|
698
|
+
}, a.doIntersect = function(i, r, e, l) {
|
|
699
|
+
var n = i.x, v = i.y, t = r.x, s = r.y, h = e.x, u = e.y, c = l.x, N = l.y, d = (t - n) * (N - u) - (c - h) * (s - v);
|
|
700
700
|
if (d === 0)
|
|
701
701
|
return !1;
|
|
702
702
|
var y = ((N - u) * (c - n) + (h - c) * (N - v)) / d, I = ((v - s) * (c - n) + (t - n) * (N - v)) / d;
|
|
703
703
|
return 0 < y && y < 1 && 0 < I && I < 1;
|
|
704
|
-
}, a.findCircleLineIntersections = function(
|
|
705
|
-
var s = (e -
|
|
704
|
+
}, a.findCircleLineIntersections = function(i, r, e, l, n, v, t) {
|
|
705
|
+
var s = (e - i) * (e - i) + (l - r) * (l - r), h = 2 * ((i - n) * (e - i) + (r - v) * (l - r)), u = (i - n) * (i - n) + (r - v) * (r - v) - t * t, c = h * h - 4 * s * u;
|
|
706
706
|
if (c >= 0) {
|
|
707
707
|
var N = (-h + Math.sqrt(h * h - 4 * s * u)) / (2 * s), d = (-h - Math.sqrt(h * h - 4 * s * u)) / (2 * s), y = null;
|
|
708
708
|
return N >= 0 && N <= 1 ? [N] : d >= 0 && d <= 1 ? [d] : y;
|
|
@@ -747,9 +747,9 @@ function ci() {
|
|
|
747
747
|
if (!(n instanceof v))
|
|
748
748
|
throw new TypeError("Cannot call a class as a function");
|
|
749
749
|
}
|
|
750
|
-
var
|
|
750
|
+
var i = function(n) {
|
|
751
751
|
return { value: n, next: null, prev: null };
|
|
752
|
-
},
|
|
752
|
+
}, r = function(n, v, t, s) {
|
|
753
753
|
return n !== null ? n.next = v : s.head = v, t !== null ? t.prev = v : s.tail = v, v.prev = n, v.next = t, s.length++, v;
|
|
754
754
|
}, e = function(n, v) {
|
|
755
755
|
var t = n.prev, s = n.next;
|
|
@@ -769,32 +769,32 @@ function ci() {
|
|
|
769
769
|
}, {
|
|
770
770
|
key: "insertBefore",
|
|
771
771
|
value: function(v, t) {
|
|
772
|
-
return
|
|
772
|
+
return r(t.prev, i(v), t, this);
|
|
773
773
|
}
|
|
774
774
|
}, {
|
|
775
775
|
key: "insertAfter",
|
|
776
776
|
value: function(v, t) {
|
|
777
|
-
return
|
|
777
|
+
return r(t, i(v), t.next, this);
|
|
778
778
|
}
|
|
779
779
|
}, {
|
|
780
780
|
key: "insertNodeBefore",
|
|
781
781
|
value: function(v, t) {
|
|
782
|
-
return
|
|
782
|
+
return r(t.prev, v, t, this);
|
|
783
783
|
}
|
|
784
784
|
}, {
|
|
785
785
|
key: "insertNodeAfter",
|
|
786
786
|
value: function(v, t) {
|
|
787
|
-
return
|
|
787
|
+
return r(t, v, t.next, this);
|
|
788
788
|
}
|
|
789
789
|
}, {
|
|
790
790
|
key: "push",
|
|
791
791
|
value: function(v) {
|
|
792
|
-
return
|
|
792
|
+
return r(this.tail, i(v), null, this);
|
|
793
793
|
}
|
|
794
794
|
}, {
|
|
795
795
|
key: "unshift",
|
|
796
796
|
value: function(v) {
|
|
797
|
-
return
|
|
797
|
+
return r(null, i(v), this.head, this);
|
|
798
798
|
}
|
|
799
799
|
}, {
|
|
800
800
|
key: "remove",
|
|
@@ -846,8 +846,8 @@ function ci() {
|
|
|
846
846
|
/* 12 */
|
|
847
847
|
/***/
|
|
848
848
|
function(_, k, T) {
|
|
849
|
-
function g(a,
|
|
850
|
-
this.x = null, this.y = null, a == null &&
|
|
849
|
+
function g(a, i, r) {
|
|
850
|
+
this.x = null, this.y = null, a == null && i == null && r == null ? (this.x = 0, this.y = 0) : typeof a == "number" && typeof i == "number" && r == null ? (this.x = a, this.y = i) : a.constructor.name == "Point" && i == null && r == null && (r = a, this.x = r.x, this.y = r.y);
|
|
851
851
|
}
|
|
852
852
|
g.prototype.getX = function() {
|
|
853
853
|
return this.x;
|
|
@@ -855,16 +855,16 @@ function ci() {
|
|
|
855
855
|
return this.y;
|
|
856
856
|
}, g.prototype.getLocation = function() {
|
|
857
857
|
return new g(this.x, this.y);
|
|
858
|
-
}, g.prototype.setLocation = function(a,
|
|
859
|
-
a.constructor.name == "Point" &&
|
|
860
|
-
}, g.prototype.move = function(a,
|
|
861
|
-
this.x = a, this.y =
|
|
862
|
-
}, g.prototype.translate = function(a,
|
|
863
|
-
this.x += a, this.y +=
|
|
858
|
+
}, g.prototype.setLocation = function(a, i, r) {
|
|
859
|
+
a.constructor.name == "Point" && i == null && r == null ? (r = a, this.setLocation(r.x, r.y)) : typeof a == "number" && typeof i == "number" && r == null && (parseInt(a) == a && parseInt(i) == i ? this.move(a, i) : (this.x = Math.floor(a + 0.5), this.y = Math.floor(i + 0.5)));
|
|
860
|
+
}, g.prototype.move = function(a, i) {
|
|
861
|
+
this.x = a, this.y = i;
|
|
862
|
+
}, g.prototype.translate = function(a, i) {
|
|
863
|
+
this.x += a, this.y += i;
|
|
864
864
|
}, g.prototype.equals = function(a) {
|
|
865
865
|
if (a.constructor.name == "Point") {
|
|
866
|
-
var
|
|
867
|
-
return this.x ==
|
|
866
|
+
var i = a;
|
|
867
|
+
return this.x == i.x && this.y == i.y;
|
|
868
868
|
}
|
|
869
869
|
return this == a;
|
|
870
870
|
}, g.prototype.toString = function() {
|
|
@@ -874,8 +874,8 @@ function ci() {
|
|
|
874
874
|
/* 13 */
|
|
875
875
|
/***/
|
|
876
876
|
function(_, k, T) {
|
|
877
|
-
function g(a,
|
|
878
|
-
this.x = 0, this.y = 0, this.width = 0, this.height = 0, a != null &&
|
|
877
|
+
function g(a, i, r, e) {
|
|
878
|
+
this.x = 0, this.y = 0, this.width = 0, this.height = 0, a != null && i != null && r != null && e != null && (this.x = a, this.y = i, this.width = r, this.height = e);
|
|
879
879
|
}
|
|
880
880
|
g.prototype.getX = function() {
|
|
881
881
|
return this.x;
|
|
@@ -920,20 +920,20 @@ function ci() {
|
|
|
920
920
|
/* 14 */
|
|
921
921
|
/***/
|
|
922
922
|
function(_, k, T) {
|
|
923
|
-
var g = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(
|
|
924
|
-
return typeof
|
|
925
|
-
} : function(
|
|
926
|
-
return
|
|
923
|
+
var g = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(i) {
|
|
924
|
+
return typeof i;
|
|
925
|
+
} : function(i) {
|
|
926
|
+
return i && typeof Symbol == "function" && i.constructor === Symbol && i !== Symbol.prototype ? "symbol" : typeof i;
|
|
927
927
|
};
|
|
928
928
|
function a() {
|
|
929
929
|
}
|
|
930
|
-
a.lastID = 0, a.createID = function(
|
|
931
|
-
return a.isPrimitive(
|
|
932
|
-
}, a.getString = function(
|
|
933
|
-
return
|
|
934
|
-
}, a.isPrimitive = function(
|
|
935
|
-
var
|
|
936
|
-
return
|
|
930
|
+
a.lastID = 0, a.createID = function(i) {
|
|
931
|
+
return a.isPrimitive(i) ? i : (i.uniqueID != null || (i.uniqueID = a.getString(), a.lastID++), i.uniqueID);
|
|
932
|
+
}, a.getString = function(i) {
|
|
933
|
+
return i == null && (i = a.lastID), "Object#" + i;
|
|
934
|
+
}, a.isPrimitive = function(i) {
|
|
935
|
+
var r = typeof i > "u" ? "undefined" : g(i);
|
|
936
|
+
return i == null || r != "object" && r != "function";
|
|
937
937
|
}, _.exports = a;
|
|
938
938
|
},
|
|
939
939
|
/* 15 */
|
|
@@ -947,9 +947,9 @@ function ci() {
|
|
|
947
947
|
} else
|
|
948
948
|
return Array.from(h);
|
|
949
949
|
}
|
|
950
|
-
var a = T(0),
|
|
950
|
+
var a = T(0), i = T(7), r = T(3), e = T(1), l = T(6), n = T(5), v = T(17), t = T(29);
|
|
951
951
|
function s(h) {
|
|
952
|
-
t.call(this), this.layoutQuality = a.QUALITY, this.createBendsAsNeeded = a.DEFAULT_CREATE_BENDS_AS_NEEDED, this.incremental = a.DEFAULT_INCREMENTAL, this.animationOnLayout = a.DEFAULT_ANIMATION_ON_LAYOUT, this.animationDuringLayout = a.DEFAULT_ANIMATION_DURING_LAYOUT, this.animationPeriod = a.DEFAULT_ANIMATION_PERIOD, this.uniformLeafNodeSizes = a.DEFAULT_UNIFORM_LEAF_NODE_SIZES, this.edgeToDummyNodes = /* @__PURE__ */ new Map(), this.graphManager = new
|
|
952
|
+
t.call(this), this.layoutQuality = a.QUALITY, this.createBendsAsNeeded = a.DEFAULT_CREATE_BENDS_AS_NEEDED, this.incremental = a.DEFAULT_INCREMENTAL, this.animationOnLayout = a.DEFAULT_ANIMATION_ON_LAYOUT, this.animationDuringLayout = a.DEFAULT_ANIMATION_DURING_LAYOUT, this.animationPeriod = a.DEFAULT_ANIMATION_PERIOD, this.uniformLeafNodeSizes = a.DEFAULT_UNIFORM_LEAF_NODE_SIZES, this.edgeToDummyNodes = /* @__PURE__ */ new Map(), this.graphManager = new i(this), this.isLayoutFinished = !1, this.isSubLayout = !1, this.isRemoteUse = !1, h != null && (this.isRemoteUse = h);
|
|
953
953
|
}
|
|
954
954
|
s.RANDOM_SEED = 1, s.prototype = Object.create(t.prototype), s.prototype.getGraphManager = function() {
|
|
955
955
|
return this.graphManager;
|
|
@@ -960,12 +960,12 @@ function ci() {
|
|
|
960
960
|
}, s.prototype.getAllNodesToApplyGravitation = function() {
|
|
961
961
|
return this.graphManager.getAllNodesToApplyGravitation();
|
|
962
962
|
}, s.prototype.newGraphManager = function() {
|
|
963
|
-
var h = new
|
|
963
|
+
var h = new i(this);
|
|
964
964
|
return this.graphManager = h, h;
|
|
965
965
|
}, s.prototype.newGraph = function(h) {
|
|
966
966
|
return new l(null, this.graphManager, h);
|
|
967
967
|
}, s.prototype.newNode = function(h) {
|
|
968
|
-
return new
|
|
968
|
+
return new r(this.graphManager, h);
|
|
969
969
|
}, s.prototype.newEdge = function(h) {
|
|
970
970
|
return new e(null, null, h);
|
|
971
971
|
}, s.prototype.checkLayoutSuccess = function() {
|
|
@@ -987,7 +987,7 @@ function ci() {
|
|
|
987
987
|
}, s.prototype.update = function(h) {
|
|
988
988
|
if (h == null)
|
|
989
989
|
this.update2();
|
|
990
|
-
else if (h instanceof
|
|
990
|
+
else if (h instanceof r) {
|
|
991
991
|
var u = h;
|
|
992
992
|
if (u.getChild() != null)
|
|
993
993
|
for (var c = u.getChild().getNodes(), N = 0; N < c.length; N++)
|
|
@@ -1055,8 +1055,8 @@ function ci() {
|
|
|
1055
1055
|
var q = [].concat(g(y));
|
|
1056
1056
|
h.push(q);
|
|
1057
1057
|
for (var d = 0; d < q.length; d++) {
|
|
1058
|
-
var x = q[d],
|
|
1059
|
-
|
|
1058
|
+
var x = q[d], it = Y.indexOf(x);
|
|
1059
|
+
it > -1 && Y.splice(it, 1);
|
|
1060
1060
|
}
|
|
1061
1061
|
y = /* @__PURE__ */ new Set(), w = /* @__PURE__ */ new Map();
|
|
1062
1062
|
}
|
|
@@ -1118,8 +1118,8 @@ function ci() {
|
|
|
1118
1118
|
var q = w.getNeighborsList();
|
|
1119
1119
|
q.forEach(function(o) {
|
|
1120
1120
|
if (c.indexOf(o) < 0) {
|
|
1121
|
-
var E = N.get(o),
|
|
1122
|
-
|
|
1121
|
+
var E = N.get(o), f = E - 1;
|
|
1122
|
+
f == 1 && F.push(o), N.set(o, f);
|
|
1123
1123
|
}
|
|
1124
1124
|
});
|
|
1125
1125
|
}
|
|
@@ -1143,56 +1143,56 @@ function ci() {
|
|
|
1143
1143
|
/***/
|
|
1144
1144
|
function(_, k, T) {
|
|
1145
1145
|
var g = T(5);
|
|
1146
|
-
function a(
|
|
1146
|
+
function a(i, r) {
|
|
1147
1147
|
this.lworldOrgX = 0, this.lworldOrgY = 0, this.ldeviceOrgX = 0, this.ldeviceOrgY = 0, this.lworldExtX = 1, this.lworldExtY = 1, this.ldeviceExtX = 1, this.ldeviceExtY = 1;
|
|
1148
1148
|
}
|
|
1149
1149
|
a.prototype.getWorldOrgX = function() {
|
|
1150
1150
|
return this.lworldOrgX;
|
|
1151
|
-
}, a.prototype.setWorldOrgX = function(
|
|
1152
|
-
this.lworldOrgX =
|
|
1151
|
+
}, a.prototype.setWorldOrgX = function(i) {
|
|
1152
|
+
this.lworldOrgX = i;
|
|
1153
1153
|
}, a.prototype.getWorldOrgY = function() {
|
|
1154
1154
|
return this.lworldOrgY;
|
|
1155
|
-
}, a.prototype.setWorldOrgY = function(
|
|
1156
|
-
this.lworldOrgY =
|
|
1155
|
+
}, a.prototype.setWorldOrgY = function(i) {
|
|
1156
|
+
this.lworldOrgY = i;
|
|
1157
1157
|
}, a.prototype.getWorldExtX = function() {
|
|
1158
1158
|
return this.lworldExtX;
|
|
1159
|
-
}, a.prototype.setWorldExtX = function(
|
|
1160
|
-
this.lworldExtX =
|
|
1159
|
+
}, a.prototype.setWorldExtX = function(i) {
|
|
1160
|
+
this.lworldExtX = i;
|
|
1161
1161
|
}, a.prototype.getWorldExtY = function() {
|
|
1162
1162
|
return this.lworldExtY;
|
|
1163
|
-
}, a.prototype.setWorldExtY = function(
|
|
1164
|
-
this.lworldExtY =
|
|
1163
|
+
}, a.prototype.setWorldExtY = function(i) {
|
|
1164
|
+
this.lworldExtY = i;
|
|
1165
1165
|
}, a.prototype.getDeviceOrgX = function() {
|
|
1166
1166
|
return this.ldeviceOrgX;
|
|
1167
|
-
}, a.prototype.setDeviceOrgX = function(
|
|
1168
|
-
this.ldeviceOrgX =
|
|
1167
|
+
}, a.prototype.setDeviceOrgX = function(i) {
|
|
1168
|
+
this.ldeviceOrgX = i;
|
|
1169
1169
|
}, a.prototype.getDeviceOrgY = function() {
|
|
1170
1170
|
return this.ldeviceOrgY;
|
|
1171
|
-
}, a.prototype.setDeviceOrgY = function(
|
|
1172
|
-
this.ldeviceOrgY =
|
|
1171
|
+
}, a.prototype.setDeviceOrgY = function(i) {
|
|
1172
|
+
this.ldeviceOrgY = i;
|
|
1173
1173
|
}, a.prototype.getDeviceExtX = function() {
|
|
1174
1174
|
return this.ldeviceExtX;
|
|
1175
|
-
}, a.prototype.setDeviceExtX = function(
|
|
1176
|
-
this.ldeviceExtX =
|
|
1175
|
+
}, a.prototype.setDeviceExtX = function(i) {
|
|
1176
|
+
this.ldeviceExtX = i;
|
|
1177
1177
|
}, a.prototype.getDeviceExtY = function() {
|
|
1178
1178
|
return this.ldeviceExtY;
|
|
1179
|
-
}, a.prototype.setDeviceExtY = function(
|
|
1180
|
-
this.ldeviceExtY =
|
|
1181
|
-
}, a.prototype.transformX = function(
|
|
1182
|
-
var
|
|
1183
|
-
return e != 0 && (
|
|
1184
|
-
}, a.prototype.transformY = function(
|
|
1185
|
-
var
|
|
1186
|
-
return e != 0 && (
|
|
1187
|
-
}, a.prototype.inverseTransformX = function(
|
|
1188
|
-
var
|
|
1189
|
-
return e != 0 && (
|
|
1190
|
-
}, a.prototype.inverseTransformY = function(
|
|
1191
|
-
var
|
|
1192
|
-
return e != 0 && (
|
|
1193
|
-
}, a.prototype.inverseTransformPoint = function(
|
|
1194
|
-
var
|
|
1195
|
-
return
|
|
1179
|
+
}, a.prototype.setDeviceExtY = function(i) {
|
|
1180
|
+
this.ldeviceExtY = i;
|
|
1181
|
+
}, a.prototype.transformX = function(i) {
|
|
1182
|
+
var r = 0, e = this.lworldExtX;
|
|
1183
|
+
return e != 0 && (r = this.ldeviceOrgX + (i - this.lworldOrgX) * this.ldeviceExtX / e), r;
|
|
1184
|
+
}, a.prototype.transformY = function(i) {
|
|
1185
|
+
var r = 0, e = this.lworldExtY;
|
|
1186
|
+
return e != 0 && (r = this.ldeviceOrgY + (i - this.lworldOrgY) * this.ldeviceExtY / e), r;
|
|
1187
|
+
}, a.prototype.inverseTransformX = function(i) {
|
|
1188
|
+
var r = 0, e = this.ldeviceExtX;
|
|
1189
|
+
return e != 0 && (r = this.lworldOrgX + (i - this.ldeviceOrgX) * this.lworldExtX / e), r;
|
|
1190
|
+
}, a.prototype.inverseTransformY = function(i) {
|
|
1191
|
+
var r = 0, e = this.ldeviceExtY;
|
|
1192
|
+
return e != 0 && (r = this.lworldOrgY + (i - this.ldeviceOrgY) * this.lworldExtY / e), r;
|
|
1193
|
+
}, a.prototype.inverseTransformPoint = function(i) {
|
|
1194
|
+
var r = new g(this.inverseTransformX(i.x), this.inverseTransformY(i.y));
|
|
1195
|
+
return r;
|
|
1196
1196
|
}, _.exports = a;
|
|
1197
1197
|
},
|
|
1198
1198
|
/* 18 */
|
|
@@ -1206,28 +1206,28 @@ function ci() {
|
|
|
1206
1206
|
} else
|
|
1207
1207
|
return Array.from(t);
|
|
1208
1208
|
}
|
|
1209
|
-
var a = T(15),
|
|
1209
|
+
var a = T(15), i = T(4), r = T(0), e = T(8), l = T(9);
|
|
1210
1210
|
function n() {
|
|
1211
|
-
a.call(this), this.useSmartIdealEdgeLengthCalculation =
|
|
1211
|
+
a.call(this), this.useSmartIdealEdgeLengthCalculation = i.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.gravityConstant = i.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = i.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = i.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = i.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.displacementThresholdPerNode = 3 * i.DEFAULT_EDGE_LENGTH / 100, this.coolingFactor = i.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.initialCoolingFactor = i.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.totalDisplacement = 0, this.oldTotalDisplacement = 0, this.maxIterations = i.MAX_ITERATIONS;
|
|
1212
1212
|
}
|
|
1213
1213
|
n.prototype = Object.create(a.prototype);
|
|
1214
1214
|
for (var v in a)
|
|
1215
1215
|
n[v] = a[v];
|
|
1216
1216
|
n.prototype.initParameters = function() {
|
|
1217
|
-
a.prototype.initParameters.call(this, arguments), this.totalIterations = 0, this.notAnimatedIterations = 0, this.useFRGridVariant =
|
|
1217
|
+
a.prototype.initParameters.call(this, arguments), this.totalIterations = 0, this.notAnimatedIterations = 0, this.useFRGridVariant = i.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION, this.grid = [];
|
|
1218
1218
|
}, n.prototype.calcIdealEdgeLengths = function() {
|
|
1219
1219
|
for (var t, s, h, u, c, N, d, y = this.getGraphManager().getAllEdges(), I = 0; I < y.length; I++)
|
|
1220
|
-
t = y[I], s = t.idealLength, t.isInterGraph && (u = t.getSource(), c = t.getTarget(), N = t.getSourceInLca().getEstimatedSize(), d = t.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (t.idealLength += N + d - 2 *
|
|
1220
|
+
t = y[I], s = t.idealLength, t.isInterGraph && (u = t.getSource(), c = t.getTarget(), N = t.getSourceInLca().getEstimatedSize(), d = t.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (t.idealLength += N + d - 2 * r.SIMPLE_NODE_SIZE), h = t.getLca().getInclusionTreeDepth(), t.idealLength += s * i.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (u.getInclusionTreeDepth() + c.getInclusionTreeDepth() - 2 * h));
|
|
1221
1221
|
}, n.prototype.initSpringEmbedder = function() {
|
|
1222
1222
|
var t = this.getAllNodes().length;
|
|
1223
|
-
this.incremental ? (t >
|
|
1223
|
+
this.incremental ? (t > i.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * i.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (t - i.ADAPTATION_LOWER_NODE_LIMIT) / (i.ADAPTATION_UPPER_NODE_LIMIT - i.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - i.COOLING_ADAPTATION_FACTOR))), this.maxNodeDisplacement = i.MAX_NODE_DISPLACEMENT_INCREMENTAL) : (t > i.ADAPTATION_LOWER_NODE_LIMIT ? this.coolingFactor = Math.max(i.COOLING_ADAPTATION_FACTOR, 1 - (t - i.ADAPTATION_LOWER_NODE_LIMIT) / (i.ADAPTATION_UPPER_NODE_LIMIT - i.ADAPTATION_LOWER_NODE_LIMIT) * (1 - i.COOLING_ADAPTATION_FACTOR)) : this.coolingFactor = 1, this.initialCoolingFactor = this.coolingFactor, this.maxNodeDisplacement = i.MAX_NODE_DISPLACEMENT), this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations), this.displacementThresholdPerNode = 3 * i.DEFAULT_EDGE_LENGTH / 100, this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length, this.repulsionRange = this.calcRepulsionRange();
|
|
1224
1224
|
}, n.prototype.calcSpringForces = function() {
|
|
1225
1225
|
for (var t = this.getAllEdges(), s, h = 0; h < t.length; h++)
|
|
1226
1226
|
s = t[h], this.calcSpringForce(s, s.idealLength);
|
|
1227
1227
|
}, n.prototype.calcRepulsionForces = function() {
|
|
1228
1228
|
var t = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, s = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, h, u, c, N, d = this.getAllNodes(), y;
|
|
1229
1229
|
if (this.useFRGridVariant)
|
|
1230
|
-
for (this.totalIterations %
|
|
1230
|
+
for (this.totalIterations % i.GRID_CALCULATION_CHECK_PERIOD == 1 && t && this.updateGrid(), y = /* @__PURE__ */ new Set(), h = 0; h < d.length; h++)
|
|
1231
1231
|
c = d[h], this.calculateRepulsionForceOfANode(c, y, t, s), y.add(c);
|
|
1232
1232
|
else
|
|
1233
1233
|
for (h = 0; h < d.length; h++)
|
|
@@ -1249,11 +1249,11 @@ function ci() {
|
|
|
1249
1249
|
}, n.prototype.calcRepulsionForce = function(t, s) {
|
|
1250
1250
|
var h = t.getRect(), u = s.getRect(), c = new Array(2), N = new Array(4), d, y, I, w, Y, F, H;
|
|
1251
1251
|
if (h.intersects(u)) {
|
|
1252
|
-
e.calcSeparationAmount(h, u, c,
|
|
1252
|
+
e.calcSeparationAmount(h, u, c, i.DEFAULT_EDGE_LENGTH / 2), F = 2 * c[0], H = 2 * c[1];
|
|
1253
1253
|
var z = t.noOfChildren * s.noOfChildren / (t.noOfChildren + s.noOfChildren);
|
|
1254
1254
|
t.repulsionForceX -= z * F, t.repulsionForceY -= z * H, s.repulsionForceX += z * F, s.repulsionForceY += z * H;
|
|
1255
1255
|
} else
|
|
1256
|
-
this.uniformLeafNodeSizes && t.getChild() == null && s.getChild() == null ? (d = u.getCenterX() - h.getCenterX(), y = u.getCenterY() - h.getCenterY()) : (e.getIntersection(h, u, N), d = N[2] - N[0], y = N[3] - N[1]), Math.abs(d) <
|
|
1256
|
+
this.uniformLeafNodeSizes && t.getChild() == null && s.getChild() == null ? (d = u.getCenterX() - h.getCenterX(), y = u.getCenterY() - h.getCenterY()) : (e.getIntersection(h, u, N), d = N[2] - N[0], y = N[3] - N[1]), Math.abs(d) < i.MIN_REPULSION_DIST && (d = l.sign(d) * i.MIN_REPULSION_DIST), Math.abs(y) < i.MIN_REPULSION_DIST && (y = l.sign(y) * i.MIN_REPULSION_DIST), I = d * d + y * y, w = Math.sqrt(I), Y = (t.nodeRepulsion / 2 + s.nodeRepulsion / 2) * t.noOfChildren * s.noOfChildren / I, F = Y * d / w, H = Y * y / w, t.repulsionForceX -= F, t.repulsionForceY -= H, s.repulsionForceX += F, s.repulsionForceY += H;
|
|
1257
1257
|
}, n.prototype.calcGravitationalForce = function(t) {
|
|
1258
1258
|
var s, h, u, c, N, d, y, I;
|
|
1259
1259
|
s = t.getOwner(), h = (s.getRight() + s.getLeft()) / 2, u = (s.getTop() + s.getBottom()) / 2, c = t.getCenterX() - h, N = t.getCenterY() - u, d = Math.abs(c) + t.getWidth() / 2, y = Math.abs(N) + t.getHeight() / 2, t.getOwner() == this.graphManager.getRoot() ? (I = s.getEstimatedSize() * this.gravityRangeFactor, (d > I || y > I) && (t.gravitationForceX = -this.gravityConstant * c, t.gravitationForceY = -this.gravityConstant * N)) : (I = s.getEstimatedSize() * this.compoundGravityRangeFactor, (d > I || y > I) && (t.gravitationForceX = -this.gravityConstant * c * this.compoundGravityConstant, t.gravitationForceY = -this.gravityConstant * N * this.compoundGravityConstant));
|
|
@@ -1285,7 +1285,7 @@ function ci() {
|
|
|
1285
1285
|
for (this.grid = this.calcGrid(this.graphManager.getRoot()), t = 0; t < h.length; t++)
|
|
1286
1286
|
s = h[t], this.addNodeToGrid(s, this.graphManager.getRoot().getLeft(), this.graphManager.getRoot().getTop());
|
|
1287
1287
|
}, n.prototype.calculateRepulsionForceOfANode = function(t, s, h, u) {
|
|
1288
|
-
if (this.totalIterations %
|
|
1288
|
+
if (this.totalIterations % i.GRID_CALCULATION_CHECK_PERIOD == 1 && h || u) {
|
|
1289
1289
|
var c = /* @__PURE__ */ new Set();
|
|
1290
1290
|
t.surrounding = new Array();
|
|
1291
1291
|
for (var N, d = this.grid, y = t.startX - 1; y < t.finishX + 2; y++)
|
|
@@ -1309,33 +1309,33 @@ function ci() {
|
|
|
1309
1309
|
/***/
|
|
1310
1310
|
function(_, k, T) {
|
|
1311
1311
|
var g = T(1), a = T(4);
|
|
1312
|
-
function
|
|
1312
|
+
function i(e, l, n) {
|
|
1313
1313
|
g.call(this, e, l, n), this.idealLength = a.DEFAULT_EDGE_LENGTH, this.edgeElasticity = a.DEFAULT_SPRING_STRENGTH;
|
|
1314
1314
|
}
|
|
1315
|
-
|
|
1316
|
-
for (var
|
|
1317
|
-
r
|
|
1318
|
-
_.exports =
|
|
1315
|
+
i.prototype = Object.create(g.prototype);
|
|
1316
|
+
for (var r in g)
|
|
1317
|
+
i[r] = g[r];
|
|
1318
|
+
_.exports = i;
|
|
1319
1319
|
},
|
|
1320
1320
|
/* 20 */
|
|
1321
1321
|
/***/
|
|
1322
1322
|
function(_, k, T) {
|
|
1323
1323
|
var g = T(3), a = T(4);
|
|
1324
|
-
function
|
|
1324
|
+
function i(e, l, n, v) {
|
|
1325
1325
|
g.call(this, e, l, n, v), this.nodeRepulsion = a.DEFAULT_REPULSION_STRENGTH, 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 = [];
|
|
1326
1326
|
}
|
|
1327
|
-
|
|
1328
|
-
for (var
|
|
1329
|
-
r
|
|
1330
|
-
|
|
1327
|
+
i.prototype = Object.create(g.prototype);
|
|
1328
|
+
for (var r in g)
|
|
1329
|
+
i[r] = g[r];
|
|
1330
|
+
i.prototype.setGridCoordinates = function(e, l, n, v) {
|
|
1331
1331
|
this.startX = e, this.finishX = l, this.startY = n, this.finishY = v;
|
|
1332
|
-
}, _.exports =
|
|
1332
|
+
}, _.exports = i;
|
|
1333
1333
|
},
|
|
1334
1334
|
/* 21 */
|
|
1335
1335
|
/***/
|
|
1336
1336
|
function(_, k, T) {
|
|
1337
|
-
function g(a,
|
|
1338
|
-
this.width = 0, this.height = 0, a !== null &&
|
|
1337
|
+
function g(a, i) {
|
|
1338
|
+
this.width = 0, this.height = 0, a !== null && i !== null && (this.height = i, this.width = a);
|
|
1339
1339
|
}
|
|
1340
1340
|
g.prototype.getWidth = function() {
|
|
1341
1341
|
return this.width;
|
|
@@ -1354,14 +1354,14 @@ function ci() {
|
|
|
1354
1354
|
function a() {
|
|
1355
1355
|
this.map = {}, this.keys = [];
|
|
1356
1356
|
}
|
|
1357
|
-
a.prototype.put = function(
|
|
1358
|
-
var e = g.createID(
|
|
1359
|
-
this.contains(e) || (this.map[e] =
|
|
1360
|
-
}, a.prototype.contains = function(
|
|
1361
|
-
return g.createID(
|
|
1362
|
-
}, a.prototype.get = function(
|
|
1363
|
-
var
|
|
1364
|
-
return this.map[
|
|
1357
|
+
a.prototype.put = function(i, r) {
|
|
1358
|
+
var e = g.createID(i);
|
|
1359
|
+
this.contains(e) || (this.map[e] = r, this.keys.push(i));
|
|
1360
|
+
}, a.prototype.contains = function(i) {
|
|
1361
|
+
return g.createID(i), this.map[i] != null;
|
|
1362
|
+
}, a.prototype.get = function(i) {
|
|
1363
|
+
var r = g.createID(i);
|
|
1364
|
+
return this.map[r];
|
|
1365
1365
|
}, a.prototype.keySet = function() {
|
|
1366
1366
|
return this.keys;
|
|
1367
1367
|
}, _.exports = a;
|
|
@@ -1373,27 +1373,27 @@ function ci() {
|
|
|
1373
1373
|
function a() {
|
|
1374
1374
|
this.set = {};
|
|
1375
1375
|
}
|
|
1376
|
-
a.prototype.add = function(
|
|
1377
|
-
var
|
|
1378
|
-
this.contains(
|
|
1379
|
-
}, a.prototype.remove = function(
|
|
1380
|
-
delete this.set[g.createID(
|
|
1376
|
+
a.prototype.add = function(i) {
|
|
1377
|
+
var r = g.createID(i);
|
|
1378
|
+
this.contains(r) || (this.set[r] = i);
|
|
1379
|
+
}, a.prototype.remove = function(i) {
|
|
1380
|
+
delete this.set[g.createID(i)];
|
|
1381
1381
|
}, a.prototype.clear = function() {
|
|
1382
1382
|
this.set = {};
|
|
1383
|
-
}, a.prototype.contains = function(
|
|
1384
|
-
return this.set[g.createID(
|
|
1383
|
+
}, a.prototype.contains = function(i) {
|
|
1384
|
+
return this.set[g.createID(i)] == i;
|
|
1385
1385
|
}, a.prototype.isEmpty = function() {
|
|
1386
1386
|
return this.size() === 0;
|
|
1387
1387
|
}, a.prototype.size = function() {
|
|
1388
1388
|
return Object.keys(this.set).length;
|
|
1389
|
-
}, a.prototype.addAllTo = function(
|
|
1390
|
-
for (var
|
|
1391
|
-
|
|
1389
|
+
}, a.prototype.addAllTo = function(i) {
|
|
1390
|
+
for (var r = Object.keys(this.set), e = r.length, l = 0; l < e; l++)
|
|
1391
|
+
i.push(this.set[r[l]]);
|
|
1392
1392
|
}, a.prototype.size = function() {
|
|
1393
1393
|
return Object.keys(this.set).length;
|
|
1394
|
-
}, a.prototype.addAll = function(
|
|
1395
|
-
for (var
|
|
1396
|
-
var l =
|
|
1394
|
+
}, a.prototype.addAll = function(i) {
|
|
1395
|
+
for (var r = i.length, e = 0; e < r; e++) {
|
|
1396
|
+
var l = i[e];
|
|
1397
1397
|
this.add(l);
|
|
1398
1398
|
}
|
|
1399
1399
|
}, _.exports = a;
|
|
@@ -1403,62 +1403,62 @@ function ci() {
|
|
|
1403
1403
|
function(_, k, T) {
|
|
1404
1404
|
function g() {
|
|
1405
1405
|
}
|
|
1406
|
-
g.multMat = function(a,
|
|
1407
|
-
for (var
|
|
1408
|
-
|
|
1409
|
-
for (var l = 0; l <
|
|
1410
|
-
|
|
1406
|
+
g.multMat = function(a, i) {
|
|
1407
|
+
for (var r = [], e = 0; e < a.length; e++) {
|
|
1408
|
+
r[e] = [];
|
|
1409
|
+
for (var l = 0; l < i[0].length; l++) {
|
|
1410
|
+
r[e][l] = 0;
|
|
1411
1411
|
for (var n = 0; n < a[0].length; n++)
|
|
1412
|
-
|
|
1412
|
+
r[e][l] += a[e][n] * i[n][l];
|
|
1413
1413
|
}
|
|
1414
1414
|
}
|
|
1415
|
-
return
|
|
1415
|
+
return r;
|
|
1416
1416
|
}, g.transpose = function(a) {
|
|
1417
|
-
for (var
|
|
1418
|
-
r
|
|
1417
|
+
for (var i = [], r = 0; r < a[0].length; r++) {
|
|
1418
|
+
i[r] = [];
|
|
1419
1419
|
for (var e = 0; e < a.length; e++)
|
|
1420
|
-
r
|
|
1420
|
+
i[r][e] = a[e][r];
|
|
1421
1421
|
}
|
|
1422
|
-
return r;
|
|
1423
|
-
}, g.multCons = function(a, r) {
|
|
1424
|
-
for (var i = [], e = 0; e < a.length; e++)
|
|
1425
|
-
i[e] = a[e] * r;
|
|
1426
|
-
return i;
|
|
1427
|
-
}, g.minusOp = function(a, r) {
|
|
1428
|
-
for (var i = [], e = 0; e < a.length; e++)
|
|
1429
|
-
i[e] = a[e] - r[e];
|
|
1430
|
-
return i;
|
|
1431
|
-
}, g.dotProduct = function(a, r) {
|
|
1432
|
-
for (var i = 0, e = 0; e < a.length; e++)
|
|
1433
|
-
i += a[e] * r[e];
|
|
1434
1422
|
return i;
|
|
1423
|
+
}, g.multCons = function(a, i) {
|
|
1424
|
+
for (var r = [], e = 0; e < a.length; e++)
|
|
1425
|
+
r[e] = a[e] * i;
|
|
1426
|
+
return r;
|
|
1427
|
+
}, g.minusOp = function(a, i) {
|
|
1428
|
+
for (var r = [], e = 0; e < a.length; e++)
|
|
1429
|
+
r[e] = a[e] - i[e];
|
|
1430
|
+
return r;
|
|
1431
|
+
}, g.dotProduct = function(a, i) {
|
|
1432
|
+
for (var r = 0, e = 0; e < a.length; e++)
|
|
1433
|
+
r += a[e] * i[e];
|
|
1434
|
+
return r;
|
|
1435
1435
|
}, g.mag = function(a) {
|
|
1436
1436
|
return Math.sqrt(this.dotProduct(a, a));
|
|
1437
1437
|
}, g.normalize = function(a) {
|
|
1438
|
-
for (var
|
|
1439
|
-
|
|
1440
|
-
return
|
|
1438
|
+
for (var i = [], r = this.mag(a), e = 0; e < a.length; e++)
|
|
1439
|
+
i[e] = a[e] / r;
|
|
1440
|
+
return i;
|
|
1441
1441
|
}, g.multGamma = function(a) {
|
|
1442
|
-
for (var
|
|
1443
|
-
|
|
1444
|
-
|
|
1442
|
+
for (var i = [], r = 0, e = 0; e < a.length; e++)
|
|
1443
|
+
r += a[e];
|
|
1444
|
+
r *= -1 / a.length;
|
|
1445
1445
|
for (var l = 0; l < a.length; l++)
|
|
1446
|
-
|
|
1447
|
-
return
|
|
1448
|
-
}, g.multL = function(a,
|
|
1449
|
-
for (var e = [], l = [], n = [], v = 0; v <
|
|
1450
|
-
for (var t = 0, s = 0; s <
|
|
1451
|
-
t += -0.5 *
|
|
1446
|
+
i[l] = r + a[l];
|
|
1447
|
+
return i;
|
|
1448
|
+
}, g.multL = function(a, i, r) {
|
|
1449
|
+
for (var e = [], l = [], n = [], v = 0; v < i[0].length; v++) {
|
|
1450
|
+
for (var t = 0, s = 0; s < i.length; s++)
|
|
1451
|
+
t += -0.5 * i[s][v] * a[s];
|
|
1452
1452
|
l[v] = t;
|
|
1453
1453
|
}
|
|
1454
|
-
for (var h = 0; h <
|
|
1455
|
-
for (var u = 0, c = 0; c <
|
|
1456
|
-
u +=
|
|
1454
|
+
for (var h = 0; h < r.length; h++) {
|
|
1455
|
+
for (var u = 0, c = 0; c < r.length; c++)
|
|
1456
|
+
u += r[h][c] * l[c];
|
|
1457
1457
|
n[h] = u;
|
|
1458
1458
|
}
|
|
1459
|
-
for (var N = 0; N <
|
|
1460
|
-
for (var d = 0, y = 0; y <
|
|
1461
|
-
d +=
|
|
1459
|
+
for (var N = 0; N < i.length; N++) {
|
|
1460
|
+
for (var d = 0, y = 0; y < i[0].length; y++)
|
|
1461
|
+
d += i[N][y] * n[y];
|
|
1462
1462
|
e[N] = d;
|
|
1463
1463
|
}
|
|
1464
1464
|
return e;
|
|
@@ -1482,11 +1482,11 @@ function ci() {
|
|
|
1482
1482
|
if (!(e instanceof l))
|
|
1483
1483
|
throw new TypeError("Cannot call a class as a function");
|
|
1484
1484
|
}
|
|
1485
|
-
var
|
|
1485
|
+
var i = T(11), r = function() {
|
|
1486
1486
|
function e(l, n) {
|
|
1487
1487
|
a(this, e), (n !== null || n !== void 0) && (this.compareFunction = this._defaultCompareFunction);
|
|
1488
1488
|
var v = void 0;
|
|
1489
|
-
l instanceof
|
|
1489
|
+
l instanceof i ? v = l.size() : v = l.length, this._quicksort(l, 0, v - 1);
|
|
1490
1490
|
}
|
|
1491
1491
|
return g(e, [{
|
|
1492
1492
|
key: "_quicksort",
|
|
@@ -1512,12 +1512,12 @@ function ci() {
|
|
|
1512
1512
|
}, {
|
|
1513
1513
|
key: "_get",
|
|
1514
1514
|
value: function(l, n) {
|
|
1515
|
-
return l instanceof
|
|
1515
|
+
return l instanceof i ? l.get_object_at(n) : l[n];
|
|
1516
1516
|
}
|
|
1517
1517
|
}, {
|
|
1518
1518
|
key: "_set",
|
|
1519
1519
|
value: function(l, n, v) {
|
|
1520
|
-
l instanceof
|
|
1520
|
+
l instanceof i ? l.set_object_at(n, v) : l[n] = v;
|
|
1521
1521
|
}
|
|
1522
1522
|
}, {
|
|
1523
1523
|
key: "_swap",
|
|
@@ -1532,7 +1532,7 @@ function ci() {
|
|
|
1532
1532
|
}
|
|
1533
1533
|
}]), e;
|
|
1534
1534
|
}();
|
|
1535
|
-
_.exports =
|
|
1535
|
+
_.exports = r;
|
|
1536
1536
|
},
|
|
1537
1537
|
/* 26 */
|
|
1538
1538
|
/***/
|
|
@@ -1541,7 +1541,7 @@ function ci() {
|
|
|
1541
1541
|
}
|
|
1542
1542
|
g.svd = function(a) {
|
|
1543
1543
|
this.U = null, this.V = null, this.s = null, this.m = 0, this.n = 0, this.m = a.length, this.n = a[0].length;
|
|
1544
|
-
var
|
|
1544
|
+
var i = Math.min(this.m, this.n);
|
|
1545
1545
|
this.s = function(Mt) {
|
|
1546
1546
|
for (var At = []; Mt-- > 0; )
|
|
1547
1547
|
At.push(0);
|
|
@@ -1555,7 +1555,7 @@ function ci() {
|
|
|
1555
1555
|
return Rt;
|
|
1556
1556
|
};
|
|
1557
1557
|
return At(Mt);
|
|
1558
|
-
}([this.m,
|
|
1558
|
+
}([this.m, i]), this.V = function(Mt) {
|
|
1559
1559
|
var At = function Ut(Ht) {
|
|
1560
1560
|
if (Ht.length == 0)
|
|
1561
1561
|
return 0;
|
|
@@ -1565,7 +1565,7 @@ function ci() {
|
|
|
1565
1565
|
};
|
|
1566
1566
|
return At(Mt);
|
|
1567
1567
|
}([this.n, this.n]);
|
|
1568
|
-
for (var
|
|
1568
|
+
for (var r = function(Mt) {
|
|
1569
1569
|
for (var At = []; Mt-- > 0; )
|
|
1570
1570
|
At.push(0);
|
|
1571
1571
|
return At;
|
|
@@ -1596,7 +1596,7 @@ function ci() {
|
|
|
1596
1596
|
for (var d = t; d < this.m; d++)
|
|
1597
1597
|
a[d][u] += c * a[d][t];
|
|
1598
1598
|
}
|
|
1599
|
-
|
|
1599
|
+
r[u] = a[t][u];
|
|
1600
1600
|
}
|
|
1601
1601
|
if (/* @__PURE__ */ function(Mt, At) {
|
|
1602
1602
|
return At;
|
|
@@ -1604,64 +1604,64 @@ function ci() {
|
|
|
1604
1604
|
for (var y = t; y < this.m; y++)
|
|
1605
1605
|
this.U[y][t] = a[y][t];
|
|
1606
1606
|
if (t < v) {
|
|
1607
|
-
|
|
1607
|
+
r[t] = 0;
|
|
1608
1608
|
for (var I = t + 1; I < this.n; I++)
|
|
1609
|
-
|
|
1610
|
-
if (
|
|
1611
|
-
|
|
1609
|
+
r[t] = g.hypot(r[t], r[I]);
|
|
1610
|
+
if (r[t] !== 0) {
|
|
1611
|
+
r[t + 1] < 0 && (r[t] = -r[t]);
|
|
1612
1612
|
for (var w = t + 1; w < this.n; w++)
|
|
1613
|
-
|
|
1614
|
-
|
|
1613
|
+
r[w] /= r[t];
|
|
1614
|
+
r[t + 1] += 1;
|
|
1615
1615
|
}
|
|
1616
|
-
if (
|
|
1616
|
+
if (r[t] = -r[t], /* @__PURE__ */ function(Mt, At) {
|
|
1617
1617
|
return Mt && At;
|
|
1618
|
-
}(t + 1 < this.m,
|
|
1618
|
+
}(t + 1 < this.m, r[t] !== 0)) {
|
|
1619
1619
|
for (var Y = t + 1; Y < this.m; Y++)
|
|
1620
1620
|
e[Y] = 0;
|
|
1621
1621
|
for (var F = t + 1; F < this.n; F++)
|
|
1622
1622
|
for (var H = t + 1; H < this.m; H++)
|
|
1623
|
-
e[H] +=
|
|
1623
|
+
e[H] += r[F] * a[H][F];
|
|
1624
1624
|
for (var z = t + 1; z < this.n; z++)
|
|
1625
|
-
for (var q = -
|
|
1625
|
+
for (var q = -r[z] / r[t + 1], x = t + 1; x < this.m; x++)
|
|
1626
1626
|
a[x][z] += q * e[x];
|
|
1627
1627
|
}
|
|
1628
|
-
for (var
|
|
1629
|
-
this.V[
|
|
1628
|
+
for (var it = t + 1; it < this.n; it++)
|
|
1629
|
+
this.V[it][t] = r[it];
|
|
1630
1630
|
}
|
|
1631
1631
|
}
|
|
1632
1632
|
var o = Math.min(this.n, this.m + 1);
|
|
1633
|
-
n < this.n && (this.s[n] = a[n][n]), this.m < o && (this.s[o - 1] = 0), v + 1 < o && (
|
|
1633
|
+
n < this.n && (this.s[n] = a[n][n]), this.m < o && (this.s[o - 1] = 0), v + 1 < o && (r[v] = a[v][o - 1]), r[o - 1] = 0;
|
|
1634
1634
|
{
|
|
1635
|
-
for (var E = n; E <
|
|
1636
|
-
for (var
|
|
1637
|
-
this.U[
|
|
1635
|
+
for (var E = n; E < i; E++) {
|
|
1636
|
+
for (var f = 0; f < this.m; f++)
|
|
1637
|
+
this.U[f][E] = 0;
|
|
1638
1638
|
this.U[E][E] = 1;
|
|
1639
1639
|
}
|
|
1640
|
-
for (var
|
|
1641
|
-
if (this.s[
|
|
1642
|
-
for (var m =
|
|
1643
|
-
for (var O = 0, L =
|
|
1644
|
-
O += this.U[L][
|
|
1645
|
-
O = -O / this.U[
|
|
1646
|
-
for (var C =
|
|
1647
|
-
this.U[C][m] += O * this.U[C][
|
|
1640
|
+
for (var p = n - 1; p >= 0; p--)
|
|
1641
|
+
if (this.s[p] !== 0) {
|
|
1642
|
+
for (var m = p + 1; m < i; m++) {
|
|
1643
|
+
for (var O = 0, L = p; L < this.m; L++)
|
|
1644
|
+
O += this.U[L][p] * this.U[L][m];
|
|
1645
|
+
O = -O / this.U[p][p];
|
|
1646
|
+
for (var C = p; C < this.m; C++)
|
|
1647
|
+
this.U[C][m] += O * this.U[C][p];
|
|
1648
1648
|
}
|
|
1649
|
-
for (var P =
|
|
1650
|
-
this.U[P][
|
|
1651
|
-
this.U[
|
|
1652
|
-
for (var S = 0; S <
|
|
1653
|
-
this.U[S][
|
|
1649
|
+
for (var P = p; P < this.m; P++)
|
|
1650
|
+
this.U[P][p] = -this.U[P][p];
|
|
1651
|
+
this.U[p][p] = 1 + this.U[p][p];
|
|
1652
|
+
for (var S = 0; S < p - 1; S++)
|
|
1653
|
+
this.U[S][p] = 0;
|
|
1654
1654
|
} else {
|
|
1655
1655
|
for (var B = 0; B < this.m; B++)
|
|
1656
|
-
this.U[B][
|
|
1657
|
-
this.U[
|
|
1656
|
+
this.U[B][p] = 0;
|
|
1657
|
+
this.U[p][p] = 1;
|
|
1658
1658
|
}
|
|
1659
1659
|
}
|
|
1660
1660
|
for (var V = this.n - 1; V >= 0; V--) {
|
|
1661
1661
|
if (/* @__PURE__ */ function(Mt, At) {
|
|
1662
1662
|
return Mt && At;
|
|
1663
|
-
}(V < v,
|
|
1664
|
-
for (var X = V + 1; X <
|
|
1663
|
+
}(V < v, r[V] !== 0))
|
|
1664
|
+
for (var X = V + 1; X < i; X++) {
|
|
1665
1665
|
for (var Q = 0, G = V + 1; G < this.n; G++)
|
|
1666
1666
|
Q += this.V[G][V] * this.V[G][X];
|
|
1667
1667
|
Q = -Q / this.V[V + 1][V];
|
|
@@ -1675,8 +1675,8 @@ function ci() {
|
|
|
1675
1675
|
for (var j = o - 1, et = Math.pow(2, -52), vt = Math.pow(2, -966); o > 0; ) {
|
|
1676
1676
|
var $ = void 0, Dt = void 0;
|
|
1677
1677
|
for ($ = o - 2; $ >= -1 && $ !== -1; $--)
|
|
1678
|
-
if (Math.abs(
|
|
1679
|
-
|
|
1678
|
+
if (Math.abs(r[$]) <= vt + et * (Math.abs(this.s[$]) + Math.abs(this.s[$ + 1]))) {
|
|
1679
|
+
r[$] = 0;
|
|
1680
1680
|
break;
|
|
1681
1681
|
}
|
|
1682
1682
|
if ($ === o - 2)
|
|
@@ -1684,7 +1684,7 @@ function ci() {
|
|
|
1684
1684
|
else {
|
|
1685
1685
|
var K = void 0;
|
|
1686
1686
|
for (K = o - 1; K >= $ && K !== $; K--) {
|
|
1687
|
-
var nt = (K !== o ? Math.abs(
|
|
1687
|
+
var nt = (K !== o ? Math.abs(r[K]) : 0) + (K !== $ + 1 ? Math.abs(r[K - 1]) : 0);
|
|
1688
1688
|
if (Math.abs(this.s[K]) <= vt + et * nt) {
|
|
1689
1689
|
this.s[K] = 0;
|
|
1690
1690
|
break;
|
|
@@ -1695,11 +1695,11 @@ function ci() {
|
|
|
1695
1695
|
switch ($++, Dt) {
|
|
1696
1696
|
case 1:
|
|
1697
1697
|
{
|
|
1698
|
-
var mt =
|
|
1699
|
-
|
|
1698
|
+
var mt = r[o - 2];
|
|
1699
|
+
r[o - 2] = 0;
|
|
1700
1700
|
for (var ht = o - 2; ht >= $; ht--) {
|
|
1701
1701
|
var _t = g.hypot(this.s[ht], mt), Lt = this.s[ht] / _t, Tt = mt / _t;
|
|
1702
|
-
this.s[ht] = _t, ht !== $ && (mt = -Tt *
|
|
1702
|
+
this.s[ht] = _t, ht !== $ && (mt = -Tt * r[ht - 1], r[ht - 1] = Lt * r[ht - 1]);
|
|
1703
1703
|
for (var wt = 0; wt < this.n; wt++)
|
|
1704
1704
|
_t = Lt * this.V[wt][ht] + Tt * this.V[wt][o - 1], this.V[wt][o - 1] = -Tt * this.V[wt][ht] + Lt * this.V[wt][o - 1], this.V[wt][ht] = _t;
|
|
1705
1705
|
}
|
|
@@ -1707,11 +1707,11 @@ function ci() {
|
|
|
1707
1707
|
break;
|
|
1708
1708
|
case 2:
|
|
1709
1709
|
{
|
|
1710
|
-
var zt =
|
|
1711
|
-
|
|
1710
|
+
var zt = r[$ - 1];
|
|
1711
|
+
r[$ - 1] = 0;
|
|
1712
1712
|
for (var bt = $; bt < o; bt++) {
|
|
1713
1713
|
var Gt = g.hypot(this.s[bt], zt), St = this.s[bt] / Gt, Bt = zt / Gt;
|
|
1714
|
-
this.s[bt] = Gt, zt = -Bt *
|
|
1714
|
+
this.s[bt] = Gt, zt = -Bt * r[bt], r[bt] = St * r[bt];
|
|
1715
1715
|
for (var Ft = 0; Ft < this.m; Ft++)
|
|
1716
1716
|
Gt = St * this.U[Ft][bt] + Bt * this.U[Ft][$ - 1], this.U[Ft][$ - 1] = -Bt * this.U[Ft][bt] + St * this.U[Ft][$ - 1], this.U[Ft][bt] = Gt;
|
|
1717
1717
|
}
|
|
@@ -1719,20 +1719,20 @@ function ci() {
|
|
|
1719
1719
|
break;
|
|
1720
1720
|
case 3:
|
|
1721
1721
|
{
|
|
1722
|
-
var $t = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[o - 1]), Math.abs(this.s[o - 2])), Math.abs(
|
|
1722
|
+
var $t = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[o - 1]), Math.abs(this.s[o - 2])), Math.abs(r[o - 2])), Math.abs(this.s[$])), Math.abs(r[$])), dt = this.s[o - 1] / $t, M = this.s[o - 2] / $t, R = r[o - 2] / $t, W = this.s[$] / $t, J = r[$] / $t, Z = ((M + dt) * (M - dt) + R * R) / 2, pt = dt * R * (dt * R), lt = 0;
|
|
1723
1723
|
/* @__PURE__ */ (function(Mt, At) {
|
|
1724
1724
|
return Mt || At;
|
|
1725
|
-
})(Z !== 0,
|
|
1726
|
-
for (var tt = (W + dt) * (W - dt) + lt, gt = W * J,
|
|
1725
|
+
})(Z !== 0, pt !== 0) && (lt = Math.sqrt(Z * Z + pt), Z < 0 && (lt = -lt), lt = pt / (Z + lt));
|
|
1726
|
+
for (var tt = (W + dt) * (W - dt) + lt, gt = W * J, rt = $; rt < o - 1; rt++) {
|
|
1727
1727
|
var Nt = g.hypot(tt, gt), yt = tt / Nt, Ct = gt / Nt;
|
|
1728
|
-
|
|
1728
|
+
rt !== $ && (r[rt - 1] = Nt), tt = yt * this.s[rt] + Ct * r[rt], r[rt] = yt * r[rt] - Ct * this.s[rt], gt = Ct * this.s[rt + 1], this.s[rt + 1] = yt * this.s[rt + 1];
|
|
1729
1729
|
for (var ct = 0; ct < this.n; ct++)
|
|
1730
|
-
Nt = yt * this.V[ct][
|
|
1731
|
-
if (Nt = g.hypot(tt, gt), yt = tt / Nt, Ct = gt / Nt, this.s[
|
|
1730
|
+
Nt = yt * this.V[ct][rt] + Ct * this.V[ct][rt + 1], this.V[ct][rt + 1] = -Ct * this.V[ct][rt] + yt * this.V[ct][rt + 1], this.V[ct][rt] = Nt;
|
|
1731
|
+
if (Nt = g.hypot(tt, gt), yt = tt / Nt, Ct = gt / Nt, this.s[rt] = Nt, tt = yt * r[rt] + Ct * this.s[rt + 1], this.s[rt + 1] = -Ct * r[rt] + yt * this.s[rt + 1], gt = Ct * r[rt + 1], r[rt + 1] = yt * r[rt + 1], rt < this.m - 1)
|
|
1732
1732
|
for (var at = 0; at < this.m; at++)
|
|
1733
|
-
Nt = yt * this.U[at][
|
|
1733
|
+
Nt = yt * this.U[at][rt] + Ct * this.U[at][rt + 1], this.U[at][rt + 1] = -Ct * this.U[at][rt] + yt * this.U[at][rt + 1], this.U[at][rt] = Nt;
|
|
1734
1734
|
}
|
|
1735
|
-
|
|
1735
|
+
r[o - 2] = tt;
|
|
1736
1736
|
}
|
|
1737
1737
|
break;
|
|
1738
1738
|
case 4:
|
|
@@ -1759,33 +1759,33 @@ function ci() {
|
|
|
1759
1759
|
}
|
|
1760
1760
|
var Yt = { U: this.U, V: this.V, S: this.s };
|
|
1761
1761
|
return Yt;
|
|
1762
|
-
}, g.hypot = function(a,
|
|
1763
|
-
var
|
|
1764
|
-
return Math.abs(a) > Math.abs(
|
|
1762
|
+
}, g.hypot = function(a, i) {
|
|
1763
|
+
var r = void 0;
|
|
1764
|
+
return Math.abs(a) > Math.abs(i) ? (r = i / a, r = Math.abs(a) * Math.sqrt(1 + r * r)) : i != 0 ? (r = a / i, r = Math.abs(i) * Math.sqrt(1 + r * r)) : r = 0, r;
|
|
1765
1765
|
}, _.exports = g;
|
|
1766
1766
|
},
|
|
1767
1767
|
/* 27 */
|
|
1768
1768
|
/***/
|
|
1769
1769
|
function(_, k, T) {
|
|
1770
1770
|
var g = /* @__PURE__ */ function() {
|
|
1771
|
-
function
|
|
1771
|
+
function r(e, l) {
|
|
1772
1772
|
for (var n = 0; n < l.length; n++) {
|
|
1773
1773
|
var v = l[n];
|
|
1774
1774
|
v.enumerable = v.enumerable || !1, v.configurable = !0, "value" in v && (v.writable = !0), Object.defineProperty(e, v.key, v);
|
|
1775
1775
|
}
|
|
1776
1776
|
}
|
|
1777
1777
|
return function(e, l, n) {
|
|
1778
|
-
return l &&
|
|
1778
|
+
return l && r(e.prototype, l), n && r(e, n), e;
|
|
1779
1779
|
};
|
|
1780
1780
|
}();
|
|
1781
|
-
function a(
|
|
1782
|
-
if (!(
|
|
1781
|
+
function a(r, e) {
|
|
1782
|
+
if (!(r instanceof e))
|
|
1783
1783
|
throw new TypeError("Cannot call a class as a function");
|
|
1784
1784
|
}
|
|
1785
|
-
var
|
|
1786
|
-
function
|
|
1785
|
+
var i = function() {
|
|
1786
|
+
function r(e, l) {
|
|
1787
1787
|
var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : 1, v = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : -1, t = arguments.length > 4 && arguments[4] !== void 0 ? arguments[4] : -1;
|
|
1788
|
-
a(this,
|
|
1788
|
+
a(this, r), this.sequence1 = e, this.sequence2 = l, this.match_score = n, this.mismatch_penalty = v, this.gap_penalty = t, this.iMax = e.length + 1, this.jMax = l.length + 1, this.grid = new Array(this.iMax);
|
|
1789
1789
|
for (var s = 0; s < this.iMax; s++) {
|
|
1790
1790
|
this.grid[s] = new Array(this.jMax);
|
|
1791
1791
|
for (var h = 0; h < this.jMax; h++)
|
|
@@ -1799,7 +1799,7 @@ function ci() {
|
|
|
1799
1799
|
}
|
|
1800
1800
|
this.alignments = [], this.score = -1, this.computeGrids();
|
|
1801
1801
|
}
|
|
1802
|
-
return g(
|
|
1802
|
+
return g(r, [{
|
|
1803
1803
|
key: "getScore",
|
|
1804
1804
|
value: function() {
|
|
1805
1805
|
return this.score;
|
|
@@ -1869,9 +1869,9 @@ function ci() {
|
|
|
1869
1869
|
value: function(e) {
|
|
1870
1870
|
return this.getAllIndexes(e, Math.max.apply(null, e));
|
|
1871
1871
|
}
|
|
1872
|
-
}]),
|
|
1872
|
+
}]), r;
|
|
1873
1873
|
}();
|
|
1874
|
-
_.exports =
|
|
1874
|
+
_.exports = i;
|
|
1875
1875
|
},
|
|
1876
1876
|
/* 28 */
|
|
1877
1877
|
/***/
|
|
@@ -1887,20 +1887,20 @@ function ci() {
|
|
|
1887
1887
|
this.listeners = [];
|
|
1888
1888
|
}
|
|
1889
1889
|
var a = g.prototype;
|
|
1890
|
-
a.addListener = function(
|
|
1890
|
+
a.addListener = function(i, r) {
|
|
1891
1891
|
this.listeners.push({
|
|
1892
|
-
event:
|
|
1893
|
-
callback:
|
|
1892
|
+
event: i,
|
|
1893
|
+
callback: r
|
|
1894
1894
|
});
|
|
1895
|
-
}, a.removeListener = function(
|
|
1895
|
+
}, a.removeListener = function(i, r) {
|
|
1896
1896
|
for (var e = this.listeners.length; e >= 0; e--) {
|
|
1897
1897
|
var l = this.listeners[e];
|
|
1898
|
-
l.event ===
|
|
1898
|
+
l.event === i && l.callback === r && this.listeners.splice(e, 1);
|
|
1899
1899
|
}
|
|
1900
|
-
}, a.emit = function(
|
|
1900
|
+
}, a.emit = function(i, r) {
|
|
1901
1901
|
for (var e = 0; e < this.listeners.length; e++) {
|
|
1902
1902
|
var l = this.listeners[e];
|
|
1903
|
-
|
|
1903
|
+
i === l.event && l.callback(r);
|
|
1904
1904
|
}
|
|
1905
1905
|
}, _.exports = g;
|
|
1906
1906
|
}
|
|
@@ -1910,12 +1910,12 @@ function ci() {
|
|
|
1910
1910
|
});
|
|
1911
1911
|
}(me)), me.exports;
|
|
1912
1912
|
}
|
|
1913
|
-
var
|
|
1914
|
-
function
|
|
1913
|
+
var dr = ve.exports, Le;
|
|
1914
|
+
function gr() {
|
|
1915
1915
|
return Le || (Le = 1, function(A, U) {
|
|
1916
1916
|
(function(_, k) {
|
|
1917
|
-
A.exports = k(
|
|
1918
|
-
})(
|
|
1917
|
+
A.exports = k(cr());
|
|
1918
|
+
})(dr, function(_) {
|
|
1919
1919
|
return (
|
|
1920
1920
|
/******/
|
|
1921
1921
|
(() => {
|
|
@@ -1923,27 +1923,27 @@ function gi() {
|
|
|
1923
1923
|
/***/
|
|
1924
1924
|
45: (
|
|
1925
1925
|
/***/
|
|
1926
|
-
(
|
|
1926
|
+
(i, r, e) => {
|
|
1927
1927
|
var l = {};
|
|
1928
|
-
l.layoutBase = e(551), l.CoSEConstants = e(806), l.CoSEEdge = e(767), l.CoSEGraph = e(880), l.CoSEGraphManager = e(578), l.CoSELayout = e(765), l.CoSENode = e(991), l.ConstraintHandler = e(902),
|
|
1928
|
+
l.layoutBase = e(551), l.CoSEConstants = e(806), l.CoSEEdge = e(767), l.CoSEGraph = e(880), l.CoSEGraphManager = e(578), l.CoSELayout = e(765), l.CoSENode = e(991), l.ConstraintHandler = e(902), i.exports = l;
|
|
1929
1929
|
}
|
|
1930
1930
|
),
|
|
1931
1931
|
/***/
|
|
1932
1932
|
806: (
|
|
1933
1933
|
/***/
|
|
1934
|
-
(
|
|
1934
|
+
(i, r, e) => {
|
|
1935
1935
|
var l = e(551).FDLayoutConstants;
|
|
1936
1936
|
function n() {
|
|
1937
1937
|
}
|
|
1938
1938
|
for (var v in l)
|
|
1939
1939
|
n[v] = l[v];
|
|
1940
|
-
n.DEFAULT_USE_MULTI_LEVEL_SCALING = !1, n.DEFAULT_RADIAL_SEPARATION = l.DEFAULT_EDGE_LENGTH, n.DEFAULT_COMPONENT_SEPERATION = 60, n.TILE = !0, n.TILING_PADDING_VERTICAL = 10, n.TILING_PADDING_HORIZONTAL = 10, n.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, n.ENFORCE_CONSTRAINTS = !0, n.APPLY_LAYOUT = !0, n.RELAX_MOVEMENT_ON_CONSTRAINTS = !0, n.TREE_REDUCTION_ON_INCREMENTAL = !0, n.PURE_INCREMENTAL = n.DEFAULT_INCREMENTAL,
|
|
1940
|
+
n.DEFAULT_USE_MULTI_LEVEL_SCALING = !1, n.DEFAULT_RADIAL_SEPARATION = l.DEFAULT_EDGE_LENGTH, n.DEFAULT_COMPONENT_SEPERATION = 60, n.TILE = !0, n.TILING_PADDING_VERTICAL = 10, n.TILING_PADDING_HORIZONTAL = 10, n.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, n.ENFORCE_CONSTRAINTS = !0, n.APPLY_LAYOUT = !0, n.RELAX_MOVEMENT_ON_CONSTRAINTS = !0, n.TREE_REDUCTION_ON_INCREMENTAL = !0, n.PURE_INCREMENTAL = n.DEFAULT_INCREMENTAL, i.exports = n;
|
|
1941
1941
|
}
|
|
1942
1942
|
),
|
|
1943
1943
|
/***/
|
|
1944
1944
|
767: (
|
|
1945
1945
|
/***/
|
|
1946
|
-
(
|
|
1946
|
+
(i, r, e) => {
|
|
1947
1947
|
var l = e(551).FDLayoutEdge;
|
|
1948
1948
|
function n(t, s, h) {
|
|
1949
1949
|
l.call(this, t, s, h);
|
|
@@ -1951,13 +1951,13 @@ function gi() {
|
|
|
1951
1951
|
n.prototype = Object.create(l.prototype);
|
|
1952
1952
|
for (var v in l)
|
|
1953
1953
|
n[v] = l[v];
|
|
1954
|
-
|
|
1954
|
+
i.exports = n;
|
|
1955
1955
|
}
|
|
1956
1956
|
),
|
|
1957
1957
|
/***/
|
|
1958
1958
|
880: (
|
|
1959
1959
|
/***/
|
|
1960
|
-
(
|
|
1960
|
+
(i, r, e) => {
|
|
1961
1961
|
var l = e(551).LGraph;
|
|
1962
1962
|
function n(t, s, h) {
|
|
1963
1963
|
l.call(this, t, s, h);
|
|
@@ -1965,13 +1965,13 @@ function gi() {
|
|
|
1965
1965
|
n.prototype = Object.create(l.prototype);
|
|
1966
1966
|
for (var v in l)
|
|
1967
1967
|
n[v] = l[v];
|
|
1968
|
-
|
|
1968
|
+
i.exports = n;
|
|
1969
1969
|
}
|
|
1970
1970
|
),
|
|
1971
1971
|
/***/
|
|
1972
1972
|
578: (
|
|
1973
1973
|
/***/
|
|
1974
|
-
(
|
|
1974
|
+
(i, r, e) => {
|
|
1975
1975
|
var l = e(551).LGraphManager;
|
|
1976
1976
|
function n(t) {
|
|
1977
1977
|
l.call(this, t);
|
|
@@ -1979,20 +1979,20 @@ function gi() {
|
|
|
1979
1979
|
n.prototype = Object.create(l.prototype);
|
|
1980
1980
|
for (var v in l)
|
|
1981
1981
|
n[v] = l[v];
|
|
1982
|
-
|
|
1982
|
+
i.exports = n;
|
|
1983
1983
|
}
|
|
1984
1984
|
),
|
|
1985
1985
|
/***/
|
|
1986
1986
|
765: (
|
|
1987
1987
|
/***/
|
|
1988
|
-
(
|
|
1988
|
+
(i, r, e) => {
|
|
1989
1989
|
var l = e(551).FDLayout, n = e(578), v = e(880), t = e(991), s = e(767), h = e(806), u = e(902), c = e(551).FDLayoutConstants, N = e(551).LayoutConstants, d = e(551).Point, y = e(551).PointD, I = e(551).DimensionD, w = e(551).Layout, Y = e(551).Integer, F = e(551).IGeometry, H = e(551).LGraph, z = e(551).Transform, q = e(551).LinkedList;
|
|
1990
1990
|
function x() {
|
|
1991
1991
|
l.call(this), this.toBeTiled = {}, this.constraints = {};
|
|
1992
1992
|
}
|
|
1993
1993
|
x.prototype = Object.create(l.prototype);
|
|
1994
|
-
for (var
|
|
1995
|
-
x[
|
|
1994
|
+
for (var it in l)
|
|
1995
|
+
x[it] = l[it];
|
|
1996
1996
|
x.prototype.newGraphManager = function() {
|
|
1997
1997
|
var o = new n(this);
|
|
1998
1998
|
return this.graphManager = o, o;
|
|
@@ -2013,15 +2013,15 @@ function gi() {
|
|
|
2013
2013
|
if (this.nodesWithGravity = this.calculateNodesToApplyGravitationTo(), this.graphManager.setAllNodesToApplyGravitation(this.nodesWithGravity), this.calcNoOfChildrenForAllNodes(), this.graphManager.calcLowestCommonAncestors(), this.graphManager.calcInclusionTreeDepths(), this.graphManager.getRoot().calcEstimatedSize(), this.calcIdealEdgeLengths(), this.incremental) {
|
|
2014
2014
|
if (h.TREE_REDUCTION_ON_INCREMENTAL) {
|
|
2015
2015
|
this.reduceTrees(), this.graphManager.resetAllNodesToApplyGravitation();
|
|
2016
|
-
var o = new Set(this.getAllNodes()), E = this.nodesWithGravity.filter(function(
|
|
2017
|
-
return o.has(
|
|
2016
|
+
var o = new Set(this.getAllNodes()), E = this.nodesWithGravity.filter(function(p) {
|
|
2017
|
+
return o.has(p);
|
|
2018
2018
|
});
|
|
2019
2019
|
this.graphManager.setAllNodesToApplyGravitation(E);
|
|
2020
2020
|
}
|
|
2021
2021
|
} else {
|
|
2022
|
-
var
|
|
2023
|
-
if (
|
|
2024
|
-
this.positionNodesRadially(
|
|
2022
|
+
var f = this.getFlatForest();
|
|
2023
|
+
if (f.length > 0)
|
|
2024
|
+
this.positionNodesRadially(f);
|
|
2025
2025
|
else {
|
|
2026
2026
|
this.reduceTrees(), this.graphManager.resetAllNodesToApplyGravitation();
|
|
2027
2027
|
var o = new Set(this.getAllNodes()), E = this.nodesWithGravity.filter(function(O) {
|
|
@@ -2062,17 +2062,17 @@ function gi() {
|
|
|
2062
2062
|
return !0;
|
|
2063
2063
|
this.afterGrowthIterations % 10 == 0 && (this.graphManager.updateBounds(), this.updateGrid()), h.PURE_INCREMENTAL ? this.coolingFactor = c.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 * ((100 - this.afterGrowthIterations) / 100) : this.coolingFactor = c.DEFAULT_COOLING_FACTOR_INCREMENTAL * ((100 - this.afterGrowthIterations) / 100), this.afterGrowthIterations++;
|
|
2064
2064
|
}
|
|
2065
|
-
var
|
|
2066
|
-
return this.totalDisplacement = 0, this.graphManager.updateBounds(), this.calcSpringForces(), this.calcRepulsionForces(
|
|
2065
|
+
var f = !this.isTreeGrowing && !this.isGrowthFinished, p = this.growTreeIterations % 10 == 1 && this.isTreeGrowing || this.afterGrowthIterations % 10 == 1 && this.isGrowthFinished;
|
|
2066
|
+
return this.totalDisplacement = 0, this.graphManager.updateBounds(), this.calcSpringForces(), this.calcRepulsionForces(f, p), this.calcGravitationalForces(), this.moveNodes(), this.animate(), !1;
|
|
2067
2067
|
}, x.prototype.getPositionsData = function() {
|
|
2068
|
-
for (var o = this.graphManager.getAllNodes(), E = {},
|
|
2069
|
-
var
|
|
2068
|
+
for (var o = this.graphManager.getAllNodes(), E = {}, f = 0; f < o.length; f++) {
|
|
2069
|
+
var p = o[f].rect, m = o[f].id;
|
|
2070
2070
|
E[m] = {
|
|
2071
2071
|
id: m,
|
|
2072
|
-
x:
|
|
2073
|
-
y:
|
|
2074
|
-
w:
|
|
2075
|
-
h:
|
|
2072
|
+
x: p.getCenterX(),
|
|
2073
|
+
y: p.getCenterY(),
|
|
2074
|
+
w: p.width,
|
|
2075
|
+
h: p.height
|
|
2076
2076
|
};
|
|
2077
2077
|
}
|
|
2078
2078
|
return E;
|
|
@@ -2087,17 +2087,17 @@ function gi() {
|
|
|
2087
2087
|
this.graphManager.updateBounds();
|
|
2088
2088
|
}
|
|
2089
2089
|
}, x.prototype.moveNodes = function() {
|
|
2090
|
-
for (var o = this.getAllNodes(), E,
|
|
2091
|
-
E = o[
|
|
2090
|
+
for (var o = this.getAllNodes(), E, f = 0; f < o.length; f++)
|
|
2091
|
+
E = o[f], E.calculateDisplacement();
|
|
2092
2092
|
Object.keys(this.constraints).length > 0 && this.updateDisplacements();
|
|
2093
|
-
for (var
|
|
2094
|
-
E = o[
|
|
2093
|
+
for (var f = 0; f < o.length; f++)
|
|
2094
|
+
E = o[f], E.move();
|
|
2095
2095
|
}, x.prototype.initConstraintVariables = function() {
|
|
2096
2096
|
var o = this;
|
|
2097
2097
|
this.idToNodeMap = /* @__PURE__ */ new Map(), this.fixedNodeSet = /* @__PURE__ */ new Set();
|
|
2098
|
-
for (var E = this.graphManager.getAllNodes(),
|
|
2099
|
-
var
|
|
2100
|
-
this.idToNodeMap.set(
|
|
2098
|
+
for (var E = this.graphManager.getAllNodes(), f = 0; f < E.length; f++) {
|
|
2099
|
+
var p = E[f];
|
|
2100
|
+
this.idToNodeMap.set(p.id, p);
|
|
2101
2101
|
}
|
|
2102
2102
|
var m = function D(b) {
|
|
2103
2103
|
for (var j = b.getChild().getNodes(), et, vt = 0, $ = 0; $ < j.length; $++)
|
|
@@ -2108,10 +2108,10 @@ function gi() {
|
|
|
2108
2108
|
this.constraints.fixedNodeConstraint.forEach(function(D) {
|
|
2109
2109
|
o.fixedNodeSet.add(D.nodeId);
|
|
2110
2110
|
});
|
|
2111
|
-
for (var E = this.graphManager.getAllNodes(),
|
|
2112
|
-
if (
|
|
2113
|
-
var O = m(
|
|
2114
|
-
O > 0 && (
|
|
2111
|
+
for (var E = this.graphManager.getAllNodes(), p, f = 0; f < E.length; f++)
|
|
2112
|
+
if (p = E[f], p.getChild() != null) {
|
|
2113
|
+
var O = m(p);
|
|
2114
|
+
O > 0 && (p.fixedNodeWeight = O);
|
|
2115
2115
|
}
|
|
2116
2116
|
}
|
|
2117
2117
|
if (this.constraints.relativePlacementConstraint) {
|
|
@@ -2120,14 +2120,14 @@ function gi() {
|
|
|
2120
2120
|
o.fixedNodesOnHorizontal.add(D), o.fixedNodesOnVertical.add(D);
|
|
2121
2121
|
}), this.constraints.alignmentConstraint) {
|
|
2122
2122
|
if (this.constraints.alignmentConstraint.vertical)
|
|
2123
|
-
for (var P = this.constraints.alignmentConstraint.vertical,
|
|
2124
|
-
this.dummyToNodeForVerticalAlignment.set("dummy" +
|
|
2125
|
-
L.set(b, "dummy" +
|
|
2123
|
+
for (var P = this.constraints.alignmentConstraint.vertical, f = 0; f < P.length; f++)
|
|
2124
|
+
this.dummyToNodeForVerticalAlignment.set("dummy" + f, []), P[f].forEach(function(b) {
|
|
2125
|
+
L.set(b, "dummy" + f), o.dummyToNodeForVerticalAlignment.get("dummy" + f).push(b), o.fixedNodeSet.has(b) && o.fixedNodesOnHorizontal.add("dummy" + f);
|
|
2126
2126
|
});
|
|
2127
2127
|
if (this.constraints.alignmentConstraint.horizontal)
|
|
2128
|
-
for (var S = this.constraints.alignmentConstraint.horizontal,
|
|
2129
|
-
this.dummyToNodeForHorizontalAlignment.set("dummy" +
|
|
2130
|
-
C.set(b, "dummy" +
|
|
2128
|
+
for (var S = this.constraints.alignmentConstraint.horizontal, f = 0; f < S.length; f++)
|
|
2129
|
+
this.dummyToNodeForHorizontalAlignment.set("dummy" + f, []), S[f].forEach(function(b) {
|
|
2130
|
+
C.set(b, "dummy" + f), o.dummyToNodeForHorizontalAlignment.get("dummy" + f).push(b), o.fixedNodeSet.has(b) && o.fixedNodesOnVertical.add("dummy" + f);
|
|
2131
2131
|
});
|
|
2132
2132
|
}
|
|
2133
2133
|
if (h.RELAX_MOVEMENT_ON_CONSTRAINTS)
|
|
@@ -2185,28 +2185,28 @@ function gi() {
|
|
|
2185
2185
|
D.displacementX = 0, D.displacementY = 0;
|
|
2186
2186
|
}), this.constraints.alignmentConstraint) {
|
|
2187
2187
|
if (this.constraints.alignmentConstraint.vertical)
|
|
2188
|
-
for (var E = this.constraints.alignmentConstraint.vertical,
|
|
2189
|
-
for (var
|
|
2190
|
-
if (this.fixedNodeSet.has(E[
|
|
2191
|
-
|
|
2188
|
+
for (var E = this.constraints.alignmentConstraint.vertical, f = 0; f < E.length; f++) {
|
|
2189
|
+
for (var p = 0, m = 0; m < E[f].length; m++) {
|
|
2190
|
+
if (this.fixedNodeSet.has(E[f][m])) {
|
|
2191
|
+
p = 0;
|
|
2192
2192
|
break;
|
|
2193
2193
|
}
|
|
2194
|
-
|
|
2194
|
+
p += this.idToNodeMap.get(E[f][m]).displacementX;
|
|
2195
2195
|
}
|
|
2196
|
-
for (var O =
|
|
2197
|
-
this.idToNodeMap.get(E[
|
|
2196
|
+
for (var O = p / E[f].length, m = 0; m < E[f].length; m++)
|
|
2197
|
+
this.idToNodeMap.get(E[f][m]).displacementX = O;
|
|
2198
2198
|
}
|
|
2199
2199
|
if (this.constraints.alignmentConstraint.horizontal)
|
|
2200
|
-
for (var L = this.constraints.alignmentConstraint.horizontal,
|
|
2201
|
-
for (var C = 0, m = 0; m < L[
|
|
2202
|
-
if (this.fixedNodeSet.has(L[
|
|
2200
|
+
for (var L = this.constraints.alignmentConstraint.horizontal, f = 0; f < L.length; f++) {
|
|
2201
|
+
for (var C = 0, m = 0; m < L[f].length; m++) {
|
|
2202
|
+
if (this.fixedNodeSet.has(L[f][m])) {
|
|
2203
2203
|
C = 0;
|
|
2204
2204
|
break;
|
|
2205
2205
|
}
|
|
2206
|
-
C += this.idToNodeMap.get(L[
|
|
2206
|
+
C += this.idToNodeMap.get(L[f][m]).displacementY;
|
|
2207
2207
|
}
|
|
2208
|
-
for (var P = C / L[
|
|
2209
|
-
this.idToNodeMap.get(L[
|
|
2208
|
+
for (var P = C / L[f].length, m = 0; m < L[f].length; m++)
|
|
2209
|
+
this.idToNodeMap.get(L[f][m]).displacementY = P;
|
|
2210
2210
|
}
|
|
2211
2211
|
}
|
|
2212
2212
|
if (this.constraints.relativePlacementConstraint)
|
|
@@ -2243,9 +2243,9 @@ function gi() {
|
|
|
2243
2243
|
}
|
|
2244
2244
|
});
|
|
2245
2245
|
else {
|
|
2246
|
-
for (var
|
|
2247
|
-
var S = this.componentsOnHorizontal[
|
|
2248
|
-
if (this.fixedComponentsOnHorizontal[
|
|
2246
|
+
for (var f = 0; f < this.componentsOnHorizontal.length; f++) {
|
|
2247
|
+
var S = this.componentsOnHorizontal[f];
|
|
2248
|
+
if (this.fixedComponentsOnHorizontal[f])
|
|
2249
2249
|
for (var m = 0; m < S.length; m++)
|
|
2250
2250
|
this.dummyToNodeForVerticalAlignment.has(S[m]) ? this.dummyToNodeForVerticalAlignment.get(S[m]).forEach(function(b) {
|
|
2251
2251
|
o.idToNodeMap.get(b).displacementX = 0;
|
|
@@ -2263,9 +2263,9 @@ function gi() {
|
|
|
2263
2263
|
}) : this.idToNodeMap.get(S[m]).displacementX = Q;
|
|
2264
2264
|
}
|
|
2265
2265
|
}
|
|
2266
|
-
for (var
|
|
2267
|
-
var S = this.componentsOnVertical[
|
|
2268
|
-
if (this.fixedComponentsOnVertical[
|
|
2266
|
+
for (var f = 0; f < this.componentsOnVertical.length; f++) {
|
|
2267
|
+
var S = this.componentsOnVertical[f];
|
|
2268
|
+
if (this.fixedComponentsOnVertical[f])
|
|
2269
2269
|
for (var m = 0; m < S.length; m++)
|
|
2270
2270
|
this.dummyToNodeForHorizontalAlignment.has(S[m]) ? this.dummyToNodeForHorizontalAlignment.get(S[m]).forEach(function(j) {
|
|
2271
2271
|
o.idToNodeMap.get(j).displacementY = 0;
|
|
@@ -2285,20 +2285,20 @@ function gi() {
|
|
|
2285
2285
|
}
|
|
2286
2286
|
}
|
|
2287
2287
|
}, x.prototype.calculateNodesToApplyGravitationTo = function() {
|
|
2288
|
-
var o = [], E,
|
|
2289
|
-
for (m = 0; m <
|
|
2290
|
-
E =
|
|
2288
|
+
var o = [], E, f = this.graphManager.getGraphs(), p = f.length, m;
|
|
2289
|
+
for (m = 0; m < p; m++)
|
|
2290
|
+
E = f[m], E.updateConnected(), E.isConnected || (o = o.concat(E.getNodes()));
|
|
2291
2291
|
return o;
|
|
2292
2292
|
}, x.prototype.createBendpoints = function() {
|
|
2293
2293
|
var o = [];
|
|
2294
2294
|
o = o.concat(this.graphManager.getAllEdges());
|
|
2295
|
-
var E = /* @__PURE__ */ new Set(),
|
|
2296
|
-
for (
|
|
2297
|
-
var
|
|
2298
|
-
if (!E.has(
|
|
2299
|
-
var m =
|
|
2295
|
+
var E = /* @__PURE__ */ new Set(), f;
|
|
2296
|
+
for (f = 0; f < o.length; f++) {
|
|
2297
|
+
var p = o[f];
|
|
2298
|
+
if (!E.has(p)) {
|
|
2299
|
+
var m = p.getSource(), O = p.getTarget();
|
|
2300
2300
|
if (m == O)
|
|
2301
|
-
|
|
2301
|
+
p.getBendpoints().push(new y()), p.getBendpoints().push(new y()), this.createDummyNodesForBendpoints(p), E.add(p);
|
|
2302
2302
|
else {
|
|
2303
2303
|
var L = [];
|
|
2304
2304
|
if (L = L.concat(m.getEdgeListToNode(O)), L = L.concat(O.getEdgeListToNode(m)), !E.has(L[0])) {
|
|
@@ -2319,27 +2319,27 @@ function gi() {
|
|
|
2319
2319
|
break;
|
|
2320
2320
|
}
|
|
2321
2321
|
}, x.prototype.positionNodesRadially = function(o) {
|
|
2322
|
-
for (var E = new d(0, 0),
|
|
2323
|
-
C %
|
|
2322
|
+
for (var E = new d(0, 0), f = Math.ceil(Math.sqrt(o.length)), p = 0, m = 0, O = 0, L = new y(0, 0), C = 0; C < o.length; C++) {
|
|
2323
|
+
C % f == 0 && (O = 0, m = p, C != 0 && (m += h.DEFAULT_COMPONENT_SEPERATION), p = 0);
|
|
2324
2324
|
var P = o[C], S = w.findCenterOfTree(P);
|
|
2325
|
-
E.x = O, E.y = m, L = x.radialLayout(P, S, E), L.y >
|
|
2325
|
+
E.x = O, E.y = m, L = x.radialLayout(P, S, E), L.y > p && (p = Math.floor(L.y)), O = Math.floor(L.x + h.DEFAULT_COMPONENT_SEPERATION);
|
|
2326
2326
|
}
|
|
2327
2327
|
this.transform(new y(N.WORLD_CENTER_X - L.x / 2, N.WORLD_CENTER_Y - L.y / 2));
|
|
2328
|
-
}, x.radialLayout = function(o, E,
|
|
2329
|
-
var
|
|
2330
|
-
x.branchRadialLayout(E, null, 0, 359, 0,
|
|
2328
|
+
}, x.radialLayout = function(o, E, f) {
|
|
2329
|
+
var p = Math.max(this.maxDiagonalInTree(o), h.DEFAULT_RADIAL_SEPARATION);
|
|
2330
|
+
x.branchRadialLayout(E, null, 0, 359, 0, p);
|
|
2331
2331
|
var m = H.calculateBounds(o), O = new z();
|
|
2332
|
-
O.setDeviceOrgX(m.getMinX()), O.setDeviceOrgY(m.getMinY()), O.setWorldOrgX(
|
|
2332
|
+
O.setDeviceOrgX(m.getMinX()), O.setDeviceOrgY(m.getMinY()), O.setWorldOrgX(f.x), O.setWorldOrgY(f.y);
|
|
2333
2333
|
for (var L = 0; L < o.length; L++) {
|
|
2334
2334
|
var C = o[L];
|
|
2335
2335
|
C.transform(O);
|
|
2336
2336
|
}
|
|
2337
2337
|
var P = new y(m.getMaxX(), m.getMaxY());
|
|
2338
2338
|
return O.inverseTransformPoint(P);
|
|
2339
|
-
}, x.branchRadialLayout = function(o, E,
|
|
2340
|
-
var L = (
|
|
2339
|
+
}, x.branchRadialLayout = function(o, E, f, p, m, O) {
|
|
2340
|
+
var L = (p - f + 1) / 2;
|
|
2341
2341
|
L < 0 && (L += 180);
|
|
2342
|
-
var C = (L +
|
|
2342
|
+
var C = (L + f) % 360, P = C * F.TWO_PI / 360, S = m * Math.cos(P), B = m * Math.sin(P);
|
|
2343
2343
|
o.setCenter(S, B);
|
|
2344
2344
|
var V = [];
|
|
2345
2345
|
V = V.concat(o.getEdges());
|
|
@@ -2352,16 +2352,16 @@ function gi() {
|
|
|
2352
2352
|
et >= 0 && V.splice(et, 1), G--, X--;
|
|
2353
2353
|
}
|
|
2354
2354
|
E != null ? D = (V.indexOf(b[0]) + 1) % G : D = 0;
|
|
2355
|
-
for (var vt = Math.abs(
|
|
2355
|
+
for (var vt = Math.abs(p - f) / X, $ = D; Q != X; $ = ++$ % G) {
|
|
2356
2356
|
var Dt = V[$].getOtherEnd(o);
|
|
2357
2357
|
if (Dt != E) {
|
|
2358
|
-
var K = (
|
|
2358
|
+
var K = (f + Q * vt) % 360, nt = (K + vt) % 360;
|
|
2359
2359
|
x.branchRadialLayout(Dt, o, K, nt, m + O, O), Q++;
|
|
2360
2360
|
}
|
|
2361
2361
|
}
|
|
2362
2362
|
}, x.maxDiagonalInTree = function(o) {
|
|
2363
|
-
for (var E = Y.MIN_VALUE,
|
|
2364
|
-
var
|
|
2363
|
+
for (var E = Y.MIN_VALUE, f = 0; f < o.length; f++) {
|
|
2364
|
+
var p = o[f], m = p.getDiagonal();
|
|
2365
2365
|
m > E && (E = m);
|
|
2366
2366
|
}
|
|
2367
2367
|
return E;
|
|
@@ -2370,12 +2370,12 @@ function gi() {
|
|
|
2370
2370
|
}, x.prototype.groupZeroDegreeMembers = function() {
|
|
2371
2371
|
var o = this, E = {};
|
|
2372
2372
|
this.memberGroups = {}, this.idToDummyNode = {};
|
|
2373
|
-
for (var
|
|
2374
|
-
var O =
|
|
2375
|
-
this.getNodeDegreeWithChildren(O) === 0 && (L.id == null || !this.getToBeTiled(L)) &&
|
|
2373
|
+
for (var f = [], p = this.graphManager.getAllNodes(), m = 0; m < p.length; m++) {
|
|
2374
|
+
var O = p[m], L = O.getParent();
|
|
2375
|
+
this.getNodeDegreeWithChildren(O) === 0 && (L.id == null || !this.getToBeTiled(L)) && f.push(O);
|
|
2376
2376
|
}
|
|
2377
|
-
for (var m = 0; m <
|
|
2378
|
-
var O =
|
|
2377
|
+
for (var m = 0; m < f.length; m++) {
|
|
2378
|
+
var O = f[m], C = O.getParent().id;
|
|
2379
2379
|
typeof E[C] > "u" && (E[C] = []), E[C] = E[C].concat(O);
|
|
2380
2380
|
}
|
|
2381
2381
|
Object.keys(E).forEach(function(P) {
|
|
@@ -2395,38 +2395,38 @@ function gi() {
|
|
|
2395
2395
|
}, x.prototype.clearCompounds = function() {
|
|
2396
2396
|
var o = {}, E = {};
|
|
2397
2397
|
this.performDFSOnCompounds();
|
|
2398
|
-
for (var
|
|
2399
|
-
E[this.compoundOrder[
|
|
2398
|
+
for (var f = 0; f < this.compoundOrder.length; f++)
|
|
2399
|
+
E[this.compoundOrder[f].id] = this.compoundOrder[f], o[this.compoundOrder[f].id] = [].concat(this.compoundOrder[f].getChild().getNodes()), this.graphManager.remove(this.compoundOrder[f].getChild()), this.compoundOrder[f].child = null;
|
|
2400
2400
|
this.graphManager.resetAllNodes(), this.tileCompoundMembers(o, E);
|
|
2401
2401
|
}, x.prototype.clearZeroDegreeMembers = function() {
|
|
2402
2402
|
var o = this, E = this.tiledZeroDegreePack = [];
|
|
2403
|
-
Object.keys(this.memberGroups).forEach(function(
|
|
2404
|
-
var
|
|
2405
|
-
if (E[
|
|
2406
|
-
var m =
|
|
2407
|
-
|
|
2403
|
+
Object.keys(this.memberGroups).forEach(function(f) {
|
|
2404
|
+
var p = o.idToDummyNode[f];
|
|
2405
|
+
if (E[f] = o.tileNodes(o.memberGroups[f], p.paddingLeft + p.paddingRight), p.rect.width = E[f].width, p.rect.height = E[f].height, p.setCenter(E[f].centerX, E[f].centerY), p.labelMarginLeft = 0, p.labelMarginTop = 0, h.NODE_DIMENSIONS_INCLUDE_LABELS) {
|
|
2406
|
+
var m = p.rect.width, O = p.rect.height;
|
|
2407
|
+
p.labelWidth && (p.labelPosHorizontal == "left" ? (p.rect.x -= p.labelWidth, p.setWidth(m + p.labelWidth), p.labelMarginLeft = p.labelWidth) : p.labelPosHorizontal == "center" && p.labelWidth > m ? (p.rect.x -= (p.labelWidth - m) / 2, p.setWidth(p.labelWidth), p.labelMarginLeft = (p.labelWidth - m) / 2) : p.labelPosHorizontal == "right" && p.setWidth(m + p.labelWidth)), p.labelHeight && (p.labelPosVertical == "top" ? (p.rect.y -= p.labelHeight, p.setHeight(O + p.labelHeight), p.labelMarginTop = p.labelHeight) : p.labelPosVertical == "center" && p.labelHeight > O ? (p.rect.y -= (p.labelHeight - O) / 2, p.setHeight(p.labelHeight), p.labelMarginTop = (p.labelHeight - O) / 2) : p.labelPosVertical == "bottom" && p.setHeight(O + p.labelHeight));
|
|
2408
2408
|
}
|
|
2409
2409
|
});
|
|
2410
2410
|
}, x.prototype.repopulateCompounds = function() {
|
|
2411
2411
|
for (var o = this.compoundOrder.length - 1; o >= 0; o--) {
|
|
2412
|
-
var E = this.compoundOrder[o],
|
|
2413
|
-
this.adjustLocations(this.tiledMemberPack[
|
|
2412
|
+
var E = this.compoundOrder[o], f = E.id, p = E.paddingLeft, m = E.paddingTop, O = E.labelMarginLeft, L = E.labelMarginTop;
|
|
2413
|
+
this.adjustLocations(this.tiledMemberPack[f], E.rect.x, E.rect.y, p, m, O, L);
|
|
2414
2414
|
}
|
|
2415
2415
|
}, x.prototype.repopulateZeroDegreeMembers = function() {
|
|
2416
2416
|
var o = this, E = this.tiledZeroDegreePack;
|
|
2417
|
-
Object.keys(E).forEach(function(
|
|
2418
|
-
var
|
|
2419
|
-
o.adjustLocations(E[
|
|
2417
|
+
Object.keys(E).forEach(function(f) {
|
|
2418
|
+
var p = o.idToDummyNode[f], m = p.paddingLeft, O = p.paddingTop, L = p.labelMarginLeft, C = p.labelMarginTop;
|
|
2419
|
+
o.adjustLocations(E[f], p.rect.x, p.rect.y, m, O, L, C);
|
|
2420
2420
|
});
|
|
2421
2421
|
}, x.prototype.getToBeTiled = function(o) {
|
|
2422
2422
|
var E = o.id;
|
|
2423
2423
|
if (this.toBeTiled[E] != null)
|
|
2424
2424
|
return this.toBeTiled[E];
|
|
2425
|
-
var
|
|
2426
|
-
if (
|
|
2425
|
+
var f = o.getChild();
|
|
2426
|
+
if (f == null)
|
|
2427
2427
|
return this.toBeTiled[E] = !1, !1;
|
|
2428
|
-
for (var
|
|
2429
|
-
var O =
|
|
2428
|
+
for (var p = f.getNodes(), m = 0; m < p.length; m++) {
|
|
2429
|
+
var O = p[m];
|
|
2430
2430
|
if (this.getNodeDegree(O) > 0)
|
|
2431
2431
|
return this.toBeTiled[E] = !1, !1;
|
|
2432
2432
|
if (O.getChild() == null) {
|
|
@@ -2439,17 +2439,17 @@ function gi() {
|
|
|
2439
2439
|
return this.toBeTiled[E] = !0, !0;
|
|
2440
2440
|
}, x.prototype.getNodeDegree = function(o) {
|
|
2441
2441
|
o.id;
|
|
2442
|
-
for (var E = o.getEdges(),
|
|
2443
|
-
var m = E[
|
|
2444
|
-
m.getSource().id !== m.getTarget().id && (
|
|
2442
|
+
for (var E = o.getEdges(), f = 0, p = 0; p < E.length; p++) {
|
|
2443
|
+
var m = E[p];
|
|
2444
|
+
m.getSource().id !== m.getTarget().id && (f = f + 1);
|
|
2445
2445
|
}
|
|
2446
|
-
return
|
|
2446
|
+
return f;
|
|
2447
2447
|
}, x.prototype.getNodeDegreeWithChildren = function(o) {
|
|
2448
2448
|
var E = this.getNodeDegree(o);
|
|
2449
2449
|
if (o.getChild() == null)
|
|
2450
2450
|
return E;
|
|
2451
|
-
for (var
|
|
2452
|
-
var m = p
|
|
2451
|
+
for (var f = o.getChild().getNodes(), p = 0; p < f.length; p++) {
|
|
2452
|
+
var m = f[p];
|
|
2453
2453
|
E += this.getNodeDegreeWithChildren(m);
|
|
2454
2454
|
}
|
|
2455
2455
|
return E;
|
|
@@ -2457,58 +2457,58 @@ function gi() {
|
|
|
2457
2457
|
this.compoundOrder = [], this.fillCompexOrderByDFS(this.graphManager.getRoot().getNodes());
|
|
2458
2458
|
}, x.prototype.fillCompexOrderByDFS = function(o) {
|
|
2459
2459
|
for (var E = 0; E < o.length; E++) {
|
|
2460
|
-
var
|
|
2461
|
-
|
|
2460
|
+
var f = o[E];
|
|
2461
|
+
f.getChild() != null && this.fillCompexOrderByDFS(f.getChild().getNodes()), this.getToBeTiled(f) && this.compoundOrder.push(f);
|
|
2462
2462
|
}
|
|
2463
|
-
}, x.prototype.adjustLocations = function(o, E,
|
|
2464
|
-
E +=
|
|
2463
|
+
}, x.prototype.adjustLocations = function(o, E, f, p, m, O, L) {
|
|
2464
|
+
E += p + O, f += m + L;
|
|
2465
2465
|
for (var C = E, P = 0; P < o.rows.length; P++) {
|
|
2466
2466
|
var S = o.rows[P];
|
|
2467
2467
|
E = C;
|
|
2468
2468
|
for (var B = 0, V = 0; V < S.length; V++) {
|
|
2469
2469
|
var X = S[V];
|
|
2470
|
-
X.rect.x = E, X.rect.y =
|
|
2470
|
+
X.rect.x = E, X.rect.y = f, E += X.rect.width + o.horizontalPadding, X.rect.height > B && (B = X.rect.height);
|
|
2471
2471
|
}
|
|
2472
|
-
|
|
2472
|
+
f += B + o.verticalPadding;
|
|
2473
2473
|
}
|
|
2474
2474
|
}, x.prototype.tileCompoundMembers = function(o, E) {
|
|
2475
|
-
var
|
|
2476
|
-
this.tiledMemberPack = [], Object.keys(o).forEach(function(
|
|
2477
|
-
var m = E[
|
|
2478
|
-
if (
|
|
2475
|
+
var f = this;
|
|
2476
|
+
this.tiledMemberPack = [], Object.keys(o).forEach(function(p) {
|
|
2477
|
+
var m = E[p];
|
|
2478
|
+
if (f.tiledMemberPack[p] = f.tileNodes(o[p], m.paddingLeft + m.paddingRight), m.rect.width = f.tiledMemberPack[p].width, m.rect.height = f.tiledMemberPack[p].height, m.setCenter(f.tiledMemberPack[p].centerX, f.tiledMemberPack[p].centerY), m.labelMarginLeft = 0, m.labelMarginTop = 0, h.NODE_DIMENSIONS_INCLUDE_LABELS) {
|
|
2479
2479
|
var O = m.rect.width, L = m.rect.height;
|
|
2480
2480
|
m.labelWidth && (m.labelPosHorizontal == "left" ? (m.rect.x -= m.labelWidth, m.setWidth(O + m.labelWidth), m.labelMarginLeft = m.labelWidth) : m.labelPosHorizontal == "center" && m.labelWidth > O ? (m.rect.x -= (m.labelWidth - O) / 2, m.setWidth(m.labelWidth), m.labelMarginLeft = (m.labelWidth - O) / 2) : m.labelPosHorizontal == "right" && m.setWidth(O + m.labelWidth)), m.labelHeight && (m.labelPosVertical == "top" ? (m.rect.y -= m.labelHeight, m.setHeight(L + m.labelHeight), m.labelMarginTop = m.labelHeight) : m.labelPosVertical == "center" && m.labelHeight > L ? (m.rect.y -= (m.labelHeight - L) / 2, m.setHeight(m.labelHeight), m.labelMarginTop = (m.labelHeight - L) / 2) : m.labelPosVertical == "bottom" && m.setHeight(L + m.labelHeight));
|
|
2481
2481
|
}
|
|
2482
2482
|
});
|
|
2483
2483
|
}, x.prototype.tileNodes = function(o, E) {
|
|
2484
|
-
var
|
|
2485
|
-
return O < m ? L =
|
|
2484
|
+
var f = this.tileNodesByFavoringDim(o, E, !0), p = this.tileNodesByFavoringDim(o, E, !1), m = this.getOrgRatio(f), O = this.getOrgRatio(p), L;
|
|
2485
|
+
return O < m ? L = p : L = f, L;
|
|
2486
2486
|
}, x.prototype.getOrgRatio = function(o) {
|
|
2487
|
-
var E = o.width,
|
|
2488
|
-
return
|
|
2487
|
+
var E = o.width, f = o.height, p = E / f;
|
|
2488
|
+
return p < 1 && (p = 1 / p), p;
|
|
2489
2489
|
}, x.prototype.calcIdealRowWidth = function(o, E) {
|
|
2490
|
-
var
|
|
2490
|
+
var f = h.TILING_PADDING_VERTICAL, p = h.TILING_PADDING_HORIZONTAL, m = o.length, O = 0, L = 0, C = 0;
|
|
2491
2491
|
o.forEach(function(G) {
|
|
2492
2492
|
O += G.getWidth(), L += G.getHeight(), G.getWidth() > C && (C = G.getWidth());
|
|
2493
2493
|
});
|
|
2494
|
-
var P = O / m, S = L / m, B = Math.pow(
|
|
2494
|
+
var P = O / m, S = L / m, B = Math.pow(f - p, 2) + 4 * (P + p) * (S + f) * m, V = (p - f + Math.sqrt(B)) / (2 * (P + p)), X;
|
|
2495
2495
|
E ? (X = Math.ceil(V), X == V && X++) : X = Math.floor(V);
|
|
2496
|
-
var Q = X * (P +
|
|
2497
|
-
return C > Q && (Q = C), Q +=
|
|
2498
|
-
}, x.prototype.tileNodesByFavoringDim = function(o, E,
|
|
2499
|
-
var
|
|
2496
|
+
var Q = X * (P + p) - p;
|
|
2497
|
+
return C > Q && (Q = C), Q += p * 2, Q;
|
|
2498
|
+
}, x.prototype.tileNodesByFavoringDim = function(o, E, f) {
|
|
2499
|
+
var p = h.TILING_PADDING_VERTICAL, m = h.TILING_PADDING_HORIZONTAL, O = h.TILING_COMPARE_BY, L = {
|
|
2500
2500
|
rows: [],
|
|
2501
2501
|
rowWidth: [],
|
|
2502
2502
|
rowHeight: [],
|
|
2503
2503
|
width: 0,
|
|
2504
2504
|
height: E,
|
|
2505
2505
|
// assume minHeight equals to minWidth
|
|
2506
|
-
verticalPadding:
|
|
2506
|
+
verticalPadding: p,
|
|
2507
2507
|
horizontalPadding: m,
|
|
2508
2508
|
centerX: 0,
|
|
2509
2509
|
centerY: 0
|
|
2510
2510
|
};
|
|
2511
|
-
O && (L.idealRowWidth = this.calcIdealRowWidth(o,
|
|
2511
|
+
O && (L.idealRowWidth = this.calcIdealRowWidth(o, f));
|
|
2512
2512
|
var C = function(G) {
|
|
2513
2513
|
return G.rect.width * G.rect.height;
|
|
2514
2514
|
}, P = function(G, D) {
|
|
@@ -2535,29 +2535,29 @@ function gi() {
|
|
|
2535
2535
|
this.shiftToLastRow(L);
|
|
2536
2536
|
}
|
|
2537
2537
|
return L;
|
|
2538
|
-
}, x.prototype.insertNodeToRow = function(o, E,
|
|
2539
|
-
var m =
|
|
2540
|
-
if (
|
|
2538
|
+
}, x.prototype.insertNodeToRow = function(o, E, f, p) {
|
|
2539
|
+
var m = p;
|
|
2540
|
+
if (f == o.rows.length) {
|
|
2541
2541
|
var O = [];
|
|
2542
2542
|
o.rows.push(O), o.rowWidth.push(m), o.rowHeight.push(0);
|
|
2543
2543
|
}
|
|
2544
|
-
var L = o.rowWidth[
|
|
2545
|
-
o.rows[
|
|
2544
|
+
var L = o.rowWidth[f] + E.rect.width;
|
|
2545
|
+
o.rows[f].length > 0 && (L += o.horizontalPadding), o.rowWidth[f] = L, o.width < L && (o.width = L);
|
|
2546
2546
|
var C = E.rect.height;
|
|
2547
|
-
|
|
2547
|
+
f > 0 && (C += o.verticalPadding);
|
|
2548
2548
|
var P = 0;
|
|
2549
|
-
C > o.rowHeight[
|
|
2549
|
+
C > o.rowHeight[f] && (P = o.rowHeight[f], o.rowHeight[f] = C, P = o.rowHeight[f] - P), o.height += P, o.rows[f].push(E);
|
|
2550
2550
|
}, x.prototype.getShortestRowIndex = function(o) {
|
|
2551
|
-
for (var E = -1,
|
|
2552
|
-
o.rowWidth[
|
|
2551
|
+
for (var E = -1, f = Number.MAX_VALUE, p = 0; p < o.rows.length; p++)
|
|
2552
|
+
o.rowWidth[p] < f && (E = p, f = o.rowWidth[p]);
|
|
2553
2553
|
return E;
|
|
2554
2554
|
}, x.prototype.getLongestRowIndex = function(o) {
|
|
2555
|
-
for (var E = -1,
|
|
2556
|
-
o.rowWidth[
|
|
2555
|
+
for (var E = -1, f = Number.MIN_VALUE, p = 0; p < o.rows.length; p++)
|
|
2556
|
+
o.rowWidth[p] > f && (E = p, f = o.rowWidth[p]);
|
|
2557
2557
|
return E;
|
|
2558
|
-
}, x.prototype.canAddHorizontal = function(o, E,
|
|
2558
|
+
}, x.prototype.canAddHorizontal = function(o, E, f) {
|
|
2559
2559
|
if (o.idealRowWidth) {
|
|
2560
|
-
var
|
|
2560
|
+
var p = o.rows.length - 1, m = o.rowWidth[p];
|
|
2561
2561
|
return m + E + o.horizontalPadding <= o.idealRowWidth;
|
|
2562
2562
|
}
|
|
2563
2563
|
var O = this.getShortestRowIndex(o);
|
|
@@ -2566,21 +2566,21 @@ function gi() {
|
|
|
2566
2566
|
var L = o.rowWidth[O];
|
|
2567
2567
|
if (L + o.horizontalPadding + E <= o.width) return !0;
|
|
2568
2568
|
var C = 0;
|
|
2569
|
-
o.rowHeight[O] <
|
|
2569
|
+
o.rowHeight[O] < f && O > 0 && (C = f + o.verticalPadding - o.rowHeight[O]);
|
|
2570
2570
|
var P;
|
|
2571
|
-
o.width - L >= E + o.horizontalPadding ? P = (o.height + C) / (L + E + o.horizontalPadding) : P = (o.height + C) / o.width, C =
|
|
2571
|
+
o.width - L >= E + o.horizontalPadding ? P = (o.height + C) / (L + E + o.horizontalPadding) : P = (o.height + C) / o.width, C = f + o.verticalPadding;
|
|
2572
2572
|
var S;
|
|
2573
2573
|
return o.width < E ? S = (o.height + C) / E : S = (o.height + C) / o.width, S < 1 && (S = 1 / S), P < 1 && (P = 1 / P), P < S;
|
|
2574
2574
|
}, x.prototype.shiftToLastRow = function(o) {
|
|
2575
|
-
var E = this.getLongestRowIndex(o),
|
|
2576
|
-
if (o.width - o.rowWidth[
|
|
2577
|
-
|
|
2578
|
-
for (var L = Number.MIN_VALUE, C = 0; C <
|
|
2579
|
-
|
|
2575
|
+
var E = this.getLongestRowIndex(o), f = o.rowWidth.length - 1, p = o.rows[E], m = p[p.length - 1], O = m.width + o.horizontalPadding;
|
|
2576
|
+
if (o.width - o.rowWidth[f] > O && E != f) {
|
|
2577
|
+
p.splice(-1, 1), o.rows[f].push(m), o.rowWidth[E] = o.rowWidth[E] - O, o.rowWidth[f] = o.rowWidth[f] + O, o.width = o.rowWidth[instance.getLongestRowIndex(o)];
|
|
2578
|
+
for (var L = Number.MIN_VALUE, C = 0; C < p.length; C++)
|
|
2579
|
+
p[C].height > L && (L = p[C].height);
|
|
2580
2580
|
E > 0 && (L += o.verticalPadding);
|
|
2581
|
-
var P = o.rowHeight[E] + o.rowHeight[
|
|
2582
|
-
o.rowHeight[E] = L, o.rowHeight[
|
|
2583
|
-
var S = o.rowHeight[E] + o.rowHeight[
|
|
2581
|
+
var P = o.rowHeight[E] + o.rowHeight[f];
|
|
2582
|
+
o.rowHeight[E] = L, o.rowHeight[f] < m.height + o.verticalPadding && (o.rowHeight[f] = m.height + o.verticalPadding);
|
|
2583
|
+
var S = o.rowHeight[E] + o.rowHeight[f];
|
|
2584
2584
|
o.height += S - P, this.shiftToLastRow(o);
|
|
2585
2585
|
}
|
|
2586
2586
|
}, x.prototype.tilingPreLayout = function() {
|
|
@@ -2588,16 +2588,16 @@ function gi() {
|
|
|
2588
2588
|
}, x.prototype.tilingPostLayout = function() {
|
|
2589
2589
|
h.TILE && (this.repopulateZeroDegreeMembers(), this.repopulateCompounds());
|
|
2590
2590
|
}, x.prototype.reduceTrees = function() {
|
|
2591
|
-
for (var o = [], E = !0,
|
|
2592
|
-
var
|
|
2591
|
+
for (var o = [], E = !0, f; E; ) {
|
|
2592
|
+
var p = this.graphManager.getAllNodes(), m = [];
|
|
2593
2593
|
E = !1;
|
|
2594
|
-
for (var O = 0; O <
|
|
2595
|
-
if (
|
|
2594
|
+
for (var O = 0; O < p.length; O++)
|
|
2595
|
+
if (f = p[O], f.getEdges().length == 1 && !f.getEdges()[0].isInterGraph && f.getChild() == null) {
|
|
2596
2596
|
if (h.PURE_INCREMENTAL) {
|
|
2597
|
-
var L =
|
|
2598
|
-
m.push([
|
|
2597
|
+
var L = f.getEdges()[0].getOtherEnd(f), C = new I(f.getCenterX() - L.getCenterX(), f.getCenterY() - L.getCenterY());
|
|
2598
|
+
m.push([f, f.getEdges()[0], f.getOwner(), C]);
|
|
2599
2599
|
} else
|
|
2600
|
-
m.push([
|
|
2600
|
+
m.push([f, f.getEdges()[0], f.getOwner()]);
|
|
2601
2601
|
E = !0;
|
|
2602
2602
|
}
|
|
2603
2603
|
if (E == !0) {
|
|
@@ -2608,15 +2608,15 @@ function gi() {
|
|
|
2608
2608
|
}
|
|
2609
2609
|
this.prunedNodesAll = o;
|
|
2610
2610
|
}, x.prototype.growTree = function(o) {
|
|
2611
|
-
for (var E = o.length,
|
|
2612
|
-
|
|
2611
|
+
for (var E = o.length, f = o[E - 1], p, m = 0; m < f.length; m++)
|
|
2612
|
+
p = f[m], this.findPlaceforPrunedNode(p), p[2].add(p[0]), p[2].add(p[1], p[1].source, p[1].target);
|
|
2613
2613
|
o.splice(o.length - 1, 1), this.graphManager.resetAllNodes(), this.graphManager.resetAllEdges();
|
|
2614
2614
|
}, x.prototype.findPlaceforPrunedNode = function(o) {
|
|
2615
|
-
var E,
|
|
2616
|
-
if (
|
|
2617
|
-
|
|
2615
|
+
var E, f, p = o[0];
|
|
2616
|
+
if (p == o[1].source ? f = o[1].target : f = o[1].source, h.PURE_INCREMENTAL)
|
|
2617
|
+
p.setCenter(f.getCenterX() + o[3].getWidth(), f.getCenterY() + o[3].getHeight());
|
|
2618
2618
|
else {
|
|
2619
|
-
var m =
|
|
2619
|
+
var m = f.startX, O = f.finishX, L = f.startY, C = f.finishY, P = 0, S = 0, B = 0, V = 0, X = [P, B, S, V];
|
|
2620
2620
|
if (L > 0)
|
|
2621
2621
|
for (var Q = m; Q <= O; Q++)
|
|
2622
2622
|
X[0] += this.grid[Q][L - 1].length + this.grid[Q][L].length - 1;
|
|
@@ -2641,15 +2641,15 @@ function gi() {
|
|
|
2641
2641
|
E = et;
|
|
2642
2642
|
} else
|
|
2643
2643
|
E = b;
|
|
2644
|
-
E == 0 ?
|
|
2644
|
+
E == 0 ? p.setCenter(f.getCenterX(), f.getCenterY() - f.getHeight() / 2 - c.DEFAULT_EDGE_LENGTH - p.getHeight() / 2) : E == 1 ? p.setCenter(f.getCenterX() + f.getWidth() / 2 + c.DEFAULT_EDGE_LENGTH + p.getWidth() / 2, f.getCenterY()) : E == 2 ? p.setCenter(f.getCenterX(), f.getCenterY() + f.getHeight() / 2 + c.DEFAULT_EDGE_LENGTH + p.getHeight() / 2) : p.setCenter(f.getCenterX() - f.getWidth() / 2 - c.DEFAULT_EDGE_LENGTH - p.getWidth() / 2, f.getCenterY());
|
|
2645
2645
|
}
|
|
2646
|
-
},
|
|
2646
|
+
}, i.exports = x;
|
|
2647
2647
|
}
|
|
2648
2648
|
),
|
|
2649
2649
|
/***/
|
|
2650
2650
|
991: (
|
|
2651
2651
|
/***/
|
|
2652
|
-
(
|
|
2652
|
+
(i, r, e) => {
|
|
2653
2653
|
var l = e(551).FDLayoutNode, n = e(551).IMath;
|
|
2654
2654
|
function v(s, h, u, c) {
|
|
2655
2655
|
l.call(this, s, h, u, c);
|
|
@@ -2680,13 +2680,13 @@ function gi() {
|
|
|
2680
2680
|
this.processed = s;
|
|
2681
2681
|
}, v.prototype.isProcessed = function() {
|
|
2682
2682
|
return processed;
|
|
2683
|
-
},
|
|
2683
|
+
}, i.exports = v;
|
|
2684
2684
|
}
|
|
2685
2685
|
),
|
|
2686
2686
|
/***/
|
|
2687
2687
|
902: (
|
|
2688
2688
|
/***/
|
|
2689
|
-
(
|
|
2689
|
+
(i, r, e) => {
|
|
2690
2690
|
function l(u) {
|
|
2691
2691
|
if (Array.isArray(u)) {
|
|
2692
2692
|
for (var c = 0, N = Array(u.length); c < u.length; c++)
|
|
@@ -2716,7 +2716,7 @@ function gi() {
|
|
|
2716
2716
|
R += y[d.get(J)], W += I[d.get(J)];
|
|
2717
2717
|
}), { x: R / M.size, y: W / M.size };
|
|
2718
2718
|
}, x = function(M, R, W, J, Z) {
|
|
2719
|
-
function
|
|
2719
|
+
function pt(ct, at) {
|
|
2720
2720
|
var st = new Set(ct), It = !0, ut = !1, Ot = void 0;
|
|
2721
2721
|
try {
|
|
2722
2722
|
for (var Yt = at[Symbol.iterator](), Mt; !(It = (Mt = Yt.next()).done); It = !0) {
|
|
@@ -2743,9 +2743,9 @@ function gi() {
|
|
|
2743
2743
|
lt.set(st.id, lt.get(st.id) + 1);
|
|
2744
2744
|
});
|
|
2745
2745
|
});
|
|
2746
|
-
var tt = /* @__PURE__ */ new Map(), gt = /* @__PURE__ */ new Map(),
|
|
2746
|
+
var tt = /* @__PURE__ */ new Map(), gt = /* @__PURE__ */ new Map(), rt = new v();
|
|
2747
2747
|
lt.forEach(function(ct, at) {
|
|
2748
|
-
ct == 0 ? (
|
|
2748
|
+
ct == 0 ? (rt.push(at), W || (R == "horizontal" ? tt.set(at, d.has(at) ? y[d.get(at)] : J.get(at)) : tt.set(at, d.has(at) ? I[d.get(at)] : J.get(at)))) : tt.set(at, Number.NEGATIVE_INFINITY), W && gt.set(at, /* @__PURE__ */ new Set([at]));
|
|
2749
2749
|
}), W && Z.forEach(function(ct) {
|
|
2750
2750
|
var at = [];
|
|
2751
2751
|
if (ct.forEach(function(ut) {
|
|
@@ -2767,7 +2767,7 @@ function gi() {
|
|
|
2767
2767
|
}
|
|
2768
2768
|
});
|
|
2769
2769
|
for (var Nt = function() {
|
|
2770
|
-
var ct =
|
|
2770
|
+
var ct = rt.shift(), at = M.get(ct);
|
|
2771
2771
|
at.forEach(function(st) {
|
|
2772
2772
|
if (tt.get(st.id) < tt.get(ct) + st.gap)
|
|
2773
2773
|
if (W && W.has(st.id)) {
|
|
@@ -2780,9 +2780,9 @@ function gi() {
|
|
|
2780
2780
|
}
|
|
2781
2781
|
} else
|
|
2782
2782
|
tt.set(st.id, tt.get(ct) + st.gap);
|
|
2783
|
-
lt.set(st.id, lt.get(st.id) - 1), lt.get(st.id) == 0 &&
|
|
2783
|
+
lt.set(st.id, lt.get(st.id) - 1), lt.get(st.id) == 0 && rt.push(st.id), W && gt.set(st.id, pt(gt.get(ct), gt.get(st.id)));
|
|
2784
2784
|
});
|
|
2785
|
-
};
|
|
2785
|
+
}; rt.length != 0; )
|
|
2786
2786
|
Nt();
|
|
2787
2787
|
if (W) {
|
|
2788
2788
|
var yt = /* @__PURE__ */ new Set();
|
|
@@ -2836,9 +2836,9 @@ function gi() {
|
|
|
2836
2836
|
throw At;
|
|
2837
2837
|
}
|
|
2838
2838
|
}
|
|
2839
|
-
var le = (st + ut) / 2 - (It + Ot) / 2,
|
|
2839
|
+
var le = (st + ut) / 2 - (It + Ot) / 2, ie = !0, Jt = !1, Kt = void 0;
|
|
2840
2840
|
try {
|
|
2841
|
-
for (var qt = ct[Symbol.iterator](), te; !(
|
|
2841
|
+
for (var qt = ct[Symbol.iterator](), te; !(ie = (te = qt.next()).done); ie = !0) {
|
|
2842
2842
|
var oe = te.value;
|
|
2843
2843
|
tt.set(oe, tt.get(oe) + le);
|
|
2844
2844
|
}
|
|
@@ -2846,7 +2846,7 @@ function gi() {
|
|
|
2846
2846
|
Jt = !0, Kt = Qt;
|
|
2847
2847
|
} finally {
|
|
2848
2848
|
try {
|
|
2849
|
-
!
|
|
2849
|
+
!ie && qt.return && qt.return();
|
|
2850
2850
|
} finally {
|
|
2851
2851
|
if (Jt)
|
|
2852
2852
|
throw Kt;
|
|
@@ -2855,13 +2855,13 @@ function gi() {
|
|
|
2855
2855
|
});
|
|
2856
2856
|
}
|
|
2857
2857
|
return tt;
|
|
2858
|
-
},
|
|
2858
|
+
}, it = function(M) {
|
|
2859
2859
|
var R = 0, W = 0, J = 0, Z = 0;
|
|
2860
2860
|
if (M.forEach(function(gt) {
|
|
2861
2861
|
gt.left ? y[d.get(gt.left)] - y[d.get(gt.right)] >= 0 ? R++ : W++ : I[d.get(gt.top)] - I[d.get(gt.bottom)] >= 0 ? J++ : Z++;
|
|
2862
2862
|
}), R > W && J > Z)
|
|
2863
|
-
for (var
|
|
2864
|
-
y[
|
|
2863
|
+
for (var pt = 0; pt < d.size; pt++)
|
|
2864
|
+
y[pt] = -1 * y[pt], I[pt] = -1 * I[pt];
|
|
2865
2865
|
else if (R > W)
|
|
2866
2866
|
for (var lt = 0; lt < d.size; lt++)
|
|
2867
2867
|
y[lt] = -1 * y[lt];
|
|
@@ -2870,15 +2870,15 @@ function gi() {
|
|
|
2870
2870
|
I[tt] = -1 * I[tt];
|
|
2871
2871
|
}, o = function(M) {
|
|
2872
2872
|
var R = [], W = new v(), J = /* @__PURE__ */ new Set(), Z = 0;
|
|
2873
|
-
return M.forEach(function(
|
|
2873
|
+
return M.forEach(function(pt, lt) {
|
|
2874
2874
|
if (!J.has(lt)) {
|
|
2875
2875
|
R[Z] = [];
|
|
2876
2876
|
var tt = lt;
|
|
2877
2877
|
for (W.push(tt), J.add(tt), R[Z].push(tt); W.length != 0; ) {
|
|
2878
2878
|
tt = W.shift();
|
|
2879
2879
|
var gt = M.get(tt);
|
|
2880
|
-
gt.forEach(function(
|
|
2881
|
-
J.has(
|
|
2880
|
+
gt.forEach(function(rt) {
|
|
2881
|
+
J.has(rt.id) || (W.push(rt.id), J.add(rt.id), R[Z].push(rt.id));
|
|
2882
2882
|
});
|
|
2883
2883
|
}
|
|
2884
2884
|
Z++;
|
|
@@ -2893,7 +2893,7 @@ function gi() {
|
|
|
2893
2893
|
R.get(J).push(Z), R.get(Z.id).push({ id: J, gap: Z.gap, direction: Z.direction });
|
|
2894
2894
|
});
|
|
2895
2895
|
}), R;
|
|
2896
|
-
},
|
|
2896
|
+
}, f = function(M) {
|
|
2897
2897
|
var R = /* @__PURE__ */ new Map();
|
|
2898
2898
|
return M.forEach(function(W, J) {
|
|
2899
2899
|
R.set(J, []);
|
|
@@ -2902,7 +2902,7 @@ function gi() {
|
|
|
2902
2902
|
R.get(Z.id).push({ id: J, gap: Z.gap, direction: Z.direction });
|
|
2903
2903
|
});
|
|
2904
2904
|
}), R;
|
|
2905
|
-
},
|
|
2905
|
+
}, p = [], m = [], O = !1, L = !1, C = /* @__PURE__ */ new Set(), P = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map(), B = [];
|
|
2906
2906
|
if (c.fixedNodeConstraint && c.fixedNodeConstraint.forEach(function(M) {
|
|
2907
2907
|
C.add(M.nodeId);
|
|
2908
2908
|
}), c.relativePlacementConstraint && (c.relativePlacementConstraint.forEach(function(M) {
|
|
@@ -2910,7 +2910,7 @@ function gi() {
|
|
|
2910
2910
|
}), S = E(P), B = o(S)), n.TRANSFORM_ON_CONSTRAINT_HANDLING) {
|
|
2911
2911
|
if (c.fixedNodeConstraint && c.fixedNodeConstraint.length > 1)
|
|
2912
2912
|
c.fixedNodeConstraint.forEach(function(M, R) {
|
|
2913
|
-
|
|
2913
|
+
p[R] = [M.position.x, M.position.y], m[R] = [y[d.get(M.nodeId)], I[d.get(M.nodeId)]];
|
|
2914
2914
|
}), O = !0;
|
|
2915
2915
|
else if (c.alignmentConstraint)
|
|
2916
2916
|
(function() {
|
|
@@ -2921,30 +2921,30 @@ function gi() {
|
|
|
2921
2921
|
R[tt].forEach(function(yt) {
|
|
2922
2922
|
gt.add(yt);
|
|
2923
2923
|
});
|
|
2924
|
-
var
|
|
2924
|
+
var rt = new Set([].concat(l(gt)).filter(function(yt) {
|
|
2925
2925
|
return C.has(yt);
|
|
2926
2926
|
})), Nt = void 0;
|
|
2927
|
-
|
|
2928
|
-
|
|
2927
|
+
rt.size > 0 ? Nt = y[d.get(rt.values().next().value)] : Nt = q(gt).x, R[tt].forEach(function(yt) {
|
|
2928
|
+
p[M] = [Nt, I[d.get(yt)]], m[M] = [y[d.get(yt)], I[d.get(yt)]], M++;
|
|
2929
2929
|
});
|
|
2930
2930
|
}, J = 0; J < R.length; J++)
|
|
2931
2931
|
W(J);
|
|
2932
2932
|
O = !0;
|
|
2933
2933
|
}
|
|
2934
2934
|
if (c.alignmentConstraint.horizontal) {
|
|
2935
|
-
for (var Z = c.alignmentConstraint.horizontal,
|
|
2935
|
+
for (var Z = c.alignmentConstraint.horizontal, pt = function(tt) {
|
|
2936
2936
|
var gt = /* @__PURE__ */ new Set();
|
|
2937
2937
|
Z[tt].forEach(function(yt) {
|
|
2938
2938
|
gt.add(yt);
|
|
2939
2939
|
});
|
|
2940
|
-
var
|
|
2940
|
+
var rt = new Set([].concat(l(gt)).filter(function(yt) {
|
|
2941
2941
|
return C.has(yt);
|
|
2942
2942
|
})), Nt = void 0;
|
|
2943
|
-
|
|
2944
|
-
|
|
2943
|
+
rt.size > 0 ? Nt = y[d.get(rt.values().next().value)] : Nt = q(gt).y, Z[tt].forEach(function(yt) {
|
|
2944
|
+
p[M] = [y[d.get(yt)], Nt], m[M] = [y[d.get(yt)], I[d.get(yt)]], M++;
|
|
2945
2945
|
});
|
|
2946
2946
|
}, lt = 0; lt < Z.length; lt++)
|
|
2947
|
-
|
|
2947
|
+
pt(lt);
|
|
2948
2948
|
O = !0;
|
|
2949
2949
|
}
|
|
2950
2950
|
c.relativePlacementConstraint && (L = !0);
|
|
@@ -2953,22 +2953,22 @@ function gi() {
|
|
|
2953
2953
|
for (var V = 0, X = 0, Q = 0; Q < B.length; Q++)
|
|
2954
2954
|
B[Q].length > V && (V = B[Q].length, X = Q);
|
|
2955
2955
|
if (V < S.size / 2)
|
|
2956
|
-
|
|
2956
|
+
it(c.relativePlacementConstraint), O = !1, L = !1;
|
|
2957
2957
|
else {
|
|
2958
2958
|
var G = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), b = [];
|
|
2959
2959
|
B[X].forEach(function(M) {
|
|
2960
2960
|
P.get(M).forEach(function(R) {
|
|
2961
2961
|
R.direction == "horizontal" ? (G.has(M) ? G.get(M).push(R) : G.set(M, [R]), G.has(R.id) || G.set(R.id, []), b.push({ left: M, right: R.id })) : (D.has(M) ? D.get(M).push(R) : D.set(M, [R]), D.has(R.id) || D.set(R.id, []), b.push({ top: M, bottom: R.id }));
|
|
2962
2962
|
});
|
|
2963
|
-
}),
|
|
2963
|
+
}), it(b), L = !1;
|
|
2964
2964
|
var j = x(G, "horizontal"), et = x(D, "vertical");
|
|
2965
2965
|
B[X].forEach(function(M, R) {
|
|
2966
|
-
m[R] = [y[d.get(M)], I[d.get(M)]],
|
|
2966
|
+
m[R] = [y[d.get(M)], I[d.get(M)]], p[R] = [], j.has(M) ? p[R][0] = j.get(M) : p[R][0] = y[d.get(M)], et.has(M) ? p[R][1] = et.get(M) : p[R][1] = I[d.get(M)];
|
|
2967
2967
|
}), O = !0;
|
|
2968
2968
|
}
|
|
2969
2969
|
}
|
|
2970
2970
|
if (O) {
|
|
2971
|
-
for (var vt = void 0, $ = t.transpose(
|
|
2971
|
+
for (var vt = void 0, $ = t.transpose(p), Dt = t.transpose(m), K = 0; K < $.length; K++)
|
|
2972
2972
|
$[K] = t.multGamma($[K]), Dt[K] = t.multGamma(Dt[K]);
|
|
2973
2973
|
var nt = t.multMat($, t.transpose(Dt)), mt = s.svd(nt);
|
|
2974
2974
|
vt = t.multMat(mt.V, t.transpose(mt.U));
|
|
@@ -2976,7 +2976,7 @@ function gi() {
|
|
|
2976
2976
|
var _t = [y[ht], I[ht]], Lt = [vt[0][0], vt[1][0]], Tt = [vt[0][1], vt[1][1]];
|
|
2977
2977
|
y[ht] = t.dotProduct(_t, Lt), I[ht] = t.dotProduct(_t, Tt);
|
|
2978
2978
|
}
|
|
2979
|
-
L &&
|
|
2979
|
+
L && it(c.relativePlacementConstraint);
|
|
2980
2980
|
}
|
|
2981
2981
|
}
|
|
2982
2982
|
if (n.ENFORCE_CONSTRAINTS) {
|
|
@@ -3024,29 +3024,29 @@ function gi() {
|
|
|
3024
3024
|
Bt(Ft);
|
|
3025
3025
|
}
|
|
3026
3026
|
c.relativePlacementConstraint && function() {
|
|
3027
|
-
var M = /* @__PURE__ */ new Map(), R = /* @__PURE__ */ new Map(), W = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(),
|
|
3028
|
-
if (C.forEach(function(
|
|
3029
|
-
lt.add(
|
|
3027
|
+
var M = /* @__PURE__ */ new Map(), R = /* @__PURE__ */ new Map(), W = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), pt = /* @__PURE__ */ new Map(), lt = /* @__PURE__ */ new Set(), tt = /* @__PURE__ */ new Set();
|
|
3028
|
+
if (C.forEach(function(ft) {
|
|
3029
|
+
lt.add(ft), tt.add(ft);
|
|
3030
3030
|
}), c.alignmentConstraint) {
|
|
3031
3031
|
if (c.alignmentConstraint.vertical)
|
|
3032
|
-
for (var gt = c.alignmentConstraint.vertical,
|
|
3033
|
-
W.set("dummy" +
|
|
3034
|
-
M.set(xt, "dummy" +
|
|
3035
|
-
}), Z.set("dummy" +
|
|
3032
|
+
for (var gt = c.alignmentConstraint.vertical, rt = function(ft) {
|
|
3033
|
+
W.set("dummy" + ft, []), gt[ft].forEach(function(xt) {
|
|
3034
|
+
M.set(xt, "dummy" + ft), W.get("dummy" + ft).push(xt), C.has(xt) && lt.add("dummy" + ft);
|
|
3035
|
+
}), Z.set("dummy" + ft, y[d.get(gt[ft][0])]);
|
|
3036
3036
|
}, Nt = 0; Nt < gt.length; Nt++)
|
|
3037
|
-
|
|
3037
|
+
rt(Nt);
|
|
3038
3038
|
if (c.alignmentConstraint.horizontal)
|
|
3039
|
-
for (var yt = c.alignmentConstraint.horizontal, Ct = function(
|
|
3040
|
-
J.set("dummy" +
|
|
3041
|
-
R.set(xt, "dummy" +
|
|
3042
|
-
}),
|
|
3039
|
+
for (var yt = c.alignmentConstraint.horizontal, Ct = function(ft) {
|
|
3040
|
+
J.set("dummy" + ft, []), yt[ft].forEach(function(xt) {
|
|
3041
|
+
R.set(xt, "dummy" + ft), J.get("dummy" + ft).push(xt), C.has(xt) && tt.add("dummy" + ft);
|
|
3042
|
+
}), pt.set("dummy" + ft, I[d.get(yt[ft][0])]);
|
|
3043
3043
|
}, ct = 0; ct < yt.length; ct++)
|
|
3044
3044
|
Ct(ct);
|
|
3045
3045
|
}
|
|
3046
|
-
var at = /* @__PURE__ */ new Map(), st = /* @__PURE__ */ new Map(), It = function(
|
|
3047
|
-
P.get(
|
|
3046
|
+
var at = /* @__PURE__ */ new Map(), st = /* @__PURE__ */ new Map(), It = function(ft) {
|
|
3047
|
+
P.get(ft).forEach(function(xt) {
|
|
3048
3048
|
var Xt = void 0, Wt = void 0;
|
|
3049
|
-
xt.direction == "horizontal" ? (Xt = M.get(
|
|
3049
|
+
xt.direction == "horizontal" ? (Xt = M.get(ft) ? M.get(ft) : ft, M.get(xt.id) ? Wt = { id: M.get(xt.id), gap: xt.gap, direction: xt.direction } : Wt = xt, at.has(Xt) ? at.get(Xt).push(Wt) : at.set(Xt, [Wt]), at.has(Wt.id) || at.set(Wt.id, [])) : (Xt = R.get(ft) ? R.get(ft) : ft, R.get(xt.id) ? Wt = { id: R.get(xt.id), gap: xt.gap, direction: xt.direction } : Wt = xt, st.has(Xt) ? st.get(Xt).push(Wt) : st.set(Xt, [Wt]), st.has(Wt.id) || st.set(Wt.id, []));
|
|
3050
3050
|
});
|
|
3051
3051
|
}, ut = !0, Ot = !1, Yt = void 0;
|
|
3052
3052
|
try {
|
|
@@ -3054,8 +3054,8 @@ function gi() {
|
|
|
3054
3054
|
var Ut = At.value;
|
|
3055
3055
|
It(Ut);
|
|
3056
3056
|
}
|
|
3057
|
-
} catch (
|
|
3058
|
-
Ot = !0, Yt =
|
|
3057
|
+
} catch (ft) {
|
|
3058
|
+
Ot = !0, Yt = ft;
|
|
3059
3059
|
} finally {
|
|
3060
3060
|
try {
|
|
3061
3061
|
!ut && Mt.return && Mt.return();
|
|
@@ -3064,28 +3064,28 @@ function gi() {
|
|
|
3064
3064
|
throw Yt;
|
|
3065
3065
|
}
|
|
3066
3066
|
}
|
|
3067
|
-
var Ht = E(at), Rt = E(st), kt = o(Ht), Zt = o(Rt), le =
|
|
3068
|
-
kt.forEach(function(
|
|
3069
|
-
Jt[xt] = [],
|
|
3067
|
+
var Ht = E(at), Rt = E(st), kt = o(Ht), Zt = o(Rt), le = f(at), ie = f(st), Jt = [], Kt = [];
|
|
3068
|
+
kt.forEach(function(ft, xt) {
|
|
3069
|
+
Jt[xt] = [], ft.forEach(function(Xt) {
|
|
3070
3070
|
le.get(Xt).length == 0 && Jt[xt].push(Xt);
|
|
3071
3071
|
});
|
|
3072
|
-
}), Zt.forEach(function(
|
|
3073
|
-
Kt[xt] = [],
|
|
3074
|
-
|
|
3072
|
+
}), Zt.forEach(function(ft, xt) {
|
|
3073
|
+
Kt[xt] = [], ft.forEach(function(Xt) {
|
|
3074
|
+
ie.get(Xt).length == 0 && Kt[xt].push(Xt);
|
|
3075
3075
|
});
|
|
3076
3076
|
});
|
|
3077
|
-
var qt = x(at, "horizontal", lt, Z, Jt), te = x(st, "vertical", tt,
|
|
3078
|
-
W.get(
|
|
3079
|
-
y[d.get(xt)] = qt.get(
|
|
3080
|
-
}) : y[d.get(
|
|
3077
|
+
var qt = x(at, "horizontal", lt, Z, Jt), te = x(st, "vertical", tt, pt, Kt), oe = function(ft) {
|
|
3078
|
+
W.get(ft) ? W.get(ft).forEach(function(xt) {
|
|
3079
|
+
y[d.get(xt)] = qt.get(ft);
|
|
3080
|
+
}) : y[d.get(ft)] = qt.get(ft);
|
|
3081
3081
|
}, Qt = !0, Ne = !1, Te = void 0;
|
|
3082
3082
|
try {
|
|
3083
3083
|
for (var ce = qt.keys()[Symbol.iterator](), Ae; !(Qt = (Ae = ce.next()).done); Qt = !0) {
|
|
3084
3084
|
var de = Ae.value;
|
|
3085
3085
|
oe(de);
|
|
3086
3086
|
}
|
|
3087
|
-
} catch (
|
|
3088
|
-
Ne = !0, Te =
|
|
3087
|
+
} catch (ft) {
|
|
3088
|
+
Ne = !0, Te = ft;
|
|
3089
3089
|
} finally {
|
|
3090
3090
|
try {
|
|
3091
3091
|
!Qt && ce.return && ce.return();
|
|
@@ -3094,18 +3094,18 @@ function gi() {
|
|
|
3094
3094
|
throw Te;
|
|
3095
3095
|
}
|
|
3096
3096
|
}
|
|
3097
|
-
var Be = function(
|
|
3098
|
-
J.get(
|
|
3099
|
-
I[d.get(xt)] = te.get(
|
|
3100
|
-
}) : I[d.get(
|
|
3097
|
+
var Be = function(ft) {
|
|
3098
|
+
J.get(ft) ? J.get(ft).forEach(function(xt) {
|
|
3099
|
+
I[d.get(xt)] = te.get(ft);
|
|
3100
|
+
}) : I[d.get(ft)] = te.get(ft);
|
|
3101
3101
|
}, ge = !0, we = !1, Ie = void 0;
|
|
3102
3102
|
try {
|
|
3103
3103
|
for (var ue = te.keys()[Symbol.iterator](), Me; !(ge = (Me = ue.next()).done); ge = !0) {
|
|
3104
3104
|
var de = Me.value;
|
|
3105
3105
|
Be(de);
|
|
3106
3106
|
}
|
|
3107
|
-
} catch (
|
|
3108
|
-
we = !0, Ie =
|
|
3107
|
+
} catch (ft) {
|
|
3108
|
+
we = !0, Ie = ft;
|
|
3109
3109
|
} finally {
|
|
3110
3110
|
try {
|
|
3111
3111
|
!ge && ue.return && ue.return();
|
|
@@ -3120,23 +3120,23 @@ function gi() {
|
|
|
3120
3120
|
var dt = w[$t];
|
|
3121
3121
|
dt.getChild() == null && dt.setCenter(y[d.get(dt.id)], I[d.get(dt.id)]);
|
|
3122
3122
|
}
|
|
3123
|
-
},
|
|
3123
|
+
}, i.exports = h;
|
|
3124
3124
|
}
|
|
3125
3125
|
),
|
|
3126
3126
|
/***/
|
|
3127
3127
|
551: (
|
|
3128
3128
|
/***/
|
|
3129
|
-
(
|
|
3130
|
-
|
|
3129
|
+
(i) => {
|
|
3130
|
+
i.exports = _;
|
|
3131
3131
|
}
|
|
3132
3132
|
)
|
|
3133
3133
|
/******/
|
|
3134
3134
|
}, T = {};
|
|
3135
|
-
function g(
|
|
3136
|
-
var
|
|
3137
|
-
if (
|
|
3138
|
-
return
|
|
3139
|
-
var e = T[
|
|
3135
|
+
function g(i) {
|
|
3136
|
+
var r = T[i];
|
|
3137
|
+
if (r !== void 0)
|
|
3138
|
+
return r.exports;
|
|
3139
|
+
var e = T[i] = {
|
|
3140
3140
|
/******/
|
|
3141
3141
|
// no module.id needed
|
|
3142
3142
|
/******/
|
|
@@ -3145,7 +3145,7 @@ function gi() {
|
|
|
3145
3145
|
exports: {}
|
|
3146
3146
|
/******/
|
|
3147
3147
|
};
|
|
3148
|
-
return k[
|
|
3148
|
+
return k[i](e, e.exports, g), e.exports;
|
|
3149
3149
|
}
|
|
3150
3150
|
var a = g(45);
|
|
3151
3151
|
return a;
|
|
@@ -3154,12 +3154,12 @@ function gi() {
|
|
|
3154
3154
|
});
|
|
3155
3155
|
}(ve)), ve.exports;
|
|
3156
3156
|
}
|
|
3157
|
-
var
|
|
3158
|
-
function
|
|
3157
|
+
var ur = pe.exports, xe;
|
|
3158
|
+
function fr() {
|
|
3159
3159
|
return xe || (xe = 1, function(A, U) {
|
|
3160
3160
|
(function(_, k) {
|
|
3161
|
-
A.exports = k(
|
|
3162
|
-
})(
|
|
3161
|
+
A.exports = k(gr());
|
|
3162
|
+
})(ur, function(_) {
|
|
3163
3163
|
return (
|
|
3164
3164
|
/******/
|
|
3165
3165
|
(() => {
|
|
@@ -3167,22 +3167,22 @@ function pi() {
|
|
|
3167
3167
|
/***/
|
|
3168
3168
|
658: (
|
|
3169
3169
|
/***/
|
|
3170
|
-
(
|
|
3171
|
-
|
|
3170
|
+
(i) => {
|
|
3171
|
+
i.exports = Object.assign != null ? Object.assign.bind(Object) : function(r) {
|
|
3172
3172
|
for (var e = arguments.length, l = Array(e > 1 ? e - 1 : 0), n = 1; n < e; n++)
|
|
3173
3173
|
l[n - 1] = arguments[n];
|
|
3174
3174
|
return l.forEach(function(v) {
|
|
3175
3175
|
Object.keys(v).forEach(function(t) {
|
|
3176
|
-
return
|
|
3176
|
+
return r[t] = v[t];
|
|
3177
3177
|
});
|
|
3178
|
-
}),
|
|
3178
|
+
}), r;
|
|
3179
3179
|
};
|
|
3180
3180
|
}
|
|
3181
3181
|
),
|
|
3182
3182
|
/***/
|
|
3183
3183
|
548: (
|
|
3184
3184
|
/***/
|
|
3185
|
-
(
|
|
3185
|
+
(i, r, e) => {
|
|
3186
3186
|
var l = /* @__PURE__ */ function() {
|
|
3187
3187
|
function t(s, h) {
|
|
3188
3188
|
var u = [], c = !0, N = !1, d = void 0;
|
|
@@ -3225,18 +3225,18 @@ function pi() {
|
|
|
3225
3225
|
var c = new n(), N = /* @__PURE__ */ new Set(), d = [], y = void 0, I = void 0, w = void 0, Y = !1, F = 1, H = [], z = [], q = function() {
|
|
3226
3226
|
var x = t.collection();
|
|
3227
3227
|
z.push(x);
|
|
3228
|
-
var
|
|
3229
|
-
o.merge(
|
|
3230
|
-
c.push(
|
|
3228
|
+
var it = h[0], o = t.collection();
|
|
3229
|
+
o.merge(it).merge(it.descendants().intersection(s)), d.push(it), o.forEach(function(p) {
|
|
3230
|
+
c.push(p), N.add(p), x.merge(p);
|
|
3231
3231
|
});
|
|
3232
3232
|
for (var E = function() {
|
|
3233
|
-
|
|
3234
|
-
var
|
|
3235
|
-
|
|
3236
|
-
s.intersection(
|
|
3233
|
+
it = c.shift();
|
|
3234
|
+
var p = t.collection();
|
|
3235
|
+
it.neighborhood().nodes().forEach(function(C) {
|
|
3236
|
+
s.intersection(it.edgesWith(C)).length > 0 && p.merge(C);
|
|
3237
3237
|
});
|
|
3238
|
-
for (var m = 0; m <
|
|
3239
|
-
var O =
|
|
3238
|
+
for (var m = 0; m < p.length; m++) {
|
|
3239
|
+
var O = p[m];
|
|
3240
3240
|
if (y = h.intersection(O.union(O.ancestors())), y != null && !N.has(y[0])) {
|
|
3241
3241
|
var L = y.union(y.descendants());
|
|
3242
3242
|
L.forEach(function(C) {
|
|
@@ -3246,18 +3246,18 @@ function pi() {
|
|
|
3246
3246
|
}
|
|
3247
3247
|
}; c.length != 0; )
|
|
3248
3248
|
E();
|
|
3249
|
-
if (x.forEach(function(
|
|
3250
|
-
s.intersection(
|
|
3249
|
+
if (x.forEach(function(p) {
|
|
3250
|
+
s.intersection(p.connectedEdges()).forEach(function(m) {
|
|
3251
3251
|
x.has(m.source()) && x.has(m.target()) && x.merge(m);
|
|
3252
3252
|
});
|
|
3253
3253
|
}), d.length == h.length && (Y = !0), !Y || Y && F > 1) {
|
|
3254
|
-
I = d[0], w = I.connectedEdges().length, d.forEach(function(
|
|
3255
|
-
|
|
3254
|
+
I = d[0], w = I.connectedEdges().length, d.forEach(function(p) {
|
|
3255
|
+
p.connectedEdges().length < w && (w = p.connectedEdges().length, I = p);
|
|
3256
3256
|
}), H.push(I.id());
|
|
3257
|
-
var
|
|
3258
|
-
|
|
3259
|
-
|
|
3260
|
-
}), d = [], h = h.difference(
|
|
3257
|
+
var f = t.collection();
|
|
3258
|
+
f.merge(d[0]), d.forEach(function(p) {
|
|
3259
|
+
f.merge(p);
|
|
3260
|
+
}), d = [], h = h.difference(f), F++;
|
|
3261
3261
|
}
|
|
3262
3262
|
};
|
|
3263
3263
|
do
|
|
@@ -3271,10 +3271,10 @@ function pi() {
|
|
|
3271
3271
|
var y = !0, I = !1, w = void 0;
|
|
3272
3272
|
try {
|
|
3273
3273
|
for (var Y = s.nodeIndexes[Symbol.iterator](), F; !(y = (F = Y.next()).done); y = !0) {
|
|
3274
|
-
var H = F.value, z = l(H, 2), q = z[0], x = z[1],
|
|
3275
|
-
if (
|
|
3276
|
-
var o =
|
|
3277
|
-
E < u && (u = E),
|
|
3274
|
+
var H = F.value, z = l(H, 2), q = z[0], x = z[1], it = h.cy.getElementById(q);
|
|
3275
|
+
if (it) {
|
|
3276
|
+
var o = it.boundingBox(), E = s.xCoords[x] - o.w / 2, f = s.xCoords[x] + o.w / 2, p = s.yCoords[x] - o.h / 2, m = s.yCoords[x] + o.h / 2;
|
|
3277
|
+
E < u && (u = E), f > c && (c = f), p < N && (N = p), m > d && (d = m);
|
|
3278
3278
|
}
|
|
3279
3279
|
}
|
|
3280
3280
|
} catch (S) {
|
|
@@ -3310,8 +3310,8 @@ function pi() {
|
|
|
3310
3310
|
var x = H[q];
|
|
3311
3311
|
I = s[u.get(x.id())] - x.width() / 2, w = s[u.get(x.id())] + x.width() / 2, Y = h[u.get(x.id())] - x.height() / 2, F = h[u.get(x.id())] + x.height() / 2, c > I && (c = I), N < w && (N = w), d > Y && (d = Y), y < F && (y = F);
|
|
3312
3312
|
}
|
|
3313
|
-
var
|
|
3314
|
-
return
|
|
3313
|
+
var it = {};
|
|
3314
|
+
return it.topLeftX = c, it.topLeftY = d, it.width = N - c, it.height = y - d, it;
|
|
3315
3315
|
}, v.calcParentsWithoutChildren = function(t, s) {
|
|
3316
3316
|
var h = t.collection();
|
|
3317
3317
|
return s.nodes(":parent").forEach(function(u) {
|
|
@@ -3320,21 +3320,21 @@ function pi() {
|
|
|
3320
3320
|
N.css("display") != "none" && (c = !0);
|
|
3321
3321
|
}), c || h.merge(u);
|
|
3322
3322
|
}), h;
|
|
3323
|
-
},
|
|
3323
|
+
}, i.exports = v;
|
|
3324
3324
|
}
|
|
3325
3325
|
),
|
|
3326
3326
|
/***/
|
|
3327
3327
|
816: (
|
|
3328
3328
|
/***/
|
|
3329
|
-
(
|
|
3329
|
+
(i, r, e) => {
|
|
3330
3330
|
var l = e(548), n = e(140).CoSELayout, v = e(140).CoSENode, t = e(140).layoutBase.PointD, s = e(140).layoutBase.DimensionD, h = e(140).layoutBase.LayoutConstants, u = e(140).layoutBase.FDLayoutConstants, c = e(140).CoSEConstants, N = function(d, y) {
|
|
3331
3331
|
var I = d.cy, w = d.eles, Y = w.nodes(), F = w.edges(), H = void 0, z = void 0, q = void 0, x = {};
|
|
3332
3332
|
d.randomize && (H = y.nodeIndexes, z = y.xCoords, q = y.yCoords);
|
|
3333
|
-
var
|
|
3333
|
+
var it = function(C) {
|
|
3334
3334
|
return typeof C == "function";
|
|
3335
3335
|
}, o = function(C, P) {
|
|
3336
|
-
return
|
|
3337
|
-
}, E = l.calcParentsWithoutChildren(I, w),
|
|
3336
|
+
return it(C) ? C(P) : C;
|
|
3337
|
+
}, E = l.calcParentsWithoutChildren(I, w), f = function C(P, S, B, V) {
|
|
3338
3338
|
for (var X = S.length, Q = 0; Q < X; Q++) {
|
|
3339
3339
|
var G = S[Q], D = null;
|
|
3340
3340
|
G.intersection(E).length == 0 && (D = G.children());
|
|
@@ -3358,7 +3358,7 @@ function pi() {
|
|
|
3358
3358
|
vt = B.getGraphManager().add(B.newGraph(), b), C(vt, D, B, V);
|
|
3359
3359
|
}
|
|
3360
3360
|
}
|
|
3361
|
-
},
|
|
3361
|
+
}, p = function(C, P, S) {
|
|
3362
3362
|
for (var B = 0, V = 0, X = 0; X < S.length; X++) {
|
|
3363
3363
|
var Q = S[X], G = x[Q.data("source")], D = x[Q.data("target")];
|
|
3364
3364
|
if (G && D && G !== D && G.getEdgesBetween(D).length == 0) {
|
|
@@ -3366,21 +3366,21 @@ function pi() {
|
|
|
3366
3366
|
b.id = Q.id(), b.idealLength = o(d.idealEdgeLength, Q), b.edgeElasticity = o(d.edgeElasticity, Q), B += b.idealLength, V++;
|
|
3367
3367
|
}
|
|
3368
3368
|
}
|
|
3369
|
-
d.idealEdgeLength != null && (V > 0 ? c.DEFAULT_EDGE_LENGTH = u.DEFAULT_EDGE_LENGTH = B / V :
|
|
3369
|
+
d.idealEdgeLength != null && (V > 0 ? c.DEFAULT_EDGE_LENGTH = u.DEFAULT_EDGE_LENGTH = B / V : it(d.idealEdgeLength) ? c.DEFAULT_EDGE_LENGTH = u.DEFAULT_EDGE_LENGTH = 50 : c.DEFAULT_EDGE_LENGTH = u.DEFAULT_EDGE_LENGTH = d.idealEdgeLength, c.MIN_REPULSION_DIST = u.MIN_REPULSION_DIST = u.DEFAULT_EDGE_LENGTH / 10, c.DEFAULT_RADIAL_SEPARATION = u.DEFAULT_EDGE_LENGTH);
|
|
3370
3370
|
}, m = function(C, P) {
|
|
3371
3371
|
P.fixedNodeConstraint && (C.constraints.fixedNodeConstraint = P.fixedNodeConstraint), P.alignmentConstraint && (C.constraints.alignmentConstraint = P.alignmentConstraint), P.relativePlacementConstraint && (C.constraints.relativePlacementConstraint = P.relativePlacementConstraint);
|
|
3372
3372
|
};
|
|
3373
3373
|
d.nestingFactor != null && (c.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = u.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = d.nestingFactor), d.gravity != null && (c.DEFAULT_GRAVITY_STRENGTH = u.DEFAULT_GRAVITY_STRENGTH = d.gravity), d.numIter != null && (c.MAX_ITERATIONS = u.MAX_ITERATIONS = d.numIter), d.gravityRange != null && (c.DEFAULT_GRAVITY_RANGE_FACTOR = u.DEFAULT_GRAVITY_RANGE_FACTOR = d.gravityRange), d.gravityCompound != null && (c.DEFAULT_COMPOUND_GRAVITY_STRENGTH = u.DEFAULT_COMPOUND_GRAVITY_STRENGTH = d.gravityCompound), d.gravityRangeCompound != null && (c.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = u.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = d.gravityRangeCompound), d.initialEnergyOnIncremental != null && (c.DEFAULT_COOLING_FACTOR_INCREMENTAL = u.DEFAULT_COOLING_FACTOR_INCREMENTAL = d.initialEnergyOnIncremental), d.tilingCompareBy != null && (c.TILING_COMPARE_BY = d.tilingCompareBy), d.quality == "proof" ? h.QUALITY = 2 : h.QUALITY = 0, c.NODE_DIMENSIONS_INCLUDE_LABELS = u.NODE_DIMENSIONS_INCLUDE_LABELS = h.NODE_DIMENSIONS_INCLUDE_LABELS = d.nodeDimensionsIncludeLabels, c.DEFAULT_INCREMENTAL = u.DEFAULT_INCREMENTAL = h.DEFAULT_INCREMENTAL = !d.randomize, c.ANIMATE = u.ANIMATE = h.ANIMATE = d.animate, c.TILE = d.tile, c.TILING_PADDING_VERTICAL = typeof d.tilingPaddingVertical == "function" ? d.tilingPaddingVertical.call() : d.tilingPaddingVertical, c.TILING_PADDING_HORIZONTAL = typeof d.tilingPaddingHorizontal == "function" ? d.tilingPaddingHorizontal.call() : d.tilingPaddingHorizontal, c.DEFAULT_INCREMENTAL = u.DEFAULT_INCREMENTAL = h.DEFAULT_INCREMENTAL = !0, c.PURE_INCREMENTAL = !d.randomize, h.DEFAULT_UNIFORM_LEAF_NODE_SIZES = d.uniformNodeDimensions, d.step == "transformed" && (c.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, c.ENFORCE_CONSTRAINTS = !1, c.APPLY_LAYOUT = !1), d.step == "enforced" && (c.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, c.ENFORCE_CONSTRAINTS = !0, c.APPLY_LAYOUT = !1), d.step == "cose" && (c.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, c.ENFORCE_CONSTRAINTS = !1, c.APPLY_LAYOUT = !0), d.step == "all" && (d.randomize ? c.TRANSFORM_ON_CONSTRAINT_HANDLING = !0 : c.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, c.ENFORCE_CONSTRAINTS = !0, c.APPLY_LAYOUT = !0), d.fixedNodeConstraint || d.alignmentConstraint || d.relativePlacementConstraint ? c.TREE_REDUCTION_ON_INCREMENTAL = !1 : c.TREE_REDUCTION_ON_INCREMENTAL = !0;
|
|
3374
3374
|
var O = new n(), L = O.newGraphManager();
|
|
3375
|
-
return
|
|
3375
|
+
return f(L.addRoot(), l.getTopMostNodes(Y), O, d), p(O, L, F), m(O, d), O.runLayout(), x;
|
|
3376
3376
|
};
|
|
3377
|
-
|
|
3377
|
+
i.exports = { coseLayout: N };
|
|
3378
3378
|
}
|
|
3379
3379
|
),
|
|
3380
3380
|
/***/
|
|
3381
3381
|
212: (
|
|
3382
3382
|
/***/
|
|
3383
|
-
(
|
|
3383
|
+
(i, r, e) => {
|
|
3384
3384
|
var l = /* @__PURE__ */ function() {
|
|
3385
3385
|
function y(I, w) {
|
|
3386
3386
|
for (var Y = 0; Y < w.length; Y++) {
|
|
@@ -3494,28 +3494,28 @@ function pi() {
|
|
|
3494
3494
|
value: function() {
|
|
3495
3495
|
var I = this, w = this.options, Y = w.cy, F = w.eles, H = [], z = [], q = void 0, x = [];
|
|
3496
3496
|
w.fixedNodeConstraint && (!Array.isArray(w.fixedNodeConstraint) || w.fixedNodeConstraint.length == 0) && (w.fixedNodeConstraint = void 0), w.alignmentConstraint && (w.alignmentConstraint.vertical && (!Array.isArray(w.alignmentConstraint.vertical) || w.alignmentConstraint.vertical.length == 0) && (w.alignmentConstraint.vertical = void 0), w.alignmentConstraint.horizontal && (!Array.isArray(w.alignmentConstraint.horizontal) || w.alignmentConstraint.horizontal.length == 0) && (w.alignmentConstraint.horizontal = void 0)), w.relativePlacementConstraint && (!Array.isArray(w.relativePlacementConstraint) || w.relativePlacementConstraint.length == 0) && (w.relativePlacementConstraint = void 0);
|
|
3497
|
-
var
|
|
3498
|
-
|
|
3497
|
+
var it = w.fixedNodeConstraint || w.alignmentConstraint || w.relativePlacementConstraint;
|
|
3498
|
+
it && (w.tile = !1, w.packComponents = !1);
|
|
3499
3499
|
var o = void 0, E = !1;
|
|
3500
3500
|
if (Y.layoutUtilities && w.packComponents && (o = Y.layoutUtilities("get"), o || (o = Y.layoutUtilities()), E = !0), F.nodes().length > 0)
|
|
3501
3501
|
if (E) {
|
|
3502
|
-
var
|
|
3503
|
-
if (q = t.connectComponents(Y, w.eles,
|
|
3502
|
+
var f = t.getTopMostNodes(w.eles.nodes());
|
|
3503
|
+
if (q = t.connectComponents(Y, w.eles, f), q.forEach(function(K) {
|
|
3504
3504
|
var nt = K.boundingBox();
|
|
3505
3505
|
x.push({ x: nt.x1 + nt.w / 2, y: nt.y1 + nt.h / 2 });
|
|
3506
3506
|
}), w.randomize && q.forEach(function(K) {
|
|
3507
3507
|
w.eles = K, H.push(h(w));
|
|
3508
3508
|
}), w.quality == "default" || w.quality == "proof") {
|
|
3509
|
-
var
|
|
3509
|
+
var p = Y.collection();
|
|
3510
3510
|
if (w.tile) {
|
|
3511
3511
|
var m = /* @__PURE__ */ new Map(), O = [], L = [], C = 0, P = { nodeIndexes: m, xCoords: O, yCoords: L }, S = [];
|
|
3512
3512
|
if (q.forEach(function(K, nt) {
|
|
3513
3513
|
K.edges().length == 0 && (K.nodes().forEach(function(mt, ht) {
|
|
3514
|
-
|
|
3514
|
+
p.merge(K.nodes()[ht]), mt.isParent() || (P.nodeIndexes.set(K.nodes()[ht].id(), C++), P.xCoords.push(K.nodes()[0].position().x), P.yCoords.push(K.nodes()[0].position().y));
|
|
3515
3515
|
}), S.push(nt));
|
|
3516
|
-
}),
|
|
3517
|
-
var B =
|
|
3518
|
-
x.push({ x: B.x1 + B.w / 2, y: B.y1 + B.h / 2 }), q.push(
|
|
3516
|
+
}), p.length > 1) {
|
|
3517
|
+
var B = p.boundingBox();
|
|
3518
|
+
x.push({ x: B.x1 + B.w / 2, y: B.y1 + B.h / 2 }), q.push(p), H.push(P);
|
|
3519
3519
|
for (var V = S.length - 1; V >= 0; V--)
|
|
3520
3520
|
q.splice(S[V], 1), H.splice(S[V], 1), x.splice(S[V], 1);
|
|
3521
3521
|
}
|
|
@@ -3630,15 +3630,15 @@ function pi() {
|
|
|
3630
3630
|
}
|
|
3631
3631
|
}]), y;
|
|
3632
3632
|
}();
|
|
3633
|
-
|
|
3633
|
+
i.exports = d;
|
|
3634
3634
|
}
|
|
3635
3635
|
),
|
|
3636
3636
|
/***/
|
|
3637
3637
|
657: (
|
|
3638
3638
|
/***/
|
|
3639
|
-
(
|
|
3639
|
+
(i, r, e) => {
|
|
3640
3640
|
var l = e(548), n = e(140).layoutBase.Matrix, v = e(140).layoutBase.SVD, t = function(s) {
|
|
3641
|
-
var h = s.cy, u = s.eles, c = u.nodes(), N = u.nodes(":parent"), d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), I = /* @__PURE__ */ new Map(), w = [], Y = [], F = [], H = [], z = [], q = [], x = [],
|
|
3641
|
+
var h = s.cy, u = s.eles, c = u.nodes(), N = u.nodes(":parent"), d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), I = /* @__PURE__ */ new Map(), w = [], Y = [], F = [], H = [], z = [], q = [], x = [], it = [], o = void 0, E = 1e8, f = 1e-9, p = s.piTol, m = s.samplingType, O = s.nodeSeparation, L = void 0, C = function() {
|
|
3642
3642
|
for (var dt = 0, M = 0, R = !1; M < L; ) {
|
|
3643
3643
|
dt = Math.floor(Math.random() * o), R = !1;
|
|
3644
3644
|
for (var W = 0; W < M; W++)
|
|
@@ -3652,21 +3652,21 @@ function pi() {
|
|
|
3652
3652
|
continue;
|
|
3653
3653
|
}
|
|
3654
3654
|
}, P = function(dt, M, R) {
|
|
3655
|
-
for (var W = [], J = 0, Z = 0,
|
|
3655
|
+
for (var W = [], J = 0, Z = 0, pt = 0, lt = void 0, tt = [], gt = 0, rt = 1, Nt = 0; Nt < o; Nt++)
|
|
3656
3656
|
tt[Nt] = E;
|
|
3657
3657
|
for (W[Z] = dt, tt[dt] = 0; Z >= J; ) {
|
|
3658
|
-
|
|
3659
|
-
for (var yt = w[
|
|
3660
|
-
lt = y.get(yt[Ct]), tt[lt] == E && (tt[lt] = tt[
|
|
3661
|
-
q[
|
|
3658
|
+
pt = W[J++];
|
|
3659
|
+
for (var yt = w[pt], Ct = 0; Ct < yt.length; Ct++)
|
|
3660
|
+
lt = y.get(yt[Ct]), tt[lt] == E && (tt[lt] = tt[pt] + 1, W[++Z] = lt);
|
|
3661
|
+
q[pt][M] = tt[pt] * O;
|
|
3662
3662
|
}
|
|
3663
3663
|
if (R) {
|
|
3664
3664
|
for (var ct = 0; ct < o; ct++)
|
|
3665
3665
|
q[ct][M] < z[ct] && (z[ct] = q[ct][M]);
|
|
3666
3666
|
for (var at = 0; at < o; at++)
|
|
3667
|
-
z[at] > gt && (gt = z[at],
|
|
3667
|
+
z[at] > gt && (gt = z[at], rt = at);
|
|
3668
3668
|
}
|
|
3669
|
-
return
|
|
3669
|
+
return rt;
|
|
3670
3670
|
}, S = function(dt) {
|
|
3671
3671
|
var M = void 0;
|
|
3672
3672
|
if (dt) {
|
|
@@ -3681,37 +3681,37 @@ function pi() {
|
|
|
3681
3681
|
P(H[J], J, dt);
|
|
3682
3682
|
}
|
|
3683
3683
|
for (var Z = 0; Z < o; Z++)
|
|
3684
|
-
for (var
|
|
3685
|
-
q[Z][
|
|
3684
|
+
for (var pt = 0; pt < L; pt++)
|
|
3685
|
+
q[Z][pt] *= q[Z][pt];
|
|
3686
3686
|
for (var lt = 0; lt < L; lt++)
|
|
3687
3687
|
x[lt] = [];
|
|
3688
3688
|
for (var tt = 0; tt < L; tt++)
|
|
3689
3689
|
for (var gt = 0; gt < L; gt++)
|
|
3690
3690
|
x[tt][gt] = q[H[gt]][tt];
|
|
3691
3691
|
}, B = function() {
|
|
3692
|
-
for (var dt = v.svd(x), M = dt.S, R = dt.U, W = dt.V, J = M[0] * M[0] * M[0], Z = [],
|
|
3693
|
-
Z[
|
|
3692
|
+
for (var dt = v.svd(x), M = dt.S, R = dt.U, W = dt.V, J = M[0] * M[0] * M[0], Z = [], pt = 0; pt < L; pt++) {
|
|
3693
|
+
Z[pt] = [];
|
|
3694
3694
|
for (var lt = 0; lt < L; lt++)
|
|
3695
|
-
Z[
|
|
3695
|
+
Z[pt][lt] = 0, pt == lt && (Z[pt][lt] = M[pt] / (M[pt] * M[pt] + J / (M[pt] * M[pt])));
|
|
3696
3696
|
}
|
|
3697
|
-
|
|
3697
|
+
it = n.multMat(n.multMat(W, Z), n.transpose(R));
|
|
3698
3698
|
}, V = function() {
|
|
3699
|
-
for (var dt = void 0, M = void 0, R = [], W = [], J = [], Z = [],
|
|
3700
|
-
R[
|
|
3699
|
+
for (var dt = void 0, M = void 0, R = [], W = [], J = [], Z = [], pt = 0; pt < o; pt++)
|
|
3700
|
+
R[pt] = Math.random(), W[pt] = Math.random();
|
|
3701
3701
|
R = n.normalize(R), W = n.normalize(W);
|
|
3702
|
-
for (var lt =
|
|
3703
|
-
for (var
|
|
3704
|
-
J[
|
|
3705
|
-
if (R = n.multGamma(n.multL(n.multGamma(J), q,
|
|
3702
|
+
for (var lt = f, tt = f, gt = void 0; ; ) {
|
|
3703
|
+
for (var rt = 0; rt < o; rt++)
|
|
3704
|
+
J[rt] = R[rt];
|
|
3705
|
+
if (R = n.multGamma(n.multL(n.multGamma(J), q, it)), dt = n.dotProduct(J, R), R = n.normalize(R), lt = n.dotProduct(J, R), gt = Math.abs(lt / tt), gt <= 1 + p && gt >= 1)
|
|
3706
3706
|
break;
|
|
3707
3707
|
tt = lt;
|
|
3708
3708
|
}
|
|
3709
3709
|
for (var Nt = 0; Nt < o; Nt++)
|
|
3710
3710
|
J[Nt] = R[Nt];
|
|
3711
|
-
for (tt =
|
|
3711
|
+
for (tt = f; ; ) {
|
|
3712
3712
|
for (var yt = 0; yt < o; yt++)
|
|
3713
3713
|
Z[yt] = W[yt];
|
|
3714
|
-
if (Z = n.minusOp(Z, n.multCons(J, n.dotProduct(J, Z))), W = n.multGamma(n.multL(n.multGamma(Z), q,
|
|
3714
|
+
if (Z = n.minusOp(Z, n.multCons(J, n.dotProduct(J, Z))), W = n.multGamma(n.multL(n.multGamma(Z), q, it)), M = n.dotProduct(Z, W), W = n.normalize(W), lt = n.dotProduct(Z, W), gt = Math.abs(lt / tt), gt <= 1 + p && gt >= 1)
|
|
3715
3715
|
break;
|
|
3716
3716
|
tt = lt;
|
|
3717
3717
|
}
|
|
@@ -3783,7 +3783,7 @@ function pi() {
|
|
|
3783
3783
|
for (var wt = 0; wt < o; wt++)
|
|
3784
3784
|
q[wt] = [];
|
|
3785
3785
|
for (var zt = 0; zt < L; zt++)
|
|
3786
|
-
|
|
3786
|
+
it[zt] = [];
|
|
3787
3787
|
return s.quality == "draft" || s.step == "all" ? (S(m), B(), V(), Tt = { nodeIndexes: y, xCoords: Y, yCoords: F }) : (y.forEach(function(dt, M) {
|
|
3788
3788
|
Y.push(h.getElementById(M).position("x")), F.push(h.getElementById(M).position("y"));
|
|
3789
3789
|
}), Tt = { nodeIndexes: y, xCoords: Y, yCoords: F }), Tt;
|
|
@@ -3796,33 +3796,33 @@ function pi() {
|
|
|
3796
3796
|
return Tt = { nodeIndexes: y, xCoords: Y, yCoords: F }, Tt;
|
|
3797
3797
|
}
|
|
3798
3798
|
};
|
|
3799
|
-
|
|
3799
|
+
i.exports = { spectralLayout: t };
|
|
3800
3800
|
}
|
|
3801
3801
|
),
|
|
3802
3802
|
/***/
|
|
3803
3803
|
579: (
|
|
3804
3804
|
/***/
|
|
3805
|
-
(
|
|
3805
|
+
(i, r, e) => {
|
|
3806
3806
|
var l = e(212), n = function(v) {
|
|
3807
3807
|
v && v("layout", "fcose", l);
|
|
3808
3808
|
};
|
|
3809
|
-
typeof cytoscape < "u" && n(cytoscape),
|
|
3809
|
+
typeof cytoscape < "u" && n(cytoscape), i.exports = n;
|
|
3810
3810
|
}
|
|
3811
3811
|
),
|
|
3812
3812
|
/***/
|
|
3813
3813
|
140: (
|
|
3814
3814
|
/***/
|
|
3815
|
-
(
|
|
3816
|
-
|
|
3815
|
+
(i) => {
|
|
3816
|
+
i.exports = _;
|
|
3817
3817
|
}
|
|
3818
3818
|
)
|
|
3819
3819
|
/******/
|
|
3820
3820
|
}, T = {};
|
|
3821
|
-
function g(
|
|
3822
|
-
var
|
|
3823
|
-
if (
|
|
3824
|
-
return
|
|
3825
|
-
var e = T[
|
|
3821
|
+
function g(i) {
|
|
3822
|
+
var r = T[i];
|
|
3823
|
+
if (r !== void 0)
|
|
3824
|
+
return r.exports;
|
|
3825
|
+
var e = T[i] = {
|
|
3826
3826
|
/******/
|
|
3827
3827
|
// no module.id needed
|
|
3828
3828
|
/******/
|
|
@@ -3831,17 +3831,17 @@ function pi() {
|
|
|
3831
3831
|
exports: {}
|
|
3832
3832
|
/******/
|
|
3833
3833
|
};
|
|
3834
|
-
return k[
|
|
3834
|
+
return k[i](e, e.exports, g), e.exports;
|
|
3835
3835
|
}
|
|
3836
3836
|
var a = g(579);
|
|
3837
3837
|
return a;
|
|
3838
3838
|
})()
|
|
3839
3839
|
);
|
|
3840
3840
|
});
|
|
3841
|
-
}(
|
|
3841
|
+
}(pe)), pe.exports;
|
|
3842
3842
|
}
|
|
3843
|
-
var
|
|
3844
|
-
const
|
|
3843
|
+
var pr = fr();
|
|
3844
|
+
const vr = /* @__PURE__ */ or(pr);
|
|
3845
3845
|
var Ce = {
|
|
3846
3846
|
L: "left",
|
|
3847
3847
|
R: "right",
|
|
@@ -3857,7 +3857,7 @@ var Ce = {
|
|
|
3857
3857
|
R: /* @__PURE__ */ ot((A, U) => A - 2, "R"),
|
|
3858
3858
|
T: /* @__PURE__ */ ot((A, U) => A - U + 2, "T"),
|
|
3859
3859
|
B: /* @__PURE__ */ ot((A, U) => A - 2, "B")
|
|
3860
|
-
},
|
|
3860
|
+
}, mr = /* @__PURE__ */ ot(function(A) {
|
|
3861
3861
|
return Vt(A) ? A === "L" ? "R" : "L" : A === "T" ? "B" : "T";
|
|
3862
3862
|
}, "getOppositeArchitectureDirection"), Oe = /* @__PURE__ */ ot(function(A) {
|
|
3863
3863
|
const U = A;
|
|
@@ -3871,24 +3871,24 @@ var Ce = {
|
|
|
3871
3871
|
}, "isArchitectureDirectionY"), Ge = /* @__PURE__ */ ot(function(A, U) {
|
|
3872
3872
|
const _ = Vt(A) && jt(U), k = jt(A) && Vt(U);
|
|
3873
3873
|
return _ || k;
|
|
3874
|
-
}, "isArchitectureDirectionXY"),
|
|
3874
|
+
}, "isArchitectureDirectionXY"), yr = /* @__PURE__ */ ot(function(A) {
|
|
3875
3875
|
const U = A[0], _ = A[1], k = Vt(U) && jt(_), T = jt(U) && Vt(_);
|
|
3876
3876
|
return k || T;
|
|
3877
|
-
}, "isArchitecturePairXY"),
|
|
3877
|
+
}, "isArchitecturePairXY"), Er = /* @__PURE__ */ ot(function(A) {
|
|
3878
3878
|
return A !== "LL" && A !== "RR" && A !== "TT" && A !== "BB";
|
|
3879
3879
|
}, "isValidArchitectureDirectionPair"), ye = /* @__PURE__ */ ot(function(A, U) {
|
|
3880
3880
|
const _ = `${A}${U}`;
|
|
3881
|
-
return
|
|
3882
|
-
}, "getArchitectureDirectionPair"),
|
|
3881
|
+
return Er(_) ? _ : void 0;
|
|
3882
|
+
}, "getArchitectureDirectionPair"), Nr = /* @__PURE__ */ ot(function([A, U], _) {
|
|
3883
3883
|
const k = _[0], T = _[1];
|
|
3884
3884
|
return Vt(k) ? jt(T) ? [A + (k === "L" ? -1 : 1), U + (T === "T" ? 1 : -1)] : [A + (k === "L" ? -1 : 1), U] : Vt(T) ? [A + (T === "L" ? 1 : -1), U + (k === "T" ? 1 : -1)] : [A, U + (k === "T" ? 1 : -1)];
|
|
3885
|
-
}, "shiftPositionByArchitectureDirectionPair"),
|
|
3885
|
+
}, "shiftPositionByArchitectureDirectionPair"), Tr = /* @__PURE__ */ ot(function(A) {
|
|
3886
3886
|
return A === "LT" || A === "TL" ? [1, 1] : A === "BL" || A === "LB" ? [1, -1] : A === "BR" || A === "RB" ? [-1, -1] : [-1, 1];
|
|
3887
|
-
}, "getArchitectureDirectionXYFactors"),
|
|
3887
|
+
}, "getArchitectureDirectionXYFactors"), Ar = /* @__PURE__ */ ot(function(A) {
|
|
3888
3888
|
return A.type === "service";
|
|
3889
|
-
}, "isArchitectureService"),
|
|
3889
|
+
}, "isArchitectureService"), wr = /* @__PURE__ */ ot(function(A) {
|
|
3890
3890
|
return A.type === "junction";
|
|
3891
|
-
}, "isArchitectureJunction"), Fe = /* @__PURE__ */ ot((A) => A.data(), "edgeData"),
|
|
3891
|
+
}, "isArchitectureJunction"), Fe = /* @__PURE__ */ ot((A) => A.data(), "edgeData"), re = /* @__PURE__ */ ot((A) => A.data(), "nodeData"), Pe = rr.architecture, Et = new sr(() => ({
|
|
3892
3892
|
nodes: {},
|
|
3893
3893
|
groups: {},
|
|
3894
3894
|
edges: [],
|
|
@@ -3896,9 +3896,9 @@ var Ce = {
|
|
|
3896
3896
|
config: Pe,
|
|
3897
3897
|
dataStructures: void 0,
|
|
3898
3898
|
elements: {}
|
|
3899
|
-
})),
|
|
3900
|
-
Et.reset(),
|
|
3901
|
-
}, "clear"),
|
|
3899
|
+
})), Ir = /* @__PURE__ */ ot(() => {
|
|
3900
|
+
Et.reset(), tr();
|
|
3901
|
+
}, "clear"), Mr = /* @__PURE__ */ ot(function({
|
|
3902
3902
|
id: A,
|
|
3903
3903
|
icon: U,
|
|
3904
3904
|
in: _,
|
|
@@ -3928,14 +3928,14 @@ var Ce = {
|
|
|
3928
3928
|
edges: [],
|
|
3929
3929
|
in: _
|
|
3930
3930
|
};
|
|
3931
|
-
}, "addService"),
|
|
3931
|
+
}, "addService"), _r = /* @__PURE__ */ ot(() => Object.values(Et.records.nodes).filter(Ar), "getServices"), Lr = /* @__PURE__ */ ot(function({ id: A, in: U }) {
|
|
3932
3932
|
Et.records.registeredIds[A] = "node", Et.records.nodes[A] = {
|
|
3933
3933
|
id: A,
|
|
3934
3934
|
type: "junction",
|
|
3935
3935
|
edges: [],
|
|
3936
3936
|
in: U
|
|
3937
3937
|
};
|
|
3938
|
-
}, "addJunction"),
|
|
3938
|
+
}, "addJunction"), xr = /* @__PURE__ */ ot(() => Object.values(Et.records.nodes).filter(wr), "getJunctions"), Cr = /* @__PURE__ */ ot(() => Object.values(Et.records.nodes), "getNodes"), Dr = /* @__PURE__ */ ot((A) => Et.records.nodes[A], "getNode"), Or = /* @__PURE__ */ ot(function({ id: A, icon: U, in: _, title: k }) {
|
|
3939
3939
|
if (Et.records.registeredIds[A] !== void 0)
|
|
3940
3940
|
throw new Error(
|
|
3941
3941
|
`The group id [${A}] is already in use by another ${Et.records.registeredIds[A]}`
|
|
@@ -3956,7 +3956,7 @@ var Ce = {
|
|
|
3956
3956
|
title: k,
|
|
3957
3957
|
in: _
|
|
3958
3958
|
};
|
|
3959
|
-
}, "addGroup"),
|
|
3959
|
+
}, "addGroup"), Rr = /* @__PURE__ */ ot(() => Object.values(Et.records.groups), "getGroups"), br = /* @__PURE__ */ ot(function({
|
|
3960
3960
|
lhsId: A,
|
|
3961
3961
|
rhsId: U,
|
|
3962
3962
|
lhsDir: _,
|
|
@@ -3964,8 +3964,8 @@ var Ce = {
|
|
|
3964
3964
|
lhsInto: T,
|
|
3965
3965
|
rhsInto: g,
|
|
3966
3966
|
lhsGroup: a,
|
|
3967
|
-
rhsGroup:
|
|
3968
|
-
title:
|
|
3967
|
+
rhsGroup: i,
|
|
3968
|
+
title: r
|
|
3969
3969
|
}) {
|
|
3970
3970
|
if (!Oe(_))
|
|
3971
3971
|
throw new Error(
|
|
@@ -3988,7 +3988,7 @@ var Ce = {
|
|
|
3988
3988
|
throw new Error(
|
|
3989
3989
|
`The left-hand id [${A}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
|
|
3990
3990
|
);
|
|
3991
|
-
if (
|
|
3991
|
+
if (i && e && l && e == l)
|
|
3992
3992
|
throw new Error(
|
|
3993
3993
|
`The right-hand id [${U}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
|
|
3994
3994
|
);
|
|
@@ -4000,14 +4000,14 @@ var Ce = {
|
|
|
4000
4000
|
rhsId: U,
|
|
4001
4001
|
rhsDir: k,
|
|
4002
4002
|
rhsInto: g,
|
|
4003
|
-
rhsGroup:
|
|
4004
|
-
title:
|
|
4003
|
+
rhsGroup: i,
|
|
4004
|
+
title: r
|
|
4005
4005
|
};
|
|
4006
4006
|
Et.records.edges.push(n), Et.records.nodes[A] && Et.records.nodes[U] && (Et.records.nodes[A].edges.push(Et.records.edges[Et.records.edges.length - 1]), Et.records.nodes[U].edges.push(Et.records.edges[Et.records.edges.length - 1]));
|
|
4007
|
-
}, "addEdge"),
|
|
4007
|
+
}, "addEdge"), Gr = /* @__PURE__ */ ot(() => Et.records.edges, "getEdges"), Fr = /* @__PURE__ */ ot(() => {
|
|
4008
4008
|
if (Et.records.dataStructures === void 0) {
|
|
4009
|
-
const A = Object.entries(Et.records.nodes).reduce((a, [
|
|
4010
|
-
if (l.lhsId ===
|
|
4009
|
+
const A = Object.entries(Et.records.nodes).reduce((a, [i, r]) => (a[i] = r.edges.reduce((e, l) => {
|
|
4010
|
+
if (l.lhsId === i) {
|
|
4011
4011
|
const n = ye(l.lhsDir, l.rhsDir);
|
|
4012
4012
|
n && (e[n] = l.rhsId);
|
|
4013
4013
|
} else {
|
|
@@ -4016,24 +4016,24 @@ var Ce = {
|
|
|
4016
4016
|
}
|
|
4017
4017
|
return e;
|
|
4018
4018
|
}, {}), a), {}), U = Object.keys(A)[0], _ = { [U]: 1 }, k = Object.keys(A).reduce(
|
|
4019
|
-
(a,
|
|
4019
|
+
(a, i) => i === U ? a : { ...a, [i]: 1 },
|
|
4020
4020
|
{}
|
|
4021
4021
|
), T = /* @__PURE__ */ ot((a) => {
|
|
4022
|
-
const
|
|
4023
|
-
for (;
|
|
4024
|
-
const e =
|
|
4022
|
+
const i = { [a]: [0, 0] }, r = [a];
|
|
4023
|
+
for (; r.length > 0; ) {
|
|
4024
|
+
const e = r.shift();
|
|
4025
4025
|
if (e) {
|
|
4026
4026
|
_[e] = 1, delete k[e];
|
|
4027
|
-
const l = A[e], [n, v] =
|
|
4027
|
+
const l = A[e], [n, v] = i[e];
|
|
4028
4028
|
Object.entries(l).forEach(([t, s]) => {
|
|
4029
|
-
_[s] || (
|
|
4029
|
+
_[s] || (i[s] = Nr(
|
|
4030
4030
|
[n, v],
|
|
4031
4031
|
t
|
|
4032
|
-
),
|
|
4032
|
+
), r.push(s));
|
|
4033
4033
|
});
|
|
4034
4034
|
}
|
|
4035
4035
|
}
|
|
4036
|
-
return
|
|
4036
|
+
return i;
|
|
4037
4037
|
}, "BFS"), g = [T(U)];
|
|
4038
4038
|
for (; Object.keys(k).length > 0; )
|
|
4039
4039
|
g.push(T(Object.keys(k)[0]));
|
|
@@ -4043,43 +4043,43 @@ var Ce = {
|
|
|
4043
4043
|
};
|
|
4044
4044
|
}
|
|
4045
4045
|
return Et.records.dataStructures;
|
|
4046
|
-
}, "getDataStructures"),
|
|
4046
|
+
}, "getDataStructures"), Pr = /* @__PURE__ */ ot((A, U) => {
|
|
4047
4047
|
Et.records.elements[A] = U;
|
|
4048
|
-
}, "setElementForId"),
|
|
4049
|
-
clear:
|
|
4050
|
-
setDiagramTitle:
|
|
4051
|
-
getDiagramTitle:
|
|
4052
|
-
setAccTitle:
|
|
4053
|
-
getAccTitle:
|
|
4054
|
-
setAccDescription:
|
|
4055
|
-
getAccDescription:
|
|
4056
|
-
addService:
|
|
4057
|
-
getServices:
|
|
4058
|
-
addJunction:
|
|
4059
|
-
getJunctions:
|
|
4060
|
-
getNodes:
|
|
4061
|
-
getNode:
|
|
4062
|
-
addGroup:
|
|
4063
|
-
getGroups:
|
|
4064
|
-
addEdge:
|
|
4065
|
-
getEdges:
|
|
4066
|
-
setElementForId:
|
|
4067
|
-
getElementById:
|
|
4068
|
-
getDataStructures:
|
|
4048
|
+
}, "setElementForId"), Sr = /* @__PURE__ */ ot((A) => Et.records.elements[A], "getElementById"), se = {
|
|
4049
|
+
clear: Ir,
|
|
4050
|
+
setDiagramTitle: Ze,
|
|
4051
|
+
getDiagramTitle: Qe,
|
|
4052
|
+
setAccTitle: qe,
|
|
4053
|
+
getAccTitle: je,
|
|
4054
|
+
setAccDescription: $e,
|
|
4055
|
+
getAccDescription: We,
|
|
4056
|
+
addService: Mr,
|
|
4057
|
+
getServices: _r,
|
|
4058
|
+
addJunction: Lr,
|
|
4059
|
+
getJunctions: xr,
|
|
4060
|
+
getNodes: Cr,
|
|
4061
|
+
getNode: Dr,
|
|
4062
|
+
addGroup: Or,
|
|
4063
|
+
getGroups: Rr,
|
|
4064
|
+
addEdge: br,
|
|
4065
|
+
getEdges: Gr,
|
|
4066
|
+
setElementForId: Pr,
|
|
4067
|
+
getElementById: Sr,
|
|
4068
|
+
getDataStructures: Fr
|
|
4069
4069
|
};
|
|
4070
4070
|
function Pt(A) {
|
|
4071
4071
|
const U = he().architecture;
|
|
4072
4072
|
return U != null && U[A] ? U[A] : Pe[A];
|
|
4073
4073
|
}
|
|
4074
4074
|
ot(Pt, "getConfigField");
|
|
4075
|
-
var
|
|
4076
|
-
|
|
4077
|
-
}, "populateDb"),
|
|
4075
|
+
var Yr = /* @__PURE__ */ ot((A, U) => {
|
|
4076
|
+
ar(A, U), A.groups.map(U.addGroup), A.services.map((_) => U.addService({ ..._, type: "service" })), A.junctions.map((_) => U.addJunction({ ..._, type: "junction" })), A.edges.map(U.addEdge);
|
|
4077
|
+
}, "populateDb"), kr = {
|
|
4078
4078
|
parse: /* @__PURE__ */ ot(async (A) => {
|
|
4079
|
-
const U = await
|
|
4080
|
-
Re.debug(U),
|
|
4079
|
+
const U = await hr("architecture", A);
|
|
4080
|
+
Re.debug(U), Yr(U, se);
|
|
4081
4081
|
}, "parse")
|
|
4082
|
-
},
|
|
4082
|
+
}, Hr = /* @__PURE__ */ ot((A) => `
|
|
4083
4083
|
.edge {
|
|
4084
4084
|
stroke-width: ${A.archEdgeWidth};
|
|
4085
4085
|
stroke: ${A.archEdgeColor};
|
|
@@ -4110,7 +4110,7 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4110
4110
|
display: -webkit-box;
|
|
4111
4111
|
-webkit-box-orient: vertical;
|
|
4112
4112
|
}
|
|
4113
|
-
`, "getStyles"),
|
|
4113
|
+
`, "getStyles"), Ur = Hr, ee = /* @__PURE__ */ ot((A) => `<g><rect width="80" height="80" style="fill: #087ebf; stroke-width: 0px;"/>${A}</g>`, "wrapIcon"), ne = {
|
|
4114
4114
|
prefix: "mermaid-architecture",
|
|
4115
4115
|
height: 80,
|
|
4116
4116
|
width: 80,
|
|
@@ -4140,16 +4140,16 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4140
4140
|
'<path d="m65,47.5c0,2.76-2.24,5-5,5H20c-2.76,0-5-2.24-5-5,0-1.87,1.03-3.51,2.56-4.36-.04-.21-.06-.42-.06-.64,0-2.6,2.48-4.74,5.65-4.97,1.65-4.51,6.34-7.76,11.85-7.76.86,0,1.69.08,2.5.23,2.09-1.57,4.69-2.5,7.5-2.5,6.1,0,11.19,4.38,12.28,10.17,2.14.56,3.72,2.51,3.72,4.83,0,.03,0,.07-.01.1,2.29.46,4.01,2.48,4.01,4.9Z" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/>'
|
|
4141
4141
|
)
|
|
4142
4142
|
},
|
|
4143
|
-
unknown:
|
|
4143
|
+
unknown: nr,
|
|
4144
4144
|
blank: {
|
|
4145
4145
|
body: ee("")
|
|
4146
4146
|
}
|
|
4147
4147
|
}
|
|
4148
|
-
},
|
|
4148
|
+
}, Xr = /* @__PURE__ */ ot(async function(A, U) {
|
|
4149
4149
|
const _ = Pt("padding"), k = Pt("iconSize"), T = k / 2, g = k / 6, a = g / 2;
|
|
4150
4150
|
await Promise.all(
|
|
4151
|
-
U.edges().map(async (
|
|
4152
|
-
var
|
|
4151
|
+
U.edges().map(async (i) => {
|
|
4152
|
+
var r, e;
|
|
4153
4153
|
const {
|
|
4154
4154
|
source: l,
|
|
4155
4155
|
sourceDir: n,
|
|
@@ -4160,12 +4160,12 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4160
4160
|
targetArrow: u,
|
|
4161
4161
|
targetGroup: c,
|
|
4162
4162
|
label: N
|
|
4163
|
-
} = Fe(
|
|
4164
|
-
let { x: d, y } =
|
|
4165
|
-
const { x: I, y: w } =
|
|
4166
|
-
let { x: Y, y: F } =
|
|
4163
|
+
} = Fe(i);
|
|
4164
|
+
let { x: d, y } = i[0].sourceEndpoint();
|
|
4165
|
+
const { x: I, y: w } = i[0].midpoint();
|
|
4166
|
+
let { x: Y, y: F } = i[0].targetEndpoint();
|
|
4167
4167
|
const H = _ + 4;
|
|
4168
|
-
if (t && (Vt(n) ? d += n === "L" ? -H : H : y += n === "T" ? -H : H + 18), c && (Vt(h) ? Y += h === "L" ? -H : H : F += h === "T" ? -H : H + 18), !t && ((
|
|
4168
|
+
if (t && (Vt(n) ? d += n === "L" ? -H : H : y += n === "T" ? -H : H + 18), c && (Vt(h) ? Y += h === "L" ? -H : H : F += h === "T" ? -H : H + 18), !t && ((r = se.getNode(l)) == null ? void 0 : r.type) === "junction" && (Vt(n) ? d += n === "L" ? T : -T : y += n === "T" ? T : -T), !c && ((e = se.getNode(s)) == null ? void 0 : e.type) === "junction" && (Vt(h) ? Y += h === "L" ? T : -T : F += h === "T" ? T : -T), i[0]._private.rscratch) {
|
|
4169
4169
|
const z = A.insert("g");
|
|
4170
4170
|
if (z.insert("path").attr("d", `M ${d},${y} L ${I},${w} L${Y},${F} `).attr("class", "edge"), v) {
|
|
4171
4171
|
const q = Vt(n) ? ae[n](d, g) : d - a, x = jt(n) ? ae[n](y, g) : y - a;
|
|
@@ -4179,9 +4179,9 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4179
4179
|
const q = Ge(n, h) ? "XY" : Vt(n) ? "X" : "Y";
|
|
4180
4180
|
let x = 0;
|
|
4181
4181
|
q === "X" ? x = Math.abs(d - Y) : q === "Y" ? x = Math.abs(y - F) / 1.5 : x = Math.abs(d - Y) / 2;
|
|
4182
|
-
const
|
|
4182
|
+
const it = z.append("g");
|
|
4183
4183
|
if (await Ee(
|
|
4184
|
-
|
|
4184
|
+
it,
|
|
4185
4185
|
N,
|
|
4186
4186
|
{
|
|
4187
4187
|
useHtmlLabels: !1,
|
|
@@ -4189,22 +4189,22 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4189
4189
|
classes: "architecture-service-label"
|
|
4190
4190
|
},
|
|
4191
4191
|
he()
|
|
4192
|
-
),
|
|
4193
|
-
|
|
4192
|
+
), it.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), q === "X")
|
|
4193
|
+
it.attr("transform", "translate(" + I + ", " + w + ")");
|
|
4194
4194
|
else if (q === "Y")
|
|
4195
|
-
|
|
4195
|
+
it.attr("transform", "translate(" + I + ", " + w + ") rotate(-90)");
|
|
4196
4196
|
else if (q === "XY") {
|
|
4197
4197
|
const o = ye(n, h);
|
|
4198
|
-
if (o &&
|
|
4199
|
-
const E =
|
|
4200
|
-
|
|
4201
|
-
const m =
|
|
4202
|
-
|
|
4198
|
+
if (o && yr(o)) {
|
|
4199
|
+
const E = it.node().getBoundingClientRect(), [f, p] = Tr(o);
|
|
4200
|
+
it.attr("dominant-baseline", "auto").attr("transform", `rotate(${-1 * f * p * 45})`);
|
|
4201
|
+
const m = it.node().getBoundingClientRect();
|
|
4202
|
+
it.attr(
|
|
4203
4203
|
"transform",
|
|
4204
4204
|
`
|
|
4205
4205
|
translate(${I}, ${w - E.height / 2})
|
|
4206
|
-
translate(${
|
|
4207
|
-
rotate(${-1 *
|
|
4206
|
+
translate(${f * m.width / 2}, ${p * m.height / 2})
|
|
4207
|
+
rotate(${-1 * f * p * 45}, 0, ${E.height / 2})
|
|
4208
4208
|
`
|
|
4209
4209
|
);
|
|
4210
4210
|
}
|
|
@@ -4213,20 +4213,20 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4213
4213
|
}
|
|
4214
4214
|
})
|
|
4215
4215
|
);
|
|
4216
|
-
}, "drawEdges"),
|
|
4216
|
+
}, "drawEdges"), Vr = /* @__PURE__ */ ot(async function(A, U) {
|
|
4217
4217
|
const _ = Pt("padding") * 0.75, k = Pt("fontSize"), T = Pt("iconSize") / 2;
|
|
4218
4218
|
await Promise.all(
|
|
4219
4219
|
U.nodes().map(async (g) => {
|
|
4220
|
-
const a =
|
|
4220
|
+
const a = re(g);
|
|
4221
4221
|
if (a.type === "group") {
|
|
4222
|
-
const { h:
|
|
4223
|
-
A.append("rect").attr("x", e + T).attr("y", l + T).attr("width",
|
|
4222
|
+
const { h: i, w: r, x1: e, y1: l } = g.boundingBox();
|
|
4223
|
+
A.append("rect").attr("x", e + T).attr("y", l + T).attr("width", r).attr("height", i).attr("class", "node-bkg");
|
|
4224
4224
|
const n = A.append("g");
|
|
4225
4225
|
let v = e, t = l;
|
|
4226
4226
|
if (a.icon) {
|
|
4227
4227
|
const s = n.append("g");
|
|
4228
4228
|
s.html(
|
|
4229
|
-
`<g>${await
|
|
4229
|
+
`<g>${await fe(a.icon, { height: _, width: _, fallbackPrefix: ne.prefix })}</g>`
|
|
4230
4230
|
), s.attr(
|
|
4231
4231
|
"transform",
|
|
4232
4232
|
"translate(" + (v + T + 1) + ", " + (t + T + 1) + ")"
|
|
@@ -4239,7 +4239,7 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4239
4239
|
a.label,
|
|
4240
4240
|
{
|
|
4241
4241
|
useHtmlLabels: !1,
|
|
4242
|
-
width:
|
|
4242
|
+
width: r,
|
|
4243
4243
|
classes: "architecture-service-label"
|
|
4244
4244
|
},
|
|
4245
4245
|
he()
|
|
@@ -4251,7 +4251,7 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4251
4251
|
}
|
|
4252
4252
|
})
|
|
4253
4253
|
);
|
|
4254
|
-
}, "drawGroups"),
|
|
4254
|
+
}, "drawGroups"), zr = /* @__PURE__ */ ot(async function(A, U, _) {
|
|
4255
4255
|
for (const k of _) {
|
|
4256
4256
|
const T = U.append("g"), g = Pt("iconSize");
|
|
4257
4257
|
if (k.title) {
|
|
@@ -4270,11 +4270,11 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4270
4270
|
const a = T.append("g");
|
|
4271
4271
|
if (k.icon)
|
|
4272
4272
|
a.html(
|
|
4273
|
-
`<g>${await
|
|
4273
|
+
`<g>${await fe(k.icon, { height: g, width: g, fallbackPrefix: ne.prefix })}</g>`
|
|
4274
4274
|
);
|
|
4275
4275
|
else if (k.iconText) {
|
|
4276
4276
|
a.html(
|
|
4277
|
-
`<g>${await
|
|
4277
|
+
`<g>${await fe("blank", { height: g, width: g, fallbackPrefix: ne.prefix })}</g>`
|
|
4278
4278
|
);
|
|
4279
4279
|
const e = a.append("g").append("foreignObject").attr("width", g).attr("height", g).append("div").attr("class", "node-icon-text").attr("style", `height: ${g}px;`).append("div").html(k.iconText), l = parseInt(
|
|
4280
4280
|
window.getComputedStyle(e.node(), null).getPropertyValue("font-size").replace(/\D/g, "")
|
|
@@ -4286,25 +4286,25 @@ var Yi = /* @__PURE__ */ ot((A, U) => {
|
|
|
4286
4286
|
`M0 ${g} v${-g} q0,-5 5,-5 h${g} q5,0 5,5 v${g} H0 Z`
|
|
4287
4287
|
);
|
|
4288
4288
|
T.attr("class", "architecture-service");
|
|
4289
|
-
const { width:
|
|
4290
|
-
k.width =
|
|
4289
|
+
const { width: i, height: r } = T._groups[0][0].getBBox();
|
|
4290
|
+
k.width = i, k.height = r, A.setElementForId(k.id, T);
|
|
4291
4291
|
}
|
|
4292
4292
|
return 0;
|
|
4293
|
-
}, "drawServices"),
|
|
4293
|
+
}, "drawServices"), Br = /* @__PURE__ */ ot(function(A, U, _) {
|
|
4294
4294
|
_.forEach((k) => {
|
|
4295
4295
|
const T = U.append("g"), g = Pt("iconSize");
|
|
4296
4296
|
T.append("g").append("rect").attr("id", "node-" + k.id).attr("fill-opacity", "0").attr("width", g).attr("height", g), T.attr("class", "architecture-junction");
|
|
4297
|
-
const { width: a, height:
|
|
4298
|
-
T.width = a, T.height =
|
|
4297
|
+
const { width: a, height: i } = T._groups[0][0].getBBox();
|
|
4298
|
+
T.width = a, T.height = i, A.setElementForId(k.id, T);
|
|
4299
4299
|
});
|
|
4300
4300
|
}, "drawJunctions");
|
|
4301
|
-
|
|
4301
|
+
ir([
|
|
4302
4302
|
{
|
|
4303
4303
|
name: ne.prefix,
|
|
4304
4304
|
icons: ne
|
|
4305
4305
|
}
|
|
4306
4306
|
]);
|
|
4307
|
-
be.use(
|
|
4307
|
+
be.use(vr);
|
|
4308
4308
|
function Se(A, U) {
|
|
4309
4309
|
A.forEach((_) => {
|
|
4310
4310
|
U.add({
|
|
@@ -4341,7 +4341,7 @@ function Ye(A, U) {
|
|
|
4341
4341
|
ot(Ye, "addJunctions");
|
|
4342
4342
|
function ke(A, U) {
|
|
4343
4343
|
U.nodes().map((_) => {
|
|
4344
|
-
const k =
|
|
4344
|
+
const k = re(_);
|
|
4345
4345
|
k.type !== "group" && (k.x = _.position().x, k.y = _.position().y, A.getElementById(k.id).attr("transform", "translate(" + (k.x || 0) + "," + (k.y || 0) + ")"));
|
|
4346
4346
|
});
|
|
4347
4347
|
}
|
|
@@ -4364,17 +4364,17 @@ function He(A, U) {
|
|
|
4364
4364
|
ot(He, "addGroups");
|
|
4365
4365
|
function Ue(A, U) {
|
|
4366
4366
|
A.forEach((_) => {
|
|
4367
|
-
const { lhsId: k, rhsId: T, lhsInto: g, lhsGroup: a, rhsInto:
|
|
4367
|
+
const { lhsId: k, rhsId: T, lhsInto: g, lhsGroup: a, rhsInto: i, lhsDir: r, rhsDir: e, rhsGroup: l, title: n } = _, v = Ge(_.lhsDir, _.rhsDir) ? "segments" : "straight", t = {
|
|
4368
4368
|
id: `${k}-${T}`,
|
|
4369
4369
|
label: n,
|
|
4370
4370
|
source: k,
|
|
4371
|
-
sourceDir:
|
|
4371
|
+
sourceDir: r,
|
|
4372
4372
|
sourceArrow: g,
|
|
4373
4373
|
sourceGroup: a,
|
|
4374
|
-
sourceEndpoint:
|
|
4374
|
+
sourceEndpoint: r === "L" ? "0 50%" : r === "R" ? "100% 50%" : r === "T" ? "50% 0" : "50% 100%",
|
|
4375
4375
|
target: T,
|
|
4376
4376
|
targetDir: e,
|
|
4377
|
-
targetArrow:
|
|
4377
|
+
targetArrow: i,
|
|
4378
4378
|
targetGroup: l,
|
|
4379
4379
|
targetEndpoint: e === "L" ? "0 50%" : e === "R" ? "100% 50%" : e === "T" ? "50% 0" : "50% 100%"
|
|
4380
4380
|
};
|
|
@@ -4389,16 +4389,16 @@ ot(Ue, "addEdges");
|
|
|
4389
4389
|
function Xe(A) {
|
|
4390
4390
|
const U = A.map((T) => {
|
|
4391
4391
|
const g = {}, a = {};
|
|
4392
|
-
return Object.entries(T).forEach(([
|
|
4393
|
-
g[e] || (g[e] = []), a[
|
|
4392
|
+
return Object.entries(T).forEach(([i, [r, e]]) => {
|
|
4393
|
+
g[e] || (g[e] = []), a[r] || (a[r] = []), g[e].push(i), a[r].push(i);
|
|
4394
4394
|
}), {
|
|
4395
|
-
horiz: Object.values(g).filter((
|
|
4396
|
-
vert: Object.values(a).filter((
|
|
4395
|
+
horiz: Object.values(g).filter((i) => i.length > 1),
|
|
4396
|
+
vert: Object.values(a).filter((i) => i.length > 1)
|
|
4397
4397
|
};
|
|
4398
4398
|
}), [_, k] = U.reduce(
|
|
4399
|
-
([T, g], { horiz: a, vert:
|
|
4399
|
+
([T, g], { horiz: a, vert: i }) => [
|
|
4400
4400
|
[...T, ...a],
|
|
4401
|
-
[...g, ...
|
|
4401
|
+
[...g, ...i]
|
|
4402
4402
|
],
|
|
4403
4403
|
[[], []]
|
|
4404
4404
|
);
|
|
@@ -4413,7 +4413,7 @@ function Ve(A) {
|
|
|
4413
4413
|
return A.forEach((T) => {
|
|
4414
4414
|
const g = Object.fromEntries(
|
|
4415
4415
|
Object.entries(T).map(([e, l]) => [_(l), e])
|
|
4416
|
-
), a = [_([0, 0])],
|
|
4416
|
+
), a = [_([0, 0])], i = {}, r = {
|
|
4417
4417
|
L: [-1, 0],
|
|
4418
4418
|
R: [1, 0],
|
|
4419
4419
|
T: [0, 1],
|
|
@@ -4422,15 +4422,15 @@ function Ve(A) {
|
|
|
4422
4422
|
for (; a.length > 0; ) {
|
|
4423
4423
|
const e = a.shift();
|
|
4424
4424
|
if (e) {
|
|
4425
|
-
|
|
4425
|
+
i[e] = 1;
|
|
4426
4426
|
const l = g[e];
|
|
4427
4427
|
if (l) {
|
|
4428
4428
|
const n = k(e);
|
|
4429
|
-
Object.entries(
|
|
4429
|
+
Object.entries(r).forEach(([v, t]) => {
|
|
4430
4430
|
const s = _([n[0] + t[0], n[1] + t[1]]), h = g[s];
|
|
4431
|
-
h && !
|
|
4431
|
+
h && !i[s] && (a.push(s), U.push({
|
|
4432
4432
|
[Ce[v]]: h,
|
|
4433
|
-
[Ce[
|
|
4433
|
+
[Ce[mr(v)]]: l,
|
|
4434
4434
|
gap: 1.5 * Pt("iconSize")
|
|
4435
4435
|
}));
|
|
4436
4436
|
});
|
|
@@ -4442,7 +4442,7 @@ function Ve(A) {
|
|
|
4442
4442
|
ot(Ve, "getRelativeConstraints");
|
|
4443
4443
|
function ze(A, U, _, k, { spatialMaps: T }) {
|
|
4444
4444
|
return new Promise((g) => {
|
|
4445
|
-
const a =
|
|
4445
|
+
const a = er("body").append("div").attr("id", "cy").attr("style", "display:none"), i = be({
|
|
4446
4446
|
container: document.getElementById("cy"),
|
|
4447
4447
|
style: [
|
|
4448
4448
|
{
|
|
@@ -4505,8 +4505,8 @@ function ze(A, U, _, k, { spatialMaps: T }) {
|
|
|
4505
4505
|
}
|
|
4506
4506
|
]
|
|
4507
4507
|
});
|
|
4508
|
-
a.remove(), He(_,
|
|
4509
|
-
const
|
|
4508
|
+
a.remove(), He(_, i), Se(A, i), Ye(U, i), Ue(k, i);
|
|
4509
|
+
const r = Xe(T), e = Ve(T), l = i.layout({
|
|
4510
4510
|
name: "fcose",
|
|
4511
4511
|
quality: "proof",
|
|
4512
4512
|
styleEnabled: !1,
|
|
@@ -4515,14 +4515,14 @@ function ze(A, U, _, k, { spatialMaps: T }) {
|
|
|
4515
4515
|
// Adjust the edge parameters if it passes through the border of a group
|
|
4516
4516
|
// Hacky fix for: https://github.com/iVis-at-Bilkent/cytoscape.js-fcose/issues/67
|
|
4517
4517
|
idealEdgeLength(n) {
|
|
4518
|
-
const [v, t] = n.connectedNodes(), { parent: s } =
|
|
4518
|
+
const [v, t] = n.connectedNodes(), { parent: s } = re(v), { parent: h } = re(t);
|
|
4519
4519
|
return s === h ? 1.5 * Pt("iconSize") : 0.5 * Pt("iconSize");
|
|
4520
4520
|
},
|
|
4521
4521
|
edgeElasticity(n) {
|
|
4522
|
-
const [v, t] = n.connectedNodes(), { parent: s } =
|
|
4522
|
+
const [v, t] = n.connectedNodes(), { parent: s } = re(v), { parent: h } = re(t);
|
|
4523
4523
|
return s === h ? 0.45 : 1e-3;
|
|
4524
4524
|
},
|
|
4525
|
-
alignmentConstraint:
|
|
4525
|
+
alignmentConstraint: r,
|
|
4526
4526
|
relativePlacementConstraint: e
|
|
4527
4527
|
});
|
|
4528
4528
|
l.one("layoutstop", () => {
|
|
@@ -4556,8 +4556,8 @@ function ze(A, U, _, k, { spatialMaps: T }) {
|
|
|
4556
4556
|
weights: c
|
|
4557
4557
|
};
|
|
4558
4558
|
}
|
|
4559
|
-
ot(v, "getSegmentWeights"),
|
|
4560
|
-
for (const t of Object.values(
|
|
4559
|
+
ot(v, "getSegmentWeights"), i.startBatch();
|
|
4560
|
+
for (const t of Object.values(i.edges()))
|
|
4561
4561
|
if ((n = t.data) != null && n.call(t)) {
|
|
4562
4562
|
const { x: s, y: h } = t.source().position(), { x: u, y: c } = t.target().position();
|
|
4563
4563
|
if (s !== u && h !== c) {
|
|
@@ -4565,28 +4565,28 @@ function ze(A, U, _, k, { spatialMaps: T }) {
|
|
|
4565
4565
|
t.style("segment-distances", F), t.style("segment-weights", Y);
|
|
4566
4566
|
}
|
|
4567
4567
|
}
|
|
4568
|
-
|
|
4569
|
-
}), l.run(),
|
|
4570
|
-
Re.info("Ready", n), g(
|
|
4568
|
+
i.endBatch(), l.run();
|
|
4569
|
+
}), l.run(), i.ready((n) => {
|
|
4570
|
+
Re.info("Ready", n), g(i);
|
|
4571
4571
|
});
|
|
4572
4572
|
});
|
|
4573
4573
|
}
|
|
4574
4574
|
ot(ze, "layoutArchitecture");
|
|
4575
|
-
var
|
|
4576
|
-
const T = k.db, g = T.getServices(), a = T.getJunctions(),
|
|
4575
|
+
var Wr = /* @__PURE__ */ ot(async (A, U, _, k) => {
|
|
4576
|
+
const T = k.db, g = T.getServices(), a = T.getJunctions(), i = T.getGroups(), r = T.getEdges(), e = T.getDataStructures(), l = Je(U), n = l.append("g");
|
|
4577
4577
|
n.attr("class", "architecture-edges");
|
|
4578
4578
|
const v = l.append("g");
|
|
4579
4579
|
v.attr("class", "architecture-services");
|
|
4580
4580
|
const t = l.append("g");
|
|
4581
|
-
t.attr("class", "architecture-groups"), await
|
|
4582
|
-
const s = await ze(g, a,
|
|
4583
|
-
await
|
|
4584
|
-
}, "draw"), $
|
|
4585
|
-
parser:
|
|
4581
|
+
t.attr("class", "architecture-groups"), await zr(T, v, g), Br(T, v, a);
|
|
4582
|
+
const s = await ze(g, a, i, r, e);
|
|
4583
|
+
await Xr(n, s), await Vr(t, s), ke(T, s), Ke(void 0, l, Pt("padding"), Pt("useMaxWidth"));
|
|
4584
|
+
}, "draw"), $r = { draw: Wr }, Kr = {
|
|
4585
|
+
parser: kr,
|
|
4586
4586
|
db: se,
|
|
4587
|
-
renderer: $
|
|
4588
|
-
styles:
|
|
4587
|
+
renderer: $r,
|
|
4588
|
+
styles: Ur
|
|
4589
4589
|
};
|
|
4590
4590
|
export {
|
|
4591
|
-
|
|
4591
|
+
Kr as diagram
|
|
4592
4592
|
};
|