@pi-outpost/embed 0.6.4 → 0.6.6

package/dist/{architectureDiagram-ZJ3FMSHR-D7UsY5ua.js → architectureDiagram-T3A2C74G-BH-F8FzB.js}

@@ -2,12 +2,12 @@ import { r as e, t } from "./rolldown-runtime-Dqa2HsxW.js";
 import { n } from "./mermaid-parser.core-B8DQcCaz.js";
 import { n as r } from "./chunk-Y2CYZVJY-CwsV_8W4.js";
 import { m as i, p as a } from "./src-DJ4x3y2O.js";
-import { H as o, J as s, K as c, U as l, a as u, b as d, f, v as p, w as m, x as h, y as g, z as _ } from "./chunk-WYO6CB5R-Y9HJHB3Q.js";
-import { c as v, i as y } from "./chunk-ICXQ74PX-CC59NQmW.js";
-import { t as b } from "./chunk-VAUOI2AC-05FwamOA.js";
+import { H as o, J as s, K as c, U as l, a as u, b as d, f, v as p, w as m, x as h, y as g, z as _ } from "./chunk-I66GZJ75-DexfhZwA.js";
+import { c as v, i as y } from "./chunk-NSK5VX7P-DPxIxDdV.js";
+import { t as b } from "./chunk-3NCLNEKW-dTH67Ne_.js";
 import { t as x } from "./chunk-JWPE2WC7-B_J6qwQL.js";
-import { i as S, r as C, t as w } from "./chunk-HOUHSVGY-CtRCnz1G.js";
-import { n as T } from "./chunk-Q4XR5HBZ-Bk18cMuk.js";
+import { i as S, r as C, t as w } from "./chunk-4I5QYGJK-JZmvuONC.js";
+import { n as T } from "./chunk-WRU74C26-D4huAZcy.js";
 import { t as E } from "./cytoscape.esm-asYnbYTy.js";
 //#region ../node_modules/cytoscape-fcose/node_modules/layout-base/layout-base.js
 var D = /* @__PURE__ */ t(((e, t) => {
@@ -1444,29 +1444,29 @@ var D = /* @__PURE__ */ t(((e, t) => {
 								var K = n[E - 2];
 								n[E - 2] = 0;
 								for (var q = E - 2; q >= U; q--) {
-									var J = r.hypot(this.s[q], K), Y = this.s[q] / J, X = K / J;
-									if (this.s[q] = J, q !== U && (K = -X * n[q - 1], n[q - 1] = Y * n[q - 1]), o) for (var Z = 0; Z < this.n; Z++) J = Y * this.V[Z][q] + X * this.V[Z][E - 1], this.V[Z][E - 1] = -X * this.V[Z][q] + Y * this.V[Z][E - 1], this.V[Z][q] = J;
+									var ae = r.hypot(this.s[q], K), J = this.s[q] / ae, Y = K / ae;
+									if (this.s[q] = ae, q !== U && (K = -Y * n[q - 1], n[q - 1] = J * n[q - 1]), o) for (var X = 0; X < this.n; X++) ae = J * this.V[X][q] + Y * this.V[X][E - 1], this.V[X][E - 1] = -Y * this.V[X][q] + J * this.V[X][E - 1], this.V[X][q] = ae;
 								}
 								break;
 							case 2:
-								var ae = n[U - 1];
+								var oe = n[U - 1];
 								n[U - 1] = 0;
-								for (var Q = U; Q < E; Q++) {
-									var oe = r.hypot(this.s[Q], ae), se = this.s[Q] / oe, ce = ae / oe;
-									if (this.s[Q] = oe, ae = -ce * n[Q], n[Q] = se * n[Q], a) for (var le = 0; le < this.m; le++) oe = se * this.U[le][Q] + ce * this.U[le][U - 1], this.U[le][U - 1] = -ce * this.U[le][Q] + se * this.U[le][U - 1], this.U[le][Q] = oe;
+								for (var Z = U; Z < E; Z++) {
+									var se = r.hypot(this.s[Z], oe), ce = this.s[Z] / se, le = oe / se;
+									if (this.s[Z] = se, oe = -le * n[Z], n[Z] = ce * n[Z], a) for (var ue = 0; ue < this.m; ue++) se = ce * this.U[ue][Z] + le * this.U[ue][U - 1], this.U[ue][U - 1] = -le * this.U[ue][Z] + ce * this.U[ue][U - 1], this.U[ue][Z] = se;
 								}
 								break;
 							case 3:
-								var ue = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[E - 1]), Math.abs(this.s[E - 2])), Math.abs(n[E - 2])), Math.abs(this.s[U])), Math.abs(n[U])), de = this.s[E - 1] / ue, fe = this.s[E - 2] / ue, pe = n[E - 2] / ue, me = this.s[U] / ue, he = n[U] / ue, ge = ((fe + de) * (fe - de) + pe * pe) / 2, _e = de * pe * (de * pe), ve = 0;
+								var de = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[E - 1]), Math.abs(this.s[E - 2])), Math.abs(n[E - 2])), Math.abs(this.s[U])), Math.abs(n[U])), fe = this.s[E - 1] / de, pe = this.s[E - 2] / de, me = n[E - 2] / de, he = this.s[U] / de, ge = n[U] / de, _e = ((pe + fe) * (pe - fe) + me * me) / 2, ve = fe * me * (fe * me), ye = 0;
 								(function(e, t) {
 									return e || t;
-								})(ge !== 0, _e !== 0) && (ve = Math.sqrt(ge * ge + _e), ge < 0 && (ve = -ve), ve = _e / (ge + ve));
-								for (var ye = (me + de) * (me - de) + ve, be = me * he, $ = U; $ < E - 1; $++) {
-									var xe = r.hypot(ye, be), Se = ye / xe, Ce = be / xe;
-									if ($ !== U && (n[$ - 1] = xe), ye = Se * this.s[$] + Ce * n[$], n[$] = Se * n[$] - Ce * this.s[$], be = Ce * this.s[$ + 1], this.s[$ + 1] = Se * this.s[$ + 1], o) for (var we = 0; we < this.n; we++) xe = Se * this.V[we][$] + Ce * this.V[we][$ + 1], this.V[we][$ + 1] = -Ce * this.V[we][$] + Se * this.V[we][$ + 1], this.V[we][$] = xe;
-									if (xe = r.hypot(ye, be), Se = ye / xe, Ce = be / xe, this.s[$] = xe, ye = Se * n[$] + Ce * this.s[$ + 1], this.s[$ + 1] = -Ce * n[$] + Se * this.s[$ + 1], be = Ce * n[$ + 1], n[$ + 1] = Se * n[$ + 1], a && $ < this.m - 1) for (var Te = 0; Te < this.m; Te++) xe = Se * this.U[Te][$] + Ce * this.U[Te][$ + 1], this.U[Te][$ + 1] = -Ce * this.U[Te][$] + Se * this.U[Te][$ + 1], this.U[Te][$] = xe;
+								})(_e !== 0, ve !== 0) && (ye = Math.sqrt(_e * _e + ve), _e < 0 && (ye = -ye), ye = ve / (_e + ye));
+								for (var be = (he + fe) * (he - fe) + ye, xe = he * ge, Q = U; Q < E - 1; Q++) {
+									var $ = r.hypot(be, xe), Se = be / $, Ce = xe / $;
+									if (Q !== U && (n[Q - 1] = $), be = Se * this.s[Q] + Ce * n[Q], n[Q] = Se * n[Q] - Ce * this.s[Q], xe = Ce * this.s[Q + 1], this.s[Q + 1] = Se * this.s[Q + 1], o) for (var we = 0; we < this.n; we++) $ = Se * this.V[we][Q] + Ce * this.V[we][Q + 1], this.V[we][Q + 1] = -Ce * this.V[we][Q] + Se * this.V[we][Q + 1], this.V[we][Q] = $;
+									if ($ = r.hypot(be, xe), Se = be / $, Ce = xe / $, this.s[Q] = $, be = Se * n[Q] + Ce * this.s[Q + 1], this.s[Q + 1] = -Ce * n[Q] + Se * this.s[Q + 1], xe = Ce * n[Q + 1], n[Q + 1] = Se * n[Q + 1], a && Q < this.m - 1) for (var Te = 0; Te < this.m; Te++) $ = Se * this.U[Te][Q] + Ce * this.U[Te][Q + 1], this.U[Te][Q + 1] = -Ce * this.U[Te][Q] + Se * this.U[Te][Q + 1], this.U[Te][Q] = $;
 								}
-								n[E - 2] = ye, H += 1;
+								n[E - 2] = be, H += 1;
 								break;
 							case 4:
 								if (this.s[U] <= 0 && (this.s[U] = this.s[U] < 0 ? -this.s[U] : 0, o)) for (var Ee = 0; Ee <= te; Ee++) this.V[Ee][U] = -this.V[Ee][U];
@@ -2650,7 +2650,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 										E.has(e) || (l[c.get(e)] = i);
 									});
 								}, K = 0; K < G.length; K++) ie(K);
-								if (t.alignmentConstraint.horizontal) for (var q = t.alignmentConstraint.horizontal, J = function(e) {
+								if (t.alignmentConstraint.horizontal) for (var q = t.alignmentConstraint.horizontal, ae = function(e) {
 									var t = /* @__PURE__ */ new Set();
 									q[e].forEach(function(e) {
 										t.add(e);
@@ -2661,7 +2661,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 									i = n.size > 0 ? u[c.get(n.values().next().value)] : g(t).y, t.forEach(function(e) {
 										E.has(e) || (u[c.get(e)] = i);
 									});
-								}, Y = 0; Y < q.length; Y++) J(Y);
+								}, J = 0; J < q.length; J++) ae(J);
 							}
 							t.relativePlacementConstraint && (function() {
 								var e = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Set();
@@ -2740,26 +2740,26 @@ var D = /* @__PURE__ */ t(((e, t) => {
 									i.get(e) ? i.get(e).forEach(function(t) {
 										u[c.get(t)] = ee.get(e);
 									}) : u[c.get(e)] = ee.get(e);
-								}, K = !0, q = !1, J = void 0;
+								}, K = !0, q = !1, ae = void 0;
 								try {
-									for (var Y = ee.keys()[Symbol.iterator](), X; !(K = (X = Y.next()).done); K = !0) {
-										var G = X.value;
+									for (var J = ee.keys()[Symbol.iterator](), Y; !(K = (Y = J.next()).done); K = !0) {
+										var G = Y.value;
 										ie(G);
 									}
 								} catch (e) {
-									q = !0, J = e;
+									q = !0, ae = e;
 								} finally {
 									try {
-										!K && Y.return && Y.return();
+										!K && J.return && J.return();
 									} finally {
-										if (q) throw J;
+										if (q) throw ae;
 									}
 								}
 							})();
 						}
-						for (var X = 0; X < d.length; X++) {
-							var Z = d[X];
-							Z.getChild() ?? Z.setCenter(l[c.get(Z.id)], u[c.get(Z.id)]);
+						for (var Y = 0; Y < d.length; Y++) {
+							var X = d[Y];
+							X.getChild() ?? X.setCenter(l[c.get(X.id)], u[c.get(X.id)]);
 						}
 					}, e.exports = c;
 				}),
@@ -3343,10 +3343,10 @@ var D = /* @__PURE__ */ t(((e, t) => {
 								yCoords: p
 							}), U;
 						} else {
-							var ie = l.keys(), K = t.getElementById(ie.next().value), q = K.position(), J = K.outerWidth();
+							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 Y = t.getElementById(ie.next().value).outerWidth();
-								f.push(q.x + J / 2 + Y / 2 + e.idealEdgeLength), p.push(q.y);
+								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,
@@ -3423,9 +3423,12 @@ 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 = f.architecture, G = class {
+}, "isArchitectureJunction"), re = /* @__PURE__ */ r((e, t) => {
+	let [n, r] = [e, t].sort();
+	return `${JSON.stringify(n)}-${JSON.stringify(r)}`;
+}, "architectureGroupAlignmentKey"), U = /* @__PURE__ */ r((e) => e.data(), "edgeData"), W = /* @__PURE__ */ r((e) => e.data(), "nodeData"), G = f.architecture, ie = class {
 	constructor() {
-		this.nodes = {}, this.groups = {}, this.edges = [], this.layoutHints = [], this.registeredIds = {}, this.elements = {}, this.diagramId = "", this.setAccTitle = l, this.getAccTitle = g, this.setDiagramTitle = c, this.getDiagramTitle = m, this.getAccDescription = p, this.setAccDescription = o, this.clear();
+		this.nodes = /* @__PURE__ */ new Map(), this.groups = /* @__PURE__ */ new Map(), this.edges = [], this.layoutHints = [], this.registeredIds = /* @__PURE__ */ new Map(), this.elements = /* @__PURE__ */ new Map(), this.diagramId = "", this.setAccTitle = l, this.getAccTitle = g, this.setDiagramTitle = c, this.getDiagramTitle = m, this.getAccDescription = p, this.setAccDescription = o, this.clear();
 	}
 	static {
 		r(this, "ArchitectureDB");
@@ -3437,16 +3440,16 @@ var D = /* @__PURE__ */ t(((e, t) => {
 		return this.diagramId;
 	}
 	clear() {
-		this.nodes = {}, this.groups = {}, this.edges = [], this.layoutHints = [], this.registeredIds = {}, this.dataStructures = void 0, this.elements = {}, this.diagramId = "", u();
+		this.nodes = /* @__PURE__ */ new Map(), this.groups = /* @__PURE__ */ new Map(), this.edges = [], this.layoutHints = [], this.registeredIds = /* @__PURE__ */ new Map(), this.dataStructures = void 0, this.elements = /* @__PURE__ */ new Map(), this.diagramId = "", u();
 	}
 	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]}`);
+		if (this.registeredIds.has(e)) throw Error(`The service id [${e}] is already in use by another ${this.registeredIds.get(e)}`);
 		if (n !== void 0) {
 			if (e === n) throw Error(`The service [${e}] cannot be placed within itself`);
-			if (this.registeredIds[n] === void 0) throw Error(`The service [${e}]'s parent does not exist. Please make sure the parent is created before this service`);
-			if (this.registeredIds[n] === "node") throw Error(`The service [${e}]'s parent is not a group`);
+			if (!this.registeredIds.has(n)) throw Error(`The service [${e}]'s parent does not exist. Please make sure the parent is created before this service`);
+			if (this.registeredIds.get(n) === "node") throw Error(`The service [${e}]'s parent is not a group`);
 		}
-		this.registeredIds[e] = "node", this.nodes[e] = {
+		this.registeredIds.set(e, "node"), this.nodes.set(e, {
 			id: e,
 			type: "service",
 			icon: t,
@@ -3454,57 +3457,57 @@ var D = /* @__PURE__ */ t(((e, t) => {
 			title: r,
 			edges: [],
 			in: n
-		};
+		});
 	}
 	getServices() {
-		return Object.values(this.nodes).filter(H);
+		return [...this.nodes.values()].filter(H);
 	}
 	addJunction({ id: e, in: t }) {
-		if (this.registeredIds[e] !== void 0) throw Error(`The junction id [${e}] is already in use by another ${this.registeredIds[e]}`);
+		if (this.registeredIds.has(e)) throw Error(`The junction id [${e}] is already in use by another ${this.registeredIds.get(e)}`);
 		if (t !== void 0) {
 			if (e === t) throw Error(`The junction [${e}] cannot be placed within itself`);
-			if (this.registeredIds[t] === void 0) throw Error(`The junction [${e}]'s parent does not exist. Please make sure the parent is created before this junction`);
-			if (this.registeredIds[t] === "node") throw Error(`The junction [${e}]'s parent is not a group`);
+			if (!this.registeredIds.has(t)) throw Error(`The junction [${e}]'s parent does not exist. Please make sure the parent is created before this junction`);
+			if (this.registeredIds.get(t) === "node") throw Error(`The junction [${e}]'s parent is not a group`);
 		}
-		this.registeredIds[e] = "node", this.nodes[e] = {
+		this.registeredIds.set(e, "node"), this.nodes.set(e, {
 			id: e,
 			type: "junction",
 			edges: [],
 			in: t
-		};
+		});
 	}
 	getJunctions() {
-		return Object.values(this.nodes).filter(ne);
+		return [...this.nodes.values()].filter(ne);
 	}
 	getNodes() {
-		return Object.values(this.nodes);
+		return [...this.nodes.values()];
 	}
 	getNode(e) {
-		return this.nodes[e] ?? null;
+		return this.nodes.get(e) ?? null;
 	}
 	addGroup({ id: e, icon: t, in: n, title: r }) {
-		if (this.registeredIds?.[e] !== void 0) throw Error(`The group id [${e}] is already in use by another ${this.registeredIds[e]}`);
+		if (this.registeredIds.has(e)) throw Error(`The group id [${e}] is already in use by another ${this.registeredIds.get(e)}`);
 		if (n !== void 0) {
 			if (e === n) throw Error(`The group [${e}] cannot be placed within itself`);
-			if (this.registeredIds?.[n] === void 0) throw Error(`The group [${e}]'s parent does not exist. Please make sure the parent is created before this group`);
-			if (this.registeredIds?.[n] === "node") throw Error(`The group [${e}]'s parent is not a group`);
+			if (!this.registeredIds.has(n)) throw Error(`The group [${e}]'s parent does not exist. Please make sure the parent is created before this group`);
+			if (this.registeredIds.get(n) === "node") throw Error(`The group [${e}]'s parent is not a group`);
 		}
-		this.registeredIds[e] = "group", this.groups[e] = {
+		this.registeredIds.set(e, "group"), this.groups.set(e, {
 			id: e,
 			icon: t,
 			title: r,
 			in: n
-		};
+		});
 	}
 	getGroups() {
-		return Object.values(this.groups);
+		return [...this.groups.values()];
 	}
 	addEdge({ lhsId: e, rhsId: t, lhsDir: n, rhsDir: r, lhsInto: i, rhsInto: a, lhsGroup: o, rhsGroup: s, title: c }) {
 		if (!P(n)) throw Error(`Invalid direction given for left hand side of edge ${e}--${t}. Expected (L,R,T,B) got ${String(n)}`);
 		if (!P(r)) throw Error(`Invalid direction given for right hand side of edge ${e}--${t}. Expected (L,R,T,B) got ${String(r)}`);
-		if (this.nodes[e] === void 0 && this.groups[e] === void 0) throw Error(`The left-hand id [${e}] does not yet exist. Please create the service/group before declaring an edge to it.`);
-		if (this.nodes[t] === void 0 && this.groups[t] === void 0) throw Error(`The right-hand id [${t}] does not yet exist. Please create the service/group before declaring an edge to it.`);
-		let l = this.nodes[e].in, u = this.nodes[t].in;
+		if (!this.nodes.has(e) && !this.groups.has(e)) throw Error(`The left-hand id [${e}] does not yet exist. Please create the service/group before declaring an edge to it.`);
+		if (!this.nodes.has(t) && !this.groups.has(t)) throw Error(`The right-hand id [${t}] does not yet exist. Please create the service/group before declaring an edge to it.`);
+		let l = this.nodes.get(e).in, u = this.nodes.get(t).in;
 		if (o && l && u && l == u) throw Error(`The left-hand id [${e}] is modified to traverse the group boundary, but the edge does not pass through two groups.`);
 		if (s && l && u && l == u) throw Error(`The right-hand id [${t}] is modified to traverse the group boundary, but the edge does not pass through two groups.`);
 		let d = {
@@ -3518,7 +3521,9 @@ var D = /* @__PURE__ */ t(((e, t) => {
 			rhsGroup: s,
 			title: c
 		};
-		this.edges.push(d), this.nodes[e] && this.nodes[t] && (this.nodes[e].edges.push(this.edges[this.edges.length - 1]), this.nodes[t].edges.push(this.edges[this.edges.length - 1]));
+		this.edges.push(d);
+		let f = this.nodes.get(e), p = this.nodes.get(t);
+		f && p && (f.edges.push(this.edges[this.edges.length - 1]), p.edges.push(this.edges[this.edges.length - 1]));
 	}
 	getEdges() {
 		return this.edges;
@@ -3527,7 +3532,7 @@ var D = /* @__PURE__ */ t(((e, t) => {
 		if (e.members.length < 2) throw Error(`An align directive requires at least two members; got ${e.members.length}`);
 		let t = /* @__PURE__ */ new Set();
 		e.members.forEach((n) => {
-			if (this.registeredIds[n] !== "node") throw Error(`align ${e.direction} references [${n}], which is not a service or junction`);
+			if (this.registeredIds.get(n) !== "node") throw Error(`align ${e.direction} references [${n}], which is not a service or junction`);
 			if (t.has(n)) throw Error(`align ${e.direction} lists [${n}] more than once`);
 			t.add(n);
 		}), this.layoutHints.push(e);
@@ -3537,62 +3542,71 @@ var D = /* @__PURE__ */ t(((e, t) => {
 	}
 	getDataStructures() {
 		if (this.dataStructures === void 0) {
-			let e = {}, t = Object.entries(this.nodes).reduce((t, [n, r]) => (t[n] = r.edges.reduce((t, r) => {
-				let i = this.getNode(r.lhsId)?.in, a = this.getNode(r.rhsId)?.in;
-				if (i && a && i !== a) {
-					let t = te(r.lhsDir, r.rhsDir);
-					t !== "bend" && (e[i] ??= {}, e[i][a] = t, e[a] ??= {}, e[a][i] = t);
-				}
-				if (r.lhsId === n) {
-					let e = B(r.lhsDir, r.rhsDir);
-					e && (t[e] = r.rhsId);
-				} else {
-					let e = B(r.rhsDir, r.lhsDir);
-					e && (t[e] = r.lhsId);
+			let e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map();
+			for (let [n, r] of this.nodes.entries()) {
+				let i = /* @__PURE__ */ new Map();
+				for (let t of r.edges) {
+					let r = this.getNode(t.lhsId)?.in, a = this.getNode(t.rhsId)?.in;
+					if (r && a && r !== a) {
+						let n = te(t.lhsDir, t.rhsDir);
+						n !== "bend" && e.set(re(r, a), n);
+					}
+					if (t.lhsId === n) {
+						let e = B(t.lhsDir, t.rhsDir);
+						e && i.set(e, t.rhsId);
+					} else {
+						let e = B(t.rhsDir, t.lhsDir);
+						e && i.set(e, t.lhsId);
+					}
 				}
-				return t;
-			}, {}), t), {}), n = Object.keys(t)[0], i = { [n]: 1 }, a = Object.keys(t).reduce((e, t) => t === n ? e : {
-				...e,
-				[t]: 1
-			}, {}), o = /* @__PURE__ */ r((e) => {
-				let n = { [e]: [0, 0] }, r = [e];
-				for (; r.length > 0;) {
-					let e = r.shift();
+				t.set(n, i);
+			}
+			let n = /* @__PURE__ */ new Set(), i = new Set(t.keys()), a = /* @__PURE__ */ r((e) => {
+				let r = /* @__PURE__ */ new Map([[e, [0, 0]]]), a = [e];
+				for (; a.length > 0;) {
+					let e = a.shift();
 					if (e) {
-						i[e] = 1, delete a[e];
-						let o = t[e], [s, c] = n[e];
-						Object.entries(o).forEach(([e, t]) => {
-							i[t] || (n[t] = V([s, c], e), r.push(t));
+						n.add(e), i.delete(e);
+						let o = t.get(e);
+						if (!o) throw Error(`BFS error: adjacency list for id ${e} not found. Please report this as a bug.`);
+						let s = r.get(e);
+						if (!s) throw Error(`BFS error: position for id ${e} not found in spatial map. Please report this as a bug.`);
+						let [c, l] = s;
+						o.forEach((e, t) => {
+							n.has(e) || (r.set(e, V([c, l], t)), a.push(e));
 						});
 					}
 				}
-				return n;
-			}, "BFS"), s = [o(n)];
-			for (; Object.keys(a).length > 0;) s.push(o(Object.keys(a)[0]));
+				return r;
+			}, "BFS"), o = [];
+			for (; i.size > 0;) {
+				let e = i.values().next().value;
+				o.push(a(e));
+			}
 			this.dataStructures = {
 				adjList: t,
-				spatialMaps: s,
+				spatialMaps: o,
 				groupAlignments: e
 			};
 		}
 		return this.dataStructures;
 	}
 	setElementForId(e, t) {
-		this.elements[e] = t;
+		this.elements.set(e, t);
 	}
 	getElementById(e) {
-		return this.elements[e];
+		return this.elements.get(e);
 	}
 	getConfig() {
 		return y({
-			...W,
+			...G,
 			...d().architecture
 		});
 	}
 	getConfigField(e) {
 		return this.getConfig()[e];
 	}
-}, ie = /* @__PURE__ */ r((e, t) => {
+}, K = /* @__PURE__ */ r((e, t) => {
 	x(e, t), e.groups.map((e) => t.addGroup(e)), e.services.map((e) => t.addService({
 		...e,
 		type: "service"
@@ -3603,16 +3617,16 @@ var D = /* @__PURE__ */ t(((e, t) => {
 		direction: e.direction,
 		members: [...e.members]
 	}));
-}, "populateDb"), K = {
+}, "populateDb"), q = {
 	parser: { yy: void 0 },
 	parse: /* @__PURE__ */ r(async (e) => {
 		let t = await n("architecture", e);
 		i.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.");
-		ie(t, r);
+		let r = q.parser?.yy;
+		if (!(r instanceof ie)) 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.");
+		K(t, r);
 	}, "parse")
-}, q = /* @__PURE__ */ r((e) => `
+}, ae = /* @__PURE__ */ r((e) => `
   .edge {
     stroke-width: ${e.archEdgeWidth};
     stroke: ${e.archEdgeColor};
@@ -3672,10 +3686,10 @@ var Y = /* @__PURE__ */ r((e) => `<g><rect width="80" height="80" style="fill: #
 		unknown: S,
 		blank: { body: Y("") }
 	}
-}, Z = /* @__PURE__ */ r(async function(e, t, n, r) {
+}, oe = /* @__PURE__ */ r(async function(e, t, n, r) {
 	let i = n.getConfigField("padding"), a = n.getConfigField("iconSize"), o = a / 2, s = a / 6, c = s / 2;
 	await Promise.all(t.edges().map(async (t) => {
-		let { source: a, sourceDir: l, sourceArrow: u, sourceGroup: d, target: f, targetDir: p, targetArrow: m, targetGroup: g, label: _ } = re(t), { x: y, y: b } = t[0].sourceEndpoint(), { x, y: S } = t[0].midpoint(), { x: C, y: w } = t[0].targetEndpoint(), E = i + 4;
+		let { source: a, sourceDir: l, sourceArrow: u, sourceGroup: d, target: f, targetDir: p, targetArrow: m, targetGroup: g, label: _ } = U(t), { x: y, y: b } = t[0].sourceEndpoint(), { x, y: S } = t[0].midpoint(), { x: C, y: w } = t[0].targetEndpoint(), E = i + 4;
 		if (d && (F(l) ? y += l === "L" ? -E : E : b += l === "T" ? -E : E + 18), g && (F(p) ? C += p === "L" ? -E : E : w += p === "T" ? -E : E + 18), !d && n.getNode(a)?.type === "junction" && (F(l) ? y += l === "L" ? o : -o : b += l === "T" ? o : -o), !g && n.getNode(f)?.type === "junction" && (F(p) ? C += p === "L" ? o : -o : w += p === "T" ? o : -o), t[0]._private.rscratch) {
 			let t = e.insert("g");
 			if (t.insert("path").attr("d", `M ${y},${b} L ${x},${S} L${C},${w} `).attr("class", "edge").attr("id", `${r}-${v(a, f, { prefix: "L" })}`), u) {
@@ -3712,10 +3726,10 @@ var Y = /* @__PURE__ */ r((e) => `<g><rect width="80" height="80" style="fill: #
 			}
 		}
 	}));
-}, "drawEdges"), ae = /* @__PURE__ */ r(async function(e, t, n, r) {
+}, "drawEdges"), Z = /* @__PURE__ */ r(async function(e, t, n, r) {
 	let i = n.getConfigField("padding") * .75, a = n.getConfigField("fontSize"), o = n.getConfigField("iconSize") / 2;
 	await Promise.all(t.nodes().map(async (t) => {
-		let s = U(t);
+		let s = W(t);
 		if (s.type === "group") {
 			let { h: c, w: l, x1: u, y1: d } = t.boundingBox(), f = e.append("rect");
 			f.attr("id", `${r}-group-${s.id}`).attr("x", u + o).attr("y", d + o).attr("width", l).attr("height", c).attr("class", "node-bkg");
@@ -3739,7 +3753,7 @@ var Y = /* @__PURE__ */ r((e) => `<g><rect width="80" height="80" style="fill: #
 			n.setElementForId(s.id, f);
 		}
 	}));
-}, "drawGroups"), Q = /* @__PURE__ */ r(async function(e, t, n, r) {
+}, "drawGroups"), se = /* @__PURE__ */ r(async function(e, t, n, r) {
 	let i = h();
 	for (let a of n) {
 		let n = t.append("g"), o = e.getConfigField("iconSize");
@@ -3771,7 +3785,7 @@ var Y = /* @__PURE__ */ r((e) => `<g><rect width="80" height="80" style="fill: #
 		a.width = c, a.height = l, e.setElementForId(a.id, n);
 	}
 	return 0;
-}, "drawServices"), oe = /* @__PURE__ */ r(function(e, t, n, r) {
+}, "drawServices"), ce = /* @__PURE__ */ r(function(e, t, n, r) {
 	n.forEach((n) => {
 		let i = t.append("g"), a = e.getConfigField("iconSize");
 		i.append("g").append("rect").attr("id", `${r}-node-${n.id}`).attr("fill-opacity", "0").attr("width", a).attr("height", a), i.attr("class", "architecture-junction");
@@ -3783,7 +3797,7 @@ C([{
 	name: X.prefix,
 	icons: X
 }]), E.use(k.default);
-function se(e, t, n) {
+function le(e, t, n) {
 	e.forEach((e) => {
 		t.add({
 			group: "nodes",
@@ -3800,8 +3814,8 @@ function se(e, t, n) {
 		});
 	});
 }
-r(se, "addServices");
-function ce(e, t, n) {
+r(le, "addServices");
+function ue(e, t, n) {
 	e.forEach((e) => {
 		t.add({
 			group: "nodes",
@@ -3816,15 +3830,15 @@ function ce(e, t, n) {
 		});
 	});
 }
-r(ce, "addJunctions");
-function le(e, t) {
+r(ue, "addJunctions");
+function de(e, t) {
 	t.nodes().map((t) => {
-		let n = U(t);
+		let n = W(t);
 		n.type !== "group" && (n.x = t.position().x, n.y = t.position().y, e.getElementById(n.id).attr("transform", "translate(" + (n.x || 0) + "," + (n.y || 0) + ")"));
 	});
 }
-r(le, "positionNodes");
-function ue(e, t) {
+r(de, "positionNodes");
+function fe(e, t) {
 	e.forEach((e) => {
 		t.add({
 			group: "nodes",
@@ -3839,8 +3853,8 @@ function ue(e, t) {
 		});
 	});
 }
-r(ue, "addGroups");
-function de(e, t) {
+r(fe, "addGroups");
+function pe(e, t) {
 	e.forEach((e) => {
 		let { lhsId: n, rhsId: r, lhsInto: i, lhsGroup: a, rhsInto: o, lhsDir: s, rhsDir: c, rhsGroup: l, title: u } = e, d = L(e.lhsDir, e.rhsDir) ? "segments" : "straight", f = {
 			id: `${n}-${r}`,
@@ -3863,39 +3877,51 @@ function de(e, t) {
 		});
 	});
 }
-r(de, "addEdges");
-function fe(e, t, n, i = []) {
-	let a = /* @__PURE__ */ r((e, t) => Object.entries(e).reduce((e, [r, i]) => {
-		let a = 0, o = Object.entries(i);
-		if (o.length === 1) return e[r] = o[0][1], e;
-		for (let i = 0; i < o.length - 1; i++) for (let s = i + 1; s < o.length; s++) {
-			let [c, l] = o[i], [u, d] = o[s];
-			if (n[c]?.[u] === t) e[r] ??= [], e[r] = [
-				...e[r],
-				...l,
-				...d
-			];
-			else if (c === "default" || u === "default") e[r] ??= [], e[r] = [
-				...e[r],
-				...l,
-				...d
-			];
-			else {
-				let t = `${r}-${a++}`;
-				e[t] = l;
-				let n = `${r}-${a++}`;
-				e[n] = d;
+r(pe, "addEdges");
+function me(e, t, n, i = []) {
+	let a = /* @__PURE__ */ r((e, t) => {
+		let r = /* @__PURE__ */ new Map();
+		for (let [i, a] of e.entries()) {
+			let e = `${i}`, o = 0, s = [...a.entries()];
+			if (s.length === 1) {
+				r.set(e, s[0][1]);
+				continue;
+			}
+			for (let i = 0; i < s.length - 1; i++) for (let a = i + 1; a < s.length; a++) {
+				let [c, l] = s[i], [u, d] = s[a];
+				if (n.get(re(c, u)) === t) r.set(e, [
+					...r.get(e) ?? [],
+					...l,
+					...d
+				]);
+				else if (c === "default" || u === "default") r.set(e, [
+					...r.get(e) ?? [],
+					...l,
+					...d
+				]);
+				else {
+					let t = `${e}-${o++}`;
+					r.set(t, l);
+					let n = `${e}-${o++}`;
+					r.set(n, d);
+				}
 			}
 		}
-		return e;
-	}, {}), "flattenAlignments"), [o, s] = t.map((t) => {
-		let n = {}, r = {};
-		return Object.entries(t).forEach(([t, [i, a]]) => {
-			let o = e.getNode(t)?.in ?? "default";
-			n[a] ??= {}, n[a][o] ??= [], n[a][o].push(t), r[i] ??= {}, r[i][o] ??= [], r[i][o].push(t);
+		return r;
+	}, "flattenAlignments"), [o, s] = t.map((t) => {
+		let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
+		return t.forEach(([t, i], a) => {
+			let o = e.getNode(a)?.in ?? "default", s = n.get(i) ?? /* @__PURE__ */ new Map();
+			n.has(i) || n.set(i, s);
+			let c = r.get(t) ?? /* @__PURE__ */ new Map();
+			r.has(t) || r.set(t, c);
+			for (let e of [s, c]) {
+				let t = e.get(o) ?? [];
+				e.has(o) || e.set(o, t), t.push(a);
+			}
 		}), {
-			horiz: Object.values(a(n, "horizontal")).filter((e) => e.length > 1),
-			vert: Object.values(a(r, "vertical")).filter((e) => e.length > 1)
+			horiz: [...a(n, "horizontal").values()].filter((e) => e.length > 1),
+			vert: [...a(r, "vertical").values()].filter((e) => e.length > 1)
 		};
 	}).reduce(([e, t], { horiz: n, vert: r }) => [[...e, ...n], [...t, ...r]], [[], []]), c = /* @__PURE__ */ new Set();
 	i.forEach((e) => e.members.forEach((e) => c.add(e)));
@@ -3907,8 +3933,8 @@ function fe(e, t, n, i = []) {
 		vertical: d
 	};
 }
-r(fe, "getAlignments");
-function pe(e, t, n = []) {
+r(me, "getAlignments");
+function he(e, t, n = []) {
 	let i = [], a = t.getConfigField("iconSize"), o = t.getConfigField("idealEdgeLengthMultiplier"), s = o * a, c = /* @__PURE__ */ new Set();
 	n.forEach((e) => {
 		for (let t = 0; t < e.members.length - 1; t++) {
@@ -3926,7 +3952,7 @@ function pe(e, t, n = []) {
 	});
 	let l = /* @__PURE__ */ r((e) => `${e[0]},${e[1]}`, "posToStr"), u = /* @__PURE__ */ r((e) => e.split(",").map((e) => parseInt(e)), "strToPos");
 	return e.forEach((e) => {
-		let t = Object.fromEntries(Object.entries(e).map(([e, t]) => [l(t), e])), n = [l([0, 0])], r = {}, s = {
+		let t = new Map([...e.entries()].map(([e, t]) => [l(t), e])), n = [l([0, 0])], r = {}, s = {
 			L: [-1, 0],
 			R: [1, 0],
 			T: [0, 1],
@@ -3936,11 +3962,11 @@ function pe(e, t, n = []) {
 			let e = n.shift();
 			if (e) {
 				r[e] = 1;
-				let d = t[e];
+				let d = t.get(e);
 				if (d) {
 					let f = u(e);
 					Object.entries(s).forEach(([e, s]) => {
-						let u = l([f[0] + s[0], f[1] + s[1]]), p = t[u];
+						let u = l([f[0] + s[0], f[1] + s[1]]), p = t.get(u);
 						if (p && !r[u]) {
 							if (n.push(u), c.has(`${d}|${p}`)) return;
 							i.push({
@@ -3955,8 +3981,8 @@ function pe(e, t, n = []) {
 		}
 	}), i;
 }
-r(pe, "getRelativeConstraints");
-function me(e, t, n, o, s, { spatialMaps: c, groupAlignments: l }) {
+r(he, "getRelativeConstraints");
+function ge(e, t, n, o, s, { spatialMaps: c, groupAlignments: l }) {
 	return new Promise((u) => {
 		let d = a("body").append("div").attr("id", "cy").attr("style", "display:none"), f = E({
 			container: document.getElementById("cy"),
@@ -4026,8 +4052,8 @@ function me(e, t, n, o, s, { spatialMaps: c, groupAlignments: l }) {
 				}
 			}
 		});
-		d.remove(), ue(n, f), se(e, f, s), ce(t, f, s), de(o, f);
-		let p = s.getLayoutHints(), m = fe(s, c, l, p), h = pe(c, s, p), g = s.getConfigField("iconSize"), _ = s.getConfigField("idealEdgeLengthMultiplier") * g, v = .5 * g, y = s.getConfigField("edgeElasticity"), b = s.getConfigField("seed"), x = f.layout({
+		d.remove(), fe(n, f), le(e, f, s), ue(t, f, s), pe(o, f);
+		let p = s.getLayoutHints(), m = me(s, c, l, p), h = he(c, s, p), g = s.getConfigField("iconSize"), _ = s.getConfigField("idealEdgeLengthMultiplier") * g, v = .5 * g, y = s.getConfigField("edgeElasticity"), b = s.getConfigField("seed"), x = f.layout({
 			name: "fcose",
 			quality: "proof",
 			randomize: s.getConfigField("randomize"),
@@ -4037,11 +4063,11 @@ function me(e, t, n, o, s, { spatialMaps: c, groupAlignments: l }) {
 			animate: !1,
 			nodeDimensionsIncludeLabels: !1,
 			idealEdgeLength(e) {
-				let [t, n] = e.connectedNodes(), { parent: r } = U(t), { parent: i } = U(n);
+				let [t, n] = e.connectedNodes(), { parent: r } = W(t), { parent: i } = W(n);
 				return r === i ? _ : v;
 			},
 			edgeElasticity(e) {
-				let [t, n] = e.connectedNodes(), { parent: r } = U(t), { parent: i } = U(n);
+				let [t, n] = e.connectedNodes(), { parent: r } = W(t), { parent: i } = W(n);
 				return r === i ? y : .001;
 			},
 			alignmentConstraint: m,
@@ -4080,7 +4106,7 @@ function me(e, t, n, o, s, { spatialMaps: c, groupAlignments: l }) {
 			for (let t of Object.values(f.edges())) if (t.data?.()) {
 				let { x: n, y: r } = t.source().position(), { x: i, y: a } = t.target().position();
 				if (n !== i && r !== a) {
-					let n = t.sourceEndpoint(), r = t.targetEndpoint(), { sourceDir: i } = re(t), [a, o] = I(i) ? [n.x, r.y] : [r.x, n.y], { weights: s, distances: c } = e(n, r, a, o);
+					let n = t.sourceEndpoint(), r = t.targetEndpoint(), { sourceDir: i } = U(t), [a, o] = I(i) ? [n.x, r.y] : [r.x, n.y], { weights: s, distances: c } = e(n, r, a, o);
 					t.style("segment-distances", c), t.style("segment-weights", s);
 				}
 			}
@@ -4096,11 +4122,11 @@ function me(e, t, n, o, s, { spatialMaps: c, groupAlignments: l }) {
 		});
 	});
 }
-r(me, "layoutArchitecture");
-var he = {
-	parser: K,
+r(ge, "layoutArchitecture");
+var _e = {
+	parser: q,
 	get db() {
-		return new G();
+		return new ie();
 	},
 	renderer: { draw: /* @__PURE__ */ r(async (e, t, n, r) => {
 		let i = r.db;
@@ -4110,11 +4136,11 @@ var he = {
 		let p = d.append("g");
 		p.attr("class", "architecture-services");
 		let m = d.append("g");
-		m.attr("class", "architecture-groups"), await Q(i, p, a, t), oe(i, p, o, t);
-		let h = await me(a, o, c, l, i, u);
-		await Z(f, h, i, t), await ae(m, h, i, t), le(i, h), s(void 0, d, i.getConfigField("padding"), i.getConfigField("useMaxWidth"));
+		m.attr("class", "architecture-groups"), await se(i, p, a, t), ce(i, p, o, t);
+		let h = await ge(a, o, c, l, i, u);
+		await oe(f, h, i, t), await Z(m, h, i, t), de(i, h), s(void 0, d, i.getConfigField("padding"), i.getConfigField("useMaxWidth"));
 	}, "draw") },
-	styles: q
+	styles: ae
 };
 //#endregion
-export { he as diagram };
+export { _e as diagram };