mio-previewer 0.2.74 → 0.2.77

package/dist/dagre-6UL2VRFP-3bgUxzqG.js

@@ -0,0 +1,294 @@
+import { g as e, h as t } from "./src-BuisGndr.js";
+import { b as n } from "./chunk-ABZYJK2D-DDrmE3Q7.js";
+import "./chunk-S3R3BYOJ-CG6GoSCd.js";
+import "./chunk-HN2XXSSU-CJL8wAZ2.js";
+import { t as r } from "./chunk-CVBHYZKI-CiCGetln.js";
+import "./chunk-ATLVNIR6-DHlCNWnJ.js";
+import "./chunk-JA3XYJ7Z-CpKHrbOX.js";
+import { a as i, c as a, i as o, l as s, n as c, t as l, u } from "./chunk-JZLCHNYA-CYo7ykJf.js";
+import { a as d, i as f, n as p, r as m, t as h } from "./chunk-QXUST7PY-CxCAwQqP.js";
+import { r as g } from "./_baseUniq-CGoiOkSa.js";
+import { s as _ } from "./_basePickBy-CXmXW7jd.js";
+import { t as v } from "./dagre-BfAHSwtP.js";
+import { t as y } from "./clone-B0KDIkSS.js";
+import { t as b } from "./graphlib-C3tPLMbC.js";
+//#region node_modules/.pnpm/dagre-d3-es@7.0.11/node_modules/dagre-d3-es/src/graphlib/json.js
+function x(e) {
+	var t = {
+		options: {
+			directed: e.isDirected(),
+			multigraph: e.isMultigraph(),
+			compound: e.isCompound()
+		},
+		nodes: S(e),
+		edges: C(e)
+	};
+	return g(e.graph()) || (t.value = y(e.graph())), t;
+}
+function S(e) {
+	return _(e.nodes(), function(t) {
+		var n = e.node(t), r = e.parent(t), i = { v: t };
+		return g(n) || (i.value = n), g(r) || (i.parent = r), i;
+	});
+}
+function C(e) {
+	return _(e.edges(), function(t) {
+		var n = e.edge(t), r = {
+			v: t.v,
+			w: t.w
+		};
+		return g(t.name) || (r.name = t.name), g(n) || (r.value = n), r;
+	});
+}
+//#endregion
+//#region node_modules/.pnpm/mermaid@11.12.0/node_modules/mermaid/dist/chunks/mermaid.core/dagre-6UL2VRFP.mjs
+var w = /* @__PURE__ */ new Map(), T = /* @__PURE__ */ new Map(), E = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ t(() => {
+	T.clear(), E.clear(), w.clear();
+}, "clear"), O = /* @__PURE__ */ t((t, n) => {
+	let r = T.get(n) || [];
+	return e.trace("In isDescendant", n, " ", t, " = ", r.includes(t)), r.includes(t);
+}, "isDescendant"), k = /* @__PURE__ */ t((t, n) => {
+	let r = T.get(n) || [];
+	return e.info("Descendants of ", n, " is ", r), e.info("Edge is ", t), t.v === n || t.w === n ? !1 : r ? r.includes(t.v) || O(t.v, n) || O(t.w, n) || r.includes(t.w) : (e.debug("Tilt, ", n, ",not in descendants"), !1);
+}, "edgeInCluster"), A = /* @__PURE__ */ t((t, n, r, i) => {
+	e.warn("Copying children of ", t, "root", i, "data", n.node(t), i);
+	let a = n.children(t) || [];
+	t !== i && a.push(t), e.warn("Copying (nodes) clusterId", t, "nodes", a), a.forEach((a) => {
+		if (n.children(a).length > 0) A(a, n, r, i);
+		else {
+			let o = n.node(a);
+			e.info("cp ", a, " to ", i, " with parent ", t), r.setNode(a, o), i !== n.parent(a) && (e.warn("Setting parent", a, n.parent(a)), r.setParent(a, n.parent(a))), t !== i && a !== t ? (e.debug("Setting parent", a, t), r.setParent(a, t)) : (e.info("In copy ", t, "root", i, "data", n.node(t), i), e.debug("Not Setting parent for node=", a, "cluster!==rootId", t !== i, "node!==clusterId", a !== t));
+			let s = n.edges(a);
+			e.debug("Copying Edges", s), s.forEach((a) => {
+				e.info("Edge", a);
+				let o = n.edge(a.v, a.w, a.name);
+				e.info("Edge data", o, i);
+				try {
+					k(a, i) ? (e.info("Copying as ", a.v, a.w, o, a.name), r.setEdge(a.v, a.w, o, a.name), e.info("newGraph edges ", r.edges(), r.edge(r.edges()[0]))) : e.info("Skipping copy of edge ", a.v, "-->", a.w, " rootId: ", i, " clusterId:", t);
+				} catch (t) {
+					e.error(t);
+				}
+			});
+		}
+		e.debug("Removing node", a), n.removeNode(a);
+	});
+}, "copy"), j = /* @__PURE__ */ t((e, t) => {
+	let n = t.children(e), r = [...n];
+	for (let i of n) E.set(i, e), r = [...r, ...j(i, t)];
+	return r;
+}, "extractDescendants"), M = /* @__PURE__ */ t((e, t, n) => {
+	let r = e.edges().filter((e) => e.v === t || e.w === t), i = e.edges().filter((e) => e.v === n || e.w === n), a = r.map((e) => ({
+		v: e.v === t ? n : e.v,
+		w: e.w === t ? t : e.w
+	})), o = i.map((e) => ({
+		v: e.v,
+		w: e.w
+	}));
+	return a.filter((e) => o.some((t) => e.v === t.v && e.w === t.w));
+}, "findCommonEdges"), N = /* @__PURE__ */ t((t, n, r) => {
+	let i = n.children(t);
+	if (e.trace("Searching children of id ", t, i), i.length < 1) return t;
+	let a;
+	for (let e of i) {
+		let t = N(e, n, r), i = M(n, r, t);
+		if (t) if (i.length > 0) a = t;
+		else return t;
+	}
+	return a;
+}, "findNonClusterChild"), P = /* @__PURE__ */ t((e) => !w.has(e) || !w.get(e).externalConnections ? e : w.has(e) ? w.get(e).id : e, "getAnchorId"), F = /* @__PURE__ */ t((t, n) => {
+	if (!t || n > 10) {
+		e.debug("Opting out, no graph ");
+		return;
+	} else e.debug("Opting in, graph ");
+	t.nodes().forEach(function(n) {
+		t.children(n).length > 0 && (e.warn("Cluster identified", n, " Replacement id in edges: ", N(n, t, n)), T.set(n, j(n, t)), w.set(n, {
+			id: N(n, t, n),
+			clusterData: t.node(n)
+		}));
+	}), t.nodes().forEach(function(n) {
+		let r = t.children(n), i = t.edges();
+		r.length > 0 ? (e.debug("Cluster identified", n, T), i.forEach((t) => {
+			O(t.v, n) ^ O(t.w, n) && (e.warn("Edge: ", t, " leaves cluster ", n), e.warn("Descendants of XXX ", n, ": ", T.get(n)), w.get(n).externalConnections = !0);
+		})) : e.debug("Not a cluster ", n, T);
+	});
+	for (let e of w.keys()) {
+		let n = w.get(e).id, r = t.parent(n);
+		r !== e && w.has(r) && !w.get(r).externalConnections && (w.get(e).id = r);
+	}
+	t.edges().forEach(function(n) {
+		let r = t.edge(n);
+		e.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), e.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(t.edge(n)));
+		let i = n.v, a = n.w;
+		if (e.warn("Fix XXX", w, "ids:", n.v, n.w, "Translating: ", w.get(n.v), " --- ", w.get(n.w)), w.get(n.v) || w.get(n.w)) {
+			if (e.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), i = P(n.v), a = P(n.w), t.removeEdge(n.v, n.w, n.name), i !== n.v) {
+				let e = t.parent(i);
+				w.get(e).externalConnections = !0, r.fromCluster = n.v;
+			}
+			if (a !== n.w) {
+				let e = t.parent(a);
+				w.get(e).externalConnections = !0, r.toCluster = n.w;
+			}
+			e.warn("Fix Replacing with XXX", i, a, n.name), t.setEdge(i, a, r, n.name);
+		}
+	}), e.warn("Adjusted Graph", x(t)), I(t, 0), e.trace(w);
+}, "adjustClustersAndEdges"), I = /* @__PURE__ */ t((t, n) => {
+	if (e.warn("extractor - ", n, x(t), t.children("D")), n > 10) {
+		e.error("Bailing out");
+		return;
+	}
+	let r = t.nodes(), i = !1;
+	for (let e of r) {
+		let n = t.children(e);
+		i ||= n.length > 0;
+	}
+	if (!i) {
+		e.debug("Done, no node has children", t.nodes());
+		return;
+	}
+	e.debug("Nodes = ", r, n);
+	for (let i of r) if (e.debug("Extracting node", i, w, w.has(i) && !w.get(i).externalConnections, !t.parent(i), t.node(i), t.children("D"), " Depth ", n), !w.has(i)) e.debug("Not a cluster", i, n);
+	else if (!w.get(i).externalConnections && t.children(i) && t.children(i).length > 0) {
+		e.warn("Cluster without external connections, without a parent and with children", i, n);
+		let r = t.graph().rankdir === "TB" ? "LR" : "TB";
+		w.get(i)?.clusterData?.dir && (r = w.get(i).clusterData.dir, e.warn("Fixing dir", w.get(i).clusterData.dir, r));
+		let a = new b({
+			multigraph: !0,
+			compound: !0
+		}).setGraph({
+			rankdir: r,
+			nodesep: 50,
+			ranksep: 50,
+			marginx: 8,
+			marginy: 8
+		}).setDefaultEdgeLabel(function() {
+			return {};
+		});
+		e.warn("Old graph before copy", x(t)), A(i, t, a, i), t.setNode(i, {
+			clusterNode: !0,
+			id: i,
+			clusterData: w.get(i).clusterData,
+			label: w.get(i).label,
+			graph: a
+		}), e.warn("New graph after copy node: (", i, ")", x(a)), e.debug("Old graph after copy", x(t));
+	} else e.warn("Cluster ** ", i, " **not meeting the criteria !externalConnections:", !w.get(i).externalConnections, " no parent: ", !t.parent(i), " children ", t.children(i) && t.children(i).length > 0, t.children("D"), n), e.debug(w);
+	r = t.nodes(), e.warn("New list of nodes", r);
+	for (let i of r) {
+		let r = t.node(i);
+		e.warn(" Now next level", i, r), r?.clusterNode && I(r.graph, n + 1);
+	}
+}, "extractor"), L = /* @__PURE__ */ t((e, t) => {
+	if (t.length === 0) return [];
+	let n = Object.assign([], t);
+	return t.forEach((t) => {
+		let r = L(e, e.children(t));
+		n = [...n, ...r];
+	}), n;
+}, "sorter"), R = /* @__PURE__ */ t((e) => L(e, e.children()), "sortNodesByHierarchy"), z = /* @__PURE__ */ t(async (n, c, l, f, h, g) => {
+	e.warn("Graph in recursive render:XAX", x(c), h);
+	let _ = c.graph().rankdir;
+	e.trace("Dir in recursive render - dir:", _);
+	let y = n.insert("g").attr("class", "root");
+	c.nodes() ? e.info("Recursive render XXX", c.nodes()) : e.info("No nodes found for", c), c.edges().length > 0 && e.info("Recursive edges", c.edge(c.edges()[0]));
+	let b = y.insert("g").attr("class", "clusters"), S = y.insert("g").attr("class", "edgePaths"), C = y.insert("g").attr("class", "edgeLabels"), T = y.insert("g").attr("class", "nodes");
+	await Promise.all(c.nodes().map(async function(t) {
+		let n = c.node(t);
+		if (h !== void 0) {
+			let n = JSON.parse(JSON.stringify(h.clusterData));
+			e.trace("Setting data for parent cluster XXX\n Node.id = ", t, "\n data=", n.height, "\nParent cluster", h.height), c.setNode(h.id, n), c.parent(t) || (e.trace("Setting parent", t, h.id), c.setParent(t, h.id, n));
+		}
+		if (e.info("(Insert) Node XXX" + t + ": " + JSON.stringify(c.node(t))), n?.clusterNode) {
+			e.info("Cluster identified XBX", t, n.width, c.node(t));
+			let { ranksep: r, nodesep: i } = c.graph();
+			n.graph.setGraph({
+				...n.graph.graph(),
+				ranksep: r + 25,
+				nodesep: i
+			});
+			let a = await z(T, n.graph, l, f, c.node(t), g), o = a.elem;
+			u(n, o), n.diff = a.diff || 0, e.info("New compound node after recursive render XAX", t, "width", n.width, "height", n.height), s(o, n);
+		} else c.children(t).length > 0 ? (e.trace("Cluster - the non recursive path XBX", t, n.id, n, n.width, "Graph:", c), e.trace(N(n.id, c)), w.set(n.id, {
+			id: N(n.id, c),
+			node: n
+		})) : (e.trace("Node - the non recursive path XAX", t, T, c.node(t), _), await i(T, c.node(t), {
+			config: g,
+			dir: _
+		}));
+	})), await (/* @__PURE__ */ t(async () => {
+		let t = c.edges().map(async function(t) {
+			let n = c.edge(t.v, t.w, t.name);
+			e.info("Edge " + t.v + " -> " + t.w + ": " + JSON.stringify(t)), e.info("Edge " + t.v + " -> " + t.w + ": ", t, " ", JSON.stringify(c.edge(t))), e.info("Fix", w, "ids:", t.v, t.w, "Translating: ", w.get(t.v), w.get(t.w)), await m(C, n);
+		});
+		await Promise.all(t);
+	}, "processEdges"))(), e.info("Graph before layout:", JSON.stringify(x(c))), e.info("############################################# XXX"), e.info("###                Layout                 ### XXX"), e.info("############################################# XXX"), v(c), e.info("Graph after layout:", JSON.stringify(x(c)));
+	let E = 0, { subGraphTitleTotalMargin: D } = r(g);
+	return await Promise.all(R(c).map(async function(t) {
+		let n = c.node(t);
+		if (e.info("Position XBX => " + t + ": (" + n.x, "," + n.y, ") width: ", n.width, " height: ", n.height), n?.clusterNode) n.y += D, e.info("A tainted cluster node XBX1", t, n.id, n.width, n.height, n.x, n.y, c.parent(t)), w.get(n.id).node = n, a(n);
+		else if (c.children(t).length > 0) {
+			e.info("A pure cluster node XBX1", t, n.id, n.x, n.y, n.width, n.height, c.parent(t)), n.height += D, c.node(n.parentId);
+			let r = n?.padding / 2 || 0, i = n?.labelBBox?.height || 0, a = i - r || 0;
+			e.debug("OffsetY", a, "labelHeight", i, "halfPadding", r), await o(b, n), w.get(n.id).node = n;
+		} else {
+			let t = c.node(n.parentId);
+			n.y += D / 2, e.info("A regular node XBX1 - using the padding", n.id, "parent", n.parentId, n.width, n.height, n.x, n.y, "offsetY", n.offsetY, "parent", t, t?.offsetY, n), a(n);
+		}
+	})), c.edges().forEach(function(t) {
+		let n = c.edge(t);
+		e.info("Edge " + t.v + " -> " + t.w + ": " + JSON.stringify(n), n), n.points.forEach((e) => e.y += D / 2), d(n, p(S, n, w, l, c.node(t.v), c.node(t.w), f));
+	}), c.nodes().forEach(function(t) {
+		let n = c.node(t);
+		e.info(t, n.type, n.diff), n.isGroup && (E = n.diff);
+	}), e.warn("Returning from recursive render XAX", y, E), {
+		elem: y,
+		diff: E
+	};
+}, "recursiveRender"), B = /* @__PURE__ */ t(async (t, r) => {
+	let i = new b({
+		multigraph: !0,
+		compound: !0
+	}).setGraph({
+		rankdir: t.direction,
+		nodesep: t.config?.nodeSpacing || t.config?.flowchart?.nodeSpacing || t.nodeSpacing,
+		ranksep: t.config?.rankSpacing || t.config?.flowchart?.rankSpacing || t.rankSpacing,
+		marginx: 8,
+		marginy: 8
+	}).setDefaultEdgeLabel(function() {
+		return {};
+	}), a = r.select("g");
+	f(a, t.markers, t.type, t.diagramId), c(), h(), l(), D(), t.nodes.forEach((e) => {
+		i.setNode(e.id, { ...e }), e.parentId && i.setParent(e.id, e.parentId);
+	}), e.debug("Edges:", t.edges), t.edges.forEach((e) => {
+		if (e.start === e.end) {
+			let t = e.start, n = t + "---" + t + "---1", r = t + "---" + t + "---2", a = i.node(t);
+			i.setNode(n, {
+				domId: n,
+				id: n,
+				parentId: a.parentId,
+				labelStyle: "",
+				label: "",
+				padding: 0,
+				shape: "labelRect",
+				style: "",
+				width: 10,
+				height: 10
+			}), i.setParent(n, a.parentId), i.setNode(r, {
+				domId: r,
+				id: r,
+				parentId: a.parentId,
+				labelStyle: "",
+				padding: 0,
+				shape: "labelRect",
+				label: "",
+				style: "",
+				width: 10,
+				height: 10
+			}), i.setParent(r, a.parentId);
+			let o = structuredClone(e), s = structuredClone(e), c = structuredClone(e);
+			o.label = "", o.arrowTypeEnd = "none", o.id = t + "-cyclic-special-1", s.arrowTypeStart = "none", s.arrowTypeEnd = "none", s.id = t + "-cyclic-special-mid", c.label = "", a.isGroup && (o.fromCluster = t, c.toCluster = t), c.id = t + "-cyclic-special-2", c.arrowTypeStart = "none", i.setEdge(t, n, o, t + "-cyclic-special-0"), i.setEdge(n, r, s, t + "-cyclic-special-1"), i.setEdge(r, t, c, t + "-cyc<lic-special-2");
+		} else i.setEdge(e.start, e.end, { ...e }, e.id);
+	}), e.warn("Graph at first:", JSON.stringify(x(i))), F(i), e.warn("Graph after XAX:", JSON.stringify(x(i)));
+	let o = n();
+	await z(a, i, t.type, t.diagramId, void 0, o);
+}, "render");
+//#endregion
+export { B as render };

package/dist/dagre-6UL2VRFP-B3NqmIxs.cjs

@@ -0,0 +1,4 @@
+const e=require("./src-BMjps4Ui.cjs"),t=require("./chunk-ABZYJK2D-CbIYYZa_.cjs");require("./chunk-S3R3BYOJ-B2ozcJNg.cjs"),require("./chunk-HN2XXSSU-BwmRMa2r.cjs");const n=require("./chunk-CVBHYZKI-CLVcv_xh.cjs");require("./chunk-ATLVNIR6-shAOudT0.cjs"),require("./chunk-JA3XYJ7Z-BaAdjYEy.cjs");const r=require("./chunk-JZLCHNYA-CvPIQFXP.cjs"),i=require("./chunk-QXUST7PY-CnnfdJrM.cjs"),a=require("./_baseUniq-CYtOXxfV.cjs"),o=require("./_basePickBy-CtuVwROD.cjs"),s=require("./dagre-Buvkww-e.cjs"),c=require("./clone-wvtBTB6v.cjs"),l=require("./graphlib-Cdg0u3TT.cjs");function u(e){var t={options:{directed:e.isDirected(),multigraph:e.isMultigraph(),compound:e.isCompound()},nodes:d(e),edges:f(e)};return a.r(e.graph())||(t.value=c.t(e.graph())),t}function d(e){return o.s(e.nodes(),function(t){var n=e.node(t),r=e.parent(t),i={v:t};return a.r(n)||(i.value=n),a.r(r)||(i.parent=r),i})}function f(e){return o.s(e.edges(),function(t){var n=e.edge(t),r={v:t.v,w:t.w};return a.r(t.name)||(r.name=t.name),a.r(n)||(r.value=n),r})}var p=new Map,m=new Map,h=new Map,g=e.h(()=>{m.clear(),h.clear(),p.clear()},`clear`),_=e.h((t,n)=>{let r=m.get(n)||[];return e.g.trace(`In isDescendant`,n,` `,t,` = `,r.includes(t)),r.includes(t)},`isDescendant`),v=e.h((t,n)=>{let r=m.get(n)||[];return e.g.info(`Descendants of `,n,` is `,r),e.g.info(`Edge is `,t),t.v===n||t.w===n?!1:r?r.includes(t.v)||_(t.v,n)||_(t.w,n)||r.includes(t.w):(e.g.debug(`Tilt, `,n,`,not in descendants`),!1)},`edgeInCluster`),y=e.h((t,n,r,i)=>{e.g.warn(`Copying children of `,t,`root`,i,`data`,n.node(t),i);let a=n.children(t)||[];t!==i&&a.push(t),e.g.warn(`Copying (nodes) clusterId`,t,`nodes`,a),a.forEach(a=>{if(n.children(a).length>0)y(a,n,r,i);else{let o=n.node(a);e.g.info(`cp `,a,` to `,i,` with parent `,t),r.setNode(a,o),i!==n.parent(a)&&(e.g.warn(`Setting parent`,a,n.parent(a)),r.setParent(a,n.parent(a))),t!==i&&a!==t?(e.g.debug(`Setting parent`,a,t),r.setParent(a,t)):(e.g.info(`In copy `,t,`root`,i,`data`,n.node(t),i),e.g.debug(`Not Setting parent for node=`,a,`cluster!==rootId`,t!==i,`node!==clusterId`,a!==t));let s=n.edges(a);e.g.debug(`Copying Edges`,s),s.forEach(a=>{e.g.info(`Edge`,a);let o=n.edge(a.v,a.w,a.name);e.g.info(`Edge data`,o,i);try{v(a,i)?(e.g.info(`Copying as `,a.v,a.w,o,a.name),r.setEdge(a.v,a.w,o,a.name),e.g.info(`newGraph edges `,r.edges(),r.edge(r.edges()[0]))):e.g.info(`Skipping copy of edge `,a.v,`-->`,a.w,` rootId: `,i,` clusterId:`,t)}catch(t){e.g.error(t)}})}e.g.debug(`Removing node`,a),n.removeNode(a)})},`copy`),b=e.h((e,t)=>{let n=t.children(e),r=[...n];for(let i of n)h.set(i,e),r=[...r,...b(i,t)];return r},`extractDescendants`),x=e.h((e,t,n)=>{let r=e.edges().filter(e=>e.v===t||e.w===t),i=e.edges().filter(e=>e.v===n||e.w===n),a=r.map(e=>({v:e.v===t?n:e.v,w:e.w===t?t:e.w})),o=i.map(e=>({v:e.v,w:e.w}));return a.filter(e=>o.some(t=>e.v===t.v&&e.w===t.w))},`findCommonEdges`),S=e.h((t,n,r)=>{let i=n.children(t);if(e.g.trace(`Searching children of id `,t,i),i.length<1)return t;let a;for(let e of i){let t=S(e,n,r),i=x(n,r,t);if(t)if(i.length>0)a=t;else return t}return a},`findNonClusterChild`),C=e.h(e=>!p.has(e)||!p.get(e).externalConnections?e:p.has(e)?p.get(e).id:e,`getAnchorId`),w=e.h((t,n)=>{if(!t||n>10){e.g.debug(`Opting out, no graph `);return}else e.g.debug(`Opting in, graph `);t.nodes().forEach(function(n){t.children(n).length>0&&(e.g.warn(`Cluster identified`,n,` Replacement id in edges: `,S(n,t,n)),m.set(n,b(n,t)),p.set(n,{id:S(n,t,n),clusterData:t.node(n)}))}),t.nodes().forEach(function(n){let r=t.children(n),i=t.edges();r.length>0?(e.g.debug(`Cluster identified`,n,m),i.forEach(t=>{_(t.v,n)^_(t.w,n)&&(e.g.warn(`Edge: `,t,` leaves cluster `,n),e.g.warn(`Descendants of XXX `,n,`: `,m.get(n)),p.get(n).externalConnections=!0)})):e.g.debug(`Not a cluster `,n,m)});for(let e of p.keys()){let n=p.get(e).id,r=t.parent(n);r!==e&&p.has(r)&&!p.get(r).externalConnections&&(p.get(e).id=r)}t.edges().forEach(function(n){let r=t.edge(n);e.g.warn(`Edge `+n.v+` -> `+n.w+`: `+JSON.stringify(n)),e.g.warn(`Edge `+n.v+` -> `+n.w+`: `+JSON.stringify(t.edge(n)));let i=n.v,a=n.w;if(e.g.warn(`Fix XXX`,p,`ids:`,n.v,n.w,`Translating: `,p.get(n.v),` --- `,p.get(n.w)),p.get(n.v)||p.get(n.w)){if(e.g.warn(`Fixing and trying - removing XXX`,n.v,n.w,n.name),i=C(n.v),a=C(n.w),t.removeEdge(n.v,n.w,n.name),i!==n.v){let e=t.parent(i);p.get(e).externalConnections=!0,r.fromCluster=n.v}if(a!==n.w){let e=t.parent(a);p.get(e).externalConnections=!0,r.toCluster=n.w}e.g.warn(`Fix Replacing with XXX`,i,a,n.name),t.setEdge(i,a,r,n.name)}}),e.g.warn(`Adjusted Graph`,u(t)),T(t,0),e.g.trace(p)},`adjustClustersAndEdges`),T=e.h((t,n)=>{if(e.g.warn(`extractor - `,n,u(t),t.children(`D`)),n>10){e.g.error(`Bailing out`);return}let r=t.nodes(),i=!1;for(let e of r){let n=t.children(e);i||=n.length>0}if(!i){e.g.debug(`Done, no node has children`,t.nodes());return}e.g.debug(`Nodes = `,r,n);for(let i of r)if(e.g.debug(`Extracting node`,i,p,p.has(i)&&!p.get(i).externalConnections,!t.parent(i),t.node(i),t.children(`D`),` Depth `,n),!p.has(i))e.g.debug(`Not a cluster`,i,n);else if(!p.get(i).externalConnections&&t.children(i)&&t.children(i).length>0){e.g.warn(`Cluster without external connections, without a parent and with children`,i,n);let r=t.graph().rankdir===`TB`?`LR`:`TB`;p.get(i)?.clusterData?.dir&&(r=p.get(i).clusterData.dir,e.g.warn(`Fixing dir`,p.get(i).clusterData.dir,r));let a=new l.t({multigraph:!0,compound:!0}).setGraph({rankdir:r,nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}});e.g.warn(`Old graph before copy`,u(t)),y(i,t,a,i),t.setNode(i,{clusterNode:!0,id:i,clusterData:p.get(i).clusterData,label:p.get(i).label,graph:a}),e.g.warn(`New graph after copy node: (`,i,`)`,u(a)),e.g.debug(`Old graph after copy`,u(t))}else e.g.warn(`Cluster ** `,i,` **not meeting the criteria !externalConnections:`,!p.get(i).externalConnections,` no parent: `,!t.parent(i),` children `,t.children(i)&&t.children(i).length>0,t.children(`D`),n),e.g.debug(p);r=t.nodes(),e.g.warn(`New list of nodes`,r);for(let i of r){let r=t.node(i);e.g.warn(` Now next level`,i,r),r?.clusterNode&&T(r.graph,n+1)}},`extractor`),E=e.h((e,t)=>{if(t.length===0)return[];let n=Object.assign([],t);return t.forEach(t=>{let r=E(e,e.children(t));n=[...n,...r]}),n},`sorter`),D=e.h(e=>E(e,e.children()),`sortNodesByHierarchy`),O=e.h(async(t,a,o,c,l,d)=>{e.g.warn(`Graph in recursive render:XAX`,u(a),l);let f=a.graph().rankdir;e.g.trace(`Dir in recursive render - dir:`,f);let m=t.insert(`g`).attr(`class`,`root`);a.nodes()?e.g.info(`Recursive render XXX`,a.nodes()):e.g.info(`No nodes found for`,a),a.edges().length>0&&e.g.info(`Recursive edges`,a.edge(a.edges()[0]));let h=m.insert(`g`).attr(`class`,`clusters`),g=m.insert(`g`).attr(`class`,`edgePaths`),_=m.insert(`g`).attr(`class`,`edgeLabels`),v=m.insert(`g`).attr(`class`,`nodes`);await Promise.all(a.nodes().map(async function(t){let n=a.node(t);if(l!==void 0){let n=JSON.parse(JSON.stringify(l.clusterData));e.g.trace(`Setting data for parent cluster XXX
+ Node.id = `,t,`
+ data=`,n.height,`
+Parent cluster`,l.height),a.setNode(l.id,n),a.parent(t)||(e.g.trace(`Setting parent`,t,l.id),a.setParent(t,l.id,n))}if(e.g.info(`(Insert) Node XXX`+t+`: `+JSON.stringify(a.node(t))),n?.clusterNode){e.g.info(`Cluster identified XBX`,t,n.width,a.node(t));let{ranksep:i,nodesep:s}=a.graph();n.graph.setGraph({...n.graph.graph(),ranksep:i+25,nodesep:s});let l=await O(v,n.graph,o,c,a.node(t),d),u=l.elem;r.u(n,u),n.diff=l.diff||0,e.g.info(`New compound node after recursive render XAX`,t,`width`,n.width,`height`,n.height),r.l(u,n)}else a.children(t).length>0?(e.g.trace(`Cluster - the non recursive path XBX`,t,n.id,n,n.width,`Graph:`,a),e.g.trace(S(n.id,a)),p.set(n.id,{id:S(n.id,a),node:n})):(e.g.trace(`Node - the non recursive path XAX`,t,v,a.node(t),f),await r.a(v,a.node(t),{config:d,dir:f}))})),await e.h(async()=>{let t=a.edges().map(async function(t){let n=a.edge(t.v,t.w,t.name);e.g.info(`Edge `+t.v+` -> `+t.w+`: `+JSON.stringify(t)),e.g.info(`Edge `+t.v+` -> `+t.w+`: `,t,` `,JSON.stringify(a.edge(t))),e.g.info(`Fix`,p,`ids:`,t.v,t.w,`Translating: `,p.get(t.v),p.get(t.w)),await i.r(_,n)});await Promise.all(t)},`processEdges`)(),e.g.info(`Graph before layout:`,JSON.stringify(u(a))),e.g.info(`############################################# XXX`),e.g.info(`###                Layout                 ### XXX`),e.g.info(`############################################# XXX`),s.t(a),e.g.info(`Graph after layout:`,JSON.stringify(u(a)));let y=0,{subGraphTitleTotalMargin:b}=n.t(d);return await Promise.all(D(a).map(async function(t){let n=a.node(t);if(e.g.info(`Position XBX => `+t+`: (`+n.x,`,`+n.y,`) width: `,n.width,` height: `,n.height),n?.clusterNode)n.y+=b,e.g.info(`A tainted cluster node XBX1`,t,n.id,n.width,n.height,n.x,n.y,a.parent(t)),p.get(n.id).node=n,r.c(n);else if(a.children(t).length>0){e.g.info(`A pure cluster node XBX1`,t,n.id,n.x,n.y,n.width,n.height,a.parent(t)),n.height+=b,a.node(n.parentId);let i=n?.padding/2||0,o=n?.labelBBox?.height||0,s=o-i||0;e.g.debug(`OffsetY`,s,`labelHeight`,o,`halfPadding`,i),await r.i(h,n),p.get(n.id).node=n}else{let t=a.node(n.parentId);n.y+=b/2,e.g.info(`A regular node XBX1 - using the padding`,n.id,`parent`,n.parentId,n.width,n.height,n.x,n.y,`offsetY`,n.offsetY,`parent`,t,t?.offsetY,n),r.c(n)}})),a.edges().forEach(function(t){let n=a.edge(t);e.g.info(`Edge `+t.v+` -> `+t.w+`: `+JSON.stringify(n),n),n.points.forEach(e=>e.y+=b/2),i.a(n,i.n(g,n,p,o,a.node(t.v),a.node(t.w),c))}),a.nodes().forEach(function(t){let n=a.node(t);e.g.info(t,n.type,n.diff),n.isGroup&&(y=n.diff)}),e.g.warn(`Returning from recursive render XAX`,m,y),{elem:m,diff:y}},`recursiveRender`),k=e.h(async(n,a)=>{let o=new l.t({multigraph:!0,compound:!0}).setGraph({rankdir:n.direction,nodesep:n.config?.nodeSpacing||n.config?.flowchart?.nodeSpacing||n.nodeSpacing,ranksep:n.config?.rankSpacing||n.config?.flowchart?.rankSpacing||n.rankSpacing,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}}),s=a.select(`g`);i.i(s,n.markers,n.type,n.diagramId),r.n(),i.t(),r.t(),g(),n.nodes.forEach(e=>{o.setNode(e.id,{...e}),e.parentId&&o.setParent(e.id,e.parentId)}),e.g.debug(`Edges:`,n.edges),n.edges.forEach(e=>{if(e.start===e.end){let t=e.start,n=t+`---`+t+`---1`,r=t+`---`+t+`---2`,i=o.node(t);o.setNode(n,{domId:n,id:n,parentId:i.parentId,labelStyle:``,label:``,padding:0,shape:`labelRect`,style:``,width:10,height:10}),o.setParent(n,i.parentId),o.setNode(r,{domId:r,id:r,parentId:i.parentId,labelStyle:``,padding:0,shape:`labelRect`,label:``,style:``,width:10,height:10}),o.setParent(r,i.parentId);let a=structuredClone(e),s=structuredClone(e),c=structuredClone(e);a.label=``,a.arrowTypeEnd=`none`,a.id=t+`-cyclic-special-1`,s.arrowTypeStart=`none`,s.arrowTypeEnd=`none`,s.id=t+`-cyclic-special-mid`,c.label=``,i.isGroup&&(a.fromCluster=t,c.toCluster=t),c.id=t+`-cyclic-special-2`,c.arrowTypeStart=`none`,o.setEdge(t,n,a,t+`-cyclic-special-0`),o.setEdge(n,r,s,t+`-cyclic-special-1`),o.setEdge(r,t,c,t+`-cyc<lic-special-2`)}else o.setEdge(e.start,e.end,{...e},e.id)}),e.g.warn(`Graph at first:`,JSON.stringify(u(o))),w(o),e.g.warn(`Graph after XAX:`,JSON.stringify(u(o)));let c=t.b();await O(s,o,n.type,n.diagramId,void 0,c)},`render`);exports.render=k;