@jackuait/blok 0.10.0-beta.6 → 0.10.0-beta.7

package/dist/chunks/dagre-KV5264BT-XbHSjleO.mjs

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