@p10node/graphviz 0.0.0-stage → 0.9.0

package/dist/index.js

@@ -0,0 +1,1882 @@
+function e(e, t, n, r) {
+	let i = e.length, a = n.length, o = Array.from({ length: i }, () => []), s = Array(i).fill(!0);
+	t.forEach((e, t) => {
+		e.v !== e.w && (o[e.v].push(t), s[e.w] = !1);
+	});
+	let c = Array(t.length).fill(!1), l = new Uint8Array(i), u = [...Array.from({ length: i }, (e, t) => t).filter((e) => s[e]), ...Array.from({ length: i }, (e, t) => t)];
+	for (let e of u) {
+		if (l[e]) continue;
+		l[e] = 1;
+		let n = [[e, 0]];
+		for (; n.length;) {
+			let e = n[n.length - 1], r = e[0];
+			if (e[1] < o[r].length) {
+				let i = o[r][e[1]++], a = t[i].w;
+				l[a] === 1 ? c[i] = !0 : l[a] || (l[a] = 1, n.push([a, 0]));
+			} else l[r] = 2, n.pop();
+		}
+	}
+	let d = /* @__PURE__ */ new Map();
+	r.sameRank?.forEach((e, t) => e.forEach((e) => d.set(e, t)));
+	let f = t.map((e, t) => {
+		let n = d.has(e.v) && d.get(e.v) === d.get(e.w);
+		return c[t] ? {
+			v: e.w,
+			w: e.v,
+			minlen: n ? 0 : e.minlen,
+			weight: e.weight
+		} : {
+			v: e.v,
+			w: e.w,
+			minlen: n ? 0 : e.minlen,
+			weight: e.weight
+		};
+	}), p = Array.from({ length: i }, () => []), m = Array.from({ length: i }, () => []);
+	f.forEach((e, t) => {
+		e.v !== e.w && (m[e.v].push(t), p[e.w].push(t));
+	});
+	let h = [];
+	{
+		let e = p.map((e) => e.length), t = Array.from({ length: i }, (e, t) => t).filter((t) => !e[t]);
+		for (; t.length;) {
+			let n = t.shift();
+			h.push(n);
+			for (let r of m[n]) --e[f[r].w] || t.push(f[r].w);
+		}
+		if (h.length < i) for (let e = 0; e < i; e++) h.includes(e) || h.push(e);
+	}
+	let g = Array(i).fill(0), _ = () => {
+		for (let e of h) for (let t of m[e]) g[f[t].w] = Math.max(g[f[t].w], g[e] + f[t].minlen);
+	};
+	_();
+	for (let e = 0; e < 60; e++) {
+		let t = !1, n = e % 2 ? [...h].reverse() : h;
+		for (let e of n) {
+			if (d.has(e)) continue;
+			let n = -Infinity, r = Infinity, i = 0, a = 0;
+			for (let t of p[e]) n = Math.max(n, g[f[t].v] + f[t].minlen), i += f[t].weight;
+			for (let t of m[e]) r = Math.min(r, g[f[t].w] - f[t].minlen), a += f[t].weight;
+			let o = g[e];
+			i > a && n > -Infinity ? o = n : a > i && r < Infinity && (o = r), o !== g[e] && (g[e] = o, t = !0);
+		}
+		if (!t) break;
+	}
+	if (r.sameRank?.length) for (let e = 0; e < 12; e++) {
+		let e = !1;
+		for (let t of r.sameRank) {
+			let n = Math.max(...t.map((e) => g[e]));
+			for (let r of t) g[r] !== n && (g[r] = n, e = !0);
+		}
+		if (_(), !e) break;
+	}
+	let v = g.reduce((e, t) => Math.min(e, t), 0);
+	for (let e = 0; e < i; e++) g[e] -= v;
+	let y = g.reduce((e, t) => Math.max(e, t), 0), b = (e) => {
+		let t = [];
+		for (let r = e; r >= 0; r = n[r].parent) t.unshift(r);
+		return t;
+	}, x = (e, t) => {
+		let n = b(e), r = b(t), i = 0;
+		for (; i < n.length && i < r.length && n[i] === r[i];) i++;
+		return i ? n[i - 1] : -1;
+	}, S = e.map((e) => e.w), C = e.map((e) => e.h), w = e.map(() => 0), T = e.map((e) => e.cluster), E = [...g], D = e.map((e) => e.loop ?? 0), O = e.map(() => -1), ee = (e, t, n, r, i) => (S.push(e), C.push(t), w.push(n), T.push(r), E.push(i), D.push(0), O.push(n === 2 || n === 3 ? r : -1), S.length - 1), k = [], A = [], te = (e, t, n) => {
+		for (; k.length < S.length;) k.push([]), A.push([]);
+		A[e].push([t, n]), k[t].push([e, n]);
+	}, ne = 6e4;
+	for (let e of f) ne -= Math.max(0, Math.abs(g[e.w] - g[e.v]) - 1);
+	if (ne < 0) throw Error("The diagram is too large to draw");
+	let re = [], j = [];
+	f.forEach((e, n) => {
+		if (e.v === e.w) {
+			re.push(null), j.push(-1);
+			return;
+		}
+		let r = [e.v], i = g[e.w] - g[e.v], a = t[n].label, o = a && i >= 2 ? g[e.v] + Math.floor(i / 2) : -1, s = x(T[e.v], T[e.w]), c = -1;
+		for (let t = g[e.v] + 1; t < g[e.w]; t++) {
+			let e = t === o ? ee(a.w, a.h, 1, s, t) : ee(0, 0, 1, s, t);
+			t === o && (c = e), r.push(e);
+		}
+		r.push(e.w), re.push(i > 0 ? r : null), j.push(c);
+		for (let t = 0; t + 1 < r.length && !(i <= 0); t++) {
+			let n = r[t], i = r[t + 1], a = +(w[n] === 1) + +(w[i] === 1);
+			te(n, i, e.weight * (a === 2 ? 8 : a === 1 ? 2 : 1));
+		}
+	});
+	let ie = f.map((e, t) => e.v !== e.w && g[e.v] === g[e.w] && !re[t]), M = Array(a).fill(Infinity), N = Array(a).fill(-Infinity);
+	for (let e = 0; e < S.length; e++) for (let t of b(T[e])) M[t] = Math.min(M[t], E[e]), N[t] = Math.max(N[t], E[e]);
+	let P = Array.from({ length: a }, () => []), F = Array.from({ length: a }, () => []), I = [];
+	for (let e = 0; e < a; e++) if (!(M[e] > N[e])) for (let t = M[e]; t <= N[e]; t++) P[e][t] = ee(0, 0, 2, e, t), F[e][t] = ee(0, 0, 3, e, t);
+	for (; k.length < S.length;) k.push([]), A.push([]);
+	for (let e = 0; e < S.length; e++) I.push([]);
+	for (let e = 0; e < a; e++) for (let t = M[e]; t < N[e]; t++) I[P[e][t]].push([P[e][t + 1], 1]), I[P[e][t + 1]].push([P[e][t], 1]), I[F[e][t]].push([F[e][t + 1], 1]), I[F[e][t + 1]].push([F[e][t], 1]);
+	let L = S.length;
+	y = E.reduce((e, t) => Math.max(e, t), y);
+	let R = Array.from({ length: y + 1 }, () => []);
+	{
+		let e = new Uint8Array(L), t = Array.from({ length: L }, (e, t) => t).filter((e) => w[e] !== 2 && w[e] !== 3).sort((e, t) => E[e] - E[t] || e - t);
+		for (let n of t) {
+			if (e[n]) continue;
+			let t = [n];
+			for (; t.length;) {
+				let n = t.pop();
+				if (!e[n]) {
+					e[n] = 1, R[E[n]].push(n);
+					for (let r = A[n].length - 1; r >= 0; r--) e[A[n][r][0]] || t.push(A[n][r][0]);
+				}
+			}
+		}
+		for (let e = 0; e < L; e++) (w[e] === 2 || w[e] === 3) && R[E[e]].push(e);
+	}
+	let z = new Float64Array(L), B = () => R.forEach((e) => e.forEach((e, t) => z[e] = t));
+	B();
+	let V = new Float64Array(L), H = new Float64Array(a), U = () => {
+		for (let e = 0; e < a; e++) {
+			if (M[e] > N[e]) continue;
+			let t = 0;
+			for (let n = M[e]; n <= N[e]; n++) t += z[P[e][n]] / Math.max(1, R[n].length);
+			H[e] = t / (N[e] - M[e] + 1);
+		}
+	}, W = (e, t) => {
+		if (!a) return [...e].sort((e, t) => V[e] - V[t] || z[e] - z[t]);
+		let r = {
+			node: -1,
+			cluster: -1,
+			key: 0,
+			idx: 0,
+			items: []
+		}, i = /* @__PURE__ */ new Map(), o = (e) => {
+			if (e < 0) return r;
+			let a = i.get(e);
+			return a || (a = {
+				node: -1,
+				cluster: e,
+				key: 0,
+				idx: z[P[e][t]] ?? 0,
+				items: []
+			}, i.set(e, a), o(n[e].parent).items.push(a)), a;
+		};
+		for (let t of e) w[t] === 2 ? o(O[t]) : w[t] !== 3 && o(T[t]).items.push({
+			node: t,
+			cluster: -1,
+			key: V[t],
+			idx: z[t],
+			items: []
+		});
+		let s = (e) => {
+			let n = 0, r = 0;
+			for (let t of e.items) if (t.node >= 0) n += t.key, r++;
+			else {
+				let [e, i] = s(t);
+				n += e, r += i;
+			}
+			e.cluster >= 0 && (e.key = r ? n / r : V[P[e.cluster][t]]), e.items.sort((e, t) => e.key - t.key || e.idx - t.idx);
+			let i = e.items.map((e, t) => e.cluster >= 0 ? t : -1).filter((e) => e >= 0), a = i.map((t) => e.items[t]).sort((e, t) => H[e.cluster] - H[t.cluster]);
+			return i.forEach((t, n) => e.items[t] = a[n]), [n, r];
+		};
+		s(r);
+		let c = [], l = (e) => {
+			for (let n of e.items) n.node >= 0 ? c.push(n.node) : (c.push(P[n.cluster][t]), l(n), c.push(F[n.cluster][t]));
+		};
+		return l(r), c;
+	}, ae = (e) => {
+		let t = 0;
+		for (let n = 0; n + 1 < e.length; n++) {
+			let r = [];
+			for (let t of e[n]) for (let [e] of A[t]) r.push([z[t], z[e]]);
+			r.sort((e, t) => e[0] - t[0] || e[1] - t[1]);
+			let i = e[n + 1].length + 1, a = new Float64Array(i + 1);
+			for (let e = 0; e < r.length; e++) {
+				let n = 0;
+				for (let t = r[e][1] + 1; t > 0; t -= t & -t) n += a[t];
+				t += e - n;
+				for (let t = r[e][1] + 1; t <= i; t += t & -t) a[t]++;
+			}
+		}
+		return t;
+	}, G = (e, t) => {
+		let n = 0, r = 0;
+		for (let [i, a] of t[e]) n += z[i] * a, r += a;
+		return r ? n / r : z[e];
+	};
+	for (let e of R) for (let t of e) V[t] = z[t];
+	U(), R = R.map((e, t) => W(e, t)), B();
+	let oe = R.map((e) => [...e]), K = ae(R);
+	for (let e = 0; e < 24 && K > 0; e++) {
+		U();
+		let t = e % 2 == 0;
+		for (let e = 1; e <= y; e++) {
+			let n = t ? e : y - e, r = t ? k : A;
+			for (let e of R[n]) V[e] = G(e, r);
+			R[n] = W(R[n], n), R[n].forEach((e, t) => z[e] = t);
+		}
+		let n = ae(R);
+		n < K && (K = n, oe = R.map((e) => [...e]));
+	}
+	R = oe, B();
+	let q = R.map((e) => e.reduce((e, t) => Math.max(e, C[t]), 0)), se = Array.from({ length: a }, () => []);
+	n.forEach((e, t) => e.parent >= 0 && se[e.parent].push(t));
+	let ce = (e) => n[e].pad[2] + Math.max(0, ...se[e].filter((t) => M[t] === M[e]).map(ce)), le = (e) => n[e].pad[3] + Math.max(0, ...se[e].filter((t) => N[t] === N[e]).map(le)), J = Array(y + 1).fill(0), ue = Array(y + 1).fill(0);
+	for (let e = 0; e < a; e++) M[e] > N[e] || (J[M[e]] = Math.max(J[M[e]], ce(e)), ue[N[e]] = Math.max(ue[N[e]], le(e)));
+	let Y = [];
+	for (let e = 0; e <= y; e++) Y[e] = e === 0 ? q[0] / 2 + J[0] : Y[e - 1] + q[e - 1] / 2 + ue[e - 1] + r.ranksep + J[e] + q[e] / 2;
+	let de = Y[y] + q[y] / 2 + ue[y], fe = (e) => w[e] === 2 || w[e] === 3 ? 0 : S[e] / 2, pe = (e, t) => {
+		let i = D[e], a = w[e], o = w[t];
+		return a === 2 && (i += n[O[e]].pad[0]), a === 3 && (i += r.nodesep / 2), o === 3 && (i += n[O[t]].pad[1]), o === 2 && (i += r.nodesep / 2), a < 2 && o < 2 && (i += a === 1 && o === 1 ? r.edgesep : a === 1 || o === 1 ? (r.nodesep + r.edgesep) / 2 : r.nodesep), fe(e) + fe(t) + i;
+	}, X = new Float64Array(L);
+	for (let e of R) for (let t = 1; t < e.length; t++) X[e[t]] = X[e[t - 1]] + pe(e[t - 1], e[t]);
+	let me = (e, t, n) => {
+		let r = e.length, i = [0];
+		for (let t = 1; t < r; t++) i[t] = i[t - 1] + pe(e[t - 1], e[t]);
+		let a = [];
+		for (let e = 0; e < r; e++) for (a.push({
+			s: e,
+			e,
+			w: n[e],
+			wt: n[e] * (t[e] - i[e])
+		}); a.length > 1;) {
+			let e = a[a.length - 2], t = a[a.length - 1];
+			if (e.wt / e.w < t.wt / t.w) break;
+			e.e = t.e, e.w += t.w, e.wt += t.wt, a.pop();
+		}
+		for (let t of a) for (let n = t.s; n <= t.e; n++) X[e[n]] = t.wt / t.w + i[n];
+	};
+	for (let e = 0; e < 10; e++) {
+		let t = e >= 8, n = e % 2 == 0;
+		for (let e = 0; e <= y; e++) {
+			let r = n ? e : y - e, i = R[r];
+			if (!i.length) continue;
+			let a = [], o = [];
+			for (let e of i) {
+				let r = 0, i = 0, s = (e) => {
+					for (let [t, n] of e) r += X[t] * n, i += n;
+				};
+				(t || n) && s(k[e]), (t || !n) && s(A[e]), s(I[e]), a.push(i ? r / i : X[e]), o.push(i || .01);
+			}
+			me(i, a, o);
+		}
+	}
+	let he = L, Z = (e) => w[e] === 2 ? he + 2 * O[e] : w[e] === 3 ? he + 2 * O[e] + 1 : e;
+	if (a) {
+		let e = L + 2 * a, t = new Float64Array(e);
+		for (let e = 0; e < L; e++) t[e] = X[e];
+		for (let e = 0; e < a; e++) t[he + 2 * e] = Infinity, t[he + 2 * e + 1] = -Infinity;
+		for (let e = 0; e < L; e++) w[e] === 2 && (t[Z(e)] = Math.min(t[Z(e)], X[e])), w[e] === 3 && (t[Z(e)] = Math.max(t[Z(e)], X[e]));
+		let r = Array.from({ length: e }, () => []), i = new Int32Array(e), o = (e, t, n) => {
+			r[e].push([t, n]), i[t]++;
+		};
+		for (let e of R) for (let t = 1; t < e.length; t++) o(Z(e[t - 1]), Z(e[t]), pe(e[t - 1], e[t]));
+		for (let e = 0; e < a; e++) M[e] <= N[e] && o(he + 2 * e, he + 2 * e + 1, Math.max(n[e].minW, n[e].pad[0] + n[e].pad[1]));
+		let s = [];
+		for (let t = 0; t < e; t++) i[t] || s.push(t);
+		let c = 0, l = new Float64Array(t);
+		for (; s.length;) {
+			let e = s.pop();
+			c++;
+			for (let [t, n] of r[e]) Number.isFinite(l[e]) && (l[t] = Math.max(l[t], l[e] + n)), --i[t] || s.push(t);
+		}
+		if (c === e) for (let e = 0; e < L; e++) X[e] = l[Z(e)];
+	}
+	let Q = Infinity, ge = -Infinity;
+	for (let e = 0; e < L; e++) Q = Math.min(Q, X[e] - fe(e)), ge = Math.max(ge, X[e] + fe(e) + D[e]);
+	Number.isFinite(Q) || (Q = ge = 0);
+	for (let e = 0; e < L; e++) X[e] -= Q;
+	let $ = (e) => ({
+		x: X[e],
+		y: Y[E[e]]
+	}), _e = /* @__PURE__ */ new Map();
+	{
+		let t = /* @__PURE__ */ new Map(), n = (e, n, r) => {
+			let i = t.get(e);
+			i || t.set(e, i = []), i.push({
+				i: n,
+				nx: r
+			});
+		};
+		f.forEach((t, r) => {
+			let i = re[r];
+			i && !ie[r] && (e[i[0]]?.spread && n(`${i[0]}:b`, r, X[i[1]]), e[i[i.length - 1]]?.spread && n(`${i[i.length - 1]}:t`, r, X[i[i.length - 2]]));
+		});
+		for (let [e, n] of t) {
+			if (n.length < 2) continue;
+			let t = Number(e.split(":")[0]);
+			n.sort((e, t) => e.nx - t.nx || e.i - t.i);
+			let r = Math.min(36, S[t] * .7 / (n.length - 1));
+			n.forEach((i, a) => _e.set(`${e}:${i.i}`, X[t] + (a - (n.length - 1) / 2) * r));
+		}
+	}
+	let ve = f.map((e, n) => {
+		if (e.v === e.w) return null;
+		if (ie[n]) {
+			let r = $(e.v), i = $(e.w), a = Math.sign(i.x - r.x) || 1, o = {
+				x: r.x + a * S[e.v] / 2,
+				y: r.y
+			}, s = {
+				x: i.x - a * S[e.w] / 2,
+				y: i.y
+			}, [l, u] = c[n] ? [s, o] : [o, s];
+			return {
+				start: l,
+				segs: [{
+					c: "L",
+					p: [u]
+				}],
+				label: t[n].label ? {
+					x: (l.x + u.x) / 2,
+					y: l.y - 10
+				} : void 0
+			};
+		}
+		let r = re[n];
+		if (!r) return null;
+		let i = [], a = [], o = $(r[0]);
+		i.push({
+			x: _e.get(`${r[0]}:b:${n}`) ?? o.x,
+			y: o.y + C[r[0]] / 2
+		});
+		for (let e = 1; e + 1 < r.length; e++) {
+			let t = $(r[e]), n = q[E[r[e]]] / 2;
+			n > .5 ? (i.push({
+				x: t.x,
+				y: t.y - n
+			}, {
+				x: t.x,
+				y: t.y + n
+			}), a.push(!1, !0)) : (i.push(t), a.push(!1));
+		}
+		let s = $(r[r.length - 1]);
+		i.push({
+			x: _e.get(`${r[r.length - 1]}:t:${n}`) ?? s.x,
+			y: s.y - C[r[r.length - 1]] / 2
+		}), a.push(!1), c[n] && (i.reverse(), a.reverse());
+		let l = [];
+		for (let e = 1; e < i.length; e++) {
+			let t = i[e - 1], n = i[e];
+			if (a[e - 1] || Math.abs(t.x - n.x) < .5) l.push({
+				c: "L",
+				p: [n]
+			});
+			else {
+				let e = (t.y + n.y) / 2;
+				l.push({
+					c: "C",
+					p: [
+						{
+							x: t.x,
+							y: e
+						},
+						{
+							x: n.x,
+							y: e
+						},
+						n
+					]
+				});
+			}
+		}
+		return {
+			start: i[0],
+			segs: l,
+			label: j[n] >= 0 ? $(j[n]) : void 0
+		};
+	}), ye = n.map((e, t) => {
+		if (M[t] > N[t]) return null;
+		let n = Infinity, r = -Infinity;
+		for (let e = M[t]; e <= N[t]; e++) n = Math.min(n, X[P[t][e]]), r = Math.max(r, X[F[t][e]]);
+		let i = Y[M[t]] - q[M[t]] / 2 - ce(t), a = Y[N[t]] + q[N[t]] / 2 + le(t);
+		return {
+			x: n,
+			y: i,
+			w: r - n,
+			h: a - i
+		};
+	});
+	return {
+		nodes: Array.from({ length: i }, (e, t) => $(t)),
+		edges: ve,
+		clusters: ye,
+		w: ge - Q,
+		h: de
+	};
+}
+// src/core/diagram/svg.ts
+var t = [
+	278,
+	278,
+	355,
+	556,
+	556,
+	889,
+	667,
+	191,
+	333,
+	333,
+	389,
+	584,
+	278,
+	333,
+	278,
+	278,
+	556,
+	556,
+	556,
+	556,
+	556,
+	556,
+	556,
+	556,
+	556,
+	556,
+	278,
+	278,
+	584,
+	584,
+	584,
+	556,
+	1015,
+	667,
+	667,
+	722,
+	722,
+	667,
+	611,
+	778,
+	722,
+	278,
+	500,
+	667,
+	556,
+	833,
+	722,
+	778,
+	667,
+	778,
+	722,
+	667,
+	611,
+	722,
+	667,
+	944,
+	667,
+	667,
+	611,
+	278,
+	278,
+	278,
+	469,
+	556,
+	333,
+	556,
+	556,
+	500,
+	556,
+	556,
+	278,
+	556,
+	556,
+	222,
+	222,
+	500,
+	222,
+	833,
+	556,
+	556,
+	556,
+	556,
+	333,
+	500,
+	278,
+	556,
+	500,
+	722,
+	500,
+	500,
+	500,
+	334,
+	260,
+	334,
+	584
+];
+function n(e) {
+	return e >= 32 && e <= 126 ? t[e - 32] : e >= 768 && e <= 879 || e >= 8203 && e <= 8207 || e === 65039 ? 0 : e >= 4352 && e <= 4447 || e >= 11904 && e <= 42191 || e >= 44032 && e <= 55203 || e >= 63744 && e <= 64255 || e >= 65072 && e <= 65103 || e >= 65280 && e <= 65376 || e >= 126976 ? 1e3 : 580;
+}
+function r(e, t = 14, r = !1, i = !1) {
+	let a = 0;
+	if (i) for (let t of e) a += n(t.codePointAt(0)) ? 600 : 0;
+	else for (let t of e) a += n(t.codePointAt(0));
+	return a * t * (r ? 1.08 : 1) / 1e3;
+}
+var i = (e) => Math.round(e * 1.3);
+function a(e, t = 14, n = !1) {
+	let a = 0;
+	for (let i of e) a = Math.max(a, r(i, t, n));
+	return {
+		w: a,
+		h: e.length * i(t)
+	};
+}
+function o(e, t, n = 14, i = !1) {
+	let a = [];
+	for (let o of e) {
+		if (r(o, n, i) <= t) {
+			a.push(o);
+			continue;
+		}
+		let e = "";
+		for (let s of o.split(/ +/)) {
+			let o = e ? e + " " + s : s;
+			e && r(o, n, i) > t ? (a.push(e), e = s) : e = o;
+		}
+		a.push(e);
+	}
+	return a;
+}
+var s = (e) => e.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;").replace(/"/g, "&quot;"), c = /^[a-z]{3,24}$/;
+function l(e) {
+	if (!e) return;
+	let t = e.trim().toLowerCase();
+	if (/^#(?:[0-9a-f]{3,4}|[0-9a-f]{6}|[0-9a-f]{8})$/.test(t)) return t;
+	if (/^[0-9a-f]{6}$/.test(t)) return "#" + t;
+	if (/^rgba?\(\s*[\d.]+%?\s*,\s*[\d.]+%?\s*,\s*[\d.]+%?\s*(,\s*[\d.]+%?\s*)?\)$/.test(t) || /^rgba?\(\s*[\d.]+%?\s+[\d.]+%?\s+[\d.]+%?\s*(\/\s*[\d.]+%?\s*)?\)$/.test(t)) return t;
+	if (c.test(t)) return t === "transparent" ? "none" : t;
+}
+var u = {
+	ink: "#1f2937",
+	line: "#4b5563",
+	fill: "#eef2fb",
+	stroke: "#5b6f9a",
+	muted: "#6b7280",
+	cluster: "#f7f8fb",
+	clusterStroke: "#a3adc2",
+	note: "#fff6c8",
+	noteStroke: "#c9a227",
+	label: "#ffffff",
+	dark: "#2d3748",
+	series: [
+		"#5b8def",
+		"#f2994a",
+		"#3fb68b",
+		"#e5596b",
+		"#9b6be0",
+		"#d4b33a",
+		"#3bb3c9",
+		"#e07bb8",
+		"#8c9aaf",
+		"#7cbd4a"
+	]
+}, d = (e) => Number.isFinite(e) ? Math.round(e * 100) / 100 : 0;
+function f(e) {
+	let t = ` fill="${e.fill ?? "none"}"`;
+	return e.stroke && (t += ` stroke="${e.stroke}" stroke-width="${d(e.sw ?? 1)}"`), e.stroke && e.dash && (t += ` stroke-dasharray="${e.dash}"`), e.opacity !== void 0 && (t += ` opacity="${d(e.opacity)}"`), t;
+}
+var p = class {
+	out = [];
+	rect(e, t, n, r, i, a = 0) {
+		return this.out.push(`<rect x="${d(e)}" y="${d(t)}" width="${d(n)}" height="${d(r)}"${a ? ` rx="${d(a)}"` : ""}${f(i)}/>`), this;
+	}
+	circle(e, t, n, r) {
+		return this.out.push(`<circle cx="${d(e)}" cy="${d(t)}" r="${d(n)}"${f(r)}/>`), this;
+	}
+	ellipse(e, t, n, r, i) {
+		return this.out.push(`<ellipse cx="${d(e)}" cy="${d(t)}" rx="${d(n)}" ry="${d(r)}"${f(i)}/>`), this;
+	}
+	line(e, t, n, r, i) {
+		return this.out.push(`<line x1="${d(e)}" y1="${d(t)}" x2="${d(n)}" y2="${d(r)}"${f(i)}/>`), this;
+	}
+	poly(e, t, n = !0) {
+		let r = e.map(([e, t]) => `${d(e)},${d(t)}`).join(" ");
+		return this.out.push(`<${n ? "polygon" : "polyline"} points="${r}"${f(t)}/>`), this;
+	}
+	path(e, t) {
+		return this.out.push(`<path d="${e}"${f(t)}/>`), this;
+	}
+	text(e, t, n, r = {}) {
+		let a = typeof n == "string" ? [n] : n, o = r.size ?? 14, c = i(o), l = t - a.length * c / 2, f = ` font-family="${s(r.mono ? "Menlo, Consolas, \"Courier New\", monospace" : "Helvetica, Arial, sans-serif")}" font-size="${o}" fill="${r.color ?? u.ink}"`;
+		return r.anchor && r.anchor !== "start" && (f += ` text-anchor="${r.anchor}"`), r.bold && (f += " font-weight=\"bold\""), r.italic && (f += " font-style=\"italic\""), r.underline && (f += " text-decoration=\"underline\""), a.forEach((t, n) => {
+			t && this.out.push(`<text x="${d(e)}" y="${d(l + n * c + c / 2 + o * .35)}"${f}>${s(t)}</text>`);
+		}), this;
+	}
+	raw(e) {
+		return this.out.push(e), this;
+	}
+	body() {
+		return this.out.join("");
+	}
+	toString(e, t, n = "#ffffff") {
+		let r = Math.ceil(e), i = Math.ceil(t);
+		return `<svg xmlns="http://www.w3.org/2000/svg" width="${r}" height="${i}" viewBox="0 0 ${r} ${i}">` + (n ? `<rect x="0" y="0" width="${r}" height="${i}" fill="${n}"/>` : "") + this.out.join("") + "</svg>";
+	}
+};
+function m(e) {
+	return e.map((e) => e.c + e.p.map((e) => `${d(e.x)} ${d(e.y)}`).join(" ")).join(" ");
+}
+function h(e) {
+	return e.replace(/<br\s*\/?>/gi, "\n").replace(/\\n/g, "\n").replace(/<\/?[a-z][^>]*>/gi, "").replace(/#(\d+);/g, (e, t) => String.fromCodePoint(Math.min(Number(t), 1114111))).replace(/#([a-z]+);/gi, (e, t) => ({
+		quot: "\"",
+		amp: "&",
+		lt: "<",
+		gt: ">",
+		nbsp: " ",
+		apos: "'"
+	})[t.toLowerCase()] ?? e).replace(/&(quot|amp|lt|gt|nbsp|apos|#\d+);/g, (e, t) => t[0] === "#" ? String.fromCodePoint(Math.min(Number(t.slice(1)), 1114111)) : {
+		quot: "\"",
+		amp: "&",
+		lt: "<",
+		gt: ">",
+		nbsp: " ",
+		apos: "'"
+	}[t] ?? e);
+}
+var g = class extends Error {}, _ = class {
+	defShape;
+	g;
+	byId = /* @__PURE__ */ new Map();
+	clusterIds = /* @__PURE__ */ new Map();
+	constructor(e = "TB", t = "rect") {
+		this.defShape = t, this.g = {
+			dir: e,
+			nodes: [],
+			edges: [],
+			clusters: []
+		};
+	}
+	has(e) {
+		return this.byId.has(e);
+	}
+	get(e) {
+		return this.byId.get(e);
+	}
+	node(e, t = {}, n) {
+		let r = this.byId.get(e);
+		r || (r = {
+			id: e,
+			label: e,
+			shape: this.defShape,
+			cluster: n
+		}, this.byId.set(e, r), this.g.nodes.push(r));
+		for (let [e, n] of Object.entries(t)) n !== void 0 && (r[e] = n);
+		return r;
+	}
+	edge(e, t) {
+		return this.clusterIds.has(e.from) || this.node(e.from, {}, t), this.clusterIds.has(e.to) || this.node(e.to, {}, t), this.g.edges.push(e), e;
+	}
+	cluster(e, t, n) {
+		let r = this.clusterIds.get(e);
+		r ? t && (r.label = t) : (r = {
+			id: e,
+			label: t,
+			parent: n
+		}, this.clusterIds.set(e, r), this.g.clusters.push(r));
+		let i = this.byId.get(e);
+		return i && (this.byId.delete(e), this.g.nodes.splice(this.g.nodes.indexOf(i), 1)), r;
+	}
+	isCluster(e) {
+		return this.clusterIds.has(e);
+	}
+}, v = 14, y = 13, b = 14, x = 9, S = i(v), C = (e) => e.split("\n"), w = (e) => Math.round(e * 100) / 100;
+function T(e) {
+	let t = [];
+	for (let n of e.rows) n.forEach((n, i) => t[i] = Math.max(t[i] ?? 0, r(n, y, e.bold)));
+	return {
+		w: t.reduce((e, t) => e + t, 0) + Math.max(0, t.length - 1) * 12,
+		h: e.rows.length ? e.rows.length * i(y) + 10 : 8,
+		cols: t
+	};
+}
+function E(e, t) {
+	let n = e.shape === "none" || e.label === "" ? C(e.label) : o(C(e.label), 260, v, e.style?.bold), r = e.label === "" ? {
+		w: 0,
+		h: 0
+	} : a(n, v, e.style?.bold), i = t === "TB" || t === "BT";
+	if (e.sections?.length) {
+		let t = e.sections.map(T);
+		return {
+			w: Math.max(90, ...t.map((e) => e.w + 28)),
+			h: t.reduce((e, t) => e + t.h, 0),
+			text: n
+		};
+	}
+	let s = r.w + 28, c = r.h + 18;
+	switch (e.shape) {
+		case "start": return {
+			w: 20,
+			h: 20,
+			text: []
+		};
+		case "end": return {
+			w: 22,
+			h: 22,
+			text: []
+		};
+		case "point": return {
+			w: 8,
+			h: 8,
+			text: []
+		};
+		case "bar": return i ? {
+			w: 80,
+			h: 7,
+			text: []
+		} : {
+			w: 7,
+			h: 80,
+			text: []
+		};
+		case "none": return {
+			w: r.w + 8,
+			h: r.h + 6,
+			text: n
+		};
+		case "circle": {
+			let e = Math.max(r.w, r.h) + 18 + 4;
+			return {
+				w: e,
+				h: e,
+				text: n
+			};
+		}
+		case "doublecircle": {
+			let e = Math.max(r.w, r.h) + 18 + 14;
+			return {
+				w: e,
+				h: e,
+				text: n
+			};
+		}
+		case "ellipse": return {
+			w: Math.max(50, (r.w + b) * 1.42),
+			h: Math.max(36, (r.h + x) * 1.42),
+			text: n
+		};
+		case "diamond": {
+			let e = s + c / .6;
+			return {
+				w: e,
+				h: .6 * e,
+				text: n
+			};
+		}
+		case "stadium": return {
+			w: r.w + c + b,
+			h: c,
+			text: n
+		};
+		case "hexagon":
+		case "octagon": return {
+			w: s + c / 2,
+			h: c,
+			text: n
+		};
+		case "lean-r":
+		case "lean-l": return {
+			w: s + c / 2,
+			h: c,
+			text: n
+		};
+		case "trap-b":
+		case "trap-t": return {
+			w: s + c * .7,
+			h: c,
+			text: n
+		};
+		case "flag": return {
+			w: s + c / 3,
+			h: c,
+			text: n
+		};
+		case "cylinder": return {
+			w: Math.max(s, 50),
+			h: c + 16,
+			text: n
+		};
+		case "subroutine":
+		case "component": return {
+			w: s + 16,
+			h: c,
+			text: n
+		};
+		case "note":
+		case "folder": return {
+			w: s + 8,
+			h: c + (e.shape === "folder" ? 8 : 0),
+			text: n
+		};
+		case "box3d": return {
+			w: s + 8,
+			h: c + 8,
+			text: n
+		};
+		case "triangle": return {
+			w: s * 1.6,
+			h: c * 1.7,
+			text: n
+		};
+		case "actor": return {
+			w: Math.max(36, r.w + 8),
+			h: 46 + r.h,
+			text: n
+		};
+		default: return {
+			w: Math.max(s, 40),
+			h: c,
+			text: n
+		};
+	}
+}
+function D(e) {
+	let t = e.style ?? {};
+	return {
+		fill: t.fill ?? u.fill,
+		stroke: t.stroke ?? u.stroke,
+		sw: t.sw ?? 1.3,
+		dash: t.dash
+	};
+}
+function O(e, t, n, r, i) {
+	let { w: a, h: o } = n, s = r - a / 2, c = i - o / 2, l = D(t), d = t.style?.color ?? u.ink, f = (a = r, o = i) => e.text(a, o, n.text, {
+		anchor: "middle",
+		color: d,
+		bold: t.style?.bold,
+		italic: t.style?.italic
+	}), p = (t) => e.poly(t, l);
+	switch (t.shape) {
+		case "start":
+			e.circle(r, i, a / 2, { fill: t.style?.fill ?? u.dark });
+			return;
+		case "end":
+			e.circle(r, i, a / 2, {
+				fill: "#ffffff",
+				stroke: t.style?.stroke ?? u.dark,
+				sw: 1.5
+			}).circle(r, i, a / 2 - 4, { fill: t.style?.fill ?? u.dark });
+			return;
+		case "point":
+			e.circle(r, i, a / 2, { fill: t.style?.fill ?? u.dark });
+			return;
+		case "bar":
+			e.rect(s, c, a, o, { fill: t.style?.fill ?? u.dark }, 2);
+			return;
+		case "none":
+			f();
+			return;
+		case "round":
+			e.rect(s, c, a, o, l, 6);
+			break;
+		case "stadium":
+			e.rect(s, c, a, o, l, o / 2);
+			break;
+		case "subroutine":
+			e.rect(s, c, a, o, l).line(s + 8, c, s + 8, c + o, l).line(s + a - 8, c, s + a - 8, c + o, l);
+			break;
+		case "component":
+			e.rect(s + 6, c, a - 6, o, l), e.rect(s, c + o / 2 - 11, 12, 7, l).rect(s, c + o / 2 + 4, 12, 7, l), f(r + 4);
+			return;
+		case "cylinder":
+			e.path(`M${w(s)} ${w(c + 7)} A${w(a / 2)} 7 0 0 1 ${w(s + a)} ${w(c + 7)} L${w(s + a)} ${w(c + o - 7)} A${w(a / 2)} 7 0 0 1 ${w(s)} ${w(c + o - 7)} Z`, l), e.path(`M${w(s)} ${w(c + 7)} A${w(a / 2)} 7 0 0 0 ${w(s + a)} ${w(c + 7)}`, {
+				...l,
+				fill: "none"
+			}), f(r, i + 7 / 2);
+			return;
+		case "circle":
+			e.circle(r, i, a / 2, l);
+			break;
+		case "doublecircle":
+			e.circle(r, i, a / 2, l).circle(r, i, a / 2 - 5, {
+				...l,
+				fill: "none"
+			});
+			break;
+		case "ellipse":
+			e.ellipse(r, i, a / 2, o / 2, l);
+			break;
+		case "diamond":
+			p([
+				[r, c],
+				[s + a, i],
+				[r, c + o],
+				[s, i]
+			]);
+			break;
+		case "hexagon": {
+			let e = o / 4;
+			p([
+				[s + e, c],
+				[s + a - e, c],
+				[s + a, i],
+				[s + a - e, c + o],
+				[s + e, c + o],
+				[s, i]
+			]);
+			break;
+		}
+		case "octagon": {
+			let e = o / 4;
+			p([
+				[s + e, c],
+				[s + a - e, c],
+				[s + a, c + e],
+				[s + a, c + o - e],
+				[s + a - e, c + o],
+				[s + e, c + o],
+				[s, c + o - e],
+				[s, c + e]
+			]);
+			break;
+		}
+		case "lean-r":
+		case "lean-l": {
+			let e = o / 2, n = t.shape === "lean-r";
+			p([
+				[n ? s + e : s, c],
+				[n ? s + a : s + a - e, c],
+				[n ? s + a - e : s + a, c + o],
+				[n ? s : s + e, c + o]
+			]);
+			break;
+		}
+		case "trap-b":
+		case "trap-t": {
+			let e = o * .35, n = t.shape === "trap-b";
+			p([
+				[n ? s + e : s, c],
+				[n ? s + a - e : s + a, c],
+				[n ? s + a : s + a - e, c + o],
+				[n ? s : s + e, c + o]
+			]);
+			break;
+		}
+		case "flag": {
+			let e = o / 3;
+			p([
+				[s, c],
+				[s + a, c],
+				[s + a, c + o],
+				[s, c + o],
+				[s + e, i]
+			]), f(r + e / 2);
+			return;
+		}
+		case "note":
+			p([
+				[s, c],
+				[s + a - 10, c],
+				[s + a, c + 10],
+				[s + a, c + o],
+				[s, c + o]
+			]), e.poly([
+				[s + a - 10, c],
+				[s + a - 10, c + 10],
+				[s + a, c + 10]
+			], {
+				...l,
+				fill: "none"
+			}, !1);
+			break;
+		case "folder":
+			e.rect(s, c, Math.min(a * .4, 40), 10, l, 2).rect(s, c + 8, a, o - 8, l), f(r, i + 4);
+			return;
+		case "box3d":
+			p([
+				[s, c + 8],
+				[s + 8, c],
+				[s + a, c],
+				[s + a, c + o - 8],
+				[s + a - 8, c + o],
+				[s, c + o]
+			]), e.poly([
+				[s, c + 8],
+				[s + a - 8, c + 8],
+				[s + a, c]
+			], {
+				...l,
+				fill: "none"
+			}, !1).line(s + a - 8, c + 8, s + a - 8, c + o, l), f(r - 4, i + 4);
+			return;
+		case "cloud":
+			e.rect(s, c, a, o, l, Math.min(o / 2, 20));
+			break;
+		case "triangle":
+			p([
+				[r, c],
+				[s + a, c + o],
+				[s, c + o]
+			]), f(r, i + o / 6);
+			return;
+		case "actor": {
+			let i = {
+				fill: "none",
+				stroke: t.style?.stroke ?? u.dark,
+				sw: 1.5
+			}, a = c + 2;
+			e.circle(r, a + 7, 7, {
+				...i,
+				fill: t.style?.fill ?? u.fill
+			}), e.line(r, a + 14, r, a + 28, i).line(r - 11, a + 19, r + 11, a + 19, i), e.line(r, a + 28, r - 9, a + 40, i).line(r, a + 28, r + 9, a + 40, i), e.text(r, a + 44 + n.text.length * S / 2, n.text, {
+				anchor: "middle",
+				color: d
+			});
+			return;
+		}
+		default:
+			if (t.sections?.length) return ee(e, t, s, c, a);
+			e.rect(s, c, a, o, l);
+	}
+	f();
+}
+function ee(e, t, n, r, a) {
+	let o = D(t), s = t.sections.map(T), c = s.reduce((e, t) => e + t.h, 0);
+	e.rect(n, r, a, c, o, t.shape === "round" ? 6 : 0);
+	let l = r;
+	t.sections.forEach((r, c) => {
+		c && e.line(n, l, n + a, l, {
+			stroke: o.stroke,
+			sw: 1
+		});
+		let u = i(y);
+		r.rows.forEach((i, o) => {
+			let d = l + 5 + o * u + u / 2;
+			if (r.center || i.length === 1 && c === 0) {
+				e.text(n + a / 2, d, i.join(" "), {
+					anchor: "middle",
+					size: y,
+					bold: r.bold,
+					italic: r.italic,
+					color: t.style?.color
+				});
+				return;
+			}
+			let f = n + b;
+			i.forEach((n, i) => {
+				e.text(f, d, n, {
+					size: y,
+					bold: r.bold,
+					italic: r.italic,
+					color: t.style?.color
+				}), f += s[c].cols[i] + 12;
+			});
+		}), l += s[c].h;
+	});
+}
+var k = {
+	arrow: 10,
+	triangle: 13,
+	diamond: 15,
+	odiamond: 15,
+	circle: 8,
+	ocircle: 8
+};
+function A(e, t) {
+	let n = t.x - e.x, r = t.y - e.y, i = Math.hypot(n, r) || 1;
+	return {
+		x: n / i,
+		y: r / i
+	};
+}
+function te(e, t, n, r, i) {
+	let a = -r.y, o = r.x, s = (e, t) => [n.x - r.x * e + a * t, n.y - r.y * e + o * t], c = (t, n) => e.line(t[0], t[1], n[0], n[1], {
+		stroke: i,
+		sw: 1.3
+	});
+	switch (t) {
+		case "arrow":
+			e.poly([
+				s(0, 0),
+				s(10, 4.5),
+				s(10, -4.5)
+			], {
+				fill: i,
+				stroke: i,
+				sw: 1
+			});
+			break;
+		case "open":
+			e.poly([
+				s(10, 5),
+				s(0, 0),
+				s(10, -5)
+			], {
+				stroke: i,
+				sw: 1.4
+			}, !1);
+			break;
+		case "triangle":
+			e.poly([
+				s(0, 0),
+				s(13, 7),
+				s(13, -7)
+			], {
+				fill: "#ffffff",
+				stroke: i,
+				sw: 1.2
+			});
+			break;
+		case "diamond":
+		case "odiamond":
+			e.poly([
+				s(0, 0),
+				s(7.5, 5),
+				s(15, 0),
+				s(7.5, -5)
+			], {
+				fill: t === "diamond" ? i : "#ffffff",
+				stroke: i,
+				sw: 1.2
+			});
+			break;
+		case "circle":
+		case "ocircle": {
+			let [n, r] = s(4, 0);
+			e.circle(n, r, 4, {
+				fill: t === "circle" ? i : "#ffffff",
+				stroke: i,
+				sw: 1.2
+			});
+			break;
+		}
+		case "cross":
+			c(s(1, 5), s(11, -5)), c(s(1, -5), s(11, 5));
+			break;
+		case "one":
+		case "zero-one":
+		case "one-many":
+		case "zero-many":
+		case "many": {
+			let n = t.endsWith("many");
+			if (n && (c(s(0, 7), s(12, 0)), c(s(0, -7), s(12, 0))), (t === "one" || t === "one-many") && c(s(n ? 16 : 7, 6), s(n ? 16 : 7, -6)), t === "one" && c(s(12, 6), s(12, -6)), t === "zero-one" || t === "zero-many") {
+				let [t, r] = s(n ? 20 : 17, 0);
+				e.circle(t, r, 4.5, {
+					fill: "#ffffff",
+					stroke: i,
+					sw: 1.2
+				});
+			}
+			t === "zero-one" && c(s(7, 6), s(7, -6));
+			break;
+		}
+	}
+}
+function ne(e, t, n) {
+	let r = t[t.length - 1], i = r.p[r.p.length - 1], a = A(r.c === "C" ? r.p[1] : t.length > 1 ? t[t.length - 2].p[t[t.length - 2].p.length - 1] : e, i);
+	if (n) {
+		let e = {
+			x: i.x - a.x * n,
+			y: i.y - a.y * n
+		};
+		r.p[r.p.length - 1] = e, r.c === "C" && (r.p[1] = {
+			x: r.p[1].x - a.x * Math.min(n, 6),
+			y: r.p[1].y - a.y * Math.min(n, 6)
+		});
+	}
+	return a;
+}
+function re(e) {
+	return e.color ?? u.line;
+}
+var j = 16, ie = 3e3, M = 6e3;
+function N(t) {
+	if (!t.nodes.length) throw new g("The diagram has no nodes");
+	if (t.nodes.length > ie || t.edges.length > M) throw new g(`The diagram is too large to draw (${t.nodes.length} nodes, ${t.edges.length} edges)`);
+	let n = t.dir, o = n === "TB" || n === "BT", s = new p(), c = new Map(t.clusters.map((e, t) => [e.id, t])), l = new Map(t.nodes.map((e, t) => [e.id, t])), d = (e) => t.clusters[e].parent === void 0 ? -1 : c.get(t.clusters[e].parent) ?? -1, f = (e, n) => {
+		for (let r = t.nodes[e].cluster === void 0 ? -1 : c.get(t.nodes[e].cluster) ?? -1; r >= 0; r = d(r)) if (r === n) return !0;
+		return !1;
+	}, h = (e, n) => {
+		let r = l.get(e);
+		if (r !== void 0) return r;
+		let i = c.get(e);
+		if (i === void 0) return -1;
+		if (!n) return t.nodes.findIndex((e, t) => f(t, i));
+		for (let e = t.nodes.length - 1; e >= 0; e--) if (f(e, i)) return e;
+		return -1;
+	}, _ = t.nodes.map((e) => E(e, n)), v = t.edges.map((e) => ({
+		e,
+		v: h(e.from, !0),
+		w: h(e.to, !1),
+		cv: l.has(e.from) ? -1 : c.get(e.from) ?? -1,
+		cw: l.has(e.to) ? -1 : c.get(e.to) ?? -1
+	})).filter((e) => e.v >= 0 && e.w >= 0), b = v.some((e) => e.e.label), x = (e) => e ? a(C(e), y) : void 0, S = /* @__PURE__ */ new Map();
+	for (let { e, v: t, w: n } of v) {
+		if (t !== n) continue;
+		let r = x(e.label);
+		S.set(t, Math.max(S.get(t) ?? 0, 40 + (r ? (o ? r.w : r.h) + 6 : 0)));
+	}
+	let w = t.nodes.map((e, t) => {
+		let n = _[t], r = e.cluster === void 0 ? -1 : c.get(e.cluster) ?? -1, i = !!e.sections?.length || F.has(e.shape);
+		return o ? {
+			w: n.w,
+			h: n.h,
+			cluster: r,
+			loop: S.get(t),
+			spread: i
+		} : {
+			w: n.h,
+			h: n.w,
+			cluster: r,
+			loop: S.get(t),
+			spread: i
+		};
+	}), T = v.map(({ e, v: t, w: n }) => {
+		let r = x(e.label), i = r ? {
+			w: r.w + 8,
+			h: r.h + 4
+		} : void 0;
+		return {
+			v: t,
+			w: n,
+			minlen: (e.minlen ?? 1) * (b ? 2 : 1),
+			weight: 1,
+			label: i ? o ? i : {
+				w: i.h,
+				h: i.w
+			} : void 0
+		};
+	}), D = t.clusters.map((e, t) => {
+		let r = e.label ? a(C(e.label), y, !0) : {
+			w: 0,
+			h: 0
+		}, i = 12 + (e.label ? r.h + 6 : 0), s = n === "TB" ? [
+			12,
+			12,
+			i,
+			12
+		] : n === "BT" ? [
+			12,
+			12,
+			12,
+			i
+		] : [
+			i,
+			12,
+			12,
+			12
+		];
+		return {
+			parent: d(t),
+			pad: s,
+			minW: o ? r.w + 24 : r.h + i + 12
+		};
+	}), ee = t.sameRank?.map((e) => e.map((e) => l.get(e)).filter((e) => e !== void 0)).filter((e) => e.length > 1), N = e(w, T, D, {
+		nodesep: o ? 40 : 28,
+		ranksep: (o ? 50 : 60) / (b ? 2 : 1),
+		edgesep: 14,
+		sameRank: ee
+	}), R = t.title ? 32 : 0, z = N.w, B = N.h, V = (e) => {
+		let t = n === "TB" ? e : n === "BT" ? {
+			x: e.x,
+			y: B - e.y
+		} : n === "LR" ? {
+			x: e.y,
+			y: e.x
+		} : {
+			x: B - e.y,
+			y: e.x
+		};
+		return {
+			x: t.x + j,
+			y: t.y + j + R
+		};
+	}, H = (o ? z : B) + 32, U = (o ? B : z) + 32 + R, W = (e) => {
+		let t = 0;
+		for (let n = d(e); n >= 0; n = d(n)) t++;
+		return t;
+	}, ae = t.clusters.map((e, t) => t).sort((e, t) => W(e) - W(t)), G = t.clusters.map(() => null), oe = [];
+	for (let e of ae) {
+		let r = N.clusters[e];
+		if (!r) continue;
+		let a = t.clusters[e], o = V({
+			x: r.x,
+			y: r.y
+		}), c = V({
+			x: r.x + r.w,
+			y: r.y + r.h
+		}), l = Math.min(o.x, c.x), d = Math.min(o.y, c.y), f = Math.abs(c.x - o.x), p = Math.abs(c.y - o.y), m = a.style ?? {};
+		if (G[e] = {
+			x: l,
+			y: d,
+			w: f,
+			h: p
+		}, s.rect(l, d, f, p, {
+			fill: m.fill ?? u.cluster,
+			stroke: m.stroke ?? u.clusterStroke,
+			sw: m.sw ?? 1,
+			dash: m.dash
+		}, 4), a.label) {
+			let e = C(a.label), t = n === "BT" ? d + p - 8 - e.length * i(y) / 2 : d + 8 + e.length * i(y) / 2;
+			oe.push({
+				x: l + f / 2,
+				y: t,
+				text: e,
+				color: m.color ?? u.ink,
+				bg: m.fill && m.fill !== "none" ? m.fill : u.cluster
+			});
+		}
+	}
+	let K = [];
+	v.forEach(({ e, v: t }, n) => {
+		if (e.line === "hidden") return;
+		let r = re(e), i = {
+			stroke: r,
+			sw: e.sw ?? (e.line === "thick" ? 3 : 1.4),
+			dash: e.line === "dashed" ? "6 4" : e.line === "dotted" ? "2 3" : void 0
+		}, c = N.edges[n];
+		if (!c) {
+			if (v[n].v !== v[n].w) return;
+			let c = V(N.nodes[t]), l = _[t], u, d, f, p, h;
+			o ? (u = {
+				x: c.x + l.w / 2,
+				y: c.y - l.h / 4
+			}, p = {
+				x: c.x + l.w / 2,
+				y: c.y + l.h / 4
+			}, d = {
+				x: u.x + 34,
+				y: u.y - 12
+			}, f = {
+				x: p.x + 34,
+				y: p.y + 12
+			}, h = {
+				x: c.x + l.w / 2 + 34,
+				y: c.y
+			}) : (u = {
+				x: c.x - l.w / 4,
+				y: c.y + l.h / 2
+			}, p = {
+				x: c.x + l.w / 4,
+				y: c.y + l.h / 2
+			}, d = {
+				x: u.x - 12,
+				y: u.y + 34
+			}, f = {
+				x: p.x + 12,
+				y: p.y + 34
+			}, h = {
+				x: c.x,
+				y: c.y + l.h / 2 + 34
+			});
+			let g = [{
+				c: "C",
+				p: [
+					d,
+					f,
+					p
+				]
+			}], b = e.head ?? "arrow", x = ne(u, g, k[b] ?? 0);
+			if (s.path(m([{
+				c: "M",
+				p: [u]
+			}, ...g.map((e) => ({
+				c: e.c,
+				p: e.p
+			}))]), i), te(s, b, p, x, r), e.label) {
+				let t = a(C(e.label), y);
+				K.push({
+					p: o ? {
+						x: h.x + t.w / 2 + 4,
+						y: h.y
+					} : {
+						x: h.x,
+						y: h.y + t.h / 2 + 4
+					},
+					text: C(e.label)
+				});
+			}
+			return;
+		}
+		let l = {
+			start: V(c.start),
+			segs: c.segs.map((e) => ({
+				c: e.c,
+				p: e.p.map(V)
+			})),
+			label: c.label && V(c.label)
+		}, { cv: u, cw: d } = v[n];
+		if (u >= 0 && !f(v[n].w, u) || d >= 0 && !f(v[n].v, d)) {
+			let e = I(l.start, l.segs);
+			u >= 0 && G[u] && (e = L(e, G[u], !0)), d >= 0 && G[d] && (e = L(e, G[d], !1)), e.length > 1 && (l = {
+				start: e[0],
+				segs: e.slice(1).map((e) => ({
+					c: "L",
+					p: [e]
+				})),
+				label: l.label
+			});
+		}
+		let p = e.head ?? "none", h = e.tail ?? "none", g = l.segs[l.segs.length - 1].p[l.segs[l.segs.length - 1].p.length - 1], b = ne(l.start, l.segs, k[p] ?? 0), x = l.segs[0], S = A((x.c, x.p[0]), l.start), w = l.start, T = k[h] ?? 0, E = T ? {
+			x: l.start.x - S.x * T,
+			y: l.start.y - S.y * T
+		} : l.start;
+		if (T && x.c === "C" && (x.p[0] = {
+			x: x.p[0].x - S.x * Math.min(T, 6),
+			y: x.p[0].y - S.y * Math.min(T, 6)
+		}), s.path(m([{
+			c: "M",
+			p: [E]
+		}, ...l.segs.map((e) => ({
+			c: e.c,
+			p: e.p
+		}))]), i), p !== "none" && te(s, p, g, b, r), h !== "none" && te(s, h, w, S, r), e.label) {
+			let t = l.label ?? P(l.start, g);
+			K.push({
+				p: t,
+				text: C(e.label)
+			});
+		}
+		let D = (e, t, n) => {
+			let r = a(C(n), y), i = -t.y, o = t.x, s = Math.abs(i) * (r.w / 2 + 5) + Math.abs(o) * (r.h / 2 + 3);
+			K.push({
+				p: {
+					x: e.x - t.x * (16 + r.h / 2) + i * s,
+					y: e.y - t.y * (14 + r.h / 2) + o * s
+				},
+				text: C(n),
+				plain: !0
+			});
+		};
+		e.headLabel && D(g, b, e.headLabel), e.tailLabel && D(w, S, e.tailLabel);
+	});
+	for (let e of oe) {
+		let t = a(e.text, y, !0);
+		s.rect(e.x - t.w / 2 - 4, e.y - t.h / 2 - 1, t.w + 8, t.h + 2, { fill: e.bg }, 2), s.text(e.x, e.y, e.text, {
+			anchor: "middle",
+			size: y,
+			bold: !0,
+			color: e.color
+		});
+	}
+	t.nodes.forEach((e, t) => {
+		if (e.style?.hidden) return;
+		let n = V(N.nodes[t]);
+		O(s, e, _[t], n.x, n.y);
+	});
+	for (let e of K) {
+		let t = a(e.text, y);
+		e.plain || s.rect(e.p.x - t.w / 2 - 3, e.p.y - t.h / 2 - 1, t.w + 6, t.h + 2, {
+			fill: u.label,
+			opacity: .92
+		}, 2), s.text(e.p.x, e.p.y, e.text, {
+			anchor: "middle",
+			size: y,
+			color: e.color ?? u.ink
+		});
+	}
+	return t.title && (H = Math.max(H, r(t.title, 16, !0) + 32), s.text(H / 2, 27, t.title, {
+		anchor: "middle",
+		size: 16,
+		bold: !0
+	})), {
+		svg: s.toString(H, U),
+		w: Math.ceil(H),
+		h: Math.ceil(U)
+	};
+}
+var P = (e, t) => ({
+	x: (e.x + t.x) / 2,
+	y: (e.y + t.y) / 2
+}), F = /* @__PURE__ */ new Set([
+	"rect",
+	"round",
+	"subroutine",
+	"component",
+	"note",
+	"folder",
+	"box3d",
+	"cylinder",
+	"stadium",
+	"cloud"
+]);
+function I(e, t) {
+	let n = [e], r = e;
+	for (let e of t) {
+		if (e.c === "L") n.push(e.p[0]);
+		else {
+			let [t, i, a] = e.p;
+			for (let e = 1; e <= 12; e++) {
+				let o = e / 12, s = 1 - o;
+				n.push({
+					x: s * s * s * r.x + 3 * s * s * o * t.x + 3 * s * o * o * i.x + o * o * o * a.x,
+					y: s * s * s * r.y + 3 * s * s * o * t.y + 3 * s * o * o * i.y + o * o * o * a.y
+				});
+			}
+		}
+		r = n[n.length - 1];
+	}
+	return n;
+}
+function L(e, t, n) {
+	let r = (e) => e.x > t.x && e.x < t.x + t.w && e.y > t.y && e.y < t.y + t.h, i = n ? e : [...e].reverse(), a = i.findIndex((e) => !r(e));
+	if (a <= 0) return e;
+	let o = i[a - 1], s = i[a], c = 1, l = s.x - o.x, u = s.y - o.y;
+	l > 0 && (c = Math.min(c, (t.x + t.w - o.x) / l)), l < 0 && (c = Math.min(c, (t.x - o.x) / l)), u > 0 && (c = Math.min(c, (t.y + t.h - o.y) / u)), u < 0 && (c = Math.min(c, (t.y - o.y) / u));
+	let d = [{
+		x: o.x + l * c,
+		y: o.y + u * c
+	}, ...i.slice(a)];
+	return n ? d : d.reverse();
+}
+// src/core/diagram/dot.ts
+function R(e) {
+	let t = [], n = e.length, r = 0, i = !0;
+	for (; r < n;) {
+		let a = e[r];
+		if (a === "\n") {
+			i = !0, r++;
+			continue;
+		}
+		if (a === " " || a === "	" || a === "\r" || a === "") {
+			r++;
+			continue;
+		}
+		if (i && a === "#" || (i = !1, a === "/" && e[r + 1] === "/")) {
+			for (; r < n && e[r] !== "\n";) r++;
+			continue;
+		}
+		if (a === "/" && e[r + 1] === "*") {
+			let t = e.indexOf("*/", r + 2);
+			r = t < 0 ? n : t + 2;
+			continue;
+		}
+		if (a === "\"") {
+			let i = "";
+			for (r++; r < n && e[r] !== "\"";) e[r] === "\\" && e[r + 1] === "\"" ? (i += "\"", r += 2) : e[r] === "\\" && e[r + 1] === "\n" ? r += 2 : i += e[r++];
+			r++;
+			let a = t[t.length - 1], o = t[t.length - 2];
+			a?.t === "p" && a.v === "+" && o?.t === "str" ? (t.pop(), o.v += i) : t.push({
+				t: "str",
+				v: i
+			});
+			continue;
+		}
+		if (a === "<") {
+			let i = 0, a = r;
+			for (; r < n; r++) if (e[r] === "<") i++;
+			else if (e[r] === ">" && --i === 0) break;
+			t.push({
+				t: "html",
+				v: e.slice(a + 1, r)
+			}), r++;
+			continue;
+		}
+		if (a === "-" && (e[r + 1] === ">" || e[r + 1] === "-")) {
+			t.push({
+				t: "p",
+				v: e.slice(r, r + 2)
+			}), r += 2;
+			continue;
+		}
+		if ("{}[]=;,:+".includes(a)) {
+			t.push({
+				t: "p",
+				v: a
+			}), r++;
+			continue;
+		}
+		let o = /^(-?(?:\.\d+|\d+(?:\.\d*)?)|[A-Za-z_\u0080-￿][\w\u0080-￿]*)/.exec(e.slice(r, r + 256));
+		o ? (t.push({
+			t: "id",
+			v: o[0]
+		}), r += o[0].length) : r++;
+	}
+	return t;
+}
+var z = {
+	box: "rect",
+	rect: "rect",
+	rectangle: "rect",
+	square: "rect",
+	msquare: "rect",
+	ellipse: "ellipse",
+	oval: "ellipse",
+	egg: "ellipse",
+	circle: "circle",
+	doublecircle: "doublecircle",
+	point: "point",
+	plaintext: "none",
+	plain: "none",
+	none: "none",
+	underline: "none",
+	diamond: "diamond",
+	mdiamond: "diamond",
+	hexagon: "hexagon",
+	octagon: "octagon",
+	doubleoctagon: "octagon",
+	tripleoctagon: "octagon",
+	triangle: "triangle",
+	invtriangle: "triangle",
+	parallelogram: "lean-r",
+	trapezium: "trap-b",
+	invtrapezium: "trap-t",
+	house: "trap-b",
+	invhouse: "trap-t",
+	cylinder: "cylinder",
+	note: "note",
+	tab: "folder",
+	folder: "folder",
+	box3d: "box3d",
+	component: "component",
+	cds: "flag",
+	larrow: "flag",
+	rarrow: "flag",
+	lpromoter: "flag",
+	rpromoter: "flag",
+	star: "circle",
+	record: "rect",
+	mrecord: "round",
+	underlinebox: "rect"
+}, B = {
+	normal: "arrow",
+	inv: "arrow",
+	empty: "triangle",
+	onormal: "triangle",
+	invempty: "triangle",
+	oinv: "triangle",
+	vee: "open",
+	open: "open",
+	halfopen: "open",
+	diamond: "diamond",
+	odiamond: "odiamond",
+	ediamond: "odiamond",
+	box: "diamond",
+	obox: "odiamond",
+	dot: "circle",
+	odot: "ocircle",
+	invdot: "circle",
+	invodot: "ocircle",
+	none: "none",
+	crow: "many",
+	tee: "one",
+	curve: "open",
+	icurve: "open"
+};
+function V(e, t) {
+	if (!e) return t;
+	let n = e.toLowerCase().replace(/^[lr](?=[a-z])/, "");
+	return B[n] ?? B[n.replace(/^o/, "")] ?? t;
+}
+function H(e) {
+	if (!e) return;
+	let t = e.split(/[:;]/)[0].trim(), n = /^([\d.]+)[ ,]+([\d.]+)[ ,]+([\d.]+)$/.exec(t);
+	if (n) {
+		let [e, t, r] = [
+			Number(n[1]),
+			Number(n[2]),
+			Number(n[3])
+		], i = (n) => {
+			let i = (n + e * 6) % 6;
+			return Math.round((r - r * t * Math.max(0, Math.min(i, 4 - i, 1))) * 255);
+		};
+		return "#" + [
+			i(5),
+			i(3),
+			i(1)
+		].map((e) => e.toString(16).padStart(2, "0")).join("");
+	}
+	let r = t.replace(/^\/\w+\//, "").toLowerCase(), i = /^gr[ae]y(\d{1,3})$/.exec(r);
+	if (i) {
+		let e = Math.round(Math.min(100, Number(i[1])) * 255 / 100).toString(16).padStart(2, "0");
+		return `#${e}${e}${e}`;
+	}
+	return l(/^[a-z]+\d+$/.test(r) ? r.replace(/\d+$/, "") : r);
+}
+function U(e) {
+	return h(e.replace(/<br\s*\/?>/gi, "\n").replace(/<\/tr>/gi, "\n").replace(/<\/td>\s*<td/gi, "  <td").replace(/<[^>]+>/g, "").replace(/\n\s*\n/g, "\n")).split("\n").map((e) => e.trim()).filter(Boolean).join("\n");
+}
+function W(e, t, n = "") {
+	return e.replace(/\\[nlr]/g, "\n").replace(/\\N/g, t).replace(/\\G/g, n).replace(/\\(.)/g, "$1").replace(/\n$/, "");
+}
+function ae(e, t) {
+	return W(e, t).replace(/<[^>]*>/g, "").split(/[|{}]/).map((e) => e.trim()).filter(Boolean);
+}
+function G(e) {
+	let t = R(e), n = 0, r = (e = 0) => t[n + e], i = (e, t = 0) => r(t)?.t === "p" && r(t).v === e, a = (e) => i(e) ? (n++, !0) : !1, o = (e) => r()?.t === "id" && r().v.toLowerCase() === e, s = [];
+	for (; n < t.length;) {
+		if (o("strict") && n++, !o("graph") && !o("digraph")) {
+			n++;
+			continue;
+		}
+		let e = r().v.toLowerCase() === "digraph";
+		n++;
+		let c = r()?.t === "p" ? "" : t[n++].v;
+		if (!a("{")) throw new g("Graphviz: “{” expected after the graph name");
+		let l = new _("TB", "ellipse"), u = /* @__PURE__ */ new Map(), d = [], f = [], p = 0, m = {}, h = /* @__PURE__ */ new Map(), v = () => {
+			let e = {};
+			for (; a("[");) {
+				for (; n < t.length && !i("]");) {
+					let r = t[n++];
+					if (r.t !== "p") {
+						if (a("=")) {
+							let i = t[n++];
+							i && (e[r.v.toLowerCase()] = i.t === "html" ? "<" + i.v + ">" : i.v);
+						} else e[r.v.toLowerCase()] = "true";
+					}
+				}
+				a("]");
+			}
+			return e;
+		}, y = (e) => {
+			let r = t[n++].v;
+			for (; i(":");) n += 2;
+			return u.has(r) ? e.cluster && l.get(r) && l.get(r).cluster === void 0 && (l.get(r).cluster = e.cluster) : (u.set(r, { ...e.node }), l.node(r, {}, e.cluster)), e.members.add(r), r;
+		}, b = (e) => {
+			for (; n < t.length && !i("}");) {
+				if (a(";") || a(",")) continue;
+				let s = r();
+				if (s.t === "id" && [
+					"graph",
+					"node",
+					"edge"
+				].includes(s.v.toLowerCase()) && i("[", 1)) {
+					n++;
+					let t = v(), r = s.v.toLowerCase();
+					r === "node" ? Object.assign(e.node, t) : r === "edge" ? Object.assign(e.edge, t) : x(e, t);
+					continue;
+				}
+				if (s.t !== "p" && i("=", 1)) {
+					let r = s.v.toLowerCase();
+					n += 2;
+					let i = t[n++];
+					x(e, { [r]: i ? i.t === "html" ? "<" + i.v + ">" : i.v : "" });
+					continue;
+				}
+				let c = [];
+				for (;;) {
+					if (o("subgraph") || i("{")) c.push([...S(e)]);
+					else if (r() && r().t !== "p") c.push([y(e)]);
+					else {
+						n++;
+						break;
+					}
+					if (i("->") || i("--")) n++;
+					else break;
+				}
+				let l = v();
+				if (c.length === 1) {
+					for (let e of c[0]) Object.keys(l).length && u.has(e) && Object.assign(u.get(e), l);
+					continue;
+				}
+				let f = {
+					...e.edge,
+					...l
+				};
+				for (let e = 0; e + 1 < c.length; e++) for (let t of c[e]) for (let n of c[e + 1]) d.push({
+					e: {
+						from: t,
+						to: n
+					},
+					attrs: f
+				});
+			}
+		}, x = (e, t) => {
+			e.cluster ? Object.assign(h.get(e.cluster), t) : e.name || Object.assign(m, t), t.rank && e.name !== void 0 && (e.rank = t.rank);
+		}, S = (e) => {
+			let i;
+			o("subgraph") && (n++, r() && r().t !== "p" && (i = t[n++].v));
+			let s = !!i && /^cluster/i.test(i), c = {
+				node: { ...e.node },
+				edge: { ...e.edge },
+				cluster: e.cluster,
+				members: /* @__PURE__ */ new Set(),
+				name: i ?? `__anon${p++}`
+			};
+			if (s) {
+				let t = `${i}`;
+				l.cluster(t, "", e.cluster), h.set(t, {}), c.cluster = t;
+			}
+			a("{") && (b(c), a("}")), c.rank && /^(same|min|max|source|sink)$/.test(c.rank) && c.members.size > 1 && f.push([...c.members]);
+			for (let t of c.members) e.members.add(t);
+			return c.members;
+		};
+		b({
+			node: {},
+			edge: {},
+			members: /* @__PURE__ */ new Set()
+		}), a("}");
+		let C = {
+			LR: "LR",
+			RL: "RL",
+			BT: "BT",
+			TB: "TB"
+		}[(m.rankdir ?? "TB").toUpperCase()] ?? "TB";
+		l.g.dir = C, m.label && (l.g.title = m.label.startsWith("<") ? U(m.label.slice(1, -1)) : W(m.label, "", c));
+		for (let e of l.g.nodes) oe(e, u.get(e.id) ?? {});
+		for (let e of l.g.clusters) {
+			let t = h.get(e.id) ?? {};
+			e.label = t.label ? t.label.startsWith("<") ? U(t.label.slice(1, -1)) : W(t.label, "", e.id) : "";
+			let n = {}, r = (t.style ?? "").toLowerCase();
+			r.includes("filled") ? n.fill = H(t.fillcolor ?? t.color ?? t.bgcolor) ?? "#d3d3d3" : t.bgcolor && (n.fill = H(t.bgcolor)), (t.color || t.pencolor) && (n.stroke = H(t.pencolor ?? t.color)), r.includes("dashed") && (n.dash = "6 4"), r.includes("dotted") && (n.dash = "2 3"), t.fontcolor && (n.color = H(t.fontcolor)), r.includes("invis") && (n.stroke = n.fill = "none"), e.style = n;
+		}
+		for (let { e: t, attrs: n } of d) l.g.edges.push(K(t, n, e));
+		l.g.sameRank = f, s.push(l.g);
+	}
+	if (!s.length) throw new g("No “graph” or “digraph” found");
+	return s;
+}
+function oe(e, t) {
+	let n = (t.shape ?? "ellipse").toLowerCase();
+	e.shape = z[n] ?? "ellipse";
+	let r = t.label;
+	if (r !== void 0) {
+		if (r.startsWith("<") && r.endsWith(">")) e.label = U(r.slice(1, -1));
+		else if (n === "record" || n === "mrecord") {
+			let t = ae(r, e.id);
+			e.label = t.join("\n"), t.length > 1 && (e.sections = t.map((e) => ({
+				rows: [[e]],
+				center: !0
+			})));
+		} else e.label = W(r, e.id);
+	}
+	e.shape === "point" && (e.label = "");
+	let i = {}, a = (t.style ?? "").toLowerCase();
+	a.includes("filled") || t.fillcolor ? i.fill = H(t.fillcolor ?? t.color) ?? "#d3d3d3" : e.shape !== "point" && (i.fill = "#ffffff"), i.stroke = t.color ? H(t.color) : "#000000", t.fontcolor && (i.color = H(t.fontcolor)), a.includes("dashed") && (i.dash = "6 4"), a.includes("dotted") && (i.dash = "2 3"), a.includes("bold") && (i.sw = 2.4), t.penwidth && (i.sw = Math.min(8, Number(t.penwidth) || 1)), a.includes("invis") && (i.hidden = !0), a.includes("rounded") && e.shape === "rect" && (e.shape = "round"), e.shape === "none" && (i.fill = void 0), e.style = i;
+}
+function K(e, t, n) {
+	let r = (t.style ?? "").toLowerCase(), i = (t.dir ?? (n ? "forward" : "none")).toLowerCase(), a = V(t.arrowhead, "arrow"), o = V(t.arrowtail, "arrow");
+	e.head = i === "forward" || i === "both" ? a : "none", e.tail = i === "back" || i === "both" ? o : "none";
+	let s = t.label ?? t.xlabel;
+	return s && (e.label = s.startsWith("<") && s.endsWith(">") ? U(s.slice(1, -1)) : W(s, "")), t.headlabel && (e.headLabel = W(t.headlabel, "")), t.taillabel && (e.tailLabel = W(t.taillabel, "")), e.line = r.includes("invis") ? "hidden" : r.includes("dashed") ? "dashed" : r.includes("dotted") ? "dotted" : r.includes("bold") ? "thick" : "solid", e.color = H(t.color) ?? "#000000", t.penwidth && (e.sw = Math.min(8, Number(t.penwidth) || 1)), t.minlen && (e.minlen = Math.max(1, Math.min(6, Math.round(Number(t.minlen)) || 1))), e;
+}
+function q(e) {
+	return G(e).map(N);
+}
+// packages/diagram/src/dom.ts
+async function se(e, t = 2) {
+	let n = (t) => Number(RegExp(`<svg[^>]*\\s${t}="([\\d.]+)"`).exec(e)?.[1] ?? 0), r = n("width"), i = n("height");
+	if (!r || !i) throw Error("Not a picture with a size");
+	let a = new Image();
+	a.src = `data:image/svg+xml;charset=utf-8,${encodeURIComponent(e)}`, await a.decode();
+	let o = document.createElement("canvas");
+	o.width = Math.max(1, Math.round(r * t)), o.height = Math.max(1, Math.round(i * t));
+	let s = o.getContext("2d");
+	if (!s) throw Error("No 2D canvas");
+	return s.scale(t, t), s.drawImage(a, 0, 0, r, i), new Promise((e, t) => o.toBlob((n) => n ? e(n) : t(/* @__PURE__ */ Error("PNG export failed")), "image/png"));
+}
+function ce(e, t) {
+	e.innerHTML = t.join("");
+}
+// packages/graphviz/src/index.ts
+var le = class extends Error {
+	constructor(e) {
+		super(e), this.name = "DiagramError";
+	}
+};
+function J(e) {
+	try {
+		return q(e).map((e) => ({
+			svg: e.svg,
+			width: e.w,
+			height: e.h
+		}));
+	} catch (e) {
+		throw new le(e.message);
+	}
+}
+function ue(e) {
+	return J(e)[0];
+}
+function Y(e, t) {
+	let n = J(t);
+	return ce(e, n.map((e) => e.svg)), n;
+}
+function de(e, t = 2) {
+	return se(e, t);
+}
+export { le as DiagramError, ue as render, J as renderEach, Y as renderTo, de as toPng };
+
+//# sourceMappingURL=index.js.map