@leanspec/ui-components 0.2.21 → 0.2.22
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/{_baseUniq-KSDS6tgF.js → _baseUniq-D7Jo4wA-.js} +2 -2
- package/dist/{_baseUniq-ifpVq4u5.cjs → _baseUniq-DuU2z5Ko.cjs} +1 -1
- package/dist/{arc-CutFaiCL.cjs → arc-DVobalXV.cjs} +1 -1
- package/dist/{arc-C-X5Xt_b.js → arc-bSbgZKu2.js} +1 -1
- package/dist/{architecture-U656AL7Q-DOVRDeZr.cjs → architecture-U656AL7Q-BnnsKr-v.cjs} +1 -1
- package/dist/{architecture-U656AL7Q-BB1A66AM.js → architecture-U656AL7Q-pOUzdaWZ.js} +1 -1
- package/dist/{architectureDiagram-VXUJARFQ-Bal8NTn4.js → architectureDiagram-VXUJARFQ-B9csKaKv.js} +1272 -1279
- package/dist/architectureDiagram-VXUJARFQ-Dwe8uzg_.cjs +36 -0
- package/dist/blockDiagram-VD42YOAC-B4iBhDdw.cjs +122 -0
- package/dist/{blockDiagram-VD42YOAC-B2gTo5wW.js → blockDiagram-VD42YOAC-DrRsdznF.js} +911 -920
- package/dist/c4Diagram-YG6GDRKO-BRDnNTAH.cjs +10 -0
- package/dist/{c4Diagram-YG6GDRKO-dIf_vNCY.js → c4Diagram-YG6GDRKO-Di2rkJ8i.js} +162 -163
- package/dist/{channel-klR7o7JB.js → channel-CTeTHv-y.js} +1 -1
- package/dist/channel-Dzz86sIh.cjs +1 -0
- package/dist/chunk-4BX2VUAB-Ckv-xIp1.cjs +1 -0
- package/dist/chunk-4BX2VUAB-Dkr-Egsj.js +8 -0
- package/dist/{chunk-55IACEB6-C88Xx0rU.cjs → chunk-55IACEB6-CVnZTCiR.cjs} +1 -1
- package/dist/{chunk-55IACEB6-Dd3NjClm.js → chunk-55IACEB6-D_uwi6CC.js} +1 -1
- package/dist/{chunk-B4BG7PRW-DLUrgkJI.js → chunk-B4BG7PRW-BipBIVhj.js} +247 -248
- package/dist/{chunk-B4BG7PRW-BTU_nPVE.cjs → chunk-B4BG7PRW-Bne1UwNu.cjs} +6 -6
- package/dist/{chunk-DI55MBZ5-BwHLqSW9.js → chunk-DI55MBZ5-8tWOlvAD.js} +440 -452
- package/dist/chunk-DI55MBZ5-UAAzyEQX.cjs +220 -0
- package/dist/{chunk-FMBD7UC4-6dsbMKM7.js → chunk-FMBD7UC4-CLc8_72-.js} +1 -1
- package/dist/{chunk-FMBD7UC4-CedTj9g2.cjs → chunk-FMBD7UC4-DsaPsLgZ.cjs} +1 -1
- package/dist/chunk-QN33PNHL-BBlw4H4R.cjs +1 -0
- package/dist/chunk-QN33PNHL-QKH9jByz.js +19 -0
- package/dist/{chunk-QZHKN3VN-CVAEdzef.js → chunk-QZHKN3VN-BPpgPA2g.js} +1 -1
- package/dist/{chunk-QZHKN3VN-CU1cLvn7.cjs → chunk-QZHKN3VN-CB9ZTvXU.cjs} +1 -1
- package/dist/{chunk-TZMSLE5B-Cc8_PJIq.js → chunk-TZMSLE5B-Coq49FaX.js} +1 -1
- package/dist/{chunk-TZMSLE5B-Dy6zxWyY.cjs → chunk-TZMSLE5B-Dl7DiX7D.cjs} +1 -1
- package/dist/{classDiagram-v2-WZHVMYZB-D7bjndmT.js → classDiagram-2ON5EDUG-DYaKkEXb.js} +2 -2
- package/dist/{classDiagram-2ON5EDUG-CJQWUYqu.cjs → classDiagram-2ON5EDUG-Fsj2z4ej.cjs} +1 -1
- package/dist/{classDiagram-2ON5EDUG-D7bjndmT.js → classDiagram-v2-WZHVMYZB-DYaKkEXb.js} +2 -2
- package/dist/{classDiagram-v2-WZHVMYZB-CJQWUYqu.cjs → classDiagram-v2-WZHVMYZB-Fsj2z4ej.cjs} +1 -1
- package/dist/{clone-7srXemyd.js → clone-Ctm6tjrV.js} +1 -1
- package/dist/clone-JAtNXNmq.cjs +1 -0
- package/dist/{code-block-37QAKDTI-MRm4xHKr.js → code-block-37QAKDTI-3zaK1Sok.js} +1 -1
- package/dist/{code-block-37QAKDTI-BAYBliUK.cjs → code-block-37QAKDTI-UmxtJ5VR.cjs} +1 -1
- package/dist/components/graph/dependency-graph.d.ts.map +1 -1
- package/dist/components/hierarchy/hierarchy-tree.d.ts +17 -0
- package/dist/components/hierarchy/hierarchy-tree.d.ts.map +1 -0
- package/dist/components/hierarchy/index.d.ts +2 -0
- package/dist/components/hierarchy/index.d.ts.map +1 -0
- package/dist/components/index.d.ts +1 -0
- package/dist/components/index.d.ts.map +1 -1
- package/dist/components/spec/spec-card.d.ts +1 -1
- package/dist/components/spec/spec-card.d.ts.map +1 -1
- package/dist/components/ui/index.d.ts +3 -3
- package/dist/components/ui/index.d.ts.map +1 -1
- package/dist/cose-bilkent-S5V4N54A-BMt11jHq.cjs +1 -0
- package/dist/{cose-bilkent-S5V4N54A-0O3dLIoy.js → cose-bilkent-S5V4N54A-iUMgKFJZ.js} +281 -281
- package/dist/cytoscape.esm-CNUX3VTg.cjs +321 -0
- package/dist/{cytoscape.esm-CjI2IsL8.js → cytoscape.esm-Cvf3sx9F.js} +18 -49
- package/dist/dagre-6UL2VRFP-CKc2IEbO.js +443 -0
- package/dist/dagre-6UL2VRFP-sN44kpPp.cjs +4 -0
- package/dist/{diagram-PSM6KHXK-s2xYLlND.js → diagram-PSM6KHXK-DERIvROx.js} +17 -19
- package/dist/diagram-PSM6KHXK-Ltn89usT.cjs +24 -0
- package/dist/{diagram-QEK2KX5R-D700jvoY.js → diagram-QEK2KX5R-B6CdcylU.js} +10 -14
- package/dist/diagram-QEK2KX5R-CDZWBlgA.cjs +43 -0
- package/dist/{diagram-S2PKOQOG-BkgBSa1Q.js → diagram-S2PKOQOG-5f_4uCtF.js} +22 -23
- package/dist/diagram-S2PKOQOG-D4WcZEo0.cjs +24 -0
- package/dist/{erDiagram-Q2GNP2WA-CXv6THpi.js → erDiagram-Q2GNP2WA-CnN7DF_N.js} +73 -74
- package/dist/{erDiagram-Q2GNP2WA-DKKIPwgH.cjs → erDiagram-Q2GNP2WA-mIz8VRgG.cjs} +3 -3
- package/dist/flowDiagram-NV44I4VS-BwUl8_y0.cjs +162 -0
- package/dist/{flowDiagram-NV44I4VS-Dsrv00Gy.js → flowDiagram-NV44I4VS-Dl3ZZj2W.js} +438 -445
- package/dist/{ganttDiagram-JELNMOA3-BuwyOUxF.cjs → ganttDiagram-JELNMOA3-Dl_PUPHn.cjs} +1 -1
- package/dist/{ganttDiagram-JELNMOA3-CqVYbgbk.js → ganttDiagram-JELNMOA3-q87tSGGF.js} +2 -2
- package/dist/{gitGraph-F6HP7TQM-q5owfB75.js → gitGraph-F6HP7TQM-C4DmI2Gg.js} +1 -1
- package/dist/{gitGraph-F6HP7TQM-BtoBLEOj.cjs → gitGraph-F6HP7TQM-Cq9d8Pu6.cjs} +1 -1
- package/dist/gitGraphDiagram-NY62KEGX-DMhKqh_S.cjs +65 -0
- package/dist/gitGraphDiagram-NY62KEGX-NeHUXng4.js +699 -0
- package/dist/{graph-CxpBbnBw.cjs → graph-AuIe-DO_.cjs} +1 -1
- package/dist/{graph-rt_wscbL.js → graph-Da1z0n_J.js} +2 -2
- package/dist/hooks/index.d.ts +1 -0
- package/dist/hooks/index.d.ts.map +1 -1
- package/dist/hooks/use-spec-sync.d.ts +13 -0
- package/dist/hooks/use-spec-sync.d.ts.map +1 -0
- package/dist/{index-BsdeQX2F.js → index-B5zgF_S5.js} +30337 -30055
- package/dist/index-KEDsBA0n.cjs +2103 -0
- package/dist/index.cjs +1 -1
- package/dist/index.js +512 -500
- package/dist/info-NVLQJR56-A56PvZ_B.js +5 -0
- package/dist/{info-NVLQJR56-Ctx23Jwq.cjs → info-NVLQJR56-FWiEuR29.cjs} +1 -1
- package/dist/{infoDiagram-WHAUD3N6-Fq8ToFQ6.js → infoDiagram-WHAUD3N6-Cj-s-gtw.js} +2 -2
- package/dist/{infoDiagram-WHAUD3N6-ICmXrgfx.cjs → infoDiagram-WHAUD3N6-Dvc-cZjb.cjs} +1 -1
- package/dist/{journeyDiagram-XKPGCS4Q-BkYLuV5M.cjs → journeyDiagram-XKPGCS4Q-B54o9W3g.cjs} +1 -1
- package/dist/{journeyDiagram-XKPGCS4Q-BzZgPZwu.js → journeyDiagram-XKPGCS4Q-BbXXFBC-.js} +4 -4
- package/dist/kanban-definition-3W4ZIXB7-BQfiIWMB.cjs +89 -0
- package/dist/kanban-definition-3W4ZIXB7-ClCUbNCO.js +719 -0
- package/dist/{layout-CeChnsru.cjs → layout-9b_FTQ6g.cjs} +1 -1
- package/dist/{layout-CX9neEHw.js → layout-BoJlbrAK.js} +4 -4
- package/dist/lib/hierarchy.d.ts +12 -0
- package/dist/lib/hierarchy.d.ts.map +1 -0
- package/dist/lib/index.d.ts +1 -0
- package/dist/lib/index.d.ts.map +1 -1
- package/dist/{linear-CkUVga7d.js → linear-4rmylyIU.js} +1 -1
- package/dist/{linear-DLfe3Is-.cjs → linear-FU7lEwDb.cjs} +1 -1
- package/dist/{mermaid-4DMBBIKO-DK6bOe0l.cjs → mermaid-4DMBBIKO-CGMd2ylH.cjs} +1 -1
- package/dist/mermaid-4DMBBIKO-CNvUKRvV.js +4 -0
- package/dist/{mermaid-parser.core-B7VTdQ1C.js → mermaid-parser.core-BbeEQ08m.js} +2740 -2756
- package/dist/mermaid-parser.core-CQwGaxt2.cjs +128 -0
- package/dist/{min-Ar5ebLd-.js → min-C8aXS73f.js} +2 -2
- package/dist/{min-C_bmS8M7.cjs → min-Ddv5U3O-.cjs} +1 -1
- package/dist/{mindmap-definition-VGOIOE7T-DeGZNL21.js → mindmap-definition-VGOIOE7T-BRNm-2aJ.js} +166 -169
- package/dist/mindmap-definition-VGOIOE7T-Gp-Ji6eO.cjs +68 -0
- package/dist/{ordinal-DfAQgscy.js → ordinal-B6-f3MAq.js} +1 -1
- package/dist/{packet-BFZMPI3H-DFZzoAsC.js → packet-BFZMPI3H-CJ8lOlJN.js} +1 -1
- package/dist/{packet-BFZMPI3H-BVRarKKV.cjs → packet-BFZMPI3H-CpWVF6Ne.cjs} +1 -1
- package/dist/pie-7BOR55EZ-BCyVC33Q.js +5 -0
- package/dist/{pie-7BOR55EZ-0edBRKAY.cjs → pie-7BOR55EZ-Ceke0LDu.cjs} +1 -1
- package/dist/{pieDiagram-ADFJNKIX-C_V2NX6O.js → pieDiagram-ADFJNKIX-BVRqurYx.js} +21 -21
- package/dist/{pieDiagram-ADFJNKIX-Ceq-kf3C.cjs → pieDiagram-ADFJNKIX-CwhRxtMH.cjs} +2 -2
- package/dist/{quadrantDiagram-AYHSOK5B-B8fSnYQi.js → quadrantDiagram-AYHSOK5B-CcsZBY3e.js} +227 -229
- package/dist/quadrantDiagram-AYHSOK5B-DBTVya8p.cjs +7 -0
- package/dist/radar-NHE76QYJ-C6zEuLeW.js +5 -0
- package/dist/{radar-NHE76QYJ-gAJ22qc7.cjs → radar-NHE76QYJ-CX8DsGdu.cjs} +1 -1
- package/dist/{requirementDiagram-UZGBJVZJ-D6BE-Q1l.cjs → requirementDiagram-UZGBJVZJ-5bxQUo0r.cjs} +7 -7
- package/dist/{requirementDiagram-UZGBJVZJ-MnXD59Yw.js → requirementDiagram-UZGBJVZJ-CV5SUGj-.js} +186 -188
- package/dist/{sankeyDiagram-TZEHDZUN-Dfyu7oJ6.js → sankeyDiagram-TZEHDZUN-BFPvVGcz.js} +186 -186
- package/dist/{sankeyDiagram-TZEHDZUN-Dx8_KSIc.cjs → sankeyDiagram-TZEHDZUN-D33DzO8E.cjs} +5 -5
- package/dist/{sequenceDiagram-WL72ISMW-D2pgAoWi.js → sequenceDiagram-WL72ISMW-CQ5u3b_o.js} +213 -220
- package/dist/{sequenceDiagram-WL72ISMW-CUYHrDfm.cjs → sequenceDiagram-WL72ISMW-DFEVNSSA.cjs} +16 -16
- package/dist/{stateDiagram-FKZM4ZOC-CtYt1Ixa.cjs → stateDiagram-FKZM4ZOC-sKqH3kHZ.cjs} +1 -1
- package/dist/{stateDiagram-FKZM4ZOC-DYV-na53.js → stateDiagram-FKZM4ZOC-zOb-V3pD.js} +4 -4
- package/dist/{stateDiagram-v2-4FDKWEC3-CeSnHO3T.cjs → stateDiagram-v2-4FDKWEC3-DwWb55sM.cjs} +1 -1
- package/dist/{stateDiagram-v2-4FDKWEC3-Kp4sxr9o.js → stateDiagram-v2-4FDKWEC3-_Mzc1jVl.js} +2 -2
- package/dist/{timeline-definition-IT6M3QCI-621ePKJ0.js → timeline-definition-IT6M3QCI-B2T2QrC5.js} +211 -215
- package/dist/timeline-definition-IT6M3QCI-D19MQs5w.cjs +61 -0
- package/dist/{treemap-KMMF4GRG-DSNryTu7.cjs → treemap-KMMF4GRG-C7E3CtG7.cjs} +1 -1
- package/dist/{treemap-KMMF4GRG-l6HrdCLC.js → treemap-KMMF4GRG-wB3pBnFc.js} +1 -1
- package/dist/types/specs.d.ts +2 -0
- package/dist/types/specs.d.ts.map +1 -1
- package/dist/ui-components.css +1 -1
- package/dist/{xychartDiagram-PRI3JC2R-CkfCv2o_.js → xychartDiagram-PRI3JC2R-BSPghzKh.js} +3 -3
- package/dist/{xychartDiagram-PRI3JC2R-C2_xziD5.cjs → xychartDiagram-PRI3JC2R-hKFxVf6x.cjs} +1 -1
- package/package.json +5 -2
- package/dist/architectureDiagram-VXUJARFQ-WCtQIdet.cjs +0 -36
- package/dist/blockDiagram-VD42YOAC-CGdaLv7H.cjs +0 -122
- package/dist/c4Diagram-YG6GDRKO-DfRXyZHM.cjs +0 -10
- package/dist/channel-CMrUjUoZ.cjs +0 -1
- package/dist/chunk-4BX2VUAB-BQgzc1Sm.js +0 -9
- package/dist/chunk-4BX2VUAB-CO5acanJ.cjs +0 -1
- package/dist/chunk-DI55MBZ5-lVvJu2kr.cjs +0 -220
- package/dist/chunk-QN33PNHL-DHNejhbC.js +0 -20
- package/dist/chunk-QN33PNHL-Dr9ghdFD.cjs +0 -1
- package/dist/clone-Chgndk5P.cjs +0 -1
- package/dist/cose-bilkent-S5V4N54A-CPai-c_a.cjs +0 -1
- package/dist/cytoscape.esm-o9WRfNPd.cjs +0 -331
- package/dist/dagre-6UL2VRFP-BqaZre9N.js +0 -446
- package/dist/dagre-6UL2VRFP-CeIiJJG5.cjs +0 -4
- package/dist/diagram-PSM6KHXK-oD045yZG.cjs +0 -24
- package/dist/diagram-QEK2KX5R-VH7_rcp0.cjs +0 -43
- package/dist/diagram-S2PKOQOG-CjDpLVdl.cjs +0 -24
- package/dist/flowDiagram-NV44I4VS-U52jVnrS.cjs +0 -162
- package/dist/gitGraphDiagram-NY62KEGX-DH1I05Ix.cjs +0 -65
- package/dist/gitGraphDiagram-NY62KEGX-DOanbk62.js +0 -712
- package/dist/index-Cg8ByiK0.cjs +0 -2153
- package/dist/info-NVLQJR56-hH82KARZ.js +0 -5
- package/dist/kanban-definition-3W4ZIXB7-BV7UYL3n.cjs +0 -89
- package/dist/kanban-definition-3W4ZIXB7-CrmrjRAg.js +0 -721
- package/dist/mermaid-4DMBBIKO-wnX9ATcq.js +0 -4
- package/dist/mermaid-parser.core-DvlzR6J2.cjs +0 -128
- package/dist/mindmap-definition-VGOIOE7T-BBqv9TKM.cjs +0 -68
- package/dist/pie-7BOR55EZ-zLMdfI8h.js +0 -5
- package/dist/quadrantDiagram-AYHSOK5B-BButfYaS.cjs +0 -7
- package/dist/radar-NHE76QYJ-DeqJwy76.js +0 -5
- package/dist/timeline-definition-IT6M3QCI-4fRZfQpb.cjs +0 -61
|
@@ -1,16 +1,16 @@
|
|
|
1
|
-
import { aL as lt, _ as V, l as $, h as gt } from "./index-
|
|
2
|
-
import { c as tt } from "./cytoscape.esm-
|
|
1
|
+
import { aL as lt, _ as V, l as $, h as gt } from "./index-B5zgF_S5.js";
|
|
2
|
+
import { c as tt } from "./cytoscape.esm-Cvf3sx9F.js";
|
|
3
3
|
var k = { exports: {} }, Z = { exports: {} }, Q = { exports: {} }, ut = Q.exports, j;
|
|
4
4
|
function ft() {
|
|
5
5
|
return j || (j = 1, (function(G, b) {
|
|
6
|
-
(function(I,
|
|
7
|
-
G.exports =
|
|
6
|
+
(function(I, L) {
|
|
7
|
+
G.exports = L();
|
|
8
8
|
})(ut, function() {
|
|
9
9
|
return (
|
|
10
10
|
/******/
|
|
11
11
|
(function(N) {
|
|
12
12
|
var I = {};
|
|
13
|
-
function
|
|
13
|
+
function L(o) {
|
|
14
14
|
if (I[o])
|
|
15
15
|
return I[o].exports;
|
|
16
16
|
var e = I[o] = {
|
|
@@ -22,12 +22,12 @@ function ft() {
|
|
|
22
22
|
exports: {}
|
|
23
23
|
/******/
|
|
24
24
|
};
|
|
25
|
-
return N[o].call(e.exports, e, e.exports,
|
|
25
|
+
return N[o].call(e.exports, e, e.exports, L), e.l = !0, e.exports;
|
|
26
26
|
}
|
|
27
|
-
return
|
|
27
|
+
return L.m = N, L.c = I, L.i = function(o) {
|
|
28
28
|
return o;
|
|
29
|
-
},
|
|
30
|
-
|
|
29
|
+
}, L.d = function(o, e, t) {
|
|
30
|
+
L.o(o, e) || Object.defineProperty(o, e, {
|
|
31
31
|
/******/
|
|
32
32
|
configurable: !1,
|
|
33
33
|
/******/
|
|
@@ -36,7 +36,7 @@ function ft() {
|
|
|
36
36
|
get: t
|
|
37
37
|
/******/
|
|
38
38
|
});
|
|
39
|
-
},
|
|
39
|
+
}, L.n = function(o) {
|
|
40
40
|
var e = o && o.__esModule ? (
|
|
41
41
|
/******/
|
|
42
42
|
function() {
|
|
@@ -48,22 +48,22 @@ function ft() {
|
|
|
48
48
|
return o;
|
|
49
49
|
}
|
|
50
50
|
);
|
|
51
|
-
return
|
|
52
|
-
},
|
|
51
|
+
return L.d(e, "a", e), e;
|
|
52
|
+
}, L.o = function(o, e) {
|
|
53
53
|
return Object.prototype.hasOwnProperty.call(o, e);
|
|
54
|
-
},
|
|
54
|
+
}, L.p = "", L(L.s = 26);
|
|
55
55
|
})([
|
|
56
56
|
/* 0 */
|
|
57
57
|
/***/
|
|
58
|
-
(function(N, I,
|
|
58
|
+
(function(N, I, L) {
|
|
59
59
|
function o() {
|
|
60
60
|
}
|
|
61
61
|
o.QUALITY = 1, o.DEFAULT_CREATE_BENDS_AS_NEEDED = !1, o.DEFAULT_INCREMENTAL = !1, o.DEFAULT_ANIMATION_ON_LAYOUT = !0, o.DEFAULT_ANIMATION_DURING_LAYOUT = !1, o.DEFAULT_ANIMATION_PERIOD = 50, o.DEFAULT_UNIFORM_LEAF_NODE_SIZES = !1, o.DEFAULT_GRAPH_MARGIN = 15, o.NODE_DIMENSIONS_INCLUDE_LABELS = !1, o.SIMPLE_NODE_SIZE = 40, o.SIMPLE_NODE_HALF_SIZE = o.SIMPLE_NODE_SIZE / 2, o.EMPTY_COMPOUND_NODE_SIZE = 40, o.MIN_EDGE_LENGTH = 1, o.WORLD_BOUNDARY = 1e6, o.INITIAL_WORLD_BOUNDARY = o.WORLD_BOUNDARY / 1e3, o.WORLD_CENTER_X = 1200, o.WORLD_CENTER_Y = 900, N.exports = o;
|
|
62
62
|
}),
|
|
63
63
|
/* 1 */
|
|
64
64
|
/***/
|
|
65
|
-
(function(N, I,
|
|
66
|
-
var o =
|
|
65
|
+
(function(N, I, L) {
|
|
66
|
+
var o = L(2), e = L(8), t = L(9);
|
|
67
67
|
function i(g, n, d) {
|
|
68
68
|
o.call(this, d), this.isOverlapingSourceAndTarget = !1, this.vGraphObject = d, this.bendpoints = [], this.source = g, this.target = n;
|
|
69
69
|
}
|
|
@@ -112,7 +112,7 @@ function ft() {
|
|
|
112
112
|
}),
|
|
113
113
|
/* 2 */
|
|
114
114
|
/***/
|
|
115
|
-
(function(N, I,
|
|
115
|
+
(function(N, I, L) {
|
|
116
116
|
function o(e) {
|
|
117
117
|
this.vGraphObject = e;
|
|
118
118
|
}
|
|
@@ -120,8 +120,8 @@ function ft() {
|
|
|
120
120
|
}),
|
|
121
121
|
/* 3 */
|
|
122
122
|
/***/
|
|
123
|
-
(function(N, I,
|
|
124
|
-
var o =
|
|
123
|
+
(function(N, I, L) {
|
|
124
|
+
var o = L(2), e = L(10), t = L(13), i = L(0), l = L(16), g = L(4);
|
|
125
125
|
function n(r, h, a, p) {
|
|
126
126
|
a == null && p == null && (p = h), o.call(this, p), r.graphManager != null && (r = r.graphManager), this.estimatedSize = e.MIN_VALUE, this.inclusionTreeDepth = e.MAX_VALUE, this.vGraphObject = p, this.edges = [], this.graphManager = r, a != null && h != null ? this.rect = new t(h.x, h.y, a.width, a.height) : this.rect = new t();
|
|
127
127
|
}
|
|
@@ -251,7 +251,7 @@ function ft() {
|
|
|
251
251
|
}),
|
|
252
252
|
/* 4 */
|
|
253
253
|
/***/
|
|
254
|
-
(function(N, I,
|
|
254
|
+
(function(N, I, L) {
|
|
255
255
|
function o(e, t) {
|
|
256
256
|
e == null && t == null ? (this.x = 0, this.y = 0) : (this.x = e, this.y = t);
|
|
257
257
|
}
|
|
@@ -273,8 +273,8 @@ function ft() {
|
|
|
273
273
|
}),
|
|
274
274
|
/* 5 */
|
|
275
275
|
/***/
|
|
276
|
-
(function(N, I,
|
|
277
|
-
var o =
|
|
276
|
+
(function(N, I, L) {
|
|
277
|
+
var o = L(2), e = L(10), t = L(0), i = L(6), l = L(3), g = L(1), n = L(13), d = L(12), r = L(11);
|
|
278
278
|
function h(p, v, D) {
|
|
279
279
|
o.call(this, D), this.estimatedSize = e.MIN_VALUE, this.margin = t.DEFAULT_GRAPH_MARGIN, this.edges = [], this.nodes = [], this.isConnected = !1, this.parent = p, v != null && v instanceof i ? this.graphManager = v : v != null && v instanceof Layout && (this.graphManager = v.graphManager);
|
|
280
280
|
}
|
|
@@ -308,12 +308,12 @@ function ft() {
|
|
|
308
308
|
throw "Node already in graph!";
|
|
309
309
|
return u.owner = this, this.getNodes().push(u), u;
|
|
310
310
|
} else {
|
|
311
|
-
var
|
|
311
|
+
var T = p;
|
|
312
312
|
if (!(this.getNodes().indexOf(v) > -1 && this.getNodes().indexOf(D) > -1))
|
|
313
313
|
throw "Source or target not in graph!";
|
|
314
314
|
if (!(v.owner == D.owner && v.owner == this))
|
|
315
315
|
throw "Both owners must be this graph!";
|
|
316
|
-
return v.owner != D.owner ? null : (
|
|
316
|
+
return v.owner != D.owner ? null : (T.source = v, T.target = D, T.isInterGraph = !1, this.getEdges().push(T), v.edges.push(T), D != v && D.edges.push(T), T);
|
|
317
317
|
}
|
|
318
318
|
}, h.prototype.remove = function(p) {
|
|
319
319
|
var v = p;
|
|
@@ -324,7 +324,7 @@ function ft() {
|
|
|
324
324
|
throw "Owner graph is invalid!";
|
|
325
325
|
if (this.graphManager == null)
|
|
326
326
|
throw "Owner graph manager is invalid!";
|
|
327
|
-
for (var D = v.edges.slice(), u,
|
|
327
|
+
for (var D = v.edges.slice(), u, T = D.length, y = 0; y < T; y++)
|
|
328
328
|
u = D[y], u.isInterGraph ? this.graphManager.remove(u) : u.source.owner.remove(u);
|
|
329
329
|
var O = this.nodes.indexOf(v);
|
|
330
330
|
if (O == -1)
|
|
@@ -348,24 +348,24 @@ function ft() {
|
|
|
348
348
|
u.source.owner.getEdges().splice(O, 1);
|
|
349
349
|
}
|
|
350
350
|
}, h.prototype.updateLeftTop = function() {
|
|
351
|
-
for (var p = e.MAX_VALUE, v = e.MAX_VALUE, D, u,
|
|
351
|
+
for (var p = e.MAX_VALUE, v = e.MAX_VALUE, D, u, T, y = this.getNodes(), O = y.length, s = 0; s < O; s++) {
|
|
352
352
|
var f = y[s];
|
|
353
353
|
D = f.getTop(), u = f.getLeft(), p > D && (p = D), v > u && (v = u);
|
|
354
354
|
}
|
|
355
|
-
return p == e.MAX_VALUE ? null : (y[0].getParent().paddingLeft != null ?
|
|
355
|
+
return p == e.MAX_VALUE ? null : (y[0].getParent().paddingLeft != null ? T = y[0].getParent().paddingLeft : T = this.margin, this.left = v - T, this.top = p - T, new d(this.left, this.top));
|
|
356
356
|
}, h.prototype.updateBounds = function(p) {
|
|
357
|
-
for (var v = e.MAX_VALUE, D = -e.MAX_VALUE, u = e.MAX_VALUE,
|
|
358
|
-
var C =
|
|
359
|
-
p && C.child != null && C.updateBounds(), y = C.getLeft(), O = C.getRight(), s = C.getTop(), f = C.getBottom(), v > y && (v = y), D < O && (D = O), u > s && (u = s),
|
|
357
|
+
for (var v = e.MAX_VALUE, D = -e.MAX_VALUE, u = e.MAX_VALUE, T = -e.MAX_VALUE, y, O, s, f, c, E = this.nodes, A = E.length, m = 0; m < A; m++) {
|
|
358
|
+
var C = E[m];
|
|
359
|
+
p && C.child != null && C.updateBounds(), y = C.getLeft(), O = C.getRight(), s = C.getTop(), f = C.getBottom(), v > y && (v = y), D < O && (D = O), u > s && (u = s), T < f && (T = f);
|
|
360
360
|
}
|
|
361
|
-
var R = new n(v, u, D - v,
|
|
362
|
-
v == e.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()),
|
|
361
|
+
var R = new n(v, u, D - v, T - u);
|
|
362
|
+
v == e.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), E[0].getParent().paddingLeft != null ? c = E[0].getParent().paddingLeft : c = this.margin, this.left = R.x - c, this.right = R.x + R.width + c, this.top = R.y - c, this.bottom = R.y + R.height + c;
|
|
363
363
|
}, h.calculateBounds = function(p) {
|
|
364
|
-
for (var v = e.MAX_VALUE, D = -e.MAX_VALUE, u = e.MAX_VALUE,
|
|
365
|
-
var A = p[
|
|
366
|
-
y = A.getLeft(), O = A.getRight(), s = A.getTop(), f = A.getBottom(), v > y && (v = y), D < O && (D = O), u > s && (u = s),
|
|
364
|
+
for (var v = e.MAX_VALUE, D = -e.MAX_VALUE, u = e.MAX_VALUE, T = -e.MAX_VALUE, y, O, s, f, c = p.length, E = 0; E < c; E++) {
|
|
365
|
+
var A = p[E];
|
|
366
|
+
y = A.getLeft(), O = A.getRight(), s = A.getTop(), f = A.getBottom(), v > y && (v = y), D < O && (D = O), u > s && (u = s), T < f && (T = f);
|
|
367
367
|
}
|
|
368
|
-
var m = new n(v, u, D - v,
|
|
368
|
+
var m = new n(v, u, D - v, T - u);
|
|
369
369
|
return m;
|
|
370
370
|
}, h.prototype.getInclusionTreeDepth = function() {
|
|
371
371
|
return this == this.graphManager.getRoot() ? 1 : this.parent.getInclusionTreeDepth();
|
|
@@ -375,8 +375,8 @@ function ft() {
|
|
|
375
375
|
return this.estimatedSize;
|
|
376
376
|
}, h.prototype.calcEstimatedSize = function() {
|
|
377
377
|
for (var p = 0, v = this.nodes, D = v.length, u = 0; u < D; u++) {
|
|
378
|
-
var
|
|
379
|
-
p +=
|
|
378
|
+
var T = v[u];
|
|
379
|
+
p += T.calcEstimatedSize();
|
|
380
380
|
}
|
|
381
381
|
return p == 0 ? this.estimatedSize = t.EMPTY_COMPOUND_NODE_SIZE : this.estimatedSize = p / Math.sqrt(this.nodes.length), this.estimatedSize;
|
|
382
382
|
}, h.prototype.updateConnected = function() {
|
|
@@ -385,16 +385,16 @@ function ft() {
|
|
|
385
385
|
this.isConnected = !0;
|
|
386
386
|
return;
|
|
387
387
|
}
|
|
388
|
-
var v = new r(), D = /* @__PURE__ */ new Set(), u = this.nodes[0],
|
|
388
|
+
var v = new r(), D = /* @__PURE__ */ new Set(), u = this.nodes[0], T, y, O = u.withChildren();
|
|
389
389
|
for (O.forEach(function(m) {
|
|
390
390
|
v.push(m), D.add(m);
|
|
391
391
|
}); v.length !== 0; ) {
|
|
392
|
-
u = v.shift(),
|
|
393
|
-
for (var s =
|
|
394
|
-
var c =
|
|
392
|
+
u = v.shift(), T = u.getEdges();
|
|
393
|
+
for (var s = T.length, f = 0; f < s; f++) {
|
|
394
|
+
var c = T[f];
|
|
395
395
|
if (y = c.getOtherEndInGraph(u, this), y != null && !D.has(y)) {
|
|
396
|
-
var
|
|
397
|
-
|
|
396
|
+
var E = y.withChildren();
|
|
397
|
+
E.forEach(function(m) {
|
|
398
398
|
v.push(m), D.add(m);
|
|
399
399
|
});
|
|
400
400
|
}
|
|
@@ -410,10 +410,10 @@ function ft() {
|
|
|
410
410
|
}),
|
|
411
411
|
/* 6 */
|
|
412
412
|
/***/
|
|
413
|
-
(function(N, I,
|
|
414
|
-
var o, e =
|
|
413
|
+
(function(N, I, L) {
|
|
414
|
+
var o, e = L(1);
|
|
415
415
|
function t(i) {
|
|
416
|
-
o =
|
|
416
|
+
o = L(5), this.layout = i, this.graphs = [], this.edges = [];
|
|
417
417
|
}
|
|
418
418
|
t.prototype.addRoot = function() {
|
|
419
419
|
var i = this.layout.newGraph(), l = this.layout.newNode(null), g = this.add(i, l);
|
|
@@ -605,8 +605,8 @@ function ft() {
|
|
|
605
605
|
}),
|
|
606
606
|
/* 7 */
|
|
607
607
|
/***/
|
|
608
|
-
(function(N, I,
|
|
609
|
-
var o =
|
|
608
|
+
(function(N, I, L) {
|
|
609
|
+
var o = L(0);
|
|
610
610
|
function e() {
|
|
611
611
|
}
|
|
612
612
|
for (var t in o)
|
|
@@ -615,8 +615,8 @@ function ft() {
|
|
|
615
615
|
}),
|
|
616
616
|
/* 8 */
|
|
617
617
|
/***/
|
|
618
|
-
(function(N, I,
|
|
619
|
-
var o =
|
|
618
|
+
(function(N, I, L) {
|
|
619
|
+
var o = L(12);
|
|
620
620
|
function e() {
|
|
621
621
|
}
|
|
622
622
|
e.calcSeparationAmount = function(t, i, l, g) {
|
|
@@ -634,10 +634,10 @@ function ft() {
|
|
|
634
634
|
var g = t.getCenterX(), n = t.getCenterY(), d = i.getCenterX(), r = i.getCenterY();
|
|
635
635
|
if (t.intersects(i))
|
|
636
636
|
return l[0] = g, l[1] = n, l[2] = d, l[3] = r, !0;
|
|
637
|
-
var h = t.getX(), a = t.getY(), p = t.getRight(), v = t.getX(), D = t.getBottom(), u = t.getRight(),
|
|
637
|
+
var h = t.getX(), a = t.getY(), p = t.getRight(), v = t.getX(), D = t.getBottom(), u = t.getRight(), T = t.getWidthHalf(), y = t.getHeightHalf(), O = i.getX(), s = i.getY(), f = i.getRight(), c = i.getX(), E = i.getBottom(), A = i.getRight(), m = i.getWidthHalf(), C = i.getHeightHalf(), R = !1, M = !1;
|
|
638
638
|
if (g === d) {
|
|
639
639
|
if (n > r)
|
|
640
|
-
return l[0] = g, l[1] = a, l[2] = d, l[3] =
|
|
640
|
+
return l[0] = g, l[1] = a, l[2] = d, l[3] = E, !1;
|
|
641
641
|
if (n < r)
|
|
642
642
|
return l[0] = g, l[1] = D, l[2] = d, l[3] = s, !1;
|
|
643
643
|
} else if (n === r) {
|
|
@@ -647,7 +647,7 @@ function ft() {
|
|
|
647
647
|
return l[0] = p, l[1] = n, l[2] = O, l[3] = r, !1;
|
|
648
648
|
} else {
|
|
649
649
|
var S = t.height / t.width, Y = i.height / i.width, w = (r - n) / (d - g), x = void 0, F = void 0, U = void 0, P = void 0, _ = void 0, X = void 0;
|
|
650
|
-
if (-S === w ? g > d ? (l[0] = v, l[1] = D, R = !0) : (l[0] = p, l[1] = a, R = !0) : S === w && (g > d ? (l[0] = h, l[1] = a, R = !0) : (l[0] = u, l[1] = D, R = !0)), -Y === w ? d > g ? (l[2] = c, l[3] =
|
|
650
|
+
if (-S === w ? g > d ? (l[0] = v, l[1] = D, R = !0) : (l[0] = p, l[1] = a, R = !0) : S === w && (g > d ? (l[0] = h, l[1] = a, R = !0) : (l[0] = u, l[1] = D, R = !0)), -Y === w ? d > g ? (l[2] = c, l[3] = E, M = !0) : (l[2] = f, l[3] = s, M = !0) : Y === w && (d > g ? (l[2] = O, l[3] = s, M = !0) : (l[2] = A, l[3] = E, M = !0)), R && M)
|
|
651
651
|
return !1;
|
|
652
652
|
if (g > d ? n > r ? (x = this.getCardinalDirection(S, w, 4), F = this.getCardinalDirection(Y, w, 2)) : (x = this.getCardinalDirection(-S, w, 3), F = this.getCardinalDirection(-Y, w, 1)) : n > r ? (x = this.getCardinalDirection(-S, w, 1), F = this.getCardinalDirection(-Y, w, 3)) : (x = this.getCardinalDirection(S, w, 2), F = this.getCardinalDirection(Y, w, 4)), !R)
|
|
653
653
|
switch (x) {
|
|
@@ -655,13 +655,13 @@ function ft() {
|
|
|
655
655
|
P = a, U = g + -y / w, l[0] = U, l[1] = P;
|
|
656
656
|
break;
|
|
657
657
|
case 2:
|
|
658
|
-
U = u, P = n +
|
|
658
|
+
U = u, P = n + T * w, l[0] = U, l[1] = P;
|
|
659
659
|
break;
|
|
660
660
|
case 3:
|
|
661
661
|
P = D, U = g + y / w, l[0] = U, l[1] = P;
|
|
662
662
|
break;
|
|
663
663
|
case 4:
|
|
664
|
-
U = v, P = n + -
|
|
664
|
+
U = v, P = n + -T * w, l[0] = U, l[1] = P;
|
|
665
665
|
break;
|
|
666
666
|
}
|
|
667
667
|
if (!M)
|
|
@@ -673,7 +673,7 @@ function ft() {
|
|
|
673
673
|
_ = A, X = r + m * w, l[2] = _, l[3] = X;
|
|
674
674
|
break;
|
|
675
675
|
case 3:
|
|
676
|
-
X =
|
|
676
|
+
X = E, _ = d + C / w, l[2] = _, l[3] = X;
|
|
677
677
|
break;
|
|
678
678
|
case 4:
|
|
679
679
|
_ = c, X = r + -m * w, l[2] = _, l[3] = X;
|
|
@@ -686,8 +686,8 @@ function ft() {
|
|
|
686
686
|
}, e.getIntersection = function(t, i, l, g) {
|
|
687
687
|
if (g == null)
|
|
688
688
|
return this.getIntersection2(t, i, l);
|
|
689
|
-
var n = t.x, d = t.y, r = i.x, h = i.y, a = l.x, p = l.y, v = g.x, D = g.y, u = void 0,
|
|
690
|
-
return y = h - d, s = n - r, c = r * d - n * h, O = D - p, f = a - v,
|
|
689
|
+
var n = t.x, d = t.y, r = i.x, h = i.y, a = l.x, p = l.y, v = g.x, D = g.y, u = void 0, T = void 0, y = void 0, O = void 0, s = void 0, f = void 0, c = void 0, E = void 0, A = void 0;
|
|
690
|
+
return y = h - d, s = n - r, c = r * d - n * h, O = D - p, f = a - v, E = v * p - a * D, A = y * f - O * s, A === 0 ? null : (u = (s * E - f * c) / A, T = (O * c - y * E) / A, new o(u, T));
|
|
691
691
|
}, e.angleOfVector = function(t, i, l, g) {
|
|
692
692
|
var n = void 0;
|
|
693
693
|
return t !== l ? (n = Math.atan((g - i) / (l - t)), l < t ? n += Math.PI : g < i && (n += this.TWO_PI)) : g < i ? n = this.ONE_AND_HALF_PI : n = this.HALF_PI, n;
|
|
@@ -695,13 +695,13 @@ function ft() {
|
|
|
695
695
|
var n = t.x, d = t.y, r = i.x, h = i.y, a = l.x, p = l.y, v = g.x, D = g.y, u = (r - n) * (D - p) - (v - a) * (h - d);
|
|
696
696
|
if (u === 0)
|
|
697
697
|
return !1;
|
|
698
|
-
var
|
|
699
|
-
return 0 <
|
|
698
|
+
var T = ((D - p) * (v - n) + (a - v) * (D - d)) / u, y = ((d - h) * (v - n) + (r - n) * (D - d)) / u;
|
|
699
|
+
return 0 < T && T < 1 && 0 < y && y < 1;
|
|
700
700
|
}, e.HALF_PI = 0.5 * Math.PI, e.ONE_AND_HALF_PI = 1.5 * Math.PI, e.TWO_PI = 2 * Math.PI, e.THREE_PI = 3 * Math.PI, N.exports = e;
|
|
701
701
|
}),
|
|
702
702
|
/* 9 */
|
|
703
703
|
/***/
|
|
704
|
-
(function(N, I,
|
|
704
|
+
(function(N, I, L) {
|
|
705
705
|
function o() {
|
|
706
706
|
}
|
|
707
707
|
o.sign = function(e) {
|
|
@@ -714,14 +714,14 @@ function ft() {
|
|
|
714
714
|
}),
|
|
715
715
|
/* 10 */
|
|
716
716
|
/***/
|
|
717
|
-
(function(N, I,
|
|
717
|
+
(function(N, I, L) {
|
|
718
718
|
function o() {
|
|
719
719
|
}
|
|
720
720
|
o.MAX_VALUE = 2147483647, o.MIN_VALUE = -2147483648, N.exports = o;
|
|
721
721
|
}),
|
|
722
722
|
/* 11 */
|
|
723
723
|
/***/
|
|
724
|
-
(function(N, I,
|
|
724
|
+
(function(N, I, L) {
|
|
725
725
|
var o = /* @__PURE__ */ (function() {
|
|
726
726
|
function n(d, r) {
|
|
727
727
|
for (var h = 0; h < r.length; h++) {
|
|
@@ -747,7 +747,7 @@ function ft() {
|
|
|
747
747
|
}, g = (function() {
|
|
748
748
|
function n(d) {
|
|
749
749
|
var r = this;
|
|
750
|
-
e(this, n), this.length = 0, this.head = null, this.tail = null, d
|
|
750
|
+
e(this, n), this.length = 0, this.head = null, this.tail = null, d?.forEach(function(h) {
|
|
751
751
|
return r.push(h);
|
|
752
752
|
});
|
|
753
753
|
}
|
|
@@ -835,7 +835,7 @@ function ft() {
|
|
|
835
835
|
}),
|
|
836
836
|
/* 12 */
|
|
837
837
|
/***/
|
|
838
|
-
(function(N, I,
|
|
838
|
+
(function(N, I, L) {
|
|
839
839
|
function o(e, t, i) {
|
|
840
840
|
this.x = null, this.y = null, e == null && t == null && i == null ? (this.x = 0, this.y = 0) : typeof e == "number" && typeof t == "number" && i == null ? (this.x = e, this.y = t) : e.constructor.name == "Point" && t == null && i == null && (i = e, this.x = i.x, this.y = i.y);
|
|
841
841
|
}
|
|
@@ -863,7 +863,7 @@ function ft() {
|
|
|
863
863
|
}),
|
|
864
864
|
/* 13 */
|
|
865
865
|
/***/
|
|
866
|
-
(function(N, I,
|
|
866
|
+
(function(N, I, L) {
|
|
867
867
|
function o(e, t, i, l) {
|
|
868
868
|
this.x = 0, this.y = 0, this.width = 0, this.height = 0, e != null && t != null && i != null && l != null && (this.x = e, this.y = t, this.width = i, this.height = l);
|
|
869
869
|
}
|
|
@@ -909,7 +909,7 @@ function ft() {
|
|
|
909
909
|
}),
|
|
910
910
|
/* 14 */
|
|
911
911
|
/***/
|
|
912
|
-
(function(N, I,
|
|
912
|
+
(function(N, I, L) {
|
|
913
913
|
var o = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(t) {
|
|
914
914
|
return typeof t;
|
|
915
915
|
} : function(t) {
|
|
@@ -928,7 +928,7 @@ function ft() {
|
|
|
928
928
|
}),
|
|
929
929
|
/* 15 */
|
|
930
930
|
/***/
|
|
931
|
-
(function(N, I,
|
|
931
|
+
(function(N, I, L) {
|
|
932
932
|
function o(a) {
|
|
933
933
|
if (Array.isArray(a)) {
|
|
934
934
|
for (var p = 0, v = Array(a.length); p < a.length; p++)
|
|
@@ -937,7 +937,7 @@ function ft() {
|
|
|
937
937
|
} else
|
|
938
938
|
return Array.from(a);
|
|
939
939
|
}
|
|
940
|
-
var e =
|
|
940
|
+
var e = L(0), t = L(6), i = L(3), l = L(1), g = L(5), n = L(4), d = L(17), r = L(27);
|
|
941
941
|
function h(a) {
|
|
942
942
|
r.call(this), this.layoutQuality = e.QUALITY, this.createBendsAsNeeded = e.DEFAULT_CREATE_BENDS_AS_NEEDED, this.incremental = e.DEFAULT_INCREMENTAL, this.animationOnLayout = e.DEFAULT_ANIMATION_ON_LAYOUT, this.animationDuringLayout = e.DEFAULT_ANIMATION_DURING_LAYOUT, this.animationPeriod = e.DEFAULT_ANIMATION_PERIOD, this.uniformLeafNodeSizes = e.DEFAULT_UNIFORM_LEAF_NODE_SIZES, this.edgeToDummyNodes = /* @__PURE__ */ new Map(), this.graphManager = new t(this), this.isLayoutFinished = !1, this.isSubLayout = !1, this.isRemoteUse = !1, a != null && (this.isRemoteUse = a);
|
|
943
943
|
}
|
|
@@ -987,10 +987,10 @@ function ft() {
|
|
|
987
987
|
u.update(p);
|
|
988
988
|
}
|
|
989
989
|
} else if (a instanceof l) {
|
|
990
|
-
var
|
|
991
|
-
if (
|
|
992
|
-
var y =
|
|
993
|
-
y.update(
|
|
990
|
+
var T = a;
|
|
991
|
+
if (T.vGraphObject != null) {
|
|
992
|
+
var y = T.vGraphObject;
|
|
993
|
+
y.update(T);
|
|
994
994
|
}
|
|
995
995
|
} else if (a instanceof g) {
|
|
996
996
|
var O = a;
|
|
@@ -1008,8 +1008,8 @@ function ft() {
|
|
|
1008
1008
|
var p = new d(), v = this.graphManager.getRoot().updateLeftTop();
|
|
1009
1009
|
if (v != null) {
|
|
1010
1010
|
p.setWorldOrgX(a.x), p.setWorldOrgY(a.y), p.setDeviceOrgX(v.x), p.setDeviceOrgY(v.y);
|
|
1011
|
-
for (var D = this.getAllNodes(), u,
|
|
1012
|
-
u = D[
|
|
1011
|
+
for (var D = this.getAllNodes(), u, T = 0; T < D.length; T++)
|
|
1012
|
+
u = D[T], u.transform(p);
|
|
1013
1013
|
}
|
|
1014
1014
|
}
|
|
1015
1015
|
}, h.prototype.positionNodesRandomly = function(a) {
|
|
@@ -1023,16 +1023,16 @@ function ft() {
|
|
|
1023
1023
|
v[u].getChild() != null && (D = !1);
|
|
1024
1024
|
if (!D)
|
|
1025
1025
|
return a;
|
|
1026
|
-
var
|
|
1026
|
+
var T = /* @__PURE__ */ new Set(), y = [], O = /* @__PURE__ */ new Map(), s = [];
|
|
1027
1027
|
for (s = s.concat(v); s.length > 0 && p; ) {
|
|
1028
1028
|
for (y.push(s[0]); y.length > 0 && p; ) {
|
|
1029
1029
|
var f = y[0];
|
|
1030
|
-
y.splice(0, 1),
|
|
1030
|
+
y.splice(0, 1), T.add(f);
|
|
1031
1031
|
for (var c = f.getEdges(), u = 0; u < c.length; u++) {
|
|
1032
|
-
var
|
|
1033
|
-
if (O.get(f) !=
|
|
1034
|
-
if (!
|
|
1035
|
-
y.push(
|
|
1032
|
+
var E = c[u].getOtherEnd(f);
|
|
1033
|
+
if (O.get(f) != E)
|
|
1034
|
+
if (!T.has(E))
|
|
1035
|
+
y.push(E), O.set(E, f);
|
|
1036
1036
|
else {
|
|
1037
1037
|
p = !1;
|
|
1038
1038
|
break;
|
|
@@ -1042,22 +1042,22 @@ function ft() {
|
|
|
1042
1042
|
if (!p)
|
|
1043
1043
|
a = [];
|
|
1044
1044
|
else {
|
|
1045
|
-
var A = [].concat(o(
|
|
1045
|
+
var A = [].concat(o(T));
|
|
1046
1046
|
a.push(A);
|
|
1047
1047
|
for (var u = 0; u < A.length; u++) {
|
|
1048
1048
|
var m = A[u], C = s.indexOf(m);
|
|
1049
1049
|
C > -1 && s.splice(C, 1);
|
|
1050
1050
|
}
|
|
1051
|
-
|
|
1051
|
+
T = /* @__PURE__ */ new Set(), O = /* @__PURE__ */ new Map();
|
|
1052
1052
|
}
|
|
1053
1053
|
}
|
|
1054
1054
|
return a;
|
|
1055
1055
|
}, h.prototype.createDummyNodesForBendpoints = function(a) {
|
|
1056
1056
|
for (var p = [], v = a.source, D = this.graphManager.calcLowestCommonAncestor(a.source, a.target), u = 0; u < a.bendpoints.length; u++) {
|
|
1057
|
-
var
|
|
1058
|
-
|
|
1057
|
+
var T = this.newNode(null);
|
|
1058
|
+
T.setRect(new Point(0, 0), new Dimension(1, 1)), D.add(T);
|
|
1059
1059
|
var y = this.newEdge(null);
|
|
1060
|
-
this.graphManager.add(y, v,
|
|
1060
|
+
this.graphManager.add(y, v, T), p.add(T), v = T;
|
|
1061
1061
|
}
|
|
1062
1062
|
var y = this.newEdge(null);
|
|
1063
1063
|
return this.graphManager.add(y, v, a.target), this.edgeToDummyNodes.set(a, p), a.isInterGraph() ? this.graphManager.remove(a) : D.remove(a), p;
|
|
@@ -1068,8 +1068,8 @@ function ft() {
|
|
|
1068
1068
|
var v = a[p];
|
|
1069
1069
|
if (v.bendpoints.length > 0) {
|
|
1070
1070
|
for (var D = this.edgeToDummyNodes.get(v), u = 0; u < D.length; u++) {
|
|
1071
|
-
var
|
|
1072
|
-
O.x = y.x, O.y = y.y,
|
|
1071
|
+
var T = D[u], y = new n(T.getCenterX(), T.getCenterY()), O = v.bendpoints.get(u);
|
|
1072
|
+
O.x = y.x, O.y = y.y, T.getOwner().remove(T);
|
|
1073
1073
|
}
|
|
1074
1074
|
this.graphManager.add(v, v.source, v.target);
|
|
1075
1075
|
}
|
|
@@ -1078,8 +1078,8 @@ function ft() {
|
|
|
1078
1078
|
if (v != null && D != null) {
|
|
1079
1079
|
var u = p;
|
|
1080
1080
|
if (a <= 50) {
|
|
1081
|
-
var
|
|
1082
|
-
u -= (p -
|
|
1081
|
+
var T = p / v;
|
|
1082
|
+
u -= (p - T) / 50 * (50 - a);
|
|
1083
1083
|
} else {
|
|
1084
1084
|
var y = p * D;
|
|
1085
1085
|
u += (y - p) / 50 * (a - 50);
|
|
@@ -1092,8 +1092,8 @@ function ft() {
|
|
|
1092
1092
|
}, h.findCenterOfTree = function(a) {
|
|
1093
1093
|
var p = [];
|
|
1094
1094
|
p = p.concat(a);
|
|
1095
|
-
var v = [], D = /* @__PURE__ */ new Map(), u = !1,
|
|
1096
|
-
(p.length == 1 || p.length == 2) && (u = !0,
|
|
1095
|
+
var v = [], D = /* @__PURE__ */ new Map(), u = !1, T = null;
|
|
1096
|
+
(p.length == 1 || p.length == 2) && (u = !0, T = p[0]);
|
|
1097
1097
|
for (var y = 0; y < p.length; y++) {
|
|
1098
1098
|
var O = p[y], s = O.getNeighborsList().size;
|
|
1099
1099
|
D.set(O, O.getNeighborsList().size), s == 1 && v.push(O);
|
|
@@ -1103,8 +1103,8 @@ function ft() {
|
|
|
1103
1103
|
var c = [];
|
|
1104
1104
|
c = c.concat(f), f = [];
|
|
1105
1105
|
for (var y = 0; y < p.length; y++) {
|
|
1106
|
-
var O = p[y],
|
|
1107
|
-
|
|
1106
|
+
var O = p[y], E = p.indexOf(O);
|
|
1107
|
+
E >= 0 && p.splice(E, 1);
|
|
1108
1108
|
var A = O.getNeighborsList();
|
|
1109
1109
|
A.forEach(function(R) {
|
|
1110
1110
|
if (v.indexOf(R) < 0) {
|
|
@@ -1113,16 +1113,16 @@ function ft() {
|
|
|
1113
1113
|
}
|
|
1114
1114
|
});
|
|
1115
1115
|
}
|
|
1116
|
-
v = v.concat(f), (p.length == 1 || p.length == 2) && (u = !0,
|
|
1116
|
+
v = v.concat(f), (p.length == 1 || p.length == 2) && (u = !0, T = p[0]);
|
|
1117
1117
|
}
|
|
1118
|
-
return
|
|
1118
|
+
return T;
|
|
1119
1119
|
}, h.prototype.setGraphManager = function(a) {
|
|
1120
1120
|
this.graphManager = a;
|
|
1121
1121
|
}, N.exports = h;
|
|
1122
1122
|
}),
|
|
1123
1123
|
/* 16 */
|
|
1124
1124
|
/***/
|
|
1125
|
-
(function(N, I,
|
|
1125
|
+
(function(N, I, L) {
|
|
1126
1126
|
function o() {
|
|
1127
1127
|
}
|
|
1128
1128
|
o.seed = 1, o.x = 0, o.nextDouble = function() {
|
|
@@ -1131,8 +1131,8 @@ function ft() {
|
|
|
1131
1131
|
}),
|
|
1132
1132
|
/* 17 */
|
|
1133
1133
|
/***/
|
|
1134
|
-
(function(N, I,
|
|
1135
|
-
var o =
|
|
1134
|
+
(function(N, I, L) {
|
|
1135
|
+
var o = L(4);
|
|
1136
1136
|
function e(t, i) {
|
|
1137
1137
|
this.lworldOrgX = 0, this.lworldOrgY = 0, this.ldeviceOrgX = 0, this.ldeviceOrgY = 0, this.lworldExtX = 1, this.lworldExtY = 1, this.ldeviceExtX = 1, this.ldeviceExtY = 1;
|
|
1138
1138
|
}
|
|
@@ -1187,7 +1187,7 @@ function ft() {
|
|
|
1187
1187
|
}),
|
|
1188
1188
|
/* 18 */
|
|
1189
1189
|
/***/
|
|
1190
|
-
(function(N, I,
|
|
1190
|
+
(function(N, I, L) {
|
|
1191
1191
|
function o(r) {
|
|
1192
1192
|
if (Array.isArray(r)) {
|
|
1193
1193
|
for (var h = 0, a = Array(r.length); h < r.length; h++)
|
|
@@ -1196,7 +1196,7 @@ function ft() {
|
|
|
1196
1196
|
} else
|
|
1197
1197
|
return Array.from(r);
|
|
1198
1198
|
}
|
|
1199
|
-
var e =
|
|
1199
|
+
var e = L(15), t = L(7), i = L(0), l = L(8), g = L(9);
|
|
1200
1200
|
function n() {
|
|
1201
1201
|
e.call(this), this.useSmartIdealEdgeLengthCalculation = t.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.idealEdgeLength = t.DEFAULT_EDGE_LENGTH, this.springConstant = t.DEFAULT_SPRING_STRENGTH, this.repulsionConstant = t.DEFAULT_REPULSION_STRENGTH, this.gravityConstant = t.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = t.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = t.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = t.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.displacementThresholdPerNode = 3 * t.DEFAULT_EDGE_LENGTH / 100, this.coolingFactor = t.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.initialCoolingFactor = t.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.totalDisplacement = 0, this.oldTotalDisplacement = 0, this.maxIterations = t.MAX_ITERATIONS;
|
|
1202
1202
|
}
|
|
@@ -1206,8 +1206,8 @@ function ft() {
|
|
|
1206
1206
|
n.prototype.initParameters = function() {
|
|
1207
1207
|
e.prototype.initParameters.call(this, arguments), this.totalIterations = 0, this.notAnimatedIterations = 0, this.useFRGridVariant = t.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION, this.grid = [];
|
|
1208
1208
|
}, n.prototype.calcIdealEdgeLengths = function() {
|
|
1209
|
-
for (var r, h, a, p, v, D, u = this.getGraphManager().getAllEdges(),
|
|
1210
|
-
r = u[
|
|
1209
|
+
for (var r, h, a, p, v, D, u = this.getGraphManager().getAllEdges(), T = 0; T < u.length; T++)
|
|
1210
|
+
r = u[T], r.idealLength = this.idealEdgeLength, r.isInterGraph && (a = r.getSource(), p = r.getTarget(), v = r.getSourceInLca().getEstimatedSize(), D = r.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (r.idealLength += v + D - 2 * i.SIMPLE_NODE_SIZE), h = r.getLca().getInclusionTreeDepth(), r.idealLength += t.DEFAULT_EDGE_LENGTH * t.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (a.getInclusionTreeDepth() + p.getInclusionTreeDepth() - 2 * h));
|
|
1211
1211
|
}, n.prototype.initSpringEmbedder = function() {
|
|
1212
1212
|
var r = this.getAllNodes().length;
|
|
1213
1213
|
this.incremental ? (r > t.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * t.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (r - t.ADAPTATION_LOWER_NODE_LIMIT) / (t.ADAPTATION_UPPER_NODE_LIMIT - t.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - t.COOLING_ADAPTATION_FACTOR))), this.maxNodeDisplacement = t.MAX_NODE_DISPLACEMENT_INCREMENTAL) : (r > t.ADAPTATION_LOWER_NODE_LIMIT ? this.coolingFactor = Math.max(t.COOLING_ADAPTATION_FACTOR, 1 - (r - t.ADAPTATION_LOWER_NODE_LIMIT) / (t.ADAPTATION_UPPER_NODE_LIMIT - t.ADAPTATION_LOWER_NODE_LIMIT) * (1 - t.COOLING_ADAPTATION_FACTOR)) : this.coolingFactor = 1, this.initialCoolingFactor = this.coolingFactor, this.maxNodeDisplacement = t.MAX_NODE_DISPLACEMENT), this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations), this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length, this.repulsionRange = this.calcRepulsionRange();
|
|
@@ -1215,10 +1215,10 @@ function ft() {
|
|
|
1215
1215
|
for (var r = this.getAllEdges(), h, a = 0; a < r.length; a++)
|
|
1216
1216
|
h = r[a], this.calcSpringForce(h, h.idealLength);
|
|
1217
1217
|
}, n.prototype.calcRepulsionForces = function() {
|
|
1218
|
-
var r = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, h = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, a, p, v, D, u = this.getAllNodes(),
|
|
1218
|
+
var r = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, h = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, a, p, v, D, u = this.getAllNodes(), T;
|
|
1219
1219
|
if (this.useFRGridVariant)
|
|
1220
|
-
for (this.totalIterations % t.GRID_CALCULATION_CHECK_PERIOD == 1 && r && this.updateGrid(),
|
|
1221
|
-
v = u[a], this.calculateRepulsionForceOfANode(v,
|
|
1220
|
+
for (this.totalIterations % t.GRID_CALCULATION_CHECK_PERIOD == 1 && r && this.updateGrid(), T = /* @__PURE__ */ new Set(), a = 0; a < u.length; a++)
|
|
1221
|
+
v = u[a], this.calculateRepulsionForceOfANode(v, T, r, h), T.add(v);
|
|
1222
1222
|
else
|
|
1223
1223
|
for (a = 0; a < u.length; a++)
|
|
1224
1224
|
for (v = u[a], p = a + 1; p < u.length; p++)
|
|
@@ -1230,23 +1230,23 @@ function ft() {
|
|
|
1230
1230
|
for (var r = this.getAllNodes(), h, a = 0; a < r.length; a++)
|
|
1231
1231
|
h = r[a], h.move();
|
|
1232
1232
|
}, n.prototype.calcSpringForce = function(r, h) {
|
|
1233
|
-
var a = r.getSource(), p = r.getTarget(), v, D, u,
|
|
1233
|
+
var a = r.getSource(), p = r.getTarget(), v, D, u, T;
|
|
1234
1234
|
if (this.uniformLeafNodeSizes && a.getChild() == null && p.getChild() == null)
|
|
1235
1235
|
r.updateLengthSimple();
|
|
1236
1236
|
else if (r.updateLength(), r.isOverlapingSourceAndTarget)
|
|
1237
1237
|
return;
|
|
1238
|
-
v = r.getLength(), v != 0 && (D = this.springConstant * (v - h), u = D * (r.lengthX / v),
|
|
1238
|
+
v = r.getLength(), v != 0 && (D = this.springConstant * (v - h), u = D * (r.lengthX / v), T = D * (r.lengthY / v), a.springForceX += u, a.springForceY += T, p.springForceX -= u, p.springForceY -= T);
|
|
1239
1239
|
}, n.prototype.calcRepulsionForce = function(r, h) {
|
|
1240
|
-
var a = r.getRect(), p = h.getRect(), v = new Array(2), D = new Array(4), u,
|
|
1240
|
+
var a = r.getRect(), p = h.getRect(), v = new Array(2), D = new Array(4), u, T, y, O, s, f, c;
|
|
1241
1241
|
if (a.intersects(p)) {
|
|
1242
1242
|
l.calcSeparationAmount(a, p, v, t.DEFAULT_EDGE_LENGTH / 2), f = 2 * v[0], c = 2 * v[1];
|
|
1243
|
-
var
|
|
1244
|
-
r.repulsionForceX -=
|
|
1243
|
+
var E = r.noOfChildren * h.noOfChildren / (r.noOfChildren + h.noOfChildren);
|
|
1244
|
+
r.repulsionForceX -= E * f, r.repulsionForceY -= E * c, h.repulsionForceX += E * f, h.repulsionForceY += E * c;
|
|
1245
1245
|
} else
|
|
1246
|
-
this.uniformLeafNodeSizes && r.getChild() == null && h.getChild() == null ? (u = p.getCenterX() - a.getCenterX(),
|
|
1246
|
+
this.uniformLeafNodeSizes && r.getChild() == null && h.getChild() == null ? (u = p.getCenterX() - a.getCenterX(), T = p.getCenterY() - a.getCenterY()) : (l.getIntersection(a, p, D), u = D[2] - D[0], T = D[3] - D[1]), Math.abs(u) < t.MIN_REPULSION_DIST && (u = g.sign(u) * t.MIN_REPULSION_DIST), Math.abs(T) < t.MIN_REPULSION_DIST && (T = g.sign(T) * t.MIN_REPULSION_DIST), y = u * u + T * T, O = Math.sqrt(y), s = this.repulsionConstant * r.noOfChildren * h.noOfChildren / y, f = s * u / O, c = s * T / O, r.repulsionForceX -= f, r.repulsionForceY -= c, h.repulsionForceX += f, h.repulsionForceY += c;
|
|
1247
1247
|
}, n.prototype.calcGravitationalForce = function(r) {
|
|
1248
|
-
var h, a, p, v, D, u,
|
|
1249
|
-
h = r.getOwner(), a = (h.getRight() + h.getLeft()) / 2, p = (h.getTop() + h.getBottom()) / 2, v = r.getCenterX() - a, D = r.getCenterY() - p, u = Math.abs(v) + r.getWidth() / 2,
|
|
1248
|
+
var h, a, p, v, D, u, T, y;
|
|
1249
|
+
h = r.getOwner(), a = (h.getRight() + h.getLeft()) / 2, p = (h.getTop() + h.getBottom()) / 2, v = r.getCenterX() - a, D = r.getCenterY() - p, u = Math.abs(v) + r.getWidth() / 2, T = Math.abs(D) + r.getHeight() / 2, r.getOwner() == this.graphManager.getRoot() ? (y = h.getEstimatedSize() * this.gravityRangeFactor, (u > y || T > y) && (r.gravitationForceX = -this.gravityConstant * v, r.gravitationForceY = -this.gravityConstant * D)) : (y = h.getEstimatedSize() * this.compoundGravityRangeFactor, (u > y || T > y) && (r.gravitationForceX = -this.gravityConstant * v * this.compoundGravityConstant, r.gravitationForceY = -this.gravityConstant * D * this.compoundGravityConstant));
|
|
1250
1250
|
}, n.prototype.isConverged = function() {
|
|
1251
1251
|
var r, h = !1;
|
|
1252
1252
|
return this.totalIterations > this.maxIterations / 3 && (h = Math.abs(this.totalDisplacement - this.oldTotalDisplacement) < 2), r = this.totalDisplacement < this.totalDisplacementThreshold, this.oldTotalDisplacement = this.totalDisplacement, r || h;
|
|
@@ -1267,9 +1267,9 @@ function ft() {
|
|
|
1267
1267
|
}, n.prototype.addNodeToGrid = function(r, h, a) {
|
|
1268
1268
|
var p = 0, v = 0, D = 0, u = 0;
|
|
1269
1269
|
p = parseInt(Math.floor((r.getRect().x - h) / this.repulsionRange)), v = parseInt(Math.floor((r.getRect().width + r.getRect().x - h) / this.repulsionRange)), D = parseInt(Math.floor((r.getRect().y - a) / this.repulsionRange)), u = parseInt(Math.floor((r.getRect().height + r.getRect().y - a) / this.repulsionRange));
|
|
1270
|
-
for (var
|
|
1270
|
+
for (var T = p; T <= v; T++)
|
|
1271
1271
|
for (var y = D; y <= u; y++)
|
|
1272
|
-
this.grid[
|
|
1272
|
+
this.grid[T][y].push(r), r.setGridCoordinates(p, v, D, u);
|
|
1273
1273
|
}, n.prototype.updateGrid = function() {
|
|
1274
1274
|
var r, h, a = this.getAllNodes();
|
|
1275
1275
|
for (this.grid = this.calcGrid(this.graphManager.getRoot()), r = 0; r < a.length; r++)
|
|
@@ -1278,27 +1278,27 @@ function ft() {
|
|
|
1278
1278
|
if (this.totalIterations % t.GRID_CALCULATION_CHECK_PERIOD == 1 && a || p) {
|
|
1279
1279
|
var v = /* @__PURE__ */ new Set();
|
|
1280
1280
|
r.surrounding = new Array();
|
|
1281
|
-
for (var D, u = this.grid,
|
|
1281
|
+
for (var D, u = this.grid, T = r.startX - 1; T < r.finishX + 2; T++)
|
|
1282
1282
|
for (var y = r.startY - 1; y < r.finishY + 2; y++)
|
|
1283
|
-
if (!(
|
|
1284
|
-
for (var O = 0; O < u[
|
|
1285
|
-
if (D = u[
|
|
1283
|
+
if (!(T < 0 || y < 0 || T >= u.length || y >= u[0].length)) {
|
|
1284
|
+
for (var O = 0; O < u[T][y].length; O++)
|
|
1285
|
+
if (D = u[T][y][O], !(r.getOwner() != D.getOwner() || r == D) && !h.has(D) && !v.has(D)) {
|
|
1286
1286
|
var s = Math.abs(r.getCenterX() - D.getCenterX()) - (r.getWidth() / 2 + D.getWidth() / 2), f = Math.abs(r.getCenterY() - D.getCenterY()) - (r.getHeight() / 2 + D.getHeight() / 2);
|
|
1287
1287
|
s <= this.repulsionRange && f <= this.repulsionRange && v.add(D);
|
|
1288
1288
|
}
|
|
1289
1289
|
}
|
|
1290
1290
|
r.surrounding = [].concat(o(v));
|
|
1291
1291
|
}
|
|
1292
|
-
for (
|
|
1293
|
-
this.calcRepulsionForce(r, r.surrounding[
|
|
1292
|
+
for (T = 0; T < r.surrounding.length; T++)
|
|
1293
|
+
this.calcRepulsionForce(r, r.surrounding[T]);
|
|
1294
1294
|
}, n.prototype.calcRepulsionRange = function() {
|
|
1295
1295
|
return 0;
|
|
1296
1296
|
}, N.exports = n;
|
|
1297
1297
|
}),
|
|
1298
1298
|
/* 19 */
|
|
1299
1299
|
/***/
|
|
1300
|
-
(function(N, I,
|
|
1301
|
-
var o =
|
|
1300
|
+
(function(N, I, L) {
|
|
1301
|
+
var o = L(1), e = L(7);
|
|
1302
1302
|
function t(l, g, n) {
|
|
1303
1303
|
o.call(this, l, g, n), this.idealLength = e.DEFAULT_EDGE_LENGTH;
|
|
1304
1304
|
}
|
|
@@ -1309,8 +1309,8 @@ function ft() {
|
|
|
1309
1309
|
}),
|
|
1310
1310
|
/* 20 */
|
|
1311
1311
|
/***/
|
|
1312
|
-
(function(N, I,
|
|
1313
|
-
var o =
|
|
1312
|
+
(function(N, I, L) {
|
|
1313
|
+
var o = L(3);
|
|
1314
1314
|
function e(i, l, g, n) {
|
|
1315
1315
|
o.call(this, i, l, g, n), this.springForceX = 0, this.springForceY = 0, this.repulsionForceX = 0, this.repulsionForceY = 0, this.gravitationForceX = 0, this.gravitationForceY = 0, this.displacementX = 0, this.displacementY = 0, this.startX = 0, this.finishX = 0, this.startY = 0, this.finishY = 0, this.surrounding = [];
|
|
1316
1316
|
}
|
|
@@ -1323,7 +1323,7 @@ function ft() {
|
|
|
1323
1323
|
}),
|
|
1324
1324
|
/* 21 */
|
|
1325
1325
|
/***/
|
|
1326
|
-
(function(N, I,
|
|
1326
|
+
(function(N, I, L) {
|
|
1327
1327
|
function o(e, t) {
|
|
1328
1328
|
this.width = 0, this.height = 0, e !== null && t !== null && (this.height = t, this.width = e);
|
|
1329
1329
|
}
|
|
@@ -1339,8 +1339,8 @@ function ft() {
|
|
|
1339
1339
|
}),
|
|
1340
1340
|
/* 22 */
|
|
1341
1341
|
/***/
|
|
1342
|
-
(function(N, I,
|
|
1343
|
-
var o =
|
|
1342
|
+
(function(N, I, L) {
|
|
1343
|
+
var o = L(14);
|
|
1344
1344
|
function e() {
|
|
1345
1345
|
this.map = {}, this.keys = [];
|
|
1346
1346
|
}
|
|
@@ -1358,8 +1358,8 @@ function ft() {
|
|
|
1358
1358
|
}),
|
|
1359
1359
|
/* 23 */
|
|
1360
1360
|
/***/
|
|
1361
|
-
(function(N, I,
|
|
1362
|
-
var o =
|
|
1361
|
+
(function(N, I, L) {
|
|
1362
|
+
var o = L(14);
|
|
1363
1363
|
function e() {
|
|
1364
1364
|
this.set = {};
|
|
1365
1365
|
}
|
|
@@ -1390,7 +1390,7 @@ function ft() {
|
|
|
1390
1390
|
}),
|
|
1391
1391
|
/* 24 */
|
|
1392
1392
|
/***/
|
|
1393
|
-
(function(N, I,
|
|
1393
|
+
(function(N, I, L) {
|
|
1394
1394
|
var o = /* @__PURE__ */ (function() {
|
|
1395
1395
|
function l(g, n) {
|
|
1396
1396
|
for (var d = 0; d < n.length; d++) {
|
|
@@ -1406,7 +1406,7 @@ function ft() {
|
|
|
1406
1406
|
if (!(l instanceof g))
|
|
1407
1407
|
throw new TypeError("Cannot call a class as a function");
|
|
1408
1408
|
}
|
|
1409
|
-
var t =
|
|
1409
|
+
var t = L(11), i = (function() {
|
|
1410
1410
|
function l(g, n) {
|
|
1411
1411
|
e(this, l), (n !== null || n !== void 0) && (this.compareFunction = this._defaultCompareFunction);
|
|
1412
1412
|
var d = void 0;
|
|
@@ -1460,7 +1460,7 @@ function ft() {
|
|
|
1460
1460
|
}),
|
|
1461
1461
|
/* 25 */
|
|
1462
1462
|
/***/
|
|
1463
|
-
(function(N, I,
|
|
1463
|
+
(function(N, I, L) {
|
|
1464
1464
|
var o = /* @__PURE__ */ (function() {
|
|
1465
1465
|
function i(l, g) {
|
|
1466
1466
|
for (var n = 0; n < g.length; n++) {
|
|
@@ -1569,14 +1569,14 @@ function ft() {
|
|
|
1569
1569
|
}),
|
|
1570
1570
|
/* 26 */
|
|
1571
1571
|
/***/
|
|
1572
|
-
(function(N, I,
|
|
1572
|
+
(function(N, I, L) {
|
|
1573
1573
|
var o = function() {
|
|
1574
1574
|
};
|
|
1575
|
-
o.FDLayout =
|
|
1575
|
+
o.FDLayout = L(18), o.FDLayoutConstants = L(7), o.FDLayoutEdge = L(19), o.FDLayoutNode = L(20), o.DimensionD = L(21), o.HashMap = L(22), o.HashSet = L(23), o.IGeometry = L(8), o.IMath = L(9), o.Integer = L(10), o.Point = L(12), o.PointD = L(4), o.RandomSeed = L(16), o.RectangleD = L(13), o.Transform = L(17), o.UniqueIDGeneretor = L(14), o.Quicksort = L(24), o.LinkedList = L(11), o.LGraphObject = L(2), o.LGraph = L(5), o.LEdge = L(1), o.LGraphManager = L(6), o.LNode = L(3), o.Layout = L(15), o.LayoutConstants = L(0), o.NeedlemanWunsch = L(25), N.exports = o;
|
|
1576
1576
|
}),
|
|
1577
1577
|
/* 27 */
|
|
1578
1578
|
/***/
|
|
1579
|
-
(function(N, I,
|
|
1579
|
+
(function(N, I, L) {
|
|
1580
1580
|
function o() {
|
|
1581
1581
|
this.listeners = [];
|
|
1582
1582
|
}
|
|
@@ -1607,17 +1607,17 @@ function ft() {
|
|
|
1607
1607
|
var ct = Z.exports, z;
|
|
1608
1608
|
function pt() {
|
|
1609
1609
|
return z || (z = 1, (function(G, b) {
|
|
1610
|
-
(function(I,
|
|
1611
|
-
G.exports =
|
|
1610
|
+
(function(I, L) {
|
|
1611
|
+
G.exports = L(ft());
|
|
1612
1612
|
})(ct, function(N) {
|
|
1613
1613
|
return (
|
|
1614
1614
|
/******/
|
|
1615
1615
|
(function(I) {
|
|
1616
|
-
var
|
|
1616
|
+
var L = {};
|
|
1617
1617
|
function o(e) {
|
|
1618
|
-
if (
|
|
1619
|
-
return
|
|
1620
|
-
var t =
|
|
1618
|
+
if (L[e])
|
|
1619
|
+
return L[e].exports;
|
|
1620
|
+
var t = L[e] = {
|
|
1621
1621
|
/******/
|
|
1622
1622
|
i: e,
|
|
1623
1623
|
/******/
|
|
@@ -1628,7 +1628,7 @@ function pt() {
|
|
|
1628
1628
|
};
|
|
1629
1629
|
return I[e].call(t.exports, t, t.exports, o), t.l = !0, t.exports;
|
|
1630
1630
|
}
|
|
1631
|
-
return o.m = I, o.c =
|
|
1631
|
+
return o.m = I, o.c = L, o.i = function(e) {
|
|
1632
1632
|
return e;
|
|
1633
1633
|
}, o.d = function(e, t, i) {
|
|
1634
1634
|
o.o(e, t) || Object.defineProperty(e, t, {
|
|
@@ -1659,12 +1659,12 @@ function pt() {
|
|
|
1659
1659
|
})([
|
|
1660
1660
|
/* 0 */
|
|
1661
1661
|
/***/
|
|
1662
|
-
(function(I,
|
|
1662
|
+
(function(I, L) {
|
|
1663
1663
|
I.exports = N;
|
|
1664
1664
|
}),
|
|
1665
1665
|
/* 1 */
|
|
1666
1666
|
/***/
|
|
1667
|
-
(function(I,
|
|
1667
|
+
(function(I, L, o) {
|
|
1668
1668
|
var e = o(0).FDLayoutConstants;
|
|
1669
1669
|
function t() {
|
|
1670
1670
|
}
|
|
@@ -1674,7 +1674,7 @@ function pt() {
|
|
|
1674
1674
|
}),
|
|
1675
1675
|
/* 2 */
|
|
1676
1676
|
/***/
|
|
1677
|
-
(function(I,
|
|
1677
|
+
(function(I, L, o) {
|
|
1678
1678
|
var e = o(0).FDLayoutEdge;
|
|
1679
1679
|
function t(l, g, n) {
|
|
1680
1680
|
e.call(this, l, g, n);
|
|
@@ -1686,7 +1686,7 @@ function pt() {
|
|
|
1686
1686
|
}),
|
|
1687
1687
|
/* 3 */
|
|
1688
1688
|
/***/
|
|
1689
|
-
(function(I,
|
|
1689
|
+
(function(I, L, o) {
|
|
1690
1690
|
var e = o(0).LGraph;
|
|
1691
1691
|
function t(l, g, n) {
|
|
1692
1692
|
e.call(this, l, g, n);
|
|
@@ -1698,7 +1698,7 @@ function pt() {
|
|
|
1698
1698
|
}),
|
|
1699
1699
|
/* 4 */
|
|
1700
1700
|
/***/
|
|
1701
|
-
(function(I,
|
|
1701
|
+
(function(I, L, o) {
|
|
1702
1702
|
var e = o(0).LGraphManager;
|
|
1703
1703
|
function t(l) {
|
|
1704
1704
|
e.call(this, l);
|
|
@@ -1710,7 +1710,7 @@ function pt() {
|
|
|
1710
1710
|
}),
|
|
1711
1711
|
/* 5 */
|
|
1712
1712
|
/***/
|
|
1713
|
-
(function(I,
|
|
1713
|
+
(function(I, L, o) {
|
|
1714
1714
|
var e = o(0).FDLayoutNode, t = o(0).IMath;
|
|
1715
1715
|
function i(g, n, d, r) {
|
|
1716
1716
|
e.call(this, g, n, d, r);
|
|
@@ -1742,8 +1742,8 @@ function pt() {
|
|
|
1742
1742
|
}),
|
|
1743
1743
|
/* 6 */
|
|
1744
1744
|
/***/
|
|
1745
|
-
(function(I,
|
|
1746
|
-
var e = o(0).FDLayout, t = o(4), i = o(3), l = o(5), g = o(2), n = o(1), d = o(0).FDLayoutConstants, r = o(0).LayoutConstants, h = o(0).Point, a = o(0).PointD, p = o(0).Layout, v = o(0).Integer, D = o(0).IGeometry, u = o(0).LGraph,
|
|
1745
|
+
(function(I, L, o) {
|
|
1746
|
+
var e = o(0).FDLayout, t = o(4), i = o(3), l = o(5), g = o(2), n = o(1), d = o(0).FDLayoutConstants, r = o(0).LayoutConstants, h = o(0).Point, a = o(0).PointD, p = o(0).Layout, v = o(0).Integer, D = o(0).IGeometry, u = o(0).LGraph, T = o(0).Transform;
|
|
1747
1747
|
function y() {
|
|
1748
1748
|
e.call(this), this.toBeTiled = {};
|
|
1749
1749
|
}
|
|
@@ -1779,8 +1779,8 @@ function pt() {
|
|
|
1779
1779
|
this.positionNodesRadially(s);
|
|
1780
1780
|
else {
|
|
1781
1781
|
this.reduceTrees(), this.graphManager.resetAllNodesToApplyGravitation();
|
|
1782
|
-
var f = new Set(this.getAllNodes()), c = this.nodesWithGravity.filter(function(
|
|
1783
|
-
return f.has(
|
|
1782
|
+
var f = new Set(this.getAllNodes()), c = this.nodesWithGravity.filter(function(E) {
|
|
1783
|
+
return f.has(E);
|
|
1784
1784
|
});
|
|
1785
1785
|
this.graphManager.setAllNodesToApplyGravitation(c), this.positionNodesRandomly();
|
|
1786
1786
|
}
|
|
@@ -1817,17 +1817,17 @@ function pt() {
|
|
|
1817
1817
|
return !0;
|
|
1818
1818
|
this.afterGrowthIterations % 10 == 0 && (this.graphManager.updateBounds(), this.updateGrid()), this.coolingFactor = d.DEFAULT_COOLING_FACTOR_INCREMENTAL * ((100 - this.afterGrowthIterations) / 100), this.afterGrowthIterations++;
|
|
1819
1819
|
}
|
|
1820
|
-
var c = !this.isTreeGrowing && !this.isGrowthFinished,
|
|
1821
|
-
return this.totalDisplacement = 0, this.graphManager.updateBounds(), this.calcSpringForces(), this.calcRepulsionForces(c,
|
|
1820
|
+
var c = !this.isTreeGrowing && !this.isGrowthFinished, E = this.growTreeIterations % 10 == 1 && this.isTreeGrowing || this.afterGrowthIterations % 10 == 1 && this.isGrowthFinished;
|
|
1821
|
+
return this.totalDisplacement = 0, this.graphManager.updateBounds(), this.calcSpringForces(), this.calcRepulsionForces(c, E), this.calcGravitationalForces(), this.moveNodes(), this.animate(), !1;
|
|
1822
1822
|
}, y.prototype.getPositionsData = function() {
|
|
1823
1823
|
for (var s = this.graphManager.getAllNodes(), f = {}, c = 0; c < s.length; c++) {
|
|
1824
|
-
var
|
|
1824
|
+
var E = s[c].rect, A = s[c].id;
|
|
1825
1825
|
f[A] = {
|
|
1826
1826
|
id: A,
|
|
1827
|
-
x:
|
|
1828
|
-
y:
|
|
1829
|
-
w:
|
|
1830
|
-
h:
|
|
1827
|
+
x: E.getCenterX(),
|
|
1828
|
+
y: E.getCenterY(),
|
|
1829
|
+
w: E.width,
|
|
1830
|
+
h: E.height
|
|
1831
1831
|
};
|
|
1832
1832
|
}
|
|
1833
1833
|
return f;
|
|
@@ -1842,8 +1842,8 @@ function pt() {
|
|
|
1842
1842
|
this.graphManager.updateBounds();
|
|
1843
1843
|
}
|
|
1844
1844
|
}, y.prototype.calculateNodesToApplyGravitationTo = function() {
|
|
1845
|
-
var s = [], f, c = this.graphManager.getGraphs(),
|
|
1846
|
-
for (A = 0; A <
|
|
1845
|
+
var s = [], f, c = this.graphManager.getGraphs(), E = c.length, A;
|
|
1846
|
+
for (A = 0; A < E; A++)
|
|
1847
1847
|
f = c[A], f.updateConnected(), f.isConnected || (s = s.concat(f.getNodes()));
|
|
1848
1848
|
return s;
|
|
1849
1849
|
}, y.prototype.createBendpoints = function() {
|
|
@@ -1851,11 +1851,11 @@ function pt() {
|
|
|
1851
1851
|
s = s.concat(this.graphManager.getAllEdges());
|
|
1852
1852
|
var f = /* @__PURE__ */ new Set(), c;
|
|
1853
1853
|
for (c = 0; c < s.length; c++) {
|
|
1854
|
-
var
|
|
1855
|
-
if (!f.has(
|
|
1856
|
-
var A =
|
|
1854
|
+
var E = s[c];
|
|
1855
|
+
if (!f.has(E)) {
|
|
1856
|
+
var A = E.getSource(), m = E.getTarget();
|
|
1857
1857
|
if (A == m)
|
|
1858
|
-
|
|
1858
|
+
E.getBendpoints().push(new a()), E.getBendpoints().push(new a()), this.createDummyNodesForBendpoints(E), f.add(E);
|
|
1859
1859
|
else {
|
|
1860
1860
|
var C = [];
|
|
1861
1861
|
if (C = C.concat(A.getEdgeListToNode(m)), C = C.concat(m.getEdgeListToNode(A)), !f.has(C[0])) {
|
|
@@ -1876,16 +1876,16 @@ function pt() {
|
|
|
1876
1876
|
break;
|
|
1877
1877
|
}
|
|
1878
1878
|
}, y.prototype.positionNodesRadially = function(s) {
|
|
1879
|
-
for (var f = new h(0, 0), c = Math.ceil(Math.sqrt(s.length)),
|
|
1880
|
-
R % c == 0 && (m = 0, A =
|
|
1879
|
+
for (var f = new h(0, 0), c = Math.ceil(Math.sqrt(s.length)), E = 0, A = 0, m = 0, C = new a(0, 0), R = 0; R < s.length; R++) {
|
|
1880
|
+
R % c == 0 && (m = 0, A = E, R != 0 && (A += n.DEFAULT_COMPONENT_SEPERATION), E = 0);
|
|
1881
1881
|
var M = s[R], S = p.findCenterOfTree(M);
|
|
1882
|
-
f.x = m, f.y = A, C = y.radialLayout(M, S, f), C.y >
|
|
1882
|
+
f.x = m, f.y = A, C = y.radialLayout(M, S, f), C.y > E && (E = Math.floor(C.y)), m = Math.floor(C.x + n.DEFAULT_COMPONENT_SEPERATION);
|
|
1883
1883
|
}
|
|
1884
1884
|
this.transform(new a(r.WORLD_CENTER_X - C.x / 2, r.WORLD_CENTER_Y - C.y / 2));
|
|
1885
1885
|
}, y.radialLayout = function(s, f, c) {
|
|
1886
|
-
var
|
|
1887
|
-
y.branchRadialLayout(f, null, 0, 359, 0,
|
|
1888
|
-
var A = u.calculateBounds(s), m = new
|
|
1886
|
+
var E = Math.max(this.maxDiagonalInTree(s), n.DEFAULT_RADIAL_SEPARATION);
|
|
1887
|
+
y.branchRadialLayout(f, null, 0, 359, 0, E);
|
|
1888
|
+
var A = u.calculateBounds(s), m = new T();
|
|
1889
1889
|
m.setDeviceOrgX(A.getMinX()), m.setDeviceOrgY(A.getMinY()), m.setWorldOrgX(c.x), m.setWorldOrgY(c.y);
|
|
1890
1890
|
for (var C = 0; C < s.length; C++) {
|
|
1891
1891
|
var R = s[C];
|
|
@@ -1893,8 +1893,8 @@ function pt() {
|
|
|
1893
1893
|
}
|
|
1894
1894
|
var M = new a(A.getMaxX(), A.getMaxY());
|
|
1895
1895
|
return m.inverseTransformPoint(M);
|
|
1896
|
-
}, y.branchRadialLayout = function(s, f, c,
|
|
1897
|
-
var C = (
|
|
1896
|
+
}, y.branchRadialLayout = function(s, f, c, E, A, m) {
|
|
1897
|
+
var C = (E - c + 1) / 2;
|
|
1898
1898
|
C < 0 && (C += 180);
|
|
1899
1899
|
var R = (C + c) % 360, M = R * D.TWO_PI / 360, S = A * Math.cos(M), Y = A * Math.sin(M);
|
|
1900
1900
|
s.setCenter(S, Y);
|
|
@@ -1909,7 +1909,7 @@ function pt() {
|
|
|
1909
1909
|
H >= 0 && w.splice(H, 1), U--, x--;
|
|
1910
1910
|
}
|
|
1911
1911
|
f != null ? P = (w.indexOf(_[0]) + 1) % U : P = 0;
|
|
1912
|
-
for (var W = Math.abs(
|
|
1912
|
+
for (var W = Math.abs(E - c) / x, B = P; F != x; B = ++B % U) {
|
|
1913
1913
|
var K = w[B].getOtherEnd(s);
|
|
1914
1914
|
if (K != f) {
|
|
1915
1915
|
var q = (c + F * W) % 360, ht = (q + W) % 360;
|
|
@@ -1918,7 +1918,7 @@ function pt() {
|
|
|
1918
1918
|
}
|
|
1919
1919
|
}, y.maxDiagonalInTree = function(s) {
|
|
1920
1920
|
for (var f = v.MIN_VALUE, c = 0; c < s.length; c++) {
|
|
1921
|
-
var
|
|
1921
|
+
var E = s[c], A = E.getDiagonal();
|
|
1922
1922
|
A > f && (f = A);
|
|
1923
1923
|
}
|
|
1924
1924
|
return f;
|
|
@@ -1927,8 +1927,8 @@ function pt() {
|
|
|
1927
1927
|
}, y.prototype.groupZeroDegreeMembers = function() {
|
|
1928
1928
|
var s = this, f = {};
|
|
1929
1929
|
this.memberGroups = {}, this.idToDummyNode = {};
|
|
1930
|
-
for (var c = [],
|
|
1931
|
-
var m =
|
|
1930
|
+
for (var c = [], E = this.graphManager.getAllNodes(), A = 0; A < E.length; A++) {
|
|
1931
|
+
var m = E[A], C = m.getParent();
|
|
1932
1932
|
this.getNodeDegreeWithChildren(m) === 0 && (C.id == null || !this.getToBeTiled(C)) && c.push(m);
|
|
1933
1933
|
}
|
|
1934
1934
|
for (var A = 0; A < c.length; A++) {
|
|
@@ -1958,19 +1958,19 @@ function pt() {
|
|
|
1958
1958
|
}, y.prototype.clearZeroDegreeMembers = function() {
|
|
1959
1959
|
var s = this, f = this.tiledZeroDegreePack = [];
|
|
1960
1960
|
Object.keys(this.memberGroups).forEach(function(c) {
|
|
1961
|
-
var
|
|
1962
|
-
f[c] = s.tileNodes(s.memberGroups[c],
|
|
1961
|
+
var E = s.idToDummyNode[c];
|
|
1962
|
+
f[c] = s.tileNodes(s.memberGroups[c], E.paddingLeft + E.paddingRight), E.rect.width = f[c].width, E.rect.height = f[c].height;
|
|
1963
1963
|
});
|
|
1964
1964
|
}, y.prototype.repopulateCompounds = function() {
|
|
1965
1965
|
for (var s = this.compoundOrder.length - 1; s >= 0; s--) {
|
|
1966
|
-
var f = this.compoundOrder[s], c = f.id,
|
|
1967
|
-
this.adjustLocations(this.tiledMemberPack[c], f.rect.x, f.rect.y,
|
|
1966
|
+
var f = this.compoundOrder[s], c = f.id, E = f.paddingLeft, A = f.paddingTop;
|
|
1967
|
+
this.adjustLocations(this.tiledMemberPack[c], f.rect.x, f.rect.y, E, A);
|
|
1968
1968
|
}
|
|
1969
1969
|
}, y.prototype.repopulateZeroDegreeMembers = function() {
|
|
1970
1970
|
var s = this, f = this.tiledZeroDegreePack;
|
|
1971
1971
|
Object.keys(f).forEach(function(c) {
|
|
1972
|
-
var
|
|
1973
|
-
s.adjustLocations(f[c],
|
|
1972
|
+
var E = s.idToDummyNode[c], A = E.paddingLeft, m = E.paddingTop;
|
|
1973
|
+
s.adjustLocations(f[c], E.rect.x, E.rect.y, A, m);
|
|
1974
1974
|
});
|
|
1975
1975
|
}, y.prototype.getToBeTiled = function(s) {
|
|
1976
1976
|
var f = s.id;
|
|
@@ -1979,8 +1979,8 @@ function pt() {
|
|
|
1979
1979
|
var c = s.getChild();
|
|
1980
1980
|
if (c == null)
|
|
1981
1981
|
return this.toBeTiled[f] = !1, !1;
|
|
1982
|
-
for (var
|
|
1983
|
-
var m =
|
|
1982
|
+
for (var E = c.getNodes(), A = 0; A < E.length; A++) {
|
|
1983
|
+
var m = E[A];
|
|
1984
1984
|
if (this.getNodeDegree(m) > 0)
|
|
1985
1985
|
return this.toBeTiled[f] = !1, !1;
|
|
1986
1986
|
if (m.getChild() == null) {
|
|
@@ -1993,8 +1993,8 @@ function pt() {
|
|
|
1993
1993
|
return this.toBeTiled[f] = !0, !0;
|
|
1994
1994
|
}, y.prototype.getNodeDegree = function(s) {
|
|
1995
1995
|
s.id;
|
|
1996
|
-
for (var f = s.getEdges(), c = 0,
|
|
1997
|
-
var A = f[
|
|
1996
|
+
for (var f = s.getEdges(), c = 0, E = 0; E < f.length; E++) {
|
|
1997
|
+
var A = f[E];
|
|
1998
1998
|
A.getSource().id !== A.getTarget().id && (c = c + 1);
|
|
1999
1999
|
}
|
|
2000
2000
|
return c;
|
|
@@ -2002,8 +2002,8 @@ function pt() {
|
|
|
2002
2002
|
var f = this.getNodeDegree(s);
|
|
2003
2003
|
if (s.getChild() == null)
|
|
2004
2004
|
return f;
|
|
2005
|
-
for (var c = s.getChild().getNodes(),
|
|
2006
|
-
var A = c[
|
|
2005
|
+
for (var c = s.getChild().getNodes(), E = 0; E < c.length; E++) {
|
|
2006
|
+
var A = c[E];
|
|
2007
2007
|
f += this.getNodeDegreeWithChildren(A);
|
|
2008
2008
|
}
|
|
2009
2009
|
return f;
|
|
@@ -2014,8 +2014,8 @@ function pt() {
|
|
|
2014
2014
|
var c = s[f];
|
|
2015
2015
|
c.getChild() != null && this.fillCompexOrderByDFS(c.getChild().getNodes()), this.getToBeTiled(c) && this.compoundOrder.push(c);
|
|
2016
2016
|
}
|
|
2017
|
-
}, y.prototype.adjustLocations = function(s, f, c,
|
|
2018
|
-
f +=
|
|
2017
|
+
}, y.prototype.adjustLocations = function(s, f, c, E, A) {
|
|
2018
|
+
f += E, c += A;
|
|
2019
2019
|
for (var m = f, C = 0; C < s.rows.length; C++) {
|
|
2020
2020
|
var R = s.rows[C];
|
|
2021
2021
|
f = m;
|
|
@@ -2027,12 +2027,12 @@ function pt() {
|
|
|
2027
2027
|
}
|
|
2028
2028
|
}, y.prototype.tileCompoundMembers = function(s, f) {
|
|
2029
2029
|
var c = this;
|
|
2030
|
-
this.tiledMemberPack = [], Object.keys(s).forEach(function(
|
|
2031
|
-
var A = f[
|
|
2032
|
-
c.tiledMemberPack[
|
|
2030
|
+
this.tiledMemberPack = [], Object.keys(s).forEach(function(E) {
|
|
2031
|
+
var A = f[E];
|
|
2032
|
+
c.tiledMemberPack[E] = c.tileNodes(s[E], A.paddingLeft + A.paddingRight), A.rect.width = c.tiledMemberPack[E].width, A.rect.height = c.tiledMemberPack[E].height;
|
|
2033
2033
|
});
|
|
2034
2034
|
}, y.prototype.tileNodes = function(s, f) {
|
|
2035
|
-
var c = n.TILING_PADDING_VERTICAL,
|
|
2035
|
+
var c = n.TILING_PADDING_VERTICAL, E = n.TILING_PADDING_HORIZONTAL, A = {
|
|
2036
2036
|
rows: [],
|
|
2037
2037
|
rowWidth: [],
|
|
2038
2038
|
rowHeight: [],
|
|
@@ -2040,7 +2040,7 @@ function pt() {
|
|
|
2040
2040
|
height: f,
|
|
2041
2041
|
// assume minHeight equals to minWidth
|
|
2042
2042
|
verticalPadding: c,
|
|
2043
|
-
horizontalPadding:
|
|
2043
|
+
horizontalPadding: E
|
|
2044
2044
|
};
|
|
2045
2045
|
s.sort(function(R, M) {
|
|
2046
2046
|
return R.rect.width * R.rect.height > M.rect.width * M.rect.height ? -1 : R.rect.width * R.rect.height < M.rect.width * M.rect.height ? 1 : 0;
|
|
@@ -2050,8 +2050,8 @@ function pt() {
|
|
|
2050
2050
|
A.rows.length == 0 ? this.insertNodeToRow(A, C, 0, f) : this.canAddHorizontal(A, C.rect.width, C.rect.height) ? this.insertNodeToRow(A, C, this.getShortestRowIndex(A), f) : this.insertNodeToRow(A, C, A.rows.length, f), this.shiftToLastRow(A);
|
|
2051
2051
|
}
|
|
2052
2052
|
return A;
|
|
2053
|
-
}, y.prototype.insertNodeToRow = function(s, f, c,
|
|
2054
|
-
var A =
|
|
2053
|
+
}, y.prototype.insertNodeToRow = function(s, f, c, E) {
|
|
2054
|
+
var A = E;
|
|
2055
2055
|
if (c == s.rows.length) {
|
|
2056
2056
|
var m = [];
|
|
2057
2057
|
s.rows.push(m), s.rowWidth.push(A), s.rowHeight.push(0);
|
|
@@ -2063,31 +2063,31 @@ function pt() {
|
|
|
2063
2063
|
var M = 0;
|
|
2064
2064
|
R > s.rowHeight[c] && (M = s.rowHeight[c], s.rowHeight[c] = R, M = s.rowHeight[c] - M), s.height += M, s.rows[c].push(f);
|
|
2065
2065
|
}, y.prototype.getShortestRowIndex = function(s) {
|
|
2066
|
-
for (var f = -1, c = Number.MAX_VALUE,
|
|
2067
|
-
s.rowWidth[
|
|
2066
|
+
for (var f = -1, c = Number.MAX_VALUE, E = 0; E < s.rows.length; E++)
|
|
2067
|
+
s.rowWidth[E] < c && (f = E, c = s.rowWidth[E]);
|
|
2068
2068
|
return f;
|
|
2069
2069
|
}, y.prototype.getLongestRowIndex = function(s) {
|
|
2070
|
-
for (var f = -1, c = Number.MIN_VALUE,
|
|
2071
|
-
s.rowWidth[
|
|
2070
|
+
for (var f = -1, c = Number.MIN_VALUE, E = 0; E < s.rows.length; E++)
|
|
2071
|
+
s.rowWidth[E] > c && (f = E, c = s.rowWidth[E]);
|
|
2072
2072
|
return f;
|
|
2073
2073
|
}, y.prototype.canAddHorizontal = function(s, f, c) {
|
|
2074
|
-
var
|
|
2075
|
-
if (
|
|
2074
|
+
var E = this.getShortestRowIndex(s);
|
|
2075
|
+
if (E < 0)
|
|
2076
2076
|
return !0;
|
|
2077
|
-
var A = s.rowWidth[
|
|
2077
|
+
var A = s.rowWidth[E];
|
|
2078
2078
|
if (A + s.horizontalPadding + f <= s.width) return !0;
|
|
2079
2079
|
var m = 0;
|
|
2080
|
-
s.rowHeight[
|
|
2080
|
+
s.rowHeight[E] < c && E > 0 && (m = c + s.verticalPadding - s.rowHeight[E]);
|
|
2081
2081
|
var C;
|
|
2082
2082
|
s.width - A >= f + s.horizontalPadding ? C = (s.height + m) / (A + f + s.horizontalPadding) : C = (s.height + m) / s.width, m = c + s.verticalPadding;
|
|
2083
2083
|
var R;
|
|
2084
2084
|
return s.width < f ? R = (s.height + m) / f : R = (s.height + m) / s.width, R < 1 && (R = 1 / R), C < 1 && (C = 1 / C), C < R;
|
|
2085
2085
|
}, y.prototype.shiftToLastRow = function(s) {
|
|
2086
|
-
var f = this.getLongestRowIndex(s), c = s.rowWidth.length - 1,
|
|
2086
|
+
var f = this.getLongestRowIndex(s), c = s.rowWidth.length - 1, E = s.rows[f], A = E[E.length - 1], m = A.width + s.horizontalPadding;
|
|
2087
2087
|
if (s.width - s.rowWidth[c] > m && f != c) {
|
|
2088
|
-
|
|
2089
|
-
for (var C = Number.MIN_VALUE, R = 0; R <
|
|
2090
|
-
|
|
2088
|
+
E.splice(-1, 1), s.rows[c].push(A), s.rowWidth[f] = s.rowWidth[f] - m, s.rowWidth[c] = s.rowWidth[c] + m, s.width = s.rowWidth[instance.getLongestRowIndex(s)];
|
|
2089
|
+
for (var C = Number.MIN_VALUE, R = 0; R < E.length; R++)
|
|
2090
|
+
E[R].height > C && (C = E[R].height);
|
|
2091
2091
|
f > 0 && (C += s.verticalPadding);
|
|
2092
2092
|
var M = s.rowHeight[f] + s.rowHeight[c];
|
|
2093
2093
|
s.rowHeight[f] = C, s.rowHeight[c] < A.height + s.verticalPadding && (s.rowHeight[c] = A.height + s.verticalPadding);
|
|
@@ -2100,10 +2100,10 @@ function pt() {
|
|
|
2100
2100
|
n.TILE && (this.repopulateZeroDegreeMembers(), this.repopulateCompounds());
|
|
2101
2101
|
}, y.prototype.reduceTrees = function() {
|
|
2102
2102
|
for (var s = [], f = !0, c; f; ) {
|
|
2103
|
-
var
|
|
2103
|
+
var E = this.graphManager.getAllNodes(), A = [];
|
|
2104
2104
|
f = !1;
|
|
2105
|
-
for (var m = 0; m <
|
|
2106
|
-
c =
|
|
2105
|
+
for (var m = 0; m < E.length; m++)
|
|
2106
|
+
c = E[m], c.getEdges().length == 1 && !c.getEdges()[0].isInterGraph && c.getChild() == null && (A.push([c, c.getEdges()[0], c.getOwner()]), f = !0);
|
|
2107
2107
|
if (f == !0) {
|
|
2108
2108
|
for (var C = [], R = 0; R < A.length; R++)
|
|
2109
2109
|
A[R][0].getEdges().length == 1 && (C.push(A[R]), A[R][0].getOwner().remove(A[R][0]));
|
|
@@ -2112,12 +2112,12 @@ function pt() {
|
|
|
2112
2112
|
}
|
|
2113
2113
|
this.prunedNodesAll = s;
|
|
2114
2114
|
}, y.prototype.growTree = function(s) {
|
|
2115
|
-
for (var f = s.length, c = s[f - 1],
|
|
2116
|
-
|
|
2115
|
+
for (var f = s.length, c = s[f - 1], E, A = 0; A < c.length; A++)
|
|
2116
|
+
E = c[A], this.findPlaceforPrunedNode(E), E[2].add(E[0]), E[2].add(E[1], E[1].source, E[1].target);
|
|
2117
2117
|
s.splice(s.length - 1, 1), this.graphManager.resetAllNodes(), this.graphManager.resetAllEdges();
|
|
2118
2118
|
}, y.prototype.findPlaceforPrunedNode = function(s) {
|
|
2119
|
-
var f, c,
|
|
2120
|
-
|
|
2119
|
+
var f, c, E = s[0];
|
|
2120
|
+
E == s[1].source ? c = s[1].target : c = s[1].source;
|
|
2121
2121
|
var A = c.startX, m = c.finishX, C = c.startY, R = c.finishY, M = 0, S = 0, Y = 0, w = 0, x = [M, Y, S, w];
|
|
2122
2122
|
if (C > 0)
|
|
2123
2123
|
for (var F = A; F <= m; F++)
|
|
@@ -2143,12 +2143,12 @@ function pt() {
|
|
|
2143
2143
|
f = H;
|
|
2144
2144
|
} else
|
|
2145
2145
|
f = _;
|
|
2146
|
-
f == 0 ?
|
|
2146
|
+
f == 0 ? E.setCenter(c.getCenterX(), c.getCenterY() - c.getHeight() / 2 - d.DEFAULT_EDGE_LENGTH - E.getHeight() / 2) : f == 1 ? E.setCenter(c.getCenterX() + c.getWidth() / 2 + d.DEFAULT_EDGE_LENGTH + E.getWidth() / 2, c.getCenterY()) : f == 2 ? E.setCenter(c.getCenterX(), c.getCenterY() + c.getHeight() / 2 + d.DEFAULT_EDGE_LENGTH + E.getHeight() / 2) : E.setCenter(c.getCenterX() - c.getWidth() / 2 - d.DEFAULT_EDGE_LENGTH - E.getWidth() / 2, c.getCenterY());
|
|
2147
2147
|
}, I.exports = y;
|
|
2148
2148
|
}),
|
|
2149
2149
|
/* 7 */
|
|
2150
2150
|
/***/
|
|
2151
|
-
(function(I,
|
|
2151
|
+
(function(I, L, o) {
|
|
2152
2152
|
var e = {};
|
|
2153
2153
|
e.layoutBase = o(0), e.CoSEConstants = o(1), e.CoSEEdge = o(2), e.CoSEGraph = o(3), e.CoSEGraphManager = o(4), e.CoSELayout = o(6), e.CoSENode = o(5), I.exports = e;
|
|
2154
2154
|
})
|
|
@@ -2161,17 +2161,17 @@ function pt() {
|
|
|
2161
2161
|
var dt = k.exports, J;
|
|
2162
2162
|
function vt() {
|
|
2163
2163
|
return J || (J = 1, (function(G, b) {
|
|
2164
|
-
(function(I,
|
|
2165
|
-
G.exports =
|
|
2164
|
+
(function(I, L) {
|
|
2165
|
+
G.exports = L(pt());
|
|
2166
2166
|
})(dt, function(N) {
|
|
2167
2167
|
return (
|
|
2168
2168
|
/******/
|
|
2169
2169
|
(function(I) {
|
|
2170
|
-
var
|
|
2170
|
+
var L = {};
|
|
2171
2171
|
function o(e) {
|
|
2172
|
-
if (
|
|
2173
|
-
return
|
|
2174
|
-
var t =
|
|
2172
|
+
if (L[e])
|
|
2173
|
+
return L[e].exports;
|
|
2174
|
+
var t = L[e] = {
|
|
2175
2175
|
/******/
|
|
2176
2176
|
i: e,
|
|
2177
2177
|
/******/
|
|
@@ -2182,7 +2182,7 @@ function vt() {
|
|
|
2182
2182
|
};
|
|
2183
2183
|
return I[e].call(t.exports, t, t.exports, o), t.l = !0, t.exports;
|
|
2184
2184
|
}
|
|
2185
|
-
return o.m = I, o.c =
|
|
2185
|
+
return o.m = I, o.c = L, o.i = function(e) {
|
|
2186
2186
|
return e;
|
|
2187
2187
|
}, o.d = function(e, t, i) {
|
|
2188
2188
|
o.o(e, t) || Object.defineProperty(e, t, {
|
|
@@ -2213,12 +2213,12 @@ function vt() {
|
|
|
2213
2213
|
})([
|
|
2214
2214
|
/* 0 */
|
|
2215
2215
|
/***/
|
|
2216
|
-
(function(I,
|
|
2216
|
+
(function(I, L) {
|
|
2217
2217
|
I.exports = N;
|
|
2218
2218
|
}),
|
|
2219
2219
|
/* 1 */
|
|
2220
2220
|
/***/
|
|
2221
|
-
(function(I,
|
|
2221
|
+
(function(I, L, o) {
|
|
2222
2222
|
var e = o(0).layoutBase.LayoutConstants, t = o(0).layoutBase.FDLayoutConstants, i = o(0).CoSEConstants, l = o(0).CoSELayout, g = o(0).CoSENode, n = o(0).layoutBase.PointD, d = o(0).layoutBase.DimensionD, r = {
|
|
2223
2223
|
// Called on `layoutready`
|
|
2224
2224
|
ready: function() {
|
|
@@ -2273,12 +2273,12 @@ function vt() {
|
|
|
2273
2273
|
initialEnergyOnIncremental: 0.5
|
|
2274
2274
|
};
|
|
2275
2275
|
function h(D, u) {
|
|
2276
|
-
var
|
|
2276
|
+
var T = {};
|
|
2277
2277
|
for (var y in D)
|
|
2278
|
-
|
|
2278
|
+
T[y] = D[y];
|
|
2279
2279
|
for (var y in u)
|
|
2280
|
-
|
|
2281
|
-
return
|
|
2280
|
+
T[y] = u[y];
|
|
2281
|
+
return T;
|
|
2282
2282
|
}
|
|
2283
2283
|
function a(D) {
|
|
2284
2284
|
this.options = h(r, D), p(this.options);
|
|
@@ -2287,7 +2287,7 @@ function vt() {
|
|
|
2287
2287
|
u.nodeRepulsion != null && (i.DEFAULT_REPULSION_STRENGTH = t.DEFAULT_REPULSION_STRENGTH = u.nodeRepulsion), u.idealEdgeLength != null && (i.DEFAULT_EDGE_LENGTH = t.DEFAULT_EDGE_LENGTH = u.idealEdgeLength), u.edgeElasticity != null && (i.DEFAULT_SPRING_STRENGTH = t.DEFAULT_SPRING_STRENGTH = u.edgeElasticity), u.nestingFactor != null && (i.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = t.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = u.nestingFactor), u.gravity != null && (i.DEFAULT_GRAVITY_STRENGTH = t.DEFAULT_GRAVITY_STRENGTH = u.gravity), u.numIter != null && (i.MAX_ITERATIONS = t.MAX_ITERATIONS = u.numIter), u.gravityRange != null && (i.DEFAULT_GRAVITY_RANGE_FACTOR = t.DEFAULT_GRAVITY_RANGE_FACTOR = u.gravityRange), u.gravityCompound != null && (i.DEFAULT_COMPOUND_GRAVITY_STRENGTH = t.DEFAULT_COMPOUND_GRAVITY_STRENGTH = u.gravityCompound), u.gravityRangeCompound != null && (i.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = t.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = u.gravityRangeCompound), u.initialEnergyOnIncremental != null && (i.DEFAULT_COOLING_FACTOR_INCREMENTAL = t.DEFAULT_COOLING_FACTOR_INCREMENTAL = u.initialEnergyOnIncremental), u.quality == "draft" ? e.QUALITY = 0 : u.quality == "proof" ? e.QUALITY = 2 : e.QUALITY = 1, i.NODE_DIMENSIONS_INCLUDE_LABELS = t.NODE_DIMENSIONS_INCLUDE_LABELS = e.NODE_DIMENSIONS_INCLUDE_LABELS = u.nodeDimensionsIncludeLabels, i.DEFAULT_INCREMENTAL = t.DEFAULT_INCREMENTAL = e.DEFAULT_INCREMENTAL = !u.randomize, i.ANIMATE = t.ANIMATE = e.ANIMATE = u.animate, i.TILE = u.tile, i.TILING_PADDING_VERTICAL = typeof u.tilingPaddingVertical == "function" ? u.tilingPaddingVertical.call() : u.tilingPaddingVertical, i.TILING_PADDING_HORIZONTAL = typeof u.tilingPaddingHorizontal == "function" ? u.tilingPaddingHorizontal.call() : u.tilingPaddingHorizontal;
|
|
2288
2288
|
};
|
|
2289
2289
|
a.prototype.run = function() {
|
|
2290
|
-
var D, u,
|
|
2290
|
+
var D, u, T = this.options;
|
|
2291
2291
|
this.idToLNode = {};
|
|
2292
2292
|
var y = this.layout = new l(), O = this;
|
|
2293
2293
|
O.stopped = !1, this.cy = this.options.cy, this.cy.trigger({ type: "layoutstart", layout: this });
|
|
@@ -2295,8 +2295,8 @@ function vt() {
|
|
|
2295
2295
|
this.gm = s;
|
|
2296
2296
|
var f = this.options.eles.nodes(), c = this.options.eles.edges();
|
|
2297
2297
|
this.root = s.addRoot(), this.processChildrenList(this.root, this.getTopMostNodes(f), y);
|
|
2298
|
-
for (var
|
|
2299
|
-
var A = c[
|
|
2298
|
+
for (var E = 0; E < c.length; E++) {
|
|
2299
|
+
var A = c[E], m = this.idToLNode[A.data("source")], C = this.idToLNode[A.data("target")];
|
|
2300
2300
|
if (m !== C && m.getEdgesBetween(C).length == 0) {
|
|
2301
2301
|
var R = s.add(y.newEdge(), m, C);
|
|
2302
2302
|
R.id = A.id();
|
|
@@ -2311,7 +2311,7 @@ function vt() {
|
|
|
2311
2311
|
};
|
|
2312
2312
|
}, S = function Y() {
|
|
2313
2313
|
for (var w = function() {
|
|
2314
|
-
|
|
2314
|
+
T.fit && T.cy.fit(T.eles, T.padding), D || (D = !0, O.cy.one("layoutready", T.ready), O.cy.trigger({ type: "layoutready", layout: O }));
|
|
2315
2315
|
}, x = O.options.refresh, F, U = 0; U < x && !F; U++)
|
|
2316
2316
|
F = O.stopped || O.layout.tick();
|
|
2317
2317
|
if (F) {
|
|
@@ -2319,7 +2319,7 @@ function vt() {
|
|
|
2319
2319
|
return;
|
|
2320
2320
|
}
|
|
2321
2321
|
var P = O.layout.getPositionsData();
|
|
2322
|
-
|
|
2322
|
+
T.eles.nodes().positions(function(_, X) {
|
|
2323
2323
|
if (typeof _ == "number" && (_ = X), !_.isParent()) {
|
|
2324
2324
|
for (var H = _.id(), W = P[H], B = _; W == null && (W = P[B.data("parent")] || P["DummyCompound_" + B.data("parent")], P[H] = W, B = B.parent()[0], B != null); )
|
|
2325
2325
|
;
|
|
@@ -2337,8 +2337,8 @@ function vt() {
|
|
|
2337
2337
|
O.options.animate === "during" && (u = requestAnimationFrame(S));
|
|
2338
2338
|
}), y.runLayout(), this.options.animate !== "during" && (O.options.eles.nodes().not(":parent").layoutPositions(O, O.options, M), D = !1), this;
|
|
2339
2339
|
}, a.prototype.getTopMostNodes = function(D) {
|
|
2340
|
-
for (var u = {},
|
|
2341
|
-
u[D[
|
|
2340
|
+
for (var u = {}, T = 0; T < D.length; T++)
|
|
2341
|
+
u[D[T].id()] = !0;
|
|
2342
2342
|
var y = D.filter(function(O, s) {
|
|
2343
2343
|
typeof O == "number" && (O = s);
|
|
2344
2344
|
for (var f = O.parent()[0]; f != null; ) {
|
|
@@ -2349,18 +2349,18 @@ function vt() {
|
|
|
2349
2349
|
return !0;
|
|
2350
2350
|
});
|
|
2351
2351
|
return y;
|
|
2352
|
-
}, a.prototype.processChildrenList = function(D, u,
|
|
2352
|
+
}, a.prototype.processChildrenList = function(D, u, T) {
|
|
2353
2353
|
for (var y = u.length, O = 0; O < y; O++) {
|
|
2354
|
-
var s = u[O], f = s.children(), c,
|
|
2354
|
+
var s = u[O], f = s.children(), c, E = s.layoutDimensions({
|
|
2355
2355
|
nodeDimensionsIncludeLabels: this.options.nodeDimensionsIncludeLabels
|
|
2356
2356
|
});
|
|
2357
|
-
if (s.outerWidth() != null && s.outerHeight() != null ? c = D.add(new g(
|
|
2357
|
+
if (s.outerWidth() != null && s.outerHeight() != null ? c = D.add(new g(T.graphManager, new n(s.position("x") - E.w / 2, s.position("y") - E.h / 2), new d(parseFloat(E.w), parseFloat(E.h)))) : c = D.add(new g(this.graphManager)), c.id = s.data("id"), c.paddingLeft = parseInt(s.css("padding")), c.paddingTop = parseInt(s.css("padding")), c.paddingRight = parseInt(s.css("padding")), c.paddingBottom = parseInt(s.css("padding")), this.options.nodeDimensionsIncludeLabels && s.isParent()) {
|
|
2358
2358
|
var A = s.boundingBox({ includeLabels: !0, includeNodes: !1 }).w, m = s.boundingBox({ includeLabels: !0, includeNodes: !1 }).h, C = s.css("text-halign");
|
|
2359
2359
|
c.labelWidth = A, c.labelHeight = m, c.labelPos = C;
|
|
2360
2360
|
}
|
|
2361
2361
|
if (this.idToLNode[s.data("id")] = c, isNaN(c.rect.x) && (c.rect.x = 0), isNaN(c.rect.y) && (c.rect.y = 0), f != null && f.length > 0) {
|
|
2362
2362
|
var R;
|
|
2363
|
-
R =
|
|
2363
|
+
R = T.getGraphManager().add(T.newGraph(), c), this.processChildrenList(R, f, T);
|
|
2364
2364
|
}
|
|
2365
2365
|
}
|
|
2366
2366
|
}, a.prototype.stop = function() {
|
|
@@ -2389,8 +2389,8 @@ function et(G, b) {
|
|
|
2389
2389
|
width: N.width,
|
|
2390
2390
|
padding: N.padding ?? 0
|
|
2391
2391
|
};
|
|
2392
|
-
Object.keys(N).forEach((
|
|
2393
|
-
["id", "label", "height", "width", "padding", "x", "y"].includes(
|
|
2392
|
+
Object.keys(N).forEach((L) => {
|
|
2393
|
+
["id", "label", "height", "width", "padding", "x", "y"].includes(L) || (I[L] = N[L]);
|
|
2394
2394
|
}), b.add({
|
|
2395
2395
|
group: "nodes",
|
|
2396
2396
|
data: I,
|
|
@@ -2409,8 +2409,8 @@ function rt(G, b) {
|
|
|
2409
2409
|
source: N.start,
|
|
2410
2410
|
target: N.end
|
|
2411
2411
|
};
|
|
2412
|
-
Object.keys(N).forEach((
|
|
2413
|
-
["id", "start", "end"].includes(
|
|
2412
|
+
Object.keys(N).forEach((L) => {
|
|
2413
|
+
["id", "start", "end"].includes(L) || (I[L] = N[L]);
|
|
2414
2414
|
}), b.add({
|
|
2415
2415
|
group: "edges",
|
|
2416
2416
|
data: I
|
|
@@ -2438,14 +2438,14 @@ function it(G) {
|
|
|
2438
2438
|
return { w: e.width, h: e.height };
|
|
2439
2439
|
};
|
|
2440
2440
|
});
|
|
2441
|
-
const
|
|
2441
|
+
const L = {
|
|
2442
2442
|
name: "cose-bilkent",
|
|
2443
2443
|
// @ts-ignore Types for cose-bilkent are not correct?
|
|
2444
2444
|
quality: "proof",
|
|
2445
2445
|
styleEnabled: !1,
|
|
2446
2446
|
animate: !1
|
|
2447
2447
|
};
|
|
2448
|
-
I.layout(
|
|
2448
|
+
I.layout(L).run(), I.ready((o) => {
|
|
2449
2449
|
$.info("Cytoscape ready", o), b(I);
|
|
2450
2450
|
});
|
|
2451
2451
|
});
|
|
@@ -2453,20 +2453,20 @@ function it(G) {
|
|
|
2453
2453
|
V(it, "createCytoscapeInstance");
|
|
2454
2454
|
function nt(G) {
|
|
2455
2455
|
return G.nodes().map((b) => {
|
|
2456
|
-
const N = b.data(), I = b.position(),
|
|
2456
|
+
const N = b.data(), I = b.position(), L = {
|
|
2457
2457
|
id: N.id,
|
|
2458
2458
|
x: I.x,
|
|
2459
2459
|
y: I.y
|
|
2460
2460
|
};
|
|
2461
2461
|
return Object.keys(N).forEach((o) => {
|
|
2462
|
-
o !== "id" && (
|
|
2463
|
-
}),
|
|
2462
|
+
o !== "id" && (L[o] = N[o]);
|
|
2463
|
+
}), L;
|
|
2464
2464
|
});
|
|
2465
2465
|
}
|
|
2466
2466
|
V(nt, "extractPositionedNodes");
|
|
2467
2467
|
function ot(G) {
|
|
2468
2468
|
return G.edges().map((b) => {
|
|
2469
|
-
const N = b.data(), I = b._private.rscratch,
|
|
2469
|
+
const N = b.data(), I = b._private.rscratch, L = {
|
|
2470
2470
|
id: N.id,
|
|
2471
2471
|
source: N.source,
|
|
2472
2472
|
target: N.target,
|
|
@@ -2478,8 +2478,8 @@ function ot(G) {
|
|
|
2478
2478
|
endY: I.endY
|
|
2479
2479
|
};
|
|
2480
2480
|
return Object.keys(N).forEach((o) => {
|
|
2481
|
-
["id", "source", "target"].includes(o) || (
|
|
2482
|
-
}),
|
|
2481
|
+
["id", "source", "target"].includes(o) || (L[o] = N[o]);
|
|
2482
|
+
}), L;
|
|
2483
2483
|
});
|
|
2484
2484
|
}
|
|
2485
2485
|
V(ot, "extractPositionedEdges");
|
|
@@ -2487,10 +2487,10 @@ async function st(G, b) {
|
|
|
2487
2487
|
$.debug("Starting cose-bilkent layout algorithm");
|
|
2488
2488
|
try {
|
|
2489
2489
|
at(G);
|
|
2490
|
-
const N = await it(G), I = nt(N),
|
|
2491
|
-
return $.debug(`Layout completed: ${I.length} nodes, ${
|
|
2490
|
+
const N = await it(G), I = nt(N), L = ot(N);
|
|
2491
|
+
return $.debug(`Layout completed: ${I.length} nodes, ${L.length} edges`), {
|
|
2492
2492
|
nodes: I,
|
|
2493
|
-
edges:
|
|
2493
|
+
edges: L
|
|
2494
2494
|
};
|
|
2495
2495
|
} catch (N) {
|
|
2496
2496
|
throw $.error("Error in cose-bilkent layout algorithm:", N), N;
|
|
@@ -2514,7 +2514,7 @@ V(at, "validateLayoutData");
|
|
|
2514
2514
|
var Lt = /* @__PURE__ */ V(async (G, b, {
|
|
2515
2515
|
insertCluster: N,
|
|
2516
2516
|
insertEdge: I,
|
|
2517
|
-
insertEdgeLabel:
|
|
2517
|
+
insertEdgeLabel: L,
|
|
2518
2518
|
insertMarkers: o,
|
|
2519
2519
|
insertNode: e,
|
|
2520
2520
|
log: t,
|
|
@@ -2526,48 +2526,48 @@ var Lt = /* @__PURE__ */ V(async (G, b, {
|
|
|
2526
2526
|
t.debug("Inserting nodes into DOM for dimension calculation"), await Promise.all(
|
|
2527
2527
|
G.nodes.map(async (u) => {
|
|
2528
2528
|
if (u.isGroup) {
|
|
2529
|
-
const
|
|
2530
|
-
n[u.id] =
|
|
2529
|
+
const T = { ...u };
|
|
2530
|
+
n[u.id] = T, g[u.id] = T, await N(r, u);
|
|
2531
2531
|
} else {
|
|
2532
|
-
const
|
|
2533
|
-
g[u.id] =
|
|
2532
|
+
const T = { ...u };
|
|
2533
|
+
g[u.id] = T;
|
|
2534
2534
|
const y = await e(p, u, {
|
|
2535
2535
|
config: G.config,
|
|
2536
2536
|
dir: G.direction || "TB"
|
|
2537
2537
|
}), O = y.node().getBBox();
|
|
2538
|
-
|
|
2538
|
+
T.width = O.width, T.height = O.height, T.domId = y, t.debug(`Node ${u.id} dimensions: ${O.width}x${O.height}`);
|
|
2539
2539
|
}
|
|
2540
2540
|
})
|
|
2541
2541
|
), t.debug("Running cose-bilkent layout algorithm");
|
|
2542
2542
|
const v = {
|
|
2543
2543
|
...G,
|
|
2544
2544
|
nodes: G.nodes.map((u) => {
|
|
2545
|
-
const
|
|
2545
|
+
const T = g[u.id];
|
|
2546
2546
|
return {
|
|
2547
2547
|
...u,
|
|
2548
|
-
width:
|
|
2549
|
-
height:
|
|
2548
|
+
width: T.width,
|
|
2549
|
+
height: T.height
|
|
2550
2550
|
};
|
|
2551
2551
|
})
|
|
2552
2552
|
}, D = await st(v, G.config);
|
|
2553
2553
|
t.debug("Positioning nodes based on layout results"), D.nodes.forEach((u) => {
|
|
2554
|
-
const
|
|
2555
|
-
|
|
2554
|
+
const T = g[u.id];
|
|
2555
|
+
T?.domId && (T.domId.attr(
|
|
2556
2556
|
"transform",
|
|
2557
2557
|
`translate(${u.x}, ${u.y})`
|
|
2558
|
-
),
|
|
2558
|
+
), T.x = u.x, T.y = u.y, t.debug(`Positioned node ${T.id} at center (${u.x}, ${u.y})`));
|
|
2559
2559
|
}), D.edges.forEach((u) => {
|
|
2560
|
-
const
|
|
2561
|
-
|
|
2560
|
+
const T = G.edges.find((y) => y.id === u.id);
|
|
2561
|
+
T && (T.points = [
|
|
2562
2562
|
{ x: u.startX, y: u.startY },
|
|
2563
2563
|
{ x: u.midX, y: u.midY },
|
|
2564
2564
|
{ x: u.endX, y: u.endY }
|
|
2565
2565
|
]);
|
|
2566
2566
|
}), t.debug("Inserting and positioning edges"), await Promise.all(
|
|
2567
2567
|
G.edges.map(async (u) => {
|
|
2568
|
-
await
|
|
2569
|
-
const
|
|
2570
|
-
if (
|
|
2568
|
+
await L(a, u);
|
|
2569
|
+
const T = g[u.start ?? ""], y = g[u.end ?? ""];
|
|
2570
|
+
if (T && y) {
|
|
2571
2571
|
const O = D.edges.find((s) => s.id === u.id);
|
|
2572
2572
|
if (O) {
|
|
2573
2573
|
t.debug("APA01 positionedEdge", O);
|
|
@@ -2576,7 +2576,7 @@ var Lt = /* @__PURE__ */ V(async (G, b, {
|
|
|
2576
2576
|
s,
|
|
2577
2577
|
n,
|
|
2578
2578
|
G.type,
|
|
2579
|
-
|
|
2579
|
+
T,
|
|
2580
2580
|
y,
|
|
2581
2581
|
G.diagramId
|
|
2582
2582
|
);
|
|
@@ -2585,7 +2585,7 @@ var Lt = /* @__PURE__ */ V(async (G, b, {
|
|
|
2585
2585
|
const s = {
|
|
2586
2586
|
...u,
|
|
2587
2587
|
points: [
|
|
2588
|
-
{ x:
|
|
2588
|
+
{ x: T.x || 0, y: T.y || 0 },
|
|
2589
2589
|
{ x: y.x || 0, y: y.y || 0 }
|
|
2590
2590
|
]
|
|
2591
2591
|
}, f = I(
|
|
@@ -2593,7 +2593,7 @@ var Lt = /* @__PURE__ */ V(async (G, b, {
|
|
|
2593
2593
|
s,
|
|
2594
2594
|
n,
|
|
2595
2595
|
G.type,
|
|
2596
|
-
|
|
2596
|
+
T,
|
|
2597
2597
|
y,
|
|
2598
2598
|
G.diagramId
|
|
2599
2599
|
);
|