@fibery/custom-app-text-editor 1.2.0

package/lib/chunk-RYQCIY6F-CHlASUpG.js

@@ -0,0 +1,241 @@
+import { n as e } from "./chunk-Y2CYZVJY-QdJ4V9rh.js";
+import { m as t } from "./src-DQbL46sB.js";
+import { r as n, t as r } from "./graphlib-DglfpsVp.js";
+import { r as i, t as a } from "./map-C7KALUOH.js";
+//#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/clone.js
+var o = 4;
+function s(e) {
+	return i(e, o);
+}
+//#endregion
+//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/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: l(e),
+		edges: u(e)
+	};
+	return n(e.graph()) || (t.value = s(e.graph())), t;
+}
+function l(e) {
+	return a(e.nodes(), function(t) {
+		var r = e.node(t), i = e.parent(t), a = { v: t };
+		return n(r) || (a.value = r), n(i) || (a.parent = i), a;
+	});
+}
+function u(e) {
+	return a(e.edges(), function(t) {
+		var r = e.edge(t), i = {
+			v: t.v,
+			w: t.w
+		};
+		return n(t.name) || (i.name = t.name), n(r) || (i.value = r), i;
+	});
+}
+//#endregion
+//#region ../../node_modules/.pnpm/mermaid@11.16.0/node_modules/mermaid/dist/chunks/mermaid.core/chunk-RYQCIY6F.mjs
+var d = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ e(() => {
+	f.clear(), p.clear(), d.clear();
+}, "clear"), h = /* @__PURE__ */ e((e, n) => {
+	let r = f.get(n) || [];
+	return t.trace("In isDescendant", n, " ", e, " = ", r.includes(e)), r.includes(e);
+}, "isDescendant"), g = /* @__PURE__ */ e((e, n) => {
+	let r = f.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) || h(e.v, n) || h(e.w, n) || r.includes(e.w) : (t.debug("Tilt, ", n, ",not in descendants"), !1);
+}, "edgeInCluster"), _ = /* @__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) _(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 {
+					if (g(a, i)) {
+						let e = f.get(i) || [], s = e.includes(a.v) || h(a.v, i) || a.v === i, c = e.includes(a.w) || h(a.w, i) || a.w === i;
+						if (s && c) 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]));
+						else {
+							let e = s ? i : a.v, r = c ? i : a.w;
+							t.info("Rebinding cross-boundary edge as ", e, r, o, a.name), n.setEdge(e, r, o, a.name);
+						}
+					} else 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"), v = /* @__PURE__ */ e((e, t) => {
+	let n = t.children(e), r = [...n];
+	for (let i of n) p.set(i, e), r = [...r, ...v(i, t)];
+	return r;
+}, "extractDescendants"), y = /* @__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"), b = /* @__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 = b(e, n, r), i = y(n, r, t);
+		if (t) {
+			if (i.length > 0) a = t;
+			else return t;
+		}
+	}
+	return a;
+}, "findNonClusterChild"), x = /* @__PURE__ */ e((e) => !d.has(e) || !d.get(e).externalConnections ? e : d.has(e) ? d.get(e).id : e, "getAnchorId"), S = /* @__PURE__ */ e((e, n) => {
+	if (!e || n > 10) {
+		t.debug("Opting out, no graph ");
+		return;
+	}
+	t.debug("Opting in, graph "), e.nodes().forEach(function(n) {
+		e.children(n).length > 0 && (t.warn("Cluster identified", n, " Replacement id in edges: ", b(n, e, n)), f.set(n, v(n, e)), d.set(n, {
+			id: b(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, f), i.forEach((e) => {
+			h(e.v, n) ^ h(e.w, n) && (t.warn("Edge: ", e, " leaves cluster ", n), t.warn("Descendants of XXX ", n, ": ", f.get(n)), d.get(n).externalConnections = !0);
+		})) : t.debug("Not a cluster ", n, f);
+	});
+	for (let t of d.keys()) {
+		let n = d.get(t).id, r = e.parent(n);
+		r !== t && d.has(r) && !d.get(r).externalConnections && (d.get(t).id = r);
+		let i = e.edges().some((e) => e.v === t);
+		if (n && d.get(t)?.externalConnections && i && E(e, n, t)) {
+			let r = D(e, t, e.parent(n));
+			r && (d.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", d, "ids:", n.v, n.w, "Translating: ", d.get(n.v), " --- ", d.get(n.w)), d.get(n.v) || d.get(n.w)) {
+			if (t.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), i = x(n.v), a = x(n.w), e.removeEdge(n.v, n.w, n.name), i !== n.v) {
+				let t = e.parent(i);
+				d.get(t).externalConnections = !0, r.fromCluster = n.v;
+			}
+			if (a !== n.w) {
+				let t = e.parent(a);
+				d.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)), C(e, 0), t.trace(d);
+}, "adjustClustersAndEdges"), C = /* @__PURE__ */ e((e, n) => {
+	if (t.warn("extractor - ", n, c(e), e.children("D")), n > 10) {
+		t.error("Bailing out");
+		return;
+	}
+	let i = e.nodes(), a = !1;
+	for (let t of i) {
+		let n = e.children(t);
+		a ||= n.length > 0;
+	}
+	if (!a) {
+		t.debug("Done, no node has children", e.nodes());
+		return;
+	}
+	t.debug("Nodes = ", i, n);
+	for (let a of i) if (t.debug("Extracting node", a, d, d.has(a) && !d.get(a).externalConnections, !e.parent(a), e.node(a), e.children("D"), " Depth ", n), !d.has(a)) t.debug("Not a cluster", a, n);
+	else if (d.get(a)?.clusterData?.explicitDir && e.children(a) && e.children(a).length > 0) {
+		t.warn("Cluster with explicit dir, creating subgraph for children", a, n);
+		let i = d.get(a).clusterData.dir, o = new r({
+			multigraph: !0,
+			compound: !0
+		}).setGraph({
+			rankdir: i,
+			nodesep: 50,
+			ranksep: 50,
+			marginx: 8,
+			marginy: 8
+		}).setDefaultEdgeLabel(function() {
+			return {};
+		});
+		_(a, e, o, a);
+		let s = e.node(a) || {};
+		e.setNode(a, {
+			...s,
+			clusterNode: !0,
+			id: a,
+			clusterData: d.get(a).clusterData,
+			label: d.get(a).label,
+			graph: o
+		}), t.warn("Subgraph for cluster with explicit dir created:", a, c(o));
+	} else if (!d.get(a).externalConnections && e.children(a) && e.children(a).length > 0) {
+		t.warn("Cluster without external connections, without a parent and with children", a, n);
+		let i = e.graph().rankdir === "TB" ? "LR" : "TB";
+		d.get(a)?.clusterData?.dir && (i = d.get(a).clusterData.dir, t.warn("Fixing dir", d.get(a).clusterData.dir, i));
+		let o = new r({
+			multigraph: !0,
+			compound: !0
+		}).setGraph({
+			rankdir: i,
+			nodesep: 50,
+			ranksep: 50,
+			marginx: 8,
+			marginy: 8
+		}).setDefaultEdgeLabel(function() {
+			return {};
+		});
+		_(a, e, o, a);
+		let s = e.node(a) || {};
+		e.setNode(a, {
+			...s,
+			clusterNode: !0,
+			id: a,
+			clusterData: d.get(a).clusterData,
+			label: d.get(a).label,
+			graph: o
+		}), t.debug("Old graph after copy", c(e));
+	} else t.warn("Cluster ** ", a, " **not meeting the criteria !externalConnections:", !d.get(a).externalConnections, " no parent: ", !e.parent(a), " children ", e.children(a) && e.children(a).length > 0, e.children("D"), n), t.debug(d);
+	i = e.nodes(), t.warn("New list of nodes", i);
+	for (let r of i) {
+		let i = e.node(r);
+		t.warn(" Now next level", r, i), i?.clusterNode && C(i.graph, n + 1);
+	}
+}, "extractor"), w = /* @__PURE__ */ e((e, t) => {
+	if (t.length === 0) return [];
+	let n = Object.assign([], t);
+	return t.forEach((t) => {
+		let r = w(e, e.children(t));
+		n = [...n, ...r];
+	}), n;
+}, "sorter"), T = /* @__PURE__ */ e((e) => w(e, e.children()), "sortNodesByHierarchy"), E = /* @__PURE__ */ e((e, t, n) => {
+	let r = e.parent(t);
+	for (; r && r !== n;) {
+		let t = d.get(r);
+		if (t && !t.externalConnections) return !0;
+		r = e.parent(r);
+	}
+	return !1;
+}, "isNodeInExtractableCluster"), D = /* @__PURE__ */ e((e, t, n) => {
+	let r = e.children(t) ?? [];
+	for (let i of r) {
+		if (i === n || h(i, n)) continue;
+		let r = b(i, e, t);
+		if (r && !E(e, r, t)) return r;
+	}
+	return null;
+}, "findSafeAnchorNode");
+//#endregion
+export { T as a, b as i, m as n, c as o, d as r, S as t };