@countermeasure-platform/web-components 1.2.1 → 1.2.2-dev.7.1

package/dist/dagre-KLK3FWXG-DTKcsol6.js

@@ -1,296 +0,0 @@
-import { r as e } from "./_baseUniq-Bdp_vFUv.js";
-import { s as t } from "./_basePickBy-BQMPE4-n.js";
-import { t as n } from "./dagre-BqC9mhMk.js";
-import "./chunk-GEFDOKGD-DGJJEGSm.js";
-import { t as r } from "./clone-CliVdNc8.js";
-import { t as i } from "./graphlib-ecencZTG.js";
-import { n as a, r as o } from "./src-BhNgmpel.js";
-import { b as s } from "./chunk-7R4GIKGN-DJmroLCH.js";
-import "./chunk-PU5JKC2W-DNpn_Yik.js";
-import "./chunk-MX3YWQON-D43mcq1f.js";
-import { n as c } from "./chunk-YBOYWFTD-DkjEOcgZ.js";
-import "./chunk-PQ6SQG4A-Cpfc5F4u.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-BXYCe83A.js";
-import { a as g, i as _, n as v, r as y, t as b } from "./chunk-O4XLMI2P-DtGEm9QX.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__ */ a(() => {
-	T.clear(), E.clear(), w.clear();
-}, "clear"), O = /* @__PURE__ */ a((e, t) => {
-	let n = T.get(t) || [];
-	return o.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
-}, "isDescendant"), k = /* @__PURE__ */ a((e, t) => {
-	let n = T.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) || O(e.v, t) || O(e.w, t) || n.includes(e.w) : (o.debug("Tilt, ", t, ",not in descendants"), !1);
-}, "edgeInCluster"), A = /* @__PURE__ */ a((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) A(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 {
-					k(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"), j = /* @__PURE__ */ a((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__ */ a((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__ */ a((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 = 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__ */ a((e) => !w.has(e) || !w.get(e).externalConnections ? e : w.has(e) ? w.get(e).id : e, "getAnchorId"), F = /* @__PURE__ */ a((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: ", 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 ? (o.debug("Cluster identified", t, T), r.forEach((e) => {
-			O(e.v, t) ^ O(e.w, t) && (o.warn("Edge: ", e, " leaves cluster ", t), o.warn("Descendants of XXX ", t, ": ", T.get(t)), w.get(t).externalConnections = !0);
-		})) : o.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);
-		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", w, "ids:", t.v, t.w, "Translating: ", w.get(t.v), " --- ", w.get(t.w)), w.get(t.v) || w.get(t.w)) {
-			if (o.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;
-			}
-			o.warn("Fix Replacing with XXX", r, i, t.name), e.setEdge(r, i, n, t.name);
-		}
-	}), o.warn("Adjusted Graph", x(e)), I(e, 0), o.trace(w);
-}, "adjustClustersAndEdges"), I = /* @__PURE__ */ a((e, t) => {
-	if (o.warn("extractor - ", t, x(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 ||= 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, w, w.has(r) && !w.get(r).externalConnections, !e.parent(r), e.node(r), e.children("D"), " Depth ", t), !w.has(r)) o.debug("Not a cluster", r, t);
-	else if (!w.get(r).externalConnections && e.children(r) && e.children(r).length > 0) {
-		o.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, o.warn("Fixing dir", w.get(r).clusterData.dir, n));
-		let a = new i({
-			multigraph: !0,
-			compound: !0
-		}).setGraph({
-			rankdir: n,
-			nodesep: 50,
-			ranksep: 50,
-			marginx: 8,
-			marginy: 8
-		}).setDefaultEdgeLabel(function() {
-			return {};
-		});
-		o.warn("Old graph before copy", x(e)), A(r, e, a, r), e.setNode(r, {
-			clusterNode: !0,
-			id: r,
-			clusterData: w.get(r).clusterData,
-			label: w.get(r).label,
-			graph: a
-		}), o.warn("New graph after copy node: (", r, ")", x(a)), o.debug("Old graph after copy", x(e));
-	} else o.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), o.debug(w);
-	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?.clusterNode && I(n.graph, t + 1);
-	}
-}, "extractor"), L = /* @__PURE__ */ a((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__ */ a((e) => L(e, e.children()), "sortNodesByHierarchy"), z = /* @__PURE__ */ a(async (e, t, r, i, s, p) => {
-	o.warn("Graph in recursive render:XAX", x(t), s);
-	let m = t.graph().rankdir;
-	o.trace("Dir in recursive render - dir:", m);
-	let _ = e.insert("g").attr("class", "root");
-	t.nodes() ? o.info("Recursive render XXX", t.nodes()) : o.info("No nodes found for", t), t.edges().length > 0 && o.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));
-			o.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) || (o.trace("Setting parent", e, s.id), t.setParent(e, s.id, n));
-		}
-		if (o.info("(Insert) Node XXX" + e + ": " + JSON.stringify(t.node(e))), n?.clusterNode) {
-			o.info("Cluster identified XBX", e, n.width, t.node(e));
-			let { ranksep: a, nodesep: s } = t.graph();
-			n.graph.setGraph({
-				...n.graph.graph(),
-				ranksep: a + 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, o.info("New compound node after recursive render XAX", e, "width", n.width, "height", n.height), f(l, n);
-		} else t.children(e).length > 0 ? (o.trace("Cluster - the non recursive path XBX", e, n.id, n, n.width, "Graph:", t), o.trace(N(n.id, t)), w.set(n.id, {
-			id: N(n.id, t),
-			node: n
-		})) : (o.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__ */ a(async () => {
-		let e = t.edges().map(async function(e) {
-			let n = t.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(t.edge(e))), o.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"))(), o.info("Graph before layout:", JSON.stringify(x(t))), o.info("############################################# XXX"), o.info("###                Layout                 ### XXX"), o.info("############################################# XXX"), n(t), o.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 (o.info("Position XBX => " + e + ": (" + n.x, "," + n.y, ") width: ", n.width, " height: ", n.height), n?.clusterNode) n.y += D, o.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) {
-			o.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, a = i - r || 0;
-			o.debug("OffsetY", a, "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, o.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);
-		o.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);
-		o.info(e, n.type, n.diff), n.isGroup && (E = n.diff);
-	}), o.warn("Returning from recursive render XAX", _, E), {
-		elem: _,
-		diff: E
-	};
-}, "recursiveRender"), B = /* @__PURE__ */ a(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);
-	}), o.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);
-	}), o.warn("Graph at first:", JSON.stringify(x(n))), F(n), o.warn("Graph after XAX:", JSON.stringify(x(n)));
-	let a = s();
-	await z(r, n, e.type, e.diagramId, void 0, a);
-}, "render");
-//#endregion
-export { B as render };
-
-//# sourceMappingURL=dagre-KLK3FWXG-DTKcsol6.js.map

package/dist/dagre-KLK3FWXG-DTKcsol6.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dagre-KLK3FWXG-DTKcsol6.js","names":["_.isUndefined","_.clone","_.map","graphlibJson.write","graphlib.Graph","graphlibJson2.write","graphlib2.Graph","getConfig"],"sources":["../node_modules/dagre-d3-es/src/graphlib/json.js","../node_modules/mermaid/dist/chunks/mermaid.core/dagre-KLK3FWXG.mjs"],"sourcesContent":["import * as _ from 'lodash-es';\nimport { Graph } from './graph.js';\n\n/**\n * @import { NodeID, EdgeObj, GraphOptions } from './graph.js';\n */\n\nexport { write, read };\n\n/**\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n *\n * @typedef {object} GraphJSON\n * @property {Required<GraphOptions>} options - The options used to create the graph.\n * @property {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} nodes - The nodes in the graph.\n * @property {Array<EdgeObj & { value?: EdgeLabel }>} edges - The edges in the graph.\n * @property {GraphLabel} [value] - The graph's value, if any.\n */\n\n/**\n * Creates a JSON representation of the graph that can be serialized to a\n * string with\n * [JSON.stringify](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify).\n * The graph can later be restored using {@link read}.\n *\n * @example\n *\n * ```js\n * var g = new graphlib.Graph();\n * g.setNode(\"a\", { label: \"node a\" });\n * g.setNode(\"b\", { label: \"node b\" });\n * g.setEdge(\"a\", \"b\", { label: \"edge a->b\" });\n * graphlib.json.write(g);\n * // Returns the object:\n * //\n * // {\n * //   \"options\": {\n * //     \"directed\": true,\n * //     \"multigraph\": false,\n * //     \"compound\": false\n * //   },\n * //   \"nodes\": [\n * //     { \"v\": \"a\", \"value\": { \"label\": \"node a\" } },\n * //     { \"v\": \"b\", \"value\": { \"label\": \"node b\" } }\n * //   ],\n * //   \"edges\": [\n * //     { \"v\": \"a\", \"w\": \"b\", \"value\": { \"label\": \"edge a->b\" } }\n * //   ]\n * // }\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {Graph<GraphLabel, NodeLabel, EdgeLabel>} g - The graph to serialize.\n * @returns {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} The JSON representation of the graph.\n */\nfunction write(g) {\n  /** @type {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} */\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound(),\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g),\n  };\n  if (!_.isUndefined(g.graph())) {\n    json.value = _.clone(g.graph());\n  }\n  return json;\n}\n\n/**\n * @template NodeLabel - Label of a node.\n *\n * @param {Graph<unknown, NodeLabel, unknown>} g - The graph to serialize.\n * @returns {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} The nodes in the graph.\n */\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function (v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    /** @type {{ v: NodeID; value?: NodeLabel; parent?: NodeID }} */\n    var node = { v: v };\n    if (!_.isUndefined(nodeValue)) {\n      node.value = nodeValue;\n    }\n    if (!_.isUndefined(parent)) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\n/**\n * @template EdgeLabel - Label of a node.\n *\n * @param {Graph<unknown, unknown, EdgeLabel>} g - The graph to serialize.\n * @returns {Array<EdgeObj & { value?: EdgeLabel }>} The edges in the graph.\n */\nfunction writeEdges(g) {\n  return _.map(g.edges(), function (e) {\n    var edgeValue = g.edge(e);\n    /** @type {EdgeObj & { value?: EdgeLabel }} */\n    var edge = { v: e.v, w: e.w };\n    if (!_.isUndefined(e.name)) {\n      edge.name = e.name;\n    }\n    if (!_.isUndefined(edgeValue)) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\n/**\n * Takes JSON as input and returns the graph representation.\n *\n * @example\n *\n * For example, if we have serialized the graph in {@link write}\n * to a string named `str`, we can restore it to a graph as follows:\n *\n * ```js\n * var g2 = graphlib.json.read(JSON.parse(str));\n * // or, in order to copy the graph\n * var g3 = graphlib.json.read(graphlib.json.write(g))\n *\n * g2.nodes();\n * // ['a', 'b']\n * g2.edges()\n * // [ { v: 'a', w: 'b' } ]\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} json - The JSON representation of the graph.\n * @returns {Graph<GraphLabel, NodeLabel, EdgeLabel>} The restored graph.\n */\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  _.each(json.nodes, function (entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  _.each(json.edges, function (entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n","import {\n  clear as clear2,\n  insertEdge,\n  insertEdgeLabel,\n  markers_default,\n  positionEdgeLabel\n} from \"./chunk-O4XLMI2P.mjs\";\nimport \"./chunk-MX3YWQON.mjs\";\nimport {\n  clear,\n  clear2 as clear3,\n  insertCluster,\n  insertNode,\n  positionNode,\n  setNodeElem,\n  updateNodeBounds\n} from \"./chunk-KYZI473N.mjs\";\nimport {\n  getSubGraphTitleMargins\n} from \"./chunk-YBOYWFTD.mjs\";\nimport \"./chunk-PQ6SQG4A.mjs\";\nimport \"./chunk-PU5JKC2W.mjs\";\nimport \"./chunk-GEFDOKGD.mjs\";\nimport {\n  getConfig2 as getConfig\n} from \"./chunk-7R4GIKGN.mjs\";\nimport {\n  __name,\n  log\n} from \"./chunk-AGHRB4JF.mjs\";\n\n// src/rendering-util/layout-algorithms/dagre/index.js\nimport { layout as dagreLayout } from \"dagre-d3-es/src/dagre/index.js\";\nimport * as graphlibJson2 from \"dagre-d3-es/src/graphlib/json.js\";\nimport * as graphlib2 from \"dagre-d3-es/src/graphlib/index.js\";\n\n// src/rendering-util/layout-algorithms/dagre/mermaid-graphlib.js\nimport * as graphlib from \"dagre-d3-es/src/graphlib/index.js\";\nimport * as graphlibJson from \"dagre-d3-es/src/graphlib/json.js\";\nvar clusterDb = /* @__PURE__ */ new Map();\nvar descendants = /* @__PURE__ */ new Map();\nvar parents = /* @__PURE__ */ new Map();\nvar clear4 = /* @__PURE__ */ __name(() => {\n  descendants.clear();\n  parents.clear();\n  clusterDb.clear();\n}, \"clear\");\nvar isDescendant = /* @__PURE__ */ __name((id, ancestorId) => {\n  const ancestorDescendants = descendants.get(ancestorId) || [];\n  log.trace(\"In isDescendant\", ancestorId, \" \", id, \" = \", ancestorDescendants.includes(id));\n  return ancestorDescendants.includes(id);\n}, \"isDescendant\");\nvar edgeInCluster = /* @__PURE__ */ __name((edge, clusterId) => {\n  const clusterDescendants = descendants.get(clusterId) || [];\n  log.info(\"Descendants of \", clusterId, \" is \", clusterDescendants);\n  log.info(\"Edge is \", edge);\n  if (edge.v === clusterId || edge.w === clusterId) {\n    return false;\n  }\n  if (!clusterDescendants) {\n    log.debug(\"Tilt, \", clusterId, \",not in descendants\");\n    return false;\n  }\n  return clusterDescendants.includes(edge.v) || isDescendant(edge.v, clusterId) || isDescendant(edge.w, clusterId) || clusterDescendants.includes(edge.w);\n}, \"edgeInCluster\");\nvar copy = /* @__PURE__ */ __name((clusterId, graph, newGraph, rootId) => {\n  log.warn(\n    \"Copying children of \",\n    clusterId,\n    \"root\",\n    rootId,\n    \"data\",\n    graph.node(clusterId),\n    rootId\n  );\n  const nodes = graph.children(clusterId) || [];\n  if (clusterId !== rootId) {\n    nodes.push(clusterId);\n  }\n  log.warn(\"Copying (nodes) clusterId\", clusterId, \"nodes\", nodes);\n  nodes.forEach((node) => {\n    if (graph.children(node).length > 0) {\n      copy(node, graph, newGraph, rootId);\n    } else {\n      const data = graph.node(node);\n      log.info(\"cp \", node, \" to \", rootId, \" with parent \", clusterId);\n      newGraph.setNode(node, data);\n      if (rootId !== graph.parent(node)) {\n        log.warn(\"Setting parent\", node, graph.parent(node));\n        newGraph.setParent(node, graph.parent(node));\n      }\n      if (clusterId !== rootId && node !== clusterId) {\n        log.debug(\"Setting parent\", node, clusterId);\n        newGraph.setParent(node, clusterId);\n      } else {\n        log.info(\"In copy \", clusterId, \"root\", rootId, \"data\", graph.node(clusterId), rootId);\n        log.debug(\n          \"Not Setting parent for node=\",\n          node,\n          \"cluster!==rootId\",\n          clusterId !== rootId,\n          \"node!==clusterId\",\n          node !== clusterId\n        );\n      }\n      const edges = graph.edges(node);\n      log.debug(\"Copying Edges\", edges);\n      edges.forEach((edge) => {\n        log.info(\"Edge\", edge);\n        const data2 = graph.edge(edge.v, edge.w, edge.name);\n        log.info(\"Edge data\", data2, rootId);\n        try {\n          if (edgeInCluster(edge, rootId)) {\n            log.info(\"Copying as \", edge.v, edge.w, data2, edge.name);\n            newGraph.setEdge(edge.v, edge.w, data2, edge.name);\n            log.info(\"newGraph edges \", newGraph.edges(), newGraph.edge(newGraph.edges()[0]));\n          } else {\n            log.info(\n              \"Skipping copy of edge \",\n              edge.v,\n              \"-->\",\n              edge.w,\n              \" rootId: \",\n              rootId,\n              \" clusterId:\",\n              clusterId\n            );\n          }\n        } catch (e) {\n          log.error(e);\n        }\n      });\n    }\n    log.debug(\"Removing node\", node);\n    graph.removeNode(node);\n  });\n}, \"copy\");\nvar extractDescendants = /* @__PURE__ */ __name((id, graph) => {\n  const children = graph.children(id);\n  let res = [...children];\n  for (const child of children) {\n    parents.set(child, id);\n    res = [...res, ...extractDescendants(child, graph)];\n  }\n  return res;\n}, \"extractDescendants\");\nvar findCommonEdges = /* @__PURE__ */ __name((graph, id1, id2) => {\n  const edges1 = graph.edges().filter((edge) => edge.v === id1 || edge.w === id1);\n  const edges2 = graph.edges().filter((edge) => edge.v === id2 || edge.w === id2);\n  const edges1Prim = edges1.map((edge) => {\n    return { v: edge.v === id1 ? id2 : edge.v, w: edge.w === id1 ? id1 : edge.w };\n  });\n  const edges2Prim = edges2.map((edge) => {\n    return { v: edge.v, w: edge.w };\n  });\n  const result = edges1Prim.filter((edgeIn1) => {\n    return edges2Prim.some((edge) => edgeIn1.v === edge.v && edgeIn1.w === edge.w);\n  });\n  return result;\n}, \"findCommonEdges\");\nvar findNonClusterChild = /* @__PURE__ */ __name((id, graph, clusterId) => {\n  const children = graph.children(id);\n  log.trace(\"Searching children of id \", id, children);\n  if (children.length < 1) {\n    return id;\n  }\n  let reserve;\n  for (const child of children) {\n    const _id = findNonClusterChild(child, graph, clusterId);\n    const commonEdges = findCommonEdges(graph, clusterId, _id);\n    if (_id) {\n      if (commonEdges.length > 0) {\n        reserve = _id;\n      } else {\n        return _id;\n      }\n    }\n  }\n  return reserve;\n}, \"findNonClusterChild\");\nvar getAnchorId = /* @__PURE__ */ __name((id) => {\n  if (!clusterDb.has(id)) {\n    return id;\n  }\n  if (!clusterDb.get(id).externalConnections) {\n    return id;\n  }\n  if (clusterDb.has(id)) {\n    return clusterDb.get(id).id;\n  }\n  return id;\n}, \"getAnchorId\");\nvar adjustClustersAndEdges = /* @__PURE__ */ __name((graph, depth) => {\n  if (!graph || depth > 10) {\n    log.debug(\"Opting out, no graph \");\n    return;\n  } else {\n    log.debug(\"Opting in, graph \");\n  }\n  graph.nodes().forEach(function(id) {\n    const children = graph.children(id);\n    if (children.length > 0) {\n      log.warn(\n        \"Cluster identified\",\n        id,\n        \" Replacement id in edges: \",\n        findNonClusterChild(id, graph, id)\n      );\n      descendants.set(id, extractDescendants(id, graph));\n      clusterDb.set(id, { id: findNonClusterChild(id, graph, id), clusterData: graph.node(id) });\n    }\n  });\n  graph.nodes().forEach(function(id) {\n    const children = graph.children(id);\n    const edges = graph.edges();\n    if (children.length > 0) {\n      log.debug(\"Cluster identified\", id, descendants);\n      edges.forEach((edge) => {\n        const d1 = isDescendant(edge.v, id);\n        const d2 = isDescendant(edge.w, id);\n        if (d1 ^ d2) {\n          log.warn(\"Edge: \", edge, \" leaves cluster \", id);\n          log.warn(\"Descendants of XXX \", id, \": \", descendants.get(id));\n          clusterDb.get(id).externalConnections = true;\n        }\n      });\n    } else {\n      log.debug(\"Not a cluster \", id, descendants);\n    }\n  });\n  for (let id of clusterDb.keys()) {\n    const nonClusterChild = clusterDb.get(id).id;\n    const parent = graph.parent(nonClusterChild);\n    if (parent !== id && clusterDb.has(parent) && !clusterDb.get(parent).externalConnections) {\n      clusterDb.get(id).id = parent;\n    }\n  }\n  graph.edges().forEach(function(e) {\n    const edge = graph.edge(e);\n    log.warn(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(e));\n    log.warn(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(graph.edge(e)));\n    let v = e.v;\n    let w = e.w;\n    log.warn(\n      \"Fix XXX\",\n      clusterDb,\n      \"ids:\",\n      e.v,\n      e.w,\n      \"Translating: \",\n      clusterDb.get(e.v),\n      \" --- \",\n      clusterDb.get(e.w)\n    );\n    if (clusterDb.get(e.v) || clusterDb.get(e.w)) {\n      log.warn(\"Fixing and trying - removing XXX\", e.v, e.w, e.name);\n      v = getAnchorId(e.v);\n      w = getAnchorId(e.w);\n      graph.removeEdge(e.v, e.w, e.name);\n      if (v !== e.v) {\n        const parent = graph.parent(v);\n        clusterDb.get(parent).externalConnections = true;\n        edge.fromCluster = e.v;\n      }\n      if (w !== e.w) {\n        const parent = graph.parent(w);\n        clusterDb.get(parent).externalConnections = true;\n        edge.toCluster = e.w;\n      }\n      log.warn(\"Fix Replacing with XXX\", v, w, e.name);\n      graph.setEdge(v, w, edge, e.name);\n    }\n  });\n  log.warn(\"Adjusted Graph\", graphlibJson.write(graph));\n  extractor(graph, 0);\n  log.trace(clusterDb);\n}, \"adjustClustersAndEdges\");\nvar extractor = /* @__PURE__ */ __name((graph, depth) => {\n  log.warn(\"extractor - \", depth, graphlibJson.write(graph), graph.children(\"D\"));\n  if (depth > 10) {\n    log.error(\"Bailing out\");\n    return;\n  }\n  let nodes = graph.nodes();\n  let hasChildren = false;\n  for (const node of nodes) {\n    const children = graph.children(node);\n    hasChildren = hasChildren || children.length > 0;\n  }\n  if (!hasChildren) {\n    log.debug(\"Done, no node has children\", graph.nodes());\n    return;\n  }\n  log.debug(\"Nodes = \", nodes, depth);\n  for (const node of nodes) {\n    log.debug(\n      \"Extracting node\",\n      node,\n      clusterDb,\n      clusterDb.has(node) && !clusterDb.get(node).externalConnections,\n      !graph.parent(node),\n      graph.node(node),\n      graph.children(\"D\"),\n      \" Depth \",\n      depth\n    );\n    if (!clusterDb.has(node)) {\n      log.debug(\"Not a cluster\", node, depth);\n    } else if (!clusterDb.get(node).externalConnections && graph.children(node) && graph.children(node).length > 0) {\n      log.warn(\n        \"Cluster without external connections, without a parent and with children\",\n        node,\n        depth\n      );\n      const graphSettings = graph.graph();\n      let dir = graphSettings.rankdir === \"TB\" ? \"LR\" : \"TB\";\n      if (clusterDb.get(node)?.clusterData?.dir) {\n        dir = clusterDb.get(node).clusterData.dir;\n        log.warn(\"Fixing dir\", clusterDb.get(node).clusterData.dir, dir);\n      }\n      const clusterGraph = new graphlib.Graph({\n        multigraph: true,\n        compound: true\n      }).setGraph({\n        rankdir: dir,\n        nodesep: 50,\n        ranksep: 50,\n        marginx: 8,\n        marginy: 8\n      }).setDefaultEdgeLabel(function() {\n        return {};\n      });\n      log.warn(\"Old graph before copy\", graphlibJson.write(graph));\n      copy(node, graph, clusterGraph, node);\n      graph.setNode(node, {\n        clusterNode: true,\n        id: node,\n        clusterData: clusterDb.get(node).clusterData,\n        label: clusterDb.get(node).label,\n        graph: clusterGraph\n      });\n      log.warn(\"New graph after copy node: (\", node, \")\", graphlibJson.write(clusterGraph));\n      log.debug(\"Old graph after copy\", graphlibJson.write(graph));\n    } else {\n      log.warn(\n        \"Cluster ** \",\n        node,\n        \" **not meeting the criteria !externalConnections:\",\n        !clusterDb.get(node).externalConnections,\n        \" no parent: \",\n        !graph.parent(node),\n        \" children \",\n        graph.children(node) && graph.children(node).length > 0,\n        graph.children(\"D\"),\n        depth\n      );\n      log.debug(clusterDb);\n    }\n  }\n  nodes = graph.nodes();\n  log.warn(\"New list of nodes\", nodes);\n  for (const node of nodes) {\n    const data = graph.node(node);\n    log.warn(\" Now next level\", node, data);\n    if (data?.clusterNode) {\n      extractor(data.graph, depth + 1);\n    }\n  }\n}, \"extractor\");\nvar sorter = /* @__PURE__ */ __name((graph, nodes) => {\n  if (nodes.length === 0) {\n    return [];\n  }\n  let result = Object.assign([], nodes);\n  nodes.forEach((node) => {\n    const children = graph.children(node);\n    const sorted = sorter(graph, children);\n    result = [...result, ...sorted];\n  });\n  return result;\n}, \"sorter\");\nvar sortNodesByHierarchy = /* @__PURE__ */ __name((graph) => sorter(graph, graph.children()), \"sortNodesByHierarchy\");\n\n// src/rendering-util/layout-algorithms/dagre/index.js\nvar recursiveRender = /* @__PURE__ */ __name(async (_elem, graph, diagramType, id, parentCluster, siteConfig) => {\n  log.warn(\"Graph in recursive render:XAX\", graphlibJson2.write(graph), parentCluster);\n  const dir = graph.graph().rankdir;\n  log.trace(\"Dir in recursive render - dir:\", dir);\n  const elem = _elem.insert(\"g\").attr(\"class\", \"root\");\n  if (!graph.nodes()) {\n    log.info(\"No nodes found for\", graph);\n  } else {\n    log.info(\"Recursive render XXX\", graph.nodes());\n  }\n  if (graph.edges().length > 0) {\n    log.info(\"Recursive edges\", graph.edge(graph.edges()[0]));\n  }\n  const clusters = elem.insert(\"g\").attr(\"class\", \"clusters\");\n  const edgePaths = elem.insert(\"g\").attr(\"class\", \"edgePaths\");\n  const edgeLabels = elem.insert(\"g\").attr(\"class\", \"edgeLabels\");\n  const nodes = elem.insert(\"g\").attr(\"class\", \"nodes\");\n  await Promise.all(\n    graph.nodes().map(async function(v) {\n      const node = graph.node(v);\n      if (parentCluster !== void 0) {\n        const data = JSON.parse(JSON.stringify(parentCluster.clusterData));\n        log.trace(\n          \"Setting data for parent cluster XXX\\n Node.id = \",\n          v,\n          \"\\n data=\",\n          data.height,\n          \"\\nParent cluster\",\n          parentCluster.height\n        );\n        graph.setNode(parentCluster.id, data);\n        if (!graph.parent(v)) {\n          log.trace(\"Setting parent\", v, parentCluster.id);\n          graph.setParent(v, parentCluster.id, data);\n        }\n      }\n      log.info(\"(Insert) Node XXX\" + v + \": \" + JSON.stringify(graph.node(v)));\n      if (node?.clusterNode) {\n        log.info(\"Cluster identified XBX\", v, node.width, graph.node(v));\n        const { ranksep, nodesep } = graph.graph();\n        node.graph.setGraph({\n          ...node.graph.graph(),\n          ranksep: ranksep + 25,\n          nodesep\n        });\n        const o = await recursiveRender(\n          nodes,\n          node.graph,\n          diagramType,\n          id,\n          graph.node(v),\n          siteConfig\n        );\n        const newEl = o.elem;\n        updateNodeBounds(node, newEl);\n        node.diff = o.diff || 0;\n        log.info(\n          \"New compound node after recursive render XAX\",\n          v,\n          \"width\",\n          // node,\n          node.width,\n          \"height\",\n          node.height\n          // node.x,\n          // node.y\n        );\n        setNodeElem(newEl, node);\n      } else {\n        if (graph.children(v).length > 0) {\n          log.trace(\n            \"Cluster - the non recursive path XBX\",\n            v,\n            node.id,\n            node,\n            node.width,\n            \"Graph:\",\n            graph\n          );\n          log.trace(findNonClusterChild(node.id, graph));\n          clusterDb.set(node.id, { id: findNonClusterChild(node.id, graph), node });\n        } else {\n          log.trace(\"Node - the non recursive path XAX\", v, nodes, graph.node(v), dir);\n          await insertNode(nodes, graph.node(v), { config: siteConfig, dir });\n        }\n      }\n    })\n  );\n  const processEdges = /* @__PURE__ */ __name(async () => {\n    const edgePromises = graph.edges().map(async function(e) {\n      const edge = graph.edge(e.v, e.w, e.name);\n      log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(e));\n      log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \", e, \" \", JSON.stringify(graph.edge(e)));\n      log.info(\n        \"Fix\",\n        clusterDb,\n        \"ids:\",\n        e.v,\n        e.w,\n        \"Translating: \",\n        clusterDb.get(e.v),\n        clusterDb.get(e.w)\n      );\n      await insertEdgeLabel(edgeLabels, edge);\n    });\n    await Promise.all(edgePromises);\n  }, \"processEdges\");\n  await processEdges();\n  log.info(\"Graph before layout:\", JSON.stringify(graphlibJson2.write(graph)));\n  log.info(\"############################################# XXX\");\n  log.info(\"###                Layout                 ### XXX\");\n  log.info(\"############################################# XXX\");\n  dagreLayout(graph);\n  log.info(\"Graph after layout:\", JSON.stringify(graphlibJson2.write(graph)));\n  let diff = 0;\n  let { subGraphTitleTotalMargin } = getSubGraphTitleMargins(siteConfig);\n  await Promise.all(\n    sortNodesByHierarchy(graph).map(async function(v) {\n      const node = graph.node(v);\n      log.info(\n        \"Position XBX => \" + v + \": (\" + node.x,\n        \",\" + node.y,\n        \") width: \",\n        node.width,\n        \" height: \",\n        node.height\n      );\n      if (node?.clusterNode) {\n        node.y += subGraphTitleTotalMargin;\n        log.info(\n          \"A tainted cluster node XBX1\",\n          v,\n          node.id,\n          node.width,\n          node.height,\n          node.x,\n          node.y,\n          graph.parent(v)\n        );\n        clusterDb.get(node.id).node = node;\n        positionNode(node);\n      } else {\n        if (graph.children(v).length > 0) {\n          log.info(\n            \"A pure cluster node XBX1\",\n            v,\n            node.id,\n            node.x,\n            node.y,\n            node.width,\n            node.height,\n            graph.parent(v)\n          );\n          node.height += subGraphTitleTotalMargin;\n          graph.node(node.parentId);\n          const halfPadding = node?.padding / 2 || 0;\n          const labelHeight = node?.labelBBox?.height || 0;\n          const offsetY = labelHeight - halfPadding || 0;\n          log.debug(\"OffsetY\", offsetY, \"labelHeight\", labelHeight, \"halfPadding\", halfPadding);\n          await insertCluster(clusters, node);\n          clusterDb.get(node.id).node = node;\n        } else {\n          const parent = graph.node(node.parentId);\n          node.y += subGraphTitleTotalMargin / 2;\n          log.info(\n            \"A regular node XBX1 - using the padding\",\n            node.id,\n            \"parent\",\n            node.parentId,\n            node.width,\n            node.height,\n            node.x,\n            node.y,\n            \"offsetY\",\n            node.offsetY,\n            \"parent\",\n            parent,\n            parent?.offsetY,\n            node\n          );\n          positionNode(node);\n        }\n      }\n    })\n  );\n  graph.edges().forEach(function(e) {\n    const edge = graph.edge(e);\n    log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(edge), edge);\n    edge.points.forEach((point) => point.y += subGraphTitleTotalMargin / 2);\n    const startNode = graph.node(e.v);\n    var endNode = graph.node(e.w);\n    const paths = insertEdge(edgePaths, edge, clusterDb, diagramType, startNode, endNode, id);\n    positionEdgeLabel(edge, paths);\n  });\n  graph.nodes().forEach(function(v) {\n    const n = graph.node(v);\n    log.info(v, n.type, n.diff);\n    if (n.isGroup) {\n      diff = n.diff;\n    }\n  });\n  log.warn(\"Returning from recursive render XAX\", elem, diff);\n  return { elem, diff };\n}, \"recursiveRender\");\nvar render = /* @__PURE__ */ __name(async (data4Layout, svg) => {\n  const graph = new graphlib2.Graph({\n    multigraph: true,\n    compound: true\n  }).setGraph({\n    rankdir: data4Layout.direction,\n    nodesep: data4Layout.config?.nodeSpacing || data4Layout.config?.flowchart?.nodeSpacing || data4Layout.nodeSpacing,\n    ranksep: data4Layout.config?.rankSpacing || data4Layout.config?.flowchart?.rankSpacing || data4Layout.rankSpacing,\n    marginx: 8,\n    marginy: 8\n  }).setDefaultEdgeLabel(function() {\n    return {};\n  });\n  const element = svg.select(\"g\");\n  markers_default(element, data4Layout.markers, data4Layout.type, data4Layout.diagramId);\n  clear3();\n  clear2();\n  clear();\n  clear4();\n  data4Layout.nodes.forEach((node) => {\n    graph.setNode(node.id, { ...node });\n    if (node.parentId) {\n      graph.setParent(node.id, node.parentId);\n    }\n  });\n  log.debug(\"Edges:\", data4Layout.edges);\n  data4Layout.edges.forEach((edge) => {\n    if (edge.start === edge.end) {\n      const nodeId = edge.start;\n      const specialId1 = nodeId + \"---\" + nodeId + \"---1\";\n      const specialId2 = nodeId + \"---\" + nodeId + \"---2\";\n      const node = graph.node(nodeId);\n      graph.setNode(specialId1, {\n        domId: specialId1,\n        id: specialId1,\n        parentId: node.parentId,\n        labelStyle: \"\",\n        label: \"\",\n        padding: 0,\n        shape: \"labelRect\",\n        // shape: 'rect',\n        style: \"\",\n        width: 10,\n        height: 10\n      });\n      graph.setParent(specialId1, node.parentId);\n      graph.setNode(specialId2, {\n        domId: specialId2,\n        id: specialId2,\n        parentId: node.parentId,\n        labelStyle: \"\",\n        padding: 0,\n        // shape: 'rect',\n        shape: \"labelRect\",\n        label: \"\",\n        style: \"\",\n        width: 10,\n        height: 10\n      });\n      graph.setParent(specialId2, node.parentId);\n      const edge1 = structuredClone(edge);\n      const edgeMid = structuredClone(edge);\n      const edge2 = structuredClone(edge);\n      edge1.label = \"\";\n      edge1.arrowTypeEnd = \"none\";\n      edge1.id = nodeId + \"-cyclic-special-1\";\n      edgeMid.arrowTypeStart = \"none\";\n      edgeMid.arrowTypeEnd = \"none\";\n      edgeMid.id = nodeId + \"-cyclic-special-mid\";\n      edge2.label = \"\";\n      if (node.isGroup) {\n        edge1.fromCluster = nodeId;\n        edge2.toCluster = nodeId;\n      }\n      edge2.id = nodeId + \"-cyclic-special-2\";\n      edge2.arrowTypeStart = \"none\";\n      graph.setEdge(nodeId, specialId1, edge1, nodeId + \"-cyclic-special-0\");\n      graph.setEdge(specialId1, specialId2, edgeMid, nodeId + \"-cyclic-special-1\");\n      graph.setEdge(specialId2, nodeId, edge2, nodeId + \"-cyc<lic-special-2\");\n    } else {\n      graph.setEdge(edge.start, edge.end, { ...edge }, edge.id);\n    }\n  });\n  log.warn(\"Graph at first:\", JSON.stringify(graphlibJson2.write(graph)));\n  adjustClustersAndEdges(graph);\n  log.warn(\"Graph after XAX:\", JSON.stringify(graphlibJson2.write(graph)));\n  const siteConfig = getConfig();\n  await recursiveRender(\n    element,\n    graph,\n    data4Layout.type,\n    data4Layout.diagramId,\n    void 0,\n    siteConfig\n  );\n}, \"render\");\nexport {\n  render\n};\n"],"x_google_ignoreList":[0,1],"mappings":";;;;;;;;;;;;;;;AA2DA,SAAS,EAAM,GAAG;CAEhB,IAAI,IAAO;EACT,SAAS;GACP,UAAU,EAAE,YAAY;GACxB,YAAY,EAAE,cAAc;GAC5B,UAAU,EAAE,YAAY;GACzB;EACD,OAAO,EAAW,EAAE;EACpB,OAAO,EAAW,EAAE;EACrB;AAID,QAHKA,EAAc,EAAE,OAAO,CAAC,KAC3B,EAAK,QAAQC,EAAQ,EAAE,OAAO,CAAC,GAE1B;;AAST,SAAS,EAAW,GAAG;AACrB,QAAOC,EAAM,EAAE,OAAO,EAAE,SAAU,GAAG;EACnC,IAAI,IAAY,EAAE,KAAK,EAAE,EACrB,IAAS,EAAE,OAAO,EAAE,EAEpB,IAAO,EAAK,MAAG;AAOnB,SANKF,EAAc,EAAU,KAC3B,EAAK,QAAQ,IAEVA,EAAc,EAAO,KACxB,EAAK,SAAS,IAET;GACP;;AASJ,SAAS,EAAW,GAAG;AACrB,QAAOE,EAAM,EAAE,OAAO,EAAE,SAAU,GAAG;EACnC,IAAI,IAAY,EAAE,KAAK,EAAE,EAErB,IAAO;GAAE,GAAG,EAAE;GAAG,GAAG,EAAE;GAAG;AAO7B,SANKF,EAAc,EAAE,KAAK,KACxB,EAAK,OAAO,EAAE,OAEXA,EAAc,EAAU,KAC3B,EAAK,QAAQ,IAER;GACP;;;;AC7EJ,IAAI,oBAA4B,IAAI,KAAK,EACrC,oBAA8B,IAAI,KAAK,EACvC,oBAA0B,IAAI,KAAK,EACnC,IAAyB,wBAAa;AAGxC,CAFA,EAAY,OAAO,EACnB,EAAQ,OAAO,EACf,EAAU,OAAO;GAChB,QAAQ,EACP,IAA+B,mBAAQ,GAAI,MAAe;CAC5D,IAAM,IAAsB,EAAY,IAAI,EAAW,IAAI,EAAE;AAE7D,QADA,EAAI,MAAM,mBAAmB,GAAY,KAAK,GAAI,OAAO,EAAoB,SAAS,EAAG,CAAC,EACnF,EAAoB,SAAS,EAAG;GACtC,eAAe,EACd,IAAgC,mBAAQ,GAAM,MAAc;CAC9D,IAAM,IAAqB,EAAY,IAAI,EAAU,IAAI,EAAE;AAU3D,QATA,EAAI,KAAK,mBAAmB,GAAW,QAAQ,EAAmB,EAClE,EAAI,KAAK,YAAY,EAAK,EACtB,EAAK,MAAM,KAAa,EAAK,MAAM,IAC9B,KAEJ,IAIE,EAAmB,SAAS,EAAK,EAAE,IAAI,EAAa,EAAK,GAAG,EAAU,IAAI,EAAa,EAAK,GAAG,EAAU,IAAI,EAAmB,SAAS,EAAK,EAAE,IAHrJ,EAAI,MAAM,UAAU,GAAW,sBAAsB,EAC9C;GAGR,gBAAgB,EACf,IAAuB,mBAAQ,GAAW,GAAO,GAAU,MAAW;AACxE,GAAI,KACF,wBACA,GACA,QACA,GACA,QACA,EAAM,KAAK,EAAU,EACrB,EACD;CACD,IAAM,IAAQ,EAAM,SAAS,EAAU,IAAI,EAAE;AAK7C,CAJI,MAAc,KAChB,EAAM,KAAK,EAAU,EAEvB,EAAI,KAAK,6BAA6B,GAAW,SAAS,EAAM,EAChE,EAAM,SAAS,MAAS;AACtB,MAAI,EAAM,SAAS,EAAK,CAAC,SAAS,EAChC,GAAK,GAAM,GAAO,GAAU,EAAO;OAC9B;GACL,IAAM,IAAO,EAAM,KAAK,EAAK;AAO7B,GANA,EAAI,KAAK,OAAO,GAAM,QAAQ,GAAQ,iBAAiB,EAAU,EACjE,EAAS,QAAQ,GAAM,EAAK,EACxB,MAAW,EAAM,OAAO,EAAK,KAC/B,EAAI,KAAK,kBAAkB,GAAM,EAAM,OAAO,EAAK,CAAC,EACpD,EAAS,UAAU,GAAM,EAAM,OAAO,EAAK,CAAC,GAE1C,MAAc,KAAU,MAAS,KACnC,EAAI,MAAM,kBAAkB,GAAM,EAAU,EAC5C,EAAS,UAAU,GAAM,EAAU,KAEnC,EAAI,KAAK,YAAY,GAAW,QAAQ,GAAQ,QAAQ,EAAM,KAAK,EAAU,EAAE,EAAO,EACtF,EAAI,MACF,gCACA,GACA,oBACA,MAAc,GACd,oBACA,MAAS,EACV;GAEH,IAAM,IAAQ,EAAM,MAAM,EAAK;AAE/B,GADA,EAAI,MAAM,iBAAiB,EAAM,EACjC,EAAM,SAAS,MAAS;AACtB,MAAI,KAAK,QAAQ,EAAK;IACtB,IAAM,IAAQ,EAAM,KAAK,EAAK,GAAG,EAAK,GAAG,EAAK,KAAK;AACnD,MAAI,KAAK,aAAa,GAAO,EAAO;AACpC,QAAI;AACF,KAAI,EAAc,GAAM,EAAO,IAC7B,EAAI,KAAK,eAAe,EAAK,GAAG,EAAK,GAAG,GAAO,EAAK,KAAK,EACzD,EAAS,QAAQ,EAAK,GAAG,EAAK,GAAG,GAAO,EAAK,KAAK,EAClD,EAAI,KAAK,mBAAmB,EAAS,OAAO,EAAE,EAAS,KAAK,EAAS,OAAO,CAAC,GAAG,CAAC,IAEjF,EAAI,KACF,0BACA,EAAK,GACL,OACA,EAAK,GACL,aACA,GACA,eACA,EACD;aAEI,GAAG;AACV,OAAI,MAAM,EAAE;;KAEd;;AAGJ,EADA,EAAI,MAAM,iBAAiB,EAAK,EAChC,EAAM,WAAW,EAAK;GACtB;GACD,OAAO,EACN,IAAqC,mBAAQ,GAAI,MAAU;CAC7D,IAAM,IAAW,EAAM,SAAS,EAAG,EAC/B,IAAM,CAAC,GAAG,EAAS;AACvB,MAAK,IAAM,KAAS,EAElB,CADA,EAAQ,IAAI,GAAO,EAAG,EACtB,IAAM,CAAC,GAAG,GAAK,GAAG,EAAmB,GAAO,EAAM,CAAC;AAErD,QAAO;GACN,qBAAqB,EACpB,IAAkC,mBAAQ,GAAO,GAAK,MAAQ;CAChE,IAAM,IAAS,EAAM,OAAO,CAAC,QAAQ,MAAS,EAAK,MAAM,KAAO,EAAK,MAAM,EAAI,EACzE,IAAS,EAAM,OAAO,CAAC,QAAQ,MAAS,EAAK,MAAM,KAAO,EAAK,MAAM,EAAI,EACzE,IAAa,EAAO,KAAK,OACtB;EAAE,GAAG,EAAK,MAAM,IAAM,IAAM,EAAK;EAAG,GAAG,EAAK,MAAM,IAAM,IAAM,EAAK;EAAG,EAC7E,EACI,IAAa,EAAO,KAAK,OACtB;EAAE,GAAG,EAAK;EAAG,GAAG,EAAK;EAAG,EAC/B;AAIF,QAHe,EAAW,QAAQ,MACzB,EAAW,MAAM,MAAS,EAAQ,MAAM,EAAK,KAAK,EAAQ,MAAM,EAAK,EAAE,CAC9E;GAED,kBAAkB,EACjB,IAAsC,mBAAQ,GAAI,GAAO,MAAc;CACzE,IAAM,IAAW,EAAM,SAAS,EAAG;AAEnC,KADA,EAAI,MAAM,6BAA6B,GAAI,EAAS,EAChD,EAAS,SAAS,EACpB,QAAO;CAET,IAAI;AACJ,MAAK,IAAM,KAAS,GAAU;EAC5B,IAAM,IAAM,EAAoB,GAAO,GAAO,EAAU,EAClD,IAAc,EAAgB,GAAO,GAAW,EAAI;AAC1D,MAAI,EACF,KAAI,EAAY,SAAS,EACvB,KAAU;MAEV,QAAO;;AAIb,QAAO;GACN,sBAAsB,EACrB,IAA8B,mBAAQ,MACpC,CAAC,EAAU,IAAI,EAAG,IAGlB,CAAC,EAAU,IAAI,EAAG,CAAC,sBACd,IAEL,EAAU,IAAI,EAAG,GACZ,EAAU,IAAI,EAAG,CAAC,KAEpB,GACN,cAAc,EACb,IAAyC,mBAAQ,GAAO,MAAU;AACpE,KAAI,CAAC,KAAS,IAAQ,IAAI;AACxB,IAAI,MAAM,wBAAwB;AAClC;OAEA,GAAI,MAAM,oBAAoB;AAehC,CAbA,EAAM,OAAO,CAAC,QAAQ,SAAS,GAAI;AAEjC,EADiB,EAAM,SAAS,EAAG,CACtB,SAAS,MACpB,EAAI,KACF,sBACA,GACA,8BACA,EAAoB,GAAI,GAAO,EAAG,CACnC,EACD,EAAY,IAAI,GAAI,EAAmB,GAAI,EAAM,CAAC,EAClD,EAAU,IAAI,GAAI;GAAE,IAAI,EAAoB,GAAI,GAAO,EAAG;GAAE,aAAa,EAAM,KAAK,EAAG;GAAE,CAAC;GAE5F,EACF,EAAM,OAAO,CAAC,QAAQ,SAAS,GAAI;EACjC,IAAM,IAAW,EAAM,SAAS,EAAG,EAC7B,IAAQ,EAAM,OAAO;AAC3B,EAAI,EAAS,SAAS,KACpB,EAAI,MAAM,sBAAsB,GAAI,EAAY,EAChD,EAAM,SAAS,MAAS;AAGtB,GAFW,EAAa,EAAK,GAAG,EAAG,GACxB,EAAa,EAAK,GAAG,EAAG,KAEjC,EAAI,KAAK,UAAU,GAAM,oBAAoB,EAAG,EAChD,EAAI,KAAK,uBAAuB,GAAI,MAAM,EAAY,IAAI,EAAG,CAAC,EAC9D,EAAU,IAAI,EAAG,CAAC,sBAAsB;IAE1C,IAEF,EAAI,MAAM,kBAAkB,GAAI,EAAY;GAE9C;AACF,MAAK,IAAI,KAAM,EAAU,MAAM,EAAE;EAC/B,IAAM,IAAkB,EAAU,IAAI,EAAG,CAAC,IACpC,IAAS,EAAM,OAAO,EAAgB;AAC5C,EAAI,MAAW,KAAM,EAAU,IAAI,EAAO,IAAI,CAAC,EAAU,IAAI,EAAO,CAAC,wBACnE,EAAU,IAAI,EAAG,CAAC,KAAK;;AAyC3B,CAtCA,EAAM,OAAO,CAAC,QAAQ,SAAS,GAAG;EAChC,IAAM,IAAO,EAAM,KAAK,EAAE;AAE1B,EADA,EAAI,KAAK,UAAU,EAAE,IAAI,SAAS,EAAE,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC,EACjE,EAAI,KAAK,UAAU,EAAE,IAAI,SAAS,EAAE,IAAI,OAAO,KAAK,UAAU,EAAM,KAAK,EAAE,CAAC,CAAC;EAC7E,IAAI,IAAI,EAAE,GACN,IAAI,EAAE;AAYV,MAXA,EAAI,KACF,WACA,GACA,QACA,EAAE,GACF,EAAE,GACF,iBACA,EAAU,IAAI,EAAE,EAAE,EAClB,SACA,EAAU,IAAI,EAAE,EAAE,CACnB,EACG,EAAU,IAAI,EAAE,EAAE,IAAI,EAAU,IAAI,EAAE,EAAE,EAAE;AAK5C,OAJA,EAAI,KAAK,oCAAoC,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAC9D,IAAI,EAAY,EAAE,EAAE,EACpB,IAAI,EAAY,EAAE,EAAE,EACpB,EAAM,WAAW,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAC9B,MAAM,EAAE,GAAG;IACb,IAAM,IAAS,EAAM,OAAO,EAAE;AAE9B,IADA,EAAU,IAAI,EAAO,CAAC,sBAAsB,IAC5C,EAAK,cAAc,EAAE;;AAEvB,OAAI,MAAM,EAAE,GAAG;IACb,IAAM,IAAS,EAAM,OAAO,EAAE;AAE9B,IADA,EAAU,IAAI,EAAO,CAAC,sBAAsB,IAC5C,EAAK,YAAY,EAAE;;AAGrB,GADA,EAAI,KAAK,0BAA0B,GAAG,GAAG,EAAE,KAAK,EAChD,EAAM,QAAQ,GAAG,GAAG,GAAM,EAAE,KAAK;;GAEnC,EACF,EAAI,KAAK,kBAAkBG,EAAmB,EAAM,CAAC,EACrD,EAAU,GAAO,EAAE,EACnB,EAAI,MAAM,EAAU;GACnB,yBAAyB,EACxB,IAA4B,mBAAQ,GAAO,MAAU;AAEvD,KADA,EAAI,KAAK,gBAAgB,GAAOA,EAAmB,EAAM,EAAE,EAAM,SAAS,IAAI,CAAC,EAC3E,IAAQ,IAAI;AACd,IAAI,MAAM,cAAc;AACxB;;CAEF,IAAI,IAAQ,EAAM,OAAO,EACrB,IAAc;AAClB,MAAK,IAAM,KAAQ,GAAO;EACxB,IAAM,IAAW,EAAM,SAAS,EAAK;AACrC,QAA6B,EAAS,SAAS;;AAEjD,KAAI,CAAC,GAAa;AAChB,IAAI,MAAM,8BAA8B,EAAM,OAAO,CAAC;AACtD;;AAEF,GAAI,MAAM,YAAY,GAAO,EAAM;AACnC,MAAK,IAAM,KAAQ,EAYjB,KAXA,EAAI,MACF,mBACA,GACA,GACA,EAAU,IAAI,EAAK,IAAI,CAAC,EAAU,IAAI,EAAK,CAAC,qBAC5C,CAAC,EAAM,OAAO,EAAK,EACnB,EAAM,KAAK,EAAK,EAChB,EAAM,SAAS,IAAI,EACnB,WACA,EACD,EACG,CAAC,EAAU,IAAI,EAAK,CACtB,GAAI,MAAM,iBAAiB,GAAM,EAAM;UAC9B,CAAC,EAAU,IAAI,EAAK,CAAC,uBAAuB,EAAM,SAAS,EAAK,IAAI,EAAM,SAAS,EAAK,CAAC,SAAS,GAAG;AAC9G,IAAI,KACF,4EACA,GACA,EACD;EAED,IAAI,IADkB,EAAM,OAAO,CACX,YAAY,OAAO,OAAO;AAClD,EAAI,EAAU,IAAI,EAAK,EAAE,aAAa,QACpC,IAAM,EAAU,IAAI,EAAK,CAAC,YAAY,KACtC,EAAI,KAAK,cAAc,EAAU,IAAI,EAAK,CAAC,YAAY,KAAK,EAAI;EAElE,IAAM,IAAe,IAAIC,EAAe;GACtC,YAAY;GACZ,UAAU;GACX,CAAC,CAAC,SAAS;GACV,SAAS;GACT,SAAS;GACT,SAAS;GACT,SAAS;GACT,SAAS;GACV,CAAC,CAAC,oBAAoB,WAAW;AAChC,UAAO,EAAE;IACT;AAWF,EAVA,EAAI,KAAK,yBAAyBD,EAAmB,EAAM,CAAC,EAC5D,EAAK,GAAM,GAAO,GAAc,EAAK,EACrC,EAAM,QAAQ,GAAM;GAClB,aAAa;GACb,IAAI;GACJ,aAAa,EAAU,IAAI,EAAK,CAAC;GACjC,OAAO,EAAU,IAAI,EAAK,CAAC;GAC3B,OAAO;GACR,CAAC,EACF,EAAI,KAAK,gCAAgC,GAAM,KAAKA,EAAmB,EAAa,CAAC,EACrF,EAAI,MAAM,wBAAwBA,EAAmB,EAAM,CAAC;OAc5D,CAZA,EAAI,KACF,eACA,GACA,qDACA,CAAC,EAAU,IAAI,EAAK,CAAC,qBACrB,gBACA,CAAC,EAAM,OAAO,EAAK,EACnB,cACA,EAAM,SAAS,EAAK,IAAI,EAAM,SAAS,EAAK,CAAC,SAAS,GACtD,EAAM,SAAS,IAAI,EACnB,EACD,EACD,EAAI,MAAM,EAAU;AAIxB,CADA,IAAQ,EAAM,OAAO,EACrB,EAAI,KAAK,qBAAqB,EAAM;AACpC,MAAK,IAAM,KAAQ,GAAO;EACxB,IAAM,IAAO,EAAM,KAAK,EAAK;AAE7B,EADA,EAAI,KAAK,mBAAmB,GAAM,EAAK,EACnC,GAAM,eACR,EAAU,EAAK,OAAO,IAAQ,EAAE;;GAGnC,YAAY,EACX,IAAyB,mBAAQ,GAAO,MAAU;AACpD,KAAI,EAAM,WAAW,EACnB,QAAO,EAAE;CAEX,IAAI,IAAS,OAAO,OAAO,EAAE,EAAE,EAAM;AAMrC,QALA,EAAM,SAAS,MAAS;EAEtB,IAAM,IAAS,EAAO,GADL,EAAM,SAAS,EAAK,CACC;AACtC,MAAS,CAAC,GAAG,GAAQ,GAAG,EAAO;GAC/B,EACK;GACN,SAAS,EACR,IAAuC,mBAAQ,MAAU,EAAO,GAAO,EAAM,UAAU,CAAC,EAAE,uBAAuB,EAGjH,IAAkC,kBAAO,OAAO,GAAO,GAAO,GAAa,GAAI,GAAe,MAAe;AAC/G,GAAI,KAAK,iCAAiCE,EAAoB,EAAM,EAAE,EAAc;CACpF,IAAM,IAAM,EAAM,OAAO,CAAC;AAC1B,GAAI,MAAM,kCAAkC,EAAI;CAChD,IAAM,IAAO,EAAM,OAAO,IAAI,CAAC,KAAK,SAAS,OAAO;AAMpD,CALK,EAAM,OAAO,GAGhB,EAAI,KAAK,wBAAwB,EAAM,OAAO,CAAC,GAF/C,EAAI,KAAK,sBAAsB,EAAM,EAInC,EAAM,OAAO,CAAC,SAAS,KACzB,EAAI,KAAK,mBAAmB,EAAM,KAAK,EAAM,OAAO,CAAC,GAAG,CAAC;CAE3D,IAAM,IAAW,EAAK,OAAO,IAAI,CAAC,KAAK,SAAS,WAAW,EACrD,IAAY,EAAK,OAAO,IAAI,CAAC,KAAK,SAAS,YAAY,EACvD,IAAa,EAAK,OAAO,IAAI,CAAC,KAAK,SAAS,aAAa,EACzD,IAAQ,EAAK,OAAO,IAAI,CAAC,KAAK,SAAS,QAAQ;AAiGrD,CAhGA,MAAM,QAAQ,IACZ,EAAM,OAAO,CAAC,IAAI,eAAe,GAAG;EAClC,IAAM,IAAO,EAAM,KAAK,EAAE;AAC1B,MAAI,MAAkB,KAAK,GAAG;GAC5B,IAAM,IAAO,KAAK,MAAM,KAAK,UAAU,EAAc,YAAY,CAAC;AAUlE,GATA,EAAI,MACF,oDACA,GACA,YACA,EAAK,QACL,oBACA,EAAc,OACf,EACD,EAAM,QAAQ,EAAc,IAAI,EAAK,EAChC,EAAM,OAAO,EAAE,KAClB,EAAI,MAAM,kBAAkB,GAAG,EAAc,GAAG,EAChD,EAAM,UAAU,GAAG,EAAc,IAAI,EAAK;;AAI9C,MADA,EAAI,KAAK,sBAAsB,IAAI,OAAO,KAAK,UAAU,EAAM,KAAK,EAAE,CAAC,CAAC,EACpE,GAAM,aAAa;AACrB,KAAI,KAAK,0BAA0B,GAAG,EAAK,OAAO,EAAM,KAAK,EAAE,CAAC;GAChE,IAAM,EAAE,YAAS,eAAY,EAAM,OAAO;AAC1C,KAAK,MAAM,SAAS;IAClB,GAAG,EAAK,MAAM,OAAO;IACrB,SAAS,IAAU;IACnB;IACD,CAAC;GACF,IAAM,IAAI,MAAM,EACd,GACA,EAAK,OACL,GACA,GACA,EAAM,KAAK,EAAE,EACb,EACD,EACK,IAAQ,EAAE;AAchB,GAbA,EAAiB,GAAM,EAAM,EAC7B,EAAK,OAAO,EAAE,QAAQ,GACtB,EAAI,KACF,gDACA,GACA,SAEA,EAAK,OACL,UACA,EAAK,OAGN,EACD,EAAY,GAAO,EAAK;SAEpB,EAAM,SAAS,EAAE,CAAC,SAAS,KAC7B,EAAI,MACF,wCACA,GACA,EAAK,IACL,GACA,EAAK,OACL,UACA,EACD,EACD,EAAI,MAAM,EAAoB,EAAK,IAAI,EAAM,CAAC,EAC9C,EAAU,IAAI,EAAK,IAAI;GAAE,IAAI,EAAoB,EAAK,IAAI,EAAM;GAAE;GAAM,CAAC,KAEzE,EAAI,MAAM,qCAAqC,GAAG,GAAO,EAAM,KAAK,EAAE,EAAE,EAAI,EAC5E,MAAM,EAAW,GAAO,EAAM,KAAK,EAAE,EAAE;GAAE,QAAQ;GAAY;GAAK,CAAC;GAGvE,CACH,EAoBD,OAnBqC,kBAAO,YAAY;EACtD,IAAM,IAAe,EAAM,OAAO,CAAC,IAAI,eAAe,GAAG;GACvD,IAAM,IAAO,EAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK;AAazC,GAZA,EAAI,KAAK,UAAU,EAAE,IAAI,SAAS,EAAE,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC,EACjE,EAAI,KAAK,UAAU,EAAE,IAAI,SAAS,EAAE,IAAI,MAAM,GAAG,KAAK,KAAK,UAAU,EAAM,KAAK,EAAE,CAAC,CAAC,EACpF,EAAI,KACF,OACA,GACA,QACA,EAAE,GACF,EAAE,GACF,iBACA,EAAU,IAAI,EAAE,EAAE,EAClB,EAAU,IAAI,EAAE,EAAE,CACnB,EACD,MAAM,EAAgB,GAAY,EAAK;IACvC;AACF,QAAM,QAAQ,IAAI,EAAa;IAC9B,eAAe,GACE,EACpB,EAAI,KAAK,wBAAwB,KAAK,UAAUA,EAAoB,EAAM,CAAC,CAAC,EAC5E,EAAI,KAAK,oDAAoD,EAC7D,EAAI,KAAK,oDAAoD,EAC7D,EAAI,KAAK,oDAAoD,EAC7D,EAAY,EAAM,EAClB,EAAI,KAAK,uBAAuB,KAAK,UAAUA,EAAoB,EAAM,CAAC,CAAC;CAC3E,IAAI,IAAO,GACP,EAAE,gCAA6B,EAAwB,EAAW;AAuFtE,QAtFA,MAAM,QAAQ,IACZ,EAAqB,EAAM,CAAC,IAAI,eAAe,GAAG;EAChD,IAAM,IAAO,EAAM,KAAK,EAAE;AAS1B,MARA,EAAI,KACF,qBAAqB,IAAI,QAAQ,EAAK,GACtC,MAAM,EAAK,GACX,aACA,EAAK,OACL,aACA,EAAK,OACN,EACG,GAAM,YAaR,CAZA,EAAK,KAAK,GACV,EAAI,KACF,+BACA,GACA,EAAK,IACL,EAAK,OACL,EAAK,QACL,EAAK,GACL,EAAK,GACL,EAAM,OAAO,EAAE,CAChB,EACD,EAAU,IAAI,EAAK,GAAG,CAAC,OAAO,GAC9B,EAAa,EAAK;WAEd,EAAM,SAAS,EAAE,CAAC,SAAS,GAAG;AAYhC,GAXA,EAAI,KACF,4BACA,GACA,EAAK,IACL,EAAK,GACL,EAAK,GACL,EAAK,OACL,EAAK,QACL,EAAM,OAAO,EAAE,CAChB,EACD,EAAK,UAAU,GACf,EAAM,KAAK,EAAK,SAAS;GACzB,IAAM,IAAc,GAAM,UAAU,KAAK,GACnC,IAAc,GAAM,WAAW,UAAU,GACzC,IAAU,IAAc,KAAe;AAG7C,GAFA,EAAI,MAAM,WAAW,GAAS,eAAe,GAAa,eAAe,EAAY,EACrF,MAAM,EAAc,GAAU,EAAK,EACnC,EAAU,IAAI,EAAK,GAAG,CAAC,OAAO;SACzB;GACL,IAAM,IAAS,EAAM,KAAK,EAAK,SAAS;AAkBxC,GAjBA,EAAK,KAAK,IAA2B,GACrC,EAAI,KACF,2CACA,EAAK,IACL,UACA,EAAK,UACL,EAAK,OACL,EAAK,QACL,EAAK,GACL,EAAK,GACL,WACA,EAAK,SACL,UACA,GACA,GAAQ,SACR,EACD,EACD,EAAa,EAAK;;GAGtB,CACH,EACD,EAAM,OAAO,CAAC,QAAQ,SAAS,GAAG;EAChC,IAAM,IAAO,EAAM,KAAK,EAAE;AAM1B,EALA,EAAI,KAAK,UAAU,EAAE,IAAI,SAAS,EAAE,IAAI,OAAO,KAAK,UAAU,EAAK,EAAE,EAAK,EAC1E,EAAK,OAAO,SAAS,MAAU,EAAM,KAAK,IAA2B,EAAE,EAIvE,EAAkB,GADJ,EAAW,GAAW,GAAM,GAAW,GAFnC,EAAM,KAAK,EAAE,EAAE,EACnB,EAAM,KAAK,EAAE,EAAE,EACyD,EAAG,CAC3D;GAC9B,EACF,EAAM,OAAO,CAAC,QAAQ,SAAS,GAAG;EAChC,IAAM,IAAI,EAAM,KAAK,EAAE;AAEvB,EADA,EAAI,KAAK,GAAG,EAAE,MAAM,EAAE,KAAK,EACvB,EAAE,YACJ,IAAO,EAAE;GAEX,EACF,EAAI,KAAK,uCAAuC,GAAM,EAAK,EACpD;EAAE;EAAM;EAAM;GACpB,kBAAkB,EACjB,IAAyB,kBAAO,OAAO,GAAa,MAAQ;CAC9D,IAAM,IAAQ,IAAIC,EAAgB;EAChC,YAAY;EACZ,UAAU;EACX,CAAC,CAAC,SAAS;EACV,SAAS,EAAY;EACrB,SAAS,EAAY,QAAQ,eAAe,EAAY,QAAQ,WAAW,eAAe,EAAY;EACtG,SAAS,EAAY,QAAQ,eAAe,EAAY,QAAQ,WAAW,eAAe,EAAY;EACtG,SAAS;EACT,SAAS;EACV,CAAC,CAAC,oBAAoB,WAAW;AAChC,SAAO,EAAE;GACT,EACI,IAAU,EAAI,OAAO,IAAI;AAwE/B,CAvEA,EAAgB,GAAS,EAAY,SAAS,EAAY,MAAM,EAAY,UAAU,EACtF,GAAQ,EACR,GAAQ,EACR,GAAO,EACP,GAAQ,EACR,EAAY,MAAM,SAAS,MAAS;AAElC,EADA,EAAM,QAAQ,EAAK,IAAI,EAAE,GAAG,GAAM,CAAC,EAC/B,EAAK,YACP,EAAM,UAAU,EAAK,IAAI,EAAK,SAAS;GAEzC,EACF,EAAI,MAAM,UAAU,EAAY,MAAM,EACtC,EAAY,MAAM,SAAS,MAAS;AAClC,MAAI,EAAK,UAAU,EAAK,KAAK;GAC3B,IAAM,IAAS,EAAK,OACd,IAAa,IAAS,QAAQ,IAAS,QACvC,IAAa,IAAS,QAAQ,IAAS,QACvC,IAAO,EAAM,KAAK,EAAO;AA4B/B,GA3BA,EAAM,QAAQ,GAAY;IACxB,OAAO;IACP,IAAI;IACJ,UAAU,EAAK;IACf,YAAY;IACZ,OAAO;IACP,SAAS;IACT,OAAO;IAEP,OAAO;IACP,OAAO;IACP,QAAQ;IACT,CAAC,EACF,EAAM,UAAU,GAAY,EAAK,SAAS,EAC1C,EAAM,QAAQ,GAAY;IACxB,OAAO;IACP,IAAI;IACJ,UAAU,EAAK;IACf,YAAY;IACZ,SAAS;IAET,OAAO;IACP,OAAO;IACP,OAAO;IACP,OAAO;IACP,QAAQ;IACT,CAAC,EACF,EAAM,UAAU,GAAY,EAAK,SAAS;GAC1C,IAAM,IAAQ,gBAAgB,EAAK,EAC7B,IAAU,gBAAgB,EAAK,EAC/B,IAAQ,gBAAgB,EAAK;AAgBnC,GAfA,EAAM,QAAQ,IACd,EAAM,eAAe,QACrB,EAAM,KAAK,IAAS,qBACpB,EAAQ,iBAAiB,QACzB,EAAQ,eAAe,QACvB,EAAQ,KAAK,IAAS,uBACtB,EAAM,QAAQ,IACV,EAAK,YACP,EAAM,cAAc,GACpB,EAAM,YAAY,IAEpB,EAAM,KAAK,IAAS,qBACpB,EAAM,iBAAiB,QACvB,EAAM,QAAQ,GAAQ,GAAY,GAAO,IAAS,oBAAoB,EACtE,EAAM,QAAQ,GAAY,GAAY,GAAS,IAAS,oBAAoB,EAC5E,EAAM,QAAQ,GAAY,GAAQ,GAAO,IAAS,qBAAqB;QAEvE,GAAM,QAAQ,EAAK,OAAO,EAAK,KAAK,EAAE,GAAG,GAAM,EAAE,EAAK,GAAG;GAE3D,EACF,EAAI,KAAK,mBAAmB,KAAK,UAAUD,EAAoB,EAAM,CAAC,CAAC,EACvE,EAAuB,EAAM,EAC7B,EAAI,KAAK,oBAAoB,KAAK,UAAUA,EAAoB,EAAM,CAAC,CAAC;CACxE,IAAM,IAAaE,GAAW;AAC9B,OAAM,EACJ,GACA,GACA,EAAY,MACZ,EAAY,WACZ,KAAK,GACL,EACD;GACA,SAAS"}

package/dist/diagram-E7M64L7V-Co7O3gub.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"diagram-E7M64L7V-Co7O3gub.js","names":["node_count","node_each","node_eachAfter","node_eachBefore","node_find","node_sum","node_sort","node_path","node_ancestors","node_descendants","node_leaves","node_links","node_iterator","squarify","roundNode","constant","scaleOrdinal","treemap","select"],"sources":["../node_modules/d3-hierarchy/src/hierarchy/count.js","../node_modules/d3-hierarchy/src/hierarchy/each.js","../node_modules/d3-hierarchy/src/hierarchy/eachBefore.js","../node_modules/d3-hierarchy/src/hierarchy/eachAfter.js","../node_modules/d3-hierarchy/src/hierarchy/find.js","../node_modules/d3-hierarchy/src/hierarchy/sum.js","../node_modules/d3-hierarchy/src/hierarchy/sort.js","../node_modules/d3-hierarchy/src/hierarchy/path.js","../node_modules/d3-hierarchy/src/hierarchy/ancestors.js","../node_modules/d3-hierarchy/src/hierarchy/descendants.js","../node_modules/d3-hierarchy/src/hierarchy/leaves.js","../node_modules/d3-hierarchy/src/hierarchy/links.js","../node_modules/d3-hierarchy/src/hierarchy/iterator.js","../node_modules/d3-hierarchy/src/hierarchy/index.js","../node_modules/d3-hierarchy/src/accessors.js","../node_modules/d3-hierarchy/src/constant.js","../node_modules/d3-hierarchy/src/treemap/round.js","../node_modules/d3-hierarchy/src/treemap/dice.js","../node_modules/d3-hierarchy/src/treemap/slice.js","../node_modules/d3-hierarchy/src/treemap/squarify.js","../node_modules/d3-hierarchy/src/treemap/index.js","../node_modules/mermaid/dist/chunks/mermaid.core/diagram-E7M64L7V.mjs"],"sourcesContent":["function count(node) {\n  var sum = 0,\n      children = node.children,\n      i = children && children.length;\n  if (!i) sum = 1;\n  else while (--i >= 0) sum += children[i].value;\n  node.value = sum;\n}\n\nexport default function() {\n  return this.eachAfter(count);\n}\n","export default function(callback, that) {\n  let index = -1;\n  for (const node of this) {\n    callback.call(that, node, ++index, this);\n  }\n  return this;\n}\n","export default function(callback, that) {\n  var node = this, nodes = [node], children, i, index = -1;\n  while (node = nodes.pop()) {\n    callback.call(that, node, ++index, this);\n    if (children = node.children) {\n      for (i = children.length - 1; i >= 0; --i) {\n        nodes.push(children[i]);\n      }\n    }\n  }\n  return this;\n}\n","export default function(callback, that) {\n  var node = this, nodes = [node], next = [], children, i, n, index = -1;\n  while (node = nodes.pop()) {\n    next.push(node);\n    if (children = node.children) {\n      for (i = 0, n = children.length; i < n; ++i) {\n        nodes.push(children[i]);\n      }\n    }\n  }\n  while (node = next.pop()) {\n    callback.call(that, node, ++index, this);\n  }\n  return this;\n}\n","export default function(callback, that) {\n  let index = -1;\n  for (const node of this) {\n    if (callback.call(that, node, ++index, this)) {\n      return node;\n    }\n  }\n}\n","export default function(value) {\n  return this.eachAfter(function(node) {\n    var sum = +value(node.data) || 0,\n        children = node.children,\n        i = children && children.length;\n    while (--i >= 0) sum += children[i].value;\n    node.value = sum;\n  });\n}\n","export default function(compare) {\n  return this.eachBefore(function(node) {\n    if (node.children) {\n      node.children.sort(compare);\n    }\n  });\n}\n","export default function(end) {\n  var start = this,\n      ancestor = leastCommonAncestor(start, end),\n      nodes = [start];\n  while (start !== ancestor) {\n    start = start.parent;\n    nodes.push(start);\n  }\n  var k = nodes.length;\n  while (end !== ancestor) {\n    nodes.splice(k, 0, end);\n    end = end.parent;\n  }\n  return nodes;\n}\n\nfunction leastCommonAncestor(a, b) {\n  if (a === b) return a;\n  var aNodes = a.ancestors(),\n      bNodes = b.ancestors(),\n      c = null;\n  a = aNodes.pop();\n  b = bNodes.pop();\n  while (a === b) {\n    c = a;\n    a = aNodes.pop();\n    b = bNodes.pop();\n  }\n  return c;\n}\n","export default function() {\n  var node = this, nodes = [node];\n  while (node = node.parent) {\n    nodes.push(node);\n  }\n  return nodes;\n}\n","export default function() {\n  return Array.from(this);\n}\n","export default function() {\n  var leaves = [];\n  this.eachBefore(function(node) {\n    if (!node.children) {\n      leaves.push(node);\n    }\n  });\n  return leaves;\n}\n","export default function() {\n  var root = this, links = [];\n  root.each(function(node) {\n    if (node !== root) { // Don’t include the root’s parent, if any.\n      links.push({source: node.parent, target: node});\n    }\n  });\n  return links;\n}\n","export default function*() {\n  var node = this, current, next = [node], children, i, n;\n  do {\n    current = next.reverse(), next = [];\n    while (node = current.pop()) {\n      yield node;\n      if (children = node.children) {\n        for (i = 0, n = children.length; i < n; ++i) {\n          next.push(children[i]);\n        }\n      }\n    }\n  } while (next.length);\n}\n","import node_count from \"./count.js\";\nimport node_each from \"./each.js\";\nimport node_eachBefore from \"./eachBefore.js\";\nimport node_eachAfter from \"./eachAfter.js\";\nimport node_find from \"./find.js\";\nimport node_sum from \"./sum.js\";\nimport node_sort from \"./sort.js\";\nimport node_path from \"./path.js\";\nimport node_ancestors from \"./ancestors.js\";\nimport node_descendants from \"./descendants.js\";\nimport node_leaves from \"./leaves.js\";\nimport node_links from \"./links.js\";\nimport node_iterator from \"./iterator.js\";\n\nexport default function hierarchy(data, children) {\n  if (data instanceof Map) {\n    data = [undefined, data];\n    if (children === undefined) children = mapChildren;\n  } else if (children === undefined) {\n    children = objectChildren;\n  }\n\n  var root = new Node(data),\n      node,\n      nodes = [root],\n      child,\n      childs,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if ((childs = children(node.data)) && (n = (childs = Array.from(childs)).length)) {\n      node.children = childs;\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = childs[i] = new Node(childs[i]));\n        child.parent = node;\n        child.depth = node.depth + 1;\n      }\n    }\n  }\n\n  return root.eachBefore(computeHeight);\n}\n\nfunction node_copy() {\n  return hierarchy(this).eachBefore(copyData);\n}\n\nfunction objectChildren(d) {\n  return d.children;\n}\n\nfunction mapChildren(d) {\n  return Array.isArray(d) ? d[1] : null;\n}\n\nfunction copyData(node) {\n  if (node.data.value !== undefined) node.value = node.data.value;\n  node.data = node.data.data;\n}\n\nexport function computeHeight(node) {\n  var height = 0;\n  do node.height = height;\n  while ((node = node.parent) && (node.height < ++height));\n}\n\nexport function Node(data) {\n  this.data = data;\n  this.depth =\n  this.height = 0;\n  this.parent = null;\n}\n\nNode.prototype = hierarchy.prototype = {\n  constructor: Node,\n  count: node_count,\n  each: node_each,\n  eachAfter: node_eachAfter,\n  eachBefore: node_eachBefore,\n  find: node_find,\n  sum: node_sum,\n  sort: node_sort,\n  path: node_path,\n  ancestors: node_ancestors,\n  descendants: node_descendants,\n  leaves: node_leaves,\n  links: node_links,\n  copy: node_copy,\n  [Symbol.iterator]: node_iterator\n};\n","export function optional(f) {\n  return f == null ? null : required(f);\n}\n\nexport function required(f) {\n  if (typeof f !== \"function\") throw new Error;\n  return f;\n}\n","export function constantZero() {\n  return 0;\n}\n\nexport default function(x) {\n  return function() {\n    return x;\n  };\n}\n","export default function(node) {\n  node.x0 = Math.round(node.x0);\n  node.y0 = Math.round(node.y0);\n  node.x1 = Math.round(node.x1);\n  node.y1 = Math.round(node.y1);\n}\n","export default function(parent, x0, y0, x1, y1) {\n  var nodes = parent.children,\n      node,\n      i = -1,\n      n = nodes.length,\n      k = parent.value && (x1 - x0) / parent.value;\n\n  while (++i < n) {\n    node = nodes[i], node.y0 = y0, node.y1 = y1;\n    node.x0 = x0, node.x1 = x0 += node.value * k;\n  }\n}\n","export default function(parent, x0, y0, x1, y1) {\n  var nodes = parent.children,\n      node,\n      i = -1,\n      n = nodes.length,\n      k = parent.value && (y1 - y0) / parent.value;\n\n  while (++i < n) {\n    node = nodes[i], node.x0 = x0, node.x1 = x1;\n    node.y0 = y0, node.y1 = y0 += node.value * k;\n  }\n}\n","import treemapDice from \"./dice.js\";\nimport treemapSlice from \"./slice.js\";\n\nexport var phi = (1 + Math.sqrt(5)) / 2;\n\nexport function squarifyRatio(ratio, parent, x0, y0, x1, y1) {\n  var rows = [],\n      nodes = parent.children,\n      row,\n      nodeValue,\n      i0 = 0,\n      i1 = 0,\n      n = nodes.length,\n      dx, dy,\n      value = parent.value,\n      sumValue,\n      minValue,\n      maxValue,\n      newRatio,\n      minRatio,\n      alpha,\n      beta;\n\n  while (i0 < n) {\n    dx = x1 - x0, dy = y1 - y0;\n\n    // Find the next non-empty node.\n    do sumValue = nodes[i1++].value; while (!sumValue && i1 < n);\n    minValue = maxValue = sumValue;\n    alpha = Math.max(dy / dx, dx / dy) / (value * ratio);\n    beta = sumValue * sumValue * alpha;\n    minRatio = Math.max(maxValue / beta, beta / minValue);\n\n    // Keep adding nodes while the aspect ratio maintains or improves.\n    for (; i1 < n; ++i1) {\n      sumValue += nodeValue = nodes[i1].value;\n      if (nodeValue < minValue) minValue = nodeValue;\n      if (nodeValue > maxValue) maxValue = nodeValue;\n      beta = sumValue * sumValue * alpha;\n      newRatio = Math.max(maxValue / beta, beta / minValue);\n      if (newRatio > minRatio) { sumValue -= nodeValue; break; }\n      minRatio = newRatio;\n    }\n\n    // Position and record the row orientation.\n    rows.push(row = {value: sumValue, dice: dx < dy, children: nodes.slice(i0, i1)});\n    if (row.dice) treemapDice(row, x0, y0, x1, value ? y0 += dy * sumValue / value : y1);\n    else treemapSlice(row, x0, y0, value ? x0 += dx * sumValue / value : x1, y1);\n    value -= sumValue, i0 = i1;\n  }\n\n  return rows;\n}\n\nexport default (function custom(ratio) {\n\n  function squarify(parent, x0, y0, x1, y1) {\n    squarifyRatio(ratio, parent, x0, y0, x1, y1);\n  }\n\n  squarify.ratio = function(x) {\n    return custom((x = +x) > 1 ? x : 1);\n  };\n\n  return squarify;\n})(phi);\n","import roundNode from \"./round.js\";\nimport squarify from \"./squarify.js\";\nimport {required} from \"../accessors.js\";\nimport constant, {constantZero} from \"../constant.js\";\n\nexport default function() {\n  var tile = squarify,\n      round = false,\n      dx = 1,\n      dy = 1,\n      paddingStack = [0],\n      paddingInner = constantZero,\n      paddingTop = constantZero,\n      paddingRight = constantZero,\n      paddingBottom = constantZero,\n      paddingLeft = constantZero;\n\n  function treemap(root) {\n    root.x0 =\n    root.y0 = 0;\n    root.x1 = dx;\n    root.y1 = dy;\n    root.eachBefore(positionNode);\n    paddingStack = [0];\n    if (round) root.eachBefore(roundNode);\n    return root;\n  }\n\n  function positionNode(node) {\n    var p = paddingStack[node.depth],\n        x0 = node.x0 + p,\n        y0 = node.y0 + p,\n        x1 = node.x1 - p,\n        y1 = node.y1 - p;\n    if (x1 < x0) x0 = x1 = (x0 + x1) / 2;\n    if (y1 < y0) y0 = y1 = (y0 + y1) / 2;\n    node.x0 = x0;\n    node.y0 = y0;\n    node.x1 = x1;\n    node.y1 = y1;\n    if (node.children) {\n      p = paddingStack[node.depth + 1] = paddingInner(node) / 2;\n      x0 += paddingLeft(node) - p;\n      y0 += paddingTop(node) - p;\n      x1 -= paddingRight(node) - p;\n      y1 -= paddingBottom(node) - p;\n      if (x1 < x0) x0 = x1 = (x0 + x1) / 2;\n      if (y1 < y0) y0 = y1 = (y0 + y1) / 2;\n      tile(node, x0, y0, x1, y1);\n    }\n  }\n\n  treemap.round = function(x) {\n    return arguments.length ? (round = !!x, treemap) : round;\n  };\n\n  treemap.size = function(x) {\n    return arguments.length ? (dx = +x[0], dy = +x[1], treemap) : [dx, dy];\n  };\n\n  treemap.tile = function(x) {\n    return arguments.length ? (tile = required(x), treemap) : tile;\n  };\n\n  treemap.padding = function(x) {\n    return arguments.length ? treemap.paddingInner(x).paddingOuter(x) : treemap.paddingInner();\n  };\n\n  treemap.paddingInner = function(x) {\n    return arguments.length ? (paddingInner = typeof x === \"function\" ? x : constant(+x), treemap) : paddingInner;\n  };\n\n  treemap.paddingOuter = function(x) {\n    return arguments.length ? treemap.paddingTop(x).paddingRight(x).paddingBottom(x).paddingLeft(x) : treemap.paddingTop();\n  };\n\n  treemap.paddingTop = function(x) {\n    return arguments.length ? (paddingTop = typeof x === \"function\" ? x : constant(+x), treemap) : paddingTop;\n  };\n\n  treemap.paddingRight = function(x) {\n    return arguments.length ? (paddingRight = typeof x === \"function\" ? x : constant(+x), treemap) : paddingRight;\n  };\n\n  treemap.paddingBottom = function(x) {\n    return arguments.length ? (paddingBottom = typeof x === \"function\" ? x : constant(+x), treemap) : paddingBottom;\n  };\n\n  treemap.paddingLeft = function(x) {\n    return arguments.length ? (paddingLeft = typeof x === \"function\" ? x : constant(+x), treemap) : paddingLeft;\n  };\n\n  return treemap;\n}\n","import {\n  selectSvgElement\n} from \"./chunk-HHEYEP7N.mjs\";\nimport {\n  setupViewPortForSVG\n} from \"./chunk-KX2RTZJC.mjs\";\nimport {\n  isLabelStyle,\n  styles2String\n} from \"./chunk-PQ6SQG4A.mjs\";\nimport {\n  populateCommonDb\n} from \"./chunk-4BX2VUAB.mjs\";\nimport {\n  cleanAndMerge\n} from \"./chunk-GEFDOKGD.mjs\";\nimport {\n  clear,\n  configureSvgSize,\n  defaultConfig_default,\n  getAccDescription,\n  getAccTitle,\n  getConfig,\n  getDiagramTitle,\n  setAccDescription,\n  setAccTitle,\n  setDiagramTitle\n} from \"./chunk-7R4GIKGN.mjs\";\nimport {\n  __name,\n  log\n} from \"./chunk-AGHRB4JF.mjs\";\n\n// src/diagrams/treemap/db.ts\nvar TreeMapDB = class {\n  constructor() {\n    this.nodes = [];\n    this.levels = /* @__PURE__ */ new Map();\n    this.outerNodes = [];\n    this.classes = /* @__PURE__ */ new Map();\n    this.setAccTitle = setAccTitle;\n    this.getAccTitle = getAccTitle;\n    this.setDiagramTitle = setDiagramTitle;\n    this.getDiagramTitle = getDiagramTitle;\n    this.getAccDescription = getAccDescription;\n    this.setAccDescription = setAccDescription;\n  }\n  static {\n    __name(this, \"TreeMapDB\");\n  }\n  getNodes() {\n    return this.nodes;\n  }\n  getConfig() {\n    const defaultConfig = defaultConfig_default;\n    const userConfig = getConfig();\n    return cleanAndMerge({\n      ...defaultConfig.treemap,\n      ...userConfig.treemap ?? {}\n    });\n  }\n  addNode(node, level) {\n    this.nodes.push(node);\n    this.levels.set(node, level);\n    if (level === 0) {\n      this.outerNodes.push(node);\n      this.root ??= node;\n    }\n  }\n  getRoot() {\n    return { name: \"\", children: this.outerNodes };\n  }\n  addClass(id, _style) {\n    const styleClass = this.classes.get(id) ?? { id, styles: [], textStyles: [] };\n    const styles = _style.replace(/\\\\,/g, \"\\xA7\\xA7\\xA7\").replace(/,/g, \";\").replace(/§§§/g, \",\").split(\";\");\n    if (styles) {\n      styles.forEach((s) => {\n        if (isLabelStyle(s)) {\n          if (styleClass?.textStyles) {\n            styleClass.textStyles.push(s);\n          } else {\n            styleClass.textStyles = [s];\n          }\n        }\n        if (styleClass?.styles) {\n          styleClass.styles.push(s);\n        } else {\n          styleClass.styles = [s];\n        }\n      });\n    }\n    this.classes.set(id, styleClass);\n  }\n  getClasses() {\n    return this.classes;\n  }\n  getStylesForClass(classSelector) {\n    return this.classes.get(classSelector)?.styles ?? [];\n  }\n  clear() {\n    clear();\n    this.nodes = [];\n    this.levels = /* @__PURE__ */ new Map();\n    this.outerNodes = [];\n    this.classes = /* @__PURE__ */ new Map();\n    this.root = void 0;\n  }\n};\n\n// src/diagrams/treemap/parser.ts\nimport { parse } from \"@mermaid-js/parser\";\n\n// src/diagrams/treemap/utils.ts\nfunction buildHierarchy(items) {\n  if (!items.length) {\n    return [];\n  }\n  const root = [];\n  const stack = [];\n  items.forEach((item) => {\n    const node = {\n      name: item.name,\n      children: item.type === \"Leaf\" ? void 0 : []\n    };\n    node.classSelector = item?.classSelector;\n    if (item?.cssCompiledStyles) {\n      node.cssCompiledStyles = item.cssCompiledStyles;\n    }\n    if (item.type === \"Leaf\" && item.value !== void 0) {\n      node.value = item.value;\n    }\n    while (stack.length > 0 && stack[stack.length - 1].level >= item.level) {\n      stack.pop();\n    }\n    if (stack.length === 0) {\n      root.push(node);\n    } else {\n      const parent = stack[stack.length - 1].node;\n      if (parent.children) {\n        parent.children.push(node);\n      } else {\n        parent.children = [node];\n      }\n    }\n    if (item.type !== \"Leaf\") {\n      stack.push({ node, level: item.level });\n    }\n  });\n  return root;\n}\n__name(buildHierarchy, \"buildHierarchy\");\n\n// src/diagrams/treemap/parser.ts\nvar populate = /* @__PURE__ */ __name((ast, db) => {\n  populateCommonDb(ast, db);\n  const items = [];\n  for (const row of ast.TreemapRows ?? []) {\n    if (row.$type === \"ClassDefStatement\") {\n      db.addClass(row.className ?? \"\", row.styleText ?? \"\");\n    }\n  }\n  for (const row of ast.TreemapRows ?? []) {\n    const item = row.item;\n    if (!item) {\n      continue;\n    }\n    const level = row.indent ? parseInt(row.indent) : 0;\n    const name = getItemName(item);\n    const styles = item.classSelector ? db.getStylesForClass(item.classSelector) : [];\n    const cssCompiledStyles = styles.length > 0 ? styles : void 0;\n    const itemData = {\n      level,\n      name,\n      type: item.$type,\n      value: item.value,\n      classSelector: item.classSelector,\n      cssCompiledStyles\n    };\n    items.push(itemData);\n  }\n  const hierarchyNodes = buildHierarchy(items);\n  const addNodesRecursively = /* @__PURE__ */ __name((nodes, level) => {\n    for (const node of nodes) {\n      db.addNode(node, level);\n      if (node.children && node.children.length > 0) {\n        addNodesRecursively(node.children, level + 1);\n      }\n    }\n  }, \"addNodesRecursively\");\n  addNodesRecursively(hierarchyNodes, 0);\n}, \"populate\");\nvar getItemName = /* @__PURE__ */ __name((item) => {\n  return item.name ? String(item.name) : \"\";\n}, \"getItemName\");\nvar parser = {\n  // @ts-expect-error - TreeMapDB is not assignable to DiagramDB\n  parser: { yy: void 0 },\n  parse: /* @__PURE__ */ __name(async (text) => {\n    try {\n      const parseFunc = parse;\n      const ast = await parseFunc(\"treemap\", text);\n      log.debug(\"Treemap AST:\", ast);\n      const db = parser.parser?.yy;\n      if (!(db instanceof TreeMapDB)) {\n        throw new Error(\n          \"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.\"\n        );\n      }\n      populate(ast, db);\n    } catch (error) {\n      log.error(\"Error parsing treemap:\", error);\n      throw error;\n    }\n  }, \"parse\")\n};\n\n// src/diagrams/treemap/renderer.ts\nimport { scaleOrdinal, treemap, hierarchy, format, select } from \"d3\";\nvar DEFAULT_INNER_PADDING = 10;\nvar SECTION_INNER_PADDING = 10;\nvar SECTION_HEADER_HEIGHT = 25;\nvar draw = /* @__PURE__ */ __name((_text, id, _version, diagram2) => {\n  const treemapDb = diagram2.db;\n  const config = treemapDb.getConfig();\n  const treemapInnerPadding = config.padding ?? DEFAULT_INNER_PADDING;\n  const title = treemapDb.getDiagramTitle();\n  const root = treemapDb.getRoot();\n  const { themeVariables } = getConfig();\n  if (!root) {\n    return;\n  }\n  const titleHeight = title ? 30 : 0;\n  const svg = selectSvgElement(id);\n  const width = config.nodeWidth ? config.nodeWidth * SECTION_INNER_PADDING : 960;\n  const height = config.nodeHeight ? config.nodeHeight * SECTION_INNER_PADDING : 500;\n  const svgWidth = width;\n  const svgHeight = height + titleHeight;\n  svg.attr(\"viewBox\", `0 0 ${svgWidth} ${svgHeight}`);\n  configureSvgSize(svg, svgHeight, svgWidth, config.useMaxWidth);\n  let valueFormat;\n  try {\n    const formatStr = config.valueFormat || \",\";\n    if (formatStr === \"$0,0\") {\n      valueFormat = /* @__PURE__ */ __name((value) => \"$\" + format(\",\")(value), \"valueFormat\");\n    } else if (formatStr.startsWith(\"$\") && formatStr.includes(\",\")) {\n      const precision = /\\.\\d+/.exec(formatStr);\n      const precisionStr = precision ? precision[0] : \"\";\n      valueFormat = /* @__PURE__ */ __name((value) => \"$\" + format(\",\" + precisionStr)(value), \"valueFormat\");\n    } else if (formatStr.startsWith(\"$\")) {\n      const restOfFormat = formatStr.substring(1);\n      valueFormat = /* @__PURE__ */ __name((value) => \"$\" + format(restOfFormat || \"\")(value), \"valueFormat\");\n    } else {\n      valueFormat = format(formatStr);\n    }\n  } catch (error) {\n    log.error(\"Error creating format function:\", error);\n    valueFormat = format(\",\");\n  }\n  const colorScale = scaleOrdinal().range([\n    \"transparent\",\n    themeVariables.cScale0,\n    themeVariables.cScale1,\n    themeVariables.cScale2,\n    themeVariables.cScale3,\n    themeVariables.cScale4,\n    themeVariables.cScale5,\n    themeVariables.cScale6,\n    themeVariables.cScale7,\n    themeVariables.cScale8,\n    themeVariables.cScale9,\n    themeVariables.cScale10,\n    themeVariables.cScale11\n  ]);\n  const colorScalePeer = scaleOrdinal().range([\n    \"transparent\",\n    themeVariables.cScalePeer0,\n    themeVariables.cScalePeer1,\n    themeVariables.cScalePeer2,\n    themeVariables.cScalePeer3,\n    themeVariables.cScalePeer4,\n    themeVariables.cScalePeer5,\n    themeVariables.cScalePeer6,\n    themeVariables.cScalePeer7,\n    themeVariables.cScalePeer8,\n    themeVariables.cScalePeer9,\n    themeVariables.cScalePeer10,\n    themeVariables.cScalePeer11\n  ]);\n  const colorScaleLabel = scaleOrdinal().range([\n    themeVariables.cScaleLabel0,\n    themeVariables.cScaleLabel1,\n    themeVariables.cScaleLabel2,\n    themeVariables.cScaleLabel3,\n    themeVariables.cScaleLabel4,\n    themeVariables.cScaleLabel5,\n    themeVariables.cScaleLabel6,\n    themeVariables.cScaleLabel7,\n    themeVariables.cScaleLabel8,\n    themeVariables.cScaleLabel9,\n    themeVariables.cScaleLabel10,\n    themeVariables.cScaleLabel11\n  ]);\n  if (title) {\n    svg.append(\"text\").attr(\"x\", svgWidth / 2).attr(\"y\", titleHeight / 2).attr(\"class\", \"treemapTitle\").attr(\"text-anchor\", \"middle\").attr(\"dominant-baseline\", \"middle\").text(title);\n  }\n  const g = svg.append(\"g\").attr(\"transform\", `translate(0, ${titleHeight})`).attr(\"class\", \"treemapContainer\");\n  const hierarchyRoot = hierarchy(root).sum((d) => d.value ?? 0).sort((a, b) => (b.value ?? 0) - (a.value ?? 0));\n  const treemapLayout = treemap().size([width, height]).paddingTop(\n    (d) => d.children && d.children.length > 0 ? SECTION_HEADER_HEIGHT + SECTION_INNER_PADDING : 0\n  ).paddingInner(treemapInnerPadding).paddingLeft((d) => d.children && d.children.length > 0 ? SECTION_INNER_PADDING : 0).paddingRight((d) => d.children && d.children.length > 0 ? SECTION_INNER_PADDING : 0).paddingBottom((d) => d.children && d.children.length > 0 ? SECTION_INNER_PADDING : 0).round(true);\n  const treemapData = treemapLayout(hierarchyRoot);\n  const branchNodes = treemapData.descendants().filter((d) => d.children && d.children.length > 0);\n  const sections = g.selectAll(\".treemapSection\").data(branchNodes).enter().append(\"g\").attr(\"class\", \"treemapSection\").attr(\"transform\", (d) => `translate(${d.x0},${d.y0})`);\n  sections.append(\"rect\").attr(\"width\", (d) => d.x1 - d.x0).attr(\"height\", SECTION_HEADER_HEIGHT).attr(\"class\", \"treemapSectionHeader\").attr(\"fill\", \"none\").attr(\"fill-opacity\", 0.6).attr(\"stroke-width\", 0.6).attr(\"style\", (d) => {\n    if (d.depth === 0) {\n      return \"display: none;\";\n    }\n    return \"\";\n  });\n  sections.append(\"clipPath\").attr(\"id\", (_d, i) => `clip-section-${id}-${i}`).append(\"rect\").attr(\"width\", (d) => Math.max(0, d.x1 - d.x0 - 12)).attr(\"height\", SECTION_HEADER_HEIGHT);\n  sections.append(\"rect\").attr(\"width\", (d) => d.x1 - d.x0).attr(\"height\", (d) => d.y1 - d.y0).attr(\"class\", (_d, i) => {\n    return `treemapSection section${i}`;\n  }).attr(\"fill\", (d) => colorScale(d.data.name)).attr(\"fill-opacity\", 0.6).attr(\"stroke\", (d) => colorScalePeer(d.data.name)).attr(\"stroke-width\", 2).attr(\"stroke-opacity\", 0.4).attr(\"style\", (d) => {\n    if (d.depth === 0) {\n      return \"display: none;\";\n    }\n    const styles = styles2String({ cssCompiledStyles: d.data.cssCompiledStyles });\n    return styles.nodeStyles + \";\" + styles.borderStyles.join(\";\");\n  });\n  sections.append(\"text\").attr(\"class\", \"treemapSectionLabel\").attr(\"x\", 6).attr(\"y\", SECTION_HEADER_HEIGHT / 2).attr(\"dominant-baseline\", \"middle\").text((d) => d.depth === 0 ? \"\" : d.data.name).attr(\"font-weight\", \"bold\").attr(\"style\", (d) => {\n    if (d.depth === 0) {\n      return \"display: none;\";\n    }\n    const labelStyles = \"dominant-baseline: middle; font-size: 12px; fill:\" + colorScaleLabel(d.data.name) + \"; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;\";\n    const styles = styles2String({ cssCompiledStyles: d.data.cssCompiledStyles });\n    return labelStyles + styles.labelStyles.replace(\"color:\", \"fill:\");\n  }).each(function(d) {\n    if (d.depth === 0) {\n      return;\n    }\n    const self = select(this);\n    const originalText = d.data.name;\n    self.text(originalText);\n    const totalHeaderWidth = d.x1 - d.x0;\n    const labelXPosition = 6;\n    let spaceForTextContent;\n    if (config.showValues !== false && d.value) {\n      const valueEndsAtXRelative = totalHeaderWidth - 10;\n      const estimatedValueTextActualWidth = 30;\n      const gapBetweenLabelAndValue = 10;\n      const labelMustEndBeforeX = valueEndsAtXRelative - estimatedValueTextActualWidth - gapBetweenLabelAndValue;\n      spaceForTextContent = labelMustEndBeforeX - labelXPosition;\n    } else {\n      const labelOwnRightPadding = 6;\n      spaceForTextContent = totalHeaderWidth - labelXPosition - labelOwnRightPadding;\n    }\n    const minimumWidthToDisplay = 15;\n    const actualAvailableWidth = Math.max(minimumWidthToDisplay, spaceForTextContent);\n    const textNode = self.node();\n    const currentTextContentLength = textNode.getComputedTextLength();\n    if (currentTextContentLength > actualAvailableWidth) {\n      const ellipsis = \"...\";\n      let currentTruncatedText = originalText;\n      while (currentTruncatedText.length > 0) {\n        currentTruncatedText = originalText.substring(0, currentTruncatedText.length - 1);\n        if (currentTruncatedText.length === 0) {\n          self.text(ellipsis);\n          if (textNode.getComputedTextLength() > actualAvailableWidth) {\n            self.text(\"\");\n          }\n          break;\n        }\n        self.text(currentTruncatedText + ellipsis);\n        if (textNode.getComputedTextLength() <= actualAvailableWidth) {\n          break;\n        }\n      }\n    }\n  });\n  if (config.showValues !== false) {\n    sections.append(\"text\").attr(\"class\", \"treemapSectionValue\").attr(\"x\", (d) => d.x1 - d.x0 - 10).attr(\"y\", SECTION_HEADER_HEIGHT / 2).attr(\"text-anchor\", \"end\").attr(\"dominant-baseline\", \"middle\").text((d) => d.value ? valueFormat(d.value) : \"\").attr(\"font-style\", \"italic\").attr(\"style\", (d) => {\n      if (d.depth === 0) {\n        return \"display: none;\";\n      }\n      const labelStyles = \"text-anchor: end; dominant-baseline: middle; font-size: 10px; fill:\" + colorScaleLabel(d.data.name) + \"; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;\";\n      const styles = styles2String({ cssCompiledStyles: d.data.cssCompiledStyles });\n      return labelStyles + styles.labelStyles.replace(\"color:\", \"fill:\");\n    });\n  }\n  const leafNodes = treemapData.leaves();\n  const cell = g.selectAll(\".treemapLeafGroup\").data(leafNodes).enter().append(\"g\").attr(\"class\", (d, i) => {\n    return `treemapNode treemapLeafGroup leaf${i}${d.data.classSelector ? ` ${d.data.classSelector}` : \"\"}x`;\n  }).attr(\"transform\", (d) => `translate(${d.x0},${d.y0})`);\n  cell.append(\"rect\").attr(\"width\", (d) => d.x1 - d.x0).attr(\"height\", (d) => d.y1 - d.y0).attr(\"class\", \"treemapLeaf\").attr(\"fill\", (d) => {\n    return d.parent ? colorScale(d.parent.data.name) : colorScale(d.data.name);\n  }).attr(\"style\", (d) => {\n    const styles = styles2String({ cssCompiledStyles: d.data.cssCompiledStyles });\n    return styles.nodeStyles;\n  }).attr(\"fill-opacity\", 0.3).attr(\"stroke\", (d) => {\n    return d.parent ? colorScale(d.parent.data.name) : colorScale(d.data.name);\n  }).attr(\"stroke-width\", 3);\n  cell.append(\"clipPath\").attr(\"id\", (_d, i) => `clip-${id}-${i}`).append(\"rect\").attr(\"width\", (d) => Math.max(0, d.x1 - d.x0 - 4)).attr(\"height\", (d) => Math.max(0, d.y1 - d.y0 - 4));\n  const leafLabels = cell.append(\"text\").attr(\"class\", \"treemapLabel\").attr(\"x\", (d) => (d.x1 - d.x0) / 2).attr(\"y\", (d) => (d.y1 - d.y0) / 2).attr(\"style\", (d) => {\n    const labelStyles = \"text-anchor: middle; dominant-baseline: middle; font-size: 38px;fill:\" + colorScaleLabel(d.data.name) + \";\";\n    const styles = styles2String({ cssCompiledStyles: d.data.cssCompiledStyles });\n    return labelStyles + styles.labelStyles.replace(\"color:\", \"fill:\");\n  }).attr(\"clip-path\", (_d, i) => `url(#clip-${id}-${i})`).text((d) => d.data.name);\n  leafLabels.each(function(d) {\n    const self = select(this);\n    const nodeWidth = d.x1 - d.x0;\n    const nodeHeight = d.y1 - d.y0;\n    const textNode = self.node();\n    const padding = 4;\n    const availableWidth = nodeWidth - 2 * padding;\n    const availableHeight = nodeHeight - 2 * padding;\n    if (availableWidth < 10 || availableHeight < 10) {\n      self.style(\"display\", \"none\");\n      return;\n    }\n    let currentLabelFontSize = parseInt(self.style(\"font-size\"), 10);\n    const minLabelFontSize = 8;\n    const originalValueRelFontSize = 28;\n    const valueScaleFactor = 0.6;\n    const minValueFontSize = 6;\n    const spacingBetweenLabelAndValue = 2;\n    while (textNode.getComputedTextLength() > availableWidth && currentLabelFontSize > minLabelFontSize) {\n      currentLabelFontSize--;\n      self.style(\"font-size\", `${currentLabelFontSize}px`);\n    }\n    let prospectiveValueFontSize = Math.max(\n      minValueFontSize,\n      Math.min(originalValueRelFontSize, Math.round(currentLabelFontSize * valueScaleFactor))\n    );\n    let combinedHeight = currentLabelFontSize + spacingBetweenLabelAndValue + prospectiveValueFontSize;\n    while (combinedHeight > availableHeight && currentLabelFontSize > minLabelFontSize) {\n      currentLabelFontSize--;\n      prospectiveValueFontSize = Math.max(\n        minValueFontSize,\n        Math.min(originalValueRelFontSize, Math.round(currentLabelFontSize * valueScaleFactor))\n      );\n      if (prospectiveValueFontSize < minValueFontSize && currentLabelFontSize === minLabelFontSize) {\n        break;\n      }\n      self.style(\"font-size\", `${currentLabelFontSize}px`);\n      combinedHeight = currentLabelFontSize + spacingBetweenLabelAndValue + prospectiveValueFontSize;\n      if (prospectiveValueFontSize <= minValueFontSize && combinedHeight > availableHeight) {\n      }\n    }\n    self.style(\"font-size\", `${currentLabelFontSize}px`);\n    if (textNode.getComputedTextLength() > availableWidth || currentLabelFontSize < minLabelFontSize || availableHeight < currentLabelFontSize) {\n      self.style(\"display\", \"none\");\n    }\n  });\n  if (config.showValues !== false) {\n    const leafValues = cell.append(\"text\").attr(\"class\", \"treemapValue\").attr(\"x\", (d) => (d.x1 - d.x0) / 2).attr(\"y\", function(d) {\n      return (d.y1 - d.y0) / 2;\n    }).attr(\"style\", (d) => {\n      const labelStyles = \"text-anchor: middle; dominant-baseline: hanging; font-size: 28px;fill:\" + colorScaleLabel(d.data.name) + \";\";\n      const styles = styles2String({ cssCompiledStyles: d.data.cssCompiledStyles });\n      return labelStyles + styles.labelStyles.replace(\"color:\", \"fill:\");\n    }).attr(\"clip-path\", (_d, i) => `url(#clip-${id}-${i})`).text((d) => d.value ? valueFormat(d.value) : \"\");\n    leafValues.each(function(d) {\n      const valueTextElement = select(this);\n      const parentCellNode = this.parentNode;\n      if (!parentCellNode) {\n        valueTextElement.style(\"display\", \"none\");\n        return;\n      }\n      const labelElement = select(parentCellNode).select(\".treemapLabel\");\n      if (labelElement.empty() || labelElement.style(\"display\") === \"none\") {\n        valueTextElement.style(\"display\", \"none\");\n        return;\n      }\n      const finalLabelFontSize = parseFloat(labelElement.style(\"font-size\"));\n      const originalValueFontSize = 28;\n      const valueScaleFactor = 0.6;\n      const minValueFontSize = 6;\n      const spacingBetweenLabelAndValue = 2;\n      const actualValueFontSize = Math.max(\n        minValueFontSize,\n        Math.min(originalValueFontSize, Math.round(finalLabelFontSize * valueScaleFactor))\n      );\n      valueTextElement.style(\"font-size\", `${actualValueFontSize}px`);\n      const labelCenterY = (d.y1 - d.y0) / 2;\n      const valueTopActualY = labelCenterY + finalLabelFontSize / 2 + spacingBetweenLabelAndValue;\n      valueTextElement.attr(\"y\", valueTopActualY);\n      const nodeWidth = d.x1 - d.x0;\n      const nodeTotalHeight = d.y1 - d.y0;\n      const cellBottomPadding = 4;\n      const maxValueBottomY = nodeTotalHeight - cellBottomPadding;\n      const availableWidthForValue = nodeWidth - 2 * 4;\n      if (valueTextElement.node().getComputedTextLength() > availableWidthForValue || valueTopActualY + actualValueFontSize > maxValueBottomY || actualValueFontSize < minValueFontSize) {\n        valueTextElement.style(\"display\", \"none\");\n      } else {\n        valueTextElement.style(\"display\", null);\n      }\n    });\n  }\n  const diagramPadding = config.diagramPadding ?? 8;\n  setupViewPortForSVG(svg, diagramPadding, \"flowchart\", config?.useMaxWidth || false);\n}, \"draw\");\nvar getClasses = /* @__PURE__ */ __name(function(_text, diagramObj) {\n  return diagramObj.db.getClasses();\n}, \"getClasses\");\nvar renderer = { draw, getClasses };\n\n// src/diagrams/treemap/styles.ts\nvar defaultTreemapStyleOptions = {\n  sectionStrokeColor: \"black\",\n  sectionStrokeWidth: \"1\",\n  sectionFillColor: \"#efefef\",\n  leafStrokeColor: \"black\",\n  leafStrokeWidth: \"1\",\n  leafFillColor: \"#efefef\",\n  labelColor: \"black\",\n  labelFontSize: \"12px\",\n  valueFontSize: \"10px\",\n  valueColor: \"black\",\n  titleColor: \"black\",\n  titleFontSize: \"14px\"\n};\nvar getStyles = /* @__PURE__ */ __name(({\n  treemap: treemap2\n} = {}) => {\n  const options = cleanAndMerge(defaultTreemapStyleOptions, treemap2);\n  return `\n  .treemapNode.section {\n    stroke: ${options.sectionStrokeColor};\n    stroke-width: ${options.sectionStrokeWidth};\n    fill: ${options.sectionFillColor};\n  }\n  .treemapNode.leaf {\n    stroke: ${options.leafStrokeColor};\n    stroke-width: ${options.leafStrokeWidth};\n    fill: ${options.leafFillColor};\n  }\n  .treemapLabel {\n    fill: ${options.labelColor};\n    font-size: ${options.labelFontSize};\n  }\n  .treemapValue {\n    fill: ${options.valueColor};\n    font-size: ${options.valueFontSize};\n  }\n  .treemapTitle {\n    fill: ${options.titleColor};\n    font-size: ${options.titleFontSize};\n  }\n  `;\n}, \"getStyles\");\nvar styles_default = getStyles;\n\n// src/diagrams/treemap/diagram.ts\nvar diagram = {\n  parser,\n  get db() {\n    return new TreeMapDB();\n  },\n  renderer,\n  styles: styles_default\n};\nexport {\n  diagram\n};\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21],"mappings":";;;;;;;;;;;;AAAA,SAAS,EAAM,GAAM;CACnB,IAAI,IAAM,GACN,IAAW,EAAK,UAChB,IAAI,KAAY,EAAS;AAC7B,KAAI,CAAC,EAAG,KAAM;KACT,QAAO,EAAE,KAAK,GAAG,MAAO,EAAS,GAAG;AACzC,GAAK,QAAQ;;AAGf,SAAA,IAA0B;AACxB,QAAO,KAAK,UAAU,EAAM;;;;ACV9B,SAAA,EAAwB,GAAU,GAAM;CACtC,IAAI,IAAQ;AACZ,MAAK,IAAM,KAAQ,KACjB,GAAS,KAAK,GAAM,GAAM,EAAE,GAAO,KAAK;AAE1C,QAAO;;;;ACLT,SAAA,EAAwB,GAAU,GAAM;AAEtC,MADA,IAAI,IAAO,MAAM,IAAQ,CAAC,EAAK,EAAE,GAAU,GAAG,IAAQ,IAC/C,IAAO,EAAM,KAAK,EAEvB,KADA,EAAS,KAAK,GAAM,GAAM,EAAE,GAAO,KAAK,EACpC,IAAW,EAAK,SAClB,MAAK,IAAI,EAAS,SAAS,GAAG,KAAK,GAAG,EAAE,EACtC,GAAM,KAAK,EAAS,GAAG;AAI7B,QAAO;;;;ACVT,SAAA,EAAwB,GAAU,GAAM;AAEtC,MADA,IAAI,IAAO,MAAM,IAAQ,CAAC,EAAK,EAAE,IAAO,EAAE,EAAE,GAAU,GAAG,GAAG,IAAQ,IAC7D,IAAO,EAAM,KAAK,EAEvB,KADA,EAAK,KAAK,EAAK,EACX,IAAW,EAAK,SAClB,MAAK,IAAI,GAAG,IAAI,EAAS,QAAQ,IAAI,GAAG,EAAE,EACxC,GAAM,KAAK,EAAS,GAAG;AAI7B,QAAO,IAAO,EAAK,KAAK,EACtB,GAAS,KAAK,GAAM,GAAM,EAAE,GAAO,KAAK;AAE1C,QAAO;;;;ACbT,SAAA,EAAwB,GAAU,GAAM;CACtC,IAAI,IAAQ;AACZ,MAAK,IAAM,KAAQ,KACjB,KAAI,EAAS,KAAK,GAAM,GAAM,EAAE,GAAO,KAAK,CAC1C,QAAO;;;;ACJb,SAAA,EAAwB,GAAO;AAC7B,QAAO,KAAK,UAAU,SAAS,GAAM;AAInC,OAHA,IAAI,IAAM,CAAC,EAAM,EAAK,KAAK,IAAI,GAC3B,IAAW,EAAK,UAChB,IAAI,KAAY,EAAS,QACtB,EAAE,KAAK,GAAG,MAAO,EAAS,GAAG;AACpC,IAAK,QAAQ;GACb;;;;ACPJ,SAAA,EAAwB,GAAS;AAC/B,QAAO,KAAK,WAAW,SAAS,GAAM;AACpC,EAAI,EAAK,YACP,EAAK,SAAS,KAAK,EAAQ;GAE7B;;;;ACLJ,SAAA,EAAwB,GAAK;AAI3B,MAHA,IAAI,IAAQ,MACR,IAAW,EAAoB,GAAO,EAAI,EAC1C,IAAQ,CAAC,EAAM,EACZ,MAAU,GAEf,CADA,IAAQ,EAAM,QACd,EAAM,KAAK,EAAM;AAGnB,MADA,IAAI,IAAI,EAAM,QACP,MAAQ,GAEb,CADA,EAAM,OAAO,GAAG,GAAG,EAAI,EACvB,IAAM,EAAI;AAEZ,QAAO;;AAGT,SAAS,EAAoB,GAAG,GAAG;AACjC,KAAI,MAAM,EAAG,QAAO;CACpB,IAAI,IAAS,EAAE,WAAW,EACtB,IAAS,EAAE,WAAW,EACtB,IAAI;AAGR,MAFA,IAAI,EAAO,KAAK,EAChB,IAAI,EAAO,KAAK,EACT,MAAM,GAGX,CAFA,IAAI,GACJ,IAAI,EAAO,KAAK,EAChB,IAAI,EAAO,KAAK;AAElB,QAAO;;;;AC5BT,SAAA,IAA0B;AAExB,MADA,IAAI,IAAO,MAAM,IAAQ,CAAC,EAAK,EACxB,IAAO,EAAK,QACjB,GAAM,KAAK,EAAK;AAElB,QAAO;;;;ACLT,SAAA,IAA0B;AACxB,QAAO,MAAM,KAAK,KAAK;;;;ACDzB,SAAA,IAA0B;CACxB,IAAI,IAAS,EAAE;AAMf,QALA,KAAK,WAAW,SAAS,GAAM;AAC7B,EAAK,EAAK,YACR,EAAO,KAAK,EAAK;GAEnB,EACK;;;;ACPT,SAAA,IAA0B;CACxB,IAAI,IAAO,MAAM,IAAQ,EAAE;AAM3B,QALA,EAAK,KAAK,SAAS,GAAM;AACvB,EAAI,MAAS,KACX,EAAM,KAAK;GAAC,QAAQ,EAAK;GAAQ,QAAQ;GAAK,CAAC;GAEjD,EACK;;;;ACPT,UAAA,IAA2B;CACzB,IAAI,IAAO,MAAM,GAAS,IAAO,CAAC,EAAK,EAAE,GAAU,GAAG;AACtD;AAEE,OADA,IAAU,EAAK,SAAS,EAAE,IAAO,EAAE,EAC5B,IAAO,EAAQ,KAAK,EAEzB,KADA,MAAM,GACF,IAAW,EAAK,SAClB,MAAK,IAAI,GAAG,IAAI,EAAS,QAAQ,IAAI,GAAG,EAAE,EACxC,GAAK,KAAK,EAAS,GAAG;QAIrB,EAAK;;;;ACEhB,SAAwB,EAAU,GAAM,GAAU;AAChD,CAAI,aAAgB,OAClB,IAAO,CAAC,KAAA,GAAW,EAAK,EACpB,MAAa,KAAA,MAAW,IAAW,MAC9B,MAAa,KAAA,MACtB,IAAW;AAWb,MARA,IAAI,IAAO,IAAI,EAAK,EAAK,EACrB,GACA,IAAQ,CAAC,EAAK,EACd,GACA,GACA,GACA,GAEG,IAAO,EAAM,KAAK,EACvB,MAAK,IAAS,EAAS,EAAK,KAAK,MAAM,KAAK,IAAS,MAAM,KAAK,EAAO,EAAE,QAEvE,MADA,EAAK,WAAW,GACX,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,EAGxB,CAFA,EAAM,KAAK,IAAQ,EAAO,KAAK,IAAI,EAAK,EAAO,GAAG,CAAC,EACnD,EAAM,SAAS,GACf,EAAM,QAAQ,EAAK,QAAQ;AAKjC,QAAO,EAAK,WAAW,EAAc;;AAGvC,SAAS,IAAY;AACnB,QAAO,EAAU,KAAK,CAAC,WAAW,EAAS;;AAG7C,SAAS,EAAe,GAAG;AACzB,QAAO,EAAE;;AAGX,SAAS,EAAY,GAAG;AACtB,QAAO,MAAM,QAAQ,EAAE,GAAG,EAAE,KAAK;;AAGnC,SAAS,EAAS,GAAM;AAEtB,CADI,EAAK,KAAK,UAAU,KAAA,MAAW,EAAK,QAAQ,EAAK,KAAK,QAC1D,EAAK,OAAO,EAAK,KAAK;;AAGxB,SAAgB,EAAc,GAAM;CAClC,IAAI,IAAS;AACb;AAAG,IAAK,SAAS;SACT,IAAO,EAAK,WAAY,EAAK,SAAS,EAAE;;AAGlD,SAAgB,EAAK,GAAM;AAIzB,CAHA,KAAK,OAAO,GACZ,KAAK,QACL,KAAK,SAAS,GACd,KAAK,SAAS;;AAGhB,EAAK,YAAY,EAAU,YAAY;CACrC,aAAa;CACb,OAAOA;CACP,MAAMC;CACN,WAAWC;CACX,YAAYC;CACZ,MAAMC;CACN,KAAKC;CACL,MAAMC;CACN,MAAMC;CACN,WAAWC;CACX,aAAaC;CACb,QAAQC;CACR,OAAOC;CACP,MAAM;EACL,OAAO,WAAWC;CACpB;;;ACtFD,SAAgB,EAAS,GAAG;AAC1B,KAAI,OAAO,KAAM,WAAY,OAAU,OAAK;AAC5C,QAAO;;;;ACNT,SAAgB,IAAe;AAC7B,QAAO;;AAGT,SAAA,EAAwB,GAAG;AACzB,QAAO,WAAW;AAChB,SAAO;;;;;ACNX,SAAA,EAAwB,GAAM;AAI5B,CAHA,EAAK,KAAK,KAAK,MAAM,EAAK,GAAG,EAC7B,EAAK,KAAK,KAAK,MAAM,EAAK,GAAG,EAC7B,EAAK,KAAK,KAAK,MAAM,EAAK,GAAG,EAC7B,EAAK,KAAK,KAAK,MAAM,EAAK,GAAG;;;;ACJ/B,SAAA,EAAwB,GAAQ,GAAI,GAAI,GAAI,GAAI;AAO9C,MANA,IAAI,IAAQ,EAAO,UACf,GACA,IAAI,IACJ,IAAI,EAAM,QACV,IAAI,EAAO,UAAU,IAAK,KAAM,EAAO,OAEpC,EAAE,IAAI,GAEX,CADA,IAAO,EAAM,IAAI,EAAK,KAAK,GAAI,EAAK,KAAK,GACzC,EAAK,KAAK,GAAI,EAAK,KAAK,KAAM,EAAK,QAAQ;;;;ACT/C,SAAA,GAAwB,GAAQ,GAAI,GAAI,GAAI,GAAI;AAO9C,MANA,IAAI,IAAQ,EAAO,UACf,GACA,IAAI,IACJ,IAAI,EAAM,QACV,IAAI,EAAO,UAAU,IAAK,KAAM,EAAO,OAEpC,EAAE,IAAI,GAEX,CADA,IAAO,EAAM,IAAI,EAAK,KAAK,GAAI,EAAK,KAAK,GACzC,EAAK,KAAK,GAAI,EAAK,KAAK,KAAM,EAAK,QAAQ;;;;ACN/C,IAAW,MAAO,IAAI,KAAK,KAAK,EAAE,IAAI;AAEtC,SAAgB,GAAc,GAAO,GAAQ,GAAI,GAAI,GAAI,GAAI;AAkB3D,MAjBA,IAAI,IAAO,EAAE,EACT,IAAQ,EAAO,UACf,GACA,GACA,IAAK,GACL,IAAK,GACL,IAAI,EAAM,QACV,GAAI,GACJ,IAAQ,EAAO,OACf,GACA,GACA,GACA,GACA,GACA,GACA,GAEG,IAAK,IAAG;AACb,MAAK,IAAK,GAAI,IAAK,IAAK;AAGxB;AAAG,OAAW,EAAM,KAAM;SAAc,CAAC,KAAY,IAAK;AAO1D,OANA,IAAW,IAAW,GACtB,IAAQ,KAAK,IAAI,IAAK,GAAI,IAAK,EAAG,IAAI,IAAQ,IAC9C,IAAO,IAAW,IAAW,GAC7B,IAAW,KAAK,IAAI,IAAW,GAAM,IAAO,EAAS,EAG9C,IAAK,GAAG,EAAE,GAAI;AAMnB,OALA,KAAY,IAAY,EAAM,GAAI,OAC9B,IAAY,MAAU,IAAW,IACjC,IAAY,MAAU,IAAW,IACrC,IAAO,IAAW,IAAW,GAC7B,IAAW,KAAK,IAAI,IAAW,GAAM,IAAO,EAAS,EACjD,IAAW,GAAU;AAAE,SAAY;AAAW;;AAClD,OAAW;;AAOb,EAHA,EAAK,KAAK,IAAM;GAAC,OAAO;GAAU,MAAM,IAAK;GAAI,UAAU,EAAM,MAAM,GAAI,EAAG;GAAC,CAAC,EAC5E,EAAI,OAAM,EAAY,GAAK,GAAI,GAAI,GAAI,IAAQ,KAAM,IAAK,IAAW,IAAQ,EAAG,GAC/E,GAAa,GAAK,GAAI,GAAI,IAAQ,KAAM,IAAK,IAAW,IAAQ,GAAI,EAAG,EAC5E,KAAS,GAAU,IAAK;;AAG1B,QAAO;;AAGT,IAAA,MAAgB,SAAS,EAAO,GAAO;CAErC,SAAS,EAAS,GAAQ,GAAI,GAAI,GAAI,GAAI;AACxC,KAAc,GAAO,GAAQ,GAAI,GAAI,GAAI,EAAG;;AAO9C,QAJA,EAAS,QAAQ,SAAS,GAAG;AAC3B,SAAO,GAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,EAAE;IAG9B;GACN,GAAI;;;AC5DP,SAAA,KAA0B;CACxB,IAAI,IAAOC,IACP,IAAQ,IACR,IAAK,GACL,IAAK,GACL,IAAe,CAAC,EAAE,EAClB,IAAe,GACf,IAAa,GACb,IAAe,GACf,IAAgB,GAChB,IAAc;CAElB,SAAS,EAAQ,GAAM;AAQrB,SAPA,EAAK,KACL,EAAK,KAAK,GACV,EAAK,KAAK,GACV,EAAK,KAAK,GACV,EAAK,WAAW,EAAa,EAC7B,IAAe,CAAC,EAAE,EACd,KAAO,EAAK,WAAWC,EAAU,EAC9B;;CAGT,SAAS,EAAa,GAAM;EAC1B,IAAI,IAAI,EAAa,EAAK,QACtB,IAAK,EAAK,KAAK,GACf,IAAK,EAAK,KAAK,GACf,IAAK,EAAK,KAAK,GACf,IAAK,EAAK,KAAK;AAOnB,EANI,IAAK,MAAI,IAAK,KAAM,IAAK,KAAM,IAC/B,IAAK,MAAI,IAAK,KAAM,IAAK,KAAM,IACnC,EAAK,KAAK,GACV,EAAK,KAAK,GACV,EAAK,KAAK,GACV,EAAK,KAAK,GACN,EAAK,aACP,IAAI,EAAa,EAAK,QAAQ,KAAK,EAAa,EAAK,GAAG,GACxD,KAAM,EAAY,EAAK,GAAG,GAC1B,KAAM,EAAW,EAAK,GAAG,GACzB,KAAM,EAAa,EAAK,GAAG,GAC3B,KAAM,EAAc,EAAK,GAAG,GACxB,IAAK,MAAI,IAAK,KAAM,IAAK,KAAM,IAC/B,IAAK,MAAI,IAAK,KAAM,IAAK,KAAM,IACnC,EAAK,GAAM,GAAI,GAAI,GAAI,EAAG;;AA4C9B,QAxCA,EAAQ,QAAQ,SAAS,GAAG;AAC1B,SAAO,UAAU,UAAU,IAAQ,CAAC,CAAC,GAAG,KAAW;IAGrD,EAAQ,OAAO,SAAS,GAAG;AACzB,SAAO,UAAU,UAAU,IAAK,CAAC,EAAE,IAAI,IAAK,CAAC,EAAE,IAAI,KAAW,CAAC,GAAI,EAAG;IAGxE,EAAQ,OAAO,SAAS,GAAG;AACzB,SAAO,UAAU,UAAU,IAAO,EAAS,EAAE,EAAE,KAAW;IAG5D,EAAQ,UAAU,SAAS,GAAG;AAC5B,SAAO,UAAU,SAAS,EAAQ,aAAa,EAAE,CAAC,aAAa,EAAE,GAAG,EAAQ,cAAc;IAG5F,EAAQ,eAAe,SAAS,GAAG;AACjC,SAAO,UAAU,UAAU,IAAe,OAAO,KAAM,aAAa,IAAIC,EAAS,CAAC,EAAE,EAAE,KAAW;IAGnG,EAAQ,eAAe,SAAS,GAAG;AACjC,SAAO,UAAU,SAAS,EAAQ,WAAW,EAAE,CAAC,aAAa,EAAE,CAAC,cAAc,EAAE,CAAC,YAAY,EAAE,GAAG,EAAQ,YAAY;IAGxH,EAAQ,aAAa,SAAS,GAAG;AAC/B,SAAO,UAAU,UAAU,IAAa,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,EAAE,EAAE,KAAW;IAGjG,EAAQ,eAAe,SAAS,GAAG;AACjC,SAAO,UAAU,UAAU,IAAe,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,EAAE,EAAE,KAAW;IAGnG,EAAQ,gBAAgB,SAAS,GAAG;AAClC,SAAO,UAAU,UAAU,IAAgB,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,EAAE,EAAE,KAAW;IAGpG,EAAQ,cAAc,SAAS,GAAG;AAChC,SAAO,UAAU,UAAU,IAAc,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,EAAE,EAAE,KAAW;IAG3F;;;;AC1DT,IAAI,IAAY,MAAM;CACpB,cAAc;AAUZ,EATA,KAAK,QAAQ,EAAE,EACf,KAAK,yBAAyB,IAAI,KAAK,EACvC,KAAK,aAAa,EAAE,EACpB,KAAK,0BAA0B,IAAI,KAAK,EACxC,KAAK,cAAc,GACnB,KAAK,cAAc,GACnB,KAAK,kBAAkB,GACvB,KAAK,kBAAkB,GACvB,KAAK,oBAAoB,GACzB,KAAK,oBAAoB;;CAE3B;AACE,IAAO,MAAM,YAAY;;CAE3B,WAAW;AACT,SAAO,KAAK;;CAEd,YAAY;EACV,IAAM,IAAgB,GAChB,IAAa,GAAW;AAC9B,SAAO,EAAc;GACnB,GAAG,EAAc;GACjB,GAAG,EAAW,WAAW,EAAE;GAC5B,CAAC;;CAEJ,QAAQ,GAAM,GAAO;AAGnB,EAFA,KAAK,MAAM,KAAK,EAAK,EACrB,KAAK,OAAO,IAAI,GAAM,EAAM,EACxB,MAAU,MACZ,KAAK,WAAW,KAAK,EAAK,EAC1B,KAAK,SAAS;;CAGlB,UAAU;AACR,SAAO;GAAE,MAAM;GAAI,UAAU,KAAK;GAAY;;CAEhD,SAAS,GAAI,GAAQ;EACnB,IAAM,IAAa,KAAK,QAAQ,IAAI,EAAG,IAAI;GAAE;GAAI,QAAQ,EAAE;GAAE,YAAY,EAAE;GAAE,EACvE,IAAS,EAAO,QAAQ,QAAQ,MAAe,CAAC,QAAQ,MAAM,IAAI,CAAC,QAAQ,QAAQ,IAAI,CAAC,MAAM,IAAI;AAiBxG,EAhBI,KACF,EAAO,SAAS,MAAM;AAQpB,GAPI,EAAa,EAAE,KACb,GAAY,aACd,EAAW,WAAW,KAAK,EAAE,GAE7B,EAAW,aAAa,CAAC,EAAE,GAG3B,GAAY,SACd,EAAW,OAAO,KAAK,EAAE,GAEzB,EAAW,SAAS,CAAC,EAAE;IAEzB,EAEJ,KAAK,QAAQ,IAAI,GAAI,EAAW;;CAElC,aAAa;AACX,SAAO,KAAK;;CAEd,kBAAkB,GAAe;AAC/B,SAAO,KAAK,QAAQ,IAAI,EAAc,EAAE,UAAU,EAAE;;CAEtD,QAAQ;AAMN,EALA,GAAO,EACP,KAAK,QAAQ,EAAE,EACf,KAAK,yBAAyB,IAAI,KAAK,EACvC,KAAK,aAAa,EAAE,EACpB,KAAK,0BAA0B,IAAI,KAAK,EACxC,KAAK,OAAO,KAAK;;;AAQrB,SAAS,EAAe,GAAO;AAC7B,KAAI,CAAC,EAAM,OACT,QAAO,EAAE;CAEX,IAAM,IAAO,EAAE,EACT,IAAQ,EAAE;AA8BhB,QA7BA,EAAM,SAAS,MAAS;EACtB,IAAM,IAAO;GACX,MAAM,EAAK;GACX,UAAU,EAAK,SAAS,SAAS,KAAK,IAAI,EAAE;GAC7C;AAQD,OAPA,EAAK,gBAAgB,GAAM,eACvB,GAAM,sBACR,EAAK,oBAAoB,EAAK,oBAE5B,EAAK,SAAS,UAAU,EAAK,UAAU,KAAK,MAC9C,EAAK,QAAQ,EAAK,QAEb,EAAM,SAAS,KAAK,EAAM,EAAM,SAAS,GAAG,SAAS,EAAK,OAC/D,GAAM,KAAK;AAEb,MAAI,EAAM,WAAW,EACnB,GAAK,KAAK,EAAK;OACV;GACL,IAAM,IAAS,EAAM,EAAM,SAAS,GAAG;AACvC,GAAI,EAAO,WACT,EAAO,SAAS,KAAK,EAAK,GAE1B,EAAO,WAAW,CAAC,EAAK;;AAG5B,EAAI,EAAK,SAAS,UAChB,EAAM,KAAK;GAAE;GAAM,OAAO,EAAK;GAAO,CAAC;GAEzC,EACK;;AAET,EAAO,GAAgB,iBAAiB;AAGxC,IAAI,KAA2B,mBAAQ,GAAK,MAAO;AACjD,GAAiB,GAAK,EAAG;CACzB,IAAM,IAAQ,EAAE;AAChB,MAAK,IAAM,KAAO,EAAI,eAAe,EAAE,CACrC,CAAI,EAAI,UAAU,uBAChB,EAAG,SAAS,EAAI,aAAa,IAAI,EAAI,aAAa,GAAG;AAGzD,MAAK,IAAM,KAAO,EAAI,eAAe,EAAE,EAAE;EACvC,IAAM,IAAO,EAAI;AACjB,MAAI,CAAC,EACH;EAEF,IAAM,IAAQ,EAAI,SAAS,SAAS,EAAI,OAAO,GAAG,GAC5C,IAAO,GAAY,EAAK,EACxB,IAAS,EAAK,gBAAgB,EAAG,kBAAkB,EAAK,cAAc,GAAG,EAAE,EAC3E,IAAoB,EAAO,SAAS,IAAI,IAAS,KAAK,GACtD,IAAW;GACf;GACA;GACA,MAAM,EAAK;GACX,OAAO,EAAK;GACZ,eAAe,EAAK;GACpB;GACD;AACD,IAAM,KAAK,EAAS;;CAEtB,IAAM,IAAiB,EAAe,EAAM,EACtC,IAAsC,mBAAQ,GAAO,MAAU;AACnE,OAAK,IAAM,KAAQ,EAEjB,CADA,EAAG,QAAQ,GAAM,EAAM,EACnB,EAAK,YAAY,EAAK,SAAS,SAAS,KAC1C,EAAoB,EAAK,UAAU,IAAQ,EAAE;IAGhD,sBAAsB;AACzB,GAAoB,GAAgB,EAAE;GACrC,WAAW,EACV,KAA8B,mBAAQ,MACjC,EAAK,OAAO,OAAO,EAAK,KAAK,GAAG,IACtC,cAAc,EACb,IAAS;CAEX,QAAQ,EAAE,IAAI,KAAK,GAAG;CACtB,OAAuB,kBAAO,OAAO,MAAS;AAC5C,MAAI;GAEF,IAAM,IAAM,MADM,EACU,WAAW,EAAK;AAC5C,KAAI,MAAM,gBAAgB,EAAI;GAC9B,IAAM,IAAK,EAAO,QAAQ;AAC1B,OAAI,EAAE,aAAc,GAClB,OAAU,MACR,wJACD;AAEH,MAAS,GAAK,EAAG;WACV,GAAO;AAEd,SADA,EAAI,MAAM,0BAA0B,EAAM,EACpC;;IAEP,QAAQ;CACZ,EAIG,KAAwB,IACxB,IAAwB,IACxB,IAAwB,IA4RxB,KAAW;CAAE,MA3RU,mBAAQ,GAAO,GAAI,GAAU,MAAa;EACnE,IAAM,IAAY,EAAS,IACrB,IAAS,EAAU,WAAW,EAC9B,IAAsB,EAAO,WAAW,IACxC,IAAQ,EAAU,iBAAiB,EACnC,IAAO,EAAU,SAAS,EAC1B,EAAE,sBAAmB,GAAW;AACtC,MAAI,CAAC,EACH;EAEF,IAAM,IAAc,IAAQ,KAAK,GAC3B,IAAM,EAAiB,EAAG,EAC1B,IAAQ,EAAO,YAAY,EAAO,YAAY,IAAwB,KACtE,IAAS,EAAO,aAAa,EAAO,aAAa,IAAwB,KACzE,IAAW,GACX,IAAY,IAAS;AAE3B,EADA,EAAI,KAAK,WAAW,OAAO,EAAS,GAAG,IAAY,EACnD,EAAiB,GAAK,GAAW,GAAU,EAAO,YAAY;EAC9D,IAAI;AACJ,MAAI;GACF,IAAM,IAAY,EAAO,eAAe;AACxC,OAAI,MAAc,OAChB,KAA8B,mBAAQ,MAAU,MAAM,EAAO,IAAI,CAAC,EAAM,EAAE,cAAc;YAC/E,EAAU,WAAW,IAAI,IAAI,EAAU,SAAS,IAAI,EAAE;IAC/D,IAAM,IAAY,QAAQ,KAAK,EAAU,EACnC,IAAe,IAAY,EAAU,KAAK;AAChD,QAA8B,mBAAQ,MAAU,MAAM,EAAO,MAAM,EAAa,CAAC,EAAM,EAAE,cAAc;cAC9F,EAAU,WAAW,IAAI,EAAE;IACpC,IAAM,IAAe,EAAU,UAAU,EAAE;AAC3C,QAA8B,mBAAQ,MAAU,MAAM,EAAO,KAAgB,GAAG,CAAC,EAAM,EAAE,cAAc;SAEvG,KAAc,EAAO,EAAU;WAE1B,GAAO;AAEd,GADA,EAAI,MAAM,mCAAmC,EAAM,EACnD,IAAc,EAAO,IAAI;;EAE3B,IAAM,IAAaC,GAAc,CAAC,MAAM;GACtC;GACA,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GAChB,CAAC,EACI,IAAiBA,GAAc,CAAC,MAAM;GAC1C;GACA,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GAChB,CAAC,EACI,IAAkBA,GAAc,CAAC,MAAM;GAC3C,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GACf,EAAe;GAChB,CAAC;AACF,EAAI,KACF,EAAI,OAAO,OAAO,CAAC,KAAK,KAAK,IAAW,EAAE,CAAC,KAAK,KAAK,IAAc,EAAE,CAAC,KAAK,SAAS,eAAe,CAAC,KAAK,eAAe,SAAS,CAAC,KAAK,qBAAqB,SAAS,CAAC,KAAK,EAAM;EAEnL,IAAM,IAAI,EAAI,OAAO,IAAI,CAAC,KAAK,aAAa,gBAAgB,EAAY,GAAG,CAAC,KAAK,SAAS,mBAAmB,EACvG,IAAgB,EAAU,EAAK,CAAC,KAAK,MAAM,EAAE,SAAS,EAAE,CAAC,MAAM,GAAG,OAAO,EAAE,SAAS,MAAM,EAAE,SAAS,GAAG,EAIxG,IAHgBC,IAAS,CAAC,KAAK,CAAC,GAAO,EAAO,CAAC,CAAC,YACnD,MAAM,EAAE,YAAY,EAAE,SAAS,SAAS,IAAI,IAAwB,IAAwB,EAC9F,CAAC,aAAa,EAAoB,CAAC,aAAa,MAAM,EAAE,YAAY,EAAE,SAAS,SAAS,IAAI,IAAwB,EAAE,CAAC,cAAc,MAAM,EAAE,YAAY,EAAE,SAAS,SAAS,IAAI,IAAwB,EAAE,CAAC,eAAe,MAAM,EAAE,YAAY,EAAE,SAAS,SAAS,IAAI,IAAwB,EAAE,CAAC,MAAM,GAAK,CAC5Q,EAAc,EAC1C,IAAc,EAAY,aAAa,CAAC,QAAQ,MAAM,EAAE,YAAY,EAAE,SAAS,SAAS,EAAE,EAC1F,IAAW,EAAE,UAAU,kBAAkB,CAAC,KAAK,EAAY,CAAC,OAAO,CAAC,OAAO,IAAI,CAAC,KAAK,SAAS,iBAAiB,CAAC,KAAK,cAAc,MAAM,aAAa,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG;AAmE5K,EAlEA,EAAS,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,UAAU,EAAsB,CAAC,KAAK,SAAS,uBAAuB,CAAC,KAAK,QAAQ,OAAO,CAAC,KAAK,gBAAgB,GAAI,CAAC,KAAK,gBAAgB,GAAI,CAAC,KAAK,UAAU,MACxN,EAAE,UAAU,IACP,mBAEF,GACP,EACF,EAAS,OAAO,WAAW,CAAC,KAAK,OAAO,GAAI,MAAM,gBAAgB,EAAG,GAAG,IAAI,CAAC,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,EAAsB,EACrL,EAAS,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,WAAW,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,UAAU,GAAI,MACvG,yBAAyB,IAChC,CAAC,KAAK,SAAS,MAAM,EAAW,EAAE,KAAK,KAAK,CAAC,CAAC,KAAK,gBAAgB,GAAI,CAAC,KAAK,WAAW,MAAM,EAAe,EAAE,KAAK,KAAK,CAAC,CAAC,KAAK,gBAAgB,EAAE,CAAC,KAAK,kBAAkB,GAAI,CAAC,KAAK,UAAU,MAAM;AACpM,OAAI,EAAE,UAAU,EACd,QAAO;GAET,IAAM,IAAS,EAAc,EAAE,mBAAmB,EAAE,KAAK,mBAAmB,CAAC;AAC7E,UAAO,EAAO,aAAa,MAAM,EAAO,aAAa,KAAK,IAAI;IAC9D,EACF,EAAS,OAAO,OAAO,CAAC,KAAK,SAAS,sBAAsB,CAAC,KAAK,KAAK,EAAE,CAAC,KAAK,KAAK,IAAwB,EAAE,CAAC,KAAK,qBAAqB,SAAS,CAAC,MAAM,MAAM,EAAE,UAAU,IAAI,KAAK,EAAE,KAAK,KAAK,CAAC,KAAK,eAAe,OAAO,CAAC,KAAK,UAAU,MACtO,EAAE,UAAU,IACP,mBAEW,sDAAsD,EAAgB,EAAE,KAAK,KAAK,GAAG,sEAC1F,EAAc,EAAE,mBAAmB,EAAE,KAAK,mBAAmB,CAAC,CACjD,YAAY,QAAQ,UAAU,QAAQ,CAClE,CAAC,KAAK,SAAS,GAAG;AAClB,OAAI,EAAE,UAAU,EACd;GAEF,IAAM,IAAOC,EAAO,KAAK,EACnB,IAAe,EAAE,KAAK;AAC5B,KAAK,KAAK,EAAa;GACvB,IAAM,IAAmB,EAAE,KAAK,EAAE,IAE9B;AACJ,GAQE,IARE,EAAO,eAAe,MAAS,EAAE,QACN,IAAmB,KACV,KACN,KAEY,IAGtB,IAAmB,IADZ;GAI/B,IAAM,IAAuB,KAAK,IADJ,IAC+B,EAAoB,EAC3E,IAAW,EAAK,MAAM;AAE5B,OADiC,EAAS,uBAAuB,GAClC,GAAsB;IACnD,IACI,IAAuB;AAC3B,WAAO,EAAqB,SAAS,IAAG;AAEtC,SADA,IAAuB,EAAa,UAAU,GAAG,EAAqB,SAAS,EAAE,EAC7E,EAAqB,WAAW,GAAG;AAErC,MADA,EAAK,KAAK,MAAS,EACf,EAAS,uBAAuB,GAAG,KACrC,EAAK,KAAK,GAAG;AAEf;;AAGF,SADA,EAAK,KAAK,IAAuB,MAAS,EACtC,EAAS,uBAAuB,IAAI,EACtC;;;IAIN,EACE,EAAO,eAAe,MACxB,EAAS,OAAO,OAAO,CAAC,KAAK,SAAS,sBAAsB,CAAC,KAAK,MAAM,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,KAAK,KAAK,IAAwB,EAAE,CAAC,KAAK,eAAe,MAAM,CAAC,KAAK,qBAAqB,SAAS,CAAC,MAAM,MAAM,EAAE,QAAQ,EAAY,EAAE,MAAM,GAAG,GAAG,CAAC,KAAK,cAAc,SAAS,CAAC,KAAK,UAAU,MAC3R,EAAE,UAAU,IACP,mBAEW,wEAAwE,EAAgB,EAAE,KAAK,KAAK,GAAG,sEAC5G,EAAc,EAAE,mBAAmB,EAAE,KAAK,mBAAmB,CAAC,CACjD,YAAY,QAAQ,UAAU,QAAQ,CAClE;EAEJ,IAAM,IAAY,EAAY,QAAQ,EAChC,IAAO,EAAE,UAAU,oBAAoB,CAAC,KAAK,EAAU,CAAC,OAAO,CAAC,OAAO,IAAI,CAAC,KAAK,UAAU,GAAG,MAC3F,oCAAoC,IAAI,EAAE,KAAK,gBAAgB,IAAI,EAAE,KAAK,kBAAkB,GAAG,GACtG,CAAC,KAAK,cAAc,MAAM,aAAa,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG;AA2GzD,EA1GA,EAAK,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,WAAW,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,SAAS,cAAc,CAAC,KAAK,SAAS,MAC3H,EAAE,SAAS,EAAW,EAAE,OAAO,KAAK,KAAK,GAAG,EAAW,EAAE,KAAK,KAAK,CAC1E,CAAC,KAAK,UAAU,MACD,EAAc,EAAE,mBAAmB,EAAE,KAAK,mBAAmB,CAAC,CAC/D,WACd,CAAC,KAAK,gBAAgB,GAAI,CAAC,KAAK,WAAW,MACpC,EAAE,SAAS,EAAW,EAAE,OAAO,KAAK,KAAK,GAAG,EAAW,EAAE,KAAK,KAAK,CAC1E,CAAC,KAAK,gBAAgB,EAAE,EAC1B,EAAK,OAAO,WAAW,CAAC,KAAK,OAAO,GAAI,MAAM,QAAQ,EAAG,GAAG,IAAI,CAAC,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,WAAW,MAAM,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EACnK,EAAK,OAAO,OAAO,CAAC,KAAK,SAAS,eAAe,CAAC,KAAK,MAAM,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,KAAK,MAAM,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,KAAK,UAAU,MACtI,0EAA0E,EAAgB,EAAE,KAAK,KAAK,GAAG,MAC9G,EAAc,EAAE,mBAAmB,EAAE,KAAK,mBAAmB,CAAC,CACjD,YAAY,QAAQ,UAAU,QAAQ,CAClE,CAAC,KAAK,cAAc,GAAI,MAAM,aAAa,EAAG,GAAG,EAAE,GAAG,CAAC,MAAM,MAAM,EAAE,KAAK,KAAK,CACtE,KAAK,SAAS,GAAG;GAC1B,IAAM,IAAOA,EAAO,KAAK,EACnB,IAAY,EAAE,KAAK,EAAE,IACrB,IAAa,EAAE,KAAK,EAAE,IACtB,IAAW,EAAK,MAAM,EAEtB,IAAiB,IAAY,GAC7B,IAAkB,IAAa;AACrC,OAAI,IAAiB,MAAM,IAAkB,IAAI;AAC/C,MAAK,MAAM,WAAW,OAAO;AAC7B;;GAEF,IAAI,IAAuB,SAAS,EAAK,MAAM,YAAY,EAAE,GAAG,EAG1D,IAAmB;AAGzB,UAAO,EAAS,uBAAuB,GAAG,KAAkB,IAAuB,GAEjF,CADA,KACA,EAAK,MAAM,aAAa,GAAG,EAAqB,IAAI;GAEtD,IAAI,IAA2B,KAAK,IAClC,GACA,KAAK,IAAI,IAA0B,KAAK,MAAM,IAAuB,EAAiB,CAAC,CACxF,EACG,IAAiB,IAAuB,IAA8B;AAC1E,UAAO,IAAiB,KAAmB,IAAuB,MAChE,KACA,IAA2B,KAAK,IAC9B,GACA,KAAK,IAAI,IAA0B,KAAK,MAAM,IAAuB,EAAiB,CAAC,CACxF,EACG,MAA2B,KAAoB,MAAyB,KAI5E,CADA,EAAK,MAAM,aAAa,GAAG,EAAqB,IAAI,EACpD,IAAiB,IAAuB,IAA8B;AAKxE,GADA,EAAK,MAAM,aAAa,GAAG,EAAqB,IAAI,GAChD,EAAS,uBAAuB,GAAG,KAAkB,IAAuB,KAAoB,IAAkB,MACpH,EAAK,MAAM,WAAW,OAAO;IAE/B,EACE,EAAO,eAAe,MACL,EAAK,OAAO,OAAO,CAAC,KAAK,SAAS,eAAe,CAAC,KAAK,MAAM,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,KAAK,KAAK,SAAS,GAAG;AAC7H,WAAQ,EAAE,KAAK,EAAE,MAAM;IACvB,CAAC,KAAK,UAAU,MACI,2EAA2E,EAAgB,EAAE,KAAK,KAAK,GAAG,MAC/G,EAAc,EAAE,mBAAmB,EAAE,KAAK,mBAAmB,CAAC,CACjD,YAAY,QAAQ,UAAU,QAAQ,CAClE,CAAC,KAAK,cAAc,GAAI,MAAM,aAAa,EAAG,GAAG,EAAE,GAAG,CAAC,MAAM,MAAM,EAAE,QAAQ,EAAY,EAAE,MAAM,GAAG,GAAG,CAC9F,KAAK,SAAS,GAAG;GAC1B,IAAM,IAAmBA,EAAO,KAAK,EAC/B,IAAiB,KAAK;AAC5B,OAAI,CAAC,GAAgB;AACnB,MAAiB,MAAM,WAAW,OAAO;AACzC;;GAEF,IAAM,IAAeA,EAAO,EAAe,CAAC,OAAO,gBAAgB;AACnE,OAAI,EAAa,OAAO,IAAI,EAAa,MAAM,UAAU,KAAK,QAAQ;AACpE,MAAiB,MAAM,WAAW,OAAO;AACzC;;GAEF,IAAM,IAAqB,WAAW,EAAa,MAAM,YAAY,CAAC,EAKhE,IAAsB,KAAK,IAC/B,GACA,KAAK,IAAI,IAAuB,KAAK,MAAM,IAAqB,GAAiB,CAAC,CACnF;AACD,KAAiB,MAAM,aAAa,GAAG,EAAoB,IAAI;GAE/D,IAAM,KADgB,EAAE,KAAK,EAAE,MAAM,IACE,IAAqB,IAAI;AAChE,KAAiB,KAAK,KAAK,EAAgB;GAC3C,IAAM,IAAY,EAAE,KAAK,EAAE,IAGrB,IAFkB,EAAE,KAAK,EAAE,KACP,GAEpB,IAAyB,IAAY;AAC3C,GAAI,EAAiB,MAAM,CAAC,uBAAuB,GAAG,KAA0B,IAAkB,IAAsB,KAAmB,IAAsB,IAC/J,EAAiB,MAAM,WAAW,OAAO,GAEzC,EAAiB,MAAM,WAAW,KAAK;IAEzC,EAGJ,EAAoB,GADG,EAAO,kBAAkB,GACP,aAAa,GAAQ,eAAe,GAAM;IAClF,OAAO;CAIa,YAHU,kBAAO,SAAS,GAAO,GAAY;AAClE,SAAO,EAAW,GAAG,YAAY;IAChC,aAAa;CACmB,EAG/B,KAA6B;CAC/B,oBAAoB;CACpB,oBAAoB;CACpB,kBAAkB;CAClB,iBAAiB;CACjB,iBAAiB;CACjB,eAAe;CACf,YAAY;CACZ,eAAe;CACf,eAAe;CACf,YAAY;CACZ,YAAY;CACZ,eAAe;CAChB,EAiCG,KAAU;CACZ;CACA,IAAI,KAAK;AACP,SAAO,IAAI,GAAW;;CAExB;CACA,QAtC8B,mBAAQ,EACtC,SAAS,MACP,EAAE,KAAK;EACT,IAAM,IAAU,EAAc,IAA4B,EAAS;AACnE,SAAO;;cAEK,EAAQ,mBAAmB;oBACrB,EAAQ,mBAAmB;YACnC,EAAQ,iBAAiB;;;cAGvB,EAAQ,gBAAgB;oBAClB,EAAQ,gBAAgB;YAChC,EAAQ,cAAc;;;YAGtB,EAAQ,WAAW;iBACd,EAAQ,cAAc;;;YAG3B,EAAQ,WAAW;iBACd,EAAQ,cAAc;;;YAG3B,EAAQ,WAAW;iBACd,EAAQ,cAAc;;;IAGpC,YAAY;CAWd"}

package/dist/dist-BrNloUiz.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dist-BrNloUiz.js","names":[],"sources":["../node_modules/@braintree/sanitize-url/dist/constants.js","../node_modules/@braintree/sanitize-url/dist/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.BLANK_URL = exports.relativeFirstCharacters = exports.whitespaceEscapeCharsRegex = exports.urlSchemeRegex = exports.ctrlCharactersRegex = exports.htmlCtrlEntityRegex = exports.htmlEntitiesRegex = exports.invalidProtocolRegex = void 0;\nexports.invalidProtocolRegex = /^([^\\w]*)(javascript|data|vbscript)/im;\nexports.htmlEntitiesRegex = /&#(\\w+)(^\\w|;)?/g;\nexports.htmlCtrlEntityRegex = /&(newline|tab);/gi;\nexports.ctrlCharactersRegex = /[\\u0000-\\u001F\\u007F-\\u009F\\u2000-\\u200D\\uFEFF]/gim;\nexports.urlSchemeRegex = /^.+(:|:)/gim;\nexports.whitespaceEscapeCharsRegex = /(\\\\|%5[cC])((%(6[eE]|72|74))|[nrt])/g;\nexports.relativeFirstCharacters = [\".\", \"/\"];\nexports.BLANK_URL = \"about:blank\";\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sanitizeUrl = sanitizeUrl;\nvar constants_1 = require(\"./constants\");\nfunction isRelativeUrlWithoutProtocol(url) {\n    return constants_1.relativeFirstCharacters.indexOf(url[0]) > -1;\n}\nfunction decodeHtmlCharacters(str) {\n    var removedNullByte = str.replace(constants_1.ctrlCharactersRegex, \"\");\n    return removedNullByte.replace(constants_1.htmlEntitiesRegex, function (match, dec) {\n        return String.fromCharCode(dec);\n    });\n}\nfunction isValidUrl(url) {\n    return URL.canParse(url);\n}\nfunction decodeURI(uri) {\n    try {\n        return decodeURIComponent(uri);\n    }\n    catch (e) {\n        // Ignoring error\n        // It is possible that the URI contains a `%` not associated\n        // with URI/URL-encoding.\n        return uri;\n    }\n}\nfunction sanitizeUrl(url) {\n    if (!url) {\n        return constants_1.BLANK_URL;\n    }\n    var charsToDecode;\n    var decodedUrl = decodeURI(url.trim());\n    do {\n        decodedUrl = decodeHtmlCharacters(decodedUrl)\n            .replace(constants_1.htmlCtrlEntityRegex, \"\")\n            .replace(constants_1.ctrlCharactersRegex, \"\")\n            .replace(constants_1.whitespaceEscapeCharsRegex, \"\")\n            .trim();\n        decodedUrl = decodeURI(decodedUrl);\n        charsToDecode =\n            decodedUrl.match(constants_1.ctrlCharactersRegex) ||\n                decodedUrl.match(constants_1.htmlEntitiesRegex) ||\n                decodedUrl.match(constants_1.htmlCtrlEntityRegex) ||\n                decodedUrl.match(constants_1.whitespaceEscapeCharsRegex);\n    } while (charsToDecode && charsToDecode.length > 0);\n    var sanitizedUrl = decodedUrl;\n    if (!sanitizedUrl) {\n        return constants_1.BLANK_URL;\n    }\n    if (isRelativeUrlWithoutProtocol(sanitizedUrl)) {\n        return sanitizedUrl;\n    }\n    // Remove any leading whitespace before checking the URL scheme\n    var trimmedUrl = sanitizedUrl.trimStart();\n    var urlSchemeParseResults = trimmedUrl.match(constants_1.urlSchemeRegex);\n    if (!urlSchemeParseResults) {\n        return sanitizedUrl;\n    }\n    var urlScheme = urlSchemeParseResults[0].toLowerCase().trim();\n    if (constants_1.invalidProtocolRegex.test(urlScheme)) {\n        return constants_1.BLANK_URL;\n    }\n    var backSanitized = trimmedUrl.replace(/\\\\/g, \"/\");\n    // Handle special cases for mailto: and custom deep-link protocols\n    if (urlScheme === \"mailto:\" || urlScheme.includes(\"://\")) {\n        return backSanitized;\n    }\n    // For http and https URLs, perform additional validation\n    if (urlScheme === \"http:\" || urlScheme === \"https:\") {\n        if (!isValidUrl(backSanitized)) {\n            return constants_1.BLANK_URL;\n        }\n        var url_1 = new URL(backSanitized);\n        url_1.protocol = url_1.protocol.toLowerCase();\n        url_1.hostname = url_1.hostname.toLowerCase();\n        return url_1.toString();\n    }\n    return backSanitized;\n}\n"],"x_google_ignoreList":[0,1],"mappings":";;;AAUA,CATA,OAAO,eAAe,GAAS,cAAc,EAAE,OAAO,IAAM,CAAC,EAC7D,EAAQ,YAAY,EAAQ,0BAA0B,EAAQ,6BAA6B,EAAQ,iBAAiB,EAAQ,sBAAsB,EAAQ,sBAAsB,EAAQ,oBAAoB,EAAQ,uBAAuB,KAAK,GAChP,EAAQ,uBAAuB,yCAC/B,EAAQ,oBAAoB,oBAC5B,EAAQ,sBAAsB,qBAC9B,EAAQ,sBAAsB,sDAC9B,EAAQ,iBAAiB,qBACzB,EAAQ,6BAA6B,wCACrC,EAAQ,0BAA0B,CAAC,KAAK,IAAI,EAC5C,EAAQ,YAAY;;ACRpB,CADA,OAAO,eAAe,GAAS,cAAc,EAAE,OAAO,IAAM,CAAC,EAC7D,EAAQ,cAAc;CACtB,IAAI,IAAA,GAAA;CACJ,SAAS,EAA6B,GAAK;AACvC,SAAO,EAAY,wBAAwB,QAAQ,EAAI,GAAG,GAAG;;CAEjE,SAAS,EAAqB,GAAK;AAE/B,SADsB,EAAI,QAAQ,EAAY,qBAAqB,GAAG,CAC/C,QAAQ,EAAY,mBAAmB,SAAU,GAAO,GAAK;AAChF,UAAO,OAAO,aAAa,EAAI;IACjC;;CAEN,SAAS,EAAW,GAAK;AACrB,SAAO,IAAI,SAAS,EAAI;;CAE5B,SAAS,EAAU,GAAK;AACpB,MAAI;AACA,UAAO,mBAAmB,EAAI;UAExB;AAIN,UAAO;;;CAGf,SAAS,EAAY,GAAK;AACtB,MAAI,CAAC,EACD,QAAO,EAAY;EAEvB,IAAI,GACA,IAAa,EAAU,EAAI,MAAM,CAAC;AACtC;AAOI,GANA,IAAa,EAAqB,EAAW,CACxC,QAAQ,EAAY,qBAAqB,GAAG,CAC5C,QAAQ,EAAY,qBAAqB,GAAG,CAC5C,QAAQ,EAAY,4BAA4B,GAAG,CACnD,MAAM,EACX,IAAa,EAAU,EAAW,EAClC,IACI,EAAW,MAAM,EAAY,oBAAoB,IAC7C,EAAW,MAAM,EAAY,kBAAkB,IAC/C,EAAW,MAAM,EAAY,oBAAoB,IACjD,EAAW,MAAM,EAAY,2BAA2B;SAC3D,KAAiB,EAAc,SAAS;EACjD,IAAI,IAAe;AACnB,MAAI,CAAC,EACD,QAAO,EAAY;AAEvB,MAAI,EAA6B,EAAa,CAC1C,QAAO;EAGX,IAAI,IAAa,EAAa,WAAW,EACrC,IAAwB,EAAW,MAAM,EAAY,eAAe;AACxE,MAAI,CAAC,EACD,QAAO;EAEX,IAAI,IAAY,EAAsB,GAAG,aAAa,CAAC,MAAM;AAC7D,MAAI,EAAY,qBAAqB,KAAK,EAAU,CAChD,QAAO,EAAY;EAEvB,IAAI,IAAgB,EAAW,QAAQ,OAAO,IAAI;AAElD,MAAI,MAAc,aAAa,EAAU,SAAS,MAAM,CACpD,QAAO;AAGX,MAAI,MAAc,WAAW,MAAc,UAAU;AACjD,OAAI,CAAC,EAAW,EAAc,CAC1B,QAAO,EAAY;GAEvB,IAAI,IAAQ,IAAI,IAAI,EAAc;AAGlC,UAFA,EAAM,WAAW,EAAM,SAAS,aAAa,EAC7C,EAAM,WAAW,EAAM,SAAS,aAAa,EACtC,EAAM,UAAU;;AAE3B,SAAO"}