@altimateai/ui-components 0.0.64-beta5 → 0.0.64-beta7
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/Carousel.js +1364 -1348
- package/dist/CoachForm.js +6956 -6919
- package/dist/Stack.js +12 -12
- package/dist/_basePickBy.js +25 -25
- package/dist/_baseUniq.js +62 -62
- package/dist/arc.js +14 -14
- package/dist/architectureDiagram-VXUJARFQ.js +125 -125
- package/dist/assets/icons/index.js +1 -1
- package/dist/blockDiagram-VD42YOAC.js +1 -1
- package/dist/c4Diagram-YG6GDRKO.js +1 -1
- package/dist/channel.js +3 -3
- package/dist/chatbotV2/index.d.ts +15 -9
- package/dist/chatbotV2/index.js +54 -53
- package/dist/chunk-4BX2VUAB.js +1 -1
- package/dist/chunk-55IACEB6.js +1 -1
- package/dist/chunk-B4BG7PRW.js +7 -7
- package/dist/chunk-DI55MBZ5.js +1 -1
- package/dist/chunk-FMBD7UC4.js +1 -1
- package/dist/chunk-QN33PNHL.js +3 -3
- package/dist/chunk-QZHKN3VN.js +1 -1
- package/dist/chunk-TZMSLE5B.js +1 -1
- package/dist/classDiagram-2ON5EDUG.js +1 -1
- package/dist/classDiagram-v2-WZHVMYZB.js +1 -1
- package/dist/cose-bilkent-S5V4N54A.js +1 -1
- package/dist/dagre-6UL2VRFP.js +16 -16
- package/dist/diagram-PSM6KHXK.js +38 -38
- package/dist/diagram-QEK2KX5R.js +24 -24
- package/dist/diagram-S2PKOQOG.js +2 -2
- package/dist/erDiagram-Q2GNP2WA.js +15 -15
- package/dist/flowDiagram-NV44I4VS.js +1 -1
- package/dist/ganttDiagram-LVOFAZNH.js +1 -1
- package/dist/gitGraphDiagram-NY62KEGX.js +1 -1
- package/dist/graph.js +1 -1
- package/dist/index.js +5 -5
- package/dist/index2.js +20 -20
- package/dist/infoDiagram-F6ZHWCRC.js +3 -3
- package/dist/journeyDiagram-XKPGCS4Q.js +1 -1
- package/dist/kanban-definition-3W4ZIXB7.js +11 -11
- package/dist/layout.js +15 -15
- package/dist/lineage/index.js +608 -615
- package/dist/main.js +2 -2
- package/dist/mermaid-parser.core.js +1 -1
- package/dist/mindmap-definition-VGOIOE7T.js +1 -1
- package/dist/pieDiagram-ADFJNKIX.js +22 -22
- package/dist/quadrantDiagram-AYHSOK5B.js +1 -1
- package/dist/redux-toolkit.modern.js +483 -476
- package/dist/requirementDiagram-UZGBJVZJ.js +76 -76
- package/dist/sankeyDiagram-TZEHDZUN.js +1 -1
- package/dist/sequenceDiagram-WL72ISMW.js +1 -1
- package/dist/shadcn/index.d.ts +2 -0
- package/dist/shadcn/index.js +2 -2
- package/dist/stateDiagram-FKZM4ZOC.js +21 -21
- package/dist/stateDiagram-v2-4FDKWEC3.js +1 -1
- package/dist/timeline-definition-IT6M3QCI.js +1 -1
- package/dist/xychartDiagram-PRI3JC2R.js +11 -11
- package/package.json +1 -1
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import {
|
|
1
|
+
import { au as Ze, a3 as ke, a4 as qe, ag as Qe, ah as Je, a5 as Ke, a6 as je, a1 as dt, an as _e, av as tr, aw as er, by as rr, bz as ir, ad as Re, az as ar, aO as nr, al as or, ba as ye, a7 as Ee, bA as ve, ac as sr } from "./CoachForm.js";
|
|
2
2
|
import { p as hr } from "./chunk-4BX2VUAB.js";
|
|
3
3
|
import { p as lr } from "./mermaid-parser.core.js";
|
|
4
4
|
import { c as Se } from "./cytoscape.esm.js";
|
|
@@ -650,7 +650,7 @@ function gr() {
|
|
|
650
650
|
if (f < g)
|
|
651
651
|
return e[0] = c, e[1] = i, e[2] = S, e[3] = t, !1;
|
|
652
652
|
} else {
|
|
653
|
-
var p = a.height / a.width, E = r.height / r.width, y = (t - i) / (g - f), R = void 0, M = void 0, F = void 0, W = void 0, x = void 0,
|
|
653
|
+
var p = a.height / a.width, E = r.height / r.width, y = (t - i) / (g - f), R = void 0, M = void 0, F = void 0, W = void 0, x = void 0, k = void 0;
|
|
654
654
|
if (-p === y ? f > g ? (e[0] = l, e[1] = T, n = !0) : (e[0] = c, e[1] = s, n = !0) : p === y && (f > g ? (e[0] = o, e[1] = s, n = !0) : (e[0] = d, e[1] = T, n = !0)), -E === y ? g > f ? (e[2] = K, e[3] = X, m = !0) : (e[2] = G, e[3] = C, m = !0) : E === y && (g > f ? (e[2] = S, e[3] = C, m = !0) : (e[2] = Q, e[3] = X, m = !0)), n && m)
|
|
655
655
|
return !1;
|
|
656
656
|
if (f > g ? i > t ? (R = this.getCardinalDirection(p, y, 4), M = this.getCardinalDirection(E, y, 2)) : (R = this.getCardinalDirection(-p, y, 3), M = this.getCardinalDirection(-E, y, 1)) : i > t ? (R = this.getCardinalDirection(-p, y, 1), M = this.getCardinalDirection(-E, y, 3)) : (R = this.getCardinalDirection(p, y, 2), M = this.getCardinalDirection(E, y, 4)), !n)
|
|
@@ -671,16 +671,16 @@ function gr() {
|
|
|
671
671
|
if (!m)
|
|
672
672
|
switch (M) {
|
|
673
673
|
case 1:
|
|
674
|
-
|
|
674
|
+
k = C, x = g + -rt / y, e[2] = x, e[3] = k;
|
|
675
675
|
break;
|
|
676
676
|
case 2:
|
|
677
|
-
x = Q,
|
|
677
|
+
x = Q, k = t + O * y, e[2] = x, e[3] = k;
|
|
678
678
|
break;
|
|
679
679
|
case 3:
|
|
680
|
-
|
|
680
|
+
k = X, x = g + rt / y, e[2] = x, e[3] = k;
|
|
681
681
|
break;
|
|
682
682
|
case 4:
|
|
683
|
-
x = K,
|
|
683
|
+
x = K, k = t + -O * y, e[2] = x, e[3] = k;
|
|
684
684
|
break;
|
|
685
685
|
}
|
|
686
686
|
}
|
|
@@ -1652,8 +1652,8 @@ function gr() {
|
|
|
1652
1652
|
for (var x = 0; x < E - 1; x++)
|
|
1653
1653
|
this.U[x][E] = 0;
|
|
1654
1654
|
} else {
|
|
1655
|
-
for (var
|
|
1656
|
-
this.U[
|
|
1655
|
+
for (var k = 0; k < this.m; k++)
|
|
1656
|
+
this.U[k][E] = 0;
|
|
1657
1657
|
this.U[E][E] = 1;
|
|
1658
1658
|
}
|
|
1659
1659
|
}
|
|
@@ -1719,10 +1719,10 @@ function gr() {
|
|
|
1719
1719
|
break;
|
|
1720
1720
|
case 3:
|
|
1721
1721
|
{
|
|
1722
|
-
var Yt = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(r[n - 2])), Math.abs(this.s[q])), Math.abs(r[q])), Vt = this.s[n - 1] / Yt, b = this.s[n - 2] / Yt, U = r[n - 2] / Yt, $ = this.s[q] / Yt, J = r[q] / Yt,
|
|
1722
|
+
var Yt = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(r[n - 2])), Math.abs(this.s[q])), Math.abs(r[q])), Vt = this.s[n - 1] / Yt, b = this.s[n - 2] / Yt, U = r[n - 2] / Yt, $ = this.s[q] / Yt, J = r[q] / Yt, Z = ((b + Vt) * (b - Vt) + U * U) / 2, at = Vt * U * (Vt * U), ct = 0;
|
|
1723
1723
|
/* @__PURE__ */ (function(Tt, Ct) {
|
|
1724
1724
|
return Tt || Ct;
|
|
1725
|
-
})(
|
|
1725
|
+
})(Z !== 0, at !== 0) && (ct = Math.sqrt(Z * Z + at), Z < 0 && (ct = -ct), ct = at / (Z + ct));
|
|
1726
1726
|
for (var nt = ($ + Vt) * ($ - Vt) + ct, tt = $ * J, j = q; j < n - 1; j++) {
|
|
1727
1727
|
var ut = u.hypot(nt, tt), Mt = nt / ut, pt = tt / ut;
|
|
1728
1728
|
j !== q && (r[j - 1] = ut), nt = Mt * this.s[j] + pt * r[j], r[j] = Mt * r[j] - pt * this.s[j], tt = pt * this.s[j + 1], this.s[j + 1] = Mt * this.s[j + 1];
|
|
@@ -2146,11 +2146,11 @@ function ur() {
|
|
|
2146
2146
|
}
|
|
2147
2147
|
});
|
|
2148
2148
|
else {
|
|
2149
|
-
var
|
|
2149
|
+
var k = /* @__PURE__ */ new Map(), V = /* @__PURE__ */ new Map();
|
|
2150
2150
|
this.constraints.relativePlacementConstraint.forEach(function(w) {
|
|
2151
2151
|
if (w.left) {
|
|
2152
2152
|
var H = M.has(w.left) ? M.get(w.left) : w.left, B = M.has(w.right) ? M.get(w.right) : w.right;
|
|
2153
|
-
|
|
2153
|
+
k.has(H) ? k.get(H).push(B) : k.set(H, [B]), k.has(B) ? k.get(B).push(H) : k.set(B, [H]);
|
|
2154
2154
|
} else {
|
|
2155
2155
|
var _ = F.has(w.top) ? F.get(w.top) : w.top, ht = F.has(w.bottom) ? F.get(w.bottom) : w.bottom;
|
|
2156
2156
|
V.has(_) ? V.get(_).push(ht) : V.set(_, [ht]), V.has(ht) ? V.get(ht).push(_) : V.set(ht, [_]);
|
|
@@ -2172,7 +2172,7 @@ function ur() {
|
|
|
2172
2172
|
Nt++;
|
|
2173
2173
|
}
|
|
2174
2174
|
}), { components: _, isFixed: ht };
|
|
2175
|
-
}, et = Y(
|
|
2175
|
+
}, et = Y(k, n.fixedNodesOnHorizontal);
|
|
2176
2176
|
this.componentsOnHorizontal = et.components, this.fixedComponentsOnHorizontal = et.isFixed;
|
|
2177
2177
|
var z = Y(V, n.fixedNodesOnVertical);
|
|
2178
2178
|
this.componentsOnVertical = z.components, this.fixedComponentsOnVertical = z.isFixed;
|
|
@@ -2251,13 +2251,13 @@ function ur() {
|
|
|
2251
2251
|
n.idToNodeMap.get(H).displacementX = 0;
|
|
2252
2252
|
}) : this.idToNodeMap.get(x[y]).displacementX = 0;
|
|
2253
2253
|
else {
|
|
2254
|
-
for (var
|
|
2254
|
+
for (var k = 0, V = 0, y = 0; y < x.length; y++)
|
|
2255
2255
|
if (this.dummyToNodeForVerticalAlignment.has(x[y])) {
|
|
2256
2256
|
var Y = this.dummyToNodeForVerticalAlignment.get(x[y]);
|
|
2257
|
-
|
|
2257
|
+
k += Y.length * this.idToNodeMap.get(Y[0]).displacementX, V += Y.length;
|
|
2258
2258
|
} else
|
|
2259
|
-
|
|
2260
|
-
for (var et =
|
|
2259
|
+
k += this.idToNodeMap.get(x[y]).displacementX, V++;
|
|
2260
|
+
for (var et = k / V, y = 0; y < x.length; y++)
|
|
2261
2261
|
this.dummyToNodeForVerticalAlignment.has(x[y]) ? this.dummyToNodeForVerticalAlignment.get(x[y]).forEach(function(H) {
|
|
2262
2262
|
n.idToNodeMap.get(H).displacementX = et;
|
|
2263
2263
|
}) : this.idToNodeMap.get(x[y]).displacementX = et;
|
|
@@ -2271,13 +2271,13 @@ function ur() {
|
|
|
2271
2271
|
n.idToNodeMap.get(B).displacementY = 0;
|
|
2272
2272
|
}) : this.idToNodeMap.get(x[y]).displacementY = 0;
|
|
2273
2273
|
else {
|
|
2274
|
-
for (var
|
|
2274
|
+
for (var k = 0, V = 0, y = 0; y < x.length; y++)
|
|
2275
2275
|
if (this.dummyToNodeForHorizontalAlignment.has(x[y])) {
|
|
2276
2276
|
var Y = this.dummyToNodeForHorizontalAlignment.get(x[y]);
|
|
2277
|
-
|
|
2277
|
+
k += Y.length * this.idToNodeMap.get(Y[0]).displacementY, V += Y.length;
|
|
2278
2278
|
} else
|
|
2279
|
-
|
|
2280
|
-
for (var et =
|
|
2279
|
+
k += this.idToNodeMap.get(x[y]).displacementY, V++;
|
|
2280
|
+
for (var et = k / V, y = 0; y < x.length; y++)
|
|
2281
2281
|
this.dummyToNodeForHorizontalAlignment.has(x[y]) ? this.dummyToNodeForHorizontalAlignment.get(x[y]).forEach(function(q) {
|
|
2282
2282
|
n.idToNodeMap.get(q).displacementY = et;
|
|
2283
2283
|
}) : this.idToNodeMap.get(x[y]).displacementY = et;
|
|
@@ -2339,8 +2339,8 @@ function ur() {
|
|
|
2339
2339
|
}, O.branchRadialLayout = function(n, m, p, E, y, R) {
|
|
2340
2340
|
var M = (E - p + 1) / 2;
|
|
2341
2341
|
M < 0 && (M += 180);
|
|
2342
|
-
var F = (M + p) % 360, W = F * G.TWO_PI / 360, x = y * Math.cos(W),
|
|
2343
|
-
n.setCenter(x,
|
|
2342
|
+
var F = (M + p) % 360, W = F * G.TWO_PI / 360, x = y * Math.cos(W), k = y * Math.sin(W);
|
|
2343
|
+
n.setCenter(x, k);
|
|
2344
2344
|
var V = [];
|
|
2345
2345
|
V = V.concat(n.getEdges());
|
|
2346
2346
|
var Y = V.length;
|
|
@@ -2382,9 +2382,9 @@ function ur() {
|
|
|
2382
2382
|
if (m[W].length > 1) {
|
|
2383
2383
|
var x = "DummyCompound_" + W;
|
|
2384
2384
|
n.memberGroups[x] = m[W];
|
|
2385
|
-
var
|
|
2386
|
-
V.id = x, V.paddingLeft =
|
|
2387
|
-
var Y = n.getGraphManager().add(n.newGraph(), V), et =
|
|
2385
|
+
var k = m[W][0].getParent(), V = new t(n.graphManager);
|
|
2386
|
+
V.id = x, V.paddingLeft = k.paddingLeft || 0, V.paddingRight = k.paddingRight || 0, V.paddingBottom = k.paddingBottom || 0, V.paddingTop = k.paddingTop || 0, n.idToDummyNode[x] = V;
|
|
2387
|
+
var Y = n.getGraphManager().add(n.newGraph(), V), et = k.getChild();
|
|
2388
2388
|
et.add(V);
|
|
2389
2389
|
for (var z = 0; z < m[W].length; z++) {
|
|
2390
2390
|
var w = m[W][z];
|
|
@@ -2465,11 +2465,11 @@ function ur() {
|
|
|
2465
2465
|
for (var F = m, W = 0; W < n.rows.length; W++) {
|
|
2466
2466
|
var x = n.rows[W];
|
|
2467
2467
|
m = F;
|
|
2468
|
-
for (var
|
|
2468
|
+
for (var k = 0, V = 0; V < x.length; V++) {
|
|
2469
2469
|
var Y = x[V];
|
|
2470
|
-
Y.rect.x = m, Y.rect.y = p, m += Y.rect.width + n.horizontalPadding, Y.rect.height >
|
|
2470
|
+
Y.rect.x = m, Y.rect.y = p, m += Y.rect.width + n.horizontalPadding, Y.rect.height > k && (k = Y.rect.height);
|
|
2471
2471
|
}
|
|
2472
|
-
p +=
|
|
2472
|
+
p += k + n.verticalPadding;
|
|
2473
2473
|
}
|
|
2474
2474
|
}, O.prototype.tileCompoundMembers = function(n, m) {
|
|
2475
2475
|
var p = this;
|
|
@@ -2491,7 +2491,7 @@ function ur() {
|
|
|
2491
2491
|
n.forEach(function(z) {
|
|
2492
2492
|
R += z.getWidth(), M += z.getHeight(), z.getWidth() > F && (F = z.getWidth());
|
|
2493
2493
|
});
|
|
2494
|
-
var W = R / y, x = M / y,
|
|
2494
|
+
var W = R / y, x = M / y, k = Math.pow(p - E, 2) + 4 * (W + E) * (x + p) * y, V = (E - p + Math.sqrt(k)) / (2 * (W + E)), Y;
|
|
2495
2495
|
m ? (Y = Math.ceil(V), Y == V && Y++) : Y = Math.floor(V);
|
|
2496
2496
|
var et = Y * (W + E) - E;
|
|
2497
2497
|
return F > et && (et = F), et += E * 2, et;
|
|
@@ -2518,11 +2518,11 @@ function ur() {
|
|
|
2518
2518
|
var H = W;
|
|
2519
2519
|
return M.idealRowWidth ? (H = R, H(z.id, w.id)) : H(z, w);
|
|
2520
2520
|
});
|
|
2521
|
-
for (var x = 0,
|
|
2521
|
+
for (var x = 0, k = 0, V = 0; V < n.length; V++) {
|
|
2522
2522
|
var Y = n[V];
|
|
2523
|
-
x += Y.getCenterX(),
|
|
2523
|
+
x += Y.getCenterX(), k += Y.getCenterY();
|
|
2524
2524
|
}
|
|
2525
|
-
M.centerX = x / n.length, M.centerY =
|
|
2525
|
+
M.centerX = x / n.length, M.centerY = k / n.length;
|
|
2526
2526
|
for (var V = 0; V < n.length; V++) {
|
|
2527
2527
|
var Y = n[V];
|
|
2528
2528
|
if (M.rows.length == 0)
|
|
@@ -2616,7 +2616,7 @@ function ur() {
|
|
|
2616
2616
|
if (E == n[1].source ? p = n[1].target : p = n[1].source, s.PURE_INCREMENTAL)
|
|
2617
2617
|
E.setCenter(p.getCenterX() + n[3].getWidth(), p.getCenterY() + n[3].getHeight());
|
|
2618
2618
|
else {
|
|
2619
|
-
var y = p.startX, R = p.finishX, M = p.startY, F = p.finishY, W = 0, x = 0,
|
|
2619
|
+
var y = p.startX, R = p.finishX, M = p.startY, F = p.finishY, W = 0, x = 0, k = 0, V = 0, Y = [W, k, x, V];
|
|
2620
2620
|
if (M > 0)
|
|
2621
2621
|
for (var et = y; et <= R; et++)
|
|
2622
2622
|
Y[0] += this.grid[et][M - 1].length + this.grid[et][M].length - 1;
|
|
@@ -2712,10 +2712,10 @@ function ur() {
|
|
|
2712
2712
|
return { x: U.x - $.x, y: U.y - $.y };
|
|
2713
2713
|
}, Q = function(U) {
|
|
2714
2714
|
var $ = 0, J = 0;
|
|
2715
|
-
return U.forEach(function(
|
|
2716
|
-
$ += v[d.get(
|
|
2715
|
+
return U.forEach(function(Z) {
|
|
2716
|
+
$ += v[d.get(Z)], J += L[d.get(Z)];
|
|
2717
2717
|
}), { x: $ / U.size, y: J / U.size };
|
|
2718
|
-
}, O = function(U, $, J,
|
|
2718
|
+
}, O = function(U, $, J, Z, at) {
|
|
2719
2719
|
function ct(lt, ot) {
|
|
2720
2720
|
var Lt = new Set(lt), ft = !0, st = !1, Xt = void 0;
|
|
2721
2721
|
try {
|
|
@@ -2745,7 +2745,7 @@ function ur() {
|
|
|
2745
2745
|
});
|
|
2746
2746
|
var tt = /* @__PURE__ */ new Map(), j = /* @__PURE__ */ new Map(), ut = new g();
|
|
2747
2747
|
nt.forEach(function(lt, ot) {
|
|
2748
|
-
lt == 0 ? (ut.push(ot), J || ($ == "horizontal" ? tt.set(ot, d.has(ot) ? v[d.get(ot)] :
|
|
2748
|
+
lt == 0 ? (ut.push(ot), J || ($ == "horizontal" ? tt.set(ot, d.has(ot) ? v[d.get(ot)] : Z.get(ot)) : tt.set(ot, d.has(ot) ? L[d.get(ot)] : Z.get(ot)))) : tt.set(ot, Number.NEGATIVE_INFINITY), J && j.set(ot, /* @__PURE__ */ new Set([ot]));
|
|
2749
2749
|
}), J && at.forEach(function(lt) {
|
|
2750
2750
|
var ot = [];
|
|
2751
2751
|
if (lt.forEach(function(st) {
|
|
@@ -2753,14 +2753,14 @@ function ur() {
|
|
|
2753
2753
|
}), ot.length > 0) {
|
|
2754
2754
|
var Lt = 0;
|
|
2755
2755
|
ot.forEach(function(st) {
|
|
2756
|
-
$ == "horizontal" ? (tt.set(st, d.has(st) ? v[d.get(st)] :
|
|
2756
|
+
$ == "horizontal" ? (tt.set(st, d.has(st) ? v[d.get(st)] : Z.get(st)), Lt += tt.get(st)) : (tt.set(st, d.has(st) ? L[d.get(st)] : Z.get(st)), Lt += tt.get(st));
|
|
2757
2757
|
}), Lt = Lt / ot.length, lt.forEach(function(st) {
|
|
2758
2758
|
J.has(st) || tt.set(st, Lt);
|
|
2759
2759
|
});
|
|
2760
2760
|
} else {
|
|
2761
2761
|
var ft = 0;
|
|
2762
2762
|
lt.forEach(function(st) {
|
|
2763
|
-
$ == "horizontal" ? ft += d.has(st) ? v[d.get(st)] :
|
|
2763
|
+
$ == "horizontal" ? ft += d.has(st) ? v[d.get(st)] : Z.get(st) : ft += d.has(st) ? L[d.get(st)] : Z.get(st);
|
|
2764
2764
|
}), ft = ft / lt.length, lt.forEach(function(st) {
|
|
2765
2765
|
tt.set(st, ft);
|
|
2766
2766
|
});
|
|
@@ -2772,7 +2772,7 @@ function ur() {
|
|
|
2772
2772
|
if (tt.get(ft.id) < tt.get(ot) + ft.gap)
|
|
2773
2773
|
if (J && J.has(ft.id)) {
|
|
2774
2774
|
var st = void 0;
|
|
2775
|
-
if ($ == "horizontal" ? st = d.has(ft.id) ? v[d.get(ft.id)] :
|
|
2775
|
+
if ($ == "horizontal" ? st = d.has(ft.id) ? v[d.get(ft.id)] : Z.get(ft.id) : st = d.has(ft.id) ? L[d.get(ft.id)] : Z.get(ft.id), tt.set(ft.id, st), st < tt.get(ot) + ft.gap) {
|
|
2776
2776
|
var Xt = tt.get(ot) + ft.gap - st;
|
|
2777
2777
|
j.get(ot).forEach(function(Tt) {
|
|
2778
2778
|
tt.set(Tt, tt.get(Tt) - Xt);
|
|
@@ -2810,8 +2810,8 @@ function ur() {
|
|
|
2810
2810
|
}
|
|
2811
2811
|
if (!Lt) {
|
|
2812
2812
|
var bt = !1, zt = void 0;
|
|
2813
|
-
xt.forEach(function(St,
|
|
2814
|
-
St.has([].concat(f(lt))[0]) && (bt = !0, zt =
|
|
2813
|
+
xt.forEach(function(St, Zt) {
|
|
2814
|
+
St.has([].concat(f(lt))[0]) && (bt = !0, zt = Zt);
|
|
2815
2815
|
}), bt ? lt.forEach(function(St) {
|
|
2816
2816
|
xt[zt].add(St);
|
|
2817
2817
|
}) : xt.push(new Set(lt));
|
|
@@ -2821,10 +2821,10 @@ function ur() {
|
|
|
2821
2821
|
var Lt = Number.POSITIVE_INFINITY, ft = Number.POSITIVE_INFINITY, st = Number.NEGATIVE_INFINITY, Xt = Number.NEGATIVE_INFINITY, Tt = !0, Ct = !1, Bt = void 0;
|
|
2822
2822
|
try {
|
|
2823
2823
|
for (var bt = lt[Symbol.iterator](), zt; !(Tt = (zt = bt.next()).done); Tt = !0) {
|
|
2824
|
-
var St = zt.value,
|
|
2825
|
-
$ == "horizontal" ?
|
|
2824
|
+
var St = zt.value, Zt = void 0;
|
|
2825
|
+
$ == "horizontal" ? Zt = d.has(St) ? v[d.get(St)] : Z.get(St) : Zt = d.has(St) ? L[d.get(St)] : Z.get(St);
|
|
2826
2826
|
var Kt = tt.get(St);
|
|
2827
|
-
|
|
2827
|
+
Zt < Lt && (Lt = Zt), Zt > st && (st = Zt), Kt < ft && (ft = Kt), Kt > Xt && (Xt = Kt);
|
|
2828
2828
|
}
|
|
2829
2829
|
} catch (ee) {
|
|
2830
2830
|
Ct = !0, Bt = ee;
|
|
@@ -2856,29 +2856,29 @@ function ur() {
|
|
|
2856
2856
|
}
|
|
2857
2857
|
return tt;
|
|
2858
2858
|
}, rt = function(U) {
|
|
2859
|
-
var $ = 0, J = 0,
|
|
2859
|
+
var $ = 0, J = 0, Z = 0, at = 0;
|
|
2860
2860
|
if (U.forEach(function(j) {
|
|
2861
|
-
j.left ? v[d.get(j.left)] - v[d.get(j.right)] >= 0 ? $++ : J++ : L[d.get(j.top)] - L[d.get(j.bottom)] >= 0 ?
|
|
2862
|
-
}), $ > J &&
|
|
2861
|
+
j.left ? v[d.get(j.left)] - v[d.get(j.right)] >= 0 ? $++ : J++ : L[d.get(j.top)] - L[d.get(j.bottom)] >= 0 ? Z++ : at++;
|
|
2862
|
+
}), $ > J && Z > at)
|
|
2863
2863
|
for (var ct = 0; ct < d.size; ct++)
|
|
2864
2864
|
v[ct] = -1 * v[ct], L[ct] = -1 * L[ct];
|
|
2865
2865
|
else if ($ > J)
|
|
2866
2866
|
for (var nt = 0; nt < d.size; nt++)
|
|
2867
2867
|
v[nt] = -1 * v[nt];
|
|
2868
|
-
else if (
|
|
2868
|
+
else if (Z > at)
|
|
2869
2869
|
for (var tt = 0; tt < d.size; tt++)
|
|
2870
2870
|
L[tt] = -1 * L[tt];
|
|
2871
2871
|
}, n = function(U) {
|
|
2872
|
-
var $ = [], J = new g(),
|
|
2872
|
+
var $ = [], J = new g(), Z = /* @__PURE__ */ new Set(), at = 0;
|
|
2873
2873
|
return U.forEach(function(ct, nt) {
|
|
2874
|
-
if (!
|
|
2874
|
+
if (!Z.has(nt)) {
|
|
2875
2875
|
$[at] = [];
|
|
2876
2876
|
var tt = nt;
|
|
2877
|
-
for (J.push(tt),
|
|
2877
|
+
for (J.push(tt), Z.add(tt), $[at].push(tt); J.length != 0; ) {
|
|
2878
2878
|
tt = J.shift();
|
|
2879
2879
|
var j = U.get(tt);
|
|
2880
2880
|
j.forEach(function(ut) {
|
|
2881
|
-
|
|
2881
|
+
Z.has(ut.id) || (J.push(ut.id), Z.add(ut.id), $[at].push(ut.id));
|
|
2882
2882
|
});
|
|
2883
2883
|
}
|
|
2884
2884
|
at++;
|
|
@@ -2886,28 +2886,28 @@ function ur() {
|
|
|
2886
2886
|
}), $;
|
|
2887
2887
|
}, m = function(U) {
|
|
2888
2888
|
var $ = /* @__PURE__ */ new Map();
|
|
2889
|
-
return U.forEach(function(J,
|
|
2890
|
-
$.set(
|
|
2891
|
-
}), U.forEach(function(J,
|
|
2889
|
+
return U.forEach(function(J, Z) {
|
|
2890
|
+
$.set(Z, []);
|
|
2891
|
+
}), U.forEach(function(J, Z) {
|
|
2892
2892
|
J.forEach(function(at) {
|
|
2893
|
-
$.get(
|
|
2893
|
+
$.get(Z).push(at), $.get(at.id).push({ id: Z, gap: at.gap, direction: at.direction });
|
|
2894
2894
|
});
|
|
2895
2895
|
}), $;
|
|
2896
2896
|
}, p = function(U) {
|
|
2897
2897
|
var $ = /* @__PURE__ */ new Map();
|
|
2898
|
-
return U.forEach(function(J,
|
|
2899
|
-
$.set(
|
|
2900
|
-
}), U.forEach(function(J,
|
|
2898
|
+
return U.forEach(function(J, Z) {
|
|
2899
|
+
$.set(Z, []);
|
|
2900
|
+
}), U.forEach(function(J, Z) {
|
|
2901
2901
|
J.forEach(function(at) {
|
|
2902
|
-
$.get(at.id).push({ id:
|
|
2902
|
+
$.get(at.id).push({ id: Z, gap: at.gap, direction: at.direction });
|
|
2903
2903
|
});
|
|
2904
2904
|
}), $;
|
|
2905
|
-
}, E = [], y = [], R = !1, M = !1, F = /* @__PURE__ */ new Set(), W = /* @__PURE__ */ new Map(), x = /* @__PURE__ */ new Map(),
|
|
2905
|
+
}, E = [], y = [], R = !1, M = !1, F = /* @__PURE__ */ new Set(), W = /* @__PURE__ */ new Map(), x = /* @__PURE__ */ new Map(), k = [];
|
|
2906
2906
|
if (l.fixedNodeConstraint && l.fixedNodeConstraint.forEach(function(b) {
|
|
2907
2907
|
F.add(b.nodeId);
|
|
2908
2908
|
}), l.relativePlacementConstraint && (l.relativePlacementConstraint.forEach(function(b) {
|
|
2909
2909
|
b.left ? (W.has(b.left) ? W.get(b.left).push({ id: b.right, gap: b.gap, direction: "horizontal" }) : W.set(b.left, [{ id: b.right, gap: b.gap, direction: "horizontal" }]), W.has(b.right) || W.set(b.right, [])) : (W.has(b.top) ? W.get(b.top).push({ id: b.bottom, gap: b.gap, direction: "vertical" }) : W.set(b.top, [{ id: b.bottom, gap: b.gap, direction: "vertical" }]), W.has(b.bottom) || W.set(b.bottom, []));
|
|
2910
|
-
}), x = m(W),
|
|
2910
|
+
}), x = m(W), k = n(x)), i.TRANSFORM_ON_CONSTRAINT_HANDLING) {
|
|
2911
2911
|
if (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 1)
|
|
2912
2912
|
l.fixedNodeConstraint.forEach(function(b, U) {
|
|
2913
2913
|
E[U] = [b.position.x, b.position.y], y[U] = [v[d.get(b.nodeId)], L[d.get(b.nodeId)]];
|
|
@@ -2932,37 +2932,37 @@ function ur() {
|
|
|
2932
2932
|
R = !0;
|
|
2933
2933
|
}
|
|
2934
2934
|
if (l.alignmentConstraint.horizontal) {
|
|
2935
|
-
for (var
|
|
2935
|
+
for (var Z = l.alignmentConstraint.horizontal, at = function(tt) {
|
|
2936
2936
|
var j = /* @__PURE__ */ new Set();
|
|
2937
|
-
|
|
2937
|
+
Z[tt].forEach(function(pt) {
|
|
2938
2938
|
j.add(pt);
|
|
2939
2939
|
});
|
|
2940
2940
|
var ut = new Set([].concat(f(j)).filter(function(pt) {
|
|
2941
2941
|
return F.has(pt);
|
|
2942
2942
|
})), Mt = void 0;
|
|
2943
|
-
ut.size > 0 ? Mt = v[d.get(ut.values().next().value)] : Mt = Q(j).y,
|
|
2943
|
+
ut.size > 0 ? Mt = v[d.get(ut.values().next().value)] : Mt = Q(j).y, Z[tt].forEach(function(pt) {
|
|
2944
2944
|
E[b] = [v[d.get(pt)], Mt], y[b] = [v[d.get(pt)], L[d.get(pt)]], b++;
|
|
2945
2945
|
});
|
|
2946
|
-
}, ct = 0; ct <
|
|
2946
|
+
}, ct = 0; ct < Z.length; ct++)
|
|
2947
2947
|
at(ct);
|
|
2948
2948
|
R = !0;
|
|
2949
2949
|
}
|
|
2950
2950
|
l.relativePlacementConstraint && (M = !0);
|
|
2951
2951
|
})();
|
|
2952
2952
|
else if (l.relativePlacementConstraint) {
|
|
2953
|
-
for (var V = 0, Y = 0, et = 0; et <
|
|
2954
|
-
|
|
2953
|
+
for (var V = 0, Y = 0, et = 0; et < k.length; et++)
|
|
2954
|
+
k[et].length > V && (V = k[et].length, Y = et);
|
|
2955
2955
|
if (V < x.size / 2)
|
|
2956
2956
|
rt(l.relativePlacementConstraint), R = !1, M = !1;
|
|
2957
2957
|
else {
|
|
2958
2958
|
var z = /* @__PURE__ */ new Map(), w = /* @__PURE__ */ new Map(), H = [];
|
|
2959
|
-
|
|
2959
|
+
k[Y].forEach(function(b) {
|
|
2960
2960
|
W.get(b).forEach(function(U) {
|
|
2961
2961
|
U.direction == "horizontal" ? (z.has(b) ? z.get(b).push(U) : z.set(b, [U]), z.has(U.id) || z.set(U.id, []), H.push({ left: b, right: U.id })) : (w.has(b) ? w.get(b).push(U) : w.set(b, [U]), w.has(U.id) || w.set(U.id, []), H.push({ top: b, bottom: U.id }));
|
|
2962
2962
|
});
|
|
2963
2963
|
}), rt(H), M = !1;
|
|
2964
2964
|
var B = O(z, "horizontal"), _ = O(w, "vertical");
|
|
2965
|
-
|
|
2965
|
+
k[Y].forEach(function(b, U) {
|
|
2966
2966
|
y[U] = [v[d.get(b)], L[d.get(b)]], E[U] = [], B.has(b) ? E[U][0] = B.get(b) : E[U][0] = v[d.get(b)], _.has(b) ? E[U][1] = _.get(b) : E[U][1] = L[d.get(b)];
|
|
2967
2967
|
}), R = !0;
|
|
2968
2968
|
}
|
|
@@ -2983,8 +2983,8 @@ function ur() {
|
|
|
2983
2983
|
if (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 0) {
|
|
2984
2984
|
var Et = { x: 0, y: 0 };
|
|
2985
2985
|
l.fixedNodeConstraint.forEach(function(b, U) {
|
|
2986
|
-
var $ = { x: v[d.get(b.nodeId)], y: L[d.get(b.nodeId)] }, J = b.position,
|
|
2987
|
-
Et.x +=
|
|
2986
|
+
var $ = { x: v[d.get(b.nodeId)], y: L[d.get(b.nodeId)] }, J = b.position, Z = X(J, $);
|
|
2987
|
+
Et.x += Z.x, Et.y += Z.y;
|
|
2988
2988
|
}), Et.x /= l.fixedNodeConstraint.length, Et.y /= l.fixedNodeConstraint.length, v.forEach(function(b, U) {
|
|
2989
2989
|
v[U] += Et.x;
|
|
2990
2990
|
}), L.forEach(function(b, U) {
|
|
@@ -3002,9 +3002,9 @@ function ur() {
|
|
|
3002
3002
|
});
|
|
3003
3003
|
var J = new Set([].concat(f($)).filter(function(at) {
|
|
3004
3004
|
return F.has(at);
|
|
3005
|
-
})),
|
|
3006
|
-
J.size > 0 ?
|
|
3007
|
-
F.has(at) || (v[d.get(at)] =
|
|
3005
|
+
})), Z = void 0;
|
|
3006
|
+
J.size > 0 ? Z = v[d.get(J.values().next().value)] : Z = Q($).x, $.forEach(function(at) {
|
|
3007
|
+
F.has(at) || (v[d.get(at)] = Z);
|
|
3008
3008
|
});
|
|
3009
3009
|
}, Ht = 0; Ht < Dt.length; Ht++)
|
|
3010
3010
|
Rt(Ht);
|
|
@@ -3016,15 +3016,15 @@ function ur() {
|
|
|
3016
3016
|
});
|
|
3017
3017
|
var J = new Set([].concat(f($)).filter(function(at) {
|
|
3018
3018
|
return F.has(at);
|
|
3019
|
-
})),
|
|
3020
|
-
J.size > 0 ?
|
|
3021
|
-
F.has(at) || (L[d.get(at)] =
|
|
3019
|
+
})), Z = void 0;
|
|
3020
|
+
J.size > 0 ? Z = L[d.get(J.values().next().value)] : Z = Q($).y, $.forEach(function(at) {
|
|
3021
|
+
F.has(at) || (L[d.get(at)] = Z);
|
|
3022
3022
|
});
|
|
3023
3023
|
}, Ft = 0; Ft < Ut.length; Ft++)
|
|
3024
3024
|
Pt(Ft);
|
|
3025
3025
|
}
|
|
3026
3026
|
l.relativePlacementConstraint && function() {
|
|
3027
|
-
var b = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), $ = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(),
|
|
3027
|
+
var b = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), $ = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), at = /* @__PURE__ */ new Map(), ct = /* @__PURE__ */ new Set(), nt = /* @__PURE__ */ new Set();
|
|
3028
3028
|
if (F.forEach(function(Gt) {
|
|
3029
3029
|
ct.add(Gt), nt.add(Gt);
|
|
3030
3030
|
}), l.alignmentConstraint) {
|
|
@@ -3032,7 +3032,7 @@ function ur() {
|
|
|
3032
3032
|
for (var tt = l.alignmentConstraint.vertical, j = function(yt) {
|
|
3033
3033
|
$.set("dummy" + yt, []), tt[yt].forEach(function(wt) {
|
|
3034
3034
|
b.set(wt, "dummy" + yt), $.get("dummy" + yt).push(wt), F.has(wt) && ct.add("dummy" + yt);
|
|
3035
|
-
}),
|
|
3035
|
+
}), Z.set("dummy" + yt, v[d.get(tt[yt][0])]);
|
|
3036
3036
|
}, ut = 0; ut < tt.length; ut++)
|
|
3037
3037
|
j(ut);
|
|
3038
3038
|
if (l.alignmentConstraint.horizontal)
|
|
@@ -3045,8 +3045,8 @@ function ur() {
|
|
|
3045
3045
|
}
|
|
3046
3046
|
var lt = /* @__PURE__ */ new Map(), ot = /* @__PURE__ */ new Map(), Lt = function(yt) {
|
|
3047
3047
|
W.get(yt).forEach(function(wt) {
|
|
3048
|
-
var
|
|
3049
|
-
wt.direction == "horizontal" ? (
|
|
3048
|
+
var kt = void 0, $t = void 0;
|
|
3049
|
+
wt.direction == "horizontal" ? (kt = b.get(yt) ? b.get(yt) : yt, b.get(wt.id) ? $t = { id: b.get(wt.id), gap: wt.gap, direction: wt.direction } : $t = wt, lt.has(kt) ? lt.get(kt).push($t) : lt.set(kt, [$t]), lt.has($t.id) || lt.set($t.id, [])) : (kt = U.get(yt) ? U.get(yt) : yt, U.get(wt.id) ? $t = { id: U.get(wt.id), gap: wt.gap, direction: wt.direction } : $t = wt, ot.has(kt) ? ot.get(kt).push($t) : ot.set(kt, [$t]), ot.has($t.id) || ot.set($t.id, []));
|
|
3050
3050
|
});
|
|
3051
3051
|
}, ft = !0, st = !1, Xt = void 0;
|
|
3052
3052
|
try {
|
|
@@ -3064,17 +3064,17 @@ function ur() {
|
|
|
3064
3064
|
throw Xt;
|
|
3065
3065
|
}
|
|
3066
3066
|
}
|
|
3067
|
-
var bt = m(lt), zt = m(ot), St = n(bt),
|
|
3067
|
+
var bt = m(lt), zt = m(ot), St = n(bt), Zt = n(zt), Kt = p(lt), he = p(ot), Qt = [], jt = [];
|
|
3068
3068
|
St.forEach(function(Gt, yt) {
|
|
3069
3069
|
Qt[yt] = [], Gt.forEach(function(wt) {
|
|
3070
3070
|
Kt.get(wt).length == 0 && Qt[yt].push(wt);
|
|
3071
3071
|
});
|
|
3072
|
-
}),
|
|
3072
|
+
}), Zt.forEach(function(Gt, yt) {
|
|
3073
3073
|
jt[yt] = [], Gt.forEach(function(wt) {
|
|
3074
3074
|
he.get(wt).length == 0 && jt[yt].push(wt);
|
|
3075
3075
|
});
|
|
3076
3076
|
});
|
|
3077
|
-
var _t = O(lt, "horizontal", ct,
|
|
3077
|
+
var _t = O(lt, "horizontal", ct, Z, Qt), Jt = O(ot, "vertical", nt, at, jt), oe = function(yt) {
|
|
3078
3078
|
$.get(yt) ? $.get(yt).forEach(function(wt) {
|
|
3079
3079
|
v[d.get(wt)] = _t.get(yt);
|
|
3080
3080
|
}) : v[d.get(yt)] = _t.get(yt);
|
|
@@ -3293,13 +3293,13 @@ function ur() {
|
|
|
3293
3293
|
});
|
|
3294
3294
|
} else {
|
|
3295
3295
|
Object.keys(o).forEach(function(x) {
|
|
3296
|
-
var
|
|
3296
|
+
var k = o[x], V = k.getRect().x, Y = k.getRect().x + k.getRect().width, et = k.getRect().y, z = k.getRect().y + k.getRect().height;
|
|
3297
3297
|
V < c && (c = V), Y > l && (l = Y), et < T && (T = et), z > d && (d = z);
|
|
3298
3298
|
});
|
|
3299
3299
|
var F = t.x - (l + c) / 2, W = t.y - (d + T) / 2;
|
|
3300
3300
|
Object.keys(o).forEach(function(x) {
|
|
3301
|
-
var
|
|
3302
|
-
|
|
3301
|
+
var k = o[x];
|
|
3302
|
+
k.setCenter(k.getCenterX() + F, k.getCenterY() + W);
|
|
3303
3303
|
});
|
|
3304
3304
|
}
|
|
3305
3305
|
}
|
|
@@ -3330,11 +3330,11 @@ function ur() {
|
|
|
3330
3330
|
v.randomize && (X = L.nodeIndexes, Q = L.xCoords, O = L.yCoords);
|
|
3331
3331
|
var n = function(x) {
|
|
3332
3332
|
return typeof x == "function";
|
|
3333
|
-
}, m = function(x,
|
|
3334
|
-
return n(x) ? x(
|
|
3335
|
-
}, p = f.calcParentsWithoutChildren(S, C), E = function W(x,
|
|
3336
|
-
for (var et =
|
|
3337
|
-
var w =
|
|
3333
|
+
}, m = function(x, k) {
|
|
3334
|
+
return n(x) ? x(k) : x;
|
|
3335
|
+
}, p = f.calcParentsWithoutChildren(S, C), E = function W(x, k, V, Y) {
|
|
3336
|
+
for (var et = k.length, z = 0; z < et; z++) {
|
|
3337
|
+
var w = k[z], H = null;
|
|
3338
3338
|
w.intersection(p).length == 0 && (H = w.children());
|
|
3339
3339
|
var B = void 0, _ = w.layoutDimensions({
|
|
3340
3340
|
nodeDimensionsIncludeLabels: Y.nodeDimensionsIncludeLabels
|
|
@@ -3356,17 +3356,17 @@ function ur() {
|
|
|
3356
3356
|
q = V.getGraphManager().add(V.newGraph(), B), W(q, H, V, Y);
|
|
3357
3357
|
}
|
|
3358
3358
|
}
|
|
3359
|
-
}, y = function(x,
|
|
3359
|
+
}, y = function(x, k, V) {
|
|
3360
3360
|
for (var Y = 0, et = 0, z = 0; z < V.length; z++) {
|
|
3361
3361
|
var w = V[z], H = rt[w.data("source")], B = rt[w.data("target")];
|
|
3362
3362
|
if (H && B && H !== B && H.getEdgesBetween(B).length == 0) {
|
|
3363
|
-
var _ =
|
|
3363
|
+
var _ = k.add(x.newEdge(), H, B);
|
|
3364
3364
|
_.id = w.id(), _.idealLength = m(v.idealEdgeLength, w), _.edgeElasticity = m(v.edgeElasticity, w), Y += _.idealLength, et++;
|
|
3365
3365
|
}
|
|
3366
3366
|
}
|
|
3367
3367
|
v.idealEdgeLength != null && (et > 0 ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = Y / et : n(v.idealEdgeLength) ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = 50 : l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = v.idealEdgeLength, l.MIN_REPULSION_DIST = c.MIN_REPULSION_DIST = c.DEFAULT_EDGE_LENGTH / 10, l.DEFAULT_RADIAL_SEPARATION = c.DEFAULT_EDGE_LENGTH);
|
|
3368
|
-
}, R = function(x,
|
|
3369
|
-
|
|
3368
|
+
}, R = function(x, k) {
|
|
3369
|
+
k.fixedNodeConstraint && (x.constraints.fixedNodeConstraint = k.fixedNodeConstraint), k.alignmentConstraint && (x.constraints.alignmentConstraint = k.alignmentConstraint), k.relativePlacementConstraint && (x.constraints.relativePlacementConstraint = k.relativePlacementConstraint);
|
|
3370
3370
|
};
|
|
3371
3371
|
v.nestingFactor != null && (l.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = c.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = v.nestingFactor), v.gravity != null && (l.DEFAULT_GRAVITY_STRENGTH = c.DEFAULT_GRAVITY_STRENGTH = v.gravity), v.numIter != null && (l.MAX_ITERATIONS = c.MAX_ITERATIONS = v.numIter), v.gravityRange != null && (l.DEFAULT_GRAVITY_RANGE_FACTOR = c.DEFAULT_GRAVITY_RANGE_FACTOR = v.gravityRange), v.gravityCompound != null && (l.DEFAULT_COMPOUND_GRAVITY_STRENGTH = c.DEFAULT_COMPOUND_GRAVITY_STRENGTH = v.gravityCompound), v.gravityRangeCompound != null && (l.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = c.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = v.gravityRangeCompound), v.initialEnergyOnIncremental != null && (l.DEFAULT_COOLING_FACTOR_INCREMENTAL = c.DEFAULT_COOLING_FACTOR_INCREMENTAL = v.initialEnergyOnIncremental), v.tilingCompareBy != null && (l.TILING_COMPARE_BY = v.tilingCompareBy), v.quality == "proof" ? s.QUALITY = 2 : s.QUALITY = 0, l.NODE_DIMENSIONS_INCLUDE_LABELS = c.NODE_DIMENSIONS_INCLUDE_LABELS = s.NODE_DIMENSIONS_INCLUDE_LABELS = v.nodeDimensionsIncludeLabels, l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = s.DEFAULT_INCREMENTAL = !v.randomize, l.ANIMATE = c.ANIMATE = s.ANIMATE = v.animate, l.TILE = v.tile, l.TILING_PADDING_VERTICAL = typeof v.tilingPaddingVertical == "function" ? v.tilingPaddingVertical.call() : v.tilingPaddingVertical, l.TILING_PADDING_HORIZONTAL = typeof v.tilingPaddingHorizontal == "function" ? v.tilingPaddingHorizontal.call() : v.tilingPaddingHorizontal, l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = s.DEFAULT_INCREMENTAL = !0, l.PURE_INCREMENTAL = !v.randomize, s.DEFAULT_UNIFORM_LEAF_NODE_SIZES = v.uniformNodeDimensions, v.step == "transformed" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, l.ENFORCE_CONSTRAINTS = !1, l.APPLY_LAYOUT = !1), v.step == "enforced" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !0, l.APPLY_LAYOUT = !1), v.step == "cose" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !1, l.APPLY_LAYOUT = !0), v.step == "all" && (v.randomize ? l.TRANSFORM_ON_CONSTRAINT_HANDLING = !0 : l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !0, l.APPLY_LAYOUT = !0), v.fixedNodeConstraint || v.alignmentConstraint || v.relativePlacementConstraint ? l.TREE_REDUCTION_ON_INCREMENTAL = !1 : l.TREE_REDUCTION_ON_INCREMENTAL = !0;
|
|
3372
3372
|
var M = new i(), F = M.newGraphManager();
|
|
@@ -3506,10 +3506,10 @@ function ur() {
|
|
|
3506
3506
|
}), C.quality == "default" || C.quality == "proof") {
|
|
3507
3507
|
var M = G.collection();
|
|
3508
3508
|
if (C.tile) {
|
|
3509
|
-
var F = /* @__PURE__ */ new Map(), W = [], x = [],
|
|
3509
|
+
var F = /* @__PURE__ */ new Map(), W = [], x = [], k = 0, V = { nodeIndexes: F, xCoords: W, yCoords: x }, Y = [];
|
|
3510
3510
|
if (O.forEach(function(vt, it) {
|
|
3511
3511
|
vt.edges().length == 0 && (vt.nodes().forEach(function(gt, mt) {
|
|
3512
|
-
M.merge(vt.nodes()[mt]), gt.isParent() || (V.nodeIndexes.set(vt.nodes()[mt].id(),
|
|
3512
|
+
M.merge(vt.nodes()[mt]), gt.isParent() || (V.nodeIndexes.set(vt.nodes()[mt].id(), k++), V.xCoords.push(vt.nodes()[0].position().x), V.yCoords.push(vt.nodes()[0].position().y));
|
|
3513
3513
|
}), Y.push(it));
|
|
3514
3514
|
}), M.length > 1) {
|
|
3515
3515
|
var et = M.boundingBox();
|
|
@@ -3639,8 +3639,8 @@ function ur() {
|
|
|
3639
3639
|
var c = s.cy, l = s.eles, T = l.nodes(), d = l.nodes(":parent"), v = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map(), C = [], G = [], K = [], X = [], Q = [], O = [], rt = [], n = [], m = void 0, p = 1e8, E = 1e-9, y = s.piTol, R = s.samplingType, M = s.nodeSeparation, F = void 0, W = function() {
|
|
3640
3640
|
for (var U = 0, $ = 0, J = !1; $ < F; ) {
|
|
3641
3641
|
U = Math.floor(Math.random() * m), J = !1;
|
|
3642
|
-
for (var
|
|
3643
|
-
if (X[
|
|
3642
|
+
for (var Z = 0; Z < $; Z++)
|
|
3643
|
+
if (X[Z] == U) {
|
|
3644
3644
|
J = !0;
|
|
3645
3645
|
break;
|
|
3646
3646
|
}
|
|
@@ -3650,12 +3650,12 @@ function ur() {
|
|
|
3650
3650
|
continue;
|
|
3651
3651
|
}
|
|
3652
3652
|
}, x = function(U, $, J) {
|
|
3653
|
-
for (var
|
|
3653
|
+
for (var Z = [], at = 0, ct = 0, nt = 0, tt = void 0, j = [], ut = 0, Mt = 1, pt = 0; pt < m; pt++)
|
|
3654
3654
|
j[pt] = p;
|
|
3655
|
-
for (
|
|
3656
|
-
nt =
|
|
3655
|
+
for (Z[ct] = U, j[U] = 0; ct >= at; ) {
|
|
3656
|
+
nt = Z[at++];
|
|
3657
3657
|
for (var xt = C[nt], lt = 0; lt < xt.length; lt++)
|
|
3658
|
-
tt = L.get(xt[lt]), j[tt] == p && (j[tt] = j[nt] + 1,
|
|
3658
|
+
tt = L.get(xt[lt]), j[tt] == p && (j[tt] = j[nt] + 1, Z[++ct] = tt);
|
|
3659
3659
|
O[nt][$] = j[nt] * M;
|
|
3660
3660
|
}
|
|
3661
3661
|
if (J) {
|
|
@@ -3665,12 +3665,12 @@ function ur() {
|
|
|
3665
3665
|
Q[Lt] > ut && (ut = Q[Lt], Mt = Lt);
|
|
3666
3666
|
}
|
|
3667
3667
|
return Mt;
|
|
3668
|
-
},
|
|
3668
|
+
}, k = function(U) {
|
|
3669
3669
|
var $ = void 0;
|
|
3670
3670
|
if (U) {
|
|
3671
3671
|
$ = Math.floor(Math.random() * m);
|
|
3672
|
-
for (var
|
|
3673
|
-
Q[
|
|
3672
|
+
for (var Z = 0; Z < m; Z++)
|
|
3673
|
+
Q[Z] = p;
|
|
3674
3674
|
for (var at = 0; at < F; at++)
|
|
3675
3675
|
X[at] = $, $ = x($, at, U);
|
|
3676
3676
|
} else {
|
|
@@ -3687,16 +3687,16 @@ function ur() {
|
|
|
3687
3687
|
for (var ut = 0; ut < F; ut++)
|
|
3688
3688
|
rt[j][ut] = O[X[ut]][j];
|
|
3689
3689
|
}, V = function() {
|
|
3690
|
-
for (var U = g.svd(rt), $ = U.S, J = U.U,
|
|
3690
|
+
for (var U = g.svd(rt), $ = U.S, J = U.U, Z = U.V, at = $[0] * $[0] * $[0], ct = [], nt = 0; nt < F; nt++) {
|
|
3691
3691
|
ct[nt] = [];
|
|
3692
3692
|
for (var tt = 0; tt < F; tt++)
|
|
3693
3693
|
ct[nt][tt] = 0, nt == tt && (ct[nt][tt] = $[nt] / ($[nt] * $[nt] + at / ($[nt] * $[nt])));
|
|
3694
3694
|
}
|
|
3695
|
-
n = i.multMat(i.multMat(
|
|
3695
|
+
n = i.multMat(i.multMat(Z, ct), i.transpose(J));
|
|
3696
3696
|
}, Y = function() {
|
|
3697
|
-
for (var U = void 0, $ = void 0, J = [],
|
|
3698
|
-
J[nt] = Math.random(),
|
|
3699
|
-
J = i.normalize(J),
|
|
3697
|
+
for (var U = void 0, $ = void 0, J = [], Z = [], at = [], ct = [], nt = 0; nt < m; nt++)
|
|
3698
|
+
J[nt] = Math.random(), Z[nt] = Math.random();
|
|
3699
|
+
J = i.normalize(J), Z = i.normalize(Z);
|
|
3700
3700
|
for (var tt = E, j = E, ut = void 0; ; ) {
|
|
3701
3701
|
for (var Mt = 0; Mt < m; Mt++)
|
|
3702
3702
|
at[Mt] = J[Mt];
|
|
@@ -3708,13 +3708,13 @@ function ur() {
|
|
|
3708
3708
|
at[pt] = J[pt];
|
|
3709
3709
|
for (j = E; ; ) {
|
|
3710
3710
|
for (var xt = 0; xt < m; xt++)
|
|
3711
|
-
ct[xt] =
|
|
3712
|
-
if (ct = i.minusOp(ct, i.multCons(at, i.dotProduct(at, ct))),
|
|
3711
|
+
ct[xt] = Z[xt];
|
|
3712
|
+
if (ct = i.minusOp(ct, i.multCons(at, i.dotProduct(at, ct))), Z = i.multGamma(i.multL(i.multGamma(ct), O, n)), $ = i.dotProduct(ct, Z), Z = i.normalize(Z), tt = i.dotProduct(ct, Z), ut = Math.abs(tt / j), ut <= 1 + y && ut >= 1)
|
|
3713
3713
|
break;
|
|
3714
3714
|
j = tt;
|
|
3715
3715
|
}
|
|
3716
3716
|
for (var lt = 0; lt < m; lt++)
|
|
3717
|
-
ct[lt] =
|
|
3717
|
+
ct[lt] = Z[lt];
|
|
3718
3718
|
G = i.multCons(at, Math.sqrt(Math.abs(U))), K = i.multCons(ct, Math.sqrt(Math.abs($)));
|
|
3719
3719
|
};
|
|
3720
3720
|
f.connectComponents(c, l, f.getTopMostNodes(T), v), d.forEach(function(b) {
|
|
@@ -3744,8 +3744,8 @@ function ur() {
|
|
|
3744
3744
|
for (var U = b.children().intersection(l); U.nodes(":childless").length == 0; )
|
|
3745
3745
|
U = U.nodes()[0].children().intersection(l);
|
|
3746
3746
|
var $ = 0, J = U.nodes(":childless")[0].connectedEdges().length;
|
|
3747
|
-
U.nodes(":childless").forEach(function(
|
|
3748
|
-
|
|
3747
|
+
U.nodes(":childless").forEach(function(Z, at) {
|
|
3748
|
+
Z.connectedEdges().length < J && (J = Z.connectedEdges().length, $ = at);
|
|
3749
3749
|
}), S.set(b.id(), U.nodes(":childless")[$].id());
|
|
3750
3750
|
}), T.forEach(function(b) {
|
|
3751
3751
|
var U = void 0;
|
|
@@ -3755,8 +3755,8 @@ function ur() {
|
|
|
3755
3755
|
});
|
|
3756
3756
|
var Nt = function(U) {
|
|
3757
3757
|
var $ = L.get(U), J = void 0;
|
|
3758
|
-
v.get(U).forEach(function(
|
|
3759
|
-
c.getElementById(
|
|
3758
|
+
v.get(U).forEach(function(Z) {
|
|
3759
|
+
c.getElementById(Z).isParent() ? J = S.get(Z) : J = Z, C[$].push(J), C[L.get(J)].push(U);
|
|
3760
3760
|
});
|
|
3761
3761
|
}, vt = !0, it = !1, gt = void 0;
|
|
3762
3762
|
try {
|
|
@@ -3782,7 +3782,7 @@ function ur() {
|
|
|
3782
3782
|
O[Dt] = [];
|
|
3783
3783
|
for (var Rt = 0; Rt < F; Rt++)
|
|
3784
3784
|
n[Rt] = [];
|
|
3785
|
-
return s.quality == "draft" || s.step == "all" ? (
|
|
3785
|
+
return s.quality == "draft" || s.step == "all" ? (k(R), V(), Y(), Et = { nodeIndexes: L, xCoords: G, yCoords: K }) : (L.forEach(function(b, U) {
|
|
3786
3786
|
G.push(c.getElementById(U).position("x")), K.push(c.getElementById(U).position("y"));
|
|
3787
3787
|
}), Et = { nodeIndexes: L, xCoords: G, yCoords: K }), Et;
|
|
3788
3788
|
} else {
|
|
@@ -3887,9 +3887,9 @@ var De = {
|
|
|
3887
3887
|
return I.type === "service";
|
|
3888
3888
|
}, "isArchitectureService"), Cr = /* @__PURE__ */ dt(function(I) {
|
|
3889
3889
|
return I.type === "junction";
|
|
3890
|
-
}, "isArchitectureJunction"), be = /* @__PURE__ */ dt((I) => I.data(), "edgeData"), ie = /* @__PURE__ */ dt((I) => I.data(), "nodeData"), Ar =
|
|
3890
|
+
}, "isArchitectureJunction"), be = /* @__PURE__ */ dt((I) => I.data(), "edgeData"), ie = /* @__PURE__ */ dt((I) => I.data(), "nodeData"), Ar = Ze.architecture, ae, Pe = (ae = class {
|
|
3891
3891
|
constructor() {
|
|
3892
|
-
this.nodes = {}, this.groups = {}, this.edges = [], this.registeredIds = {}, this.elements = {}, this.setAccTitle =
|
|
3892
|
+
this.nodes = {}, this.groups = {}, this.edges = [], this.registeredIds = {}, this.elements = {}, this.setAccTitle = ke, this.getAccTitle = qe, this.setDiagramTitle = Qe, this.getDiagramTitle = Je, this.getAccDescription = Ke, this.setAccDescription = je, this.clear();
|
|
3893
3893
|
}
|
|
3894
3894
|
clear() {
|
|
3895
3895
|
this.nodes = {}, this.groups = {}, this.edges = [], this.registeredIds = {}, this.dataStructures = void 0, this.elements = {}, _e();
|