@smarter.sh/ui-chat 0.7.1 → 0.9.0

package/dist/embed/mermaid/channel-BXMcYHk2.js

@@ -0,0 +1,5 @@
+import { at as e, ot as t } from "./chunk-DU6HZSFF-1zIarP1Q.js";
+//#region node_modules/khroma/dist/methods/channel.js
+var n = (n, r) => t.lang.round(e.parse(n)[r]);
+//#endregion
+export { n as t };

package/dist/embed/mermaid/chunk-2E4U76K2-CBll2dEU.js

@@ -0,0 +1,346 @@
+import { m as e } from "./src-DbyMbLVK.js";
+import { n as t } from "./chunk-Y2CYZVJY-i11wjrBe.js";
+import { b as n, x as r } from "./chunk-DU6HZSFF-1zIarP1Q.js";
+import { g as i } from "./chunk-75Z2AOVW-BsWtLgfj.js";
+import { a } from "./chunk-4HAMMTFA-Dhz0SVnN.js";
+import { i as o, n as s, r as c, t as l } from "./chunk-GVQU2GXP-CWFtOgtb.js";
+import { n as u, t as d } from "./chunk-L3NEJ4N5-DnkSrVO8.js";
+import { a as f, i as p, l as m, n as h, r as g, s as _, t as v } from "./chunk-OSK3NFVY-B57tZZIG.js";
+import { t as y } from "./graphlib-XW-Jr8pF.js";
+//#region node_modules/mermaid/dist/chunks/mermaid.core/chunk-2E4U76K2.mjs
+function b(e, { edgePathsClass: t = "edges edgePaths" } = {}) {
+	let n = e.insert("g").attr("class", "root");
+	return {
+		clusters: n.insert("g").attr("class", "clusters"),
+		edgePaths: n.insert("g").attr("class", t),
+		edgeLabels: n.insert("g").attr("class", "edgeLabels"),
+		nodes: n.insert("g").attr("class", "nodes"),
+		rootGroups: n
+	};
+}
+t(b, "createLayoutElementGroups");
+async function x(e, t) {
+	if (t.label) {
+		let { shapeSvg: n, bbox: r } = await a(e, t);
+		t.labelBBox = {
+			width: r.width,
+			height: r.height
+		}, n.remove();
+	} else t.labelBBox = {
+		width: 0,
+		height: 0
+	};
+}
+t(x, "measureGroupLabel");
+async function S(e, t, n) {
+	let r = await c(e, t, n), i = r.node()?.getBBox() ?? {
+		width: 0,
+		height: 0
+	};
+	return t.width = i.width, t.height = i.height, r;
+}
+t(S, "insertMeasuredNode");
+async function C(e, t) {
+	let n = new y({
+		multigraph: !0,
+		compound: !0
+	}), i = [...t.edges], a = r(), o = b(e), { edgeLabels: s, nodes: c } = o, l = /* @__PURE__ */ new Map(), u = e.node() != null;
+	await Promise.all(t.nodes.map(async (e) => {
+		if (e.isGroup) u && await x(c, e), n.setNode(e.id, { ...e });
+		else {
+			if (u) {
+				let t = await S(c, e, {
+					config: a,
+					dir: e.dir
+				});
+				l.set(e.id, t);
+			}
+			n.setNode(e.id, { ...e });
+		}
+	}));
+	for (let e of i) u && g(e) && await f(s, e), n.setEdge(e.start, e.end, { ...e }, e.id), t.edges.some((t) => t.id === e.id) || t.edges.push(e);
+	if (globalThis.mermaidCaptureSizes) {
+		let { captureNodeSizes: n } = await import("./sizeCapture-INFHLROL-DujrpAYz.js");
+		n(e, t);
+	}
+	return {
+		graph: n,
+		groups: o,
+		nodeElements: l
+	};
+}
+t(C, "createGraphWithElements");
+var w = /* @__PURE__ */ new Map(), T = /* @__PURE__ */ new Map(), E = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ t(() => {
+	T.clear(), E.clear(), w.clear();
+}, "clear"), O = /* @__PURE__ */ t((t, n) => {
+	let r = T.get(n) || [];
+	return e.trace("In isDescendant", n, " ", t, " = ", r.includes(t)), r.includes(t);
+}, "isDescendant"), k = /* @__PURE__ */ t((t, n) => {
+	let r = T.get(n) || [];
+	return e.info("Descendants of ", n, " is ", r), e.info("Edge is ", t), t.v === n || t.w === n ? !1 : r ? r.includes(t.v) || O(t.v, n) || O(t.w, n) || r.includes(t.w) : (e.debug("Tilt, ", n, ",not in descendants"), !1);
+}, "edgeInCluster"), A = /* @__PURE__ */ t((t, n, r, i) => {
+	e.debug("Copying children of ", t, "root", i, "data", n.node(t), i);
+	let a = n.children(t) || [];
+	t !== i && a.push(t), e.debug("Copying (nodes) clusterId", t, "nodes", a), a.forEach((a) => {
+		if (n.children(a).length > 0) A(a, n, r, i);
+		else {
+			let o = n.node(a);
+			e.info("cp ", a, " to ", i, " with parent ", t), r.setNode(a, o), i !== n.parent(a) && (e.debug("Setting parent", a, n.parent(a)), r.setParent(a, n.parent(a))), t !== i && a !== t ? (e.debug("Setting parent", a, t), r.setParent(a, t)) : (e.info("In copy ", t, "root", i, "data", n.node(t), i), e.debug("Not Setting parent for node=", a, "cluster!==rootId", t !== i, "node!==clusterId", a !== t));
+			let s = n.edges(a);
+			e.debug("Copying Edges", s), s.forEach((a) => {
+				e.info("Edge", a);
+				let o = n.edge(a.v, a.w, a.name);
+				e.info("Edge data", o, i);
+				try {
+					k(a, i) ? (e.info("Copying as ", a.v, a.w, o, a.name), r.setEdge(a.v, a.w, o, a.name), e.info("newGraph edges ", r.edges(), r.edge(r.edges()[0]))) : e.info("Skipping copy of edge ", a.v, "-->", a.w, " rootId: ", i, " clusterId:", t);
+				} catch (t) {
+					e.error(t);
+				}
+			});
+		}
+		e.debug("Removing node", a), n.removeNode(a);
+	});
+}, "copy"), j = /* @__PURE__ */ t((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__ */ t((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__ */ t((t, n, r) => {
+	let i = n.children(t);
+	if (e.trace("Searching children of id ", t, i), i.length < 1) return t;
+	let a;
+	for (let e of i) {
+		let t = N(e, n, r), i = M(n, r, t);
+		if (t) {
+			if (i.length > 0) a = t;
+			else return t;
+		}
+	}
+	return a;
+}, "findNonClusterChild"), P = /* @__PURE__ */ t((e) => !w.has(e) || !w.get(e).externalConnections ? e : w.has(e) ? w.get(e).id : e, "getAnchorId"), F = /* @__PURE__ */ t((t, n) => {
+	if (!t || n > 10) e.debug("Opting out, no graph ");
+	else {
+		e.debug("Opting in, graph "), t.nodes().forEach(function(n) {
+			t.children(n).length > 0 && (e.debug("Cluster identified", n, " Replacement id in edges: ", N(n, t, n)), T.set(n, j(n, t)), w.set(n, {
+				id: N(n, t, n),
+				clusterData: t.node(n)
+			}));
+		}), t.nodes().forEach(function(n) {
+			let r = t.children(n), i = t.edges();
+			r.length > 0 ? (e.debug("Cluster identified", n, T), i.forEach((t) => {
+				O(t.v, n) ^ O(t.w, n) && (e.debug("Edge: ", t, " leaves cluster ", n), e.debug("Descendants of XXX ", n, ": ", T.get(n)), w.get(n).externalConnections = !0);
+			})) : e.debug("Not a cluster ", n, T);
+		});
+		for (let e of w.keys()) {
+			let n = w.get(e).id, r = t.parent(n);
+			r !== e && w.has(r) && !w.get(r).externalConnections && (w.get(e).id = r);
+			let i = t.edges().some((t) => t.v === e);
+			if (n && w.get(e)?.externalConnections && i && z(t, n, e)) {
+				let r = B(t, e, t.parent(n));
+				r && (w.get(e).id = r);
+			}
+		}
+		t.edges().forEach(function(n) {
+			let r = t.edge(n);
+			e.debug("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), e.debug("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(t.edge(n)));
+			let i = n.v, a = n.w;
+			if (e.debug("Fix XXX", w, "ids:", n.v, n.w, "Translating: ", w.get(n.v), " --- ", w.get(n.w)), w.get(n.v) || w.get(n.w)) {
+				if (e.debug("Fixing and trying - removing XXX", n.v, n.w, n.name), i = P(n.v), a = P(n.w), t.removeEdge(n.v, n.w, n.name), i !== n.v) {
+					let e = t.parent(i);
+					w.get(e).externalConnections = !0, r.fromCluster = n.v;
+				}
+				if (a !== n.w) {
+					let e = t.parent(a);
+					w.get(e).externalConnections = !0, r.toCluster = n.w;
+				}
+				e.debug("Fix Replacing with XXX", i, a, n.name), t.setEdge(i, a, r, n.name);
+			}
+		}), I(t, 0), e.trace(w);
+	}
+}, "adjustClustersAndEdges"), I = /* @__PURE__ */ t((t, n) => {
+	if (n > 10) {
+		e.error("Bailing out");
+		return;
+	}
+	let r = t.nodes(), i = !1;
+	for (let e of r) {
+		let n = t.children(e);
+		i ||= n.length > 0;
+	}
+	if (!i) e.debug("Done, no node has children", t.nodes());
+	else {
+		e.debug("Nodes = ", r, n);
+		for (let i of r) if (e.debug("Extracting node", i, w, w.has(i) && !w.get(i).externalConnections, !t.parent(i), t.node(i), t.children("D"), " Depth ", n), !w.has(i)) e.debug("Not a cluster", i, n);
+		else if (!w.get(i).externalConnections && t.children(i) && t.children(i).length > 0) {
+			e.debug("Cluster without external connections, without a parent and with children", i, n);
+			let r = t.graph().rankdir === "TB" ? "LR" : "TB";
+			w.get(i)?.clusterData?.dir && (r = w.get(i).clusterData.dir, e.debug("Fixing dir", w.get(i).clusterData.dir, r));
+			let a = new y({
+				multigraph: !0,
+				compound: !0
+			}).setGraph({
+				rankdir: r,
+				nodesep: 50,
+				ranksep: 50,
+				marginx: 8,
+				marginy: 8
+			}).setDefaultEdgeLabel(function() {
+				return {};
+			});
+			A(i, t, a, i), t.setNode(i, {
+				clusterNode: !0,
+				id: i,
+				clusterData: w.get(i).clusterData,
+				label: w.get(i).label,
+				graph: a
+			});
+		} else e.debug("Cluster ** ", i, " **not meeting the criteria !externalConnections:", !w.get(i).externalConnections, " no parent: ", !t.parent(i), " children ", t.children(i) && t.children(i).length > 0, t.children("D"), n), e.debug(w);
+		r = t.nodes(), e.debug("New list of nodes", r);
+		for (let i of r) {
+			let r = t.node(i);
+			e.debug(" Now next level", i, r), r?.clusterNode && I(r.graph, n + 1);
+		}
+	}
+}, "extractor"), L = /* @__PURE__ */ t((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__ */ t((e) => L(e, e.children()), "sortNodesByHierarchy"), z = /* @__PURE__ */ t((e, t, n) => {
+	let r = e.parent(t);
+	for (; r && r !== n;) {
+		let t = w.get(r);
+		if (t && !t.externalConnections) return !0;
+		r = e.parent(r);
+	}
+	return !1;
+}, "isNodeInExtractableCluster"), B = /* @__PURE__ */ t((e, t, n) => {
+	let r = e.children(t) ?? [];
+	for (let i of r) {
+		if (i === n || O(i, n)) continue;
+		let r = N(i, e, t);
+		if (r && !z(e, r, t)) return r;
+	}
+	return null;
+}, "findSafeAnchorNode");
+function V({ prepareLayout: e, measureLayout: n, runLayoutCore: r, paintLayout: i, afterPaint: a, paintOptions: o }) {
+	let s = n ?? U;
+	return /* @__PURE__ */ t(async function(t, n, c, l) {
+		let u = n.select("g");
+		(c?.insertMarkers ?? _)(u, t.markers, t.type, t.diagramId), H();
+		let d = {
+			element: u,
+			helpers: c,
+			options: l
+		};
+		d.preparedLayout = await e?.(t, d);
+		let f = await s(t, d), p = await r(t, d), m = {
+			...d,
+			measure: f
+		};
+		i ? await i(t, m, p) : await W(t, m, o), await a?.(t, m, p);
+	}, "render");
+}
+t(V, "createCommonLayoutRenderer");
+function H() {
+	l(), v(), d(), D();
+}
+t(H, "clearLayoutRenderState");
+async function U(e, { element: t }) {
+	return await C(t, e);
+}
+t(U, "defaultMeasureLayout");
+async function W(e, t, n = {}) {
+	let { measure: r } = t, { groups: i } = r;
+	for (let r of n.getNodes?.(e, t) ?? e.nodes) n.skipNode?.(r, t) || await G(i, r, t, n);
+	let a = q(e.nodes);
+	for (let r of e.edges) J(r, n) || await Y(i, r, a, e, n, t);
+}
+t(W, "paintLayoutData");
+async function G(e, t, n, r) {
+	t.clusterNode ? o(t) : K(t, n, r) ? await u(e.clusters, t) : o(t);
+}
+t(G, "paintLayoutNode");
+function K(e, t, n) {
+	return e.isGroup === !0 && (n.isCluster?.(e, t) ?? !0);
+}
+t(K, "shouldPaintAsCluster");
+function q(e) {
+	let t = /* @__PURE__ */ new Map();
+	for (let n of e) n?.id && t.set(n.id, n);
+	return t;
+}
+t(q, "buildNodeLookup");
+function J(e, t) {
+	return e.isLayoutOnly || !!t.skipEdge?.(e);
+}
+t(J, "shouldSkipPaintEdge");
+async function Y(e, t, n, r, i, a) {
+	let o = p(e.edgePaths, { ...t }, i.clusterDb ?? /* @__PURE__ */ new Map(), r.type, X(t.start, t, n, a, i), X(t.end, t, n, a, i), r.diagramId, Z(t, i));
+	g(t) && (h.has(t.id) || await f(e.edgeLabels, t), Q(t, o));
+}
+t(Y, "paintLayoutEdge");
+function X(e, t, n, r, i) {
+	return i.getEdgeNode?.(e, t, r) ?? (e ? n.get(e) ?? {} : {});
+}
+t(X, "getRenderedNode");
+function Z(e, t) {
+	return typeof t.skipIntersect == "function" ? t.skipIntersect(e) : t.skipIntersect ?? !1;
+}
+t(Z, "shouldSkipIntersect");
+function Q(t, r) {
+	let a = r?.updatedPath ?? r?.originalPath, o = n(), { subGraphTitleTotalMargin: c } = s({ flowchart: o.flowchart ?? {} });
+	if (t.label) {
+		let n = h.get(t.id), o = t.x, s = t.y;
+		if (a) {
+			let n = i.calcLabelPosition(a);
+			e.debug("Moving label " + t.label + " from (", o, ",", s, ") to (", n.x, ",", n.y, ") abc88"), r?.updatedPath && (o = n.x, s = n.y);
+		}
+		n.attr("transform", `translate(${o}, ${s + c / 2})`);
+	}
+	if (t?.startLabelLeft) {
+		let e = m.get(t.id).startLeft, n = t?.x, r = t?.y;
+		if (a) {
+			let e = i.calcTerminalLabelPosition(t.arrowTypeStart ? 10 : 0, "start_left", a);
+			n = e.x, r = e.y;
+		}
+		e.attr("transform", `translate(${n}, ${r})`);
+	}
+	if (t.startLabelRight) {
+		let e = m.get(t.id).startRight, n = t.x, r = t.y;
+		if (a) {
+			let e = i.calcTerminalLabelPosition(t.arrowTypeStart ? 10 : 0, "start_right", a);
+			n = e.x, r = e.y;
+		}
+		e.attr("transform", `translate(${n}, ${r})`);
+	}
+	if (t.endLabelLeft) {
+		let e = m.get(t.id).endLeft, n = t.x, r = t.y;
+		if (a) {
+			let e = i.calcTerminalLabelPosition(t.arrowTypeEnd ? 10 : 0, "end_left", a);
+			n = e.x, r = e.y;
+		}
+		e.attr("transform", `translate(${n}, ${r})`);
+	}
+	if (t.endLabelRight) {
+		let e = m.get(t.id).endRight, n = t.x, r = t.y;
+		if (a) {
+			let e = i.calcTerminalLabelPosition(t.arrowTypeEnd ? 10 : 0, "end_right", a);
+			n = e.x, r = e.y;
+		}
+		e.attr("transform", `translate(${n}, ${r})`);
+	}
+}
+t(Q, "positionRenderedEdgeLabel");
+//#endregion
+export { N as a, b as i, w as n, S as o, V as r, R as s, F as t };

package/dist/embed/mermaid/chunk-2Q5K7J3B-kzxEEeTu.js

@@ -0,0 +1,15 @@
+import { n as e } from "./chunk-Y2CYZVJY-i11wjrBe.js";
+//#region node_modules/mermaid/dist/chunks/mermaid.core/chunk-2Q5K7J3B.mjs
+var t = class {
+	constructor(e) {
+		this.init = e, this.records = this.init();
+	}
+	static {
+		e(this, "ImperativeState");
+	}
+	reset() {
+		this.records = this.init();
+	}
+};
+//#endregion
+export { t };