@p10node/plantuml 0.13.0 → 0.13.1

package/dist/index.js

@@ -127,17 +127,17 @@ function e(e, t, n, r) {
 		}
 		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 = () => {
+	let z = new Float64Array(L), ae = () => R.forEach((e) => e.forEach((e, t) => z[e] = t));
+	ae();
+	let B = new Float64Array(L), V = new Float64Array(a), H = () => {
 		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);
+			V[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]);
+	}, oe = (e, t) => {
+		if (!a) return [...e].sort((e, t) => B[e] - B[t] || z[e] - z[t]);
 		let r = {
 			node: -1,
 			cluster: -1,
@@ -158,7 +158,7 @@ function e(e, t, n, r) {
 		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],
+			key: B[t],
 			idx: z[t],
 			items: []
 		});
@@ -169,8 +169,8 @@ function e(e, t, n, r) {
 				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]);
+			e.cluster >= 0 && (e.key = r ? n / r : B[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) => V[e.cluster] - V[t.cluster]);
 			return i.forEach((t, n) => e.items[t] = a[n]), [n, r];
 		};
 		s(r);
@@ -178,7 +178,7 @@ function e(e, t, n, r) {
 			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) => {
+	}, U = (e) => {
 		let t = 0;
 		for (let n = 0; n + 1 < e.length; n++) {
 			let r = [];
@@ -198,35 +198,35 @@ function e(e, t, n, r) {
 		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 of R) for (let t of e) B[t] = z[t];
+	H(), R = R.map((e, t) => oe(e, t)), ae();
+	let ce = R.map((e) => [...e]), le = U(R);
 	for (let e = 0; e < 24 && le > 0; e++) {
-		ae();
+		H();
 		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);
+			for (let e of R[n]) B[e] = se(e, r);
+			R[n] = oe(R[n], n), R[n].forEach((e, t) => z[e] = t);
 		}
-		let n = oe(R);
+		let n = U(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) => {
+	R = ce, ae();
+	let ue = R.map((e) => e.reduce((e, t) => Math.max(e, C[t]), 0)), W = Array.from({ length: a }, () => []);
+	n.forEach((e, t) => e.parent >= 0 && W[e.parent].push(t));
+	let G = (e) => n[e].pad[2] + Math.max(0, ...W[e].filter((t) => P[t] === P[e]).map(G)), de = (e) => n[e].pad[3] + Math.max(0, ...W[e].filter((t) => F[t] === F[e]).map(de)), fe = Array(y + 1).fill(0), K = Array(y + 1).fill(0);
+	for (let e = 0; e < a; e++) P[e] > F[e] || (fe[P[e]] = Math.max(fe[P[e]], G(e)), K[F[e]] = Math.max(K[F[e]], de(e)));
+	let q = [];
+	for (let e = 0; e <= y; e++) q[e] = e === 0 ? ue[0] / 2 + fe[0] : q[e - 1] + ue[e - 1] / 2 + K[e - 1] + r.ranksep + fe[e] + ue[e] / 2;
+	let pe = q[y] + ue[y] / 2 + K[y], me = (e) => w[e] === 2 || w[e] === 3 ? 0 : S[e] / 2, he = (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) => {
+		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), me(e) + me(t) + i;
+	}, J = new Float64Array(L);
+	for (let e of R) for (let t = 1; t < e.length; t++) J[e[t]] = J[e[t - 1]] + he(e[t - 1], e[t]);
+	let ge = (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]);
+		for (let t = 1; t < r; t++) i[t] = i[t - 1] + he(e[t - 1], e[t]);
 		let a = [];
 		for (let e = 0; e < r; e++) for (a.push({
 			s: e,
@@ -238,7 +238,7 @@ function e(e, t, n, r) {
 			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 t of a) for (let n = t.s; n <= t.e; n++) J[e[n]] = t.wt / t.w + i[n];
 	};
 	for (let e = 0; e < 10; e++) {
 		let t = e >= 8, n = e % 2 == 0;
@@ -248,24 +248,24 @@ function e(e, t, n, r) {
 			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;
+					for (let [t, n] of e) r += J[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);
+				(t || n) && s(A[e]), (t || !n) && s(j[e]), s(ie[e]), a.push(i ? r / i : J[e]), o.push(i || .01);
 			}
-			he(i, a, o);
+			ge(i, a, o);
 		}
 	}
-	let X = L, ge = (e) => w[e] === 2 ? X + 2 * O[e] : w[e] === 3 ? X + 2 * O[e] + 1 : e;
+	let _e = L, Y = (e) => w[e] === 2 ? _e + 2 * O[e] : w[e] === 3 ? _e + 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]));
+		for (let e = 0; e < L; e++) t[e] = J[e];
+		for (let e = 0; e < a; e++) t[_e + 2 * e] = Infinity, t[_e + 2 * e + 1] = -Infinity;
+		for (let e = 0; e < L; e++) w[e] === 2 && (t[Y(e)] = Math.min(t[Y(e)], J[e])), w[e] === 3 && (t[Y(e)] = Math.max(t[Y(e)], J[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]));
+		for (let e of R) for (let t = 1; t < e.length; t++) o(Y(e[t - 1]), Y(e[t]), he(e[t - 1], e[t]));
+		for (let e = 0; e < a; e++) P[e] <= F[e] && o(_e + 2 * e, _e + 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);
@@ -274,16 +274,16 @@ function e(e, t, n, r) {
 			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)];
+		if (c === e) for (let e = 0; e < L; e++) J[e] = l[Y(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 ve = Infinity, ye = -Infinity;
+	for (let e = 0; e < L; e++) ve = Math.min(ve, J[e] - me(e)), ye = Math.max(ye, J[e] + me(e) + D[e]);
+	Number.isFinite(ve) || (ve = ye = 0);
+	for (let e = 0; e < L; e++) J[e] -= ve;
+	let X = (e) => ({
+		x: J[e],
+		y: q[E[e]]
+	}), be = /* @__PURE__ */ new Map();
 	{
 		let t = /* @__PURE__ */ new Map(), n = (e, n, r) => {
 			let i = t.get(e);
@@ -294,20 +294,20 @@ function e(e, t, n, 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]]));
+			i && !ne[r] && (e[i[0]]?.spread && n(`${i[0]}:b`, r, J[i[1]]), e[i[i.length - 1]]?.spread && n(`${i[i.length - 1]}:t`, r, J[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));
+			n.forEach((i, a) => be.set(`${e}:${i.i}`, J[t] + (a - (n.length - 1) / 2) * r));
 		}
 	}
-	let ye = f.map((e, n) => {
+	let Z = 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 = {
+			let r = X(e.v), i = X(e.w), a = Math.sign(i.x - r.x) || 1, o = {
 				x: r.x + a * S[e.v] / 2,
 				y: r.y
 			}, s = {
@@ -328,13 +328,13 @@ function e(e, t, n, r) {
 		}
 		let r = M[n];
 		if (!r) return null;
-		let i = [], a = [], o = ve(r[0]);
+		let i = [], a = [], o = X(r[0]);
 		i.push({
-			x: Q.get(`${r[0]}:b:${n}`) ?? o.x,
+			x: be.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;
+			let t = X(r[e]), n = ue[E[r[e]]] / 2;
 			n > .5 ? (i.push({
 				x: t.x,
 				y: t.y - n
@@ -343,9 +343,9 @@ function e(e, t, n, r) {
 				y: t.y + n
 			}), a.push(!1, !0)) : (i.push(t), a.push(!1));
 		}
-		let s = ve(r[r.length - 1]);
+		let s = X(r[r.length - 1]);
 		i.push({
-			x: Q.get(`${r[r.length - 1]}:t:${n}`) ?? s.x,
+			x: be.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);
@@ -377,7 +377,7 @@ function e(e, t, n, r) {
 				]
 			});
 		}
-		let p = N[n] >= 0 ? ve(N[n]) : void 0;
+		let p = N[n] >= 0 ? X(N[n]) : void 0;
 		if (!c[n]) return {
 			start: i[0],
 			segs: f,
@@ -403,11 +403,11 @@ function e(e, t, n, r) {
 			segs: m,
 			label: p
 		};
-	}), be = n.map((e, t) => {
+	}), Q = 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);
+		for (let e = P[t]; e <= F[t]; e++) n = Math.min(n, J[I[t][e]]), r = Math.max(r, J[re[t][e]]);
+		let i = q[P[t]] - ue[P[t]] / 2 - G(t), a = q[F[t]] + ue[F[t]] / 2 + de(t);
 		return {
 			x: n,
 			y: i,
@@ -416,11 +416,11 @@ function e(e, t, n, r) {
 		};
 	});
 	return {
-		nodes: Array.from({ length: i }, (e, t) => ve(t)),
-		edges: ye,
-		clusters: be,
-		w: Z - _e,
-		h: fe
+		nodes: Array.from({ length: i }, (e, t) => X(t)),
+		edges: Z,
+		clusters: Q,
+		w: ye - ve,
+		h: pe
 	};
 }
 // src/core/diagram/svg.ts
@@ -1289,33 +1289,33 @@ function F(t) {
 		ranksep: (o ? 50 : 60) / (b ? 2 : 1),
 		edgesep: 14,
 		sameRank: k
-	}), R = t.title ? 32 : 0, z = F.w, B = F.h, V = (e) => {
+	}), R = t.title ? 32 : 0, z = F.w, ae = F.h, B = (e) => {
 		let t = n === "TB" ? e : n === "BT" ? {
 			x: e.x,
-			y: B - e.y
+			y: ae - e.y
 		} : n === "LR" ? {
 			x: e.y,
 			y: e.x
 		} : {
-			x: B - e.y,
+			x: ae - 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) => {
+	}, V = (o ? z : ae) + 32, H = (o ? ae : z) + 32 + R, oe = (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) {
+	}, U = t.clusters.map((e, t) => t).sort((e, t) => oe(e) - oe(t)), se = t.clusters.map(() => null), ce = [];
+	for (let e of U) {
 		let r = F.clusters[e];
 		if (!r) continue;
-		let a = t.clusters[e], o = V({
+		let a = t.clusters[e], o = B({
 			x: r.x,
 			y: r.y
-		}), c = V({
+		}), c = B({
 			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 ?? {};
@@ -1350,7 +1350,7 @@ function F(t) {
 		}, 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;
+			let c = B(F.nodes[t]), l = _[t], u, d, f, p, h;
 			o ? (u = {
 				x: c.x + l.w / 2,
 				y: c.y - l.h / 4
@@ -1412,12 +1412,12 @@ function F(t) {
 			return;
 		}
 		let l = {
-			start: V(c.start),
+			start: B(c.start),
 			segs: c.segs.map((e) => ({
 				c: e.c,
-				p: e.p.map(V)
+				p: e.p.map(B)
 			})),
-			label: c.label && V(c.label)
+			label: c.label && B(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);
@@ -1481,7 +1481,7 @@ function F(t) {
 	}
 	t.nodes.forEach((e, t) => {
 		if (e.style?.hidden) return;
-		let n = V(F.nodes[t]);
+		let n = B(F.nodes[t]);
 		O(s, e, _[t], n.x, n.y);
 	});
 	for (let e of le) {
@@ -1495,14 +1495,14 @@ function F(t) {
 			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, {
+	return t.title && (V = Math.max(V, r(t.title, 16, !0) + 32), s.text(V / 2, 27, t.title, {
 		anchor: "middle",
 		size: 16,
 		bold: !0
 	})), {
-		svg: s.toString(H, ae),
-		w: Math.ceil(H),
-		h: Math.ceil(ae)
+		svg: s.toString(V, H),
+		w: Math.ceil(V),
+		h: Math.ceil(H)
 	};
 }
 var I = (e, t) => ({
@@ -1549,8 +1549,12 @@ function L(e, t, n) {
 	}, ...i.slice(a)];
 	return n ? d : d.reverse();
 }
-// src/core/diagram/dot.ts
+// src/core/dict.ts
 function R(e) {
+	return Object.assign(Object.create(null), e);
+}
+// src/core/diagram/dot.ts
+function z(e) {
 	let t = [], n = e.length, r = 0, i = !0;
 	for (; r < n;) {
 		let a = e[r];
@@ -1614,7 +1618,7 @@ function R(e) {
 	}
 	return t;
 }
-var z = {
+var ae = R({
 	box: "rect",
 	rect: "rect",
 	rectangle: "rect",
@@ -1658,7 +1662,7 @@ var z = {
 	record: "rect",
 	mrecord: "round",
 	underlinebox: "rect"
-}, B = {
+}), B = R({
 	normal: "arrow",
 	inv: "arrow",
 	empty: "triangle",
@@ -1682,7 +1686,7 @@ var z = {
 	tee: "one",
 	curve: "open",
 	icurve: "open"
-};
+});
 function V(e, t) {
 	if (!e) return t;
 	let n = e.toLowerCase().replace(/^[lr](?=[a-z])/, "");
@@ -1713,17 +1717,17 @@ function H(e) {
 	}
 	return l(/^[a-z]+\d+$/.test(r) ? r.replace(/\d+$/, "") : r);
 }
-function ae(e) {
+function oe(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) {
+function se(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 = [];
+function ce(e) {
+	let t = z(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++;
@@ -1832,28 +1836,28 @@ function se(e) {
 			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) ?? {});
+		l.g.dir = C, m.label && (l.g.title = m.label.startsWith("<") ? oe(m.label.slice(1, -1)) : U(m.label, "", c));
+		for (let e of l.g.nodes) le(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) : "";
+			e.label = t.label ? t.label.startsWith("<") ? oe(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));
+		for (let { e: t, attrs: n } of d) l.g.edges.push(ue(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) {
+function le(e, t) {
 	let n = (t.shape ?? "ellipse").toLowerCase();
-	e.shape = z[n] ?? "ellipse";
+	e.shape = ae[n] ?? "ellipse";
 	let r = t.label;
 	if (r !== void 0) {
-		if (r.startsWith("<") && r.endsWith(">")) e.label = ae(r.slice(1, -1));
+		if (r.startsWith("<") && r.endsWith(">")) e.label = oe(r.slice(1, -1));
 		else if (n === "record" || n === "mrecord") {
-			let t = oe(r, e.id);
+			let t = se(r, e.id);
 			e.label = t.join("\n"), t.length > 1 && (e.sections = t.map((e) => ({
 				rows: [[e]],
 				center: !0
@@ -1864,15 +1868,15 @@ function ce(e, t) {
 	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) {
+function ue(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;
+	return s && (e.label = s.startsWith("<") && s.endsWith(">") ? oe(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) {
+function de(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) => ({
@@ -1907,7 +1911,7 @@ function ue(e) {
 	});
 	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;
+		let a = e.showData ? `${t.label} [${fe(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;
@@ -1921,8 +1925,8 @@ function ue(e) {
 		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) {
+var fe = (e) => String(Number.isInteger(e) ? e : Math.round(e * 100) / 100), K = 36e5, q = 24 * K, pe = (e) => String(e).padStart(2, "0");
+function me(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 = [
@@ -1939,7 +1943,7 @@ function fe(e) {
 		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())}`;
+		return v < q ? `${pe(t.getUTCHours())}:${pe(t.getUTCMinutes())}` : v >= 365 * q ? String(t.getUTCFullYear()) : v >= 30 * q ? `${t.getUTCFullYear()}-${pe(t.getUTCMonth() + 1)}` : `${t.getUTCFullYear()}-${pe(t.getUTCMonth() + 1)}-${pe(t.getUTCDate())}`;
 	}, x = m + t.length * 28 + 4;
 	for (let e = y; e <= i; e += v) {
 		let t = h(e);
@@ -2001,8 +2005,8 @@ function fe(e) {
 		h: Math.ceil(_)
 	};
 }
-var pe = 44, me = 12;
-function Y(e, t) {
+var he = 44, J = 12;
+function ge(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 {
@@ -2012,7 +2016,7 @@ function Y(e, t) {
 			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);
+		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) * J);
 		return {
 			n: e,
 			w: r.w,
@@ -2033,13 +2037,13 @@ function Y(e, t) {
 	} 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;
+		let i = n + (e.span - (e.kids.reduce((e, t) => e + t.span, 0) + Math.max(0, e.kids.length - 1) * J)) / 2;
+		for (let n of e.kids) f(n, t + r * (e.w / 2 + he + n.w / 2), i, r), i += n.span + J;
 		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;
+	}, h = (e) => e.reduce((e, t) => e + t.span, 0) + Math.max(0, e.length - 1) * J, 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 + he + e.w / 2, y, 1), y += e.span + J;
 	y = (v - _) / 2;
-	for (let e of d) f(e, -(c.w / 2 + pe + e.w / 2), y, -1), y += e.span + me;
+	for (let e of d) f(e, -(c.w / 2 + he + e.w / 2), y, -1), y += e.span + J;
 	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);
@@ -2079,7 +2083,7 @@ function Y(e, t) {
 		});
 	}
 	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;
+		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 : _e(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
@@ -2131,7 +2135,7 @@ function Y(e, t) {
 		h: Math.ceil(j)
 	};
 }
-function he(e) {
+function _e(e) {
 	let t = /^#([0-9a-f]{2})([0-9a-f]{2})([0-9a-f]{2})$/i.exec(e);
 	return t ? "#" + [
 		t[1],
@@ -2140,7 +2144,7 @@ function he(e) {
 	].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 {
+var Y = (e) => Math.round(e * 100) / 100, ve = class {
 	s = {
 		participants: [],
 		events: []
@@ -2162,9 +2166,9 @@ var X = (e) => Math.round(e * 100) / 100, ge = class {
 	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);
+}, ye = 14, X = 13, be = i(X), Z = 16, Q = (e) => e ? e.split("\n") : [];
+function xe(e) {
+	let t = Q(e.label), n = a(t, ye);
 	switch (e.kind) {
 		case "actor": return {
 			w: Math.max(44, n.w + 8),
@@ -2190,7 +2194,7 @@ function be(e) {
 		};
 	}
 }
-function xe(e, t, n, r, a) {
+function Se(e, t, n, r, a) {
 	let o = t.fill ?? u.fill, s = {
 		fill: o,
 		stroke: u.stroke,
@@ -2199,7 +2203,7 @@ function xe(e, t, n, r, a) {
 		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;
+	}, l = (t) => e.text(r, t + n.text.length * i(ye) / 2, n.text, { anchor: "middle" }), d = r - n.w / 2;
 	switch (t.kind) {
 		case "actor":
 			e.circle(r, a + 8, 7, {
@@ -2222,7 +2226,7 @@ function xe(e, t, n, r, a) {
 			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)}`, {
+			e.path(`M${Y(d)} ${Y(a + 6)} A${Y(t / 2)} 6 0 0 1 ${Y(d + t)} ${Y(a + 6)} L${Y(d + t)} ${Y(a + i - 6)} A${Y(t / 2)} 6 0 0 1 ${Y(d)} ${Y(a + i - 6)} Z`, s), e.path(`M${Y(d)} ${Y(a + 6)} A${Y(t / 2)} 6 0 0 0 ${Y(d + t)} ${Y(a + 6)}`, {
 				...s,
 				fill: "none"
 			}), e.text(r, a + i / 2 + 3, n.text, { anchor: "middle" });
@@ -2238,7 +2242,7 @@ function xe(e, t, n, r, a) {
 	}
 	e.text(r, a + n.h / 2, n.text, { anchor: "middle" });
 }
-function Se(e, t, n, r, i) {
+function Ce(e, t, n, r, i) {
 	let a = u.line;
 	switch (t) {
 		case "filled":
@@ -2277,11 +2281,11 @@ function Se(e, t, n, r, i) {
 		});
 	}
 }
-function Ce(e) {
+function we(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);
+	let n = new Map(t.map((e, t) => [e.id, t])), i = t.map(xe), 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;
@@ -2293,10 +2297,10 @@ function Ce(e) {
 	}, 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);
+		let e = n.get(t.from), a = n.get(t.to), s = Math.max(0, ...Q(t.text).map((e) => r(e, X))) + 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);
+		let e = a(Q(t.text), X).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 = [], _ = (() => {
@@ -2304,9 +2308,9 @@ function Ce(e) {
 		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);
+	h[0] = Z + 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) => {
+	let y = h[o - 1] + Math.max(i[o - 1].w / 2, l + i[o - 1].w / 2, v + 10) + Z, b = Z + (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;
@@ -2324,7 +2328,7 @@ function Ce(e) {
 	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 = {
+			let i = n.get(t.from), a = n.get(t.to), o = Q(t.text), s = o.length * be, c = {
 				stroke: u.line,
 				sw: 1.4,
 				dash: t.dashed ? "6 4" : void 0
@@ -2337,17 +2341,17 @@ function Ce(e) {
 					[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;
+				], c, !1), Ce(w, t.head, n, S + 20, -1), T.text(n + 6 + l, S - 4 - s / 2, o, { size: X }), e.autonumber && Te(T, n, S, m), j(h[i] - 10, n + 34 + 6 + l + Math.max(...o.map((e) => r(e, X)))), 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, {
+			w.line(p, S, g, S, c), Ce(w, t.head, g, S, d), t.both && Ce(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;
+				size: X
+			}), e.autonumber && Te(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": {
@@ -2356,7 +2360,7 @@ function Ce(e) {
 			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;
+			let e = t.who.map((e) => n.get(e)), r = Math.min(...e), i = Math.max(...e), o = Q(t.text), s = a(o, X), 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([
@@ -2369,7 +2373,7 @@ function Ce(e) {
 				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;
+			}), T.text(d + 10, S + l / 2, o, { size: X }), j(d, d + c), S += l + 8;
 			break;
 		}
 		case "block": {
@@ -2405,28 +2409,28 @@ function Ce(e) {
 		}
 		case "divider": {
 			S += 16;
-			let e = a(ye(t.text), Z);
-			T.line(Q / 2, S - 2, y - Q / 2, S - 2, {
+			let e = a(Q(t.text), X);
+			T.line(Z / 2, S - 2, y - Z / 2, S - 2, {
 				stroke: u.muted,
 				sw: 1
-			}).line(Q / 2, S + 2, y - Q / 2, S + 2, {
+			}).line(Z / 2, S + 2, y - Z / 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), {
+			}, 3), T.text(y / 2, S, Q(t.text), {
 				anchor: "middle",
-				size: Z,
+				size: X,
 				bold: !0
 			})), S += 22;
 			break;
 		}
 		case "delay":
-			S += 14, t.text && T.text(y / 2, S, ye(t.text), {
+			S += 14, t.text && T.text(y / 2, S, Q(t.text), {
 				anchor: "middle",
-				size: Z,
+				size: X,
 				italic: !0,
 				color: u.muted
 			}), S += 18;
@@ -2449,7 +2453,7 @@ function Ce(e) {
 	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;
+	let N = e.footer !== !1, ne = S + (N ? x : 0) + Z;
 	for (let e of O) {
 		let t = 12 + (_ - e.depth) * 8;
 		e.lo > e.hi && (e.lo = h[0], e.hi = h[o - 1]);
@@ -2506,7 +2510,7 @@ function Ce(e) {
 		});
 	}
 	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);
+		Se(P, e, i[t], h[t], b + x - i[t].h), N && !A.has(t) && Se(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,
@@ -2517,7 +2521,7 @@ function Ce(e) {
 		h: Math.ceil(ne)
 	};
 }
-function we(e, t, n, i) {
+function Te(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",
@@ -2527,17 +2531,17 @@ function we(e, t, n, i) {
 	});
 }
 // src/core/diagram/model.ts
-function Te(e) {
+function Ee(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);
+		case "sequence": return we(e.seq);
+		case "pie": return de(e.pie);
+		case "gantt": return me(e.gantt);
+		case "tree": return ge(e.root, e.title);
 	}
 }
 // src/core/diagram/plantuml.ts
-function Ee(e) {
+function De(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(),
@@ -2548,52 +2552,52 @@ function Ee(e) {
 		lines: t.split("\n")
 	}), n;
 }
-function De(e) {
-	return Ee(e).map(({ kind: e, lines: t }) => ke(e, t));
+function Oe(e) {
+	return De(e).map(({ kind: e, lines: t }) => Ae(e, t));
 }
-var Oe = (e) => De(e).map(Te);
-function ke(e, t) {
+var ke = (e) => Oe(e).map(Ee);
+function Ae(e, t) {
 	if (e === "dot") return {
 		t: "graph",
-		graph: se(t.join("\n"))[0]
+		graph: ce(t.join("\n"))[0]
 	};
-	let { lines: n, title: r, dir: i } = Ae(t);
+	let { lines: n, title: r, dir: i } = je(t);
 	switch (e) {
 		case "uml": break;
 		case "mindmap":
 		case "wbs": return {
 			t: "tree",
-			root: We(n, e === "wbs"),
+			root: Ge(n, e === "wbs"),
 			title: r
 		};
 		default: throw new g(`PlantUML @start${e} diagrams are not supported yet`);
 	}
-	switch (je(n)) {
+	switch (Me(n)) {
 		case "activity": return {
 			t: "graph",
 			graph: {
-				...Ue(n),
+				...We(n),
 				title: r
 			}
 		};
 		case "sequence": return {
 			t: "sequence",
 			seq: {
-				...Ne(n),
+				...Pe(n),
 				title: r
 			}
 		};
 		case "state": return {
 			t: "graph",
 			graph: {
-				...He(n, i),
+				...Ue(n, i),
 				title: r
 			}
 		};
 		default: return {
 			t: "graph",
 			graph: {
-				...Ve(n, i),
+				...He(n, i),
 				title: r
 			}
 		};
@@ -2602,7 +2606,7 @@ function ke(e, t) {
 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) {
+function je(e) {
 	let t = [], n, r, i = null, a = null, o = !1;
 	for (let s of e) {
 		if (o) {
@@ -2632,11 +2636,11 @@ function Ae(e) {
 		dir: r
 	};
 }
-function je(e) {
+function Me(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 = {
+var Ne = R({
 	participant: "participant",
 	actor: "actor",
 	boundary: "boundary",
@@ -2645,9 +2649,9 @@ var Me = {
 	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");
+});
+function Pe(e) {
+	let t = new ve(), 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({
@@ -2664,7 +2668,7 @@ function Ne(e) {
 			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()],
+				kind: Ne[e[1].toLowerCase()],
 				label: $(a),
 				fill: r ? l(r[1].slice(1)) ?? l(r[1]) : void 0
 			});
@@ -2771,7 +2775,7 @@ function Ne(e) {
 			});
 			continue;
 		}
-		let c = Fe(s);
+		let c = Ie(s);
 		if (c) {
 			let { from: e, to: r, dashed: i, head: o, both: s, act: l, text: u } = c;
 			t.push({
@@ -2798,9 +2802,9 @@ function Ne(e) {
 	}
 	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 "));
+var Fe = /^(\[|\]|[\w.$À-￿]+|"[^"]+")?\s*(<<?|[\\/]{1,2})?(-{1,2}|\.{1,2})(?:\[[^\]]*\])?(-?)(>>?|[\\/]{1,2})?\s*([ox])?\s*(\[|\]|[\w.$À-￿]+|"[^"]+")?\s*(\+\+|--|\*\*|!!)?\s*(?::\s*(.*))?$/u;
+function Ie(e) {
+	let t = Fe.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;
@@ -2817,7 +2821,7 @@ function Fe(e) {
 		text: $(c ?? "")
 	};
 }
-var Ie = {
+var Le = R({
 	actor: "actor",
 	person: "actor",
 	usecase: "ellipse",
@@ -2855,7 +2859,7 @@ var Ie = {
 	json: "rect",
 	diamond: "diamond",
 	state: "round"
-}, Le = /* @__PURE__ */ new Set([
+}), Re = /* @__PURE__ */ new Set([
 	"class",
 	"abstract",
 	"abstract class",
@@ -2871,7 +2875,7 @@ var Ie = {
 	"object",
 	"map",
 	"json"
-]), Re = {
+]), ze = R({
 	">": "arrow",
 	"<": "arrow",
 	"|>": "triangle",
@@ -2893,8 +2897,8 @@ var Ie = {
 	"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) {
+}), Be = String.raw`\[\*\]|\[[^\]]+\]|\([^)]*\)|:[^:]+:|"[^"]+"|\(\)\s*"[^"]+"|\(\)\s*[\w.]+|[\w.$À-￿-]+`, Ve = new RegExp(String.raw`^(${Be})\s*(?:"([^"]*)"\s*)?((?:<\||<<|\}o|\}\||\|o|\|\||[<*o#x+^}])?)([-.=~]+)(?:\[([^\]]*)\])?((?:up|down|left|right|u|d|l|r|le|ri|do)?)([-.=~]*)(?:\[([^\]]*)\])?((?:\|>|>>|o\{|\|\{|o\||\|\||[>*#+^{]|[ox](?=\s|\[|\(|"|:|$))?)\s*(?:"([^"]*)"\s*)?(${Be})\s*(?::\s*(.*))?$`, "u");
+function He(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);
@@ -2962,7 +2966,7 @@ function Ve(e, t) {
 				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+/, " "))) {
+		} 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)) && Re.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,
@@ -2989,7 +2993,7 @@ function Ve(e, t) {
 				/^["([:]/.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, {
+			let u = t === "usecase" ? "ellipse" : t === "actor" ? "actor" : Le[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;
@@ -3006,8 +3010,8 @@ function Ve(e, t) {
 					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;
+		} else if (e = Ve.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 ? ze[i] ?? "none" : "none", _ = c ? ze[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,
@@ -3055,7 +3059,7 @@ function Ve(e, t) {
 	}
 	return n.g;
 }
-function He(e, t) {
+function Ue(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 === "[*]") {
@@ -3142,7 +3146,7 @@ function He(e, t) {
 	}
 	return n.g;
 }
-function Ue(e) {
+function We(e) {
 	let t = new _("TB", "round"), n = [];
 	for (let t = 0; t < e.length; t++) {
 		let r = e[t];
@@ -3282,7 +3286,7 @@ function Ue(e) {
 	};
 	return u([], /^\u0000$/), t.g;
 }
-function We(e, t) {
+function Ge(e, t) {
 	let n = [], r;
 	for (let i = 0; i < e.length; i++) {
 		let a = e[i], o = /^([*+\-#]+)(_)?\s*(?:\[#[\w]+\])?\s*(.*)$/.exec(a);
@@ -3315,7 +3319,7 @@ function We(e, t) {
 	return i(r, !0), r;
 }
 // packages/diagram/src/dom.ts
-async function Ge(e, t = 2) {
+async function Ke(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();
@@ -3326,36 +3330,36 @@ async function Ge(e, t = 2) {
 	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) {
+function qe(e, t) {
 	e.innerHTML = t.join("");
 }
 // packages/plantuml/src/index.ts
-var qe = class extends Error {
+var Je = class extends Error {
 	constructor(e) {
 		super(e), this.name = "DiagramError";
 	}
 };
-function Je(e) {
+function Ye(e) {
 	try {
-		return Oe(e).map((e) => ({
+		return ke(e).map((e) => ({
 			svg: e.svg,
 			width: e.w,
 			height: e.h
 		}));
 	} catch (e) {
-		throw new qe(e.message);
+		throw new Je(e.message);
 	}
 }
-function Ye(e) {
-	return Je(e)[0];
+function Xe(e) {
+	return Ye(e)[0];
 }
-function Xe(e, t) {
-	let n = Je(t);
-	return Ke(e, n.map((e) => e.svg)), n;
+function Ze(e, t) {
+	let n = Ye(t);
+	return qe(e, n.map((e) => e.svg)), n;
 }
-function Ze(e, t = 2) {
-	return Ge(e, t);
+function Qe(e, t = 2) {
+	return Ke(e, t);
 }
-export { qe as DiagramError, Ye as render, Je as renderEach, Xe as renderTo, Ze as toPng };
+export { Je as DiagramError, Xe as render, Ye as renderEach, Ze as renderTo, Qe as toPng };
 
 //# sourceMappingURL=index.js.map