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

package/dist/dagre-BM42HDAG-DBqY2dVf.js

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

package/dist/dagre-BM42HDAG-DBqY2dVf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dagre-BM42HDAG-DBqY2dVf.js","names":["_.isUndefined","_.clone","_.map","graphlibJson.write","graphlib.Graph","graphlibJson2.write","graphlib2.Graph","getConfig"],"sources":["../node_modules/lodash-es/clone.js","../node_modules/dagre-d3-es/src/graphlib/json.js","../node_modules/mermaid/dist/chunks/mermaid.core/dagre-BM42HDAG.mjs"],"sourcesContent":["import baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\nfunction clone(value) {\n  return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nexport default clone;\n","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-KSCS5N6A.mjs\";\nimport \"./chunk-BSJP7CBP.mjs\";\nimport {\n  clear,\n  clear2 as clear3,\n  insertCluster,\n  insertNode,\n  positionNode,\n  setNodeElem,\n  updateNodeBounds\n} from \"./chunk-3OPIFGDE.mjs\";\nimport {\n  getSubGraphTitleMargins\n} from \"./chunk-L5ZTLDWV.mjs\";\nimport \"./chunk-NZK2D7GU.mjs\";\nimport \"./chunk-O5CBEL6O.mjs\";\nimport \"./chunk-5ZQYHXKU.mjs\";\nimport {\n  getConfig2 as getConfig\n} from \"./chunk-CSCIHK7Q.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.endLabelLeft = \"\";\n      edge1.endLabelRight = \"\";\n      edge1.startLabelLeft = \"\";\n      edge1.id = nodeId + \"-cyclic-special-1\";\n      edgeMid.startLabelRight = \"\";\n      edgeMid.startLabelLeft = \"\";\n      edgeMid.endLabelLeft = \"\";\n      edgeMid.endLabelRight = \"\";\n      edgeMid.arrowTypeStart = \"none\";\n      edgeMid.arrowTypeEnd = \"none\";\n      edgeMid.id = nodeId + \"-cyclic-special-mid\";\n      edge2.label = \"\";\n      edge2.startLabelRight = \"\";\n      edge2.startLabelLeft = \"\";\n      edge2.arrowTypeStart = \"none\";\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,2],"mappings":";;;;;;;;;;;;AAGA,IAAI,IAAqB;AA4BzB,SAAS,EAAM,GAAO;AACpB,QAAO,EAAU,GAAO,EAAmB;;;;AC2B7C,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;AAkF/B,CAjFA,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;AA0BnC,GAzBA,EAAM,QAAQ,IACd,EAAM,eAAe,QACrB,EAAM,eAAe,IACrB,EAAM,gBAAgB,IACtB,EAAM,iBAAiB,IACvB,EAAM,KAAK,IAAS,qBACpB,EAAQ,kBAAkB,IAC1B,EAAQ,iBAAiB,IACzB,EAAQ,eAAe,IACvB,EAAQ,gBAAgB,IACxB,EAAQ,iBAAiB,QACzB,EAAQ,eAAe,QACvB,EAAQ,KAAK,IAAS,uBACtB,EAAM,QAAQ,IACd,EAAM,kBAAkB,IACxB,EAAM,iBAAiB,IACvB,EAAM,iBAAiB,QACnB,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"}