@fibery/custom-app-text-editor 1.3.6 → 1.3.8

package/lib/{cose-bilkent-JH36ORCC-BCXBK7jk.js → cose-bilkent-JH36ORCC-vb4P1vrW.js}

@@ -1,7 +1,7 @@
 import { i as e, t } from "./rolldown-runtime-DArdT4gl.js";
 import { n } from "./chunk-Y2CYZVJY-QdJ4V9rh.js";
 import { m as r, p as i } from "./src-DlDd_dhc.js";
-import { t as a } from "./cytoscape.esm-DMXbtFI-.js";
+import { t as a } from "./cytoscape.esm-mEPMxELm.js";
 //#region ../../node_modules/.pnpm/layout-base@1.0.2/node_modules/layout-base/layout-base.js
 var o = /* @__PURE__ */ t(((e, t) => {
 	(function(n, r) {
@@ -438,13 +438,13 @@ var o = /* @__PURE__ */ t(((e, t) => {
 						if (r = n.getParent(), r == null) break;
 						if (r == t) return !0;
 						if (n = r.getOwner(), n == null) break;
-					} while (!0);
+					} while (1);
 					n = t.getOwner();
 					do {
 						if (r = n.getParent(), r == null) break;
 						if (r == e) return !0;
 						if (n = r.getOwner(), n == null) break;
-					} while (!0);
+					} while (1);
 					return !1;
 				}, a.prototype.calcLowestCommonAncestors = function() {
 					for (var e, t, n, r, i, a = this.getAllEdges(), o = a.length, s = 0; s < o; s++) {
@@ -477,9 +477,9 @@ var o = /* @__PURE__ */ t(((e, t) => {
 							if (r == null) break;
 							if (r == n) return r;
 							r = r.getParent().getOwner();
-						} while (!0);
+						} while (1);
 						n = n.getParent().getOwner();
-					} while (!0);
+					} while (1);
 					return n;
 				}, a.prototype.calcInclusionTreeDepths = function(e, t) {
 					e == null && t == null && (e = this.rootGraph, t = 1);
@@ -1586,14 +1586,12 @@ var o = /* @__PURE__ */ t(((e, t) => {
 						this.graphManager.updateBounds();
 					}
 				}, v.prototype.calculateNodesToApplyGravitationTo = function() {
-					var e = [], t, n = this.graphManager.getGraphs(), r = n.length, i;
-					for (i = 0; i < r; i++) t = n[i], t.updateConnected(), t.isConnected || (e = e.concat(t.getNodes()));
+					for (var e = [], t, n = this.graphManager.getGraphs(), r = n.length, i = 0; i < r; i++) t = n[i], t.updateConnected(), t.isConnected || (e = e.concat(t.getNodes()));
 					return e;
 				}, v.prototype.createBendpoints = function() {
 					var e = [];
 					e = e.concat(this.graphManager.getAllEdges());
-					var t = /* @__PURE__ */ new Set(), n;
-					for (n = 0; n < e.length; n++) {
+					for (var t = /* @__PURE__ */ new Set(), n = 0; n < e.length; n++) {
 						var r = e[n];
 						if (!t.has(r)) {
 							var i = r.getSource(), a = r.getTarget();
@@ -1601,12 +1599,9 @@ var o = /* @__PURE__ */ t(((e, t) => {
 							else {
 								var o = [];
 								if (o = o.concat(i.getEdgeListToNode(a)), o = o.concat(a.getEdgeListToNode(i)), !t.has(o[0])) {
-									if (o.length > 1) {
-										var s;
-										for (s = 0; s < o.length; s++) {
-											var c = o[s];
-											c.getBendpoints().push(new f()), this.createDummyNodesForBendpoints(c);
-										}
+									if (o.length > 1) for (var s = 0; s < o.length; s++) {
+										var c = o[s];
+										c.getBendpoints().push(new f()), this.createDummyNodesForBendpoints(c);
 									}
 									o.forEach(function(e) {
 										t.add(e);