@p10node/plantuml 0.0.0-stage → 0.11.1

package/dist/index.js

@@ -0,0 +1,3361 @@
+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), k = (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), A = [], j = [], ee = (e, t, n) => {
+		for (; A.length < S.length;) A.push([]), j.push([]);
+		j[e].push([t, n]), A[t].push([e, n]);
+	}, te = 6e4;
+	for (let e of f) te -= Math.max(0, Math.abs(g[e.w] - g[e.v]) - 1);
+	if (te < 0) throw Error("The diagram is too large to draw");
+	let M = [], N = [];
+	f.forEach((e, n) => {
+		if (e.v === e.w) {
+			M.push(null), N.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 ? k(a.w, a.h, 1, s, t) : k(0, 0, 1, s, t);
+			t === o && (c = e), r.push(e);
+		}
+		r.push(e.w), M.push(i > 0 ? r : null), N.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);
+			ee(n, i, e.weight * (a === 2 ? 8 : a === 1 ? 2 : 1));
+		}
+	});
+	let ne = f.map((e, t) => e.v !== e.w && g[e.v] === g[e.w] && !M[t]), P = Array(a).fill(Infinity), F = Array(a).fill(-Infinity);
+	for (let e = 0; e < S.length; e++) for (let t of b(T[e])) P[t] = Math.min(P[t], E[e]), F[t] = Math.max(F[t], E[e]);
+	let I = Array.from({ length: a }, () => []), re = Array.from({ length: a }, () => []), ie = [];
+	for (let e = 0; e < a; e++) if (!(P[e] > F[e])) for (let t = P[e]; t <= F[e]; t++) I[e][t] = k(0, 0, 2, e, t), re[e][t] = k(0, 0, 3, e, t);
+	for (; A.length < S.length;) A.push([]), j.push([]);
+	for (let e = 0; e < S.length; e++) ie.push([]);
+	for (let e = 0; e < a; e++) for (let t = P[e]; t < F[e]; t++) ie[I[e][t]].push([I[e][t + 1], 1]), ie[I[e][t + 1]].push([I[e][t], 1]), ie[re[e][t]].push([re[e][t + 1], 1]), ie[re[e][t + 1]].push([re[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 = j[n].length - 1; r >= 0; r--) e[j[n][r][0]] || t.push(j[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), ae = () => {
+		for (let e = 0; e < a; e++) {
+			if (P[e] > F[e]) continue;
+			let t = 0;
+			for (let n = P[e]; n <= F[e]; n++) t += z[I[e][n]] / Math.max(1, R[n].length);
+			H[e] = t / (F[e] - P[e] + 1);
+		}
+	}, U = (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[I[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[I[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(I[n.cluster][t]), l(n), c.push(re[n.cluster][t]));
+		};
+		return l(r), c;
+	}, oe = (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 j[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;
+	}, se = (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];
+	ae(), R = R.map((e, t) => U(e, t)), B();
+	let ce = R.map((e) => [...e]), le = oe(R);
+	for (let e = 0; e < 24 && le > 0; e++) {
+		ae();
+		let t = e % 2 == 0;
+		for (let e = 1; e <= y; e++) {
+			let n = t ? e : y - e, r = t ? A : j;
+			for (let e of R[n]) V[e] = se(e, r);
+			R[n] = U(R[n], n), R[n].forEach((e, t) => z[e] = t);
+		}
+		let n = oe(R);
+		n < le && (le = n, ce = R.map((e) => [...e]));
+	}
+	R = ce, B();
+	let W = R.map((e) => e.reduce((e, t) => Math.max(e, C[t]), 0)), G = Array.from({ length: a }, () => []);
+	n.forEach((e, t) => e.parent >= 0 && G[e.parent].push(t));
+	let ue = (e) => n[e].pad[2] + Math.max(0, ...G[e].filter((t) => P[t] === P[e]).map(ue)), de = (e) => n[e].pad[3] + Math.max(0, ...G[e].filter((t) => F[t] === F[e]).map(de)), K = Array(y + 1).fill(0), q = Array(y + 1).fill(0);
+	for (let e = 0; e < a; e++) P[e] > F[e] || (K[P[e]] = Math.max(K[P[e]], ue(e)), q[F[e]] = Math.max(q[F[e]], de(e)));
+	let J = [];
+	for (let e = 0; e <= y; e++) J[e] = e === 0 ? W[0] / 2 + K[0] : J[e - 1] + W[e - 1] / 2 + q[e - 1] + r.ranksep + K[e] + W[e] / 2;
+	let fe = J[y] + W[y] / 2 + q[y], pe = (e) => w[e] === 2 || w[e] === 3 ? 0 : S[e] / 2, me = (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), pe(e) + pe(t) + i;
+	}, Y = new Float64Array(L);
+	for (let e of R) for (let t = 1; t < e.length; t++) Y[e[t]] = Y[e[t - 1]] + me(e[t - 1], e[t]);
+	let he = (e, t, n) => {
+		let r = e.length, i = [0];
+		for (let t = 1; t < r; t++) i[t] = i[t - 1] + me(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++) Y[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 += Y[t] * n, i += n;
+				};
+				(t || n) && s(A[e]), (t || !n) && s(j[e]), s(ie[e]), a.push(i ? r / i : Y[e]), o.push(i || .01);
+			}
+			he(i, a, o);
+		}
+	}
+	let X = L, ge = (e) => w[e] === 2 ? X + 2 * O[e] : w[e] === 3 ? X + 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] = Y[e];
+		for (let e = 0; e < a; e++) t[X + 2 * e] = Infinity, t[X + 2 * e + 1] = -Infinity;
+		for (let e = 0; e < L; e++) w[e] === 2 && (t[ge(e)] = Math.min(t[ge(e)], Y[e])), w[e] === 3 && (t[ge(e)] = Math.max(t[ge(e)], Y[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(ge(e[t - 1]), ge(e[t]), me(e[t - 1], e[t]));
+		for (let e = 0; e < a; e++) P[e] <= F[e] && o(X + 2 * e, X + 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++) Y[e] = l[ge(e)];
+	}
+	let _e = Infinity, Z = -Infinity;
+	for (let e = 0; e < L; e++) _e = Math.min(_e, Y[e] - pe(e)), Z = Math.max(Z, Y[e] + pe(e) + D[e]);
+	Number.isFinite(_e) || (_e = Z = 0);
+	for (let e = 0; e < L; e++) Y[e] -= _e;
+	let ve = (e) => ({
+		x: Y[e],
+		y: J[E[e]]
+	}), Q = /* @__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 = M[r];
+			i && !ne[r] && (e[i[0]]?.spread && n(`${i[0]}:b`, r, Y[i[1]]), e[i[i.length - 1]]?.spread && n(`${i[i.length - 1]}:t`, r, Y[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) => Q.set(`${e}:${i.i}`, Y[t] + (a - (n.length - 1) / 2) * r));
+		}
+	}
+	let ye = f.map((e, n) => {
+		if (e.v === e.w) return null;
+		if (ne[n]) {
+			let r = ve(e.v), i = ve(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 = M[n];
+		if (!r) return null;
+		let i = [], a = [], o = ve(r[0]);
+		i.push({
+			x: Q.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 = ve(r[e]), n = W[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 = ve(r[r.length - 1]);
+		i.push({
+			x: Q.get(`${r[r.length - 1]}:t:${n}`) ?? s.x,
+			y: s.y - C[r[r.length - 1]] / 2
+		}), a.push(!1);
+		let l = i.length, u = Array(l).fill(0), d = (e) => (i[e + 1].x - i[e].x) / Math.max(.5, i[e + 1].y - i[e].y);
+		for (let e = 1; e + 1 < l; e++) {
+			if (a[e - 1] || a[e]) continue;
+			let t = d(e - 1), n = d(e);
+			if (t * n <= 0) continue;
+			let r = i[e].y - i[e - 1].y, o = i[e + 1].y - i[e].y;
+			u[e] = 3 * (r + o) / ((2 * o + r) / t + (o + 2 * r) / n);
+		}
+		let f = [];
+		for (let e = 1; e < l; e++) {
+			let t = i[e - 1], n = i[e], r = (n.y - t.y) / 3;
+			a[e - 1] || Math.abs(t.x - n.x) < .5 && !u[e - 1] && !u[e] ? f.push({
+				c: "L",
+				p: [n]
+			}) : f.push({
+				c: "C",
+				p: [
+					{
+						x: t.x + u[e - 1] * r,
+						y: t.y + r
+					},
+					{
+						x: n.x - u[e] * r,
+						y: n.y - r
+					},
+					n
+				]
+			});
+		}
+		let p = N[n] >= 0 ? ve(N[n]) : void 0;
+		if (!c[n]) return {
+			start: i[0],
+			segs: f,
+			label: p
+		};
+		let m = [];
+		for (let e = l - 1; e >= 1; e--) {
+			let t = f[e - 1];
+			m.push(t.c === "C" ? {
+				c: "C",
+				p: [
+					t.p[1],
+					t.p[0],
+					i[e - 1]
+				]
+			} : {
+				c: "L",
+				p: [i[e - 1]]
+			});
+		}
+		return {
+			start: i[l - 1],
+			segs: m,
+			label: p
+		};
+	}), be = n.map((e, t) => {
+		if (P[t] > F[t]) return null;
+		let n = Infinity, r = -Infinity;
+		for (let e = P[t]; e <= F[t]; e++) n = Math.min(n, Y[I[t][e]]), r = Math.max(r, Y[re[t][e]]);
+		let i = J[P[t]] - W[P[t]] / 2 - ue(t), a = J[F[t]] + W[F[t]] / 2 + de(t);
+		return {
+			x: n,
+			y: i,
+			w: r - n,
+			h: a - i
+		};
+	});
+	return {
+		nodes: Array.from({ length: i }, (e, t) => ve(t)),
+		edges: ye,
+		clusters: be,
+		w: Z - _e,
+		h: fe
+	};
+}
+// 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 k(e, t, s, c, a);
+			e.rect(s, c, a, o, l);
+	}
+	f();
+}
+function k(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 A = {
+	arrow: 10,
+	triangle: 13,
+	diamond: 15,
+	odiamond: 15,
+	circle: 8,
+	ocircle: 8
+};
+function j(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 ee(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 te(e, t, n) {
+	let r = t[t.length - 1], i = r.p[r.p.length - 1], a = j(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
+		};
+		if (r.p[r.p.length - 1] = e, r.c === "C") {
+			let e = {
+				x: r.p[1].x - a.x * Math.min(n, 6),
+				y: r.p[1].y - a.y * Math.min(n, 6)
+			}, t = Math.min(0, (e.x - r.p[0].x) * a.x + (e.y - r.p[0].y) * a.y);
+			r.p[1] = {
+				x: e.x - a.x * t,
+				y: e.y - a.y * t
+			};
+		}
+	}
+	return a;
+}
+function M(e) {
+	return e.color ?? u.line;
+}
+var N = 16, ne = 3e3, P = 6e3;
+function F(t) {
+	if (!t.nodes.length) throw new g("The diagram has no nodes");
+	if (t.nodes.length > ne || t.edges.length > P) 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 || re.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
+		};
+	}), k = t.sameRank?.map((e) => e.map((e) => l.get(e)).filter((e) => e !== void 0)).filter((e) => e.length > 1), F = e(w, T, D, {
+		nodesep: o ? 40 : 28,
+		ranksep: (o ? 50 : 60) / (b ? 2 : 1),
+		edgesep: 14,
+		sameRank: k
+	}), R = t.title ? 32 : 0, z = F.w, B = F.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 + N,
+			y: t.y + N + R
+		};
+	}, H = (o ? z : B) + 32, ae = (o ? B : z) + 32 + R, U = (e) => {
+		let t = 0;
+		for (let n = d(e); n >= 0; n = d(n)) t++;
+		return t;
+	}, oe = t.clusters.map((e, t) => t).sort((e, t) => U(e) - U(t)), se = t.clusters.map(() => null), ce = [];
+	for (let e of oe) {
+		let r = F.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 (se[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;
+			ce.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 le = [];
+	v.forEach(({ e, v: t }, n) => {
+		if (e.line === "hidden") return;
+		let r = M(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 = F.edges[n];
+		if (!c) {
+			if (v[n].v !== v[n].w) return;
+			let c = V(F.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 = te(u, g, A[b] ?? 0);
+			if (s.path(m([{
+				c: "M",
+				p: [u]
+			}, ...g.map((e) => ({
+				c: e.c,
+				p: e.p
+			}))]), i), ee(s, b, p, x, r), e.label) {
+				let t = a(C(e.label), y);
+				le.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 = ie(l.start, l.segs);
+			u >= 0 && se[u] && (e = L(e, se[u], !0)), d >= 0 && se[d] && (e = L(e, se[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 = te(l.start, l.segs, A[p] ?? 0), x = l.segs[0], S = j((x.c, x.p[0]), l.start), w = l.start, T = A[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") {
+			let e = {
+				x: x.p[0].x - S.x * Math.min(T, 6),
+				y: x.p[0].y - S.y * Math.min(T, 6)
+			}, t = Math.max(0, (x.p[1].x - e.x) * S.x + (x.p[1].y - e.y) * S.y);
+			x.p[0] = {
+				x: e.x + S.x * t,
+				y: e.y + S.y * t
+			};
+		}
+		if (s.path(m([{
+			c: "M",
+			p: [E]
+		}, ...l.segs.map((e) => ({
+			c: e.c,
+			p: e.p
+		}))]), i), p !== "none" && ee(s, p, g, b, r), h !== "none" && ee(s, h, w, S, r), e.label) {
+			let t = l.label ?? I(l.start, g);
+			le.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);
+			le.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 ce) {
+		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(F.nodes[t]);
+		O(s, e, _[t], n.x, n.y);
+	});
+	for (let e of le) {
+		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, ae),
+		w: Math.ceil(H),
+		h: Math.ceil(ae)
+	};
+}
+var I = (e, t) => ({
+	x: (e.x + t.x) / 2,
+	y: (e.y + t.y) / 2
+}), re = /* @__PURE__ */ new Set([
+	"rect",
+	"round",
+	"subroutine",
+	"component",
+	"note",
+	"folder",
+	"box3d",
+	"cylinder",
+	"stadium",
+	"cloud"
+]);
+function ie(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 ae(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 U(e, t, n = "") {
+	return e.replace(/\\[nlr]/g, "\n").replace(/\\N/g, t).replace(/\\G/g, n).replace(/\\(.)/g, "$1").replace(/\n$/, "");
+}
+function oe(e, t) {
+	return U(e, t).replace(/<[^>]*>/g, "").split(/[|{}]/).map((e) => e.trim()).filter(Boolean);
+}
+function se(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("<") ? ae(m.label.slice(1, -1)) : U(m.label, "", c));
+		for (let e of l.g.nodes) ce(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("<") ? ae(t.label.slice(1, -1)) : U(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(le(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 ce(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 = ae(r.slice(1, -1));
+		else if (n === "record" || n === "mrecord") {
+			let t = oe(r, e.id);
+			e.label = t.join("\n"), t.length > 1 && (e.sections = t.map((e) => ({
+				rows: [[e]],
+				center: !0
+			})));
+		} else e.label = U(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 le(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(">") ? ae(s.slice(1, -1)) : U(s, "")), t.headlabel && (e.headLabel = U(t.headlabel, "")), t.taillabel && (e.tailLabel = U(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;
+}
+// src/core/diagram/charts.ts
+var W = 16, G = (e) => Math.round(e * 100) / 100;
+function ue(e) {
+	let t = e.slices.filter((e) => e.value > 0 && Number.isFinite(e.value));
+	if (!t.length) throw Error("The pie chart has no values");
+	let n = t.reduce((e, t) => e + t.value, 0), i = new p(), a = W + (e.title ? 36 : 0) + 130, o = (e) => u.series[e % u.series.length], s = -Math.PI / 2, c = (e, t) => ({
+		x: 146 + Math.cos(e) * t,
+		y: a + Math.sin(e) * t
+	});
+	t.forEach((e, t) => {
+		let r = e.value / n, l = s + r * 2 * Math.PI;
+		if (r >= .9999) i.circle(146, a, 130, {
+			fill: o(t),
+			stroke: "#ffffff",
+			sw: 2
+		});
+		else {
+			let e = c(s, 130), n = c(l, 130);
+			i.path(`M${G(146)} ${G(a)} L${G(e.x)} ${G(e.y)} A130 130 0 ${+(r > .5)} 1 ${G(n.x)} ${G(n.y)} Z`, {
+				fill: o(t),
+				stroke: "#ffffff",
+				sw: 2
+			});
+		}
+		if (r >= .06) {
+			let e = c((s + l) / 2, 85.8);
+			i.text(e.x, e.y, `${Math.round(r * 1e3) / 10}%`, {
+				anchor: "middle",
+				size: 13,
+				bold: !0,
+				color: "#ffffff"
+			});
+		}
+		s = l;
+	});
+	let l = a - t.length * 24 / 2 + 12, d = 0;
+	t.forEach((t, n) => {
+		let a = e.showData ? `${t.label} [${de(t.value)}]` : t.label;
+		i.rect(306, l + n * 24 - 8, 16, 16, { fill: o(n) }, 3), i.text(330, l + n * 24, a), d = Math.max(d, r(a, 14));
+	});
+	let f = 330 + d + W, m = Math.max(a + 130, l + t.length * 24) + W;
+	return e.title && (f = Math.max(f, r(e.title, 16, !0) + 32), i.text(f / 2, 28, e.title, {
+		anchor: "middle",
+		size: 16,
+		bold: !0
+	})), {
+		svg: i.toString(f, m),
+		w: Math.ceil(f),
+		h: Math.ceil(m)
+	};
+}
+var de = (e) => String(Number.isInteger(e) ? e : Math.round(e * 100) / 100), K = 36e5, q = 24 * K, J = (e) => String(e).padStart(2, "0");
+function fe(e) {
+	let t = e.sections.flatMap((e) => e.tasks);
+	if (!t.length) throw Error("The Gantt chart has no tasks");
+	let n = Math.min(...t.map((e) => e.start)), i = Math.max(...t.map((e) => Math.max(e.end, e.start))), a = Math.max(i - n, K), s = Math.min(180, Math.max(0, ...e.sections.map((e) => r(e.name, 13, !0))) + 24), c = Math.max(560, Math.min(1100, t.length * 60)), l = c / a, d = e.title ? 36 : 0, f = W + s, m = W + d, h = (e) => f + (e - n) * l, g = new p(), _ = m + t.length * 28 + 24 + W + 6, v = [
+		K,
+		3 * K,
+		6 * K,
+		12 * K,
+		q,
+		2 * q,
+		7 * q,
+		14 * q,
+		30 * q,
+		91 * q,
+		365 * q
+	].find((e) => a / e <= 12) ?? 365 * q, y = Math.ceil(n / v) * v, b = (e) => {
+		let t = new Date(e);
+		return v < q ? `${J(t.getUTCHours())}:${J(t.getUTCMinutes())}` : v >= 365 * q ? String(t.getUTCFullYear()) : v >= 30 * q ? `${t.getUTCFullYear()}-${J(t.getUTCMonth() + 1)}` : `${t.getUTCFullYear()}-${J(t.getUTCMonth() + 1)}-${J(t.getUTCDate())}`;
+	}, x = m + t.length * 28 + 4;
+	for (let e = y; e <= i; e += v) {
+		let t = h(e);
+		g.line(t, m, t, x, {
+			stroke: "#e3e6ec",
+			sw: 1
+		}), g.text(t, x + 12, b(e), {
+			anchor: "middle",
+			size: 11,
+			color: u.muted
+		});
+	}
+	let S = 0;
+	e.sections.forEach((e, t) => {
+		let n = u.series[t % u.series.length], i = m + S * 28;
+		t % 2 == 0 && g.rect(W, i, s + c, e.tasks.length * 28, { fill: "#f6f7fa" }), e.name && g.text(22, i + e.tasks.length * 28 / 2, o([e.name], s - 12, 13, !0), {
+			size: 13,
+			bold: !0
+		});
+		for (let t of e.tasks) {
+			let e = m + S * 28 + 14;
+			if (t.milestone) {
+				let n = h(t.start);
+				g.poly([
+					[n, e - 8],
+					[n + 8, e],
+					[n, e + 8],
+					[n - 8, e]
+				], { fill: t.crit ? "#e5596b" : u.dark }), g.text(n + 14, e, t.name, { size: 12 });
+			} else {
+				let i = h(t.start), a = Math.max(3, h(t.end) - i), o = t.done ? "#c7ccd6" : n;
+				g.rect(i, e - 9, a, 18, {
+					fill: o,
+					stroke: t.crit ? "#c0392b" : t.active ? u.dark : void 0,
+					sw: t.crit || t.active ? 2 : 0
+				}, 3);
+				let s = r(t.name, 12);
+				s + 10 < a ? g.text(i + a / 2, e, t.name, {
+					anchor: "middle",
+					size: 12,
+					color: t.done ? u.ink : "#ffffff"
+				}) : i + a + 6 + s < f + c + 200 ? g.text(i + a + 6, e, t.name, { size: 12 }) : g.text(i - 6, e, t.name, {
+					anchor: "end",
+					size: 12
+				});
+			}
+			S++;
+		}
+	});
+	let C = f + c + W;
+	for (let e of t) C = Math.max(C, h(e.end) + 12 + r(e.name, 12) + W);
+	return e.title && (C = Math.max(C, r(e.title, 16, !0) + 32), g.text(C / 2, 28, e.title, {
+		anchor: "middle",
+		size: 16,
+		bold: !0
+	})), {
+		svg: g.toString(C, _),
+		w: Math.ceil(C),
+		h: Math.ceil(_)
+	};
+}
+var pe = 44, me = 12;
+function Y(e, t) {
+	let n = new p(), i = (e, t) => {
+		let n = t === 0 ? 16 : t === 1 ? 14 : 13, r = o(e.label.split("\n"), 220, n, t === 0), i = a(r, n, t === 0), s = e.shape === "circle", c = Math.max(i.w, i.h) + 20;
+		return {
+			text: r,
+			w: s ? c : i.w + (e.shape === "none" ? 8 : 24),
+			h: s ? c : i.h + (e.shape === "none" ? 6 : 14),
+			fs: n
+		};
+	}, s = (e, t, n) => {
+		let r = i(e, t), a = e.children.map((e, r) => s(e, t + 1, t === 0 ? u.series[r % u.series.length] : n)), o = Math.max(r.h, a.reduce((e, t) => e + t.span, 0) + Math.max(0, a.length - 1) * me);
+		return {
+			n: e,
+			w: r.w,
+			h: r.h,
+			text: r.text,
+			x: 0,
+			y: 0,
+			color: n,
+			depth: t,
+			kids: a,
+			span: o
+		};
+	}, c = s(e, 0, u.dark), l = [], d = [];
+	if (c.kids.some((e) => e.n.side)) l = c.kids.filter((e) => e.n.side !== "left"), d = c.kids.filter((e) => e.n.side === "left");
+	else if (c.kids.length > 3) {
+		let e = c.kids.reduce((e, t) => e + t.span, 0), t = 0;
+		for (let n of c.kids) t < e / 2 ? l.push(n) : d.push(n), t += n.span;
+	} else l = c.kids;
+	let f = (e, t, n, r) => {
+		e.x = t;
+		let i = n + (e.span - (e.kids.reduce((e, t) => e + t.span, 0) + Math.max(0, e.kids.length - 1) * me)) / 2;
+		for (let n of e.kids) f(n, t + r * (e.w / 2 + pe + n.w / 2), i, r), i += n.span + me;
+		e.y = e.kids.length ? (e.kids[0].y + e.kids[e.kids.length - 1].y) / 2 : n + e.span / 2;
+	}, h = (e) => e.reduce((e, t) => e + t.span, 0) + Math.max(0, e.length - 1) * me, g = h(l), _ = h(d), v = Math.max(c.h, g, _), y = (v - g) / 2;
+	for (let e of l) f(e, c.w / 2 + pe + e.w / 2, y, 1), y += e.span + me;
+	y = (v - _) / 2;
+	for (let e of d) f(e, -(c.w / 2 + pe + e.w / 2), y, -1), y += e.span + me;
+	c.x = 0, c.y = v / 2;
+	let b = Infinity, x = -Infinity, S = Infinity, C = -Infinity, w = [], T = (e) => {
+		w.push(e), b = Math.min(b, e.x - e.w / 2), x = Math.max(x, e.x + e.w / 2), S = Math.min(S, e.y - e.h / 2), C = Math.max(C, e.y + e.h / 2), e.kids.forEach(T);
+	};
+	T(c);
+	let E = t ? 36 : 0, D = W - b, O = W + E - S, k = (e) => ({
+		x: e.x + D,
+		y: e.y + O
+	});
+	for (let e of w) for (let t of e.kids) {
+		let r = k(e), i = k(t), a = Math.sign(i.x - r.x) || 1, o = {
+			x: r.x + a * e.w / 2,
+			y: r.y
+		}, s = {
+			x: i.x - a * t.w / 2,
+			y: i.y
+		}, c = (o.x + s.x) / 2;
+		n.path(m([{
+			c: "M",
+			p: [o]
+		}, {
+			c: "C",
+			p: [
+				{
+					x: c,
+					y: o.y
+				},
+				{
+					x: c,
+					y: s.y
+				},
+				s
+			]
+		}]), {
+			stroke: t.color,
+			sw: Math.max(1.2, 3.2 - t.depth * .6)
+		});
+	}
+	for (let e of w) {
+		let t = k(e), r = e.depth === 0 ? 16 : e.depth === 1 ? 14 : 13, i = t.x - e.w / 2, a = t.y - e.h / 2, o = e.n.shape ?? (e.depth, "round"), s = e.depth === 0 ? u.dark : e.depth === 1 ? e.color : he(e.color), c = e.depth <= 1 ? "#ffffff" : u.ink;
+		if (o === "none") n.line(i, a + e.h, i + e.w, a + e.h, {
+			stroke: e.color,
+			sw: 1.5
+		}), n.text(t.x, t.y, e.text, {
+			anchor: "middle",
+			size: r
+		});
+		else {
+			if (o === "circle") n.circle(t.x, t.y, e.w / 2, {
+				fill: s,
+				stroke: e.color,
+				sw: 1.2
+			});
+			else if (o === "hexagon") {
+				let r = e.h / 4;
+				n.poly([
+					[i + r, a],
+					[i + e.w - r, a],
+					[i + e.w, t.y],
+					[i + e.w - r, a + e.h],
+					[i + r, a + e.h],
+					[i, t.y]
+				], {
+					fill: s,
+					stroke: e.color,
+					sw: 1.2
+				});
+			} else n.rect(i, a, e.w, e.h, {
+				fill: s,
+				stroke: e.depth === 0 ? void 0 : e.color,
+				sw: 1.2
+			}, o === "rect" ? 2 : o === "cloud" ? e.h / 2 : 8);
+			n.text(t.x, t.y, e.text, {
+				anchor: "middle",
+				size: r,
+				bold: e.depth === 0,
+				color: c
+			});
+		}
+	}
+	let A = x - b + 32, j = C - S + 32 + E;
+	return t && (A = Math.max(A, r(t, 16, !0) + 32), n.text(A / 2, 28, t, {
+		anchor: "middle",
+		size: 16,
+		bold: !0
+	})), {
+		svg: n.toString(A, j),
+		w: Math.ceil(A),
+		h: Math.ceil(j)
+	};
+}
+function he(e) {
+	let t = /^#([0-9a-f]{2})([0-9a-f]{2})([0-9a-f]{2})$/i.exec(e);
+	return t ? "#" + [
+		t[1],
+		t[2],
+		t[3]
+	].map((e) => Math.round(parseInt(e, 16) * .22 + 198.9).toString(16).padStart(2, "0")).join("") : "#f1f3f7";
+}
+// src/core/diagram/sequence.ts
+var X = (e) => Math.round(e * 100) / 100, ge = class {
+	s = {
+		participants: [],
+		events: []
+	};
+	ids = /* @__PURE__ */ new Map();
+	participant(e, t = {}) {
+		let n = this.ids.get(e);
+		n || (n = {
+			id: e,
+			label: e,
+			kind: "participant"
+		}, this.ids.set(e, n), this.s.participants.push(n));
+		for (let [e, r] of Object.entries(t)) r !== void 0 && (n[e] = r);
+		return n;
+	}
+	has(e) {
+		return this.ids.has(e);
+	}
+	push(e) {
+		e.t === "msg" ? (this.participant(e.from), this.participant(e.to)) : e.t === "note" ? e.who.forEach((e) => this.participant(e)) : (e.t === "act" || e.t === "destroy") && this.participant(e.who), this.s.events.push(e);
+	}
+}, _e = 14, Z = 13, ve = i(Z), Q = 16, ye = (e) => e ? e.split("\n") : [];
+function be(e) {
+	let t = ye(e.label), n = a(t, _e);
+	switch (e.kind) {
+		case "actor": return {
+			w: Math.max(44, n.w + 8),
+			h: 44 + n.h,
+			text: t
+		};
+		case "boundary":
+		case "control":
+		case "entity": return {
+			w: Math.max(44, n.w + 8),
+			h: 34 + n.h,
+			text: t
+		};
+		case "database": return {
+			w: Math.max(64, n.w + 24),
+			h: n.h + 30,
+			text: t
+		};
+		default: return {
+			w: Math.max(64, n.w + 24),
+			h: n.h + 18,
+			text: t
+		};
+	}
+}
+function xe(e, t, n, r, a) {
+	let o = t.fill ?? u.fill, s = {
+		fill: o,
+		stroke: u.stroke,
+		sw: 1.3
+	}, c = {
+		fill: "none",
+		stroke: u.dark,
+		sw: 1.5
+	}, l = (t) => e.text(r, t + n.text.length * i(_e) / 2, n.text, { anchor: "middle" }), d = r - n.w / 2;
+	switch (t.kind) {
+		case "actor":
+			e.circle(r, a + 8, 7, {
+				...c,
+				fill: o
+			}), e.line(r, a + 15, r, a + 29, c).line(r - 11, a + 20, r + 11, a + 20, c), e.line(r, a + 29, r - 9, a + 41, c).line(r, a + 29, r + 9, a + 41, c), l(a + 44);
+			return;
+		case "boundary":
+			e.circle(r + 4, a + 14, 12, s).line(r - 14, a + 4, r - 14, a + 24, c).line(r - 14, a + 14, r - 8, a + 14, c), l(a + 32);
+			return;
+		case "control":
+			e.circle(r, a + 15, 12, s).poly([
+				[r + 4, a - 1],
+				[r - 2, a + 3],
+				[r + 4, a + 7]
+			], c, !1), l(a + 32);
+			return;
+		case "entity":
+			e.circle(r, a + 13, 12, s).line(r - 12, a + 27, r + 12, a + 27, c), l(a + 32);
+			return;
+		case "database": {
+			let t = n.w, i = n.h;
+			e.path(`M${X(d)} ${X(a + 6)} A${X(t / 2)} 6 0 0 1 ${X(d + t)} ${X(a + 6)} L${X(d + t)} ${X(a + i - 6)} A${X(t / 2)} 6 0 0 1 ${X(d)} ${X(a + i - 6)} Z`, s), e.path(`M${X(d)} ${X(a + 6)} A${X(t / 2)} 6 0 0 0 ${X(d + t)} ${X(a + 6)}`, {
+				...s,
+				fill: "none"
+			}), e.text(r, a + i / 2 + 3, n.text, { anchor: "middle" });
+			return;
+		}
+		case "collections":
+			e.rect(d + 4, a - 4, n.w, n.h, s, 3), e.rect(d, a, n.w, n.h, s, 3);
+			break;
+		case "queue":
+			e.rect(d, a, n.w, n.h, s, n.h / 2);
+			break;
+		default: e.rect(d, a, n.w, n.h, s, 3);
+	}
+	e.text(r, a + n.h / 2, n.text, { anchor: "middle" });
+}
+function Se(e, t, n, r, i) {
+	let a = u.line;
+	switch (t) {
+		case "filled":
+			e.poly([
+				[n, r],
+				[n - i * 10, r - 4.5],
+				[n - i * 10, r + 4.5]
+			], {
+				fill: a,
+				stroke: a,
+				sw: 1
+			});
+			break;
+		case "open":
+			e.poly([
+				[n - i * 10, r - 5],
+				[n, r],
+				[n - i * 10, r + 5]
+			], {
+				stroke: a,
+				sw: 1.4
+			}, !1);
+			break;
+		case "half":
+			e.poly([[n - i * 10, r - 5], [n, r]], {
+				stroke: a,
+				sw: 1.4
+			}, !1);
+			break;
+		case "cross": e.line(n - 5 - i * 4, r - 5, n + 5 - i * 4, r + 5, {
+			stroke: a,
+			sw: 1.6
+		}).line(n - 5 - i * 4, r + 5, n + 5 - i * 4, r - 5, {
+			stroke: a,
+			sw: 1.6
+		});
+	}
+}
+function Ce(e) {
+	let t = e.participants;
+	if (!t.length) throw new g("The sequence diagram has no participants");
+	if (t.length > 300 || e.events.length > 8e3) throw new g("The sequence diagram is too large to draw");
+	let n = new Map(t.map((e, t) => [e.id, t])), i = t.map(be), o = t.length, s = Array(o).fill(0);
+	for (let e = 1; e < o; e++) s[e] = (i[e - 1].w + i[e].w) / 2 + 28;
+	let c = 0, l = 0, d = (e, t, n) => {
+		if (e > t && ([e, t] = [t, e]), e === t) return;
+		let r = 0;
+		for (let n = e + 1; n <= t; n++) r += s[n];
+		if (r >= n) return;
+		let i = (n - r) / (t - e);
+		for (let n = e + 1; n <= t; n++) s[n] += i;
+	}, f = (t) => e.autonumber ? r(String(t), 10) + 14 : 0, m = 0;
+	for (let t of e.events) if (t.t === "msg") {
+		m++;
+		let e = n.get(t.from), a = n.get(t.to), s = Math.max(0, ...ye(t.text).map((e) => r(e, Z))) + f(m);
+		e === a ? e + 1 < o ? d(e, e + 1, i[e + 1].w / 2 + s + 44) : l = Math.max(l, s + 44 - i[e].w / 2) : d(e, a, s + 30);
+	} else if (t.t === "note") {
+		let e = a(ye(t.text), Z).w + 20, r = t.who.map((e) => n.get(e)), s = Math.min(...r), u = Math.max(...r);
+		t.pos === "over" ? s !== u && d(s, u, e - 50) : t.pos === "left" ? s > 0 ? d(s - 1, s, e + 16 + i[s - 1].w / 2) : c = Math.max(c, e + 16 - i[0].w / 2) : u + 1 < o ? d(u, u + 1, e + 16 + i[u + 1].w / 2) : l = Math.max(l, e + 16 - i[u].w / 2);
+	}
+	let h = [], _ = (() => {
+		let t = 0, n = 0;
+		for (let r of e.events) r.t === "block" ? n = Math.max(n, ++t) : r.t === "end" && (t = Math.max(0, t - 1));
+		return n;
+	})(), v = _ ? 12 + _ * 8 : 0;
+	h[0] = Q + Math.max(i[0].w / 2, c + i[0].w / 2, v + 10);
+	for (let e = 1; e < o; e++) h[e] = h[e - 1] + s[e];
+	let y = h[o - 1] + Math.max(i[o - 1].w / 2, l + i[o - 1].w / 2, v + 10) + Q, b = Q + (e.title ? 34 : 0), x = Math.max(...i.map((e) => e.h)), S = b + x + 18, C = new p(), w = new p(), T = new p(), E = t.map(() => []), D = [], O = [], k = [], A = /* @__PURE__ */ new Map(), j = (e, t) => {
+		for (let n of k) n.lo = Math.min(n.lo, e), n.hi = Math.max(n.hi, t);
+	}, ee = (e, t) => {
+		let n = E[e].length;
+		return h[e] + (n ? t * 5 + (n - 1) * 5 : 0);
+	}, te = (e, t) => E[e].push(t), M = (e, t) => {
+		let n = E[e].pop();
+		n !== void 0 && D.push({
+			k: e,
+			y0: n,
+			y1: t,
+			depth: E[e].length
+		});
+	};
+	m = 0;
+	for (let t of e.events) switch (t.t) {
+		case "msg": {
+			m++;
+			let i = n.get(t.from), a = n.get(t.to), o = ye(t.text), s = o.length * ve, c = {
+				stroke: u.line,
+				sw: 1.4,
+				dash: t.dashed ? "6 4" : void 0
+			}, l = f(m);
+			if (i === a) {
+				S += s + 4;
+				let n = ee(i, 1);
+				w.poly([
+					[n, S],
+					[n + 34, S],
+					[n + 34, S + 20],
+					[n + 2, S + 20]
+				], c, !1), Se(w, t.head, n, S + 20, -1), T.text(n + 6 + l, S - 4 - s / 2, o, { size: Z }), e.autonumber && we(T, n, S, m), j(h[i] - 10, n + 34 + 6 + l + Math.max(...o.map((e) => r(e, Z)))), S += 20, t.activate && te(a, S), t.deactivate && M(i, S), S += 14;
+				break;
+			}
+			S += s + 6;
+			let d = a > i ? 1 : -1;
+			t.activate && te(a, S);
+			let p = ee(i, d), g = ee(a, -d);
+			w.line(p, S, g, S, c), Se(w, t.head, g, S, d), t.both && Se(w, t.head, p, S, -d), T.text((p + g) / 2 + d * l / 2, S - 5 - s / 2, o, {
+				anchor: "middle",
+				size: Z
+			}), e.autonumber && we(T, p, S, m), t.deactivate && M(i, S), j(Math.min(h[i], h[a]), Math.max(h[i], h[a])), S += 14;
+			break;
+		}
+		case "act": {
+			let e = n.get(t.who);
+			t.on ? te(e, S - 6) : M(e, S - 6);
+			break;
+		}
+		case "note": {
+			let e = t.who.map((e) => n.get(e)), r = Math.min(...e), i = Math.max(...e), o = ye(t.text), s = a(o, Z), c = Math.max(s.w + 20, t.pos === "over" && r !== i ? h[i] - h[r] + 50 : 0, 60), l = s.h + 12;
+			S += 6;
+			let d = t.pos === "left" ? h[r] - 12 - c : t.pos === "right" ? h[i] + 12 : (h[r] + h[i]) / 2 - c / 2;
+			T.poly([
+				[d, S],
+				[d + c - 8, S],
+				[d + c, S + 8],
+				[d + c, S + l],
+				[d, S + l]
+			], {
+				fill: u.note,
+				stroke: u.noteStroke,
+				sw: 1
+			}), T.text(d + 10, S + l / 2, o, { size: Z }), j(d, d + c), S += l + 8;
+			break;
+		}
+		case "block": {
+			S += 10;
+			let e = {
+				kind: t.kind,
+				label: t.label,
+				fill: t.fill,
+				y0: S,
+				y1: S,
+				lo: Infinity,
+				hi: -Infinity,
+				depth: k.length,
+				elses: []
+			};
+			O.push(e), k.push(e), S += t.kind === "rect" ? 8 : 26;
+			break;
+		}
+		case "else": {
+			let e = k[k.length - 1];
+			if (!e) break;
+			S += 8, e.elses.push({
+				y: S,
+				label: t.label
+			}), S += 24;
+			break;
+		}
+		case "end": {
+			let e = k.pop();
+			if (!e) break;
+			S += 10, e.y1 = S, S += 6;
+			break;
+		}
+		case "divider": {
+			S += 16;
+			let e = a(ye(t.text), Z);
+			T.line(Q / 2, S - 2, y - Q / 2, S - 2, {
+				stroke: u.muted,
+				sw: 1
+			}).line(Q / 2, S + 2, y - Q / 2, S + 2, {
+				stroke: u.muted,
+				sw: 1
+			}), t.text && (T.rect(y / 2 - e.w / 2 - 10, S - e.h / 2 - 4, e.w + 20, e.h + 8, {
+				fill: "#ffffff",
+				stroke: u.muted,
+				sw: 1
+			}, 3), T.text(y / 2, S, ye(t.text), {
+				anchor: "middle",
+				size: Z,
+				bold: !0
+			})), S += 22;
+			break;
+		}
+		case "delay":
+			S += 14, t.text && T.text(y / 2, S, ye(t.text), {
+				anchor: "middle",
+				size: Z,
+				italic: !0,
+				color: u.muted
+			}), S += 18;
+			break;
+		case "space":
+			S += t.h;
+			break;
+		case "destroy": {
+			let e = n.get(t.who);
+			S += 6, T.line(h[e] - 8, S - 8, h[e] + 8, S + 8, {
+				stroke: "#c0392b",
+				sw: 2
+			}).line(h[e] - 8, S + 8, h[e] + 8, S - 8, {
+				stroke: "#c0392b",
+				sw: 2
+			}), A.set(e, S), S += 14;
+			break;
+		}
+	}
+	for (let e = 0; e < o; e++) for (; E[e].length;) M(e, S);
+	for (let e of k.splice(0)) e.y1 = S;
+	S += 14;
+	let N = e.footer !== !1, ne = S + (N ? x : 0) + Q;
+	for (let e of O) {
+		let t = 12 + (_ - e.depth) * 8;
+		e.lo > e.hi && (e.lo = h[0], e.hi = h[o - 1]);
+		let n = Math.max(4, e.lo - t), i = r(e.kind, 12, !0) + 16, a = [e.label ? i + 8 + r(`[${e.label}]`, 12) : i, ...e.elses.map((e) => 10 + r(`[${e.label}]`, 12))], s = Math.max(Math.min(y - 4, e.hi + t), e.kind === "rect" ? 0 : n + Math.max(...a) + 10);
+		if (y = Math.max(y, s + 4), e.kind === "rect") {
+			C.rect(n, e.y0, s - n, e.y1 - e.y0, { fill: e.fill ?? "rgba(200, 210, 230, 0.35)" }, 2);
+			continue;
+		}
+		let c = {
+			stroke: u.muted,
+			sw: 1.2
+		};
+		w.rect(n, e.y0, s - n, e.y1 - e.y0, c);
+		let l = i;
+		w.poly([
+			[n, e.y0],
+			[n + l, e.y0],
+			[n + l, e.y0 + 12],
+			[n + l - 7, e.y0 + 19],
+			[n, e.y0 + 19]
+		], {
+			fill: "#eef0f4",
+			stroke: u.muted,
+			sw: 1.2
+		}), w.text(n + 7, e.y0 + 10, e.kind, {
+			size: 12,
+			bold: !0
+		}), e.label && w.text(n + l + 8, e.y0 + 11, `[${e.label}]`, {
+			size: 12,
+			color: u.ink,
+			italic: !0
+		});
+		for (let t of e.elses) w.line(n, t.y, s, t.y, {
+			...c,
+			dash: "5 4"
+		}), t.label && w.text(n + 10, t.y + 12, `[${t.label}]`, {
+			size: 12,
+			italic: !0
+		});
+	}
+	let P = new p(), F = b + x;
+	for (let e = 0; e < o; e++) P.line(h[e], F, h[e], A.get(e) ?? (N ? S : S - 6), {
+		stroke: "#9aa3b2",
+		sw: 1,
+		dash: "5 4"
+	});
+	P.raw(C.body());
+	for (let e of D) {
+		let t = h[e.k] - 5 + e.depth * 5;
+		P.rect(t, e.y0, 10, Math.max(8, e.y1 - e.y0), {
+			fill: "#f3f4f6",
+			stroke: u.stroke,
+			sw: 1
+		});
+	}
+	return P.raw(w.body()), P.raw(T.body()), t.forEach((e, t) => {
+		xe(P, e, i[t], h[t], b + x - i[t].h), N && !A.has(t) && xe(P, e, i[t], h[t], S);
+	}), e.title && (y = Math.max(y, r(e.title, 16, !0) + 32), P.text(y / 2, 28, e.title, {
+		anchor: "middle",
+		size: 16,
+		bold: !0
+	})), {
+		svg: P.toString(y, ne),
+		w: Math.ceil(y),
+		h: Math.ceil(ne)
+	};
+}
+function we(e, t, n, i) {
+	let a = Math.max(8, r(String(i), 10) / 2 + 4);
+	e.circle(t, n, a, { fill: u.dark }), e.text(t, n, String(i), {
+		anchor: "middle",
+		size: 10,
+		color: "#ffffff",
+		bold: !0
+	});
+}
+// src/core/diagram/model.ts
+function Te(e) {
+	switch (e.t) {
+		case "graph": return F(e.graph);
+		case "sequence": return Ce(e.seq);
+		case "pie": return ue(e.pie);
+		case "gantt": return fe(e.gantt);
+		case "tree": return Y(e.root, e.title);
+	}
+}
+// src/core/diagram/plantuml.ts
+function Ee(e) {
+	let t = e.replace(/^/, "").replace(/\r\n?/g, "\n"), n = [], r = /^[ \t]*@start(\w+)[^\n]*\n([\s\S]*?)^[ \t]*@end\1\b/gm, i;
+	for (; i = r.exec(t);) n.push({
+		kind: i[1].toLowerCase(),
+		lines: i[2].split("\n")
+	});
+	return n.length || n.push({
+		kind: "uml",
+		lines: t.split("\n")
+	}), n;
+}
+function De(e) {
+	return Ee(e).map(({ kind: e, lines: t }) => ke(e, t));
+}
+var Oe = (e) => De(e).map(Te);
+function ke(e, t) {
+	if (e === "dot") return {
+		t: "graph",
+		graph: se(t.join("\n"))[0]
+	};
+	let { lines: n, title: r, dir: i } = Ae(t);
+	switch (e) {
+		case "uml": break;
+		case "mindmap":
+		case "wbs": return {
+			t: "tree",
+			root: We(n, e === "wbs"),
+			title: r
+		};
+		default: throw new g(`PlantUML @start${e} diagrams are not supported yet`);
+	}
+	switch (je(n)) {
+		case "activity": return {
+			t: "graph",
+			graph: {
+				...Ue(n),
+				title: r
+			}
+		};
+		case "sequence": return {
+			t: "sequence",
+			seq: {
+				...Ne(n),
+				title: r
+			}
+		};
+		case "state": return {
+			t: "graph",
+			graph: {
+				...He(n, i),
+				title: r
+			}
+		};
+		default: return {
+			t: "graph",
+			graph: {
+				...Ve(n, i),
+				title: r
+			}
+		};
+	}
+}
+function $(e) {
+	return h(e.trim().replace(/^"(.*)"$/s, "$1").replace(/\*\*(.+?)\*\*|\/\/(.+?)\/\/|""(.+?)""|__(.+?)__|~~(.+?)~~|--(.+?)--/g, (...e) => e.slice(1, 7).find((e) => e !== void 0) ?? "").replace(/<\/?(?:b|i|u|s|font|color|size|back|code|plain|strike|w|sub|sup)\b[^>]*>/gi, "").replace(/<&[\w-]+>/g, "").replace(/\\t/g, "  "));
+}
+function Ae(e) {
+	let t = [], n, r, i = null, a = null, o = !1;
+	for (let s of e) {
+		if (o) {
+			let e = s.indexOf("'/");
+			if (e < 0) continue;
+			s = s.slice(e + 2), o = !1;
+		}
+		s = s.replace(/\/'.*?'\//g, "");
+		let e = s.indexOf("/'");
+		e >= 0 && (s = s.slice(0, e), o = !0);
+		let c = s.trim();
+		if (i) {
+			i.test(c) && (i = null);
+			continue;
+		}
+		if (a) {
+			/^end\s*title$/i.test(c) ? (n = $(a.join("\n")), a = null) : a.push(c);
+			continue;
+		}
+		if (!c || c.startsWith("'")) continue;
+		let l;
+		/^skinparam\b.*\{$/i.test(c) || /^(legend|header|footer)\b(?!.*:)/i.test(c) && !/^(header|footer)\s+\S/i.test(c) ? i = /^(\}|end\s*legend|endlegend|end\s*header|endheader|end\s*footer|endfooter)$/i : /^(skinparam|!|hide|show|scale|caption|header|footer|newpage|allowmixing|autoactivate|set\s+namespaceSeparator|page|mainframe|sprite|remove|restore|together|left\s+header|right\s+footer)\b/i.test(c) || ((l = /^title\s*:?\s*(.*)$/i.exec(c)) ? l[1] ? n = $(l[1]) : a = [] : /^left\s+to\s+right\s+direction$/i.test(c) ? r = "LR" : /^top\s+to\s+bottom\s+direction$/i.test(c) ? r = "TB" : t.push(c));
+	}
+	return {
+		lines: t,
+		title: n,
+		dir: r
+	};
+}
+function je(e) {
+	let t = (t) => e.some((e) => t.test(e));
+	return t(/^(start|stop)$/) || t(/^:[\s\S]*[;|<>/\]}]$/) || t(/^:/) || t(/^(if\s*\(.*\)\s*then|while\s*\(|repeat\b|fork$|endif$)/) ? "activity" : t(/\[\*\]/) || t(/^state\s/) ? "state" : t(/^(participant|boundary|control|collections|queue|autonumber|activate|deactivate|alt|loop|return|ref\s+over)\b/) || t(/^(==.*==|\.\.\.|\|\|\d*\|\|)$/) ? "sequence" : t(/^(abstract|class|interface|enum|annotation|struct|protocol|object|map|json|usecase|component|node|cloud|package|namespace|folder|frame|rectangle|artifact|storage|card|file|agent|person|hexagon|together)\b/) || t(/\([^)]*\)|\[[^\]*]+\]|<\|--|--\|>|\*--|o--|\.\.>/) ? "description" : t(/^(actor|database|entity)\b/) || t(/^\S+\s*<?-{1,2}>?>?\s*\S+\s*:/) ? "sequence" : "description";
+}
+var Me = {
+	participant: "participant",
+	actor: "actor",
+	boundary: "boundary",
+	control: "control",
+	entity: "entity",
+	database: "database",
+	collections: "collections",
+	queue: "queue"
+};
+function Ne(e) {
+	let t = new ge(), n = [], r = null, i = null, a = null, o = (e) => e.trim().replace(/^"(.*)"$/, "$1");
+	for (let s of e) {
+		if (r) {
+			/^end\s*(note|ref|rnote|hnote)$/i.test(s) ? (i && i.who.length && t.push({
+				t: "note",
+				pos: i.pos,
+				who: i.who,
+				text: $(r.join("\n"))
+			}), r = null) : r.push(s);
+			continue;
+		}
+		let e;
+		if (e = /^(?:create\s+)?(participant|actor|boundary|control|entity|database|collections|queue)\s+(.+)$/.exec(s)) {
+			let n = e[2].replace(/\s+order\s+-?\d+/, "").trim(), r = /\s+(#\w+)\s*$/.exec(n);
+			r && (n = n.slice(0, r.index).trim()), n = n.replace(/<<[^>]*>>/g, "").trim();
+			let i = n, a = n, s = /^"([^"]+)"\s+as\s+(\S+)$/.exec(n), c = /^(\S+)\s+as\s+"?([^"]+)"?$/.exec(n);
+			s ? [i, a] = [s[2], s[1]] : c ? [i, a] = [c[1], c[2]] : i = a = o(n), t.participant(i, {
+				kind: Me[e[1].toLowerCase()],
+				label: $(a),
+				fill: r ? l(r[1].slice(1)) ?? l(r[1]) : void 0
+			});
+			continue;
+		}
+		if (/^hide\s+footbox$/i.test(s)) {
+			t.s.footer = !1;
+			continue;
+		}
+		if (/^autonumber\b/i.test(s)) {
+			t.s.autonumber = !/\bstop\b/i.test(s);
+			continue;
+		}
+		if (e = /^(activate|deactivate|destroy)\s+(\S+)/i.exec(s)) {
+			let n = o(e[2]);
+			e[1].toLowerCase() === "destroy" ? t.push({
+				t: "destroy",
+				who: n
+			}) : t.push({
+				t: "act",
+				who: n,
+				on: e[1].toLowerCase() === "activate"
+			});
+			continue;
+		}
+		if (e = /^return\b\s*(.*)$/i.exec(s)) {
+			let r = n.pop() ?? (a ? {
+				from: a.from,
+				to: a.to
+			} : null);
+			r && t.push({
+				t: "msg",
+				from: r.to,
+				to: r.from,
+				text: $(e[1]),
+				dashed: !0,
+				head: "filled",
+				deactivate: !0
+			});
+			continue;
+		}
+		if ((e = /^[rh]?note\s+(left|right|over)(?:\s+of)?\s*([^:]*?)\s*(?:#\w+)?\s*(?::\s*(.*))?$/i.exec(s)) || (e = /^ref\s+over\s+()([^:]+?)\s*(?::\s*(.*))?$/i.exec(s))) {
+			let n = (e[1] || "over").toLowerCase(), s = e[2] ? e[2].split(",").map(o).filter(Boolean) : [];
+			!s.length && a && (s = [n === "left" ? a.from : a.to]), !s.length && t.s.participants.length && (s = [t.s.participants[0].id]), e[3] === void 0 ? (r = [], i = {
+				pos: n,
+				who: s
+			}) : s.length && t.push({
+				t: "note",
+				pos: n,
+				who: s,
+				text: $(e[3])
+			});
+			continue;
+		}
+		if (e = /^note\s+across\s*:\s*(.*)$/i.exec(s)) {
+			let n = t.s.participants;
+			n.length && t.push({
+				t: "note",
+				pos: "over",
+				who: [n[0].id, n[n.length - 1].id],
+				text: $(e[1])
+			});
+			continue;
+		}
+		if (e = /^(alt|opt|loop|par|break|critical|group)\b\s*(.*)$/i.exec(s)) {
+			let n = e[1].toLowerCase();
+			t.push({
+				t: "block",
+				kind: n === "group" ? $(e[2]) || "group" : n,
+				label: n === "group" ? "" : $(e[2])
+			});
+			continue;
+		}
+		if (e = /^else\b\s*(.*)$/i.exec(s)) {
+			t.push({
+				t: "else",
+				label: $(e[1])
+			});
+			continue;
+		}
+		if (/^end$/i.test(s)) {
+			t.push({ t: "end" });
+			continue;
+		}
+		if (/^(box\b|end\s*box)/i.test(s)) continue;
+		if (e = /^==\s*(.*?)\s*==$/.exec(s)) {
+			t.push({
+				t: "divider",
+				text: $(e[1])
+			});
+			continue;
+		}
+		if (e = /^\.\.\.\s*(.*?)\s*(?:\.\.\.)?$/.exec(s)) {
+			t.push({
+				t: "delay",
+				text: $(e[1])
+			});
+			continue;
+		}
+		if ((e = /^\|\|(\d*)\|\|$/.exec(s)) || s === "|||") {
+			t.push({
+				t: "space",
+				h: e?.[1] ? Math.min(400, Number(e[1])) : 20
+			});
+			continue;
+		}
+		let c = Fe(s);
+		if (c) {
+			let { from: e, to: r, dashed: i, head: o, both: s, act: l, text: u } = c;
+			t.push({
+				t: "msg",
+				from: e,
+				to: r,
+				text: u,
+				dashed: i,
+				head: o,
+				both: s,
+				activate: l === "++",
+				deactivate: l === "--"
+			}), a = {
+				from: e,
+				to: r
+			}, l === "++" && n.push({
+				from: e,
+				to: r
+			}), l === "--" && n.length && n.pop(), l === "**" && t.participant(r), l === "!!" && t.push({
+				t: "destroy",
+				who: r
+			});
+		}
+	}
+	return t.s;
+}
+var Pe = /^(\[|\]|[\w.$À-￿]+|"[^"]+")?\s*(<<?|[\\/]{1,2})?(-{1,2}|\.{1,2})(?:\[[^\]]*\])?(-?)(>>?|[\\/]{1,2})?\s*([ox])?\s*(\[|\]|[\w.$À-￿]+|"[^"]+")?\s*(\+\+|--|\*\*|!!)?\s*(?::\s*(.*))?$/u;
+function Fe(e) {
+	let t = Pe.exec(e.replace(/^(\S+)\s*([ox])(?=<|-)/, "$1 "));
+	if (!t) return null;
+	let [, n, r, i, , a, , o, s, c] = t;
+	if (!r && !a || !n || !o) return null;
+	let l = (e) => e.replace(/^"(.*)"$/, "$1"), u = l(n), d = l(o);
+	if (u === "[" || u === "]" || d === "[" || d === "]") return null;
+	let f = i === "--" || i.startsWith("."), p = (e) => e ? e === ">>" || e === "<<" ? "open" : e.length && /[\\/]/.test(e) ? "half" : "filled" : "none", m, h = !1;
+	return r && a ? (m = p(a), h = !0) : r ? ([u, d] = [d, u], m = p(r)) : m = p(a), /x\s*$/.test(e.split(":")[0].replace(o, "").trim()) && !r && (m = "cross"), {
+		from: u,
+		to: d,
+		dashed: f,
+		head: m,
+		both: h,
+		act: s,
+		text: $(c ?? "")
+	};
+}
+var Ie = {
+	actor: "actor",
+	person: "actor",
+	usecase: "ellipse",
+	component: "component",
+	node: "box3d",
+	database: "cylinder",
+	cloud: "cloud",
+	folder: "folder",
+	frame: "folder",
+	package: "folder",
+	artifact: "note",
+	file: "note",
+	storage: "stadium",
+	queue: "stadium",
+	stack: "rect",
+	card: "rect",
+	rectangle: "rect",
+	agent: "rect",
+	label: "none",
+	boundary: "circle",
+	control: "circle",
+	entity: "rect",
+	collections: "rect",
+	hexagon: "hexagon",
+	interface: "rect",
+	circle: "circle",
+	port: "point",
+	portin: "point",
+	portout: "point",
+	action: "rect",
+	process: "round",
+	usecase_: "ellipse",
+	object: "rect",
+	map: "rect",
+	json: "rect",
+	diamond: "diamond",
+	state: "round"
+}, Le = /* @__PURE__ */ new Set([
+	"class",
+	"abstract",
+	"abstract class",
+	"interface",
+	"enum",
+	"annotation",
+	"struct",
+	"protocol",
+	"entity",
+	"exception",
+	"metaclass",
+	"stereotype",
+	"object",
+	"map",
+	"json"
+]), Re = {
+	">": "arrow",
+	"<": "arrow",
+	"|>": "triangle",
+	"<|": "triangle",
+	"^": "triangle",
+	"*": "diamond",
+	o: "odiamond",
+	"#": "odiamond",
+	x: "cross",
+	"+": "ocircle",
+	"{": "many",
+	"}": "many",
+	">>": "open",
+	"<<": "open",
+	"|o": "zero-one",
+	"o|": "zero-one",
+	"||": "one",
+	"}o": "zero-many",
+	"o{": "zero-many",
+	"}|": "one-many",
+	"|{": "one-many"
+}, ze = String.raw`\[\*\]|\[[^\]]+\]|\([^)]*\)|:[^:]+:|"[^"]+"|\(\)\s*"[^"]+"|\(\)\s*[\w.]+|[\w.$À-￿-]+`, Be = new RegExp(String.raw`^(${ze})\s*(?:"([^"]*)"\s*)?((?:<\||<<|\}o|\}\||\|o|\|\||[<*o#x+^}])?)([-.=~]+)(?:\[([^\]]*)\])?((?:up|down|left|right|u|d|l|r|le|ri|do)?)([-.=~]*)(?:\[([^\]]*)\])?((?:\|>|>>|o\{|\|\{|o\||\|\||[>*#+^{]|[ox](?=\s|\[|\(|"|:|$))?)\s*(?:"([^"]*)"\s*)?(${ze})\s*(?::\s*(.*))?$`, "u");
+function Ve(e, t) {
+	let n = new _(t ?? "TB", "rect"), r = /* @__PURE__ */ new Map(), i = [], a = [], o = null, s = null, c, u = "", d = 0, f = 0, p = () => i[i.length - 1], m = (e) => {
+		let t = e.trim(), r;
+		return t === "(*)" ? "start" : (r = /^\[(.+)\]$/.exec(t)) ? h(r[1], "component") : (r = /^\((.*)\)$/.exec(t)) ? h(r[1], "ellipse") : (r = /^:(.+):$/.exec(t)) ? h(r[1], "actor") : (r = /^\(\)\s*"?([^"]+)"?$/.exec(t)) ? h(r[1], "circle") : (t = t.replace(/^"(.*)"$/, "$1"), !n.has(t) && !n.isCluster(t) && n.node(t, { label: $(t) }, p()), t);
+	}, h = (e, t) => {
+		let r = e.trim();
+		return !n.has(r) && !n.isCluster(r) && n.node(r, {
+			label: $(r),
+			shape: t
+		}, p()), r;
+	};
+	for (let t of e) {
+		if (s) {
+			/^end\s*note$/i.test(t) ? (n.node(u, {
+				label: $(s.join("\n")),
+				shape: "note",
+				style: {
+					fill: "#fff6c8",
+					stroke: "#c9a227"
+				}
+			}, p()), c && n.edge({
+				from: c,
+				to: u,
+				line: "dashed",
+				head: "none"
+			}), s = null) : s.push(t);
+			continue;
+		}
+		if (o) {
+			if (t === "}") {
+				o = null;
+				continue;
+			}
+			/^(--|==|\.\.|__)(.*?)(--|==|\.\.|__)?$/.test(t) ? o.c.sections.push([]) : o.c.sections[o.c.sections.length - 1].push($(t.replace(/\{(static|abstract|classifier|field|method)\}\s*/g, "")));
+			continue;
+		}
+		let e;
+		if (t === "}" || /^end\s*(package|namespace|rectangle|node|folder|frame|together)$/i.test(t)) i.pop(), a.pop();
+		else if (e = /^note\s+(left|right|top|bottom)(?:\s+of)?\s+(\S+?)\s*(?:#\w+)?\s*(?::\s*(.*))?$/i.exec(t)) {
+			let t = m(e[2]), r = `__note${d++}`;
+			e[3] === void 0 ? (s = [], c = t, u = r) : (n.node(r, {
+				label: $(e[3]),
+				shape: "note",
+				style: {
+					fill: "#fff6c8",
+					stroke: "#c9a227"
+				}
+			}, p()), n.edge({
+				from: t,
+				to: r,
+				line: "dashed",
+				head: "none"
+			}));
+		} else if (e = /^note\s+"([^"]*)"\s+as\s+(\S+)$/i.exec(t)) n.node(e[2], {
+			label: $(e[1]),
+			shape: "note",
+			style: {
+				fill: "#fff6c8",
+				stroke: "#c9a227"
+			}
+		}, p());
+		else if (e = /^note\s+as\s+(\S+)$/i.exec(t)) s = [], c = void 0, u = e[1];
+		else if (e = /^(package|namespace|rectangle|node|folder|frame|cloud|database|component|card|storage|artifact|file|stack|queue|agent|hexagon|together)\s*(?:"([^"]*)"|([^\s{<#]+))?\s*(?:as\s+(\S+))?\s*(<<[^>]*>>)?\s*(#\S+)?\s*\{$/.exec(t)) {
+			let t = e[1].toLowerCase(), r = e[2] ?? e[3] ?? "", o = e[4] ?? (e[3] || e[2] || `__group${f++}`), s = n.cluster(o, t === "together" ? "" : $(r), p()), c = e[6] ? l(e[6].slice(1)) ?? l(e[6]) : void 0;
+			c && (s.style = { fill: c }), t === "together" && (s.style = {
+				fill: "none",
+				stroke: "none"
+			}), i.push(o), a.push(t);
+		} else if ((e = /^(abstract\s+class|abstract|class|interface|enum|annotation|struct|protocol|entity|exception|metaclass|stereotype|object|map|json)\s+(?:"([^"]+)"\s+as\s+(\S+)|(\S+)\s+as\s+"([^"]+)"|([^\s{<#]+))(?:\s*<([^>]+)>)?\s*(<<.+?>>)?\s*(#\S+)?\s*(\{)?\s*(\})?$/.exec(t)) && Le.has(e[1].toLowerCase().replace(/\s+/, " "))) {
+			let t = e[1].toLowerCase().replace(/\s+/, " "), i = e[3] ?? e[4] ?? e[6], a = e[2] ?? e[5] ?? i, s = e[7] ? `<${e[7]}>` : "";
+			n.node(i, {
+				label: $(a) + s,
+				shape: "rect"
+			}, p());
+			let c = r.get(i) ?? {
+				kind: t,
+				sections: [[], []]
+			};
+			c.kind = t, e[8] && (c.stereo = e[8].replace(/^<<|>>$/g, "").trim());
+			let u = e[9] ? l(e[9].slice(1)) ?? l(e[9]) : void 0;
+			u && (n.node(i).style = { fill: u }), r.set(i, c), e[10] && !e[11] && (c.sections = [[]], o = {
+				id: i,
+				c
+			});
+		} else if (e = /^(actor\/?|usecase\/?|component|node|database|cloud|folder|frame|package|artifact|file|storage|queue|stack|card|rectangle|agent|label|boundary|control|entity|collections|hexagon|interface|circle|person|port|portin|portout|action|process|diamond)\s+(.+)$/.exec(t)) {
+			let t = e[1].toLowerCase().replace("/", ""), r = e[2].trim(), i = /\s+(#[\w]+)\s*$/.exec(r);
+			i && (r = r.slice(0, i.index).trim());
+			let a = /\s*<<(.+?)>>\s*$/.exec(r);
+			a && (r = r.slice(0, a.index).trim());
+			let o = r, s = r, c = /^(.+?)\s+as\s+(.+)$/.exec(r);
+			if (c) {
+				let [e, t] = [c[1].trim(), c[2].trim()];
+				/^["([:]/.test(e) ? [s, o] = [e, t] : [o, s] = [e, t];
+			}
+			s = s.replace(/^\((.*)\)$|^\[(.*)\]$|^:(.*):$/, "$1$2$3"), o = o.replace(/^\((.*)\)$|^\[(.*)\]$|^:(.*):$/, "$1$2$3").replace(/^"(.*)"$/, "$1");
+			let u = t === "usecase" ? "ellipse" : t === "actor" ? "actor" : Ie[t] ?? "rect", d = n.node(o, {
+				label: $(s) + (a ? `\n«${a[1]}»` : ""),
+				shape: u
+			}, p()), f = i ? l(i[1].slice(1)) ?? l(i[1]) : void 0;
+			f && (d.style = {
+				...d.style,
+				fill: f
+			});
+		} else if (e = /^(\[[^\]]+\]|\([^)]+\)|:[^:]+:)(?:\s+as\s+(\S+))?$/.exec(t)) {
+			let t = m(e[1]);
+			if (e[2]) {
+				let r = n.get(t);
+				n.node(e[2], {
+					label: r.label,
+					shape: r.shape
+				}, p()), n.g.nodes.splice(n.g.nodes.indexOf(r), 1);
+			}
+		} else if (e = Be.exec(t)) {
+			let [, t, r, i, a, , o, s, , c, l, u, d] = e, f = m(t), p = m(u), h = a + s, g = i ? Re[i] ?? "none" : "none", _ = c ? Re[c] ?? "none" : "none", v = r, y = l;
+			/^(up|u|left|l|le)$/i.test(o) && ([f, p] = [p, f], [g, _] = [_, g], [v, y] = [y, v]);
+			let b = {
+				from: f,
+				to: p,
+				head: _,
+				tail: g,
+				line: h.includes(".") ? "dashed" : h.includes("=") ? "thick" : h.includes("~") ? "dotted" : "solid"
+			};
+			d && (b.label = $(d.replace(/\s*[<>]\s*$|^\s*[<>]\s*/g, ""))), v && (b.tailLabel = v), y && (b.headLabel = y), n.edge(b);
+		} else if ((e = /^([\w.$]+)\s*:\s*(.+)$/.exec(t)) && (r.has(e[1]) || n.has(e[1]))) {
+			let t = r.get(e[1]) ?? {
+				kind: "class",
+				sections: [[], []]
+			};
+			r.set(e[1], t);
+			let n = $(e[2]);
+			n.includes("(") && t.sections.length > 1 ? t.sections[1].push(n) : t.sections[0].push(n);
+		}
+	}
+	let g = n.get("start");
+	if (g && g.label === "start" && n.g.edges.some((e) => e.from === "start" || e.to === "start")) {
+		g.shape = "start", g.label = "";
+		let e = n.g.edges.filter((e) => e.to === "start");
+		if (e.length) {
+			n.node("__end", {
+				shape: "end",
+				label: ""
+			});
+			for (let t of e) t.to = "__end";
+		}
+	}
+	for (let e of n.g.nodes) {
+		let t = r.get(e.id);
+		if (!t) continue;
+		let n = [], i = t.stereo ?? (t.kind === "interface" ? "interface" : t.kind === "enum" ? "enumeration" : t.kind === "annotation" ? "annotation" : t.kind === "abstract" || t.kind === "abstract class" ? "abstract" : void 0);
+		i && n.push([`«${i}»`]), n.push([e.label]);
+		let a = [{
+			rows: n,
+			bold: !0,
+			center: !0,
+			italic: t.kind.startsWith("abstract")
+		}];
+		for (let e of t.sections) a.push({ rows: e.map((e) => [e]) });
+		e.sections = a;
+	}
+	return n.g;
+}
+function He(e, t) {
+	let n = new _(t ?? "TB", "round"), r = [], i = /* @__PURE__ */ new Map(), a = 0, o = null, s, c = () => r[r.length - 1], u = (e, t) => {
+		let r = e.trim().replace(/^"(.*)"$/, "$1");
+		if (r === "[*]") {
+			let e = `${c() ?? ""}__${t ? "end" : "start"}`;
+			return n.node(e, {
+				label: "",
+				shape: t ? "end" : "start"
+			}, c()), e;
+		}
+		return !n.isCluster(r) && !n.has(r) && n.node(r, { label: r }, c()), r;
+	};
+	for (let t of e) {
+		if (o) {
+			if (/^end\s*note$/i.test(t)) {
+				let e = `__note${a++}`;
+				n.node(e, {
+					label: $(o.join("\n")),
+					shape: "note",
+					style: {
+						fill: "#fff6c8",
+						stroke: "#c9a227"
+					}
+				}, c()), s && n.edge({
+					from: s,
+					to: e,
+					line: "dashed",
+					head: "none"
+				}), o = null;
+			} else o.push(t);
+			continue;
+		}
+		if (t === "--" || t === "||") continue;
+		let e;
+		if (e = /^state\s+(?:"([^"]+)"\s+as\s+(\S+?)|(\S+?)\s+as\s+"([^"]+)"|("[^"]+"|[^\s{<#]+))\s*(<<(\w+)>>)?\s*(#\S+)?\s*(\{)?$/i.exec(t)) {
+			let t = (e[2] ?? e[3] ?? e[5]).replace(/^"(.*)"$/, "$1"), i = e[1] ?? e[4] ?? t, a = e[7]?.toLowerCase();
+			if (e[9]) {
+				n.cluster(t, $(i), c()), r.push(t);
+				continue;
+			}
+			let o = a === "fork" || a === "join" ? "bar" : a === "choice" ? "diamond" : a === "start" || a === "entrypoint" ? "start" : a === "end" || a === "exitpoint" ? "end" : void 0;
+			n.node(t, {
+				label: o ? "" : $(i),
+				shape: o
+			}, c());
+			let s = e[8] ? l(e[8].slice(1)) ?? l(e[8]) : void 0;
+			s && (n.node(t).style = { fill: s });
+		} else if (t === "}") r.pop();
+		else if (e = /^note\s+(left|right|top|bottom)\s+of\s+(\S+)\s*(?::\s*(.*))?$/i.exec(t)) {
+			if (e[3] !== void 0) {
+				let t = `__note${a++}`;
+				n.node(t, {
+					label: $(e[3]),
+					shape: "note",
+					style: {
+						fill: "#fff6c8",
+						stroke: "#c9a227"
+					}
+				}, c()), n.edge({
+					from: u(e[2], !1),
+					to: t,
+					line: "dashed",
+					head: "none"
+				});
+			} else o = [], s = u(e[2], !1);
+		} else if (e = /^(\[\*\]|"[^"]+"|[\w.$À-￿]+)\s*(-+|\.+)(?:\[[^\]]*\])?((?:up|down|left|right|u|d|l|r)?)(-*|\.*)(?:\[[^\]]*\])?>\s*(\[\*\]|"[^"]+"|[\w.$À-￿]+)\s*(?::\s*(.*))?$/u.exec(t)) {
+			let t = u(e[1], !1), r = u(e[5], !0), i = !1;
+			/^(up|u|left|l)$/i.test(e[3]) && ([t, r] = [r, t], i = !0), n.edge({
+				from: t,
+				to: r,
+				head: i ? "none" : "arrow",
+				tail: i ? "arrow" : "none",
+				line: e[2].includes(".") ? "dashed" : "solid",
+				label: e[6] ? $(e[6]) : void 0
+			});
+		} else (e = /^([\w.$À-￿]+)\s*:\s*(.+)$/u.exec(t)) && (u(e[1], !1), i.set(e[1], [...i.get(e[1]) ?? [], $(e[2])]));
+	}
+	for (let e of n.g.nodes) {
+		let t = i.get(e.id);
+		t && e.shape === "round" && (e.sections = [{
+			rows: [[e.label]],
+			bold: !0,
+			center: !0
+		}, { rows: t.map((e) => [e]) }]);
+	}
+	return n.g;
+}
+function Ue(e) {
+	let t = new _("TB", "round"), n = [];
+	for (let t = 0; t < e.length; t++) {
+		let r = e[t];
+		if (/^:/.test(r) && !/[;|<>/\]}]$/.test(r)) for (; t + 1 < e.length && !/[;|<>/\]}]$/.test(r);) r += "\n" + e[++t];
+		n.push(r);
+	}
+	let r = 0, i = 0, a = [], o = (e, n = "") => {
+		let r = `a${i++}`;
+		return t.node(r, {
+			shape: e,
+			label: n
+		}, a[a.length - 1]), r;
+	}, s, c = (e, n) => {
+		for (let r of e) t.edge({
+			from: r.from,
+			to: n,
+			head: "arrow",
+			label: r.label
+		});
+	}, l = (e) => $(e.replace(/^\((.*)\)$/, "$1")), u = (e, d) => {
+		let f = e, p = (e) => {
+			s !== void 0 && (f = f.map((e) => ({
+				...e,
+				label: e.label ?? s
+			}))), s = void 0, c(f, e);
+		};
+		for (; r < n.length;) {
+			let e = n[r];
+			if (d.test(e)) return f;
+			r++;
+			let m;
+			if (/^start$/i.test(e)) {
+				let e = o("start");
+				p(e), f = [{ from: e }];
+			} else if (/^(stop|end)$/i.test(e)) p(o("end")), f = [];
+			else if (/^(kill|detach|break)$/i.test(e)) f = [];
+			else if (m = /^:([\s\S]*?)[;|<>/\]}]$/.exec(e)) {
+				let e = o("round", $(m[1]));
+				p(e), f = [{ from: e }];
+			} else if (m = /^->\s*(.*?);?$/.exec(e)) s = $(m[1]) || void 0;
+			else if ((m = /^if\s*(\(.*?\))\s*(?:then\s*(?:\((.*)\))?)?\s*$/i.exec(e)) || (m = /^if\s*(\(.*\))\s*(?:is\s*\((.*)\))?\s*then\s*$/i.exec(e))) {
+				let e = o("diamond", l(m[1]));
+				p(e);
+				let i = u([{
+					from: e,
+					label: m[2] ? $(m[2]) : void 0
+				}], /^(elseif|else\s*if|else|endif|end\s*if)\b/i), a = !0;
+				for (; r < n.length;) {
+					let s = n[r++], c;
+					if (c = /^(?:elseif|else\s*if)\s*(\(.*?\))\s*(?:then\s*(?:\((.*)\))?)?$/i.exec(s)) {
+						let n = o("diamond", l(c[1]));
+						t.edge({
+							from: e,
+							to: n,
+							head: "arrow"
+						}), e = n, i = i.concat(u([{
+							from: n,
+							label: c[2] ? $(c[2]) : void 0
+						}], /^(elseif|else\s*if|else|endif|end\s*if)\b/i));
+					} else if (c = /^else\s*(?:\((.*)\))?$/i.exec(s)) i = i.concat(u([{
+						from: e,
+						label: c[1] ? $(c[1]) : void 0
+					}], /^(endif|end\s*if)\b/i)), a = !1;
+					else break;
+				}
+				a && i.push({ from: e }), f = i;
+			} else if (m = /^switch\s*(\(.*\))$/i.exec(e)) {
+				let e = o("diamond", l(m[1]));
+				p(e);
+				let t = [];
+				for (; r < n.length;) {
+					let i = n[r++], a = /^case\s*(\(.*\))$/i.exec(i);
+					if (!a) break;
+					t = t.concat(u([{
+						from: e,
+						label: l(a[1])
+					}], /^(case\s*\(|endswitch)/i));
+				}
+				f = t;
+			} else if (m = /^while\s*(\(.*?\))\s*(?:is\s*\((.*)\))?$/i.exec(e)) {
+				let e = o("diamond", l(m[1]));
+				p(e);
+				let t = u([{
+					from: e,
+					label: m[2] ? $(m[2]) : void 0
+				}], /^(endwhile|end\s*while)\b/i);
+				c(t, e);
+				let i = /^(?:endwhile|end\s*while)\s*(?:\((.*)\))?$/i.exec(n[r++] ?? "");
+				f = [{
+					from: e,
+					label: i?.[1] ? $(i[1]) : void 0
+				}];
+			} else if ((m = /^repeat\s*(?::([\s\S]*?)[;|<>/\]}])?$/i.exec(e)) && !/^repeat\s*while/i.test(e)) {
+				let e = m[1] === void 0 ? o("diamond", "") : o("round", $(m[1]));
+				p(e);
+				let i = u([{ from: e }], /^(repeat\s*while|backward)/i), a, s;
+				(s = /^backward\s*:([\s\S]*?)[;|<>/\]}]$/i.exec(n[r] ?? "")) && (a = o("round", $(s[1])), r++);
+				let d = /^repeat\s*while\s*(\(.*?\))?\s*(?:is\s*\((.*?)\))?\s*(?:not\s*\((.*?)\))?$/i.exec(n[r++] ?? ""), h = o("diamond", d?.[1] ? l(d[1]) : "");
+				c(i, h), a ? (t.edge({
+					from: h,
+					to: a,
+					head: "arrow",
+					label: d?.[2] ? $(d[2]) : void 0
+				}), t.edge({
+					from: a,
+					to: e,
+					head: "arrow"
+				})) : t.edge({
+					from: h,
+					to: e,
+					head: "arrow",
+					label: d?.[2] ? $(d[2]) : void 0
+				}), f = [{
+					from: h,
+					label: d?.[3] ? $(d[3]) : void 0
+				}];
+			} else if (/^(fork|split)$/i.test(e)) {
+				let t = /^fork$/i.test(e), i, a = f;
+				t ? (i = o("bar"), p(i), a = [{ from: i }]) : s !== void 0 && (s = void 0);
+				let l = [];
+				for (;;) {
+					l = l.concat(u(a, /^(fork\s+again|split\s+again|end\s*fork|end\s*merge|end\s*split)\b/i));
+					let e = n[r++] ?? "";
+					if (!/again/i.test(e)) break;
+				}
+				if (t) {
+					let e = o("bar");
+					c(l, e), f = [{ from: e }];
+				} else f = l;
+			} else if (m = /^(?:partition|group|package|rectangle|card)\s+(?:"([^"]*)"|(\S[^{]*?))\s*(?:#\S+)?\s*\{?$/i.exec(e)) {
+				let e = (m[1] ?? m[2]).trim(), n = `__p${i++}`;
+				t.cluster(n, $(e), a[a.length - 1]), a.push(n);
+			} else if (e === "}" || /^end\s*group$/i.test(e)) a.pop();
+			else if ((/^[rh]?note\b/i.test(e) || /^floating\s+note\b/i.test(e)) && !/:/.test(e)) for (; r < n.length && !/^end\s*note$/i.test(n[r++]););
+		}
+		return f;
+	};
+	return u([], /^\u0000$/), t.g;
+}
+function We(e, t) {
+	let n = [], r;
+	for (let i = 0; i < e.length; i++) {
+		let a = e[i], o = /^([*+\-#]+)(_)?\s*(?:\[#[\w]+\])?\s*(.*)$/.exec(a);
+		if (!o) continue;
+		let s = o[3];
+		if (s.startsWith(":")) {
+			for (s = s.slice(1); !/;\s*$/.test(s) && i + 1 < e.length;) s += "\n" + e[++i];
+			s = s.replace(/;\s*$/, "");
+		}
+		let c = o[1].length, l = o[1][0] === "-" ? "left" : "right", u = {
+			label: $(s),
+			shape: o[2] ? "none" : void 0,
+			side: t ? void 0 : l,
+			children: []
+		};
+		if (!r) r = u, n.push({
+			depth: c,
+			n: u
+		});
+		else {
+			for (; n.length > 1 && n[n.length - 1].depth >= c;) n.pop();
+			n[n.length - 1].n.children.push(u), n.push({
+				depth: c,
+				n: u
+			});
+		}
+	}
+	if (!r) throw new g("The mind map is empty");
+	let i = (e, t) => e.children.forEach((e) => (t || (e.side = void 0), i(e, !1)));
+	return i(r, !0), r;
+}
+// packages/diagram/src/dom.ts
+async function Ge(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 Ke(e, t) {
+	e.innerHTML = t.join("");
+}
+// packages/plantuml/src/index.ts
+var qe = class extends Error {
+	constructor(e) {
+		super(e), this.name = "DiagramError";
+	}
+};
+function Je(e) {
+	try {
+		return Oe(e).map((e) => ({
+			svg: e.svg,
+			width: e.w,
+			height: e.h
+		}));
+	} catch (e) {
+		throw new qe(e.message);
+	}
+}
+function Ye(e) {
+	return Je(e)[0];
+}
+function Xe(e, t) {
+	let n = Je(t);
+	return Ke(e, n.map((e) => e.svg)), n;
+}
+function Ze(e, t = 2) {
+	return Ge(e, t);
+}
+export { qe as DiagramError, Ye as render, Je as renderEach, Xe as renderTo, Ze as toPng };
+
+//# sourceMappingURL=index.js.map