@antdv-next/x 1.1.3-beta.5 → 1.2.1-beta.1

package/es/{arc-BuXEd18J.js → arc-NI3ROx5X.js}

@@ -1,5 +1,5 @@
-import { n as e, t } from "./path-Dm3C8WEs.js";
-import { a as n, c as r, d as i, f as a, i as o, l as s, n as c, p as l, r as u, s as d, t as f, u as p } from "./math-CoDOuve-.js";
+import { n as e, t } from "./path-CqWAdh69.js";
+import { a as n, c as r, d as i, f as a, i as o, l as s, n as c, p as l, r as u, s as d, t as f, u as p } from "./math-BZ_bUCIA.js";
 //#region ../../node_modules/.pnpm/d3-shape@3.2.0/node_modules/d3-shape/src/arc.js
 function m(e) {
 	return e.innerRadius;

package/es/architecture-PBZL5I3N-BRGGaMu3.js

@@ -0,0 +1,3 @@
+import "./chunk-XZSTWKYB-DYKLwCEy.js";
+import { h as e } from "./mermaid-parser.core-C_69nk7j.js";
+export { e as createArchitectureServices };

package/es/{architectureDiagram-2XIMDMQ5-CmfsCwJk.js → architectureDiagram-2XIMDMQ5-OvuktNfv.js}

@@ -1,12 +1,12 @@
-import { o as e, t } from "./chunk-WQLz0Won.js";
-import { g as n, h as r, p as i } from "./src-CUQ6oOYk.js";
-import { r as a, s as o } from "./chunk-GEFDOKGD-BWpC-zoH.js";
-import { B as s, C as c, K as l, L as u, V as d, W as f, _ as p, a as m, b as h, d as g, v as _, y as v } from "./chunk-7R4GIKGN-QT6IorJ_.js";
-import { t as y } from "./chunk-HHEYEP7N-Cxc7E4dX.js";
-import { a as b, i as x, n as S, r as C } from "./chunk-PU5JKC2W-DdP8BS-S.js";
-import { t as w } from "./chunk-4BX2VUAB-J2N81Fpp.js";
-import { t as T } from "./mermaid-parser.core-7Wn2L29P.js";
-import { t as E } from "./cytoscape.esm-i2CZcWd-.js";
+import { o as e, t } from "./rolldown-runtime-CEY2VRuR.js";
+import { g as n, h as r, p as i } from "./src-Dynw_Lub.js";
+import { r as a, s as o } from "./chunk-GEFDOKGD-BEzc6NZw.js";
+import { t as s } from "./mermaid-parser.core-C_69nk7j.js";
+import { B as c, C as l, K as u, L as d, V as f, W as p, _ as m, a as h, b as g, d as _, v, y } from "./chunk-7R4GIKGN-scch4dXY.js";
+import { a as b, i as x, n as S, r as C } from "./chunk-PU5JKC2W-TuGY6X1n.js";
+import { t as w } from "./chunk-4BX2VUAB-Rm8-te6i.js";
+import { t as T } from "./cytoscape.esm-B_-hKv4-.js";
+import { a as E } from "./mermaid.core-BVGVwWcu.js";
 //#region ../../node_modules/.pnpm/layout-base@2.0.1/node_modules/layout-base/layout-base.js
 var D = /* @__PURE__ */ t(((e, t) => {
 	(function(n, r) {
@@ -102,7 +102,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 			(function(e, t, n) {
 				var r = n(2), i = n(10), a = n(13), o = n(0), s = n(16), c = n(5);
 				function l(e, t, n, o) {
-					n == null && o == null && (o = t), r.call(this, o), e.graphManager != null && (e = e.graphManager), this.estimatedSize = i.MIN_VALUE, this.inclusionTreeDepth = i.MAX_VALUE, this.vGraphObject = o, this.edges = [], this.graphManager = e, n != null && t != null ? this.rect = new a(t.x, t.y, n.width, n.height) : this.rect = new a();
+					n == null && o == null && (o = t), r.call(this, o), e.graphManager != null && (e = e.graphManager), this.estimatedSize = i.MIN_VALUE, this.inclusionTreeDepth = i.MAX_VALUE, this.vGraphObject = o, this.edges = [], this.graphManager = e, this.rect = n != null && t != null ? new a(t.x, t.y, n.width, n.height) : new a();
 				}
 				for (var u in l.prototype = Object.create(r.prototype), r) l[u] = r[u];
 				l.prototype.getEdges = function() {
@@ -152,7 +152,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 				}, l.prototype.getEdgesBetween = function(e) {
 					var t = [], n = this;
 					return n.edges.forEach(function(r) {
-						if (!(r.source == n || r.target == n)) throw "Incorrect edge source and/or target";
+						if (r.source != n && r.target != n) throw "Incorrect edge source and/or target";
 						(r.target == e || r.source == e) && t.push(r);
 					}), t;
 				}, l.prototype.getNeighborsList = function() {
@@ -272,17 +272,16 @@ var D = /* @__PURE__ */ t(((e, t) => {
 						if (this.graphManager == null) throw "Graph has no graph mgr!";
 						if (this.getNodes().indexOf(r) > -1) throw "Node already in graph!";
 						return r.owner = this, this.getNodes().push(r), r;
-					} else {
-						var i = e;
-						if (!(this.getNodes().indexOf(t) > -1 && this.getNodes().indexOf(n) > -1)) throw "Source or target not in graph!";
-						if (!(t.owner == n.owner && t.owner == this)) throw "Both owners must be this graph!";
-						return t.owner == n.owner ? (i.source = t, i.target = n, i.isInterGraph = !1, this.getEdges().push(i), t.edges.push(i), n != t && n.edges.push(i), i) : null;
 					}
+					var i = e;
+					if (!(this.getNodes().indexOf(t) > -1 && this.getNodes().indexOf(n) > -1)) throw "Source or target not in graph!";
+					if (t.owner != n.owner || t.owner != this) throw "Both owners must be this graph!";
+					return t.owner == n.owner ? (i.source = t, i.target = n, i.isInterGraph = !1, this.getEdges().push(i), t.edges.push(i), n != t && n.edges.push(i), i) : null;
 				}, f.prototype.remove = function(e) {
 					var t = e;
 					if (e instanceof s) {
 						if (t == null) throw "Node is null!";
-						if (!(t.owner != null && t.owner == this)) throw "Owner graph is invalid!";
+						if (t.owner == null || t.owner != this) throw "Owner graph is invalid!";
 						if (this.graphManager == null) throw "Owner graph manager is invalid!";
 						for (var n = t.edges.slice(), r, i = n.length, a = 0; a < i; a++) r = n[a], r.isInterGraph ? this.graphManager.remove(r) : r.source.owner.remove(r);
 						var o = this.nodes.indexOf(t);
@@ -291,8 +290,8 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					} else if (e instanceof c) {
 						var r = e;
 						if (r == null) throw "Edge is null!";
-						if (!(r.source != null && r.target != null)) throw "Source and/or target is null!";
-						if (!(r.source.owner != null && r.target.owner != null && r.source.owner == this && r.target.owner == this)) throw "Source and/or target owner is invalid!";
+						if (r.source == null || r.target == null) throw "Source and/or target is null!";
+						if (r.source.owner == null || r.target.owner == null || r.source.owner != this || r.target.owner != this) throw "Source and/or target owner is invalid!";
 						var l = r.source.edges.indexOf(r), u = r.target.edges.indexOf(r);
 						if (!(l > -1 && u > -1)) throw "Source and/or target doesn't know this edge!";
 						r.source.edges.splice(l, 1), r.target != r.source && r.target.edges.splice(u, 1);
@@ -329,7 +328,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 						var i = t[r];
 						e += i.calcEstimatedSize();
 					}
-					return e == 0 ? this.estimatedSize = a.EMPTY_COMPOUND_NODE_SIZE : this.estimatedSize = e / Math.sqrt(this.nodes.length), this.estimatedSize;
+					return this.estimatedSize = e == 0 ? a.EMPTY_COMPOUND_NODE_SIZE : e / Math.sqrt(this.nodes.length), this.estimatedSize;
 				}, f.prototype.updateConnected = function() {
 					var e = this;
 					if (this.nodes.length == 0) {
@@ -369,17 +368,16 @@ var D = /* @__PURE__ */ t(((e, t) => {
 						if (this.graphs.push(e), e.parent != null) throw "Already has a parent!";
 						if (t.child != null) throw "Already has a child!";
 						return e.parent = t, t.child = e, e;
-					} else {
-						i = n, r = t, n = e;
-						var a = r.getOwner(), o = i.getOwner();
-						if (!(a != null && a.getGraphManager() == this)) throw "Source not in this graph mgr!";
-						if (!(o != null && o.getGraphManager() == this)) throw "Target not in this graph mgr!";
-						if (a == o) return n.isInterGraph = !1, a.add(n, r, i);
-						if (n.isInterGraph = !0, n.source = r, n.target = i, this.edges.indexOf(n) > -1) throw "Edge already in inter-graph edge list!";
-						if (this.edges.push(n), !(n.source != null && n.target != null)) throw "Edge source and/or target is null!";
-						if (!(n.source.edges.indexOf(n) == -1 && n.target.edges.indexOf(n) == -1)) throw "Edge already in source and/or target incidency list!";
-						return n.source.edges.push(n), n.target.edges.push(n), n;
 					}
+					i = n, r = t, n = e;
+					var a = r.getOwner(), o = i.getOwner();
+					if (a == null || a.getGraphManager() != this) throw "Source not in this graph mgr!";
+					if (o == null || o.getGraphManager() != this) throw "Target not in this graph mgr!";
+					if (a == o) return n.isInterGraph = !1, a.add(n, r, i);
+					if (n.isInterGraph = !0, n.source = r, n.target = i, this.edges.indexOf(n) > -1) throw "Edge already in inter-graph edge list!";
+					if (this.edges.push(n), n.source == null || n.target == null) throw "Edge source and/or target is null!";
+					if (n.source.edges.indexOf(n) != -1 || n.target.edges.indexOf(n) != -1) throw "Edge already in source and/or target incidency list!";
+					return n.source.edges.push(n), n.target.edges.push(n), n;
 				}, a.prototype.remove = function(e) {
 					if (e instanceof r) {
 						var t = e;
@@ -399,10 +397,10 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					} else if (e instanceof i) {
 						if (a = e, a == null) throw "Edge is null!";
 						if (!a.isInterGraph) throw "Not an inter-graph edge!";
-						if (!(a.source != null && a.target != null)) throw "Source and/or target is null!";
-						if (!(a.source.edges.indexOf(a) != -1 && a.target.edges.indexOf(a) != -1)) throw "Source and/or target doesn't know this edge!";
+						if (a.source == null || a.target == null) throw "Source and/or target is null!";
+						if (a.source.edges.indexOf(a) == -1 || a.target.edges.indexOf(a) == -1) throw "Source and/or target doesn't know this edge!";
 						var u = a.source.edges.indexOf(a);
-						if (a.source.edges.splice(u, 1), u = a.target.edges.indexOf(a), a.target.edges.splice(u, 1), !(a.source.owner != null && a.source.owner.getGraphManager() != null)) throw "Edge owner graph or owner graph manager is null!";
+						if (a.source.edges.splice(u, 1), u = a.target.edges.indexOf(a), a.target.edges.splice(u, 1), a.source.owner == null || a.source.owner.getGraphManager() == null) throw "Edge owner graph or owner graph manager is null!";
 						if (a.source.owner.getGraphManager().edges.indexOf(a) == -1) throw "Not in owner graph manager's edge list!";
 						var u = a.source.owner.getGraphManager().edges.indexOf(a);
 						a.source.owner.getGraphManager().edges.splice(u, 1);
@@ -444,7 +442,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 				}, a.prototype.getLayout = function() {
 					return this.layout;
 				}, a.prototype.isOneAncestorOfOther = function(e, t) {
-					if (!(e != null && t != null)) throw "assert failed";
+					if (e == null || t == null) throw "assert failed";
 					if (e == t) return !0;
 					var n = e.getOwner(), r;
 					do {
@@ -515,7 +513,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					var o = a * n[0], s = n[1] / a;
 					n[0] < s ? s = n[0] : o = n[1], n[0] = -1 * i[0] * (s / 2 + r), n[1] = -1 * i[1] * (o / 2 + r);
 				}, i.decideDirectionsForOverlappingNodes = function(e, t, n) {
-					e.getCenterX() < t.getCenterX() ? n[0] = -1 : n[0] = 1, e.getCenterY() < t.getCenterY() ? n[1] = -1 : n[1] = 1;
+					n[0] = e.getCenterX() < t.getCenterX() ? -1 : 1, n[1] = e.getCenterY() < t.getCenterY() ? -1 : 1;
 				}, i.getIntersection2 = function(e, t, n) {
 					var r = e.getCenterX(), i = e.getCenterY(), a = t.getCenterX(), o = t.getCenterY();
 					if (e.intersects(t)) return n[0] = r, n[1] = i, n[2] = a, n[3] = o, !0;
@@ -539,9 +537,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 							case 3:
 								j = d, A = r + m / D, n[0] = A, n[1] = j;
 								break;
-							case 4:
-								A = u, j = i + -p * D, n[0] = A, n[1] = j;
-								break;
+							case 4: A = u, j = i + -p * D, n[0] = A, n[1] = j;
 						}
 						if (!w) switch (k) {
 							case 1:
@@ -553,9 +549,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 							case 3:
 								N = y, M = a + S / D, n[2] = M, n[3] = N;
 								break;
-							case 4:
-								M = v, N = o + -x * D, n[2] = M, n[3] = N;
-								break;
+							case 4: M = v, N = o + -x * D, n[2] = M, n[3] = N;
 						}
 					}
 					return !1;
@@ -578,7 +572,8 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					if (c * c - 4 * s * l >= 0) {
 						var u = (-c + Math.sqrt(c * c - 4 * s * l)) / (2 * s), d = (-c - Math.sqrt(c * c - 4 * s * l)) / (2 * s);
 						return u >= 0 && u <= 1 ? [u] : d >= 0 && d <= 1 ? [d] : null;
-					} else return null;
+					}
+					return null;
 				}, i.HALF_PI = .5 * Math.PI, i.ONE_AND_HALF_PI = 1.5 * Math.PI, i.TWO_PI = 2 * Math.PI, i.THREE_PI = 3 * Math.PI, e.exports = i;
 			}),
 			(function(e, t, n) {
@@ -814,7 +809,8 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					if (Array.isArray(e)) {
 						for (var t = 0, n = Array(e.length); t < e.length; t++) n[t] = e[t];
 						return n;
-					} else return Array.from(e);
+					}
+					return Array.from(e);
 				}
 				var i = n(0), a = n(7), o = n(3), s = n(1), c = n(6), l = n(5), u = n(17), d = n(29);
 				function f(e) {
@@ -841,8 +837,8 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					return this.graphManager.getRoot() == null || this.graphManager.getRoot().getNodes().length == 0 || this.graphManager.includesInvalidEdge();
 				}, f.prototype.runLayout = function() {
 					this.isLayoutFinished = !1, this.tilingPreLayout && this.tilingPreLayout(), this.initParameters();
-					var e = this.checkLayoutSuccess() ? !1 : this.layout();
-					return i.ANIMATE === "during" ? !1 : (e && (this.isSubLayout || this.doPostLayout()), this.tilingPostLayout && this.tilingPostLayout(), this.isLayoutFinished = !0, e);
+					var e = !this.checkLayoutSuccess() && this.layout();
+					return i.ANIMATE !== "during" && (e && (this.isSubLayout || this.doPostLayout()), this.tilingPostLayout && this.tilingPostLayout(), this.isLayoutFinished = !0, e);
 				}, f.prototype.doPostLayout = function() {
 					this.incremental || this.transform(), this.update();
 				}, f.prototype.update2 = function() {
@@ -940,10 +936,9 @@ var D = /* @__PURE__ */ t(((e, t) => {
 							i += (o - t) / 50 * (e - 50);
 						}
 						return i;
-					} else {
-						var s, c;
-						return e <= 50 ? (s = 9 * t / 500, c = t / 10) : (s = 9 * t / 50, c = -8 * t), s * e + c;
 					}
+					var s, c;
+					return e <= 50 ? (s = 9 * t / 500, c = t / 10) : (s = 9 * t / 50, c = -8 * t), s * e + c;
 				}, f.findCenterOfTree = function(e) {
 					var t = [];
 					t = t.concat(e);
@@ -1037,7 +1032,8 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					if (Array.isArray(e)) {
 						for (var t = 0, n = Array(e.length); t < e.length; t++) n[t] = e[t];
 						return n;
-					} else return Array.from(e);
+					}
+					return Array.from(e);
 				}
 				var i = n(15), a = n(4), o = n(0), s = n(8), c = n(9);
 				function l() {
@@ -1050,11 +1046,11 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					for (var e, t, n, r, i, s, c, l = this.getGraphManager().getAllEdges(), u = 0; u < l.length; u++) e = l[u], t = e.idealLength, e.isInterGraph && (r = e.getSource(), i = e.getTarget(), s = e.getSourceInLca().getEstimatedSize(), c = e.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (e.idealLength += s + c - 2 * o.SIMPLE_NODE_SIZE), n = e.getLca().getInclusionTreeDepth(), e.idealLength += t * a.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (r.getInclusionTreeDepth() + i.getInclusionTreeDepth() - 2 * n));
 				}, l.prototype.initSpringEmbedder = function() {
 					var e = this.getAllNodes().length;
-					this.incremental ? (e > a.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * a.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (e - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - a.COOLING_ADAPTATION_FACTOR))), this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT_INCREMENTAL) : (e > a.ADAPTATION_LOWER_NODE_LIMIT ? this.coolingFactor = Math.max(a.COOLING_ADAPTATION_FACTOR, 1 - (e - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * (1 - a.COOLING_ADAPTATION_FACTOR)) : this.coolingFactor = 1, this.initialCoolingFactor = this.coolingFactor, this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT), this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations), this.displacementThresholdPerNode = 3 * a.DEFAULT_EDGE_LENGTH / 100, this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length, this.repulsionRange = this.calcRepulsionRange();
+					this.incremental ? (e > a.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * a.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (e - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - a.COOLING_ADAPTATION_FACTOR))), this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT_INCREMENTAL) : (this.coolingFactor = e > a.ADAPTATION_LOWER_NODE_LIMIT ? Math.max(a.COOLING_ADAPTATION_FACTOR, 1 - (e - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * (1 - a.COOLING_ADAPTATION_FACTOR)) : 1, this.initialCoolingFactor = this.coolingFactor, this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT), this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations), this.displacementThresholdPerNode = 3 * a.DEFAULT_EDGE_LENGTH / 100, this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length, this.repulsionRange = this.calcRepulsionRange();
 				}, l.prototype.calcSpringForces = function() {
 					for (var e = this.getAllEdges(), t, n = 0; n < e.length; n++) t = e[n], this.calcSpringForce(t, t.idealLength);
 				}, l.prototype.calcRepulsionForces = function() {
-					var e = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, n, r, i, o, s = this.getAllNodes(), c;
+					var e = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, t = arguments.length > 1 && arguments[1] !== void 0 && arguments[1], n, r, i, o, s = this.getAllNodes(), c;
 					if (this.useFRGridVariant) for (this.totalIterations % a.GRID_CALCULATION_CHECK_PERIOD == 1 && e && this.updateGrid(), c = /* @__PURE__ */ new Set(), n = 0; n < s.length; n++) i = s[n], this.calculateRepulsionForceOfANode(i, c, e, t), c.add(i);
 					else for (n = 0; n < s.length; n++) for (i = s[n], r = n + 1; r < s.length; r++) o = s[r], i.getOwner() == o.getOwner() && this.calcRepulsionForce(i, o);
 				}, l.prototype.calcGravitationalForces = function() {
@@ -1106,7 +1102,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 						var o = /* @__PURE__ */ new Set();
 						e.surrounding = [];
 						for (var s, c = this.grid, l = e.startX - 1; l < e.finishX + 2; l++) for (var u = e.startY - 1; u < e.finishY + 2; u++) if (!(l < 0 || u < 0 || l >= c.length || u >= c[0].length)) {
-							for (var d = 0; d < c[l][u].length; d++) if (s = c[l][u][d], !(e.getOwner() != s.getOwner() || e == s) && !t.has(s) && !o.has(s)) {
+							for (var d = 0; d < c[l][u].length; d++) if (s = c[l][u][d], e.getOwner() == s.getOwner() && e != s && !t.has(s) && !o.has(s)) {
 								var f = Math.abs(e.getCenterX() - s.getCenterX()) - (e.getWidth() / 2 + s.getWidth() / 2), p = Math.abs(e.getCenterY() - s.getCenterY()) - (e.getHeight() / 2 + s.getHeight() / 2);
 								f <= this.repulsionRange && p <= this.repulsionRange && o.add(s);
 							}
@@ -1475,7 +1471,6 @@ var D = /* @__PURE__ */ t(((e, t) => {
 									U++;
 								}
 								H = 0, E--;
-								break;
 						}
 					}
 					return {
@@ -1695,7 +1690,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					}, x.prototype.newEdge = function(e) {
 						return new s(null, null, e);
 					}, x.prototype.initParameters = function() {
-						r.prototype.initParameters.call(this, arguments), this.isSubLayout || (c.DEFAULT_EDGE_LENGTH < 10 ? this.idealEdgeLength = 10 : this.idealEdgeLength = c.DEFAULT_EDGE_LENGTH, this.useSmartIdealEdgeLengthCalculation = c.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.gravityConstant = u.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = u.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = u.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = u.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.prunedNodesAll = [], this.growTreeIterations = 0, this.afterGrowthIterations = 0, this.isTreeGrowing = !1, this.isGrowthFinished = !1);
+						r.prototype.initParameters.call(this, arguments), this.isSubLayout || (this.idealEdgeLength = c.DEFAULT_EDGE_LENGTH < 10 ? 10 : c.DEFAULT_EDGE_LENGTH, this.useSmartIdealEdgeLengthCalculation = c.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.gravityConstant = u.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = u.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = u.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = u.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.prunedNodesAll = [], this.growTreeIterations = 0, this.afterGrowthIterations = 0, this.isTreeGrowing = !1, this.isGrowthFinished = !1);
 					}, x.prototype.initSpringEmbedder = function() {
 						r.prototype.initSpringEmbedder.call(this), this.coolingCycle = 0, this.maxCoolingCycle = this.maxIterations / u.CONVERGENCE_CHECK_PERIOD, this.finalTemperature = .04, this.coolingAdjuster = 1;
 					}, x.prototype.layout = function() {
@@ -1733,13 +1728,13 @@ var D = /* @__PURE__ */ t(((e, t) => {
 								var e = new Set(this.getAllNodes()), t = this.nodesWithGravity.filter(function(t) {
 									return e.has(t);
 								});
-								this.graphManager.setAllNodesToApplyGravitation(t), this.graphManager.updateBounds(), this.updateGrid(), c.PURE_INCREMENTAL ? this.coolingFactor = u.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 : this.coolingFactor = u.DEFAULT_COOLING_FACTOR_INCREMENTAL;
+								this.graphManager.setAllNodesToApplyGravitation(t), this.graphManager.updateBounds(), this.updateGrid(), this.coolingFactor = c.PURE_INCREMENTAL ? u.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 : u.DEFAULT_COOLING_FACTOR_INCREMENTAL;
 							} else this.isTreeGrowing = !1, this.isGrowthFinished = !0;
 							this.growTreeIterations++;
 						}
 						if (this.isGrowthFinished) {
 							if (this.isConverged()) return !0;
-							this.afterGrowthIterations % 10 == 0 && (this.graphManager.updateBounds(), this.updateGrid()), c.PURE_INCREMENTAL ? this.coolingFactor = u.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 * ((100 - this.afterGrowthIterations) / 100) : this.coolingFactor = u.DEFAULT_COOLING_FACTOR_INCREMENTAL * ((100 - this.afterGrowthIterations) / 100), this.afterGrowthIterations++;
+							this.afterGrowthIterations % 10 == 0 && (this.graphManager.updateBounds(), this.updateGrid()), this.coolingFactor = c.PURE_INCREMENTAL ? u.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 * ((100 - this.afterGrowthIterations) / 100) : u.DEFAULT_COOLING_FACTOR_INCREMENTAL * ((100 - this.afterGrowthIterations) / 100), this.afterGrowthIterations++;
 						}
 						var n = !this.isTreeGrowing && !this.isGrowthFinished, r = this.growTreeIterations % 10 == 1 && this.isTreeGrowing || this.afterGrowthIterations % 10 == 1 && this.isGrowthFinished;
 						return this.totalDisplacement = 0, this.graphManager.updateBounds(), this.calcSpringForces(), this.calcRepulsionForces(n, r), this.calcGravitationalForces(), this.moveNodes(), this.animate(), !1;
@@ -2318,7 +2313,8 @@ var D = /* @__PURE__ */ t(((e, t) => {
 						if (Array.isArray(e)) {
 							for (var t = 0, n = Array(e.length); t < e.length; t++) n[t] = e[t];
 							return n;
-						} else return Array.from(e);
+						}
+						return Array.from(e);
 					}
 					var i = n(806), a = n(551).LinkedList, o = n(551).Matrix, s = n(551).SVD;
 					function c() {}
@@ -2330,7 +2326,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 							m.getChild() ?? (c.set(m.id, f++), l.push(m.getCenterX()), u.push(m.getCenterY()), n.set(m.id, m));
 						}
 						t.relativePlacementConstraint && t.relativePlacementConstraint.forEach(function(e) {
-							!e.gap && e.gap != 0 && (e.left ? e.gap = i.DEFAULT_EDGE_LENGTH + n.get(e.left).getWidth() / 2 + n.get(e.right).getWidth() / 2 : e.gap = i.DEFAULT_EDGE_LENGTH + n.get(e.top).getHeight() / 2 + n.get(e.bottom).getHeight() / 2);
+							!e.gap && e.gap != 0 && (e.gap = e.left ? i.DEFAULT_EDGE_LENGTH + n.get(e.left).getWidth() / 2 + n.get(e.right).getWidth() / 2 : i.DEFAULT_EDGE_LENGTH + n.get(e.top).getHeight() / 2 + n.get(e.bottom).getHeight() / 2);
 						});
 						var h = function(e, t) {
 							return {
@@ -2374,7 +2370,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 							});
 							var f = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map(), m = new a();
 							d.forEach(function(e, r) {
-								e == 0 ? (m.push(r), n || (t == "horizontal" ? f.set(r, c.has(r) ? l[c.get(r)] : i.get(r)) : f.set(r, c.has(r) ? u[c.get(r)] : i.get(r)))) : f.set(r, -Infinity), n && p.set(r, new Set([r]));
+								e == 0 ? (m.push(r), n || (t == "horizontal" ? f.set(r, c.has(r) ? l[c.get(r)] : i.get(r)) : f.set(r, c.has(r) ? u[c.get(r)] : i.get(r)))) : f.set(r, -Infinity), n && p.set(r, /* @__PURE__ */ new Set([r]));
 							}), n && o.forEach(function(e) {
 								var r = [];
 								if (e.forEach(function(e) {
@@ -2389,7 +2385,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 								} else {
 									var o = 0;
 									e.forEach(function(e) {
-										t == "horizontal" ? o += c.has(e) ? l[c.get(e)] : i.get(e) : o += c.has(e) ? u[c.get(e)] : i.get(e);
+										o += t == "horizontal" ? c.has(e) ? l[c.get(e)] : i.get(e) : c.has(e) ? u[c.get(e)] : i.get(e);
 									}), o /= e.length, e.forEach(function(e) {
 										f.set(e, o);
 									});
@@ -2960,11 +2956,11 @@ var D = /* @__PURE__ */ t(((e, t) => {
 									f.id = s.id(), f.idealLength = y(e.idealEdgeLength, s), f.edgeElasticity = y(e.edgeElasticity, s), i += f.idealLength, a++;
 								}
 							}
-							e.idealEdgeLength != null && (a > 0 ? u.DEFAULT_EDGE_LENGTH = l.DEFAULT_EDGE_LENGTH = i / a : v(e.idealEdgeLength) ? u.DEFAULT_EDGE_LENGTH = l.DEFAULT_EDGE_LENGTH = 50 : u.DEFAULT_EDGE_LENGTH = l.DEFAULT_EDGE_LENGTH = e.idealEdgeLength, u.MIN_REPULSION_DIST = l.MIN_REPULSION_DIST = l.DEFAULT_EDGE_LENGTH / 10, u.DEFAULT_RADIAL_SEPARATION = l.DEFAULT_EDGE_LENGTH);
+							e.idealEdgeLength != null && (u.DEFAULT_EDGE_LENGTH = l.DEFAULT_EDGE_LENGTH = a > 0 ? i / a : v(e.idealEdgeLength) ? 50 : e.idealEdgeLength, u.MIN_REPULSION_DIST = l.MIN_REPULSION_DIST = l.DEFAULT_EDGE_LENGTH / 10, u.DEFAULT_RADIAL_SEPARATION = l.DEFAULT_EDGE_LENGTH);
 						}, C = function(e, t) {
 							t.fixedNodeConstraint && (e.constraints.fixedNodeConstraint = t.fixedNodeConstraint), t.alignmentConstraint && (e.constraints.alignmentConstraint = t.alignmentConstraint), t.relativePlacementConstraint && (e.constraints.relativePlacementConstraint = t.relativePlacementConstraint);
 						};
-						e.nestingFactor != null && (u.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = l.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = e.nestingFactor), e.gravity != null && (u.DEFAULT_GRAVITY_STRENGTH = l.DEFAULT_GRAVITY_STRENGTH = e.gravity), e.numIter != null && (u.MAX_ITERATIONS = l.MAX_ITERATIONS = e.numIter), e.gravityRange != null && (u.DEFAULT_GRAVITY_RANGE_FACTOR = l.DEFAULT_GRAVITY_RANGE_FACTOR = e.gravityRange), e.gravityCompound != null && (u.DEFAULT_COMPOUND_GRAVITY_STRENGTH = l.DEFAULT_COMPOUND_GRAVITY_STRENGTH = e.gravityCompound), e.gravityRangeCompound != null && (u.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = l.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = e.gravityRangeCompound), e.initialEnergyOnIncremental != null && (u.DEFAULT_COOLING_FACTOR_INCREMENTAL = l.DEFAULT_COOLING_FACTOR_INCREMENTAL = e.initialEnergyOnIncremental), e.tilingCompareBy != null && (u.TILING_COMPARE_BY = e.tilingCompareBy), e.quality == "proof" ? c.QUALITY = 2 : c.QUALITY = 0, u.NODE_DIMENSIONS_INCLUDE_LABELS = l.NODE_DIMENSIONS_INCLUDE_LABELS = c.NODE_DIMENSIONS_INCLUDE_LABELS = e.nodeDimensionsIncludeLabels, u.DEFAULT_INCREMENTAL = l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = !e.randomize, u.ANIMATE = l.ANIMATE = c.ANIMATE = e.animate, u.TILE = e.tile, u.TILING_PADDING_VERTICAL = typeof e.tilingPaddingVertical == "function" ? e.tilingPaddingVertical.call() : e.tilingPaddingVertical, u.TILING_PADDING_HORIZONTAL = typeof e.tilingPaddingHorizontal == "function" ? e.tilingPaddingHorizontal.call() : e.tilingPaddingHorizontal, u.DEFAULT_INCREMENTAL = l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = !0, u.PURE_INCREMENTAL = !e.randomize, c.DEFAULT_UNIFORM_LEAF_NODE_SIZES = e.uniformNodeDimensions, e.step == "transformed" && (u.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, u.ENFORCE_CONSTRAINTS = !1, u.APPLY_LAYOUT = !1), e.step == "enforced" && (u.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, u.ENFORCE_CONSTRAINTS = !0, u.APPLY_LAYOUT = !1), e.step == "cose" && (u.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, u.ENFORCE_CONSTRAINTS = !1, u.APPLY_LAYOUT = !0), e.step == "all" && (e.randomize ? u.TRANSFORM_ON_CONSTRAINT_HANDLING = !0 : u.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, u.ENFORCE_CONSTRAINTS = !0, u.APPLY_LAYOUT = !0), e.fixedNodeConstraint || e.alignmentConstraint || e.relativePlacementConstraint ? u.TREE_REDUCTION_ON_INCREMENTAL = !1 : u.TREE_REDUCTION_ON_INCREMENTAL = !0;
+						e.nestingFactor != null && (u.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = l.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = e.nestingFactor), e.gravity != null && (u.DEFAULT_GRAVITY_STRENGTH = l.DEFAULT_GRAVITY_STRENGTH = e.gravity), e.numIter != null && (u.MAX_ITERATIONS = l.MAX_ITERATIONS = e.numIter), e.gravityRange != null && (u.DEFAULT_GRAVITY_RANGE_FACTOR = l.DEFAULT_GRAVITY_RANGE_FACTOR = e.gravityRange), e.gravityCompound != null && (u.DEFAULT_COMPOUND_GRAVITY_STRENGTH = l.DEFAULT_COMPOUND_GRAVITY_STRENGTH = e.gravityCompound), e.gravityRangeCompound != null && (u.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = l.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = e.gravityRangeCompound), e.initialEnergyOnIncremental != null && (u.DEFAULT_COOLING_FACTOR_INCREMENTAL = l.DEFAULT_COOLING_FACTOR_INCREMENTAL = e.initialEnergyOnIncremental), e.tilingCompareBy != null && (u.TILING_COMPARE_BY = e.tilingCompareBy), c.QUALITY = e.quality == "proof" ? 2 : 0, u.NODE_DIMENSIONS_INCLUDE_LABELS = l.NODE_DIMENSIONS_INCLUDE_LABELS = c.NODE_DIMENSIONS_INCLUDE_LABELS = e.nodeDimensionsIncludeLabels, u.DEFAULT_INCREMENTAL = l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = !e.randomize, u.ANIMATE = l.ANIMATE = c.ANIMATE = e.animate, u.TILE = e.tile, u.TILING_PADDING_VERTICAL = typeof e.tilingPaddingVertical == "function" ? e.tilingPaddingVertical.call() : e.tilingPaddingVertical, u.TILING_PADDING_HORIZONTAL = typeof e.tilingPaddingHorizontal == "function" ? e.tilingPaddingHorizontal.call() : e.tilingPaddingHorizontal, u.DEFAULT_INCREMENTAL = l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = !0, u.PURE_INCREMENTAL = !e.randomize, c.DEFAULT_UNIFORM_LEAF_NODE_SIZES = e.uniformNodeDimensions, e.step == "transformed" && (u.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, u.ENFORCE_CONSTRAINTS = !1, u.APPLY_LAYOUT = !1), e.step == "enforced" && (u.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, u.ENFORCE_CONSTRAINTS = !0, u.APPLY_LAYOUT = !1), e.step == "cose" && (u.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, u.ENFORCE_CONSTRAINTS = !1, u.APPLY_LAYOUT = !0), e.step == "all" && (u.TRANSFORM_ON_CONSTRAINT_HANDLING = !!e.randomize, u.ENFORCE_CONSTRAINTS = !0, u.APPLY_LAYOUT = !0), u.TREE_REDUCTION_ON_INCREMENTAL = !(e.fixedNodeConstraint || e.alignmentConstraint || e.relativePlacementConstraint);
 						var w = new i(), T = w.newGraphManager();
 						return x(T.addRoot(), r.getTopMostNodes(f), w, e), S(w, T, p), C(w, e), w.runLayout(), _;
 					} };
@@ -3179,22 +3175,21 @@ var D = /* @__PURE__ */ t(((e, t) => {
 											x: r.x,
 											y: r.y
 										};
-									} else {
-										var c = void 0;
-										return i.forEach(function(t) {
-											var n = t.nodeIndexes.get(e.id());
-											n != null && (c = {
-												x: t.xCoords[n],
-												y: t.yCoords[n]
-											});
-										}), c ??= {
-											x: e.position("x"),
-											y: e.position("y")
-										}, {
-											x: c.x,
-											y: c.y
-										};
 									}
+									var c = void 0;
+									return i.forEach(function(t) {
+										var n = t.nodeIndexes.get(e.id());
+										n != null && (c = {
+											x: t.xCoords[n],
+											y: t.yCoords[n]
+										});
+									}), c ??= {
+										x: e.position("x"),
+										y: e.position("y")
+									}, {
+										x: c.x,
+										y: c.y
+									};
 								};
 								if (t.quality == "default" || t.quality == "proof" || t.randomize) {
 									var j = o.calcParentsWithoutChildren(n, r), M = r.filter(function(e) {
@@ -3340,18 +3335,17 @@ var D = /* @__PURE__ */ t(((e, t) => {
 								xCoords: f,
 								yCoords: p
 							}), U;
-						} else {
-							var ie = l.keys(), K = t.getElementById(ie.next().value), q = K.position(), J = K.outerWidth();
-							if (f.push(q.x), p.push(q.y), y == 2) {
-								var Y = t.getElementById(ie.next().value).outerWidth();
-								f.push(q.x + J / 2 + Y / 2 + e.idealEdgeLength), p.push(q.y);
-							}
-							return U = {
-								nodeIndexes: l,
-								xCoords: f,
-								yCoords: p
-							}, U;
 						}
+						var ie = l.keys(), K = t.getElementById(ie.next().value), q = K.position(), J = K.outerWidth();
+						if (f.push(q.x), p.push(q.y), y == 2) {
+							var Y = t.getElementById(ie.next().value).outerWidth();
+							f.push(q.x + J / 2 + Y / 2 + e.idealEdgeLength), p.push(q.y);
+						}
+						return U = {
+							nodeIndexes: l,
+							xCoords: f,
+							yCoords: p
+						}, U;
 					} };
 				}),
 				579: ((e, t, n) => {
@@ -3421,15 +3415,15 @@ var D = /* @__PURE__ */ t(((e, t) => {
 	return e.type === "service";
 }, "isArchitectureService"), ne = /* @__PURE__ */ r(function(e) {
 	return e.type === "junction";
-}, "isArchitectureJunction"), re = /* @__PURE__ */ r((e) => e.data(), "edgeData"), U = /* @__PURE__ */ r((e) => e.data(), "nodeData"), W = g.architecture, G = class {
+}, "isArchitectureJunction"), re = /* @__PURE__ */ r((e) => e.data(), "edgeData"), U = /* @__PURE__ */ r((e) => e.data(), "nodeData"), W = _.architecture, G = class {
 	constructor() {
-		this.nodes = {}, this.groups = {}, this.edges = [], this.registeredIds = {}, this.elements = {}, this.setAccTitle = d, this.getAccTitle = _, this.setDiagramTitle = f, this.getDiagramTitle = c, this.getAccDescription = p, this.setAccDescription = s, this.clear();
+		this.nodes = {}, this.groups = {}, this.edges = [], this.registeredIds = {}, this.elements = {}, this.setAccTitle = f, this.getAccTitle = v, this.setDiagramTitle = p, this.getDiagramTitle = l, this.getAccDescription = m, this.setAccDescription = c, this.clear();
 	}
 	static {
 		r(this, "ArchitectureDB");
 	}
 	clear() {
-		this.nodes = {}, this.groups = {}, this.edges = [], this.registeredIds = {}, this.dataStructures = void 0, this.elements = {}, m();
+		this.nodes = {}, this.groups = {}, this.edges = [], this.registeredIds = {}, this.dataStructures = void 0, this.elements = {}, h();
 	}
 	addService({ id: e, icon: t, in: n, title: r, iconText: i }) {
 		if (this.registeredIds[e] !== void 0) throw Error(`The service id [${e}] is already in use by another ${this.registeredIds[e]}`);
@@ -3566,7 +3560,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 	getConfig() {
 		return a({
 			...W,
-			...v().architecture
+			...y().architecture
 		});
 	}
 	getConfigField(e) {
@@ -3583,7 +3577,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 }, "populateDb"), K = {
 	parser: { yy: void 0 },
 	parse: /* @__PURE__ */ r(async (e) => {
-		let t = await T("architecture", e);
+		let t = await s("architecture", e);
 		n.debug(t);
 		let r = K.parser?.yy;
 		if (!(r instanceof G)) throw Error("parser.parser?.yy was not a ArchitectureDB. This is due to a bug within Mermaid, please report this issue at https://github.com/mermaid-js/mermaid/issues.");
@@ -3636,8 +3630,8 @@ var D = /* @__PURE__ */ t(((e, t) => {
 }, ae = /* @__PURE__ */ r(async function(e, t, n) {
 	let r = n.getConfigField("padding"), i = n.getConfigField("iconSize"), a = i / 2, s = i / 6, c = s / 2;
 	await Promise.all(t.edges().map(async (t) => {
-		let { source: i, sourceDir: l, sourceArrow: u, sourceGroup: d, target: f, targetDir: p, targetArrow: m, targetGroup: g, label: _ } = re(t), { x: v, y } = t[0].sourceEndpoint(), { x: b, y: x } = t[0].midpoint(), { x: C, y: w } = t[0].targetEndpoint(), T = r + 4;
-		if (d && (F(l) ? v += l === "L" ? -T : T : y += l === "T" ? -T : T + 18), g && (F(p) ? C += p === "L" ? -T : T : w += p === "T" ? -T : T + 18), !d && n.getNode(i)?.type === "junction" && (F(l) ? v += l === "L" ? a : -a : y += l === "T" ? a : -a), !g && n.getNode(f)?.type === "junction" && (F(p) ? C += p === "L" ? a : -a : w += p === "T" ? a : -a), t[0]._private.rscratch) {
+		let { source: i, sourceDir: l, sourceArrow: u, sourceGroup: d, target: f, targetDir: p, targetArrow: m, targetGroup: h, label: _ } = re(t), { x: v, y } = t[0].sourceEndpoint(), { x: b, y: x } = t[0].midpoint(), { x: C, y: w } = t[0].targetEndpoint(), T = r + 4;
+		if (d && (F(l) ? v += l === "L" ? -T : T : y += l === "T" ? -T : T + 18), h && (F(p) ? C += p === "L" ? -T : T : w += p === "T" ? -T : T + 18), !d && n.getNode(i)?.type === "junction" && (F(l) ? v += l === "L" ? a : -a : y += l === "T" ? a : -a), !h && n.getNode(f)?.type === "junction" && (F(p) ? C += p === "L" ? a : -a : w += p === "T" ? a : -a), t[0]._private.rscratch) {
 			let t = e.insert("g");
 			if (t.insert("path").attr("d", `M ${v},${y} L ${b},${x} L${C},${w} `).attr("class", "edge").attr("id", o(i, f, { prefix: "L" })), u) {
 				let e = F(l) ? M[l](v, s) : v - c, n = I(l) ? M[l](y, s) : y - c;
@@ -3655,7 +3649,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					useHtmlLabels: !1,
 					width: n,
 					classes: "architecture-service-label"
-				}, h()), r.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), e === "X") r.attr("transform", "translate(" + b + ", " + x + ")");
+				}, g()), r.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), e === "X") r.attr("transform", "translate(" + b + ", " + x + ")");
 				else if (e === "Y") r.attr("transform", "translate(" + b + ", " + x + ") rotate(-90)");
 				else if (e === "XY") {
 					let e = B(l, p);
@@ -3695,13 +3689,13 @@ var D = /* @__PURE__ */ t(((e, t) => {
 					useHtmlLabels: !1,
 					width: c,
 					classes: "architecture-service-label"
-				}, h()), e.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "start").attr("text-anchor", "start"), e.attr("transform", "translate(" + (p + a + 4) + ", " + (m + a + 2) + ")");
+				}, g()), e.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "start").attr("text-anchor", "start"), e.attr("transform", "translate(" + (p + a + 4) + ", " + (m + a + 2) + ")");
 			}
 			n.setElementForId(o.id, d);
 		}
 	}));
 }, "drawGroups"), oe = /* @__PURE__ */ r(async function(e, t, n) {
-	let r = h();
+	let r = g();
 	for (let i of n) {
 		let n = t.append("g"), a = e.getConfigField("iconSize");
 		if (i.title) {
@@ -3724,7 +3718,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 				width: a,
 				fallbackPrefix: Y.prefix
 			})}</g>`);
-			let e = o.append("g").append("foreignObject").attr("width", a).attr("height", a).append("div").attr("class", "node-icon-text").attr("style", `height: ${a}px;`).append("div").html(u(i.iconText, r)), t = parseInt(window.getComputedStyle(e.node(), null).getPropertyValue("font-size").replace(/\D/g, "")) ?? 16;
+			let e = o.append("g").append("foreignObject").attr("width", a).attr("height", a).append("div").attr("class", "node-icon-text").attr("style", `height: ${a}px;`).append("div").html(d(i.iconText, r)), t = parseInt(window.getComputedStyle(e.node(), null).getPropertyValue("font-size").replace(/\D/g, "")) ?? 16;
 			e.attr("style", `-webkit-line-clamp: ${Math.floor((a - 2) / t)};`);
 		} else o.append("path").attr("class", "node-bkg").attr("id", "node-" + i.id).attr("d", `M0,${a} V5 Q0,0 5,0 H${a - 5} Q${a},0 ${a},5 V${a} Z`);
 		n.attr("id", `service-${i.id}`).attr("class", "architecture-service");
@@ -3743,7 +3737,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 x([{
 	name: Y.prefix,
 	icons: Y
-}]), E.use(k.default);
+}]), T.use(k.default);
 function se(e, t, n) {
 	e.forEach((e) => {
 		t.add({
@@ -3897,7 +3891,7 @@ function pe(e, t) {
 r(pe, "getRelativeConstraints");
 function me(e, t, a, o, s, { spatialMaps: c, groupAlignments: l }) {
 	return new Promise((u) => {
-		let d = i("body").append("div").attr("id", "cy").attr("style", "display:none"), f = E({
+		let d = i("body").append("div").attr("id", "cy").attr("style", "display:none"), f = T({
 			container: document.getElementById("cy"),
 			style: [
 				{
@@ -3991,18 +3985,14 @@ function me(e, t, a, o, s, { spatialMaps: c, groupAlignments: l }) {
 					case d >= 0:
 						d = 1;
 						break;
-					case d < 0:
-						d = -1;
-						break;
+					case d < 0: d = -1;
 				}
 				let f = (c - o) * (n - o) + (l - s) * (r - s);
 				switch (!0) {
 					case f >= 0:
 						f = 1;
 						break;
-					case f < 0:
-						f = -1;
-						break;
+					case f < 0: f = -1;
 				}
 				return a = Math.abs(a) * d, i *= f, {
 					distances: a,
@@ -4030,14 +4020,14 @@ var he = {
 		return new G();
 	},
 	renderer: { draw: /* @__PURE__ */ r(async (e, t, n, r) => {
-		let i = r.db, a = i.getServices(), o = i.getJunctions(), s = i.getGroups(), c = i.getEdges(), u = i.getDataStructures(), d = y(t), f = d.append("g");
+		let i = r.db, a = i.getServices(), o = i.getJunctions(), s = i.getGroups(), c = i.getEdges(), l = i.getDataStructures(), d = E(t), f = d.append("g");
 		f.attr("class", "architecture-edges");
 		let p = d.append("g");
 		p.attr("class", "architecture-services");
 		let m = d.append("g");
 		m.attr("class", "architecture-groups"), await oe(i, p, a), Z(i, p, o);
-		let h = await me(a, o, s, c, i, u);
-		await ae(f, h, i), await X(m, h, i), le(i, h), l(void 0, d, i.getConfigField("padding"), i.getConfigField("useMaxWidth"));
+		let h = await me(a, o, s, c, i, l);
+		await ae(f, h, i), await X(m, h, i), le(i, h), u(void 0, d, i.getConfigField("padding"), i.getConfigField("useMaxWidth"));
 	}, "draw") },
 	styles: q
 };