@antdv-next/x 1.0.2-beta.1 → 1.0.2-beta.2

package/es/dagre-KLK3FWXG-CEhXRLVR.js

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

package/{dist-browser/diagram-E7M64L7V-DxuJj8ZG.js → es/diagram-E7M64L7V-Dnd8N74o.js}

@@ -1,13 +1,13 @@
-import { g as e, h as t, p as n } from "./src-BukXhifV.js";
-import { r } from "./chunk-GEFDOKGD-P7WhyrTU.js";
-import { B as i, C as a, V as o, W as s, _ as c, a as l, c as u, d, v as f, y as p } from "./chunk-7R4GIKGN-DuTRhdsf.js";
+import { r as e } from "./chunk-GEFDOKGD-DM6dsEsk.js";
+import { g as t, h as n, p as r } from "./src-BH16DVv0.js";
+import { B as i, C as a, V as o, W as s, _ as c, a as l, c as u, d, v as f, y as p } from "./chunk-7R4GIKGN-B9vamSzt.js";
 import { t as m } from "./ordinal-D8PKtxfM.js";
 import { t as h } from "./defaultLocale-BaPFSbai.js";
-import { t as g } from "./chunk-HHEYEP7N-rv5s5WD4.js";
-import { t as _ } from "./chunk-4BX2VUAB-fLFD6XW0.js";
-import { t as v } from "./mermaid-parser.core-kTgpNO7M.js";
-import { t as y } from "./chunk-KX2RTZJC-pMHnNRQg.js";
-import { i as b, n as x } from "./chunk-PQ6SQG4A-CQ9Csv7s.js";
+import { t as g } from "./chunk-HHEYEP7N-FVfYw94p.js";
+import { t as _ } from "./chunk-4BX2VUAB-DUVpjbJi.js";
+import { t as v } from "./mermaid-parser.core-CWNEdmZ_.js";
+import { t as y } from "./chunk-KX2RTZJC-BGffjoxB.js";
+import { i as b, n as x } from "./chunk-PQ6SQG4A-DpwBx6Hx.js";
 //#region ../../node_modules/d3-hierarchy/src/hierarchy/count.js
 function S(e) {
 	var t = 0, n = e.children, r = n && n.length;
@@ -258,16 +258,16 @@ var Y = class {
 		this.nodes = [], this.levels = /* @__PURE__ */ new Map(), this.outerNodes = [], this.classes = /* @__PURE__ */ new Map(), this.setAccTitle = o, this.getAccTitle = f, this.setDiagramTitle = s, this.getDiagramTitle = a, this.getAccDescription = c, this.setAccDescription = i;
 	}
 	static {
-		t(this, "TreeMapDB");
+		n(this, "TreeMapDB");
 	}
 	getNodes() {
 		return this.nodes;
 	}
 	getConfig() {
-		let e = d, t = p();
-		return r({
-			...e.treemap,
-			...t.treemap ?? {}
+		let t = d, n = p();
+		return e({
+			...t.treemap,
+			...n.treemap ?? {}
 		});
 	}
 	addNode(e, t) {
@@ -319,15 +319,15 @@ function X(e) {
 		});
 	}), t;
 }
-t(X, "buildHierarchy");
-var ae = /* @__PURE__ */ t((e, n) => {
-	_(e, n);
+n(X, "buildHierarchy");
+var ae = /* @__PURE__ */ n((e, t) => {
+	_(e, t);
 	let r = [];
-	for (let t of e.TreemapRows ?? []) t.$type === "ClassDefStatement" && n.addClass(t.className ?? "", t.styleText ?? "");
-	for (let t of e.TreemapRows ?? []) {
-		let e = t.item;
+	for (let n of e.TreemapRows ?? []) n.$type === "ClassDefStatement" && t.addClass(n.className ?? "", n.styleText ?? "");
+	for (let n of e.TreemapRows ?? []) {
+		let e = n.item;
 		if (!e) continue;
-		let i = t.indent ? parseInt(t.indent) : 0, a = oe(e), o = e.classSelector ? n.getStylesForClass(e.classSelector) : [], s = o.length > 0 ? o : void 0, c = {
+		let i = n.indent ? parseInt(n.indent) : 0, a = oe(e), o = e.classSelector ? t.getStylesForClass(e.classSelector) : [], s = o.length > 0 ? o : void 0, c = {
 			level: i,
 			name: a,
 			type: e.$type,
@@ -337,25 +337,25 @@ var ae = /* @__PURE__ */ t((e, n) => {
 		};
 		r.push(c);
 	}
-	let i = X(r), a = /* @__PURE__ */ t((e, t) => {
-		for (let r of e) n.addNode(r, t), r.children && r.children.length > 0 && a(r.children, t + 1);
+	let i = X(r), a = /* @__PURE__ */ n((e, n) => {
+		for (let r of e) t.addNode(r, n), r.children && r.children.length > 0 && a(r.children, n + 1);
 	}, "addNodesRecursively");
 	a(i, 0);
-}, "populate"), oe = /* @__PURE__ */ t((e) => e.name ? String(e.name) : "", "getItemName"), Z = {
+}, "populate"), oe = /* @__PURE__ */ n((e) => e.name ? String(e.name) : "", "getItemName"), Z = {
 	parser: { yy: void 0 },
-	parse: /* @__PURE__ */ t(async (t) => {
+	parse: /* @__PURE__ */ n(async (e) => {
 		try {
-			let n = await v("treemap", t);
-			e.debug("Treemap AST:", n);
+			let n = await v("treemap", e);
+			t.debug("Treemap AST:", n);
 			let r = Z.parser?.yy;
 			if (!(r instanceof Y)) throw Error("parser.parser?.yy was not a TreemapDB. This is due to a bug within Mermaid, please report this issue at https://github.com/mermaid-js/mermaid/issues.");
 			ae(n, r);
-		} catch (t) {
-			throw e.error("Error parsing treemap:", t), t;
+		} catch (e) {
+			throw t.error("Error parsing treemap:", e), e;
 		}
 	}, "parse")
 }, se = 10, Q = 10, $ = 25, ce = {
-	draw: /* @__PURE__ */ t((r, i, a, o) => {
+	draw: /* @__PURE__ */ n((e, i, a, o) => {
 		let s = o.db, c = s.getConfig(), l = c.padding ?? se, d = s.getDiagramTitle(), f = s.getRoot(), { themeVariables: _ } = p();
 		if (!f) return;
 		let v = d ? 30 : 0, x = g(i), S = c.nodeWidth ? c.nodeWidth * Q : 960, C = c.nodeHeight ? c.nodeHeight * Q : 500, w = S, T = C + v;
@@ -363,16 +363,16 @@ var ae = /* @__PURE__ */ t((e, n) => {
 		let E;
 		try {
 			let e = c.valueFormat || ",";
-			if (e === "$0,0") E = /* @__PURE__ */ t((e) => "$" + h(",")(e), "valueFormat");
+			if (e === "$0,0") E = /* @__PURE__ */ n((e) => "$" + h(",")(e), "valueFormat");
 			else if (e.startsWith("$") && e.includes(",")) {
-				let n = /\.\d+/.exec(e), r = n ? n[0] : "";
-				E = /* @__PURE__ */ t((e) => "$" + h("," + r)(e), "valueFormat");
+				let t = /\.\d+/.exec(e), r = t ? t[0] : "";
+				E = /* @__PURE__ */ n((e) => "$" + h("," + r)(e), "valueFormat");
 			} else if (e.startsWith("$")) {
-				let n = e.substring(1);
-				E = /* @__PURE__ */ t((e) => "$" + h(n || "")(e), "valueFormat");
+				let t = e.substring(1);
+				E = /* @__PURE__ */ n((e) => "$" + h(t || "")(e), "valueFormat");
 			} else E = h(e);
-		} catch (t) {
-			e.error("Error creating format function:", t), E = h(",");
+		} catch (e) {
+			t.error("Error creating format function:", e), E = h(",");
 		}
 		let D = m().range([
 			"transparent",
@@ -424,15 +424,15 @@ var ae = /* @__PURE__ */ t((e, n) => {
 			return t.nodeStyles + ";" + t.borderStyles.join(";");
 		}), P.append("text").attr("class", "treemapSectionLabel").attr("x", 6).attr("y", $ / 2).attr("dominant-baseline", "middle").text((e) => e.depth === 0 ? "" : e.data.name).attr("font-weight", "bold").attr("style", (e) => e.depth === 0 ? "display: none;" : "dominant-baseline: middle; font-size: 12px; fill:" + k(e.data.name) + "; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;" + b({ cssCompiledStyles: e.data.cssCompiledStyles }).labelStyles.replace("color:", "fill:")).each(function(e) {
 			if (e.depth === 0) return;
-			let t = n(this), r = e.data.name;
-			t.text(r);
+			let t = r(this), n = e.data.name;
+			t.text(n);
 			let i = e.x1 - e.x0, a;
 			a = c.showValues !== !1 && e.value ? i - 10 - 30 - 10 - 6 : i - 6 - 6;
 			let o = Math.max(15, a), s = t.node();
 			if (s.getComputedTextLength() > o) {
-				let e = r;
+				let e = n;
 				for (; e.length > 0;) {
-					if (e = r.substring(0, e.length - 1), e.length === 0) {
+					if (e = n.substring(0, e.length - 1), e.length === 0) {
 						t.text("..."), s.getComputedTextLength() > o && t.text("");
 						break;
 					}
@@ -442,7 +442,7 @@ var ae = /* @__PURE__ */ t((e, n) => {
 		}), c.showValues !== !1 && P.append("text").attr("class", "treemapSectionValue").attr("x", (e) => e.x1 - e.x0 - 10).attr("y", $ / 2).attr("text-anchor", "end").attr("dominant-baseline", "middle").text((e) => e.value ? E(e.value) : "").attr("font-style", "italic").attr("style", (e) => e.depth === 0 ? "display: none;" : "text-anchor: end; dominant-baseline: middle; font-size: 10px; fill:" + k(e.data.name) + "; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;" + b({ cssCompiledStyles: e.data.cssCompiledStyles }).labelStyles.replace("color:", "fill:"));
 		let F = M.leaves(), I = A.selectAll(".treemapLeafGroup").data(F).enter().append("g").attr("class", (e, t) => `treemapNode treemapLeafGroup leaf${t}${e.data.classSelector ? ` ${e.data.classSelector}` : ""}x`).attr("transform", (e) => `translate(${e.x0},${e.y0})`);
 		I.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", (e) => e.y1 - e.y0).attr("class", "treemapLeaf").attr("fill", (e) => e.parent ? D(e.parent.data.name) : D(e.data.name)).attr("style", (e) => b({ cssCompiledStyles: e.data.cssCompiledStyles }).nodeStyles).attr("fill-opacity", .3).attr("stroke", (e) => e.parent ? D(e.parent.data.name) : D(e.data.name)).attr("stroke-width", 3), I.append("clipPath").attr("id", (e, t) => `clip-${i}-${t}`).append("rect").attr("width", (e) => Math.max(0, e.x1 - e.x0 - 4)).attr("height", (e) => Math.max(0, e.y1 - e.y0 - 4)), I.append("text").attr("class", "treemapLabel").attr("x", (e) => (e.x1 - e.x0) / 2).attr("y", (e) => (e.y1 - e.y0) / 2).attr("style", (e) => "text-anchor: middle; dominant-baseline: middle; font-size: 38px;fill:" + k(e.data.name) + ";" + b({ cssCompiledStyles: e.data.cssCompiledStyles }).labelStyles.replace("color:", "fill:")).attr("clip-path", (e, t) => `url(#clip-${i}-${t})`).text((e) => e.data.name).each(function(e) {
-			let t = n(this), r = e.x1 - e.x0, i = e.y1 - e.y0, a = t.node(), o = r - 8, s = i - 8;
+			let t = r(this), n = e.x1 - e.x0, i = e.y1 - e.y0, a = t.node(), o = n - 8, s = i - 8;
 			if (o < 10 || s < 10) {
 				t.style("display", "none");
 				return;
@@ -455,12 +455,12 @@ var ae = /* @__PURE__ */ t((e, n) => {
 		}), c.showValues !== !1 && I.append("text").attr("class", "treemapValue").attr("x", (e) => (e.x1 - e.x0) / 2).attr("y", function(e) {
 			return (e.y1 - e.y0) / 2;
 		}).attr("style", (e) => "text-anchor: middle; dominant-baseline: hanging; font-size: 28px;fill:" + k(e.data.name) + ";" + b({ cssCompiledStyles: e.data.cssCompiledStyles }).labelStyles.replace("color:", "fill:")).attr("clip-path", (e, t) => `url(#clip-${i}-${t})`).text((e) => e.value ? E(e.value) : "").each(function(e) {
-			let t = n(this), r = this.parentNode;
-			if (!r) {
+			let t = r(this), n = this.parentNode;
+			if (!n) {
 				t.style("display", "none");
 				return;
 			}
-			let i = n(r).select(".treemapLabel");
+			let i = r(n).select(".treemapLabel");
 			if (i.empty() || i.style("display") === "none") {
 				t.style("display", "none");
 				return;
@@ -473,7 +473,7 @@ var ae = /* @__PURE__ */ t((e, n) => {
 			t.node().getComputedTextLength() > u || s + o > l || o < 6 ? t.style("display", "none") : t.style("display", null);
 		}), y(x, c.diagramPadding ?? 8, "flowchart", c?.useMaxWidth || !1);
 	}, "draw"),
-	getClasses: /* @__PURE__ */ t(function(e, t) {
+	getClasses: /* @__PURE__ */ n(function(e, t) {
 		return t.db.getClasses();
 	}, "getClasses")
 }, le = {
@@ -495,30 +495,30 @@ var ae = /* @__PURE__ */ t((e, n) => {
 		return new Y();
 	},
 	renderer: ce,
-	styles: /* @__PURE__ */ t(({ treemap: e } = {}) => {
-		let t = r(le, e);
+	styles: /* @__PURE__ */ n(({ treemap: t } = {}) => {
+		let n = e(le, t);
 		return `
   .treemapNode.section {
-    stroke: ${t.sectionStrokeColor};
-    stroke-width: ${t.sectionStrokeWidth};
-    fill: ${t.sectionFillColor};
+    stroke: ${n.sectionStrokeColor};
+    stroke-width: ${n.sectionStrokeWidth};
+    fill: ${n.sectionFillColor};
   }
   .treemapNode.leaf {
-    stroke: ${t.leafStrokeColor};
-    stroke-width: ${t.leafStrokeWidth};
-    fill: ${t.leafFillColor};
+    stroke: ${n.leafStrokeColor};
+    stroke-width: ${n.leafStrokeWidth};
+    fill: ${n.leafFillColor};
   }
   .treemapLabel {
-    fill: ${t.labelColor};
-    font-size: ${t.labelFontSize};
+    fill: ${n.labelColor};
+    font-size: ${n.labelFontSize};
   }
   .treemapValue {
-    fill: ${t.valueColor};
-    font-size: ${t.valueFontSize};
+    fill: ${n.valueColor};
+    font-size: ${n.valueFontSize};
   }
   .treemapTitle {
-    fill: ${t.titleColor};
-    font-size: ${t.titleFontSize};
+    fill: ${n.titleColor};
+    font-size: ${n.titleFontSize};
   }
   `;
 	}, "getStyles")