file-viewer3 1.0.26 → 2.0.0

package/dist/components/dagre-BM42HDAG.js

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