@sme.up/ketchup2 2.8.0 → 2.8.2

package/dist/{architectureDiagram-5GKGNRK7-BJvIxhbL.js → architectureDiagram-5GKGNRK7-N1aPr2hw.js}

@@ -1,13 +1,13 @@
-import { _ as e, m as t, p as n, y as r } from "./src-D-6ZfKf9.js";
-import { H as i, J as a, K as o, U as s, a as c, b as l, f as u, v as d, w as f, x as p, y as m, z as h } from "./chunk-DU6HZSFF-CNSdkWoH.js";
+import { _ as e, m as t, p as n, y as r } from "./src-DQoflmwT.js";
+import { H as i, J as a, K as o, U as s, a as c, b as l, f as u, v as d, w as f, x as p, y as m, z as h } from "./chunk-DU6HZSFF-waeanndy.js";
 import { n as g } from "./chunk-Y2CYZVJY-i11wjrBe.js";
-import { c as _, i as v } from "./chunk-75Z2AOVW-BwUD389x.js";
-import { t as y } from "./chunk-CLGD4ZFX-DKRy6g5T.js";
-import { i as b, r as x, t as S } from "./chunk-PWAF6VOD-CbmhQpgH.js";
-import { n as C } from "./chunk-GMAD6QVW-DKxKOKLF.js";
-import { n as w } from "./mermaid-parser.core-oFB-qEU8.js";
+import { c as _, i as v } from "./chunk-75Z2AOVW-Drsj7a97.js";
+import { t as y } from "./chunk-CLGD4ZFX-CLGio9rD.js";
+import { i as b, r as x, t as S } from "./chunk-PWAF6VOD-D37VoZ8H.js";
+import { n as C } from "./chunk-GMAD6QVW-D80II4AD.js";
+import { n as w } from "./mermaid-parser.core-BwVmI_Rq.js";
 import { t as T } from "./chunk-JWPE2WC7-Ccb0QaC8.js";
-import { t as E } from "./cytoscape.esm-BQqfb1oS.js";
+import { t as E } from "./cytoscape.esm-C5TvPYYm.js";
 //#region node_modules/cytoscape-fcose/node_modules/layout-base/layout-base.js
 var D = /* @__PURE__ */ e(((e, t) => {
 	(function(n, r) {
@@ -103,7 +103,7 @@ var D = /* @__PURE__ */ e(((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() {
@@ -153,7 +153,7 @@ var D = /* @__PURE__ */ e(((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() {
@@ -273,17 +273,16 @@ var D = /* @__PURE__ */ e(((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);
@@ -292,8 +291,8 @@ var D = /* @__PURE__ */ e(((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);
@@ -330,7 +329,7 @@ var D = /* @__PURE__ */ e(((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) {
@@ -370,17 +369,16 @@ var D = /* @__PURE__ */ e(((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;
@@ -400,10 +398,10 @@ var D = /* @__PURE__ */ e(((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);
@@ -445,7 +443,7 @@ var D = /* @__PURE__ */ e(((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 {
@@ -516,7 +514,7 @@ var D = /* @__PURE__ */ e(((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;
@@ -540,9 +538,7 @@ var D = /* @__PURE__ */ e(((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:
@@ -554,9 +550,7 @@ var D = /* @__PURE__ */ e(((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;
@@ -579,7 +573,8 @@ var D = /* @__PURE__ */ e(((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) {
@@ -815,7 +810,8 @@ var D = /* @__PURE__ */ e(((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) {
@@ -842,8 +838,8 @@ var D = /* @__PURE__ */ e(((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() {
@@ -889,10 +885,12 @@ var D = /* @__PURE__ */ e(((e, t) => {
 							s.splice(0, 1), o.add(u);
 							for (var d = u.getEdges(), a = 0; a < d.length; a++) {
 								var f = d[a].getOtherEnd(u);
-								if (c.get(u) != f) if (!o.has(f)) s.push(f), c.set(f, u);
-								else {
-									t = !1;
-									break;
+								if (c.get(u) != f) {
+									if (!o.has(f)) s.push(f), c.set(f, u);
+									else {
+										t = !1;
+										break;
+									}
 								}
 							}
 						}
@@ -941,10 +939,9 @@ var D = /* @__PURE__ */ e(((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);
@@ -1038,7 +1035,8 @@ var D = /* @__PURE__ */ e(((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() {
@@ -1051,11 +1049,11 @@ var D = /* @__PURE__ */ e(((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() {
@@ -1107,7 +1105,7 @@ var D = /* @__PURE__ */ e(((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);
 							}
@@ -1476,7 +1474,6 @@ var D = /* @__PURE__ */ e(((e, t) => {
 									U++;
 								}
 								H = 0, E--;
-								break;
 						}
 					}
 					return {
@@ -1696,7 +1693,7 @@ var D = /* @__PURE__ */ e(((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() {
@@ -1721,26 +1718,32 @@ var D = /* @__PURE__ */ e(((e, t) => {
 						}
 						return Object.keys(this.constraints).length > 0 && (l.handleConstraints(this), this.initConstraintVariables()), this.initSpringEmbedder(), c.APPLY_LAYOUT && this.runSpringEmbedder(), !0;
 					}, x.prototype.tick = function() {
-						if (this.totalIterations++, this.totalIterations === this.maxIterations && !this.isTreeGrowing && !this.isGrowthFinished) if (this.prunedNodesAll.length > 0) this.isTreeGrowing = !0;
-						else return !0;
-						if (this.totalIterations % u.CONVERGENCE_CHECK_PERIOD == 0 && !this.isTreeGrowing && !this.isGrowthFinished) {
-							if (this.isConverged()) if (this.prunedNodesAll.length > 0) this.isTreeGrowing = !0;
+						if (this.totalIterations++, this.totalIterations === this.maxIterations && !this.isTreeGrowing && !this.isGrowthFinished) {
+							if (this.prunedNodesAll.length > 0) this.isTreeGrowing = !0;
 							else return !0;
+						}
+						if (this.totalIterations % u.CONVERGENCE_CHECK_PERIOD == 0 && !this.isTreeGrowing && !this.isGrowthFinished) {
+							if (this.isConverged()) {
+								if (this.prunedNodesAll.length > 0) this.isTreeGrowing = !0;
+								else return !0;
+							}
 							this.coolingCycle++, this.layoutQuality == 0 ? this.coolingAdjuster = this.coolingCycle : this.layoutQuality == 1 && (this.coolingAdjuster = this.coolingCycle / 3), this.coolingFactor = Math.max(this.initialCoolingFactor - this.coolingCycle ** +(Math.log(100 * (this.initialCoolingFactor - this.finalTemperature)) / Math.log(this.maxCoolingCycle)) / 100 * this.coolingAdjuster, this.finalTemperature), this.animationPeriod = Math.ceil(this.initialAnimationPeriod * Math.sqrt(this.coolingFactor));
 						}
 						if (this.isTreeGrowing) {
-							if (this.growTreeIterations % 10 == 0) if (this.prunedNodesAll.length > 0) {
-								this.graphManager.updateBounds(), this.updateGrid(), this.growTree(this.prunedNodesAll), this.graphManager.resetAllNodesToApplyGravitation();
-								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;
-							} else this.isTreeGrowing = !1, this.isGrowthFinished = !0;
+							if (this.growTreeIterations % 10 == 0) {
+								if (this.prunedNodesAll.length > 0) {
+									this.graphManager.updateBounds(), this.updateGrid(), this.growTree(this.prunedNodesAll), this.graphManager.resetAllNodesToApplyGravitation();
+									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(), 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;
@@ -1884,66 +1887,68 @@ var D = /* @__PURE__ */ e(((e, t) => {
 								for (var l = s / o[n].length, i = 0; i < o[n].length; i++) this.idToNodeMap.get(o[n][i]).displacementY = l;
 							}
 						}
-						if (this.constraints.relativePlacementConstraint) if (c.RELAX_MOVEMENT_ON_CONSTRAINTS) this.totalIterations % 10 == 0 && (this.shuffle(this.nodesInRelativeHorizontal), this.shuffle(this.nodesInRelativeVertical)), this.nodesInRelativeHorizontal.forEach(function(t) {
-							if (!e.fixedNodesOnHorizontal.has(t)) {
-								var n = 0;
-								n = e.dummyToNodeForVerticalAlignment.has(t) ? e.idToNodeMap.get(e.dummyToNodeForVerticalAlignment.get(t)[0]).displacementX : e.idToNodeMap.get(t).displacementX, e.nodeToRelativeConstraintMapHorizontal.get(t).forEach(function(r) {
-									if (r.right) {
-										var i = e.nodeToTempPositionMapHorizontal.get(r.right) - e.nodeToTempPositionMapHorizontal.get(t) - n;
-										i < r.gap && (n -= r.gap - i);
-									} else {
-										var i = e.nodeToTempPositionMapHorizontal.get(t) - e.nodeToTempPositionMapHorizontal.get(r.left) + n;
-										i < r.gap && (n += r.gap - i);
-									}
-								}), e.nodeToTempPositionMapHorizontal.set(t, e.nodeToTempPositionMapHorizontal.get(t) + n), e.dummyToNodeForVerticalAlignment.has(t) ? e.dummyToNodeForVerticalAlignment.get(t).forEach(function(t) {
-									e.idToNodeMap.get(t).displacementX = n;
-								}) : e.idToNodeMap.get(t).displacementX = n;
-							}
-						}), this.nodesInRelativeVertical.forEach(function(t) {
-							if (!e.fixedNodesOnHorizontal.has(t)) {
-								var n = 0;
-								n = e.dummyToNodeForHorizontalAlignment.has(t) ? e.idToNodeMap.get(e.dummyToNodeForHorizontalAlignment.get(t)[0]).displacementY : e.idToNodeMap.get(t).displacementY, e.nodeToRelativeConstraintMapVertical.get(t).forEach(function(r) {
-									if (r.bottom) {
-										var i = e.nodeToTempPositionMapVertical.get(r.bottom) - e.nodeToTempPositionMapVertical.get(t) - n;
-										i < r.gap && (n -= r.gap - i);
-									} else {
-										var i = e.nodeToTempPositionMapVertical.get(t) - e.nodeToTempPositionMapVertical.get(r.top) + n;
-										i < r.gap && (n += r.gap - i);
+						if (this.constraints.relativePlacementConstraint) {
+							if (c.RELAX_MOVEMENT_ON_CONSTRAINTS) this.totalIterations % 10 == 0 && (this.shuffle(this.nodesInRelativeHorizontal), this.shuffle(this.nodesInRelativeVertical)), this.nodesInRelativeHorizontal.forEach(function(t) {
+								if (!e.fixedNodesOnHorizontal.has(t)) {
+									var n = 0;
+									n = e.dummyToNodeForVerticalAlignment.has(t) ? e.idToNodeMap.get(e.dummyToNodeForVerticalAlignment.get(t)[0]).displacementX : e.idToNodeMap.get(t).displacementX, e.nodeToRelativeConstraintMapHorizontal.get(t).forEach(function(r) {
+										if (r.right) {
+											var i = e.nodeToTempPositionMapHorizontal.get(r.right) - e.nodeToTempPositionMapHorizontal.get(t) - n;
+											i < r.gap && (n -= r.gap - i);
+										} else {
+											var i = e.nodeToTempPositionMapHorizontal.get(t) - e.nodeToTempPositionMapHorizontal.get(r.left) + n;
+											i < r.gap && (n += r.gap - i);
+										}
+									}), e.nodeToTempPositionMapHorizontal.set(t, e.nodeToTempPositionMapHorizontal.get(t) + n), e.dummyToNodeForVerticalAlignment.has(t) ? e.dummyToNodeForVerticalAlignment.get(t).forEach(function(t) {
+										e.idToNodeMap.get(t).displacementX = n;
+									}) : e.idToNodeMap.get(t).displacementX = n;
+								}
+							}), this.nodesInRelativeVertical.forEach(function(t) {
+								if (!e.fixedNodesOnHorizontal.has(t)) {
+									var n = 0;
+									n = e.dummyToNodeForHorizontalAlignment.has(t) ? e.idToNodeMap.get(e.dummyToNodeForHorizontalAlignment.get(t)[0]).displacementY : e.idToNodeMap.get(t).displacementY, e.nodeToRelativeConstraintMapVertical.get(t).forEach(function(r) {
+										if (r.bottom) {
+											var i = e.nodeToTempPositionMapVertical.get(r.bottom) - e.nodeToTempPositionMapVertical.get(t) - n;
+											i < r.gap && (n -= r.gap - i);
+										} else {
+											var i = e.nodeToTempPositionMapVertical.get(t) - e.nodeToTempPositionMapVertical.get(r.top) + n;
+											i < r.gap && (n += r.gap - i);
+										}
+									}), e.nodeToTempPositionMapVertical.set(t, e.nodeToTempPositionMapVertical.get(t) + n), e.dummyToNodeForHorizontalAlignment.has(t) ? e.dummyToNodeForHorizontalAlignment.get(t).forEach(function(t) {
+										e.idToNodeMap.get(t).displacementY = n;
+									}) : e.idToNodeMap.get(t).displacementY = n;
+								}
+							});
+							else {
+								for (var n = 0; n < this.componentsOnHorizontal.length; n++) {
+									var u = this.componentsOnHorizontal[n];
+									if (this.fixedComponentsOnHorizontal[n]) for (var i = 0; i < u.length; i++) this.dummyToNodeForVerticalAlignment.has(u[i]) ? this.dummyToNodeForVerticalAlignment.get(u[i]).forEach(function(t) {
+										e.idToNodeMap.get(t).displacementX = 0;
+									}) : this.idToNodeMap.get(u[i]).displacementX = 0;
+									else {
+										for (var d = 0, f = 0, i = 0; i < u.length; i++) if (this.dummyToNodeForVerticalAlignment.has(u[i])) {
+											var p = this.dummyToNodeForVerticalAlignment.get(u[i]);
+											d += p.length * this.idToNodeMap.get(p[0]).displacementX, f += p.length;
+										} else d += this.idToNodeMap.get(u[i]).displacementX, f++;
+										for (var m = d / f, i = 0; i < u.length; i++) this.dummyToNodeForVerticalAlignment.has(u[i]) ? this.dummyToNodeForVerticalAlignment.get(u[i]).forEach(function(t) {
+											e.idToNodeMap.get(t).displacementX = m;
+										}) : this.idToNodeMap.get(u[i]).displacementX = m;
 									}
-								}), e.nodeToTempPositionMapVertical.set(t, e.nodeToTempPositionMapVertical.get(t) + n), e.dummyToNodeForHorizontalAlignment.has(t) ? e.dummyToNodeForHorizontalAlignment.get(t).forEach(function(t) {
-									e.idToNodeMap.get(t).displacementY = n;
-								}) : e.idToNodeMap.get(t).displacementY = n;
-							}
-						});
-						else {
-							for (var n = 0; n < this.componentsOnHorizontal.length; n++) {
-								var u = this.componentsOnHorizontal[n];
-								if (this.fixedComponentsOnHorizontal[n]) for (var i = 0; i < u.length; i++) this.dummyToNodeForVerticalAlignment.has(u[i]) ? this.dummyToNodeForVerticalAlignment.get(u[i]).forEach(function(t) {
-									e.idToNodeMap.get(t).displacementX = 0;
-								}) : this.idToNodeMap.get(u[i]).displacementX = 0;
-								else {
-									for (var d = 0, f = 0, i = 0; i < u.length; i++) if (this.dummyToNodeForVerticalAlignment.has(u[i])) {
-										var p = this.dummyToNodeForVerticalAlignment.get(u[i]);
-										d += p.length * this.idToNodeMap.get(p[0]).displacementX, f += p.length;
-									} else d += this.idToNodeMap.get(u[i]).displacementX, f++;
-									for (var m = d / f, i = 0; i < u.length; i++) this.dummyToNodeForVerticalAlignment.has(u[i]) ? this.dummyToNodeForVerticalAlignment.get(u[i]).forEach(function(t) {
-										e.idToNodeMap.get(t).displacementX = m;
-									}) : this.idToNodeMap.get(u[i]).displacementX = m;
 								}
-							}
-							for (var n = 0; n < this.componentsOnVertical.length; n++) {
-								var u = this.componentsOnVertical[n];
-								if (this.fixedComponentsOnVertical[n]) for (var i = 0; i < u.length; i++) this.dummyToNodeForHorizontalAlignment.has(u[i]) ? this.dummyToNodeForHorizontalAlignment.get(u[i]).forEach(function(t) {
-									e.idToNodeMap.get(t).displacementY = 0;
-								}) : this.idToNodeMap.get(u[i]).displacementY = 0;
-								else {
-									for (var d = 0, f = 0, i = 0; i < u.length; i++) if (this.dummyToNodeForHorizontalAlignment.has(u[i])) {
-										var p = this.dummyToNodeForHorizontalAlignment.get(u[i]);
-										d += p.length * this.idToNodeMap.get(p[0]).displacementY, f += p.length;
-									} else d += this.idToNodeMap.get(u[i]).displacementY, f++;
-									for (var m = d / f, i = 0; i < u.length; i++) this.dummyToNodeForHorizontalAlignment.has(u[i]) ? this.dummyToNodeForHorizontalAlignment.get(u[i]).forEach(function(t) {
-										e.idToNodeMap.get(t).displacementY = m;
-									}) : this.idToNodeMap.get(u[i]).displacementY = m;
+								for (var n = 0; n < this.componentsOnVertical.length; n++) {
+									var u = this.componentsOnVertical[n];
+									if (this.fixedComponentsOnVertical[n]) for (var i = 0; i < u.length; i++) this.dummyToNodeForHorizontalAlignment.has(u[i]) ? this.dummyToNodeForHorizontalAlignment.get(u[i]).forEach(function(t) {
+										e.idToNodeMap.get(t).displacementY = 0;
+									}) : this.idToNodeMap.get(u[i]).displacementY = 0;
+									else {
+										for (var d = 0, f = 0, i = 0; i < u.length; i++) if (this.dummyToNodeForHorizontalAlignment.has(u[i])) {
+											var p = this.dummyToNodeForHorizontalAlignment.get(u[i]);
+											d += p.length * this.idToNodeMap.get(p[0]).displacementY, f += p.length;
+										} else d += this.idToNodeMap.get(u[i]).displacementY, f++;
+										for (var m = d / f, i = 0; i < u.length; i++) this.dummyToNodeForHorizontalAlignment.has(u[i]) ? this.dummyToNodeForHorizontalAlignment.get(u[i]).forEach(function(t) {
+											e.idToNodeMap.get(t).displacementY = m;
+										}) : this.idToNodeMap.get(u[i]).displacementY = m;
+									}
 								}
 							}
 						}
@@ -2319,7 +2324,8 @@ var D = /* @__PURE__ */ e(((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() {}
@@ -2331,7 +2337,7 @@ var D = /* @__PURE__ */ e(((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 {
@@ -2375,7 +2381,7 @@ var D = /* @__PURE__ */ e(((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) {
@@ -2390,7 +2396,7 @@ var D = /* @__PURE__ */ e(((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);
 									});
@@ -2399,15 +2405,17 @@ var D = /* @__PURE__ */ e(((e, t) => {
 							for (var h = function() {
 								var r = m.shift();
 								e.get(r).forEach(function(e) {
-									if (f.get(e.id) < f.get(r) + e.gap) if (n && n.has(e.id)) {
-										var a = void 0;
-										if (a = t == "horizontal" ? c.has(e.id) ? l[c.get(e.id)] : i.get(e.id) : c.has(e.id) ? u[c.get(e.id)] : i.get(e.id), f.set(e.id, a), a < f.get(r) + e.gap) {
-											var o = f.get(r) + e.gap - a;
-											p.get(r).forEach(function(e) {
-												f.set(e, f.get(e) - o);
-											});
-										}
-									} else f.set(e.id, f.get(r) + e.gap);
+									if (f.get(e.id) < f.get(r) + e.gap) {
+										if (n && n.has(e.id)) {
+											var a = void 0;
+											if (a = t == "horizontal" ? c.has(e.id) ? l[c.get(e.id)] : i.get(e.id) : c.has(e.id) ? u[c.get(e.id)] : i.get(e.id), f.set(e.id, a), a < f.get(r) + e.gap) {
+												var o = f.get(r) + e.gap - a;
+												p.get(r).forEach(function(e) {
+													f.set(e, f.get(e) - o);
+												});
+											}
+										} else f.set(e.id, f.get(r) + e.gap);
+									}
 									d.set(e.id, d.get(e.id) - 1), d.get(e.id) == 0 && m.push(e.id), n && p.set(e.id, s(p.get(r), p.get(e.id)));
 								});
 							}; m.length != 0;) h();
@@ -2933,13 +2941,15 @@ var D = /* @__PURE__ */ e(((e, t) => {
 								var d = n[u], f = null;
 								d.intersection(b).length == 0 && (f = d.children());
 								var p = void 0, v = d.layoutDimensions({ nodeDimensionsIncludeLabels: c.nodeDimensionsIncludeLabels });
-								if (d.outerWidth() != null && d.outerHeight() != null) if (c.randomize) if (!d.isParent()) p = t.add(new a(i.graphManager, new o(h[m.get(d.id())] - v.w / 2, g[m.get(d.id())] - v.h / 2), new s(parseFloat(v.w), parseFloat(v.h))));
-								else {
-									var x = r.calcBoundingBox(d, h, g, m);
-									p = d.intersection(b).length == 0 ? t.add(new a(i.graphManager, new o(x.topLeftX, x.topLeftY), new s(x.width, x.height))) : t.add(new a(i.graphManager, new o(x.topLeftX, x.topLeftY), new s(parseFloat(v.w), parseFloat(v.h))));
-								}
-								else p = t.add(new a(i.graphManager, new o(d.position("x") - v.w / 2, d.position("y") - v.h / 2), new s(parseFloat(v.w), parseFloat(v.h))));
-								else p = t.add(new a(this.graphManager));
+								if (d.outerWidth() != null && d.outerHeight() != null) {
+									if (c.randomize) {
+										if (!d.isParent()) p = t.add(new a(i.graphManager, new o(h[m.get(d.id())] - v.w / 2, g[m.get(d.id())] - v.h / 2), new s(parseFloat(v.w), parseFloat(v.h))));
+										else {
+											var x = r.calcBoundingBox(d, h, g, m);
+											p = d.intersection(b).length == 0 ? t.add(new a(i.graphManager, new o(x.topLeftX, x.topLeftY), new s(x.width, x.height))) : t.add(new a(i.graphManager, new o(x.topLeftX, x.topLeftY), new s(parseFloat(v.w), parseFloat(v.h))));
+										}
+									} else p = t.add(new a(i.graphManager, new o(d.position("x") - v.w / 2, d.position("y") - v.h / 2), new s(parseFloat(v.w), parseFloat(v.h))));
+								} else p = t.add(new a(this.graphManager));
 								if (p.id = d.data("id"), p.nodeRepulsion = y(c.nodeRepulsion, d), p.paddingLeft = parseInt(d.css("padding")), p.paddingTop = parseInt(d.css("padding")), p.paddingRight = parseInt(d.css("padding")), p.paddingBottom = parseInt(d.css("padding")), c.nodeDimensionsIncludeLabels && (p.labelWidth = d.boundingBox({
 									includeLabels: !0,
 									includeNodes: !1,
@@ -2961,11 +2971,11 @@ var D = /* @__PURE__ */ e(((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(), _;
 					} };
@@ -3037,132 +3047,137 @@ var D = /* @__PURE__ */ e(((e, t) => {
 								var e = this, t = this.options, n = t.cy, r = t.eles, i = [], a = [], l = void 0, u = [];
 								t.fixedNodeConstraint && (!Array.isArray(t.fixedNodeConstraint) || t.fixedNodeConstraint.length == 0) && (t.fixedNodeConstraint = void 0), t.alignmentConstraint && (t.alignmentConstraint.vertical && (!Array.isArray(t.alignmentConstraint.vertical) || t.alignmentConstraint.vertical.length == 0) && (t.alignmentConstraint.vertical = void 0), t.alignmentConstraint.horizontal && (!Array.isArray(t.alignmentConstraint.horizontal) || t.alignmentConstraint.horizontal.length == 0) && (t.alignmentConstraint.horizontal = void 0)), t.relativePlacementConstraint && (!Array.isArray(t.relativePlacementConstraint) || t.relativePlacementConstraint.length == 0) && (t.relativePlacementConstraint = void 0), (t.fixedNodeConstraint || t.alignmentConstraint || t.relativePlacementConstraint) && (t.tile = !1, t.packComponents = !1);
 								var d = void 0, f = !1;
-								if (n.layoutUtilities && t.packComponents && (d = n.layoutUtilities("get"), d ||= n.layoutUtilities(), f = !0), r.nodes().length > 0) if (f) {
-									var p = o.getTopMostNodes(t.eles.nodes());
-									if (l = o.connectComponents(n, t.eles, p), l.forEach(function(e) {
-										var t = e.boundingBox();
-										u.push({
-											x: t.x1 + t.w / 2,
-											y: t.y1 + t.h / 2
-										});
-									}), t.randomize && l.forEach(function(e) {
-										t.eles = e, i.push(s(t));
-									}), t.quality == "default" || t.quality == "proof") {
-										var m = n.collection();
-										if (t.tile) {
-											var h = /* @__PURE__ */ new Map(), g = [], _ = [], v = 0, y = {
-												nodeIndexes: h,
-												xCoords: g,
-												yCoords: _
-											}, b = [];
-											if (l.forEach(function(e, t) {
-												e.edges().length == 0 && (e.nodes().forEach(function(t, n) {
-													m.merge(e.nodes()[n]), t.isParent() || (y.nodeIndexes.set(e.nodes()[n].id(), v++), y.xCoords.push(e.nodes()[0].position().x), y.yCoords.push(e.nodes()[0].position().y));
-												}), b.push(t));
-											}), m.length > 1) {
-												var x = m.boundingBox();
-												u.push({
-													x: x.x1 + x.w / 2,
-													y: x.y1 + x.h / 2
-												}), l.push(m), i.push(y);
-												for (var S = b.length - 1; S >= 0; S--) l.splice(b[S], 1), i.splice(b[S], 1), u.splice(b[S], 1);
+								if (n.layoutUtilities && t.packComponents && (d = n.layoutUtilities("get"), d ||= n.layoutUtilities(), f = !0), r.nodes().length > 0) {
+									if (f) {
+										var p = o.getTopMostNodes(t.eles.nodes());
+										if (l = o.connectComponents(n, t.eles, p), l.forEach(function(e) {
+											var t = e.boundingBox();
+											u.push({
+												x: t.x1 + t.w / 2,
+												y: t.y1 + t.h / 2
+											});
+										}), t.randomize && l.forEach(function(e) {
+											t.eles = e, i.push(s(t));
+										}), t.quality == "default" || t.quality == "proof") {
+											var m = n.collection();
+											if (t.tile) {
+												var h = /* @__PURE__ */ new Map(), g = [], _ = [], v = 0, y = {
+													nodeIndexes: h,
+													xCoords: g,
+													yCoords: _
+												}, b = [];
+												if (l.forEach(function(e, t) {
+													e.edges().length == 0 && (e.nodes().forEach(function(t, n) {
+														m.merge(e.nodes()[n]), t.isParent() || (y.nodeIndexes.set(e.nodes()[n].id(), v++), y.xCoords.push(e.nodes()[0].position().x), y.yCoords.push(e.nodes()[0].position().y));
+													}), b.push(t));
+												}), m.length > 1) {
+													var x = m.boundingBox();
+													u.push({
+														x: x.x1 + x.w / 2,
+														y: x.y1 + x.h / 2
+													}), l.push(m), i.push(y);
+													for (var S = b.length - 1; S >= 0; S--) l.splice(b[S], 1), i.splice(b[S], 1), u.splice(b[S], 1);
+												}
 											}
-										}
-										l.forEach(function(e, n) {
-											t.eles = e, a.push(c(t, i[n])), o.relocateComponent(u[n], a[n], t);
-										});
-									} else l.forEach(function(e, n) {
-										o.relocateComponent(u[n], i[n], t);
-									});
-									var C = /* @__PURE__ */ new Set();
-									if (l.length > 1) {
-										var w = [], T = r.filter(function(e) {
-											return e.css("display") == "none";
+											l.forEach(function(e, n) {
+												t.eles = e, a.push(c(t, i[n])), o.relocateComponent(u[n], a[n], t);
+											});
+										} else l.forEach(function(e, n) {
+											o.relocateComponent(u[n], i[n], t);
 										});
-										l.forEach(function(e, n) {
-											var r = void 0;
-											if (t.quality == "draft" && (r = i[n].nodeIndexes), e.nodes().not(T).length > 0) {
-												var s = {};
-												s.edges = [], s.nodes = [];
-												var c = void 0;
-												e.nodes().not(T).forEach(function(e) {
-													if (t.quality == "draft") if (!e.isParent()) c = r.get(e.id()), s.nodes.push({
-														x: i[n].xCoords[c] - e.boundingbox().w / 2,
-														y: i[n].yCoords[c] - e.boundingbox().h / 2,
-														width: e.boundingbox().w,
-														height: e.boundingbox().h
-													});
-													else {
-														var l = o.calcBoundingBox(e, i[n].xCoords, i[n].yCoords, r);
-														s.nodes.push({
-															x: l.topLeftX,
-															y: l.topLeftY,
-															width: l.width,
-															height: l.height
-														});
-													}
-													else a[n][e.id()] && s.nodes.push({
-														x: a[n][e.id()].getLeft(),
-														y: a[n][e.id()].getTop(),
-														width: a[n][e.id()].getWidth(),
-														height: a[n][e.id()].getHeight()
-													});
-												}), e.edges().forEach(function(e) {
-													var c = e.source(), l = e.target();
-													if (c.css("display") != "none" && l.css("display") != "none") if (t.quality == "draft") {
-														var u = r.get(c.id()), d = r.get(l.id()), f = [], p = [];
-														if (c.isParent()) {
-															var m = o.calcBoundingBox(c, i[n].xCoords, i[n].yCoords, r);
-															f.push(m.topLeftX + m.width / 2), f.push(m.topLeftY + m.height / 2);
-														} else f.push(i[n].xCoords[u]), f.push(i[n].yCoords[u]);
-														if (l.isParent()) {
-															var h = o.calcBoundingBox(l, i[n].xCoords, i[n].yCoords, r);
-															p.push(h.topLeftX + h.width / 2), p.push(h.topLeftY + h.height / 2);
-														} else p.push(i[n].xCoords[d]), p.push(i[n].yCoords[d]);
-														s.edges.push({
-															startX: f[0],
-															startY: f[1],
-															endX: p[0],
-															endY: p[1]
+										var C = /* @__PURE__ */ new Set();
+										if (l.length > 1) {
+											var w = [], T = r.filter(function(e) {
+												return e.css("display") == "none";
+											});
+											l.forEach(function(e, n) {
+												var r = void 0;
+												if (t.quality == "draft" && (r = i[n].nodeIndexes), e.nodes().not(T).length > 0) {
+													var s = {};
+													s.edges = [], s.nodes = [];
+													var c = void 0;
+													e.nodes().not(T).forEach(function(e) {
+														if (t.quality == "draft") {
+															if (!e.isParent()) c = r.get(e.id()), s.nodes.push({
+																x: i[n].xCoords[c] - e.boundingbox().w / 2,
+																y: i[n].yCoords[c] - e.boundingbox().h / 2,
+																width: e.boundingbox().w,
+																height: e.boundingbox().h
+															});
+															else {
+																var l = o.calcBoundingBox(e, i[n].xCoords, i[n].yCoords, r);
+																s.nodes.push({
+																	x: l.topLeftX,
+																	y: l.topLeftY,
+																	width: l.width,
+																	height: l.height
+																});
+															}
+														} else a[n][e.id()] && s.nodes.push({
+															x: a[n][e.id()].getLeft(),
+															y: a[n][e.id()].getTop(),
+															width: a[n][e.id()].getWidth(),
+															height: a[n][e.id()].getHeight()
 														});
-													} else a[n][c.id()] && a[n][l.id()] && s.edges.push({
-														startX: a[n][c.id()].getCenterX(),
-														startY: a[n][c.id()].getCenterY(),
-														endX: a[n][l.id()].getCenterX(),
-														endY: a[n][l.id()].getCenterY()
-													});
-												}), s.nodes.length > 0 && (w.push(s), C.add(n));
-											}
-										});
-										var E = d.packComponents(w, t.randomize).shifts;
-										if (t.quality == "draft") i.forEach(function(e, t) {
-											var n = e.xCoords.map(function(e) {
-												return e + E[t].dx;
-											}), r = e.yCoords.map(function(e) {
-												return e + E[t].dy;
+													}), e.edges().forEach(function(e) {
+														var c = e.source(), l = e.target();
+														if (c.css("display") != "none" && l.css("display") != "none") {
+															if (t.quality == "draft") {
+																var u = r.get(c.id()), d = r.get(l.id()), f = [], p = [];
+																if (c.isParent()) {
+																	var m = o.calcBoundingBox(c, i[n].xCoords, i[n].yCoords, r);
+																	f.push(m.topLeftX + m.width / 2), f.push(m.topLeftY + m.height / 2);
+																} else f.push(i[n].xCoords[u]), f.push(i[n].yCoords[u]);
+																if (l.isParent()) {
+																	var h = o.calcBoundingBox(l, i[n].xCoords, i[n].yCoords, r);
+																	p.push(h.topLeftX + h.width / 2), p.push(h.topLeftY + h.height / 2);
+																} else p.push(i[n].xCoords[d]), p.push(i[n].yCoords[d]);
+																s.edges.push({
+																	startX: f[0],
+																	startY: f[1],
+																	endX: p[0],
+																	endY: p[1]
+																});
+															} else a[n][c.id()] && a[n][l.id()] && s.edges.push({
+																startX: a[n][c.id()].getCenterX(),
+																startY: a[n][c.id()].getCenterY(),
+																endX: a[n][l.id()].getCenterX(),
+																endY: a[n][l.id()].getCenterY()
+															});
+														}
+													}), s.nodes.length > 0 && (w.push(s), C.add(n));
+												}
 											});
-											e.xCoords = n, e.yCoords = r;
-										});
-										else {
-											var D = 0;
-											C.forEach(function(e) {
-												Object.keys(a[e]).forEach(function(t) {
-													var n = a[e][t];
-													n.setCenter(n.getCenterX() + E[D].dx, n.getCenterY() + E[D].dy);
-												}), D++;
+											var E = d.packComponents(w, t.randomize).shifts;
+											if (t.quality == "draft") i.forEach(function(e, t) {
+												var n = e.xCoords.map(function(e) {
+													return e + E[t].dx;
+												}), r = e.yCoords.map(function(e) {
+													return e + E[t].dy;
+												});
+												e.xCoords = n, e.yCoords = r;
 											});
+											else {
+												var D = 0;
+												C.forEach(function(e) {
+													Object.keys(a[e]).forEach(function(t) {
+														var n = a[e][t];
+														n.setCenter(n.getCenterX() + E[D].dx, n.getCenterY() + E[D].dy);
+													}), D++;
+												});
+											}
 										}
+									} else {
+										var O = t.eles.boundingBox();
+										if (u.push({
+											x: O.x1 + O.w / 2,
+											y: O.y1 + O.h / 2
+										}), t.randomize) {
+											var k = s(t);
+											i.push(k);
+										}
+										t.quality == "default" || t.quality == "proof" ? (a.push(c(t, i[0])), o.relocateComponent(u[0], a[0], t)) : o.relocateComponent(u[0], i[0], t);
 									}
-								} else {
-									var O = t.eles.boundingBox();
-									if (u.push({
-										x: O.x1 + O.w / 2,
-										y: O.y1 + O.h / 2
-									}), t.randomize) {
-										var k = s(t);
-										i.push(k);
-									}
-									t.quality == "default" || t.quality == "proof" ? (a.push(c(t, i[0])), o.relocateComponent(u[0], a[0], t)) : o.relocateComponent(u[0], i[0], t);
 								}
 								var A = function(e, n) {
 									if (t.quality == "default" || t.quality == "proof") {
@@ -3180,22 +3195,21 @@ var D = /* @__PURE__ */ e(((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) {
@@ -3341,18 +3355,17 @@ var D = /* @__PURE__ */ e(((e, t) => {
 								xCoords: f,
 								yCoords: p
 							}), U;
-						} else {
-							var ie = l.keys(), K = t.getElementById(ie.next().value), q = K.position(), ae = K.outerWidth();
-							if (f.push(q.x), p.push(q.y), y == 2) {
-								var J = t.getElementById(ie.next().value).outerWidth();
-								f.push(q.x + ae / 2 + J / 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(), ae = K.outerWidth();
+						if (f.push(q.x), p.push(q.y), y == 2) {
+							var J = t.getElementById(ie.next().value).outerWidth();
+							f.push(q.x + ae / 2 + J / 2 + e.idealEdgeLength), p.push(q.y);
+						}
+						return U = {
+							nodeIndexes: l,
+							xCoords: f,
+							yCoords: p
+						}, U;
 					} };
 				}),
 				579: ((e, t, n) => {
@@ -4083,18 +4096,14 @@ function ge(e, r, i, a, o, { spatialMaps: s, groupAlignments: c }) {
 					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,