@draftably/mermaid 0.2.2 → 0.2.3

package/dist/cdn/{mermaid-importer-CsurIKv3.mjs → mermaid-importer-Df5wAzZF.mjs}

@@ -29,14 +29,14 @@ const _o = {
   sans: "Inter, Arial, sans-serif",
   serif: "'Source Serif 4', Georgia, serif",
   mono: "'JetBrains Mono', Menlo, Consolas, monospace"
-}, Vn = (e, t) => e === "serif" ? "serif-600" : e === "mono" ? "mono-500" : t ? "sans-600" : "sans-500", Ro = (e) => `'${Qn[Vn(e, !0)].family}', ${To[e]}`;
+}, Vn = (e, t) => e === "serif" ? "serif-600" : e === "mono" ? "mono-500" : t ? "sans-600" : "sans-500", Lo = (e) => `'${Qn[Vn(e, !0)].family}', ${To[e]}`;
 function ct(e, t, s, n) {
   const o = Vn(e, t);
-  return { role: e, face: o, family: Ro(e), weight: Qn[o].weight, size: s, lineHeight: n };
+  return { role: e, face: o, family: Lo(e), weight: Qn[o].weight, size: s, lineHeight: n };
 }
-const Lo = _o;
+const Ro = _o;
 function ye(e, t) {
-  const s = Lo[t.face];
+  const s = Ro[t.face];
   let n = 0;
   for (const o of e) n += s.advances[o] ?? s.fallback;
   return n * t.size / s.unitsPerEm;
@@ -109,10 +109,10 @@ function Do(e, t, s, n) {
       }
   }
   if (!Number.isFinite(w[t][o.length])) return;
-  const u = [];
+  const p = [];
   for (let a = t, i = o.length; a > 0; i = l[a][i], a--)
-    u.unshift(e.slice(l[a][i], i).join(" "));
-  return u;
+    p.unshift(e.slice(l[a][i], i).join(" "));
+  return p;
 }
 function it(e, t, s, n = !1) {
   const o = [];
@@ -125,7 +125,7 @@ function it(e, t, s, n = !1) {
   }
   return o.length ? o : [""];
 }
-const ln = ["drafting", "fieldnotes", "signal", "ink", "blueprint"], It = "drafting", Gt = [50, 100, 200, 300, 400, 500, 600, 700, 800, 900, 950], Ve = 500, No = (e) => Ze[e]?.dark ? 950 : 50, Po = (e) => Ze[e]?.dark ? 900 : 100, Ht = [
+const ln = ["drafting", "fieldnotes", "signal", "ink", "blueprint"], It = "drafting", Gt = [50, 100, 200, 300, 400, 500, 600, 700, 800, 900, 950], Ve = 500, No = (e) => Ze[e]?.dark ? 950 : 50, Fo = (e) => Ze[e]?.dark ? 900 : 100, Ht = [
   "primary",
   "secondary",
   "slate",
@@ -148,7 +148,7 @@ const ln = ["drafting", "fieldnotes", "signal", "ink", "blueprint"], It = "draft
   paddingX: { min: 4, max: 48 },
   paddingY: { min: 4, max: 48 },
   radius: { min: 0, max: 24 }
-}, Fo = /^#(?:[0-9a-f]{3}|[0-9a-f]{6})$/i, Ze = {
+}, Po = /^#(?:[0-9a-f]{3}|[0-9a-f]{6})$/i, Ze = {
   drafting: {
     label: "Drafting",
     description: "Navy ink on cool paper, with drafting blue and marker gold",
@@ -253,6 +253,32 @@ const ln = ["drafting", "fieldnotes", "signal", "ink", "blueprint"], It = "draft
     primary: ["#2B3A55", 900],
     secondary: ["#C23B22", 600]
   },
+  // The default theme on a dark page: the same type, spacing and families as drafting, so it
+  // draws every box in the same place. Graphite surfaces, lighter than the canvas the higher
+  // they sit, with drafting blue and marker gold lifted to read on them. Not a file's theme.
+  "drafting-dark": {
+    label: "Drafting dark",
+    description: "Drafting on a graphite page, for a dark host",
+    dark: !0,
+    canvas: "#16191E",
+    text: "#E7EAEF",
+    muted: "#9BA3B0",
+    connection: "#AEB6C2",
+    node: { fill: "#21252C", stroke: "#3D4450", ink: "#E7EAEF" },
+    group: { fill: "#1B1F25", stroke: "#30363F", ink: "#C8CED8" },
+    paddingX: 12,
+    paddingY: 20,
+    radius: 4,
+    shadow: !1,
+    titleFont: "sans",
+    annotationFont: "sans",
+    titleSize: 13,
+    titleLine: 16,
+    annotationSize: 11,
+    chroma: 0.9,
+    primary: ["#7FA4E6", 300],
+    secondary: ["#F0B43C", 400]
+  },
   blueprint: {
     label: "Blueprint",
     description: "White lines on blueprint blue, cyan and yellow, monospace titles",
@@ -305,11 +331,11 @@ function Yt(e) {
   const [t, s, n] = to(e).map(eo);
   return 0.2126 * t + 0.7152 * s + 0.0722 * n;
 }
-function Rt(e, t) {
+function Lt(e, t) {
   const [s, n] = [Yt(e), Yt(t)].sort((o, r) => r - o);
   return (s + 0.05) / (n + 0.05);
 }
-const un = {
+const pn = {
   50: 0.975,
   100: 0.945,
   200: 0.9,
@@ -332,7 +358,7 @@ const un = {
   connection: 4.5,
   /** A group's frame against the canvas. */
   frame: 2
-}, St = (e) => Math.max(0.18, 1 - ((e - 0.6) / 0.42) ** 2), Uo = {
+}, St = (e) => Math.max(0.18, 1 - ((e - 0.6) / 0.42) ** 2), zo = {
   slate: [255, 0.03],
   stone: [70, 0.02],
   blue: [258, 0.14],
@@ -345,31 +371,31 @@ const un = {
   red: [32, 0.17],
   rose: [358, 0.12],
   violet: [305, 0.13]
-}, zo = (e) => lt([0.24, 0.035, e]), qo = "#FFFFFF";
+}, Uo = (e) => lt([0.24, 0.035, e]), qo = "#FFFFFF";
 function Ye(e, t, s) {
-  if (Rt(e, t) >= s) return e;
+  if (Lt(e, t) >= s) return e;
   const [n, o, r] = on(e), d = Yt(t) > 0.18 ? -0.01 : 0.01;
   let h = e;
-  for (let c = n; c > 0 && c < 1 && Rt(h, t) < s; c += d)
+  for (let c = n; c > 0 && c < 1 && Lt(h, t) < s; c += d)
     h = lt([c, o, r]);
   return h;
 }
-function pn(e, t, s, n, o, r, d) {
-  const h = Bo(e, n), c = h ? zo(n) : qo, y = sn(e) ? Ne.paleInk : Ne.darkInk;
+function un(e, t, s, n, o, r, d) {
+  const h = Bo(e, n), c = h ? Uo(n) : qo, y = sn(e) ? Ne.paleInk : Ne.darkInk;
   let w = d ? on(d)[0] : t, l = d ?? lt([w, s * St(w), n]);
-  for (; Rt(l, c) < y && w > 0.05 && w < 0.995; )
+  for (; Lt(l, c) < y && w > 0.05 && w < 0.995; )
     w += h ? 5e-3 : -0.01, l = lt([w, s * St(w), n]);
-  const u = h ? w - 0.2 : r ? w + 0.14 : w - 0.08;
-  let a = lt([u, s * St(u) * 1.1, n]);
-  return Rt(l, o) < Ne.outline && (a = Ye(a, o, Ne.outline)), { swatch: { fill: l, stroke: a, ink: c }, L: w };
+  const p = h ? w - 0.2 : r ? w + 0.14 : w - 0.08;
+  let a = lt([p, s * St(p) * 1.1, n]);
+  return Lt(l, o) < Ne.outline && (a = Ye(a, o, Ne.outline)), { swatch: { fill: l, stroke: a, ink: c }, L: w };
 }
 const Go = 0.055;
 function oo(e, t, s, n, o) {
   const r = /* @__PURE__ */ new Map();
   let d = 1;
   for (const h of Gt) {
-    const c = no(e) ? jo(h, e) : void 0, y = sn(h) ? un[h] : Math.min(c ?? un[h], d - Go);
-    let w = pn(
+    const c = no(e) ? jo(h, e) : void 0, y = sn(h) ? pn[h] : Math.min(c ?? pn[h], d - Go);
+    let w = un(
       h,
       y,
       t,
@@ -378,7 +404,7 @@ function oo(e, t, s, n, o) {
       n,
       o?.[1] === h ? o[0] : void 0
     );
-    w.L >= d - 0.01 && (w = pn(h, y, t, e, s, n)), d = w.L, r.set(h, w.swatch);
+    w.L >= d - 0.01 && (w = un(h, y, t, e, s, n)), d = w.L, r.set(h, w.swatch);
   }
   return r;
 }
@@ -396,7 +422,7 @@ function Ho(e, t = Ze[e].canvas) {
       ["primary", gn(o.primary, t, o.dark)],
       ["secondary", gn(o.secondary, t, o.dark)]
     ]);
-    for (const [r, d] of Object.entries(Uo)) {
+    for (const [r, d] of Object.entries(zo)) {
       const [h, c] = o.hues?.[r] ?? d;
       n.set(r, oo(h, c * o.chroma, t, o.dark));
     }
@@ -405,7 +431,7 @@ function Ho(e, t = Ze[e].canvas) {
   return n;
 }
 const Yo = (e) => Math.round(e + 32), xt = /* @__PURE__ */ new Map();
-function ut(e) {
+function pt(e) {
   const t = e ?? Jn(), s = JSON.stringify(t), n = xt.get(s);
   if (n) return n;
   const o = Ze[t.theme] ?? Ze[It], r = t.overrides, d = r.titleFont ?? o.titleFont, h = r.annotationFont ?? o.annotationFont, c = r.canvas ?? o.canvas, y = new Map(
@@ -420,7 +446,7 @@ function ut(e) {
       ink: a.ink ?? g.ink
     });
   }
-  const l = ct(d, !0, o.titleSize, o.titleLine), u = {
+  const l = ct(d, !0, o.titleSize, o.titleLine), p = {
     theme: t.theme,
     dark: o.dark,
     // Preset colors are held to the contrast targets against the actual canvas; colors the file
@@ -457,7 +483,7 @@ function ut(e) {
     custom: w,
     strikeRemoved: !!t.config?.strikeRemoved
   };
-  return xt.size > 50 && xt.clear(), xt.set(s, u), u;
+  return xt.size > 50 && xt.clear(), xt.set(s, p), p;
 }
 function wn(e, t = 0) {
   if (!e.length) return { x: 70, y: 160, w: 240, h: 160 };
@@ -466,7 +492,7 @@ function wn(e, t = 0) {
     s = Math.min(s, d.x), n = Math.min(n, d.y), o = Math.max(o, d.x + d.w), r = Math.max(r, d.y + d.h);
   return { x: s - t, y: n - t, w: o - s + t * 2, h: r - n + t * 2 };
 }
-const Se = 24, Wo = 48, Xt = 97, dt = 10, Lt = 18, so = (e, t = Wo) => ({
+const Se = 24, Wo = 48, Xt = 97, dt = 10, Rt = 18, so = (e, t = Wo) => ({
   x: e.x + Se,
   y: e.y + t
 }), Xo = 48;
@@ -485,7 +511,7 @@ function Ot(e, t, s, n, o = !1) {
 function Ko(e, t, s, n) {
   return e === "circle" ? Math.max(s, Math.ceil(t / 0.7)) : e === "text" ? t + 2 * Math.min(n.paddingY, 11) : t + 2 * n.paddingY;
 }
-function pt(e, t, s) {
+function ut(e, t, s) {
   const n = e.indexOf(`
 `), o = n < 0 ? e : e.slice(0, n), r = it(o, t, s.title, !0).map((d) => ({ text: d, detail: !1 }));
   if (n >= 0)
@@ -498,12 +524,12 @@ function Zo(e, t, s) {
   const n = t - 2 * Vo;
   for (let o = 1; o * s.title.lineHeight < n; o++) {
     const r = n - o * s.title.lineHeight;
-    if (r >= 40 && gt(pt(e, r, s), s) <= o * s.title.lineHeight)
+    if (r >= 40 && gt(ut(e, r, s), s) <= o * s.title.lineHeight)
       return r;
   }
 }
 const yn = 3, _t = (e, t = 1) => e.groupHeader + (t - 1) * e.groupTitle.lineHeight, Jo = 168, ao = (e, t = !1) => t ? { ...e.annotation, size: e.annotation.size + 1.5, lineHeight: e.annotation.lineHeight + 2 } : e.annotation, es = 140, ts = (e, t, s = !1) => it(e, s ? Jo : es, ao(t, s)), We = { out: 36, down: 22, label: 4 };
-function Je(e, t = ut(), s = !1) {
+function Je(e, t = pt(), s = !1) {
   const n = ao(t, s), o = ts(e, t, s), r = Math.max(...o.map((d) => ye(d, n))) + 16;
   return {
     w: Math.round(Math.max(36, r)),
@@ -519,17 +545,17 @@ function Mn(e, t) {
     below: Math.max(We.down, We.down / 2 + n / 2)
   };
 }
-const Ft = 8, xn = 16, Kt = 10, ns = 64, os = 240, Qt = (e) => Math.round(e + 14);
+const Pt = 8, xn = 16, Kt = 10, ns = 64, os = 240, Qt = (e) => Math.round(e + 14);
 function ss(e, t) {
   if (e.size?.height !== void 0) return { w: e.size.width, h: e.size.height };
   if (e.size) {
-    const r = gt(pt(e.label, e.size.width - 2 * t.paddingX, t), t);
+    const r = gt(ut(e.label, e.size.width - 2 * t.paddingX, t), t);
     return {
       w: e.size.width,
       h: Math.max(r + 2 * Math.min(t.paddingY, Kt), e.size.minHeight ?? 0)
     };
   }
-  const s = 2 * t.paddingX, n = Math.min(os, Math.max(ns, Math.ceil(ye(e.label, t.title)) + s)), o = gt(pt(e.label, n - s, t), t);
+  const s = 2 * t.paddingX, n = Math.min(os, Math.max(ns, Math.ceil(ye(e.label, t.title)) + s)), o = gt(ut(e.label, n - s, t), t);
   return { w: n, h: o + 2 * Math.min(t.paddingY, Kt) };
 }
 function is(e, t, s, n = 0) {
@@ -551,8 +577,8 @@ function is(e, t, s, n = 0) {
     const { col: _, span: $ } = h.get(D.id), x = r.get(D.id).w - w.slice(_, _ + $).reduce((E, v) => E + v, 0);
     x > 0 && (w[_ + $ - 1] += x);
   }
-  const u = n - w.reduce((D, _) => D + _, 0);
-  u > 0 && (w[d - 1] += u);
+  const p = n - w.reduce((D, _) => D + _, 0);
+  p > 0 && (w[d - 1] += p);
   const a = [0], i = [0];
   for (const D of w) a.push(a.at(-1) + D);
   for (const D of l) i.push(i.at(-1) + D);
@@ -564,10 +590,10 @@ function is(e, t, s, n = 0) {
   const k = Qt(s.groupTitle.lineHeight), S = d > 1 || t.direction === "right";
   return e.forEach((D, _) => {
     if (!D.marker) return;
-    const $ = e.slice(_ + 1).find((v) => !v.marker), x = $ ? M.get($.id) : void 0, E = Ft / 2;
+    const $ = e.slice(_ + 1).find((v) => !v.marker), x = $ ? M.get($.id) : void 0, E = Pt / 2;
     M.set(
       D.id,
-      S ? { x: (x?.x ?? g) - E, y: -k, w: Ft, h: f + k + xn } : { x: 0, y: (x?.y ?? f) - E, w: g + xn, h: Ft }
+      S ? { x: (x?.x ?? g) - E, y: -k, w: Pt, h: f + k + xn } : { x: 0, y: (x?.y ?? f) - E, w: g + xn, h: Pt }
     );
   }), { boxes: M, w: g, h: f };
 }
@@ -589,10 +615,10 @@ function cs(e, t, s) {
   const y = c ? h + 1 : h, w = (f) => d.get(f).reduce((M, k) => k.span > M.span ? k : M), l = Math.max(
     0,
     ...e.map((f) => {
-      const M = pt(f.label, Math.max(8, w(f.id).span * o - r), s);
+      const M = ut(f.label, Math.max(8, w(f.id).span * o - r), s);
       return gt(M, s) + 2 * Math.min(s.paddingY, Kt);
     })
-  ), u = (f) => ({
+  ), p = (f) => ({
     x: f.col * o,
     y: f.row * l,
     w: f.span * o,
@@ -600,7 +626,7 @@ function cs(e, t, s) {
   }), a = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
   for (const f of e) {
     const M = w(f.id), k = d.get(f.id).filter((S) => S !== M);
-    a.set(f.id, u(M)), k.length && i.set(f.id, k.map(u));
+    a.set(f.id, p(M)), k.length && i.set(f.id, k.map(p));
   }
   const g = t.ruler ? Math.round(s.annotation.lineHeight + 6) : 0;
   return {
@@ -638,25 +664,25 @@ function ds(e, t, s) {
   return it(n, t, s).map((c) => {
     for (; d < n.length && h(d); ) d++;
     const y = [];
-    for (const u of c)
-      if (u === " " && h(d)) {
+    for (const p of c)
+      if (p === " " && h(d)) {
         const a = o[d - 1];
         for (; d < n.length && h(d); ) d++;
         y.push(a && a === o[d] ? a : void 0);
       } else y.push(o[d++]);
     const w = [];
-    y.forEach((u, a) => {
+    y.forEach((p, a) => {
       const i = w.at(-1);
-      i && i.href === u ? i.text += c[a] : w.push({ text: c[a], href: u, x: 0, w: 0 });
+      i && i.href === p ? i.text += c[a] : w.push({ text: c[a], href: p, x: 0, w: 0 });
     });
     let l = 0;
-    for (const u of w)
-      u.x = l, u.w = ye(u.text, s), l += u.w;
+    for (const p of w)
+      p.x = l, p.w = ye(p.text, s), l += p.w;
     return w.length ? w : [{ text: "", x: 0, w: 0 }];
   });
 }
-const fs = ["below", "above", "left", "right"], ro = 280, co = { x: 12, y: 8 }, bn = co.x, hs = co.y, us = 8;
-function ps(e, t) {
+const fs = ["below", "above", "left", "right"], ro = 280, co = { x: 12, y: 8 }, bn = co.x, hs = co.y, ps = 8;
+function us(e, t) {
   const s = e.annotation, n = ds(t.text, (t.width ?? ro) - bn * 2, s), o = Math.ceil(Math.max(...n.map((r) => r.reduce((d, h) => d + h.w, 0)))) + bn * 2;
   return { note: t, lines: n, rect: { x: 0, y: 0, w: o, h: n.length * s.lineHeight + hs * 2 } };
 }
@@ -665,8 +691,8 @@ function gs(e, t, s, { left: n, right: o, top: r }) {
   for (const h of ["left", "right"]) {
     let c = r;
     t.map((y, w) => ({ note: y, i: w, row: s.get(y.near ?? "") })).filter((y) => y.row !== void 0 && (y.note.side ?? "right") === h).sort((y, w) => y.row - w.row).forEach(({ note: y, i: w, row: l }) => {
-      const { w: u, h: a } = ps(e, y).rect, i = Math.max(c, Math.round(l - a / 2));
-      d[w] = { x: h === "right" ? o : n - u, y: i, w: u, h: a }, c = i + a + us;
+      const { w: p, h: a } = us(e, y).rect, i = Math.max(c, Math.round(l - a / 2));
+      d[w] = { x: h === "right" ? o : n - p, y: i, w: p, h: a }, c = i + a + ps;
     });
   }
   return d;
@@ -710,11 +736,11 @@ function Ms(e, t, s = {}) {
       return E;
     }, [_, $] = [D(g), D(f)];
     if (S && _ !== $) {
-      const x = (P, X, B) => P === X || w(X, c(B)).some((G) => !y(P, X, G, ""));
+      const x = (F, X, B) => F === X || w(X, c(B)).some((G) => !y(F, X, G, ""));
       if (!e.some(
-        (P) => P.parent === S.id && P !== _ && P !== $ && xs(_, $, P)
+        (F) => F.parent === S.id && F !== _ && F !== $ && xs(_, $, F)
       ) && x(g, _, f) && x(f, $, g)) continue;
-      const v = Math.abs(c(_).y - c($).y) > Math.abs(c(_).x - c($).x), p = (P, X, B) => (c(P)[B] - c(X)[B]) / Math.max(1, B === "x" ? X.w : X.h), A = v ? "x" : "y", m = p(g, _, A) + p(f, $, A), b = c($)[v ? "y" : "x"] > c(_)[v ? "y" : "x"], T = Math.abs(m) > 0.1 ? m > 0 : b;
+      const v = Math.abs(c(_).y - c($).y) > Math.abs(c(_).x - c($).x), u = (F, X, B) => (c(F)[B] - c(X)[B]) / Math.max(1, B === "x" ? X.w : X.h), A = v ? "x" : "y", m = u(g, _, A) + u(f, $, A), b = c($)[v ? "y" : "x"] > c(_)[v ? "y" : "x"], T = Math.abs(m) > 0.1 ? m > 0 : b;
       h(S.id, v ? T ? "right" : "left" : T ? "bottom" : "top");
       continue;
     }
@@ -724,18 +750,18 @@ function Ms(e, t, s = {}) {
     ]) {
       const v = x.parent === "root" ? void 0 : n.get(x.parent);
       if (!v || S && v.id === S.id || r(E.id, v.id)) continue;
-      const p = w(v, c(E));
-      !p.length || p.some((A) => !y(x, v, A, E.id)) || (p.some((A) => A === "left" || A === "right") ? h(v.id, c(x).y < c(v).y + 24 ? "top" : "bottom") : h(v.id, c(E).x < c(x).x ? "left" : "right"));
+      const u = w(v, c(E));
+      !u.length || u.some((A) => !y(x, v, A, E.id)) || (u.some((A) => A === "left" || A === "right") ? h(v.id, c(x).y < c(v).y + 24 ? "top" : "bottom") : h(v.id, c(E).x < c(x).x ? "left" : "right"));
     }
   }
-  const l = s.standoff ?? ys, u = Math.max(s.edgeGap ?? vn, s.portGap ?? vn), a = (i) => i ? 2 * l + (i - 1) * u : Se;
+  const l = s.standoff ?? ys, p = Math.max(s.edgeGap ?? vn, s.portGap ?? vn), a = (i) => i ? 2 * l + (i - 1) * p : Se;
   return new Map(
     [...d].map(([i, g]) => [
       i,
       {
         left: a(g.left),
         right: a(g.right),
-        top: g.top ? l + (g.top - 1) * u : 0,
+        top: g.top ? l + (g.top - 1) * p : 0,
         bottom: a(g.bottom),
         lines: g
       }
@@ -750,45 +776,45 @@ const kn = 20, vt = 20, bs = 12, vs = 16;
 function ks(e, t, s, n, o = (r) => Je(r)) {
   const r = /* @__PURE__ */ new Map();
   for (const d of e.filter((h) => h.scope === "root")) {
-    const h = d.axis === "right", c = (f) => h ? f.x : f.y, y = (f) => h ? f.x + f.w : f.y + f.h, w = (f) => h ? f.y : f.x, l = (f) => h ? f.y + f.h : f.x + f.w, u = (f) => (c(f) + y(f)) / 2, a = (f) => (w(f) + l(f)) / 2, i = [...s.values()].filter((f) => f.parent === d.scope);
+    const h = d.axis === "right", c = (f) => h ? f.x : f.y, y = (f) => h ? f.x + f.w : f.y + f.h, w = (f) => h ? f.y : f.x, l = (f) => h ? f.y + f.h : f.x + f.w, p = (f) => (c(f) + y(f)) / 2, a = (f) => (w(f) + l(f)) / 2, i = [...s.values()].filter((f) => f.parent === d.scope);
     (d.bands?.map((f) => f.map((M) => s.get(M))) ?? [i]).forEach((f) => {
       const M = Math.min(...f.map(w)), k = Math.max(...f.map(l)), S = Math.min(...f.map(c)), D = Math.max(...f.map(y)), _ = new Set(f.map((v) => v.id)), $ = (v) => [...s.values()].some(
-        (p) => p.parent === d.scope && !_.has(p.id) && c(p) < D && y(p) > S && (v ? l(p) <= M : w(p) >= k)
+        (u) => u.parent === d.scope && !_.has(u.id) && c(u) < D && y(u) > S && (v ? l(u) <= M : w(u) >= k)
       ), x = { before: !$(!0), after: !$(!1) }, E = [];
       for (const v of t) {
         if (n.has(v.id) || v.from !== "auto" || v.to !== "auto") continue;
-        const p = s.get(v.source), A = s.get(v.target);
-        if (!p || !A || p === A || !_.has(p.id) || !_.has(A.id) || p.type === "group" || A.type === "group") continue;
-        const m = u(A) < u(p), [b, T] = m ? [A, p] : [p, A], P = Math.min(a(p), a(A)) - 8, X = Math.max(a(p), a(A)) + 8, B = f.filter(
-          (O) => O !== p && O !== A && c(O) >= y(b) - 1 && y(O) <= c(T) + 1
+        const u = s.get(v.source), A = s.get(v.target);
+        if (!u || !A || u === A || !_.has(u.id) || !_.has(A.id) || u.type === "group" || A.type === "group") continue;
+        const m = p(A) < p(u), [b, T] = m ? [A, u] : [u, A], F = Math.min(a(u), a(A)) - 8, X = Math.max(a(u), a(A)) + 8, B = f.filter(
+          (O) => O !== u && O !== A && c(O) >= y(b) - 1 && y(O) <= c(T) + 1
         );
-        if (!B.some((O) => w(O) < X && l(O) > P) && !(m && B.length)) continue;
-        const F = (O, C) => !f.some(
+        if (!B.some((O) => w(O) < X && l(O) > F) && !(m && B.length)) continue;
+        const P = (O, C) => !f.some(
           (V) => V !== O && c(V) < y(O) && y(V) > c(O) && (C ? l(V) <= w(O) : w(V) >= l(O))
-        ), L = (O) => !x[O ? "before" : "after"] || !F(p, O) || !F(A, O) ? 1 / 0 : O ? w(p) - M + (w(A) - M) : k - l(p) + (k - l(A)), [N, z] = [L(!0), L(!1)];
-        if (!Number.isFinite(N) && !Number.isFinite(z)) continue;
-        const I = N === z ? !m : N < z;
-        E.push({ id: v.id, before: I, from: u(b), to: u(T), back: m });
+        ), R = (O) => !x[O ? "before" : "after"] || !P(u, O) || !P(A, O) ? 1 / 0 : O ? w(u) - M + (w(A) - M) : k - l(u) + (k - l(A)), [N, U] = [R(!0), R(!1)];
+        if (!Number.isFinite(N) && !Number.isFinite(U)) continue;
+        const I = N === U ? !m : N < U;
+        E.push({ id: v.id, before: I, from: p(b), to: p(T), back: m });
       }
       for (const v of [!0, !1]) {
-        const p = E.filter((b) => b.before === v).sort((b, T) => b.to - b.from - (T.to - T.from) || b.from - T.from), A = [], m = /* @__PURE__ */ new Set();
-        for (const b of p) {
+        const u = E.filter((b) => b.before === v).sort((b, T) => b.to - b.from - (T.to - T.from) || b.from - T.from), A = [], m = /* @__PURE__ */ new Set();
+        for (const b of u) {
           const T = t.find((O) => O.id === b.id);
           if (m.has(T.source) || m.has(T.target)) continue;
           m.add(T.source).add(T.target);
-          let P = 0;
-          for (; A[P]?.some(([O, C]) => b.from < C + vt && b.to > O - vt); ) P++;
-          (A[P] ??= []).push([b.from, b.to]);
-          const X = t.find((O) => O.id === b.id), B = s.get(X.target), G = v ? M - kn - P * vt : k + kn + P * vt, F = Es(B, f, !b.back, c, y), L = Math.min(vs, (l(B) - w(B)) / 2 - bs), N = As(B, f, !b.back, X.id, t, s, c, y, w, l), z = B.shape === "diamond" && N.length > 0 || N.some((O) => {
+          let F = 0;
+          for (; A[F]?.some(([O, C]) => b.from < C + vt && b.to > O - vt); ) F++;
+          (A[F] ??= []).push([b.from, b.to]);
+          const X = t.find((O) => O.id === b.id), B = s.get(X.target), G = v ? M - kn - F * vt : k + kn + F * vt, P = Es(B, f, !b.back, c, y), R = Math.min(vs, (l(B) - w(B)) / 2 - bs), N = As(B, f, !b.back, X.id, t, s, c, y, w, l), U = B.shape === "diamond" && N.length > 0 || N.some((O) => {
             if (!O.label) return !1;
             const { w: C, h: V } = o(O.label);
-            return (h ? V : C) / 2 + 2 > L;
-          }), I = z ? u(B) : b.back ? y(B) + F / 2 : c(B) - F / 2;
+            return (h ? V : C) / 2 + 2 > R;
+          }), I = U ? p(B) : b.back ? y(B) + P / 2 : c(B) - P / 2;
           r.set(b.id, {
             ...h ? { y: Math.round(G) } : { x: Math.round(G) },
             enter: Math.round(I),
             out: !0,
-            ...z ? { face: !0 } : {}
+            ...U ? { face: !0 } : {}
           });
         }
       }
@@ -803,19 +829,19 @@ function Es(e, t, s, n, o) {
 function As(e, t, s, n, o, r, d, h, c, y) {
   const w = new Set(
     t.filter(
-      (u) => u !== e && (s ? h(u) <= d(e) : d(u) >= h(e)) && c(u) < y(e) && y(u) > c(e)
-    ).map((u) => u.id)
-  ), l = (u) => {
-    for (let a = r.get(u); a; a = r.get(a.parent)) if (w.has(a.id)) return !0;
+      (p) => p !== e && (s ? h(p) <= d(e) : d(p) >= h(e)) && c(p) < y(e) && y(p) > c(e)
+    ).map((p) => p.id)
+  ), l = (p) => {
+    for (let a = r.get(p); a; a = r.get(a.parent)) if (w.has(a.id)) return !0;
     return !1;
   };
   return o.filter(
-    (u) => u.id !== n && (u.source === e.id && l(u.target) || u.target === e.id && l(u.source))
+    (p) => p.id !== n && (p.source === e.id && l(p.target) || p.target === e.id && l(p.source))
   );
 }
 const lo = { port: 16, track: 16 }, En = 12, fo = 20, Ct = 0.5;
 function Ss(e, t, s, n, o, r = lo) {
-  const d = e === "right", h = /* @__PURE__ */ new Map(), { rectOf: c, usable: y, outPort: w, inPort: l, gaps: u, runs: a } = ho(
+  const d = e === "right", h = /* @__PURE__ */ new Map(), { rectOf: c, usable: y, outPort: w, inPort: l, gaps: p, runs: a } = ho(
     e,
     t,
     s,
@@ -828,7 +854,7 @@ function Ss(e, t, s, n, o, r = lo) {
       const S = c(k);
       S && (i[f] = Math.min(i[f] ?? 1 / 0, S.y), g[f] = Math.max(g[f] ?? -1 / 0, S.y + S.h));
     }
-  for (const [f, { placed: M, level: k }] of u) {
+  for (const [f, { placed: M, level: k }] of p) {
     const S = Math.max(0, ...k) + 1, D = (i[f + 1] ?? 0) - (g[f] ?? 0), _ = S > 1 ? Math.min(r.track, Math.max(0, D - 2 * fo) / (S - 1)) : 0, $ = (g[f] ?? 0) + (D - (S - 1) * _) / 2;
     M.forEach((x, E) => x.y = ot($ + k[E] * _));
   }
@@ -859,38 +885,38 @@ function ho(e, t, s, n, o, r) {
     const E = h(x);
     return E ? E.x + E.w / 2 : o(x);
   }, l = (x, E, v) => {
-    const p = h(x), A = p.x + En, m = p.x + p.w - En, b = E.length;
+    const u = h(x), A = u.x + En, m = u.x + u.w - En, b = E.length;
     E.sort((B, G) => B.want - G.want || (B.line < G.line ? -1 : 1));
-    const T = b > 1 ? Math.min(r.port, Math.max(0, m - A) / (b - 1)) : 0, P = [];
+    const T = b > 1 ? Math.min(r.port, Math.max(0, m - A) / (b - 1)) : 0, F = [];
     for (const [B, G] of E.entries())
-      for (P.push({ sum: Math.min(m, Math.max(A, G.want)) - B * T, n: 1 }); P.length > 1 && P.at(-2).sum / P.at(-2).n > P.at(-1).sum / P.at(-1).n; ) {
-        const F = P.pop();
-        P.at(-1).sum += F.sum, P.at(-1).n += F.n;
+      for (F.push({ sum: Math.min(m, Math.max(A, G.want)) - B * T, n: 1 }); F.length > 1 && F.at(-2).sum / F.at(-2).n > F.at(-1).sum / F.at(-1).n; ) {
+        const P = F.pop();
+        F.at(-1).sum += P.sum, F.at(-1).n += P.n;
       }
     const X = [];
-    for (const B of P)
+    for (const B of F)
       for (let G = 0; G < B.n; G++)
         X.push(Math.max(A, Math.min(m - (b - 1) * T, B.sum / B.n)) + X.length * T);
     E.forEach((B, G) => v.set(B.line, ot(X[G])));
-  }, u = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map();
+  }, p = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map();
   for (const x of y) {
     const [E, v] = x.chain;
-    (u.get(E) ?? u.set(E, []).get(E)).push({ line: x.id, want: w(v) });
+    (p.get(E) ?? p.set(E, []).get(E)).push({ line: x.id, want: w(v) });
   }
   const i = /* @__PURE__ */ new Map(), g = /* @__PURE__ */ new Map();
-  for (const [x, E] of u) l(x, E, i);
+  for (const [x, E] of p) l(x, E, i);
   for (const x of y) {
-    const E = x.chain.at(-1), v = x.chain.at(-2), p = x.chain.length === 2 ? i.get(x.id) : o(v);
-    (a.get(E) ?? a.set(E, []).get(E)).push({ line: x.id, want: p });
+    const E = x.chain.at(-1), v = x.chain.at(-2), u = x.chain.length === 2 ? i.get(x.id) : o(v);
+    (a.get(E) ?? a.set(E, []).get(E)).push({ line: x.id, want: u });
   }
   for (const [x, E] of a) l(x, E, g);
   const f = (x, E) => E === 0 ? i.get(x.id) : E === x.chain.length - 1 ? g.get(x.id) : o(x.chain[E]), M = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map();
   for (const x of y) {
     const E = [];
     for (let v = 0; v + 1 < x.chain.length; v++) {
-      const p = f(x, v), A = f(x, v + 1);
-      if (Math.abs(p - A) < Ct) continue;
-      const m = { line: x.id, up: p, low: A, lo: Math.min(p, A), hi: Math.max(p, A) }, b = c.get(x.chain[v]);
+      const u = f(x, v), A = f(x, v + 1);
+      if (Math.abs(u - A) < Ct) continue;
+      const m = { line: x.id, up: u, low: A, lo: Math.min(u, A), hi: Math.max(u, A) }, b = c.get(x.chain[v]);
       (M.get(b) ?? M.set(b, []).get(b)).push(m), E.push(m);
     }
     k.set(x.id, E);
@@ -901,18 +927,18 @@ function ho(e, t, s, n, o, r) {
     for (const A of [...E].sort((m, b) => m.lo - b.lo || m.hi - b.hi)) {
       let m = 0, b = 1 / 0;
       for (let T = 0; T <= v.length; T++) {
-        let P = 0;
+        let F = 0;
         for (let X = 0; X < v.length; X++)
-          _(A, v[X]) && (P += X < T ? D(v[X], A) : D(A, v[X]));
-        P < b && ([m, b] = [T, P]);
+          _(A, v[X]) && (F += X < T ? D(v[X], A) : D(A, v[X]));
+        F < b && ([m, b] = [T, F]);
       }
       v.splice(m, 0, A);
     }
-    const p = v.map(() => 0);
+    const u = v.map(() => 0);
     for (let A = 0; A < v.length; A++)
       for (let m = 0; m < A; m++)
-        _(v[A], v[m]) && (p[A] = Math.max(p[A], p[m] + 1));
-    $.set(x, { placed: v, level: p });
+        _(v[A], v[m]) && (u[A] = Math.max(u[A], u[m] + 1));
+    $.set(x, { placed: v, level: u });
   }
   return { rectOf: h, usable: y, outPort: i, inPort: g, gaps: $, runs: k };
 }
@@ -937,18 +963,18 @@ const Ts = ["vscode", "vscode-insiders", "cursor", "windsurf", "zed"], An = [
   "circle",
   "cross"
 ];
-function uo(e) {
+function po(e) {
   return {
     title: ct(e.title.role, !0, 20, 26),
     subtitle: ct(e.annotation.role, !1, 13, 18)
   };
 }
-const Sn = 360, Rs = 70;
-function Ls(e, t) {
-  const s = uo(e).subtitle, n = ye("abcdefghijklmnopqrstuvwxyz ", s) / 27 * Rs;
+const Sn = 360, Ls = 70;
+function Rs(e, t) {
+  const s = po(e).subtitle, n = ye("abcdefghijklmnopqrstuvwxyz ", s) / 27 * Ls;
   return Math.round(Math.min(Math.max(t, Sn), Math.max(n, Sn)));
 }
-const Os = uo;
+const Os = po;
 function $s(e) {
   return [...Ns(e), ...Cs(e), ...js(e)];
 }
@@ -977,7 +1003,7 @@ function Ns(e) {
     ids: o.map((r) => r.id)
   }), s;
 }
-function Ps(e, t) {
+function Fs(e, t) {
   if (!Tt(t)) return Ve;
   const s = new Map(e.objects.map((c) => [c.id, c])), n = !!Ze[e.appearance.theme]?.dark, o = (c) => {
     for (let y = s.get(s.get(c)?.parent ?? ""); y; y = s.get(y.parent))
@@ -990,9 +1016,9 @@ function Ps(e, t) {
   });
   return d.length && h ? No(e.appearance.theme) : Ve;
 }
-function Fs(e) {
+function Ps(e) {
   for (const t of e.appearance.legend ?? [])
-    t.family && t.shade === void 0 && (t.shade = Ps(e, t.family));
+    t.family && t.shade === void 0 && (t.shade = Fs(e, t.family));
 }
 function Cs(e) {
   return (e.appearance.legend ?? []).flatMap((t, s) => {
@@ -1012,7 +1038,7 @@ function Cs(e) {
 function js(e) {
   const t = [], s = e.appearance.heading?.subtitle;
   if (s) {
-    const n = ut(e.appearance), o = it(s, Ls(n, 1 / 0), Os(n).subtitle);
+    const n = pt(e.appearance), o = it(s, Rs(n, 1 / 0), Os(n).subtitle);
     o.length > 1 && t.push({
       level: "warning",
       code: "heading-prose",
@@ -1045,12 +1071,12 @@ function Bs(e) {
     }))
   ) : [];
 }
-class Re extends Error {
+class Le extends Error {
   constructor(t, s = 0, n = 0) {
     super((s ? `Line ${s}${n ? `, column ${n}` : ""}: ` : "") + t), this.line = s, this.column = n, this.name = "DslError";
   }
 }
-const po = { "+": "added", "-": "removed", "~": "changed", ".": "context" }, Us = (e) => ({ value: String(e), quoted: !1 }), zs = (e) => ({ value: e, quoted: !0 }), qs = 'A quote inside a quoted string needs a backslash: write \\" for each inner quote.';
+const uo = { "+": "added", "-": "removed", "~": "changed", ".": "context" }, zs = (e) => ({ value: String(e), quoted: !1 }), Us = (e) => ({ value: e, quoted: !0 }), qs = 'A quote inside a quoted string needs a backslash: write \\" for each inner quote.';
 function Gs(e, t = 0) {
   const s = [], n = [];
   let o = "", r = 0, d = 0, h = !1, c = !1;
@@ -1069,24 +1095,24 @@ function Gs(e, t = 0) {
     }
     if (l === '"') {
       if (h && w + 1 < e.length && !/[\s#]/.test(e[w + 1]) && !e.startsWith("//", w + 1))
-        throw new Re(qs, t, w + 1);
+        throw new Le(qs, t, w + 1);
       h || (d = w), h = !h, o += l;
       continue;
     }
-    const u = l === "/" && e[w + 1] === "/" && !/[^\s"]/.test(e[w - 1] ?? " ");
-    if (!h && (l === "#" || u))
+    const p = l === "/" && e[w + 1] === "/" && !/[^\s"]/.test(e[w - 1] ?? " ");
+    if (!h && (l === "#" || p))
       return y(), { tokens: s, columns: n, comment: e.slice(w).trim() };
     !h && /\s/.test(l) ? y() : o += l;
   }
-  if (h) throw new Re("Unclosed quoted string.", t, d + 1);
+  if (h) throw new Le("Unclosed quoted string.", t, d + 1);
   return y(), { tokens: s, columns: n };
 }
 function _n(e, t, s) {
-  if (!e.startsWith('"')) return Us(e);
+  if (!e.startsWith('"')) return zs(e);
   try {
-    return zs(JSON.parse(e));
+    return Us(JSON.parse(e));
   } catch {
-    throw new Re(
+    throw new Le(
       'Invalid escape in a quoted string. Use \\" for a quote, \\\\ for a backslash and \\n for a line break.',
       t,
       s
@@ -1094,20 +1120,20 @@ function _n(e, t, s) {
   }
 }
 function Hs(e) {
-  if (typeof e != "string") throw new Re("Source must be text.");
-  if (e.length > 3e5) throw new Re("Limit: 300,000 source characters.");
+  if (typeof e != "string") throw new Le("Source must be text.");
+  if (e.length > 3e5) throw new Le("Limit: 300,000 source characters.");
   return { lines: e.split(/\r?\n/).map((s, n) => {
     const o = n + 1, { tokens: r, columns: d, comment: h } = Gs(s, o);
     if (!r.length) return h ? { kind: "comment", text: h } : { kind: "blank" };
-    const [c, ...y] = r, w = po[c[0]] && c.length > 1 ? c[0] : void 0, l = w ? c.slice(1) : c, u = [], a = [];
+    const [c, ...y] = r, w = uo[c[0]] && c.length > 1 ? c[0] : void 0, l = w ? c.slice(1) : c, p = [], a = [];
     return y.forEach((i, g) => {
       const f = i.indexOf("="), M = d[g + 1];
       if (f > 0 && !i.startsWith('"')) {
         const k = i.slice(0, f);
-        if (a.some(([S]) => S === k)) throw new Re(`Duplicate attribute ${k}.`, o);
+        if (a.some(([S]) => S === k)) throw new Le(`Duplicate attribute ${k}.`, o);
         a.push([k, _n(i.slice(f + 1), o, M + f + 1)]);
-      } else u.push(_n(i, o, M));
-    }), { kind: "statement", command: l, ...w ? { mark: w } : {}, args: u, attrs: a, comment: h, line: o };
+      } else p.push(_n(i, o, M));
+    }), { kind: "statement", command: l, ...w ? { mark: w } : {}, args: p, attrs: a, comment: h, line: o };
   }) };
 }
 const Ys = { wide: 2, slide: 1.78, square: 1, page: 0.77, tall: 0.6 };
@@ -1129,7 +1155,7 @@ const Ws = ["near", "nudge", "stay", "pin"], In = {
   canvas: "canvas",
   text: "text",
   connection: "connection"
-}, Rn = [
+}, Ln = [
   "compound-flow",
   "boundary-align",
   "compound-spring",
@@ -1156,7 +1182,7 @@ const Ws = ["near", "nudge", "stay", "pin"], In = {
   fold: { key: "fold", choices: ["auto", "never"] },
   aspect: { key: "aspect", choices: ["1", "1.333", "1.6", "2", "0.75"] },
   root: { key: "rootId", choices: [] }
-}, Ln = {
+}, Rn = {
   clearance: { key: "clearance", min: 4, max: 30 },
   "port-gap": { key: "portGap", min: 6, max: 28 },
   "edge-gap": { key: "edgeGap", min: 4, max: 48 },
@@ -1195,30 +1221,30 @@ function Zs(e) {
   let h = 0;
   for (const c of t.lines) {
     if (c.kind !== "statement") continue;
-    const y = c.line, { command: w, args: l } = c, u = new Map(c.attrs), a = (m) => {
-      throw new Re(m, y);
+    const y = c.line, { command: w, args: l } = c, p = new Map(c.attrs), a = (m) => {
+      throw new Le(m, y);
     }, i = (m, b) => {
       m || a(b);
     }, g = (m) => {
-      for (const b of u.keys())
+      for (const b of p.keys())
         i(m.includes(b), `Unknown ${w} attribute: ${b}.`);
     }, f = (m, b = m) => i(l.length >= m && l.length <= b, `Wrong number of arguments for ${w}.`), M = (m) => (i(
       m && !m.quoted && Ks.test(m.value),
       "Expected a stable identifier (letters, digits, _, . or -)."
-    ), m.value), k = (m) => m?.value ?? "", S = (m, b, T = -1e5, P = 1e5) => {
-      const X = u.get(m);
+    ), m.value), k = (m) => m?.value ?? "", S = (m, b, T = -1e5, F = 1e5) => {
+      const X = p.get(m);
       if (X === void 0) return b;
       const B = Number(X.value);
       return i(
-        !X.quoted && Number.isFinite(B) && B >= T && B <= P,
-        `Expected ${m} from ${T} to ${P}; got ${X.value}.`
+        !X.quoted && Number.isFinite(B) && B >= T && B <= F,
+        `Expected ${m} from ${T} to ${F}; got ${X.value}.`
       ), B;
     }, D = (m, b) => {
-      const T = u.get(m);
+      const T = p.get(m);
       return !T.quoted && Vs.test(T.value) ? T.value : S(m, b, b, 1e6);
     }, _ = (m, b, T) => {
-      const P = u.get(m)?.value ?? b;
-      return i(T.includes(P), `Expected ${m}=${T.join("|")}; got ${P}.`), P;
+      const F = p.get(m)?.value ?? b;
+      return i(T.includes(F), `Expected ${m}=${T.join("|")}; got ${F}.`), F;
     }, $ = (m) => {
       const b = Number(m.value);
       return i(
@@ -1226,35 +1252,35 @@ function Zs(e) {
         `Expected shade=${Gt.join("|")}; got ${m.value}.`
       ), b;
     }, x = (m) => {
-      const b = u.get(m);
+      const b = p.get(m);
       return i(
-        b.quoted && Fo.test(b.value),
+        b.quoted && Po.test(b.value),
         `Expected ${m}="#rrggbb" in double quotes; got ${b.value || "nothing"}.`
       ), b.value.toUpperCase();
     }, E = (m) => {
       i(!d.has(m), `Duplicate declaration: ${m}. Edit the existing line instead.`), d.add(m);
-    }, v = c.mark && po[c.mark];
+    }, v = c.mark && uo[c.mark];
     i(
       !c.mark || ["node", "group", "edge"].includes(w),
       `Only node, group and edge lines take a ${c.mark} mark.`
     );
-    const p = () => {
+    const u = () => {
       for (const m of ["was", "was-shape", "was-count"])
-        i(!u.has(m) || c.mark === "~", `${m}= belongs on a changed (~) line.`);
+        i(!p.has(m) || c.mark === "~", `${m}= belongs on a changed (~) line.`);
       return {
-        ...u.has("was") ? { was: u.get("was").value } : {},
-        ...u.has("was-shape") ? { wasShape: _("was-shape", "box", Qs) } : {},
-        ...u.has("was-count") ? { wasCount: D("was-count", 1) } : {}
+        ...p.has("was") ? { was: p.get("was").value } : {},
+        ...p.has("was-shape") ? { wasShape: _("was-shape", "box", Qs) } : {},
+        ...p.has("was-count") ? { wasCount: D("was-count", 1) } : {}
       };
     }, A = (m) => {
       const b = {};
-      for (const [T, P] of Object.entries(m))
-        u.has(T) && ("min" in P ? b[P.key] = S(T, 0, P.min, P.max) : P.choices.length ? b[P.key] = _(T, P.choices[0], P.choices) : b[P.key] = M(u.get(T)));
+      for (const [T, F] of Object.entries(m))
+        p.has(T) && ("min" in F ? b[F.key] = S(T, 0, F.min, F.max) : F.choices.length ? b[F.key] = _(T, F.choices[0], F.choices) : b[F.key] = M(p.get(T)));
       return b;
     };
     switch (w) {
       case "diagram":
-        f(1), g(["version", "width"]), i(!h, "Only one diagram declaration is allowed."), h = y, s.title = k(l[0]), S("version", 1, 1, 1), s.title && ((s.appearance.heading ??= {}).title = s.title), u.has("width") && ((s.appearance.heading ??= {}).width = S("width", 0, 160, 8e3));
+        f(1), g(["version", "width"]), i(!h, "Only one diagram declaration is allowed."), h = y, s.title = k(l[0]), S("version", 1, 1, 1), s.title && ((s.appearance.heading ??= {}).title = s.title), p.has("width") && ((s.appearance.heading ??= {}).width = S("width", 0, 160, 8e3));
         break;
       case "compare": {
         f(0, 2), g(["direction", "aspect"]), E("compare");
@@ -1263,18 +1289,18 @@ function Zs(e) {
           before: k(l[0]) || "Before",
           after: k(l[1]) || "After",
           ...m !== "auto" ? { direction: m } : {},
-          ...u.has("aspect") ? { aspect: S("aspect", 1.6, 0.25, 8) } : {}
+          ...p.has("aspect") ? { aspect: S("aspect", 1.6, 0.25, 8) } : {}
         };
         break;
       }
       case "config": {
-        f(0), g(Object.keys(In)), i(u.size, `config needs a setting: ${Object.keys(In).join(", ")}.`);
+        f(0), g(Object.keys(In)), i(p.size, `config needs a setting: ${Object.keys(In).join(", ")}.`);
         const m = s.appearance.config ??= {};
-        for (const [b, T] of u) {
-          const P = n.get(b);
-          P && s.warnings.push({
+        for (const [b, T] of p) {
+          const F = n.get(b);
+          F && s.warnings.push({
             code: "config-repeated",
-            message: `config ${b} is also set on line ${P}; this line wins.`,
+            message: `config ${b} is also set on line ${F}; this line wins.`,
             line: y
           }), n.set(b, y), b === "editor" ? m.editor = _("editor", "vscode", Ts) : b === "strike-removed" ? m.strikeRemoved = _(b, "off", ["on", "off"]) === "on" : (i(T.quoted, `Expected ${b}="path" in double quotes.`), m.linkBase = T.value);
         }
@@ -1282,9 +1308,9 @@ function Zs(e) {
       }
       case "state": {
         i(l.length >= 1, 'A state needs an ID: state write "Write path" api orders.'), g(["rest"]);
-        const m = M(l[0]), b = l[1]?.quoted ? l[1].value : void 0, T = l.slice(b === void 0 ? 1 : 2).map((B) => M(B)), P = s.appearance.states ??= [];
-        let X = P.find((B) => B.id === m);
-        X || (X = { id: m, label: b ?? m, ids: [], rest: "dim" }, P.push(X)), u.has("rest") && (X.rest = _("rest", "dim", ["dim", "plain"]));
+        const m = M(l[0]), b = l[1]?.quoted ? l[1].value : void 0, T = l.slice(b === void 0 ? 1 : 2).map((B) => M(B)), F = s.appearance.states ??= [];
+        let X = F.find((B) => B.id === m);
+        X || (X = { id: m, label: b ?? m, ids: [], rest: "dim" }, F.push(X)), p.has("rest") && (X.rest = _("rest", "dim", ["dim", "plain"]));
         for (const B of T)
           i(!X.ids.includes(B), `${B} is already in state ${m}.`), X.ids.push(B), s.stateLines.set(`${m}:${B}`, y);
         break;
@@ -1322,28 +1348,28 @@ function Zs(e) {
         );
         const m = M(l[0]);
         i(m !== "root", "root is reserved for the outer layout scope."), i(!o.has(m), `Duplicate node/group id ${m}.`), o.add(m);
-        const b = u.get("color")?.value ?? "auto";
+        const b = p.get("color")?.value ?? "auto";
         i(
-          !u.get("color")?.quoted && jt.test(b),
+          !p.get("color")?.quoted && jt.test(b),
           `Expected color=auto, a built-in color (${Ht.join(", ")}) or a theme-color name; got ${b}.`
         );
-        const T = u.has("shade") ? $(u.get("shade")) : void 0;
+        const T = p.has("shade") ? $(p.get("shade")) : void 0;
         s.objects.push({
           id: m,
           type: w,
           label: k(l[1]),
-          parent: u.has("in") ? M(u.get("in")) : "root",
+          parent: p.has("in") ? M(p.get("in")) : "root",
           color: b,
           ...T !== void 0 ? { shade: T } : {},
           shape: w === "node" ? _("shape", "box", go) : "box",
           ...c.mark ? { status: v } : {},
-          ...p(),
-          ...u.has("href") ? { href: k(u.get("href")) } : {},
-          ...u.has("count") ? { count: D("count", 2) } : {},
+          ...u(),
+          ...p.has("href") ? { href: k(p.get("href")) } : {},
+          ...p.has("count") ? { count: D("count", 2) } : {},
           ...w === "group" && _("fold", "auto", ["auto", "never"]) === "never" ? { fold: "never" } : {},
           ...w === "group" && _("frame", "box", On) !== "box" ? { frame: _("frame", "box", On) } : {},
-          ...u.has("span") ? {
-            span: u.get("span").value === "var" ? "var" : S("span", 1, 1, 4096)
+          ...p.has("span") ? {
+            span: p.get("span").value === "var" ? "var" : S("span", 1, 1, 4096)
           } : {},
           line: y
         });
@@ -1356,9 +1382,9 @@ function Zs(e) {
         );
         const m = M(l[0]);
         i(!r.has(m), `Duplicate edge id ${m}.`), r.add(m);
-        const b = _("directed", "true", ["true", "false"]) === "false", T = _("head", "arrow", An), P = _("tail", "none", An);
+        const b = _("directed", "true", ["true", "false"]) === "false", T = _("head", "arrow", An), F = _("tail", "none", An);
         i(
-          !b || !(u.has("head") || u.has("tail")),
+          !b || !(p.has("head") || p.has("tail")),
           `Edge ${m} has directed=false, so it has no ends to mark. Remove head= and tail=, or remove directed=false.`
         ), s.edges.push({
           id: m,
@@ -1370,28 +1396,28 @@ function Zs(e) {
           to: _("to", "auto", $n),
           ...b ? { directed: !1 } : {},
           ...T !== "arrow" ? { head: T } : {},
-          ...P !== "none" ? { tail: P } : {},
+          ...F !== "none" ? { tail: F } : {},
           ..._("constraint", "true", ["true", "false"]) === "false" ? { constraint: !1 } : {},
           ...c.mark ? { status: v } : {},
-          ...p(),
+          ...u(),
           line: y
         });
         break;
       }
       case "layout": {
-        const m = M(l[0]), b = u.get("engine")?.value, T = s.layouts.findIndex((F) => F.scope === m);
+        const m = M(l[0]), b = p.get("engine")?.value, T = s.layouts.findIndex((P) => P.scope === m);
         T >= 0 && (s.warnings.push({
           code: "layout-repeated",
           message: `layout ${m} is also set on line ${s.layouts[T].line}; this line wins.`,
           line: y
         }), s.layouts.splice(T, 1));
-        const P = (F) => {
-          for (const L of [...u.keys()])
-            F.includes(L) || (s.warnings.push({
+        const F = (P) => {
+          for (const R of [...p.keys()])
+            P.includes(R) || (s.warnings.push({
               code: "layout-attribute",
-              message: `This layout line does not take ${L}=, so it is ignored. ${Xs(L, b !== void 0)}`,
+              message: `This layout line does not take ${R}=, so it is ignored. ${Xs(R, b !== void 0)}`,
               line: y
-            }), u.delete(L));
+            }), p.delete(R));
         }, X = [
           "direction",
           "min-width",
@@ -1401,14 +1427,14 @@ function Zs(e) {
         let B;
         if (b !== void 0)
           f(1), i(
-            Rn.includes(b),
-            `Unknown layout engine ${b}; use ${Rn.join(", ")}.`
-          ), P(["engine", ...X, ...Object.keys(Zt)]), B = { algorithm: b, params: A(Zt) };
+            Ln.includes(b),
+            `Unknown layout engine ${b}; use ${Ln.join(", ")}.`
+          ), F(["engine", ...X, ...Object.keys(Zt)]), B = { algorithm: b, params: A(Zt) };
         else {
           f(2);
-          const F = l[1]?.value;
-          P(
-            F === "cells" ? ["columns", "unit", "unit-width", "ruler", ...X] : ["gap", ...F === "flow" ? ["fold"] : [], ...X]
+          const P = l[1]?.value;
+          F(
+            P === "cells" ? ["columns", "unit", "unit-width", "ruler", ...X] : ["gap", ...P === "flow" ? ["fold"] : [], ...X]
           );
         }
         const G = b ? "flow" : l[1]?.value;
@@ -1427,12 +1453,12 @@ function Zs(e) {
           ...B ? { engine: B } : {},
           direction: _("direction", "auto", ["auto", "right", "down"]),
           fold: b ? "auto" : _("fold", "auto", ["auto", "never"]),
-          ...u.has("fit") ? { fit: _("fit", "slide", Object.keys(Ys)) } : {},
-          ...u.has("columns") ? { columns: S("columns", 1, 1, 512) } : {},
-          ...u.has("unit") ? {
+          ...p.has("fit") ? { fit: _("fit", "slide", Object.keys(Ys)) } : {},
+          ...p.has("columns") ? { columns: S("columns", 1, 1, 512) } : {},
+          ...p.has("unit") ? {
             unit: _("unit", "byte", ["bit", "byte"]),
             ruler: _("ruler", "on", ["on", "off"]) === "on",
-            ...u.has("unit-width") ? { unitWidth: S("unit-width", 24, 8, 200) } : {}
+            ...p.has("unit-width") ? { unitWidth: S("unit-width", 24, 8, 200) } : {}
           } : {},
           gap: S("gap", 28, 8, 300),
           minWidth: S("min-width", 0, 0, 1e4),
@@ -1446,8 +1472,8 @@ function Zs(e) {
         const m = l[0].value;
         i(ln.includes(m), `Unknown theme ${m}; use ${ln.join(", ")}.`), s.appearance.theme = m, s.themeLine = y;
         const b = s.appearance.overrides;
-        for (const [T, P] of Object.entries(Tn))
-          u.has(T) && (P === "paddingX" || P === "paddingY" || P === "radius" ? b[P] = S(T, 0, fn[P].min, fn[P].max) : P === "titleFont" || P === "annotationFont" ? b[P] = _(T, "sans", Io) : b[P] = x(T));
+        for (const [T, F] of Object.entries(Tn))
+          p.has(T) && (F === "paddingX" || F === "paddingY" || F === "radius" ? b[F] = S(T, 0, fn[F].min, fn[F].max) : F === "titleFont" || F === "annotationFont" ? b[F] = _(T, "sans", Io) : b[F] = x(T));
         break;
       }
       case "theme-color": {
@@ -1457,11 +1483,11 @@ function Zs(e) {
           !l[0].quoted && jt.test(m) && m !== "auto",
           "Expected a color family name (letters, digits, _ or -)."
         );
-        const b = u.has("shade") ? $(u.get("shade")) : 500;
+        const b = p.has("shade") ? $(p.get("shade")) : 500;
         E(`theme-color:${m}:${b}`);
         const T = { family: m, shade: b };
-        for (const P of ["fill", "stroke", "ink"])
-          u.has(P) && (T[P] = x(P));
+        for (const F of ["fill", "stroke", "ink"])
+          p.has(F) && (T[F] = x(F));
         i(
           Tt(m) || T.fill && T.stroke && T.ink,
           `${m} is not a built-in color, so shade ${b} needs fill, stroke and ink.`
@@ -1483,8 +1509,8 @@ function Zs(e) {
         i(
           !l[0].quoted && jt.test(m) && m !== "auto",
           `Expected legend family "meaning", with a built-in color (${Ht.join(", ")}) or a theme-color name.`
-        ), E(`legend:${m}:${u.get("shade")?.value ?? ""}`);
-        const b = u.has("shade") ? $(u.get("shade")) : void 0;
+        ), E(`legend:${m}:${p.get("shade")?.value ?? ""}`);
+        const b = p.has("shade") ? $(p.get("shade")) : void 0;
         i(k(l[1]).trim(), "A legend entry needs its meaning in quotes."), (s.appearance.legend ??= []).push({
           family: m,
           label: k(l[1]),
@@ -1493,11 +1519,11 @@ function Zs(e) {
         break;
       }
       case "note": {
-        f(1), g(["near", "side", "width"]), i(l[0].quoted && l[0].value.trim(), "A note needs its text in quotes."), i(u.has("near") || !u.has("side"), "side= places a note beside near=<id>."), (s.appearance.notes ??= []).push({
+        f(1), g(["near", "side", "width"]), i(l[0].quoted && l[0].value.trim(), "A note needs its text in quotes."), i(p.has("near") || !p.has("side"), "side= places a note beside near=<id>."), (s.appearance.notes ??= []).push({
           text: l[0].value,
-          ...u.has("near") ? { near: M(u.get("near")) } : {},
-          ...u.has("side") ? { side: _("side", "below", fs) } : {},
-          ...u.has("width") ? { width: S("width", ro, 80, 1200) } : {}
+          ...p.has("near") ? { near: M(p.get("near")) } : {},
+          ...p.has("side") ? { side: _("side", "below", fs) } : {},
+          ...p.has("width") ? { width: S("width", ro, 80, 1200) } : {}
         }), s.noteLines.push(y);
         break;
       }
@@ -1514,7 +1540,7 @@ function Zs(e) {
         break;
       }
       case "routing":
-        f(0), g(Object.keys(Ln)), E("routing"), s.routing = A(Ln);
+        f(0), g(Object.keys(Rn)), E("routing"), s.routing = A(Rn);
         break;
       case "order":
         f(2, 300), g([]), s.hints.push({ type: "order", scope: M(l[0]), ids: l.slice(1).map(M), line: y }), E("order:" + l[0].value);
@@ -1569,16 +1595,16 @@ function Zs(e) {
           g(["x", "y"]), s.hints.push({ type: "pin", id: m, x: S("x", 0, 0), y: S("y", 0, 0), line: y });
         else {
           g(["width", "height", "min-height"]);
-          const b = u.get("height")?.value === "auto";
+          const b = p.get("height")?.value === "auto";
           i(
-            b || !u.has("min-height"),
+            b || !p.has("min-height"),
             "min-height is a floor under height=auto. Write height=auto, or remove min-height."
           ), s.hints.push({
             type: "size",
             id: m,
             width: S("width", 164, 40, 1200),
             ...b ? {} : { height: S("height", 56, 24, 1200) },
-            ...u.has("min-height") ? { minHeight: S("min-height", 24, 24, 1200) } : {},
+            ...p.has("min-height") ? { minHeight: S("min-height", 24, 24, 1200) } : {},
             line: y
           });
         }
@@ -1593,8 +1619,8 @@ function Zs(e) {
         a(`Unknown statement ${w}.`);
     }
   }
-  if (s.objects.length > 500) throw new Re("Limit: 500 nodes and groups.");
-  if (s.edges.length > 1200) throw new Re("Limit: 1,200 edges.");
+  if (s.objects.length > 500) throw new Le("Limit: 500 nodes and groups.");
+  if (s.edges.length > 1200) throw new Le("Limit: 1,200 edges.");
   return Js(s), s;
 }
 function st(e, t) {
@@ -1608,7 +1634,7 @@ function Js(e) {
     `${a} is a ${t.get(a)?.frame} group, so it has no ${g} of its own. Use frame=box, or ${g === "layout" ? "set the layout of the container around it" : "place its members"}.`,
     i
   ), n = (a) => st(t, a), o = (a, i, g) => {
-    if (!a) throw new Re(i, g);
+    if (!a) throw new Le(i, g);
   }, r = (a, i) => o(t.has(a), `Unknown node/group ${a}.`, i), d = (a, i) => o(a === "root" || t.get(a)?.type === "group", `Unknown container ${a}.`, i), h = /* @__PURE__ */ new Map();
   for (const a of e.appearance.colors)
     h.has(a.family) || h.set(a.family, /* @__PURE__ */ new Set()), h.get(a.family).add(a.shade);
@@ -1623,7 +1649,7 @@ function Js(e) {
   });
   for (const a of e.objects) {
     if (a.color !== "auto" && !Tt(a.color)) {
-      const g = h.get(a.color), f = a.shade ?? (a.type === "group" ? Po(e.appearance.theme) : Ve);
+      const g = h.get(a.color), f = a.shade ?? (a.type === "group" ? Fo(e.appearance.theme) : Ve);
       o(
         g,
         `Unknown color ${a.color}. Define it with theme-color ${a.color} shade=… fill= stroke= ink=.`,
@@ -1732,9 +1758,9 @@ function Js(e) {
         g
       );
     }
-  const u = new Map(e.layouts.filter((a) => a.algorithm === "cells").map((a) => [a.scope, a]));
+  const p = new Map(e.layouts.filter((a) => a.algorithm === "cells").map((a) => [a.scope, a]));
   for (const a of e.objects) {
-    const i = u.get(a.parent);
+    const i = p.get(a.parent);
     i ? (o(
       a.type === "node",
       `Cells are nodes; ${a.id} is a group inside cells ${a.parent}.`,
@@ -1782,10 +1808,10 @@ function Js(e) {
         a.line
       );
 }
-const $t = { width: 1100, height: 720 }, ft = 12, ei = 56, Dn = 24, Nn = 0, ti = 56, Pn = { w: 260, h: 110 }, Fn = (e, t) => Math.max(t.x - e.x - e.w, e.x - t.x - t.w, t.y - e.y - e.h, e.y - t.y - t.h), re = (e) => Math.round(e);
+const $t = { width: 1100, height: 720 }, ft = 12, ei = 56, Dn = 24, Nn = 0, ti = 56, Fn = { w: 260, h: 110 }, Pn = (e, t) => Math.max(t.x - e.x - e.w, e.x - t.x - t.w, t.y - e.y - e.h, e.y - t.y - t.h), re = (e) => Math.round(e);
 function ni(e) {
   if (!e.appearance.compare || !e.edges.some((n) => n.was)) return e;
-  const t = ut(e.appearance), s = (n) => n ? Je(n, t).w : 0;
+  const t = pt(e.appearance), s = (n) => n ? Je(n, t).w : 0;
   return {
     ...e,
     edges: e.edges.map((n) => n.was && s(n.was) > s(n.label) ? { ...n, label: n.was } : n)
@@ -1828,7 +1854,7 @@ function mo(e) {
       I,
       n.filter((O) => O.parent === I).map((O) => O.id)
     )
-  ).map((I) => e.byId.get(I)).map((I) => s.has(I.id) ? I : { ...I, w: di(I, t) }), y = new Map(c.map((I, O) => [I.id, O])), w = e.model.phases.length ? Math.max(...e.model.phases.map((I) => ye(I.label, t.annotation))) + 2 * $e : 0, l = o.length ? t.groupHeader : 0, u = (I) => c[I - 1].parent !== c[I].parent, a = !!e.model.appearance.compare, i = (I) => [I.label, a ? I.was : ""].filter((O) => !!O), g = (I) => {
+  ).map((I) => e.byId.get(I)).map((I) => s.has(I.id) ? I : { ...I, w: di(I, t) }), y = new Map(c.map((I, O) => [I.id, O])), w = e.model.phases.length ? Math.max(...e.model.phases.map((I) => ye(I.label, t.annotation))) + 2 * $e : 0, l = o.length ? t.groupHeader : 0, p = (I) => c[I - 1].parent !== c[I].parent, a = !!e.model.appearance.compare, i = (I) => [I.label, a ? I.was : ""].filter((O) => !!O), g = (I) => {
     const O = i(I).map((C) => Je(C, t, !0));
     return { w: Math.max(0, ...O.map((C) => C.w)), h: Math.max(0, ...O.map((C) => C.h)) };
   }, f = (I) => {
@@ -1849,13 +1875,13 @@ function mo(e) {
     const { right: V } = f(I);
     M.set(I.source, Math.max(M.get(I.source) ?? 0, V)), O + 1 < c.length && k[O + 1].push({
       from: O,
-      room: V + jn + (u(O + 1) ? 2 * $e + c[O + 1].w / 2 : 0)
+      room: V + jn + (p(O + 1) ? 2 * $e + c[O + 1].w / 2 : 0)
     });
   }
   const S = [];
   c.forEach((I, O) => {
     if (!O) return void S.push(w + $e + I.w / 2);
-    const C = c[O - 1].w / 2 + ri + (u(O) ? 2 * $e : 0) + I.w / 2;
+    const C = c[O - 1].w / 2 + ri + (p(O) ? 2 * $e : 0) + I.w / 2;
     S.push(Math.max(S[O - 1] + C, ...k[O].map((V) => S[V.from] + V.room)));
   });
   let D = l + Math.max(0, ...c.map((I) => I.h)) - ai, _ = 0;
@@ -1871,12 +1897,11 @@ function mo(e) {
       const O = re(S[y.get(I.id)] - I.w / 2);
       return [I.id, { x: O, w: I.w }];
     })
-  ), p = (I) => Math.max(v.get(I.id).x + I.w, S[y.get(I.id)] + (M.get(I.id) ?? 0)), A = e.objects.map((I) => {
+  ), u = (I) => Math.max(v.get(I.id).x + I.w, S[y.get(I.id)] + (M.get(I.id) ?? 0)), A = e.objects.map((I) => {
     if (I.type === "group") {
-      const V = c.filter((le) => le.parent === I.id), oe = re(Math.min(...V.map((le) => v.get(le.id).x)) - $e), ae = re(Math.max(...V.map((le) => p(le))) + $e - oe);
+      const V = c.filter((le) => le.parent === I.id), oe = re(Math.min(...V.map((le) => v.get(le.id).x)) - $e), ae = re(Math.max(...V.map((le) => u(le))) + $e - oe);
       return {
         ...I,
-        shade: I.shade ?? 50,
         x: oe,
         y: 0,
         w: ae,
@@ -1907,11 +1932,11 @@ function mo(e) {
     y: -tt,
     w: b - m + 2 * tt,
     h: E + $e + 2 * tt
-  }, P = e.model.appearance.notes ?? [], X = new Map([...$].filter(([I]) => !e.byId.has(I))), B = gs(t, P, X, {
+  }, F = e.model.appearance.notes ?? [], X = new Map([...$].filter(([I]) => !e.byId.has(I))), B = gs(t, F, X, {
     left: m - (w ? tt : Bn),
     right: b + Bn,
     top: 0
-  }), G = B.filter((I) => I !== null), F = G.length ? wn([T, wn(G, tt)]) : T, L = F.x < T.x ? T.x : void 0, N = e.model.phases.map((I) => {
+  }), G = B.filter((I) => I !== null), P = G.length ? wn([T, wn(G, tt)]) : T, R = P.x < T.x ? T.x : void 0, N = e.model.phases.map((I) => {
     const O = I.ids.map((C) => x.get(C));
     return {
       id: I.id,
@@ -1919,7 +1944,7 @@ function mo(e) {
       from: re(Math.min(...O.map((C) => C.from))),
       to: re(Math.max(...O.map((C) => C.to)))
     };
-  }).sort((I, O) => I.from - O.from), z = N.map(({ id: I, label: O, from: C, to: V }, oe) => ({
+  }).sort((I, O) => I.from - O.from), U = N.map(({ id: I, label: O, from: C, to: V }, oe) => ({
     id: I,
     label: O,
     y: C,
@@ -1931,9 +1956,9 @@ function mo(e) {
     byId: new Map(A.map((I) => [I.id, I])),
     edges: e.edges.map((I) => ({ ...I, lane: void 0, row: $.get(I.id) })),
     sequence: {
-      panel: F,
-      phases: z,
-      ...L !== void 0 ? { phaseX: L } : {},
+      panel: P,
+      phases: U,
+      ...R !== void 0 ? { phaseX: R } : {},
       ...G.length ? { notes: B, inner: T } : {}
     }
   };
@@ -1978,10 +2003,10 @@ function an(e, t, s = 0) {
     h.at += r, h.ids.push(o), n.set(d, h);
   }), [...n].sort(([, o], [, r]) => o.at / o.ids.length - r.at / r.ids.length).flatMap(([o, r]) => o.startsWith("\0") ? r.ids : an(r.ids, t, s + 1));
 }
-const ui = 8;
+const pi = 8;
 function Dt(e = [], t = [], s) {
   const n = e.filter((r) => !t.includes(r)).length, o = t.filter((r) => !e.includes(r)).length;
-  return !n && !o ? 0 : (n + o) * dt + (s && o ? Lt : 0) + ui;
+  return !n && !o ? 0 : (n + o) * dt + (s && o ? Rt : 0) + pi;
 }
 function wo(e, t, s, n) {
   const o = new Set(e.flatMap((c) => s(c) ?? [])), r = (c, y) => (s(c) ?? []).filter((w) => !y.has(w)), d = new Set(t.flatMap((c) => s(c) ?? []));
@@ -1990,7 +2015,7 @@ function wo(e, t, s, n) {
     for (const y of t) h = Math.max(h, Dt(r(c, d), r(y, o), n));
   return h;
 }
-const kt = (e, t) => e.x < t.x + t.w && e.x + e.w > t.x && e.y < t.y + t.h && e.y + e.h > t.y, pi = (e, t) => ({
+const kt = (e, t) => e.x < t.x + t.w && e.x + e.w > t.x && e.y < t.y + t.h && e.y + e.h > t.y, ui = (e, t) => ({
   x: e.x - t,
   y: e.y - t,
   w: e.w + 2 * t,
@@ -2014,42 +2039,42 @@ function mi(e, t) {
   if (!s.length) return e;
   const n = new Map(t.objects.map((l) => [l.id, l])), o = new Map(
     e.objects.map((l) => [l.id, { ...l, parent: n.get(l.id).parent, soft: void 0 }])
-  ), r = [...e.diagnostics], d = (l, u) => {
+  ), r = [...e.diagnostics], d = (l, p) => {
     for (let a = n.get(l)?.parent; a && a !== "root"; a = n.get(a)?.parent)
-      if (a === u) return !0;
+      if (a === p) return !0;
     return !1;
   }, h = (l) => {
-    let u = 0;
-    for (let a = n.get(l).parent; a !== "root"; a = n.get(a).parent) u++;
-    return u;
-  }, c = (l) => l.frame === "soft" ? (l.hull ?? []).map((u) => ({ ...u, x: u.x + l.x, y: u.y + l.y })) : l.frame ? [] : [l];
-  for (const l of [...s].sort((u, a) => h(a.id) - h(u.id))) {
-    const u = [...o.values()].filter((v) => d(v.id, l.id)), a = o.get(st(n, l.id)), i = a ? so(a, _t(e.look, a.titleLines)) : { x: 0, y: 0 }, g = [...o.values()].filter(
+    let p = 0;
+    for (let a = n.get(l).parent; a !== "root"; a = n.get(a).parent) p++;
+    return p;
+  }, c = (l) => l.frame === "soft" ? (l.hull ?? []).map((p) => ({ ...p, x: p.x + l.x, y: p.y + l.y })) : l.frame ? [] : [l];
+  for (const l of [...s].sort((p, a) => h(a.id) - h(p.id))) {
+    const p = [...o.values()].filter((v) => d(v.id, l.id)), a = o.get(st(n, l.id)), i = a ? so(a, _t(e.look, a.titleLines)) : { x: 0, y: 0 }, g = [...o.values()].filter(
       (v) => !v.frame && !d(v.id, l.id) && !d(l.id, v.id)
-    ), f = u.flatMap((v) => c(v).map((p) => pi(p, dt)));
+    ), f = p.flatMap((v) => c(v).map((u) => ui(u, dt)));
     let M = [], k = 0;
     if (f.length) {
       const v = f.reduce((B, G) => G.y < B.y || G.y === B.y && G.x < B.x ? G : B);
-      v.y -= Lt, v.h += Lt, M = [v, ...f.filter((B) => B !== v)];
-      const p = Math.min(...M.map((B) => B.x)), A = Math.min(...M.map((B) => B.y)), m = {
-        x: p,
+      v.y -= Rt, v.h += Rt, M = [v, ...f.filter((B) => B !== v)];
+      const u = Math.min(...M.map((B) => B.x)), A = Math.min(...M.map((B) => B.y)), m = {
+        x: u,
         y: A,
-        w: Math.max(...M.map((B) => B.x + B.w)) - p,
+        w: Math.max(...M.map((B) => B.x + B.w)) - u,
         h: Math.max(...M.map((B) => B.y + B.h)) - A
       };
       g.some((B) => kt(B, m)) || (M = [m]);
-      const b = (B, G) => Math.max(G.x - (B.x + B.w), B.x - (G.x + G.w), G.y - (B.y + B.h), B.y - (G.y + G.h), 0), T = [M[0]], P = M.slice(1), X = [];
-      for (; P.length; ) {
+      const b = (B, G) => Math.max(G.x - (B.x + B.w), B.x - (G.x + G.w), G.y - (B.y + B.h), B.y - (G.y + G.h), 0), T = [M[0]], F = M.slice(1), X = [];
+      for (; F.length; ) {
         let B = { gap: 1 / 0, a: M[0], i: 0 };
-        for (const L of T)
-          P.forEach((N, z) => {
-            const I = b(L, N);
-            I < B.gap && (B = { gap: I, a: L, i: z });
+        for (const R of T)
+          F.forEach((N, U) => {
+            const I = b(R, N);
+            I < B.gap && (B = { gap: I, a: R, i: U });
           });
-        const [G] = P.splice(B.i, 1);
+        const [G] = F.splice(B.i, 1);
         if (T.push(G), kt(B.a, G)) continue;
-        const F = gi(B.a, G);
-        g.some((L) => kt(L, F)) ? k++ : X.push(F);
+        const P = gi(B.a, G);
+        g.some((R) => kt(R, P)) ? k++ : X.push(P);
       }
       M.push(...X);
     }
@@ -2067,7 +2092,7 @@ function mi(e, t) {
       depth: h(l.id),
       hull: M.map((v) => ({ x: v.x - S, y: v.y - D, w: v.w, h: v.h }))
     }), l.frame !== "soft") continue;
-    const E = g.filter((v) => M.some((p) => kt(v, p)));
+    const E = g.filter((v) => M.some((u) => kt(v, u)));
     E.length && r.push({
       level: "warning",
       code: "soft-overlap",
@@ -2082,17 +2107,17 @@ function mi(e, t) {
       ids: [l.id]
     });
   }
-  const y = new Map(t.objects.map((l, u) => [l.id, u])), w = [...o.values()].sort((l, u) => y.get(l.id) - y.get(u.id));
+  const y = new Map(t.objects.map((l, p) => [l.id, p])), w = [...o.values()].sort((l, p) => y.get(l.id) - y.get(p.id));
   return { ...e, model: t, objects: w, byId: new Map(w.map((l) => [l.id, l])), diagnostics: r };
 }
-const Un = 4, wi = /* @__PURE__ */ new Set(["slate", "stone"]);
+const zn = 4, wi = /* @__PURE__ */ new Set(["slate", "stone"]);
 function yi(e) {
   const t = [], s = e.objects.filter((d) => d.color !== "auto"), n = [...new Set(s.map((d) => d.color))].filter((d) => !wi.has(d));
-  n.length > Un && t.push({
+  n.length > zn && t.push({
     level: "info",
     code: "many-colors",
     message: `${n.length} accent colors (${n.join(", ")}). Use two to four, each for one role, with slate or stone for the rest, and say what each one means with legend lines.`,
-    line: s.find((d) => d.color === n[Un])?.line,
+    line: s.find((d) => d.color === n[zn])?.line,
     ids: s.filter((d) => n.includes(d.color)).map((d) => d.id)
   });
   const o = new Map(e.objects.map((d) => [d.id, d])), r = s.filter((d) => o.get(d.parent)?.color === d.color);
@@ -2123,10 +2148,10 @@ function vi(e, t, s) {
   for (; r() > yn && o < n; ) o += 8;
   return { w: Math.min(o, n), lines: Math.min(r(), yn) };
 }
-const zn = 16, ki = 1.5, Pe = 14;
+const Un = 16, ki = 1.5, Fe = 14;
 function Bt(e, t, s, n) {
   const o = Je(s, n);
-  return { a: e, b: t, w: o.w + 2 * Pe, h: o.h + 2 * Pe };
+  return { a: e, b: t, w: o.w + 2 * Fe, h: o.h + 2 * Fe };
 }
 function Jt(e, t, s, n, o) {
   let r = n;
@@ -2134,7 +2159,7 @@ function Jt(e, t, s, n, o) {
     (d.a === t && d.b === s || d.a === s && d.b === t) && (r = Math.max(r, o ? d.w : d.h));
   return r;
 }
-function Ut(e, t) {
+function zt(e, t) {
   return e.layouts.find((s) => s.scope === t) ?? {
     scope: t,
     algorithm: t === "root" ? "flow" : "column",
@@ -2163,7 +2188,7 @@ function Ei(e, t, s) {
 function Et(e, t, s) {
   const n = io(e.shape);
   if (e.shape === "diamond") return Ai(e, t, n, s);
-  const o = t?.width ?? Ei(e, n, s), r = Ot(e.shape, o, t?.height ?? n.h, s), d = gt(pt(e.label, r.width, s), s);
+  const o = t?.width ?? Ei(e, n, s), r = Ot(e.shape, o, t?.height ?? n.h, s), d = gt(ut(e.label, r.width, s), s);
   return t?.height !== void 0 ? { w: o, h: t.height, overflow: d > r.maxHeight + 0.5 } : {
     w: o,
     h: Math.max(
@@ -2185,30 +2210,30 @@ function Ai(e, t, s, n) {
 }
 const Si = 1.4;
 function ht(e, t) {
-  const s = new Map(e.map((u) => [u, []]));
-  for (const [u, a] of t)
-    u !== a && s.has(u) && s.has(a) && !s.get(u).includes(a) && s.get(u).push(a);
-  const n = new Set([...s.values()].flat()), o = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set(), d = (u) => {
-    o.set(u, "open");
-    for (const a of s.get(u))
-      o.get(a) === "open" ? r.add(u + "\0" + a) : o.has(a) || d(a);
-    o.set(u, "done");
+  const s = new Map(e.map((p) => [p, []]));
+  for (const [p, a] of t)
+    p !== a && s.has(p) && s.has(a) && !s.get(p).includes(a) && s.get(p).push(a);
+  const n = new Set([...s.values()].flat()), o = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set(), d = (p) => {
+    o.set(p, "open");
+    for (const a of s.get(p))
+      o.get(a) === "open" ? r.add(p + "\0" + a) : o.has(a) || d(a);
+    o.set(p, "done");
   };
-  for (const u of [...e.filter((a) => !n.has(a)), ...e]) o.has(u) || d(u);
-  const h = new Map(e.map((u) => [u, 0])), c = new Map(e.map((u) => [u, 0])), y = (u) => s.get(u).filter((a) => !r.has(u + "\0" + a));
-  for (const u of e) for (const a of y(u)) h.set(a, h.get(a) + 1);
-  const w = e.filter((u) => !h.get(u));
+  for (const p of [...e.filter((a) => !n.has(a)), ...e]) o.has(p) || d(p);
+  const h = new Map(e.map((p) => [p, 0])), c = new Map(e.map((p) => [p, 0])), y = (p) => s.get(p).filter((a) => !r.has(p + "\0" + a));
+  for (const p of e) for (const a of y(p)) h.set(a, h.get(a) + 1);
+  const w = e.filter((p) => !h.get(p));
   for (; w.length; ) {
-    const u = w.shift();
-    for (const a of y(u))
-      c.set(a, Math.max(c.get(a), c.get(u) + 1)), h.set(a, h.get(a) - 1), h.get(a) || w.push(a);
+    const p = w.shift();
+    for (const a of y(p))
+      c.set(a, Math.max(c.get(a), c.get(p) + 1)), h.set(a, h.get(a) - 1), h.get(a) || w.push(a);
   }
   const l = [];
-  for (const u of e) (l[c.get(u)] ||= []).push(u);
+  for (const p of e) (l[c.get(p)] ||= []).push(p);
   return l.filter(Boolean);
 }
 const yo = 3, Gn = 5, Hn = 1.25, Qe = 20, _i = 3, Ii = 2, Ti = 1;
-function Ri(e, t) {
+function Li(e, t) {
   const s = new Map(e.map((h) => [h, []]));
   for (const [h, c] of t) s.get(h)?.push(c);
   const n = (h) => {
@@ -2225,89 +2250,89 @@ function Ri(e, t) {
   }
   return r;
 }
-function zt(e, t, s, n, o, r = [], d = /* @__PURE__ */ new Set(), h = t, {
+function Ut(e, t, s, n, o, r = [], d = /* @__PURE__ */ new Set(), h = t, {
   aspect: c = yo,
   fewest: y = 4,
   room: w = s === "right" ? $t.width : $t.height
 } = {}) {
-  const l = new Map(e.map((F) => [F.id, F])), u = s === "right" ? "x" : "y", a = s === "right" ? "y" : "x", i = (F, L) => L === "x" ? F.w : F.h, g = (F) => {
-    const L = [...e].sort((z, I) => F.get(z.id)[u] - F.get(I.id)[u]), N = [];
-    for (const z of L) {
-      const I = F.get(z.id)[u], O = I + i(z, u), C = N[N.length - 1];
-      C && I < C.end ? (C.end = Math.max(C.end, O), C.ids.push(z.id)) : N.push({ start: I, end: O, ids: [z.id] });
+  const l = new Map(e.map((P) => [P.id, P])), p = s === "right" ? "x" : "y", a = s === "right" ? "y" : "x", i = (P, R) => R === "x" ? P.w : P.h, g = (P) => {
+    const R = [...e].sort((U, I) => P.get(U.id)[p] - P.get(I.id)[p]), N = [];
+    for (const U of R) {
+      const I = P.get(U.id)[p], O = I + i(U, p), C = N[N.length - 1];
+      C && I < C.end ? (C.end = Math.max(C.end, O), C.ids.push(U.id)) : N.push({ start: I, end: O, ids: [U.id] });
     }
     return N;
   }, f = g(t);
   let M = g(h);
-  const k = (F) => F.map((L) => [...L.ids].sort().join(",")).join("|");
+  const k = (P) => P.map((R) => [...R.ids].sort().join(",")).join("|");
   k(M) !== k(f) && (h = t, M = f);
-  const S = (F, L) => {
-    const N = Math.min(...e.map((I) => F.get(I.id)[L]));
-    return Math.max(...e.map((I) => F.get(I.id)[L] + i(I, L))) - N;
-  }, D = (F, L, N = 1) => F <= w * N || F <= c * L * N, _ = (F) => D(S(F, u), S(F, a)), $ = (F) => _(F) || S(F, u) <= w * Hn;
+  const S = (P, R) => {
+    const N = Math.min(...e.map((I) => P.get(I.id)[R]));
+    return Math.max(...e.map((I) => P.get(I.id)[R] + i(I, R))) - N;
+  }, D = (P, R, N = 1) => P <= w * N || P <= c * R * N, _ = (P) => D(S(P, p), S(P, a)), $ = (P) => _(P) || S(P, p) <= w * Hn;
   if (e.length < y || _(h) && $(t)) return { positions: t };
-  const x = new Map(f.flatMap((F, L) => F.ids.map((N) => [N, L]))), E = (F, L, N) => {
-    const [z, I] = [x.get(L), x.get(N)];
-    return z !== void 0 && I !== void 0 && Math.min(z, I) < F && Math.max(z, I) >= F;
-  }, v = (F) => o.filter(([L, N]) => E(F, L, N)).length, p = Ri(
-    e.map((F) => F.id),
+  const x = new Map(f.flatMap((P, R) => P.ids.map((N) => [N, R]))), E = (P, R, N) => {
+    const [U, I] = [x.get(R), x.get(N)];
+    return U !== void 0 && I !== void 0 && Math.min(U, I) < P && Math.max(U, I) >= P;
+  }, v = (P) => o.filter(([R, N]) => E(P, R, N)).length, u = Li(
+    e.map((P) => P.id),
     o
-  ), A = (F) => _i * [...d].filter((L) => o.some((N) => N[0] === L && E(F, ...N))).length + Ii * p.filter((L) => L.some((N) => E(F, L[0], N))).length, m = (F, L) => {
-    const N = (L ? r : []).filter((z) => E(F, z.a, z.b)).map((z) => (s === "right" ? z.h : z.w) - 2 * Pe);
+  ), A = (P) => _i * [...d].filter((R) => o.some((N) => N[0] === R && E(P, ...N))).length + Ii * u.filter((R) => R.some((N) => E(P, R[0], N))).length, m = (P, R) => {
+    const N = (R ? r : []).filter((U) => E(P, U.a, U.b)).map((U) => (s === "right" ? U.h : U.w) - 2 * Fe);
     return Math.max(
       n + 40,
       84,
-      N.length ? Math.max(...N) + 2 * Pe : 0,
-      (v(F) + 1) * Qe + N.reduce((z, I) => z + I, 0)
+      N.length ? Math.max(...N) + 2 * Fe : 0,
+      (v(P) + 1) * Qe + N.reduce((U, I) => U + I, 0)
     );
-  }, b = (F, L) => {
-    const N = L[L.length - 1].end - L[0].start, z = [], I = new Map(L.flatMap((O) => O.ids.map((C) => [C, O.start])));
-    for (let O = 1; O < F; O++) {
-      const C = (te) => o.filter((Me) => E(te, ...Me)).reduce((Me, [R, j]) => {
-        const [q, W] = x.get(R) < x.get(j) ? [R, j] : [j, R];
-        return Me + Math.abs(I.get(q) - ae - (I.get(W) - L[te].start));
-      }, 0) / (N / F), V = L[0].start + N * O / F, oe = (te) => v(te) + A(te) + C(te) * Ti + Math.abs(L[te].start - V) / (N / F) * 2, ae = L[z.at(-1) ?? 0].start, le = N / F, he = (te, Me, R) => L[te - 1].end - ae >= le * R && L[te - 1].end - ae <= le * (1 + Me) && L[L.length - 1].end - L[te].start <= le * (F - O) * (1 + Me), we = (te) => !A(te) && he(te, 0.25, 0.5) ? 0 : !A(te) && he(te, 0.5, 0) ? 1 : he(te, 0.25, 0.5) ? 2 : 3;
+  }, b = (P, R) => {
+    const N = R[R.length - 1].end - R[0].start, U = [], I = new Map(R.flatMap((O) => O.ids.map((C) => [C, O.start])));
+    for (let O = 1; O < P; O++) {
+      const C = (te) => o.filter((Me) => E(te, ...Me)).reduce((Me, [L, j]) => {
+        const [q, W] = x.get(L) < x.get(j) ? [L, j] : [j, L];
+        return Me + Math.abs(I.get(q) - ae - (I.get(W) - R[te].start));
+      }, 0) / (N / P), V = R[0].start + N * O / P, oe = (te) => v(te) + A(te) + C(te) * Ti + Math.abs(R[te].start - V) / (N / P) * 2, ae = R[U.at(-1) ?? 0].start, le = N / P, he = (te, Me, L) => R[te - 1].end - ae >= le * L && R[te - 1].end - ae <= le * (1 + Me) && R[R.length - 1].end - R[te].start <= le * (P - O) * (1 + Me), we = (te) => !A(te) && he(te, 0.25, 0.5) ? 0 : !A(te) && he(te, 0.5, 0) ? 1 : he(te, 0.25, 0.5) ? 2 : 3;
       let fe = 0;
-      for (let te = (z.at(-1) ?? 0) + 1; te < L.length; te++)
+      for (let te = (U.at(-1) ?? 0) + 1; te < R.length; te++)
         (!fe || we(te) < we(fe) || we(te) === we(fe) && oe(te) < oe(fe)) && (fe = te);
-      fe && z.push(fe);
+      fe && U.push(fe);
     }
-    return z;
+    return U;
   }, T = new Set(
     f.flatMap(
-      (F) => F.ids.length > 1 ? F.ids.filter((L) => !o.some(([N, z]) => N === L && z !== L)) : []
+      (P) => P.ids.length > 1 ? P.ids.filter((R) => !o.some(([N, U]) => N === R && U !== R)) : []
     )
-  ), P = (F, L) => {
+  ), F = (P, R) => {
     const N = [];
-    return L.forEach((z, I) => I === 0 || F.includes(I) ? N.push([z]) : N.at(-1).push(z)), N;
-  }, X = (F, L) => {
-    const N = P(F, L), z = new Map(N.flatMap((C, V) => C.flatMap((oe) => oe.ids.map((ae) => [ae, V])))), I = new Map(L.flatMap((C) => C.ids.map((V) => [V, C.start]))), O = /* @__PURE__ */ new Map();
+    return R.forEach((U, I) => I === 0 || P.includes(I) ? N.push([U]) : N.at(-1).push(U)), N;
+  }, X = (P, R) => {
+    const N = F(P, R), U = new Map(N.flatMap((C, V) => C.flatMap((oe) => oe.ids.map((ae) => [ae, V])))), I = new Map(R.flatMap((C) => C.ids.map((V) => [V, C.start]))), O = /* @__PURE__ */ new Map();
     for (const [C, V] of N.entries()) {
       if (!C) continue;
       const oe = [];
       for (const ae of V[0].ids) {
         if (d.has(ae)) continue;
-        const le = o.filter(([R, j]) => j === ae && R !== ae).map(([R]) => R), he = o.filter(([R, j]) => R === ae && j !== ae).map(([, R]) => R);
-        if (!le.length || le.some((R) => z.get(R) !== C - 1)) continue;
-        const we = (R, j) => I.get(R) - N[j][0].start, fe = (R) => le.reduce((j, q) => j + Math.abs(we(q, C - 1) - we(ae, R)), 0) + he.reduce((j, q) => j + Math.abs(we(ae, R) - we(q, z.get(q))), 0), te = (R) => (R === C - 1 ? 0 : le.length) + he.filter((j) => z.get(j) !== R).length;
+        const le = o.filter(([L, j]) => j === ae && L !== ae).map(([L]) => L), he = o.filter(([L, j]) => L === ae && j !== ae).map(([, L]) => L);
+        if (!le.length || le.some((L) => U.get(L) !== C - 1)) continue;
+        const we = (L, j) => I.get(L) - N[j][0].start, fe = (L) => le.reduce((j, q) => j + Math.abs(we(q, C - 1) - we(ae, L)), 0) + he.reduce((j, q) => j + Math.abs(we(ae, L) - we(q, U.get(q))), 0), te = (L) => (L === C - 1 ? 0 : le.length) + he.filter((j) => U.get(j) !== L).length;
         if (te(C - 1) > te(C) || fe(C - 1) >= fe(C)) continue;
-        const Me = le.reduce((R, j) => I.get(j) > I.get(R) ? j : R);
+        const Me = le.reduce((L, j) => I.get(j) > I.get(L) ? j : L);
         oe.push({ id: ae, source: Me, saves: fe(C) - fe(C - 1) });
       }
       oe.sort((ae, le) => le.saves - ae.saves);
       for (const ae of oe.slice(0, V[0].ids.length - 1)) O.set(ae.id, ae.source);
     }
     return O;
-  }, B = (F, L, N, z, I = /* @__PURE__ */ new Map()) => {
-    const O = P(F, L);
+  }, B = (P, R, N, U, I = /* @__PURE__ */ new Map()) => {
+    const O = F(P, R);
     if (I.size) {
       N = new Map(N);
       const he = [];
       for (const [we, fe] of I) {
         const te = l.get(we);
-        let R = N.get(fe)[a] + (i(l.get(fe), a) - i(te, a)) / 2;
-        for (const j of he) R < j.hi + n && R + i(te, a) > j.lo && (R = j.hi + n);
-        he.push({ lo: R, hi: R + i(te, a) }), N.set(we, { ...N.get(we), [a]: R });
+        let L = N.get(fe)[a] + (i(l.get(fe), a) - i(te, a)) / 2;
+        for (const j of he) L < j.hi + n && L + i(te, a) > j.lo && (L = j.hi + n);
+        he.push({ lo: L, hi: L + i(te, a) }), N.set(we, { ...N.get(we), [a]: L });
       }
     }
     const C = /* @__PURE__ */ new Map(), V = [];
@@ -2316,15 +2341,15 @@ function zt(e, t, s, n, o, r = [], d = /* @__PURE__ */ new Set(), h = t, {
       const fe = O[he + 1]?.[0].ids ?? [], te = [
         ...we.flatMap((Y) => Y.ids).filter((Y) => !I.has(Y)),
         ...fe.filter((Y) => I.has(Y))
-      ], Me = Math.min(...te.map((Y) => N.get(Y)[u])), R = Math.min(...te.map((Y) => N.get(Y)[a])), j = Math.max(...te.map((Y) => N.get(Y)[a] + i(l.get(Y), a)));
+      ], Me = Math.min(...te.map((Y) => N.get(Y)[p])), L = Math.min(...te.map((Y) => N.get(Y)[a])), j = Math.max(...te.map((Y) => N.get(Y)[a] + i(l.get(Y), a)));
       for (const Y of te) {
-        const H = N.get(Y), J = H[u] - Me, se = H[a] - R + oe;
+        const H = N.get(Y), J = H[p] - Me, se = H[a] - L + oe;
         C.set(Y, s === "right" ? { x: J, y: se } : { x: se, y: J });
       }
-      const q = he < F.length ? m(F[he], z) : 0, W = te.filter((Y) => !T.has(Y)), ee = W.length ? W : te;
-      oe += j - R + q, le += Math.max(...ee.map((Y) => N.get(Y)[a] + i(l.get(Y), a))) - Math.min(...ee.map((Y) => N.get(Y)[a])) + q, ae = Math.max(
+      const q = he < P.length ? m(P[he], U) : 0, W = te.filter((Y) => !T.has(Y)), ee = W.length ? W : te;
+      oe += j - L + q, le += Math.max(...ee.map((Y) => N.get(Y)[a] + i(l.get(Y), a))) - Math.min(...ee.map((Y) => N.get(Y)[a])) + q, ae = Math.max(
         ae,
-        Math.max(...te.map((Y) => N.get(Y)[u] + i(l.get(Y), u))) - Me
+        Math.max(...te.map((Y) => N.get(Y)[p] + i(l.get(Y), p))) - Me
       ), V.push(te);
     }
     return {
@@ -2338,73 +2363,73 @@ function zt(e, t, s, n, o, r = [], d = /* @__PURE__ */ new Set(), h = t, {
   };
   let G = 0;
   if (!_(h))
-    for (let F = 2; F <= f.length && !G; F++) {
-      const L = B(b(F, M), M, h, !1);
-      L.count === F && D(L.length, L.depth) && (G = F);
+    for (let P = 2; P <= f.length && !G; P++) {
+      const R = B(b(P, M), M, h, !1);
+      R.count === P && D(R.length, R.depth) && (G = P);
     }
-  for (let F = Math.max(2, G); F <= f.length; F++) {
-    const L = b(F, M), N = B(L, f, t, !0), z = F === G ? Hn : 1;
-    if (N.count !== F || !D(N.length, N.depth, z)) continue;
-    const I = X(L, M), O = I.size ? B(L, f, t, !0, I) : void 0, C = O && D(O.length, O.depth, z) ? O : N;
+  for (let P = Math.max(2, G); P <= f.length; P++) {
+    const R = b(P, M), N = B(R, f, t, !0), U = P === G ? Hn : 1;
+    if (N.count !== P || !D(N.length, N.depth, U)) continue;
+    const I = X(R, M), O = I.size ? B(R, f, t, !0, I) : void 0, C = O && D(O.length, O.depth, U) ? O : N;
     return { positions: C.out, fold: { bands: C.bands, axis: s } };
   }
   return { positions: t };
 }
-function Li(e, t, s, n, o) {
+function Ri(e, t, s, n, o) {
   const r = /* @__PURE__ */ new Map();
   for (const { scope: d, fold: h } of e) {
-    const c = h.axis === "right", y = (S) => c ? S.y : S.x, w = (S) => c ? S.y + S.h : S.x + S.w, l = (S) => c ? S.x : S.y, u = (S) => c ? S.x + S.w : S.y + S.h, a = (S) => (l(S) + u(S)) / 2, i = (S) => (y(S) + w(S)) / 2, g = (S, D) => l(S) < u(D) && u(S) > l(D), f = new Map(h.bands.flatMap((S, D) => S.map((_) => [_, D]))), M = (S) => f.get(n(S.id, d) ?? ""), k = (S) => [...s.values()].filter((D) => D.type !== "group" && M(D) === S);
+    const c = h.axis === "right", y = (S) => c ? S.y : S.x, w = (S) => c ? S.y + S.h : S.x + S.w, l = (S) => c ? S.x : S.y, p = (S) => c ? S.x + S.w : S.y + S.h, a = (S) => (l(S) + p(S)) / 2, i = (S) => (y(S) + w(S)) / 2, g = (S, D) => l(S) < p(D) && p(S) > l(D), f = new Map(h.bands.flatMap((S, D) => S.map((_) => [_, D]))), M = (S) => f.get(n(S.id, d) ?? ""), k = (S) => [...s.values()].filter((D) => D.type !== "group" && M(D) === S);
     for (let S = 0; S + 1 < h.bands.length; S++) {
-      const D = h.bands[S].map((G) => s.get(G)), _ = h.bands[S + 1].map((G) => s.get(G)), $ = Math.max(...D.map(w)), x = Math.min(..._.map(y)), E = Math.max(...D.map(u)) + Qe, v = Math.min(..._.map(l)) - Qe, [p, A] = [k(S), k(S + 1)], m = t.flatMap((G) => {
-        const F = s.get(G.source), L = s.get(G.target);
-        if (M(F) !== S || M(L) !== S + 1) return [];
+      const D = h.bands[S].map((G) => s.get(G)), _ = h.bands[S + 1].map((G) => s.get(G)), $ = Math.max(...D.map(w)), x = Math.min(..._.map(y)), E = Math.max(...D.map(p)) + Qe, v = Math.min(..._.map(l)) - Qe, [u, A] = [k(S), k(S + 1)], m = t.flatMap((G) => {
+        const P = s.get(G.source), R = s.get(G.target);
+        if (M(P) !== S || M(R) !== S + 1) return [];
         if (G.from !== "auto" || G.to !== "auto") return [];
-        const N = p.some((O) => y(O) > y(F) && g(O, F)), z = n(G.target, d) !== G.target || A.some((O) => y(O) < y(L) && g(O, L)), I = (O, C) => y(O) < w(C) && w(O) > y(C);
-        return N && p.some((O) => I(O, F) && l(O) >= u(F)) ? [] : z && A.some((O) => I(O, L) && u(O) <= l(L)) ? [] : [{ id: G.id, source: F, target: L, leave: N, enter: z }];
+        const N = u.some((O) => y(O) > y(P) && g(O, P)), U = n(G.target, d) !== G.target || A.some((O) => y(O) < y(R) && g(O, R)), I = (O, C) => y(O) < w(C) && w(O) > y(C);
+        return N && u.some((O) => I(O, P) && l(O) >= p(P)) ? [] : U && A.some((O) => I(O, R) && p(O) <= l(R)) ? [] : [{ id: G.id, source: P, target: R, leave: N, enter: U }];
       }), b = /* @__PURE__ */ new Map(), T = /* @__PURE__ */ new Map();
       for (const G of m)
         G.leave || T.set(G.source.id, [...T.get(G.source.id) ?? [], G]);
       for (const G of T.values()) {
-        const F = (L) => Math.abs(a(L.target) - a(L.source)) + Math.abs(i(L.target) - i(L.source));
-        G.sort((L, N) => F(L) - F(N) || (L.id < N.id ? -1 : 1)), G.forEach((L, N) => {
-          const z = a(L.target) < a(L.source) ? -1 : 1, I = Math.ceil(N / 2) * o * (N % 2 ? z : -z);
-          b.set(L.id, a(L.source) + I);
+        const P = (R) => Math.abs(a(R.target) - a(R.source)) + Math.abs(i(R.target) - i(R.source));
+        G.sort((R, N) => P(R) - P(N) || (R.id < N.id ? -1 : 1)), G.forEach((R, N) => {
+          const U = a(R.target) < a(R.source) ? -1 : 1, I = Math.ceil(N / 2) * o * (N % 2 ? U : -U);
+          b.set(R.id, a(R.source) + I);
         });
       }
       if (!m.length || x - $ < (m.length + 1) * Qe) continue;
-      const P = (G) => {
-        const F = G.filter((N) => N.leave), L = G.filter((N) => N.enter);
-        return G.map((N, z) => ({
+      const F = (G) => {
+        const P = G.filter((N) => N.leave), R = G.filter((N) => N.enter);
+        return G.map((N, U) => ({
           w: N,
-          at: re($ + (x - $) * (z + 1) / (G.length + 1)),
-          leave: N.leave ? re(E + Qe * F.indexOf(N)) : void 0,
-          enter: N.enter ? re(v - Qe * (L.length - 1 - L.indexOf(N))) : void 0
+          at: re($ + (x - $) * (U + 1) / (G.length + 1)),
+          leave: N.leave ? re(E + Qe * P.indexOf(N)) : void 0,
+          enter: N.enter ? re(v - Qe * (R.length - 1 - R.indexOf(N))) : void 0
         }));
-      }, X = (G) => P(G).map(({ w: F, at: L, leave: N, enter: z }) => [
+      }, X = (G) => F(G).map(({ w: P, at: R, leave: N, enter: U }) => [
         ...N !== void 0 ? [
-          { u: u(F.source), v: i(F.source) },
-          { u: N, v: i(F.source) },
-          { u: N, v: L }
+          { u: p(P.source), v: i(P.source) },
+          { u: N, v: i(P.source) },
+          { u: N, v: R }
         ] : [
-          { u: b.get(F.id), v: $ },
-          { u: b.get(F.id), v: L }
+          { u: b.get(P.id), v: $ },
+          { u: b.get(P.id), v: R }
         ],
-        ...z !== void 0 ? [
-          { u: z, v: L },
-          { u: z, v: i(F.target) },
-          { u: l(F.target), v: i(F.target) }
+        ...U !== void 0 ? [
+          { u: U, v: R },
+          { u: U, v: i(P.target) },
+          { u: l(P.target), v: i(P.target) }
         ] : [
-          { u: a(F.target), v: L },
-          { u: a(F.target), v: x }
+          { u: a(P.target), v: R },
+          { u: a(P.target), v: x }
         ]
       ]), B = $i(
-        [...m].sort((G, F) => a(F.source) - a(G.source)),
+        [...m].sort((G, P) => a(P.source) - a(G.source)),
         (G) => Oi(X(G))
       );
-      for (const { w: G, at: F, leave: L, enter: N } of P(B))
+      for (const { w: G, at: P, leave: R, enter: N } of F(B))
         r.set(G.id, {
-          ...c ? { y: F } : { x: F },
-          ...L !== void 0 ? { leave: L } : {},
+          ...c ? { y: P } : { x: P },
+          ...R !== void 0 ? { leave: R } : {},
           ...N !== void 0 ? { enter: N } : {}
         });
     }
@@ -2426,8 +2451,8 @@ function Oi(e) {
             [r, d]
           ] : [];
           if (!y || !w) continue;
-          const l = w[0].u, u = y[0].v;
-          l > Math.min(y[0].u, y[1].u) && l < Math.max(y[0].u, y[1].u) && u > Math.min(w[0].v, w[1].v) && u < Math.max(w[0].v, w[1].v) && s++;
+          const l = w[0].u, p = y[0].v;
+          l > Math.min(y[0].u, y[1].u) && l < Math.max(y[0].u, y[1].u) && p > Math.min(w[0].v, w[1].v) && p < Math.max(w[0].v, w[1].v) && s++;
         }
   return s;
 }
@@ -2453,9 +2478,9 @@ function Di(e, t, s) {
     let [y, w] = [e.get(c.a), e.get(c.b)];
     if (!y || !w) continue;
     w[n] < y[n] && ([y, w] = [w, y]);
-    const l = y[n] + r(y, n), u = w[n];
-    if (u <= l) continue;
-    const a = (t === "right" ? c.w : c.h) - 2 * Pe, i = (t === "right" ? c.h : c.w) - 2 * Pe, g = l - a / 2 - Ge, f = u + a / 2 + Ge, M = y[o] + r(y, o) / 2, k = w[o] + r(w, o) / 2, S = Math.min(M, k) + Ge, D = Math.max(M, k) - Ge;
+    const l = y[n] + r(y, n), p = w[n];
+    if (p <= l) continue;
+    const a = (t === "right" ? c.w : c.h) - 2 * Fe, i = (t === "right" ? c.h : c.w) - 2 * Fe, g = l - a / 2 - Ge, f = p + a / 2 + Ge, M = y[o] + r(y, o) / 2, k = w[o] + r(w, o) / 2, S = Math.min(M, k) + Ge, D = Math.max(M, k) - Ge;
     if (D - S < i) continue;
     const _ = [
       ...[...e.values()].filter((v) => v[n] < f && v[n] + r(v, n) > g).map((v) => ({
@@ -2463,103 +2488,103 @@ function Di(e, t, s) {
         hi: v[o] + r(v, o) + Ge
       })),
       ...d.filter((v) => v.from < f && v.to > g)
-    ], $ = (v) => _.every((p) => v + i <= p.lo || v >= p.hi), x = (S + D - i) / 2, E = [S, x, ..._.map((v) => v.hi)].filter((v) => v >= S && v + i <= D && $(v)).sort((v, p) => Math.abs(v - x) - Math.abs(p - x))[0];
+    ], $ = (v) => _.every((u) => v + i <= u.lo || v >= u.hi), x = (S + D - i) / 2, E = [S, x, ..._.map((v) => v.hi)].filter((v) => v >= S && v + i <= D && $(v)).sort((v, u) => Math.abs(v - x) - Math.abs(u - x))[0];
     E !== void 0 && (h.add(c), d.push({ lo: E - Ge, hi: E + i + Ge, from: g, to: f }));
   }
   return h;
 }
-const Ni = 96, Pi = 1.25;
-function Fi(e, t, s, n, o) {
-  const r = new Map(e.flatMap((w, l) => w.map((u) => [u, l]))), d = (w) => !t.some(([l, u]) => l === w && u !== w), h = (w) => [
-    ...new Set(t.filter(([l, u]) => u === w && l !== w).map((l) => l[0]))
+const Ni = 96, Fi = 1.25;
+function Pi(e, t, s, n, o) {
+  const r = new Map(e.flatMap((w, l) => w.map((p) => [p, l]))), d = (w) => !t.some(([l, p]) => l === w && p !== w), h = (w) => [
+    ...new Set(t.filter(([l, p]) => p === w && l !== w).map((l) => l[0]))
   ], c = /* @__PURE__ */ new Set(), y = Math.max(...e.map(o));
   for (const [w, l] of e.entries())
     if (w)
-      for (const u of l) {
-        const a = h(u);
-        if (!s(u) || !d(u) || !a.length || a.some((M) => r.get(M) !== w - 1)) continue;
+      for (const p of l) {
+        const a = h(p);
+        if (!s(p) || !d(p) || !a.length || a.some((M) => r.get(M) !== w - 1)) continue;
         const i = [...new Set(t.filter(([M]) => a.includes(M)).map((M) => M[1]))].filter(
-          (M) => M !== u && r.get(M) === w
-        ), g = [u, ...i].filter(d).sort((M, k) => n(k) - n(M))[0], f = [...e[w - 1], ...l.filter((M) => c.has(M)), u];
-        o(f) > Pi * y || (i.some((M) => !d(M)) || g !== u) && c.add(u);
+          (M) => M !== p && r.get(M) === w
+        ), g = [p, ...i].filter(d).sort((M, k) => n(k) - n(M))[0], f = [...e[w - 1], ...l.filter((M) => c.has(M)), p];
+        o(f) > Fi * y || (i.some((M) => !d(M)) || g !== p) && c.add(p);
       }
   return c.size ? e.map((w, l) => [
-    ...w.filter((u) => !c.has(u)),
-    ...(e[l + 1] ?? []).filter((u) => c.has(u))
+    ...w.filter((p) => !c.has(p)),
+    ...(e[l + 1] ?? []).filter((p) => c.has(p))
   ]).filter((w) => w.length) : e;
 }
 function Ci(e, t, s, n, o, r, d = !1, h = [], c = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), w = () => {
 }) {
-  const l = new Map(e.map((L) => [L.id, L])), u = e.map((L) => L.id), a = s === "right", i = (L) => a ? l.get(L).w : l.get(L).h, g = (L) => a ? l.get(L).h : l.get(L).w, f = (L) => l.get(L).type === "group", M = (L) => a ? L.y + L.h / 2 : L.x + L.w / 2, k = new Set(n.flat()), S = (L) => {
-    const N = !k.size || k.has(L) ? [] : (c.get(L) ?? []).flatMap((I) => t.get(I) ?? []);
+  const l = new Map(e.map((R) => [R.id, R])), p = e.map((R) => R.id), a = s === "right", i = (R) => a ? l.get(R).w : l.get(R).h, g = (R) => a ? l.get(R).h : l.get(R).w, f = (R) => l.get(R).type === "group", M = (R) => a ? R.y + R.h / 2 : R.x + R.w / 2, k = new Set(n.flat()), S = (R) => {
+    const N = !k.size || k.has(R) ? [] : (c.get(R) ?? []).flatMap((I) => t.get(I) ?? []);
     if (N.length) return N.reduce((I, O) => I + M(O), 0) / N.length;
-    const z = t.get(L);
-    return a ? z.y + l.get(L).h / 2 : z.x + l.get(L).w / 2;
-  }, D = (L, N) => Math.max(
-    Jt(o, L, N, f(L) || f(N) ? r.group : r.node, !a),
-    Dt(l.get(L).soft, l.get(N).soft, a)
-  ), _ = (L) => L.reduce((N, z, I) => N + g(z) + (I ? D(L[I - 1], z) : 0), 0), $ = Fi(
-    ht(u, n),
+    const U = t.get(R);
+    return a ? U.y + l.get(R).h / 2 : U.x + l.get(R).w / 2;
+  }, D = (R, N) => Math.max(
+    Jt(o, R, N, f(R) || f(N) ? r.group : r.node, !a),
+    Dt(l.get(R).soft, l.get(N).soft, a)
+  ), _ = (R) => R.reduce((N, U, I) => N + g(U) + (I ? D(R[I - 1], U) : 0), 0), $ = Pi(
+    ht(p, n),
     n,
     d ? f : () => !1,
     i,
     _
   ).map(
-    (L) => an(
-      [...L].sort((N, z) => S(N) - S(z) || u.indexOf(N) - u.indexOf(z)),
+    (R) => an(
+      [...R].sort((N, U) => S(N) - S(U) || p.indexOf(N) - p.indexOf(U)),
       (N) => l.get(N).soft
     )
-  ), x = new Map($.flatMap((L, N) => L.map((z) => [z, N]))), E = $.map(_), v = Math.max(...E), p = new Map(u.map((L) => [L, /* @__PURE__ */ new Set()])), A = new Map(u.map((L) => [L, /* @__PURE__ */ new Set()]));
-  for (const [L, N] of n)
-    x.get(N) > x.get(L) && (p.get(L).add(N), A.get(N).add(L));
+  ), x = new Map($.flatMap((R, N) => R.map((U) => [U, N]))), E = $.map(_), v = Math.max(...E), u = new Map(p.map((R) => [R, /* @__PURE__ */ new Set()])), A = new Map(p.map((R) => [R, /* @__PURE__ */ new Set()]));
+  for (const [R, N] of n)
+    x.get(N) > x.get(R) && (u.get(R).add(N), A.get(N).add(R));
   const m = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map();
-  for (const [L, N] of $.entries()) {
-    let z = (v - E[L]) / 2, I = -1 / 0;
+  for (const [R, N] of $.entries()) {
+    let U = (v - E[R]) / 2, I = -1 / 0;
     for (const [O, C] of N.entries()) {
-      const [V] = A.get(C), oe = A.get(C).size === 1 && p.get(V).size === 1, ae = oe ? w(V, C) : void 0, le = ae !== void 0 ? m.get(V) + ae : oe ? b.get(V) - g(C) / 2 : z, he = O ? Math.max(le, I + D(N[O - 1], C)) : le;
-      m.set(C, he), b.set(C, he + g(C) / 2), I = he + g(C), z = Math.max(z + g(C), I) + (N[O + 1] ? D(C, N[O + 1]) : 0);
+      const [V] = A.get(C), oe = A.get(C).size === 1 && u.get(V).size === 1, ae = oe ? w(V, C) : void 0, le = ae !== void 0 ? m.get(V) + ae : oe ? b.get(V) - g(C) / 2 : U, he = O ? Math.max(le, I + D(N[O - 1], C)) : le;
+      m.set(C, he), b.set(C, he + g(C) / 2), I = he + g(C), U = Math.max(U + g(C), I) + (N[O + 1] ? D(C, N[O + 1]) : 0);
     }
   }
-  const T = $.length === 1 && P($[0]);
-  function P(L) {
-    const N = L.map((C) => y.get(C));
-    if (L.length < 2 || N.some((C, V) => C === void 0 || V && C < N[V - 1]))
+  const T = $.length === 1 && F($[0]);
+  function F(R) {
+    const N = R.map((C) => y.get(C));
+    if (R.length < 2 || N.some((C, V) => C === void 0 || V && C < N[V - 1]))
       return !1;
-    const z = [];
+    const U = [];
     let I = -1 / 0;
-    for (const [C, V] of L.entries()) {
-      const oe = N[C] - N[0] + g(L[0]) / 2 - g(V) / 2;
-      z.push(C ? Math.max(oe, I + D(L[C - 1], V)) : oe), I = z[C] + g(V);
+    for (const [C, V] of R.entries()) {
+      const oe = N[C] - N[0] + g(R[0]) / 2 - g(V) / 2;
+      U.push(C ? Math.max(oe, I + D(R[C - 1], V)) : oe), I = U[C] + g(V);
     }
-    const O = N.at(-1) - N[0] + (g(L[0]) + g(L.at(-1))) / 2;
-    return I - z[0] > Math.max(E[0] * 1.25, O + 1) ? !1 : (L.forEach((C, V) => m.set(C, z[V])), !0);
+    const O = N.at(-1) - N[0] + (g(R[0]) + g(R.at(-1))) / 2;
+    return I - U[0] > Math.max(E[0] * 1.25, O + 1) ? !1 : (R.forEach((C, V) => m.set(C, U[V])), !0);
   }
   const X = Math.min(...m.values()), B = en($, h, o, s), G = /* @__PURE__ */ new Map();
-  let F = 0;
-  for (const [L, N] of $.entries()) {
+  let P = 0;
+  for (const [R, N] of $.entries()) {
     for (const O of N) {
       const C = re(m.get(O) - X);
-      G.set(O, a ? { x: F, y: C } : { x: C, y: F });
+      G.set(O, a ? { x: P, y: C } : { x: C, y: P });
     }
-    const z = $[L + 1];
-    if (!z) break;
+    const U = $[R + 1];
+    if (!U) break;
     let I = Math.max(
-      N.some(f) || z.some(f) ? r.group : r.rank,
-      B[L],
-      wo(N, z, (O) => l.get(O).soft, !a)
+      N.some(f) || U.some(f) ? r.group : r.rank,
+      B[R],
+      wo(N, U, (O) => l.get(O).soft, !a)
     );
     for (const O of o)
-      Math.min(x.get(O.a), x.get(O.b)) === L && Math.abs(x.get(O.a) - x.get(O.b)) === 1 && (I = Math.max(I, a ? O.w : O.h));
-    F += Math.max(...N.map(i)) + I;
+      Math.min(x.get(O.a), x.get(O.b)) === R && Math.abs(x.get(O.a) - x.get(O.b)) === 1 && (I = Math.max(I, a ? O.w : O.h));
+    P += Math.max(...N.map(i)) + I;
   }
   return { positions: G, axis: s, followed: T };
 }
 const Nt = 20;
 function en(e, t, s, n) {
-  const o = new Map(e.flatMap((h, c) => h.map((y) => [y, c]))), r = (h) => n === "right" ? 2 * Pe : h.h, d = 2 * Pe;
+  const o = new Map(e.flatMap((h, c) => h.map((y) => [y, c]))), r = (h) => n === "right" ? 2 * Fe : h.h, d = 2 * Fe;
   return e.slice(0, -1).map((h, c) => {
     let y = 0, w = 0;
-    const l = [...s], u = [], a = [];
+    const l = [...s], p = [], a = [];
     for (const g of t) {
       const f = g.a !== void 0 ? o.get(g.a) : void 0, M = g.b !== void 0 ? o.get(g.b) : void 0;
       let k;
@@ -2574,29 +2599,29 @@ function en(e, t, s, n) {
         if (k = f !== void 0 ? f === c : M === c + 1, !k) continue;
         g.label && s.length && (w += r(g.label) - (n === "right" ? d : 0));
       }
-      y++, u.push(g);
+      y++, p.push(g);
     }
     return a.some(
-      (g) => u.some((f) => !(f.a && f.b) && [f.a, f.b].some((M) => M && (M === g.a || M === g.b)))
+      (g) => p.some((f) => !(f.a && f.b) && [f.a, f.b].some((M) => M && (M === g.a || M === g.b)))
     ) ? 2 * Nt + (y - 1) * Qe + w : 0;
   });
 }
 function ji(e, t, s, n, o) {
   const r = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map();
   for (const [w, l] of t) {
-    const u = s.get(w), a = s.get(l);
-    if (u === void 0 || a === void 0 || u === a) continue;
-    const [i, g] = u < a ? [w, l] : [l, w];
+    const p = s.get(w), a = s.get(l);
+    if (p === void 0 || a === void 0 || p === a) continue;
+    const [i, g] = p < a ? [w, l] : [l, w];
     r.set(g, [...r.get(g) ?? [], i]), d.set(i, [...d.get(i) ?? [], g]);
   }
   const h = (w) => n.get(w) + o(w) / 2, c = (w, l) => {
     if (!w.some((M) => l.get(M)?.length)) return;
-    const u = [];
+    const p = [];
     for (const [M, k] of w.entries())
-      u.push(M ? u[M - 1] + n.get(k) - n.get(w[M - 1]) : 0);
+      p.push(M ? p[M - 1] + n.get(k) - n.get(w[M - 1]) : 0);
     const a = w.map((M, k) => {
       const S = (l.get(M) ?? []).map(h).sort((_, $) => _ - $);
-      return (S.length ? S[S.length - 1 >> 1] : h(M)) - o(M) / 2 - u[k];
+      return (S.length ? S[S.length - 1 >> 1] : h(M)) - o(M) / 2 - p[k];
     }), i = [], g = (M) => M[M.length >> 1];
     for (const M of a)
       for (i.push([M]); i.length > 1 && g(i.at(-2)) > g(i.at(-1)); ) {
@@ -2605,7 +2630,7 @@ function ji(e, t, s, n, o) {
       }
     let f = 0;
     for (const M of i)
-      for (let k = 0; k < M.length; k++, f++) n.set(w[f], re(g(M) + u[f]));
+      for (let k = 0; k < M.length; k++, f++) n.set(w[f], re(g(M) + p[f]));
   };
   for (const w of e.slice(1)) c(w, r);
   for (const w of [...e].reverse().slice(1)) c(w, d);
@@ -2633,12 +2658,12 @@ function Bi(e, t, s, n) {
     return c > 1 ? 2 * Nt + (c - 1) * Mo : 0;
   });
 }
-function Ui(e, t, s, n = [], o = [], r) {
+function zi(e, t, s, n = [], o = [], r) {
   const d = /* @__PURE__ */ new Map(), h = t.gap, c = nt(t);
   let y;
   const w = new Map(e.map((l) => [l.id, l]));
   if (t.algorithm === "row" || t.algorithm === "column") {
-    const l = t.algorithm === "row", u = en(
+    const l = t.algorithm === "row", p = en(
       e.map((i) => [i.id]),
       o,
       n,
@@ -2649,26 +2674,26 @@ function Ui(e, t, s, n = [], o = [], r) {
       const f = e[i + 1]?.id ?? "";
       d.set(g.id, l ? { x: a, y: 0 } : { x: 0, y: a }), a += (l ? g.w : g.h) + Math.max(
         Jt(n, g.id, f, h, l),
-        u[i] ?? 0,
+        p[i] ?? 0,
         Dt(g.soft, e[i + 1]?.soft, !l)
       );
     }
   } else {
-    const l = e.map((v) => v.id), u = (v) => w.get(v).soft, a = s.length ? qi(ht(l, s), s, (v) => an(v, u)) : null, i = a ? a.layers : l.map((v) => [v]), g = !!a && a.chains.size >= Gi && a.crossings <= 2 * a.chains.size && !e.some((v) => v.soft?.length), f = g ? a.order : i, M = g ? s.flatMap(([v, p], A) => {
-      const m = [v, ...a.chains.get(A) ?? [], p];
+    const l = e.map((v) => v.id), p = (v) => w.get(v).soft, a = s.length ? qi(ht(l, s), s, (v) => an(v, p)) : null, i = a ? a.layers : l.map((v) => [v]), g = !!a && a.chains.size >= Gi && a.crossings <= 2 * a.chains.size && !e.some((v) => v.soft?.length), f = g ? a.order : i, M = g ? s.flatMap(([v, u], A) => {
+      const m = [v, ...a.chains.get(A) ?? [], u];
       return m.slice(1).map((b, T) => [m[T], b]);
-    }) : s, k = (v) => je(v) ? 0 : c === "right" ? w.get(v).w : w.get(v).h, S = (v) => je(v) ? 0 : c === "right" ? w.get(v).h : w.get(v).w, D = new Map(f.flatMap((v, p) => v.map((A) => [A, p]))), _ = en(i, o, n, c), $ = /* @__PURE__ */ new Map();
+    }) : s, k = (v) => je(v) ? 0 : c === "right" ? w.get(v).w : w.get(v).h, S = (v) => je(v) ? 0 : c === "right" ? w.get(v).h : w.get(v).w, D = new Map(f.flatMap((v, u) => v.map((A) => [A, u]))), _ = en(i, o, n, c), $ = /* @__PURE__ */ new Map();
     for (const v of f) {
-      let p = 0, A;
+      let u = 0, A;
       for (const [m, b] of v.entries()) {
         const T = v[m - 1];
-        T !== void 0 && je(T) ? p += je(b) ? Mo : Nt : T !== void 0 && je(b) && (p += Nt), !je(b) && A !== void 0 && (p = Math.max(
-          p,
+        T !== void 0 && je(T) ? u += je(b) ? Mo : Nt : T !== void 0 && je(b) && (u += Nt), !je(b) && A !== void 0 && (u = Math.max(
+          u,
           $.get(A) + S(A) + Math.max(
             Jt(n, A, b, h, c !== "right"),
-            Dt(u(A), u(b), c === "right")
+            Dt(p(A), p(b), c === "right")
           )
-        )), $.set(b, p), p += S(b), je(b) || (A = b);
+        )), $.set(b, u), u += S(b), je(b) || (A = b);
       }
     }
     s.length && ji(f, M, D, $, S);
@@ -2677,23 +2702,23 @@ function Ui(e, t, s, n = [], o = [], r) {
       c,
       f,
       s.flatMap(
-        ([p, A], m) => D.get(p) < D.get(A) ? [{ id: String(m), chain: [p, ...a.chains.get(m) ?? [], A] }] : []
+        ([u, A], m) => D.get(u) < D.get(A) ? [{ id: String(m), chain: [u, ...a.chains.get(m) ?? [], A] }] : []
       ),
-      (p) => je(p) ? void 0 : c === "right" ? { x: 0, y: $.get(p), w: k(p), h: S(p) } : { x: $.get(p), y: 0, w: S(p), h: k(p) },
-      (p) => $.get(p),
+      (u) => je(u) ? void 0 : c === "right" ? { x: 0, y: $.get(u), w: k(u), h: S(u) } : { x: $.get(u), y: 0, w: S(u), h: k(u) },
+      (u) => $.get(u),
       r
-    ).forEach((p, A) => x[A] = Math.max(x[A] ?? 0, p));
+    ).forEach((u, A) => x[A] = Math.max(x[A] ?? 0, u));
     let E = 0;
-    for (const [v, p] of i.entries()) {
+    for (const [v, u] of i.entries()) {
       let A = Math.max(h, _[v] ?? 0, x[v] ?? 0);
-      for (const m of p) {
+      for (const m of u) {
         const b = $.get(m);
         d.set(m, c === "right" ? { x: E, y: b } : { x: b, y: E });
       }
-      i[v + 1] && (A = Math.max(A, wo(p, i[v + 1], u, c === "down")));
+      i[v + 1] && (A = Math.max(A, wo(u, i[v + 1], p, c === "down")));
       for (const m of n)
         Math.min(D.get(m.a), D.get(m.b)) === v && Math.abs(D.get(m.a) - D.get(m.b)) === 1 && (A = Math.max(A, c === "right" ? m.w : m.h));
-      E += Math.max(...p.map(k)) + A;
+      E += Math.max(...u.map(k)) + A;
     }
     g && (y = {
       order: f,
@@ -2706,19 +2731,19 @@ function Ui(e, t, s, n = [], o = [], r) {
 function xo(e, t, s = (n) => n) {
   const n = [s(e[0])];
   for (let o = 1; o < e.length; o++) {
-    const r = new Map(n[o - 1].map((l, u) => [l, u])), h = e[o].map((l, u) => {
+    const r = new Map(n[o - 1].map((l, p) => [l, p])), h = e[o].map((l, p) => {
       const a = t.flatMap(([i, g]) => i === l ? [g] : g === l ? [i] : []).filter((i) => r.has(i)).map((i) => r.get(i));
       return {
         id: l,
         key: a.length ? a.reduce((i, g) => i + g, 0) / a.length : null,
-        k: u
+        k: p
       };
-    }).filter((l) => l.key !== null), c = [...h].sort((l, u) => l.key - u.key || l.k - u.k), y = h.map((l) => l.k), w = [...e[o]];
-    c.forEach((l, u) => w[y[u]] = l.id), n.push(s(w));
+    }).filter((l) => l.key !== null), c = [...h].sort((l, p) => l.key - p.key || l.k - p.k), y = h.map((l) => l.k), w = [...e[o]];
+    c.forEach((l, p) => w[y[p]] = l.id), n.push(s(w));
   }
   return n;
 }
-const zi = 8;
+const Ui = 8;
 function qi(e, t, s = (n) => n) {
   const n = xo(e, t, s), o = new Map(n.flatMap((_, $) => _.map((x) => [x, $]))), r = n.map((_) => [..._]), d = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map(), c = (_, $) => {
     h.set(_, [...h.get(_) ?? [], $]), d.set($, [...d.get($) ?? [], _]);
@@ -2726,65 +2751,65 @@ function qi(e, t, s = (n) => n) {
   for (const [_, [$, x]] of t.entries()) {
     const E = o.get($), v = o.get(x);
     if (E === void 0 || v === void 0 || E >= v) continue;
-    let p = $;
+    let u = $;
     w.set(_, []);
     for (let A = E + 1; A < v; A++) {
       const m = `\0${_}:${A}`;
       w.get(_).push(m);
-      const b = r[A].indexOf(p);
-      r[A].splice(b < 0 ? r[A].length : b + 1, 0, m), c(p, m), p = m;
+      const b = r[A].indexOf(u);
+      r[A].splice(b < 0 ? r[A].length : b + 1, 0, m), c(u, m), u = m;
     }
-    c(p, x);
+    c(u, x);
   }
   if (r.length < 2) return { layers: n, order: n, chains: w, crossings: 0 };
-  const l = (_) => s(_.filter(($) => y.has($))), u = (_) => {
+  const l = (_) => s(_.filter(($) => y.has($))), p = (_) => {
     const $ = l(_);
     let x = 0;
     return _.map((E) => y.has(E) ? $[x++] : E);
   }, a = (_) => {
-    const $ = new Map(r[_ + 1].map((v, p) => [v, p])), x = r[_].flatMap(
-      (v) => (h.get(v) ?? []).map((p) => $.get(p)).sort((p, A) => p - A)
+    const $ = new Map(r[_ + 1].map((v, u) => [v, u])), x = r[_].flatMap(
+      (v) => (h.get(v) ?? []).map((u) => $.get(u)).sort((u, A) => u - A)
     );
     let E = 0;
     for (let v = 0; v < x.length; v++)
-      for (let p = v + 1; p < x.length; p++) x[v] > x[p] && E++;
+      for (let u = v + 1; u < x.length; u++) x[v] > x[u] && E++;
     return E;
   }, i = () => r.slice(1).reduce((_, $, x) => _ + a(x), 0), g = (_, $, x, E) => {
     let v = 0;
-    for (const p of x.get(_) ?? [])
-      for (const A of x.get($) ?? []) E.get(p) > E.get(A) && v++;
+    for (const u of x.get(_) ?? [])
+      for (const A of x.get($) ?? []) E.get(u) > E.get(A) && v++;
     return v;
   }, f = (_) => new Map((r[_] ?? []).map(($, x) => [$, x])), M = (_) => {
-    const $ = r[_], x = f(_ - 1), E = f(_ + 1), v = (p, A) => g(p, A, d, x) + g(p, A, h, E);
-    for (let p = !0, A = 0; p && A < $.length; A++) {
-      p = !1;
+    const $ = r[_], x = f(_ - 1), E = f(_ + 1), v = (u, A) => g(u, A, d, x) + g(u, A, h, E);
+    for (let u = !0, A = 0; u && A < $.length; A++) {
+      u = !1;
       for (let m = 0; m + 1 < $.length; m++) {
         const b = $[m], T = $[m + 1];
         if (!(v(T, b) >= v(b, T))) {
           if ([$[m], $[m + 1]] = [T, b], l($).join(`
-`) !== $.filter((P) => y.has(P)).join(`
+`) !== $.filter((F) => y.has(F)).join(`
 `)) {
             [$[m], $[m + 1]] = [b, T];
             continue;
           }
-          p = !0;
+          u = !0;
         }
       }
     }
   }, k = (_, $, x) => {
     const v = r[_].map((m, b) => {
-      const T = ($.get(m) ?? []).map((P) => x.get(P));
-      return { id: m, k: b, key: T.length ? T.reduce((P, X) => P + X, 0) / T.length : null };
-    }).filter((m) => m.key !== null), p = v.map((m) => m.k), A = [...r[_]];
-    [...v].sort((m, b) => m.key - b.key || m.k - b.k).forEach((m, b) => A[p[b]] = m.id), r[_] = u(A);
+      const T = ($.get(m) ?? []).map((F) => x.get(F));
+      return { id: m, k: b, key: T.length ? T.reduce((F, X) => F + X, 0) / T.length : null };
+    }).filter((m) => m.key !== null), u = v.map((m) => m.k), A = [...r[_]];
+    [...v].sort((m, b) => m.key - b.key || m.k - b.k).forEach((m, b) => A[u[b]] = m.id), r[_] = p(A);
   };
   let S = r.map((_) => [..._]), D = i();
-  for (let _ = 0, $ = 0; _ < zi && D && $ < 2; _++) {
-    const x = _ % 2 === 0, E = x ? r.map((p, A) => A).slice(1) : r.map((p, A) => A).reverse().slice(1);
-    for (const p of E)
-      k(p, x ? d : h, f(x ? p - 1 : p + 1)), M(p);
+  for (let _ = 0, $ = 0; _ < Ui && D && $ < 2; _++) {
+    const x = _ % 2 === 0, E = x ? r.map((u, A) => A).slice(1) : r.map((u, A) => A).reverse().slice(1);
+    for (const u of E)
+      k(u, x ? d : h, f(x ? u - 1 : u + 1)), M(u);
     const v = i();
-    v < D ? [S, D, $] = [r.map((p) => [...p]), v, 0] : $++;
+    v < D ? [S, D, $] = [r.map((u) => [...u]), v, 0] : $++;
   }
   return {
     layers: S.map((_) => _.filter(($) => y.has($))),
@@ -2811,92 +2836,92 @@ class Yn {
 function Hi(e, t, s, n) {
   const o = s.filter((l) => l.type === "stay");
   if (!o.length) return [];
-  const r = new Map(o.map((l) => [l.id, { x: l.x, y: l.y }])), d = /* @__PURE__ */ new Set(), h = n === "right" ? "x" : "y", c = n === "right" ? "y" : "x", y = (l, u) => u === "x" ? l.w : l.h, w = (l, u, a, i, g) => Math.min(u[g] + y(l, g), i[g] + y(a, g)) - Math.max(u[g], i[g]);
+  const r = new Map(o.map((l) => [l.id, { x: l.x, y: l.y }])), d = /* @__PURE__ */ new Set(), h = n === "right" ? "x" : "y", c = n === "right" ? "y" : "x", y = (l, p) => p === "x" ? l.w : l.h, w = (l, p, a, i, g) => Math.min(p[g] + y(l, g), i[g] + y(a, g)) - Math.max(p[g], i[g]);
   for (let l = 0; l < e.length; l++)
-    for (let u = l + 1; u < e.length; u++) {
-      const a = e[l], i = e[u], g = r.get(a.id), f = r.get(i.id), M = t.get(a.id), k = t.get(i.id);
+    for (let p = l + 1; p < e.length; p++) {
+      const a = e[l], i = e[p], g = r.get(a.id), f = r.get(i.id), M = t.get(a.id), k = t.get(i.id);
       !g || !f || !M || !k || w(a, M, i, k, h) > 0 || w(a, g, i, f, c) > 0 && w(a, g, i, f, h) >= Math.min(y(a, h), y(i, h)) / 2 && (d.add(a.id), d.add(i.id));
     }
   return o.filter((l) => d.has(l.id));
 }
 function Yi(e, t, s, n, o, r) {
-  const d = e.map((p) => p.id), h = new Map(e.map((p) => [p.id, p])), c = new Map(e.map((p) => [p.id, { ...t.get(p.id) }])), y = new Map(d.map((p) => [p, 1])), w = s.filter(
-    (p) => "ids" in p ? p.type === "align" && p.ids.every((A) => h.has(A)) : "id" in p && h.has(p.id)
-  ), l = /* @__PURE__ */ new Map(), u = Hi(e, t, w, r);
-  u.length && o.push({
+  const d = e.map((u) => u.id), h = new Map(e.map((u) => [u.id, u])), c = new Map(e.map((u) => [u.id, { ...t.get(u.id) }])), y = new Map(d.map((u) => [u, 1])), w = s.filter(
+    (u) => "ids" in u ? u.type === "align" && u.ids.every((A) => h.has(A)) : "id" in u && h.has(u.id)
+  ), l = /* @__PURE__ */ new Map(), p = Hi(e, t, w, r);
+  p.length && o.push({
     level: "info",
     code: "stale-stay",
-    message: `The stays on ${u.map((p) => p.id).join(", ")} no longer fit ${n}'s arrangement, so they were ignored. Drag again to anchor the new layout.`,
-    line: u[0].line,
-    ids: u.map((p) => p.id)
+    message: `The stays on ${p.map((u) => u.id).join(", ")} no longer fit ${n}'s arrangement, so they were ignored. Drag again to anchor the new layout.`,
+    line: p[0].line,
+    ids: p.map((u) => u.id)
   });
-  for (const p of w)
-    p.type === "stay" && !u.includes(p) && (c.set(p.id, { x: p.x, y: p.y }), y.set(p.id, p.weight), l.set(p.id, { pos: { x: p.x, y: p.y }, hint: p }));
-  for (const p of w)
-    if (p.type === "nudge") {
-      const A = t.get(p.id), m = { x: A.x + p.dx, y: A.y + p.dy };
-      c.set(p.id, m), y.set(p.id, 4), l.set(p.id, { pos: m, hint: p });
+  for (const u of w)
+    u.type === "stay" && !p.includes(u) && (c.set(u.id, { x: u.x, y: u.y }), y.set(u.id, u.weight), l.set(u.id, { pos: { x: u.x, y: u.y }, hint: u }));
+  for (const u of w)
+    if (u.type === "nudge") {
+      const A = t.get(u.id), m = { x: A.x + u.dx, y: A.y + u.dy };
+      c.set(u.id, m), y.set(u.id, 4), l.set(u.id, { pos: m, hint: u });
     }
   const a = new Map(
-    w.flatMap((p) => p.type === "near" && h.has(p.ref) ? [[p.id, p]] : [])
-  ), i = /* @__PURE__ */ new Set(), g = /* @__PURE__ */ new Set(), f = (p) => {
-    const A = a.get(p);
-    if (i.has(p) || !A) return;
-    if (g.has(p))
-      throw new Re(
+    w.flatMap((u) => u.type === "near" && h.has(u.ref) ? [[u.id, u]] : [])
+  ), i = /* @__PURE__ */ new Set(), g = /* @__PURE__ */ new Set(), f = (u) => {
+    const A = a.get(u);
+    if (i.has(u) || !A) return;
+    if (g.has(u))
+      throw new Le(
         `Relative placement cycle in ${n}. Replace one near with nudge.`,
         A.line
       );
-    g.add(p), f(A.ref);
-    const m = h.get(p), b = h.get(A.ref), T = c.get(A.ref);
-    let P = T.x + (b.w - m.w) / 2, X = T.y + (b.h - m.h) / 2;
-    A.side === "right" || A.side === "left" ? (P = A.side === "right" ? T.x + b.w + A.gap : T.x - m.w - A.gap, X += A.offset) : (X = A.side === "below" ? T.y + b.h + A.gap : T.y - m.h - A.gap, P += A.offset), c.set(p, { x: P, y: X }), y.set(p, 5), l.set(p, { pos: { x: P, y: X }, hint: A }), g.delete(p), i.add(p);
+    g.add(u), f(A.ref);
+    const m = h.get(u), b = h.get(A.ref), T = c.get(A.ref);
+    let F = T.x + (b.w - m.w) / 2, X = T.y + (b.h - m.h) / 2;
+    A.side === "right" || A.side === "left" ? (F = A.side === "right" ? T.x + b.w + A.gap : T.x - m.w - A.gap, X += A.offset) : (X = A.side === "below" ? T.y + b.h + A.gap : T.y - m.h - A.gap, F += A.offset), c.set(u, { x: F, y: X }), y.set(u, 5), l.set(u, { pos: { x: F, y: X }, hint: A }), g.delete(u), i.add(u);
   };
   d.forEach(f);
-  for (const p of w)
-    if (p.type === "align" && p.strength === "prefer") {
-      const A = h.get(p.ids[0]), m = c.get(A.id), b = (P) => p.axis === "x" ? P.w : P.h, T = m[p.axis] + b(A) / 2;
-      for (const P of p.ids.slice(1)) c.get(P)[p.axis] = T - b(h.get(P)) / 2;
+  for (const u of w)
+    if (u.type === "align" && u.strength === "prefer") {
+      const A = h.get(u.ids[0]), m = c.get(A.id), b = (F) => u.axis === "x" ? F.w : F.h, T = m[u.axis] + b(A) / 2;
+      for (const F of u.ids.slice(1)) c.get(F)[u.axis] = T - b(h.get(F)) / 2;
     }
-  const M = new Map(w.flatMap((p) => p.type === "pin" ? [[p.id, p]] : []));
-  for (const [p, A] of M) c.set(p, { x: A.x, y: A.y });
-  const k = (p, A) => (p === "x" ? h.get(A).w : h.get(A).h) / 2, S = { x: new Yn(d), y: new Yn(d) };
-  for (const p of w)
-    if (p.type === "align" && p.strength === "required")
-      for (const A of p.ids.slice(1)) {
-        const m = /* @__PURE__ */ new Set([S[p.axis].find(p.ids[0]), S[p.axis].find(A)]), b = d.filter((T) => M.has(T) && m.has(S[p.axis].find(T))).map((T) => c.get(T)[p.axis] + k(p.axis, T));
+  const M = new Map(w.flatMap((u) => u.type === "pin" ? [[u.id, u]] : []));
+  for (const [u, A] of M) c.set(u, { x: A.x, y: A.y });
+  const k = (u, A) => (u === "x" ? h.get(A).w : h.get(A).h) / 2, S = { x: new Yn(d), y: new Yn(d) };
+  for (const u of w)
+    if (u.type === "align" && u.strength === "required")
+      for (const A of u.ids.slice(1)) {
+        const m = /* @__PURE__ */ new Set([S[u.axis].find(u.ids[0]), S[u.axis].find(A)]), b = d.filter((T) => M.has(T) && m.has(S[u.axis].find(T))).map((T) => c.get(T)[u.axis] + k(u.axis, T));
         b.length > 1 && Math.max(...b) - Math.min(...b) > 0.01 ? o.push({
           level: "error",
           code: "pin-align-conflict",
-          message: `Pins conflict with required ${p.axis} alignment in ${n}. The pins were kept.`,
-          line: p.line,
-          ids: p.ids
-        }) : S[p.axis].join(p.ids[0], A);
+          message: `Pins conflict with required ${u.axis} alignment in ${n}. The pins were kept.`,
+          line: u.line,
+          ids: u.ids
+        }) : S[u.axis].join(u.ids[0], A);
       }
   const D = { x: /* @__PURE__ */ new Map(), y: /* @__PURE__ */ new Map() };
-  for (const p of ["x", "y"])
+  for (const u of ["x", "y"])
     for (const A of d) {
-      const m = S[p].find(A), b = c.get(A)[p] + k(p, A);
-      D[p].has(m) || D[p].set(m, { sum: 0, weight: 0, value: 0, fixed: null, members: [] });
-      const T = D[p].get(m);
+      const m = S[u].find(A), b = c.get(A)[u] + k(u, A);
+      D[u].has(m) || D[u].set(m, { sum: 0, weight: 0, value: 0, fixed: null, members: [] });
+      const T = D[u].get(m);
       T.sum += b * y.get(A), T.weight += y.get(A), T.members.push(A), M.has(A) && (T.fixed = b);
     }
-  for (const p of ["x", "y"])
-    for (const A of D[p].values()) A.value = A.fixed ?? A.sum / A.weight;
-  const _ = (p, A) => D[p].get(S[p].find(A)), $ = (p, A) => _(p, A).value, x = (p, A, m, b) => {
-    const T = _(p, A), P = _(p, m), X = b - (T.value - P.value);
-    if (X <= 5e-3 || T === P || T.fixed !== null && P.fixed !== null) return 0;
-    if (T.fixed !== null) P.value -= X;
-    else if (P.fixed !== null) T.value += X;
+  for (const u of ["x", "y"])
+    for (const A of D[u].values()) A.value = A.fixed ?? A.sum / A.weight;
+  const _ = (u, A) => D[u].get(S[u].find(A)), $ = (u, A) => _(u, A).value, x = (u, A, m, b) => {
+    const T = _(u, A), F = _(u, m), X = b - (T.value - F.value);
+    if (X <= 5e-3 || T === F || T.fixed !== null && F.fixed !== null) return 0;
+    if (T.fixed !== null) F.value -= X;
+    else if (F.fixed !== null) T.value += X;
     else {
-      const B = T.weight + P.weight;
-      T.value += X * P.weight / B, P.value -= X * T.weight / B;
+      const B = T.weight + F.weight;
+      T.value += X * F.weight / B, F.value -= X * T.weight / B;
     }
     return X;
   }, E = w.flatMap(
-    (p) => p.type === "near" && p.strength === "required" && h.has(p.ref) ? [p] : []
+    (u) => u.type === "near" && u.strength === "required" && h.has(u.ref) ? [u] : []
   ), v = r === "right" ? "x" : "y";
-  for (let p = 0; p < 48; p++) {
+  for (let u = 0; u < 48; u++) {
     let A = 0;
     for (const m of E) {
       const b = m.side === "right" || m.side === "left" ? "x" : "y", T = m.side === "right" || m.side === "below";
@@ -2909,62 +2934,62 @@ function Yi(e, t, s, n, o, r) {
     }
     for (let m = 0; m < e.length; m++)
       for (let b = m + 1; b < e.length; b++) {
-        const T = e[m], P = e[b], X = $("x", P.id) - $("x", T.id), B = $("y", P.id) - $("y", T.id), G = (T.w + P.w) / 2 + ft - Math.abs(X), F = (T.h + P.h) / 2 + ft - Math.abs(B);
-        if (G <= 5e-3 || F <= 5e-3) continue;
-        const L = ["x", "y"].filter(
-          (O) => _(O, T.id) !== _(O, P.id) && !(_(O, T.id).fixed !== null && _(O, P.id).fixed !== null)
+        const T = e[m], F = e[b], X = $("x", F.id) - $("x", T.id), B = $("y", F.id) - $("y", T.id), G = (T.w + F.w) / 2 + ft - Math.abs(X), P = (T.h + F.h) / 2 + ft - Math.abs(B);
+        if (G <= 5e-3 || P <= 5e-3) continue;
+        const R = ["x", "y"].filter(
+          (O) => _(O, T.id) !== _(O, F.id) && !(_(O, T.id).fixed !== null && _(O, F.id).fixed !== null)
         );
-        if (!L.length) continue;
-        const N = (O) => (O === "x" ? G : F) + (O === v ? 0 : 3), z = [...L].sort((O, C) => N(O) - N(C))[0], I = z === "x" ? X : B;
+        if (!R.length) continue;
+        const N = (O) => (O === "x" ? G : P) + (O === v ? 0 : 3), U = [...R].sort((O, C) => N(O) - N(C))[0], I = U === "x" ? X : B;
         A += x(
-          z,
-          I >= 0 ? P.id : T.id,
-          I >= 0 ? T.id : P.id,
-          (z === "x" ? T.w + P.w : T.h + P.h) / 2 + ft
+          U,
+          I >= 0 ? F.id : T.id,
+          I >= 0 ? T.id : F.id,
+          (U === "x" ? T.w + F.w : T.h + F.h) / 2 + ft
         );
       }
     if (n !== "root")
       for (const m of ["x", "y"])
         for (const b of D[m].values()) {
-          const T = Math.max(...b.members.map((P) => k(m, P)));
+          const T = Math.max(...b.members.map((F) => k(m, F)));
           b.value < T && b.fixed === null && (A += T - b.value, b.value = T);
         }
     if (A < 0.01) break;
   }
-  for (const p of e)
-    c.set(p.id, {
-      x: re($("x", p.id) - p.w / 2),
-      y: re($("y", p.id) - p.h / 2)
+  for (const u of e)
+    c.set(u.id, {
+      x: re($("x", u.id) - u.w / 2),
+      y: re($("y", u.id) - u.h / 2)
     });
-  for (let p = 0; p < e.length; p++)
-    for (let A = p + 1; A < e.length; A++) {
-      const m = e[p], b = e[A], T = c.get(m.id), P = c.get(b.id);
-      T.x + m.w > P.x + 0.1 && P.x + b.w > T.x + 0.1 && T.y + m.h > P.y + 0.1 && P.y + b.h > T.y + 0.1 && o.push({
+  for (let u = 0; u < e.length; u++)
+    for (let A = u + 1; A < e.length; A++) {
+      const m = e[u], b = e[A], T = c.get(m.id), F = c.get(b.id);
+      T.x + m.w > F.x + 0.1 && F.x + b.w > T.x + 0.1 && T.y + m.h > F.y + 0.1 && F.y + b.h > T.y + 0.1 && o.push({
         level: "error",
         code: "overlap",
         message: `${m.id} overlaps ${b.id}. Release a pin or give ${n} more room.`,
         ids: [m.id, b.id]
       });
     }
-  for (const p of E) {
-    const A = h.get(p.id), m = h.get(p.ref), b = c.get(A.id), T = c.get(m.id);
-    (p.side === "right" ? b.x - T.x - m.w : p.side === "left" ? T.x - b.x - A.w : p.side === "below" ? b.y - T.y - m.h : T.y - b.y - A.h) < p.gap - 0.5 && o.push({
+  for (const u of E) {
+    const A = h.get(u.id), m = h.get(u.ref), b = c.get(A.id), T = c.get(m.id);
+    (u.side === "right" ? b.x - T.x - m.w : u.side === "left" ? T.x - b.x - A.w : u.side === "below" ? b.y - T.y - m.h : T.y - b.y - A.h) < u.gap - 0.5 && o.push({
       level: "error",
       code: "unsatisfied-near",
-      message: `Required: ${p.id} ${p.side} of ${p.ref} is not satisfied.`,
-      line: p.line,
-      ids: [p.id, p.ref]
+      message: `Required: ${u.id} ${u.side} of ${u.ref} is not satisfied.`,
+      line: u.line,
+      ids: [u.id, u.ref]
     });
   }
-  for (const [p, { pos: A, hint: m }] of l) {
-    if (M.has(p) || m.type === "near" && m.strength === "required") continue;
-    const b = c.get(p), T = Math.round(Math.hypot(b.x - A.x, b.y - A.y));
+  for (const [u, { pos: A, hint: m }] of l) {
+    if (M.has(u) || m.type === "near" && m.strength === "required") continue;
+    const b = c.get(u), T = Math.round(Math.hypot(b.x - A.x, b.y - A.y));
     T >= 2 && o.push({
-      level: T >= zn ? "warning" : "info",
+      level: T >= Un ? "warning" : "info",
       code: "relaxed",
-      message: `${m.type} ${p} gave way by ${T} px to keep ${n} clear.${T >= zn ? ` Remove line ${m.line}, or run format --drop-stale.` : ""}`,
+      message: `${m.type} ${u} gave way by ${T} px to keep ${n} clear.${T >= Un ? ` Remove line ${m.line}, or run format --drop-stale.` : ""}`,
       line: m.line,
-      ids: [p]
+      ids: [u]
     });
   }
   return c;
@@ -2979,17 +3004,17 @@ function tn(e, t, s = !1) {
     const l = tn(
       { ...e, hints: e.hints.filter((i) => !o.includes(i)) },
       t
-    ), u = (i, g) => {
+    ), p = (i, g) => {
       const f = l.byId.get(i);
       return g === "x" ? f.x + f.w / 2 : f.y + f.h / 2;
     }, a = e.hints.map((i) => {
       if (!o.includes(i) || i.type !== "near") return i;
       const g = Vt(n, i.id, i.ref), f = i.side === "left" || i.side === "right" ? "y" : "x";
-      return { ...i, ref: g, offset: i.offset + u(i.ref, f) - u(g, f) };
+      return { ...i, ref: g, offset: i.offset + p(i.ref, f) - p(g, f) };
     });
     return tn({ ...e, hints: a }, t);
   }
-  const r = { ...e, hints: e.hints.filter((l) => l.type === "size" || l.type === "order") }, d = At(r, t), h = d, c = bo.get(h), y = (l) => (Math.max(...l.map((u) => u.x + u.w)) - Math.min(...l.map((u) => u.x))) * (Math.max(...l.map((u) => u.y + u.h)) - Math.min(...l.map((u) => u.y))), w = ws(
+  const r = { ...e, hints: e.hints.filter((l) => l.type === "size" || l.type === "order") }, d = At(r, t), h = d, c = bo.get(h), y = (l) => (Math.max(...l.map((p) => p.x + p.w)) - Math.min(...l.map((p) => p.x))) * (Math.max(...l.map((p) => p.y + p.h)) - Math.min(...l.map((p) => p.y))), w = ws(
     Ms(h.objects, e.edges, e.routing),
     y(h.objects),
     (l) => y(At(r, t, !1, l, c).objects)
@@ -2998,62 +3023,62 @@ function tn(e, t, s = !1) {
 }
 const bo = /* @__PURE__ */ new WeakMap();
 function At(e, t, s = !1, n, o) {
-  const r = e.edges.filter((R) => R.constraint !== !1 && R.directed !== !1), d = new Set(r.filter((R) => !R.dashed).map((R) => R.target)), h = r.filter((R) => !R.dashed || !d.has(R.target)), c = {
+  const r = e.edges.filter((L) => L.constraint !== !1 && L.directed !== !1), d = new Set(r.filter((L) => !L.dashed).map((L) => L.target)), h = r.filter((L) => !L.dashed || !d.has(L.target)), c = {
     port: Math.max(e.routing.portGap ?? 16, e.routing.edgeGap ?? 16),
     track: e.routing.edgeGap ?? 16
   }, y = [], w = /* @__PURE__ */ new Map([["root", []]]);
-  for (const R of e.objects)
-    w.has(R.parent) || w.set(R.parent, []), w.get(R.parent).push(R);
-  const l = ut(e.appearance), u = l.groupHeader, a = /* @__PURE__ */ new Map(), i = l.theme === It ? l : ut({ ...e.appearance, theme: It }), g = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map(), M = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), _ = new Map(e.objects.map((R) => [R.id, R])), $ = /* @__PURE__ */ new Map(), x = (R, j) => {
-    let q = _.get(R);
+  for (const L of e.objects)
+    w.has(L.parent) || w.set(L.parent, []), w.get(L.parent).push(L);
+  const l = pt(e.appearance), p = l.groupHeader, a = /* @__PURE__ */ new Map(), i = l.theme === It ? l : pt({ ...e.appearance, theme: It }), g = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map(), M = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), _ = new Map(e.objects.map((L) => [L.id, L])), $ = /* @__PURE__ */ new Map(), x = (L, j) => {
+    let q = _.get(L);
     for (; q && q.parent !== j; ) q = _.get(q.parent);
     return q?.id;
-  }, E = [], v = [], p = /* @__PURE__ */ new Map(), A = new Set(o?.groups);
+  }, E = [], v = [], u = /* @__PURE__ */ new Map(), A = new Set(o?.groups);
   let m = o?.wrap ?? !1;
-  const b = (R) => {
+  const b = (L) => {
     const j = /* @__PURE__ */ new Map();
     for (const q of h) {
-      const W = x(q.source, R);
-      W && x(q.target, R) !== W && j.set(W, [...j.get(W) ?? [], q]);
+      const W = x(q.source, L);
+      W && x(q.target, L) !== W && j.set(W, [...j.get(W) ?? [], q]);
     }
     return new Set(
       [...j].filter(
         ([q, W]) => W.length > 1 && (_.get(q).shape === "diamond" || W.filter((ee) => ee.label).length > 1)
       ).map(([q]) => q)
     );
-  }, T = (R) => h.map((j) => [x(j.source, R), x(j.target, R)]).filter((j) => !!j[0] && !!j[1] && j[0] !== j[1]), P = (R, j, q) => {
-    const W = (se) => x(se, R) !== void 0, ee = e.objects.filter((se) => W(se.id)).map((se) => se.id), Y = new Map(
+  }, T = (L) => h.map((j) => [x(j.source, L), x(j.target, L)]).filter((j) => !!j[0] && !!j[1] && j[0] !== j[1]), F = (L, j, q) => {
+    const W = (se) => x(se, L) !== void 0, ee = e.objects.filter((se) => W(se.id)).map((se) => se.id), Y = new Map(
       ht(
         ee,
         h.filter((se) => W(se.source) && W(se.target)).map((se) => [se.source, se.target])
-      ).flatMap((se, ue) => se.map((ve) => [ve, ue]))
+      ).flatMap((se, pe) => se.map((ve) => [ve, pe]))
     ), H = new Map(j.map((se) => [se, 1 / 0]));
     for (const se of ee) {
-      const ue = x(se, R);
-      H.set(ue, Math.min(H.get(ue), Y.get(se)));
+      const pe = x(se, L);
+      H.set(pe, Math.min(H.get(pe), Y.get(se)));
     }
-    const J = (se, ue) => {
+    const J = (se, pe) => {
       const ve = /* @__PURE__ */ new Set([se]), xe = [se];
       for (; xe.length; ) {
         const Be = xe.pop();
-        if (Be === ue) return !0;
-        for (const [Xe, Le] of q)
-          Xe === Be && !ve.has(Le) && (ve.add(Le), xe.push(Le));
+        if (Be === pe) return !0;
+        for (const [Xe, Re] of q)
+          Xe === Be && !ve.has(Re) && (ve.add(Re), xe.push(Re));
       }
       return !1;
     };
-    return q.filter(([se, ue]) => !(H.get(ue) < H.get(se) && J(ue, se)));
-  }, X = (R) => {
-    w.get(R);
+    return q.filter(([se, pe]) => !(H.get(pe) < H.get(se) && J(pe, se)));
+  }, X = (L) => {
+    w.get(L);
   };
   let B = 0, G = 0;
-  for (const R of w.keys()) {
-    const j = X(R);
+  for (const L of w.keys()) {
+    const j = X(L);
     if (!j) continue;
     B = Math.max(B, j.groupGap);
-    const q = T(R), W = new Map(
+    const q = T(L), W = new Map(
       ht(
-        (w.get(R) ?? []).map((Y) => Y.id),
+        (w.get(L) ?? []).map((Y) => Y.id),
         q
       ).flatMap((Y, H) => Y.map((J) => [J, H]))
     ), ee = Math.max(0, ...W.values());
@@ -3066,155 +3091,155 @@ function At(e, t, s = !1, n, o) {
       );
   }
   B = Math.min(Ni, Math.max(B, (G + 1) * (e.routing.edgeGap ?? 16)));
-  function F(R) {
-    const j = Ut(e, R);
+  function P(L) {
+    const j = zt(e, L);
     return j.algorithm === "row" ? "right" : j.algorithm === "column" ? "down" : nt(j);
   }
-  function L(R, j) {
+  function R(L, j) {
     const q = nt(j) === "right", W = Math.max(j.gap, ei), ee = /* @__PURE__ */ new Map();
-    for (const Z of R) for (const me of w.get(Z.id) ?? []) ee.set(me.id, Z.id);
-    const Y = [...ee.keys()], H = (Z) => g.get(Z) ?? k.get(Z), J = (Z) => q ? H(Z).w : H(Z).h, se = (Z) => q ? H(Z).h : H(Z).w, ue = (Z) => {
+    for (const Z of L) for (const me of w.get(Z.id) ?? []) ee.set(me.id, Z.id);
+    const Y = [...ee.keys()], H = (Z) => g.get(Z) ?? k.get(Z), J = (Z) => q ? H(Z).w : H(Z).h, se = (Z) => q ? H(Z).h : H(Z).w, pe = (Z) => {
       let me = _.get(Z);
       for (; me && !ee.has(me.id); ) me = _.get(me.parent);
       return me?.id;
-    }, ve = h.map((Z) => [ue(Z.source), ue(Z.target)]).filter((Z) => !!Z[0] && !!Z[1] && Z[0] !== Z[1]), xe = Y.length ? xo(ht(Y, ve), ve) : [], Be = new Map(xe.flatMap((Z, me) => Z.map((ke) => [ke, me]))), Xe = xe.map((Z) => Math.max(...Z.map(J))), Le = [];
-    let Ue = 0;
+    }, ve = h.map((Z) => [pe(Z.source), pe(Z.target)]).filter((Z) => !!Z[0] && !!Z[1] && Z[0] !== Z[1]), xe = Y.length ? xo(ht(Y, ve), ve) : [], Be = new Map(xe.flatMap((Z, me) => Z.map((ke) => [ke, me]))), Xe = xe.map((Z) => Math.max(...Z.map(J))), Re = [];
+    let ze = 0;
     for (const [Z, me] of xe.entries()) {
-      Le.push(Ue);
+      Re.push(ze);
       let ke = W;
       for (const Oe of e.edges) {
-        const Ee = Be.get(ue(Oe.source) ?? ""), Ae = Be.get(ue(Oe.target) ?? "");
+        const Ee = Be.get(pe(Oe.source) ?? ""), Ae = Be.get(pe(Oe.target) ?? "");
         if (Oe.label && Ee !== void 0 && Ae !== void 0 && Math.min(Ee, Ae) === Z && Ee !== Ae) {
           const _e = Bt("", "", Oe.label, l);
           ke = Math.max(ke, q ? _e.w : _e.h);
         }
       }
-      Ue += Xe[Z] + (me === xe.at(-1) ? 0 : ke);
+      ze += Xe[Z] + (me === xe.at(-1) ? 0 : ke);
     }
-    const Ie = Ue, mt = /* @__PURE__ */ new Map();
-    for (const Z of R) {
+    const Ie = ze, mt = /* @__PURE__ */ new Map();
+    for (const Z of L) {
       const me = xe.map((Ee) => Ee.filter((Ae) => ee.get(Ae) === Z.id)), ke = (Ee) => Ee.reduce((Ae, _e, qe) => Ae + se(_e) + (qe ? Dn : 0), 0), Oe = Math.max(ti, ...me.map(ke));
       mt.set(Z.id, Oe), me.forEach((Ee, Ae) => {
         let _e = (Oe - ke(Ee)) / 2;
         for (const qe of Ee) {
-          const pe = Le[Ae] + (Xe[Ae] - J(qe)) / 2, et = q ? { x: pe, y: _e } : { x: _e, y: pe };
+          const ue = Re[Ae] + (Xe[Ae] - J(qe)) / 2, et = q ? { x: ue, y: _e } : { x: _e, y: ue };
           S.set(qe, { x: re(et.x), y: re(et.y) }), D.set(qe, et), _e += se(qe) + Dn;
         }
       });
     }
-    const wt = (Z) => Math.ceil(ye(Z.label, l.groupTitle)) + Xt, Fe = Math.max(Ie + 2 * Se, ...R.map(wt));
+    const wt = (Z) => Math.ceil(ye(Z.label, l.groupTitle)) + Xt, Pe = Math.max(Ie + 2 * Se, ...L.map(wt));
     let Ke = 0;
-    for (const Z of R) {
+    for (const Z of L) {
       const me = mt.get(Z.id);
-      Z.w = q ? Fe : Math.max(me + 2 * Se, wt(Z)), Z.h = u + (q ? me : Ie) + Se;
+      Z.w = q ? Pe : Math.max(me + 2 * Se, wt(Z)), Z.h = p + (q ? me : Ie) + Se;
       const ke = q ? { x: 0, y: Ke } : { x: Ke, y: 0 };
       S.set(Z.id, ke), D.set(Z.id, ke), Ke += (q ? Z.h : Z.w) + Nn;
     }
-    const ze = Math.max(0, Ke - Nn);
-    return q ? { w: R.length ? Fe : 0, h: ze } : { w: ze, h: R.length ? u + Ie + Se : 0 };
+    const Ue = Math.max(0, Ke - Nn);
+    return q ? { w: L.length ? Pe : 0, h: Ue } : { w: Ue, h: L.length ? p + Ie + Se : 0 };
   }
-  function N(R, j) {
-    const q = R.filter((H) => H.type === "node" && (H.shape === "box" || H.shape === "pill"));
+  function N(L, j) {
+    const q = L.filter((H) => H.type === "node" && (H.shape === "box" || H.shape === "pill"));
     if (q.length < 2) return;
     const W = (H) => e.hints.some((J) => J.type === "size" && J.id === H.id), ee = Math.max(...q.map((H) => H.w)), Y = Math.max(...q.map((H) => j.get(H.id)?.ref.w ?? H.w));
     for (const H of q) {
       if (W(H) || H.w === ee) continue;
       const J = Et(H, { width: ee }, l);
       if (H.w = re(J.w), H.h = re(J.h), !j.get(H.id)) continue;
-      const ue = Et(H, { width: Y }, i);
+      const pe = Et(H, { width: Y }, i);
       j.set(H.id, {
         look: { w: H.w, h: H.h },
-        ref: { w: re(ue.w), h: re(ue.h) }
+        ref: { w: re(pe.w), h: re(pe.h) }
       });
     }
   }
-  function z(R) {
-    const j = Ut(e, R), q = e.hints.find((U) => U.type === "order" && U.scope === R);
-    let W = w.get(R) ?? [];
-    if (q?.type === "order" && (W = [...q.ids.flatMap((Q) => W.filter((K) => K.id === Q)), ...W.filter((Q) => !q.ids.includes(Q.id))]), j.algorithm === "cells") return I(R, W, j);
-    const ee = /* @__PURE__ */ new Map(), Y = W.map((U) => {
+  function U(L) {
+    const j = zt(e, L), q = e.hints.find((z) => z.type === "order" && z.scope === L);
+    let W = w.get(L) ?? [];
+    if (q?.type === "order" && (W = [...q.ids.flatMap((Q) => W.filter((K) => K.id === Q)), ...W.filter((Q) => !q.ids.includes(Q.id))]), j.algorithm === "cells") return I(L, W, j);
+    const ee = /* @__PURE__ */ new Map(), Y = W.map((z) => {
       let Q;
-      if (U.type === "group") {
-        const ie = z(U.id), ne = Ut(e, U.id), ge = !w.get(U.id)?.length, de = f.get(U.id);
+      if (z.type === "group") {
+        const ie = U(z.id), ne = zt(e, z.id), ge = !w.get(z.id)?.length, de = f.get(z.id);
         Q = de !== void 0 ? {
           w: Math.max(ie.w, ne.minWidth),
           h: Math.max(ie.h + de, ne.minHeight)
         } : (() => {
           const be = Math.max(
-            ge ? Pn.w : 0,
-            ie.w + Se + (n?.get(U.id)?.right ?? Se),
+            ge ? Fn.w : 0,
+            ie.w + Se + (n?.get(z.id)?.right ?? Se),
             ne.minWidth
-          ), Ce = vi(U.label, be, l);
-          return Ce.lines > 1 && a.set(U.id, Ce.lines), {
+          ), Ce = vi(z.label, be, l);
+          return Ce.lines > 1 && a.set(z.id, Ce.lines), {
             w: Math.max(be, Ce.w),
             h: Math.max(
-              ge ? Pn.h : 0,
-              ie.h + _t(l, Ce.lines) + (n?.get(U.id)?.bottom ?? Se),
+              ge ? Fn.h : 0,
+              ie.h + _t(l, Ce.lines) + (n?.get(z.id)?.bottom ?? Se),
               ne.minHeight
             )
           };
         })();
       } else {
-        const ie = e.hints.find((ge) => ge.type === "size" && ge.id === U.id), ne = Et(U, ie?.type === "size" ? ie : void 0, l);
+        const ie = e.hints.find((ge) => ge.type === "size" && ge.id === z.id), ne = Et(z, ie?.type === "size" ? ie : void 0, l);
         if (Q = ne, i !== l) {
-          const ge = Et(U, ie?.type === "size" ? ie : void 0, i);
-          ee.set(U.id, {
+          const ge = Et(z, ie?.type === "size" ? ie : void 0, i);
+          ee.set(z.id, {
             look: { w: re(ne.w), h: re(ne.h) },
             ref: { w: re(ge.w), h: re(ge.h) }
           });
         }
-        U.shape === "diamond" && !ie && ne.w > io("diamond").w * Si && y.push({
+        z.shape === "diamond" && !ie && ne.w > io("diamond").w * Si && y.push({
           level: "info",
           code: "big-diamond",
-          message: `${U.id}'s question makes its diamond ${re(ne.w)}px square, much larger than the shapes around it. Shorten the question, or move the detail onto its edges' labels.`,
-          line: U.line,
-          ids: [U.id]
+          message: `${z.id}'s question makes its diamond ${re(ne.w)}px square, much larger than the shapes around it. Shorten the question, or move the detail onto its edges' labels.`,
+          line: z.line,
+          ids: [z.id]
         }), ne.overflow && y.push({
           level: "warning",
           code: "text-overflow",
-          message: `${U.id}'s title does not fit in its requested size. Make it larger or remove the size line.`,
+          message: `${z.id}'s title does not fit in its requested size. Make it larger or remove the size line.`,
           line: ie?.line,
-          ids: [U.id]
+          ids: [z.id]
         });
       }
-      const K = { ...U, w: re(Q.w), h: re(Q.h) };
-      return k.set(U.id, K), K;
+      const K = { ...z, w: re(Q.w), h: re(Q.h) };
+      return k.set(z.id, K), K;
     });
-    if (j.algorithm === "column" && N(Y, ee), R === "root" && j.algorithm === "lanes") return L(Y, j);
-    const H = T(R), J = _.get(R)?.parent, se = J !== void 0 && F(J) === F(R), ue = (R === "root" ? [] : e.edges).flatMap((U) => {
-      const Q = x(U.source, R), K = x(U.target, R);
-      return !Q && !K || Q === K || !(Q && K) && !se ? [] : [{ a: Q, b: K, label: U.label && !(Q && K) ? Je(U.label, l) : void 0 }];
+    if (j.algorithm === "column" && N(Y, ee), L === "root" && j.algorithm === "lanes") return R(Y, j);
+    const H = T(L), J = _.get(L)?.parent, se = J !== void 0 && P(J) === P(L), pe = (L === "root" ? [] : e.edges).flatMap((z) => {
+      const Q = x(z.source, L), K = x(z.target, L);
+      return !Q && !K || Q === K || !(Q && K) && !se ? [] : [{ a: Q, b: K, label: z.label && !(Q && K) ? Je(z.label, l) : void 0 }];
     }), ve = /* @__PURE__ */ new Map();
-    for (const U of h) {
-      const Q = x(U.source, R), K = x(U.target, R);
-      Q && !K && ve.set(Q, [...ve.get(Q) ?? [], U.target]), K && !Q && ve.set(K, [...ve.get(K) ?? [], U.source]);
+    for (const z of h) {
+      const Q = x(z.source, L), K = x(z.target, L);
+      Q && !K && ve.set(Q, [...ve.get(Q) ?? [], z.target]), K && !Q && ve.set(K, [...ve.get(K) ?? [], z.source]);
     }
-    const xe = (U, Q) => {
-      const K = S.get(U), ie = g.get(U) ?? k.get(U);
+    const xe = (z, Q) => {
+      const K = S.get(z), ie = g.get(z) ?? k.get(z);
       return Q ? K.y + ie.h / 2 : K.x + ie.w / 2;
-    }, Be = /* @__PURE__ */ new Map(), Xe = _.get(R)?.parent, Le = Xe !== void 0 && w.get(Xe) || [], Ue = Y.map((U) => ve.get(U.id) ?? []), Ie = Ue[0]?.length === 1 ? _.get(Ue[0][0])?.parent : void 0, mt = Le.findIndex((U) => U.id === Ie) < Le.findIndex((U) => U.id === R);
-    if (Ie !== void 0 && Ie !== R && Le.some((U) => U.id === Ie) && mt && Ue.every((U) => U.length === 1 && _.get(U[0])?.parent === Ie && S.has(U[0])))
-      for (const [U, Q] of Y.entries())
-        Be.set(Q.id, xe(Ue[U][0], F(Ie) === "right"));
-    const wt = (U, Q) => {
-      if ($.get(Q) !== U) return;
-      const K = F(R) === "right", ie = (de) => K ? _t(l, a.get(de)) : Se, ge = e.edges.filter(
-        (de) => _.get(de.source)?.parent === U && _.get(de.target)?.parent === Q
+    }, Be = /* @__PURE__ */ new Map(), Xe = _.get(L)?.parent, Re = Xe !== void 0 && w.get(Xe) || [], ze = Y.map((z) => ve.get(z.id) ?? []), Ie = ze[0]?.length === 1 ? _.get(ze[0][0])?.parent : void 0, mt = Re.findIndex((z) => z.id === Ie) < Re.findIndex((z) => z.id === L);
+    if (Ie !== void 0 && Ie !== L && Re.some((z) => z.id === Ie) && mt && ze.every((z) => z.length === 1 && _.get(z[0])?.parent === Ie && S.has(z[0])))
+      for (const [z, Q] of Y.entries())
+        Be.set(Q.id, xe(ze[z][0], P(Ie) === "right"));
+    const wt = (z, Q) => {
+      if ($.get(Q) !== z) return;
+      const K = P(L) === "right", ie = (de) => K ? _t(l, a.get(de)) : Se, ge = e.edges.filter(
+        (de) => _.get(de.source)?.parent === z && _.get(de.target)?.parent === Q
       ).sort((de, be) => xe(de.target, K) - xe(be.target, K))[0];
-      return ge ? ie(U) + xe(ge.source, K) - ie(Q) - xe(ge.target, K) : void 0;
-    }, Fe = e.edges.flatMap((U) => {
-      const Q = x(U.source, R), K = x(U.target, R);
-      if (!U.label || !Q || !K || Q === K) return [];
-      const ie = Bt(Q, K, U.label, l);
+      return ge ? ie(z) + xe(ge.source, K) - ie(Q) - xe(ge.target, K) : void 0;
+    }, Pe = e.edges.flatMap((z) => {
+      const Q = x(z.source, L), K = x(z.target, L);
+      if (!z.label || !Q || !K || Q === K) return [];
+      const ie = Bt(Q, K, z.label, l);
       if (i === l) return [ie];
-      const ne = Bt(Q, K, U.label, i);
-      return [{ a: Q, b: K, w: Math.max(ne.w, ie.w - Pe), h: Math.max(ne.h, ie.h - Pe) }];
-    }), Ke = t, ze = X(R), Z = ze ? { node: ze.nodeGap, rank: ze.rankGap, group: B } : void 0, me = ze ? P(
-      R,
-      Y.map((U) => U.id),
+      const ne = Bt(Q, K, z.label, i);
+      return [{ a: Q, b: K, w: Math.max(ne.w, ie.w - Fe), h: Math.max(ne.h, ie.h - Fe) }];
+    }), Ke = t, Ue = X(L), Z = Ue ? { node: Ue.nodeGap, rank: Ue.rankGap, group: B } : void 0, me = Ue ? F(
+      L,
+      Y.map((z) => z.id),
       H
-    ) : void 0, ke = (U, Q) => {
-      const K = j.algorithm === "row" ? "right" : j.algorithm === "column" ? "down" : U, ie = {
+    ) : void 0, ke = (z, Q) => {
+      const K = j.algorithm === "row" ? "right" : j.algorithm === "column" ? "down" : z, ie = {
         x: K === "right",
         y: K === "down"
       }, ne = (de) => s ? de : ee.get(de.id)?.look ?? de, ge = /* @__PURE__ */ new Map();
@@ -3232,10 +3257,10 @@ function At(e, t, s = !1, n, o) {
           ];
         })
       );
-    }, Oe = (U) => {
+    }, Oe = (z) => {
       for (const ce of Y) {
         const Te = ee.get(ce.id);
-        Te && (ce.w = Math.max(Te.ref.w, Te.look.w - U.w), ce.h = Math.max(Te.ref.h, Te.look.h - U.h));
+        Te && (ce.w = Math.max(Te.ref.w, Te.look.w - z.w), ce.h = Math.max(Te.ref.h, Te.look.h - z.h));
       }
       const Q = (ce) => Z ? Ci(
         Y,
@@ -3244,12 +3269,12 @@ function At(e, t, s = !1, n, o) {
         me,
         ce,
         Z,
-        R === "root",
-        ue,
+        L === "root",
+        pe,
         ve,
         Be,
         wt
-      ) : Ui(Y, j, H, ce, ue, c), K = Fe.length ? Q([]) : void 0, ie = K ? Di(
+      ) : zi(Y, j, H, ce, pe, c), K = Pe.length ? Q([]) : void 0, ie = K ? Di(
         new Map(
           Y.map((ce) => {
             const Te = K.positions.get(ce.id), yt = ke(K.axis, K.positions).get(ce.id);
@@ -3257,96 +3282,96 @@ function At(e, t, s = !1, n, o) {
           })
         ),
         K.axis,
-        Fe
-      ) : /* @__PURE__ */ new Set(), ne = Q(Fe.filter((ce) => !ie.has(ce)));
+        Pe
+      ) : /* @__PURE__ */ new Set(), ne = Q(Pe.filter((ce) => !ie.has(ce)));
       let ge;
       if (j.algorithm === "flow" && j.fold === "auto") {
-        const ce = zt(
+        const ce = Ut(
           Y,
           ne.positions,
           ne.axis,
           j.gap,
           H,
-          Fe,
-          b(R),
+          Pe,
+          b(L),
           (K ?? ne).positions
         );
         ne.positions = ce.positions, ge = ce.fold;
       }
-      const de = !ge && ze && Ke?.engine?.params.fold !== "never";
-      if (de && A.has(R)) {
-        const ce = zt(
+      const de = !ge && Ue && Ke?.engine?.params.fold !== "never";
+      if (de && A.has(L)) {
+        const ce = Ut(
           Y,
           ne.positions,
           ne.axis,
           Z.rank,
           H,
-          Fe,
-          b(R),
+          Pe,
+          b(L),
           (K ?? ne).positions,
           { fewest: 2, room: 0 }
         );
         ne.positions = ce.positions, ge = ce.fold;
       }
-      if (de && R === "root" && m) {
-        const ce = zt(
+      if (de && L === "root" && m) {
+        const ce = Ut(
           Y,
           ne.positions,
           ne.axis,
           Z.rank,
           H,
-          Fe,
-          b(R),
+          Pe,
+          b(L),
           (K ?? ne).positions,
           { aspect: Gn, fewest: 2 }
         );
         ne.positions = ce.positions, ge = ce.fold;
       }
-      const be = n?.get(R);
+      const be = n?.get(L);
       if (be && (be.left > Se || be.top))
         for (const [ce, Te] of ne.positions)
           ne.positions.set(ce, { x: Te.x + be.left - Se, y: Te.y + be.top });
       const Ce = ke(ne.axis, ne.positions), Ao = ee.size ? e.hints.map(
         (ce) => (ce.type === "stay" || ce.type === "pin") && Ce.has(ce.id) ? { ...ce, x: ce.x - Ce.get(ce.id).x, y: ce.y - Ce.get(ce.id).y } : ce
-      ) : e.hints, So = Yi(Y, ne.positions, Ao, R, y, ne.axis);
-      return "followed" in ne && ne.followed ? $.set(R, Ie) : $.delete(R), { base: ne, fold: ge, pos: So, off: Ce };
-    }, Ee = (U, Q) => {
-      const K = Q.pos.get(U.id), ie = Q.off.get(U.id);
+      ) : e.hints, So = Yi(Y, ne.positions, Ao, L, y, ne.axis);
+      return "followed" in ne && ne.followed ? $.set(L, Ie) : $.delete(L), { base: ne, fold: ge, pos: So, off: Ce };
+    }, Ee = (z, Q) => {
+      const K = Q.pos.get(z.id), ie = Q.off.get(z.id);
       return { x: K.x + ie.x, y: K.y + ie.y, w: ie.w, h: ie.h };
-    }, Ae = (U, Q) => ({
-      ...Q.pos.get(U.id),
-      w: U.w,
-      h: U.h
+    }, Ae = (z, Q) => ({
+      ...Q.pos.get(z.id),
+      w: z.w,
+      h: z.h
     }), _e = ee.size ? { w: Wn(j.gap), h: Wn(j.gap) } : { w: 0, h: 0 }, qe = y.length;
-    let pe = Oe(_e);
+    let ue = Oe(_e);
     !s && (_e.w || _e.h) && Y.some(
-      (U, Q) => Y.slice(Q + 1).some(
-        (K) => Fn(Ae(U, pe), Ae(K, pe)) >= ft - 0.5 && Fn(Ee(U, pe), Ee(K, pe)) < ft - 0.5
+      (z, Q) => Y.slice(Q + 1).some(
+        (K) => Pn(Ae(z, ue), Ae(K, ue)) >= ft - 0.5 && Pn(Ee(z, ue), Ee(K, ue)) < ft - 0.5
       )
-    ) && (y.length = qe, pe = Oe({ w: 0, h: 0 })), pe.fold && E.push({ scope: R, fold: pe.fold });
-    const et = pe.base.corridors;
-    et && R === "root" && !pe.fold && !n?.get(R) && Y.every((U) => {
-      const Q = pe.pos.get(U.id), K = pe.base.positions.get(U.id);
+    ) && (y.length = qe, ue = Oe({ w: 0, h: 0 })), ue.fold && E.push({ scope: L, fold: ue.fold });
+    const et = ue.base.corridors;
+    et && L === "root" && !ue.fold && !n?.get(L) && Y.every((z) => {
+      const Q = ue.pos.get(z.id), K = ue.base.positions.get(z.id);
       return Q && K && Math.abs(Q.x - K.x) < 0.01 && Math.abs(Q.y - K.y) < 0.01;
-    }) && p.set(R, { axis: pe.base.axis, corridors: et }), j.algorithm === "flow" && v.push({ scope: R, axis: pe.base.axis });
-    const at = Y.map((U) => Ee(U, pe)), Pt = R === "root" ? 0 : Math.max(0, ...Y.map((U) => U.soft?.length ?? 0)), rt = R === "root" || !Y.length ? { x: 0, y: 0 } : {
-      x: Math.max(0, -Math.min(...at.map((U) => U.x))) + Pt * dt,
-      y: Math.max(0, -Math.min(...at.map((U) => U.y))) + Pt * (dt + Lt)
+    }) && u.set(L, { axis: ue.base.axis, corridors: et }), j.algorithm === "flow" && v.push({ scope: L, axis: ue.base.axis });
+    const at = Y.map((z) => Ee(z, ue)), Ft = L === "root" ? 0 : Math.max(0, ...Y.map((z) => z.soft?.length ?? 0)), rt = L === "root" || !Y.length ? { x: 0, y: 0 } : {
+      x: Math.max(0, -Math.min(...at.map((z) => z.x))) + Ft * dt,
+      y: Math.max(0, -Math.min(...at.map((z) => z.y))) + Ft * (dt + Rt)
     };
-    for (const [U, Q] of Y.entries()) {
-      const K = at[U], ie = pe.off.get(Q.id), ne = pe.base.positions.get(Q.id);
+    for (const [z, Q] of Y.entries()) {
+      const K = at[z], ie = ue.off.get(Q.id), ne = ue.base.positions.get(Q.id);
       S.set(Q.id, { x: re(K.x + rt.x), y: re(K.y + rt.y) }), D.set(Q.id, { x: ne.x + ie.x + rt.x, y: ne.y + ie.y + rt.y }), ee.has(Q.id) && g.set(Q.id, { w: re(K.w), h: re(K.h) });
     }
-    const rn = (U, Q) => Y.length ? Math.max(
+    const rn = (z, Q) => Y.length ? Math.max(
       ...Y.map(
-        (K, ie) => Math.max(pe.pos.get(K.id)[U] + K[Q], at[ie][U] + at[ie][Q])
+        (K, ie) => Math.max(ue.pos.get(K.id)[z] + K[Q], at[ie][z] + at[ie][Q])
       )
-    ) + rt[U] + Pt * dt : 0;
+    ) + rt[z] + Ft * dt : 0;
     return { w: rn("x", "w"), h: rn("y", "h") };
   }
-  function I(R, j, q) {
-    if (q.unit) return O(R, j, q);
-    const W = Math.ceil(ye(_.get(R).label, l.groupTitle)) + Xo, ee = (H) => e.hints.find((J) => J.type === "size" && J.id === H), Y = is(
+  function I(L, j, q) {
+    if (q.unit) return O(L, j, q);
+    const W = Math.ceil(ye(_.get(L).label, l.groupTitle)) + Xo, ee = (H) => e.hints.find((J) => J.type === "size" && J.id === H), Y = is(
       j.map((H) => {
         const J = ee(H.id);
         return {
@@ -3364,9 +3389,9 @@ function At(e, t, s = !1, n, o) {
       l,
       W
     );
-    return C(R, j, Y.boxes), f.set(R, Qt(l.groupTitle.lineHeight)), { w: Math.max(Y.w, W), h: Y.h };
+    return C(L, j, Y.boxes), f.set(L, Qt(l.groupTitle.lineHeight)), { w: Math.max(Y.w, W), h: Y.h };
   }
-  function O(R, j, q) {
+  function O(L, j, q) {
     const W = cs(
       j.map((H) => ({
         id: H.id,
@@ -3383,7 +3408,7 @@ function At(e, t, s = !1, n, o) {
       },
       l
     ), ee = Qt(l.groupTitle.lineHeight), Y = ee + (W.ruler?.h ?? 0);
-    return C(R, j, W.boxes), f.set(R, Y), M.set(R, {
+    return C(L, j, W.boxes), f.set(L, Y), M.set(L, {
       ...W.ruler ? { ruler: { y: ee, ...W.ruler } } : {},
       ...W.pieces.size ? {
         pieces: Object.fromEntries(
@@ -3393,7 +3418,7 @@ function At(e, t, s = !1, n, o) {
       ...W.open.length ? { open: W.open } : {}
     }), { w: W.w, h: W.h };
   }
-  function C(R, j, q) {
+  function C(L, j, q) {
     for (const W of j) {
       const ee = q.get(W.id);
       k.set(W.id, { ...W, w: re(ee.w), h: re(ee.h) }), S.set(W.id, { x: re(ee.x), y: re(ee.y) }), D.set(W.id, { x: ee.x, y: ee.y });
@@ -3403,41 +3428,41 @@ function At(e, t, s = !1, n, o) {
       Y && y.push({
         level: "warning",
         code: "cell-position",
-        message: `${W.id} is a cell of ${R}, so it stays in its place. Move ${R} instead, or reorder its cells with order.`,
+        message: `${W.id} is a cell of ${L}, so it stays in its place. Move ${L} instead, or reorder its cells with order.`,
         line: Y.line,
         ids: [W.id]
       });
     }
   }
   const V = y.length, oe = X("root") && Mi(e, "root");
-  let ae = z("root");
+  let ae = U("root");
   if (!o && oe && oe.engine?.params.fold !== "never") {
-    let R = function(H) {
+    let L = function(H) {
       return q(H) > yo * W(H);
     };
     const j = nt(oe) === "right", q = (H) => j ? H.w : H.h, W = (H) => j ? H.h : H.w, ee = j ? $t.width : $t.height, Y = (H) => q(H) > ee && q(H) > Gn * W(H);
     for (; Y(ae) && !m; ) {
       const H = [...k.values()].filter(
-        (J) => J.type === "group" && !A.has(J.id) && X(J.id) && R(J)
+        (J) => J.type === "group" && !A.has(J.id) && X(J.id) && L(J)
       ).sort((J, se) => q(se) - q(J))[0];
-      H ? A.add(H.id) : m = !0, y.length = V, E.length = v.length = 0, g.clear(), ae = z("root");
+      H ? A.add(H.id) : m = !0, y.length = V, E.length = v.length = 0, g.clear(), ae = U("root");
     }
   }
   if (!o && oe && nt(oe) === "down" && oe.engine?.params.fold !== "never") {
-    const R = (q) => q.h, j = (q) => q.w * q.h;
+    const L = (q) => q.h, j = (q) => q.w * q.h;
     for (; ; ) {
-      const q = (w.get("root") ?? []).map((H) => k.get(H.id)).filter(Boolean).sort((H, J) => R(J) - R(H)), [W, ee] = q;
-      if (!W || !ee || W.type !== "group" || W.fold === "never" || A.has(W.id) || !X(W.id) || R(W) < ki * R(ee))
+      const q = (w.get("root") ?? []).map((H) => k.get(H.id)).filter(Boolean).sort((H, J) => L(J) - L(H)), [W, ee] = q;
+      if (!W || !ee || W.type !== "group" || W.fold === "never" || A.has(W.id) || !X(W.id) || L(W) < ki * L(ee))
         break;
       const Y = ae;
-      if (A.add(W.id), y.length = V, E.length = v.length = 0, g.clear(), ae = z("root"), !(j(ae) < j(Y))) {
-        A.delete(W.id), y.length = V, E.length = v.length = 0, g.clear(), z("root");
+      if (A.add(W.id), y.length = V, E.length = v.length = 0, g.clear(), ae = U("root"), !(j(ae) < j(Y))) {
+        A.delete(W.id), y.length = V, E.length = v.length = 0, g.clear(), U("root");
         break;
       }
     }
   }
-  const le = [], he = (R, j, q) => {
-    for (const W of w.get(R) ?? []) {
+  const le = [], he = (L, j, q) => {
+    for (const W of w.get(L) ?? []) {
       const ee = g.get(W.id) ?? k.get(W.id), Y = S.get(W.id), H = D.get(W.id), J = {
         ...W,
         x: j.x + Y.x,
@@ -3459,43 +3484,43 @@ function At(e, t, s = !1, n, o) {
     }
   };
   he("root", { x: 0, y: 0 }, 0);
-  const we = Ki(p, le, h, x, c), fe = Li(
+  const we = Ki(u, le, h, x, c), fe = Ri(
     E,
     e.edges,
-    new Map(le.map((R) => [R.id, R])),
+    new Map(le.map((L) => [L.id, L])),
     x,
     Math.max(e.routing.portGap ?? 16, e.routing.edgeGap ?? 16)
   );
-  for (const [R, j] of ks(
+  for (const [L, j] of ks(
     v.map((q) => ({ ...q, bands: E.find((W) => W.scope === q.scope)?.fold.bands })),
     e.edges,
     new Map(le.map((q) => [q.id, q])),
     new Set(fe.keys()),
     (q) => Je(q, l)
   ))
-    fe.set(R, j);
-  for (const R of e.layouts) {
-    const j = le.find((q) => q.id === R.scope);
-    !j || !R.minWidth && !R.minHeight || (R.minWidth && j.w > R.minWidth + 0.5 || R.minHeight && j.h > R.minHeight + 0.5) && y.push({
+    fe.set(L, j);
+  for (const L of e.layouts) {
+    const j = le.find((q) => q.id === L.scope);
+    !j || !L.minWidth && !L.minHeight || (L.minWidth && j.w > L.minWidth + 0.5 || L.minHeight && j.h > L.minHeight + 0.5) && y.push({
       level: "info",
       code: "group-grew",
       message: `${j.id} needs at least ${j.w}×${j.h} for its contents.`,
-      line: R.line,
+      line: L.line,
       ids: [j.id]
     });
   }
-  Fs(e), y.push(...yi(e), ...$s(e));
-  for (const R of e.warnings) y.push({ level: "warning", ...R, ids: [] });
-  const te = new Map(e.objects.map((R, j) => [R.id, j]));
-  le.sort((R, j) => te.get(R.id) - te.get(j.id));
+  Ps(e), y.push(...yi(e), ...$s(e));
+  for (const L of e.warnings) y.push({ level: "warning", ...L, ids: [] });
+  const te = new Map(e.objects.map((L, j) => [L.id, j]));
+  le.sort((L, j) => te.get(L.id) - te.get(j.id));
   const Me = {
     model: e,
     title: e.title,
     objects: le,
-    byId: new Map(le.map((R) => [R.id, R])),
-    edges: e.edges.map((R) => {
-      const j = fe.get(R.id), q = j ? void 0 : we.get(R.id);
-      return j ? { ...R, lane: j } : q ? { ...R, plan: q } : R;
+    byId: new Map(le.map((L) => [L.id, L])),
+    edges: e.edges.map((L) => {
+      const j = fe.get(L.id), q = j ? void 0 : we.get(L.id);
+      return j ? { ...L, lane: j } : q ? { ...L, plan: q } : L;
     }),
     diagnostics: y,
     look: l,
@@ -3509,13 +3534,13 @@ function Ki(e, t, s, n, o) {
     const w = s.filter((i) => {
       const g = n(i.source, h), f = n(i.target, h);
       return !!g && !!f && g !== f;
-    }), l = new Map(y.order.flatMap((i, g) => i.map((f) => [f, g]))), u = (i) => {
+    }), l = new Map(y.order.flatMap((i, g) => i.map((f) => [f, g]))), p = (i) => {
       const g = d.get(i);
       return !!g && g.type === "node" && (g.shape ?? "box") === "box";
     }, a = [];
     for (const [i, g] of w.entries()) {
       const f = g.source, M = g.target;
-      n(f, h) !== f || n(M, h) !== M || !u(f) || !u(M) || l.get(f) < l.get(M) && a.push({ id: g.id, chain: [f, ...y.chains.get(i) ?? [], M] });
+      n(f, h) !== f || n(M, h) !== M || !p(f) || !p(M) || l.get(f) < l.get(M) && a.push({ id: g.id, chain: [f, ...y.chains.get(i) ?? [], M] });
     }
     for (const [i, g] of Ss(
       c,
@@ -3601,30 +3626,30 @@ function Eo(e, t, s, n, o) {
   const l = s.edges.some((i) => !i.directed) ? ["IMP-02-native-undirected"] : [];
   if (n.some((i) => i.severity === "error"))
     return { status: "failed", format: e, family: t, diagnostics: n, ids: o.entries, requires: l };
-  const u = ["diagram " + He(s.title) + " version=1"];
+  const p = ["diagram " + He(s.title) + " version=1"];
   for (const i of s.colors)
-    u.push(
+    p.push(
       "theme-color " + i.name + " shade=500 fill=" + He(i.fill) + " stroke=" + He(i.stroke) + " ink=" + He(i.ink)
     );
   for (const i of s.objects) {
     let g = i.kind + " " + i.id + " " + He(i.label);
-    i.parent && (g += " in=" + i.parent), i.shape && i.shape !== "box" && i.kind === "node" && (g += " shape=" + i.shape), i.color && (g += " color=" + i.color + " shade=" + (i.shade ?? 500)), u.push(g);
+    i.parent && (g += " in=" + i.parent), i.shape && i.shape !== "box" && i.kind === "node" && (g += " shape=" + i.shape), i.color && (g += " color=" + i.color + " shade=" + (i.shade ?? 500)), p.push(g);
   }
   for (const i of s.edges) {
     let g = "edge " + i.id + " " + i.from + " -> " + i.to + " " + He(i.label);
-    i.directed || (g += " directed=false"), i.head && i.head !== "arrow" && (g += " head=" + i.head), i.tail && i.tail !== "none" && (g += " tail=" + i.tail), i.dashed && (g += " kind=async"), i.constraint === !1 && (g += " constraint=false"), i.fromSide && (g += " from=" + i.fromSide), i.toSide && (g += " to=" + i.toSide), u.push(g);
+    i.directed || (g += " directed=false"), i.head && i.head !== "arrow" && (g += " head=" + i.head), i.tail && i.tail !== "none" && (g += " tail=" + i.tail), i.dashed && (g += " kind=async"), i.constraint === !1 && (g += " constraint=false"), i.fromSide && (g += " from=" + i.fromSide), i.toSide && (g += " to=" + i.toSide), p.push(g);
   }
   for (const i of s.layouts)
-    u.push(
+    p.push(
       "layout " + i.scope + " " + i.kind + (i.direction ? " direction=" + i.direction : "")
     );
   for (const i of s.phases ?? [])
-    u.push(["phase", i.id, He(i.label), ...i.members].join(" "));
+    p.push(["phase", i.id, He(i.label), ...i.members].join(" "));
   for (const i of s.notes ?? []) {
     let g = "note " + He(i.text);
-    i.near && (g += " near=" + i.near), i.side && (g += " side=" + i.side), u.push(g);
+    i.near && (g += " near=" + i.near), i.side && (g += " side=" + i.side), p.push(g);
   }
-  const a = u.join(`
+  const a = p.join(`
 `) + `
 `;
   return a.length > De.nativeSourceChars && r(
@@ -3709,7 +3734,7 @@ function ea(e, t, s, n) {
     "create and destroy are omitted: native participants span the whole diagram."
   ), o.layouts.push({ scope: "root", kind: "sequence" });
   const w = [], l = [];
-  let u = 0, a, i;
+  let p = 0, a, i;
   const g = (M, k) => {
     const S = t(k).trim();
     a = {
@@ -3727,7 +3752,7 @@ function ea(e, t, s, n) {
   };
   for (const [M, k] of e.events.entries())
     if (Xn[k.kind])
-      u++, u === 1 ? g(Xn[k.kind], k.text) : h(
+      p++, p === 1 ? g(Xn[k.kind], k.text) : h(
         "MERMAID_SEQUENCE_NESTED_BLOCK",
         "A nested block has no band of its own; its messages stay in the outer band."
       ), h(
@@ -3735,9 +3760,9 @@ function ea(e, t, s, n) {
         "Native sequences have no fragments. Each block branch becomes a phase band, so the branch logic is only in its label."
       );
     else if (Kn[k.kind])
-      u === 1 && g(Kn[k.kind], k.text);
+      p === 1 && g(Kn[k.kind], k.text);
     else if (Ji.includes(k.kind))
-      u--, u || (a = void 0);
+      p--, p || (a = void 0);
     else if (k.kind === "NOTE") f(k);
     else if (k.kind === "ACTIVE_START" || k.kind === "ACTIVE_END")
       h("MERMAID_SEQUENCE_ACTIVATION", "Activation bars are omitted.", "appearance");
@@ -3821,7 +3846,7 @@ function na(e, t, s = "Imported Mermaid") {
         M
       ]);
     }
-  }, l = new Map(c.classes.map((f) => [f.id, f])), u = (f, M, k, S) => {
+  }, l = new Map(c.classes.map((f) => [f.id, f])), p = (f, M, k, S) => {
     const D = [];
     for (const _ of [...k ? ["default", "node"] : [], ...f]) {
       const $ = l.get(_);
@@ -3945,8 +3970,8 @@ function na(e, t, s = "Imported Mermaid") {
       let v = x;
       for (; v && !E.has(v); ) {
         E.add(v);
-        const p = _.get(v);
-        if (p) return p;
+        const u = _.get(v);
+        if (u) return u;
         v = S.get(v);
       }
       return D ?? "down";
@@ -3955,7 +3980,7 @@ function na(e, t, s = "Imported Mermaid") {
       const E = k.get(x.id), v = M.get(x.id);
       a(
         E,
-        u([...x.classes, ...v?.classes ?? []], v?.styles ?? [], !1, x.id),
+        p([...x.classes, ...v?.classes ?? []], v?.styles ?? [], !1, x.id),
         x.id
       ), n.layouts.push({
         scope: E.id,
@@ -3983,7 +4008,7 @@ function na(e, t, s = "Imported Mermaid") {
     }
     for (const x of c.vertices) {
       const E = k.get(x.id);
-      f.has(x.id) || a(E, u(x.classes, x.styles, !0, x.id), x.id), x.link && d(
+      f.has(x.id) || a(E, p(x.classes, x.styles, !0, x.id), x.id), x.link && d(
         "MERMAID_LINK_OMITTED",
         "External link was omitted; the native object has no active link.",
         "security",
@@ -4036,8 +4061,8 @@ function na(e, t, s = "Imported Mermaid") {
         );
         continue;
       }
-      const p = k.get(E.start), A = k.get(E.end);
-      if (!p || !A) {
+      const u = k.get(E.start), A = k.get(E.end);
+      if (!u || !A) {
         d("MERMAID_ENDPOINT", "A parsed edge has a missing endpoint.", "semantics", "error", [
           E.start,
           E.end
@@ -4047,7 +4072,7 @@ function na(e, t, s = "Imported Mermaid") {
       const m = E.isUserDefinedId && E.id ? o.get("edge-id", E.id, E.id) : o.get("edge-occurrence", String(x + 1), "edge_" + (x + 1)), b = E.id ?? String(x + 1);
       n.edges.push({
         id: m,
-        from: p.id,
+        from: u.id,
         to: A.id,
         label: y(E.text, E.labelType, b),
         directed: E.type !== "arrow_open",
@@ -4080,7 +4105,7 @@ function na(e, t, s = "Imported Mermaid") {
         "warning",
         [b]
       );
-      const T = u(
+      const T = p(
         E.classes,
         [...c.defaultEdgeStyle, ...E.style],
         !1,