@50arms/ui 0.0.0-stage → 35.2.0

package/dist/lib/syntax/markdown/parse.js

@@ -0,0 +1,464 @@
+import { normalizeRef as at, parseInline as z, plainText as lt } from "./inline.js";
+import { segmentOf as Y, makeSegments as ct } from "./spans.js";
+const it = 12, q = /^( {0,3})(`{3,}|~{3,})(.*)$/, Z = /^( {0,3})(#{1,6})(?:[ \t]|$)/, tt = /^ {0,3}(?:\*[ \t]*){3,}$|^ {0,3}(?:-[ \t]*){3,}$|^ {0,3}(?:_[ \t]*){3,}$/, A = /^ {0,3}>[ \t]?/, O = /^( {0,3})([-*+])(?:[ \t]|$)/, T = /^( {0,3})(\d{1,9})([.)])(?:[ \t]|$)/, ut = /^ {0,3}(=+|-+)[ \t]*$/, v = /^( {0,3})(\[\^([^\]\s]+)\]:)[ \t]*/d, et = /^( {0,3})(\[([^\]]+)\]:)[ \t]*(<[^>]*>|\S+)(?:[ \t]+(["'(].*["')]))?[ \t]*$/d, ft = /^\[([ xX])\](?:[ \t]+|$)/, ht = /^[ \t]*\|?[ \t]*:?-+:?[ \t]*(?:\|[ \t]*:?-+:?[ \t]*)*\|?[ \t]*$/, dt = /^(---|\+\+\+)[ \t]*$/;
+function Mt(t) {
+  return gt(t);
+}
+function gt(t, e) {
+  const n = pt(t), r = { source: t, sink: e, refs: xt(n), footnotes: [], ids: /* @__PURE__ */ new Map() }, a = [];
+  let o = 0;
+  const s = Et(n, r);
+  return s && (a.push(s.node), o = s.next), a.push(...M(n.slice(o), r, 0, "text")), r.footnotes.length && a.push({ kind: "footnotes", items: r.footnotes }), a;
+}
+function kt(t) {
+  return t.toLowerCase().replace(/[^\p{L}\p{N}]+/gu, "-").replace(/^-+|-+$/g, "");
+}
+function pt(t) {
+  const e = [];
+  let n = 0;
+  for (; ; ) {
+    const r = t.indexOf(`
+`, n), a = r < 0 ? t.slice(n) : t.slice(n, r);
+    if (e.push({ text: a.endsWith("\r") ? a.slice(0, -1) : a, start: n }), r < 0) break;
+    n = r + 1;
+  }
+  return e;
+}
+function y(t) {
+  return t.text.trim() === "";
+}
+function F(t) {
+  let e = 0;
+  for (const n of t)
+    if (n === " ") e += 1;
+    else if (n === "	") e += 4;
+    else break;
+  return e;
+}
+function S(t, e) {
+  let n = 0, r = 0;
+  for (; r < t.text.length && n < e; ) {
+    const a = t.text[r];
+    if (a === " ") n += 1;
+    else if (a === "	") n += 4;
+    else break;
+    r++;
+  }
+  return { text: t.text.slice(r), start: t.start + r };
+}
+function p(t, e, n, r) {
+  t.sink && n > e && t.sink.span(e, n, r);
+}
+function k(t, e, n, r) {
+  t.sink?.open(e, n, r);
+}
+function $(t, e) {
+  t.sink?.close(e);
+}
+function E(t, e) {
+  if (!t.sink) return;
+  let n = e;
+  t.source[n] === "\r" && n++, t.source[n] === `
+` && n++, t.sink.close(n, n > e ? [{ start: e, end: n }] : void 0);
+}
+function mt(t, e, n) {
+  return { start: t[e].start, end: d(t[n]) };
+}
+function X(t, e, n, r) {
+  const a = e.length > 0 && e[e.length - 1].start + e[e.length - 1].text.length === e[0].start;
+  if (!t.sink || !e.length || a) return z(n, t.refs, t.sink, r);
+  const o = [];
+  for (let c = 0; c < e.length; c++) {
+    const i = e[c], u = i.start + i.text.length;
+    if (o.push({ start: i.start, end: u }), c === e.length - 1) break;
+    let h = u;
+    t.source[h] === "\r" && h++, t.source[h] === `
+` && h++, h > u && o.push({ start: u, end: h });
+  }
+  k(t, { kind: "inline" }, e[0].start, o);
+  const s = z(n, t.refs, t.sink, r), l = e[e.length - 1];
+  return $(t, l.start + l.text.length), s;
+}
+function d(t) {
+  return t.start + t.text.length;
+}
+function xt(t) {
+  const e = /* @__PURE__ */ new Map();
+  let n = null, r = !0;
+  for (const a of t) {
+    const o = q.exec(a.text);
+    if (n) {
+      o && o[2][0] === n[0] && o[2].length >= n.length && (n = null);
+      continue;
+    }
+    if (o) {
+      n = o[2];
+      continue;
+    }
+    const s = r ? et.exec(a.text) : null;
+    if (s) {
+      const l = at(s[3]);
+      e.has(l) || e.set(l, { href: bt(s[4]), title: s[5] ? s[5].slice(1, -1) : void 0 }), r = !0;
+      continue;
+    }
+    r = y(a);
+  }
+  return e;
+}
+function bt(t) {
+  return (t.startsWith("<") && t.endsWith(">") ? t.slice(1, -1) : t).replace(/\\([!-/:-@[-`{-~])/g, "$1");
+}
+function Et(t, e) {
+  if (!t.length) return null;
+  const n = dt.exec(t[0].text);
+  if (!n) return null;
+  let r = -1;
+  for (let s = 1; s < t.length; s++)
+    if (t[s].text.trimEnd() === n[1]) {
+      r = s;
+      break;
+    }
+  if (r < 0) return null;
+  const a = n[1] === "---" ? "yaml" : "toml", o = t.slice(1, r);
+  if (p(e, t[0].start, d(t[0]), "marker"), p(e, t[r].start, d(t[r]), "marker"), o.length && e.sink) {
+    const s = o[0].start, l = d(o[o.length - 1]);
+    e.sink.embed(e.source.slice(s, l), a, s);
+  }
+  if (k(e, { kind: "frontmatter", language: a }, t[0].start), o.length) {
+    const s = o[0].start, l = d(o[o.length - 1]);
+    k(e, { kind: "codeBody", language: a }, s, [{ start: s, end: l }]), $(e, l);
+  }
+  return E(e, d(t[r])), { node: { kind: "frontmatter", language: a, body: o.map((s) => s.text).join(`
+`) }, next: r + 1 };
+}
+function M(t, e, n, r) {
+  const a = [];
+  if (n > it) return a;
+  let o = 0;
+  for (; o < t.length; ) {
+    const s = t[o];
+    if (y(s)) {
+      o++;
+      continue;
+    }
+    const l = wt(t, o, e);
+    if (l) {
+      a.push(l.node), o = l.next;
+      continue;
+    }
+    const c = $t(s, e, r);
+    if (c) {
+      a.push(c), o++;
+      continue;
+    }
+    if (tt.test(s.text)) {
+      k(e, { kind: "rule" }, s.start), p(e, s.start, d(s), "marker"), a.push({ kind: "rule" }), E(e, d(s)), o++;
+      continue;
+    }
+    if (A.test(s.text)) {
+      k(e, { kind: "quote" }, s.start);
+      const f = yt(t, o, e, n);
+      a.push(f.node), E(e, d(t[f.next - 1])), o = f.next;
+      continue;
+    }
+    const i = v.exec(s.text);
+    if (i) {
+      k(e, { kind: "footnoteDef", label: i[3] }, s.start);
+      const f = Ot(t, o, e, n);
+      E(e, d(t[f.next - 1])), o = f.next;
+      continue;
+    }
+    const u = et.exec(s.text);
+    if (u) {
+      k(e, { kind: "linkDef" }, s.start), Tt(s, u, e), E(e, d(s)), o++;
+      continue;
+    }
+    if (rt(t, o)) {
+      k(e, { kind: "table" }, s.start);
+      const f = Dt(t, o, e);
+      a.push(f.node), $(e, d(t[f.next - 1])), o = f.next;
+      continue;
+    }
+    if (O.test(s.text) || T.test(s.text)) {
+      const f = T.exec(s.text), x = !O.exec(s.text) && !!f, g = { kind: "list", ordered: x, start: x ? Number(f[2]) : 1, tight: !0 };
+      k(e, g, s.start);
+      const w = _t(t, o, e, n, r, g);
+      a.push(w.node), E(e, d(t[w.next - 1])), o = w.next;
+      continue;
+    }
+    if (F(s.text) >= 4) {
+      const f = Rt(t, o, e);
+      a.push(f.node), o = f.next;
+      continue;
+    }
+    const h = Lt(t, o, e, r);
+    a.push(h.node), o = h.next;
+  }
+  return a;
+}
+function L(t) {
+  return q.test(t) || Z.test(t) || tt.test(t) || A.test(t) || O.test(t) || T.test(t) || v.test(t);
+}
+function wt(t, e, n) {
+  const r = t[e], a = q.exec(r.text);
+  if (!a || a[2][0] === "`" && a[3].includes("`")) return null;
+  const o = a[1].length, s = r.start + o;
+  p(n, s, s + a[2].length, "marker");
+  const l = a[3].trim();
+  if (l) {
+    const g = r.text.indexOf(l, o + a[2].length);
+    p(n, r.start + g, r.start + g + l.length, "attribute");
+  }
+  const c = l ? l.split(/\s+/)[0] : null, i = a[2][0] === "~" ? "~" : "\\u0060", u = new RegExp("^ {0,3}" + i + "{" + a[2].length + ",}[ \\t]*$"), h = [];
+  let f = e + 1, m = !0;
+  for (; f < t.length; f++) {
+    if (u.test(t[f].text)) {
+      p(n, t[f].start, d(t[f]), "marker"), m = !1, f++;
+      break;
+    }
+    h.push(t[f]);
+  }
+  if (h.length && n.sink) {
+    const g = h[0].start, w = d(h[h.length - 1]);
+    n.sink.embed(n.source.slice(g, w), c, g);
+  }
+  if (k(n, { kind: "code", language: c, fenced: !0, open: m }, r.start), h.length) {
+    const g = h[0].start, w = d(h[h.length - 1]);
+    k(n, { kind: "codeBody", language: c }, g, [{ start: g, end: w }]), $(n, w);
+  }
+  E(n, d(t[f - 1]));
+  const x = h.map((g) => S(g, o).text).join(`
+`);
+  return { node: { kind: "code", language: c, code: x, open: m }, next: f };
+}
+function Rt(t, e, n) {
+  const r = [];
+  let a = e;
+  for (; a < t.length && (y(t[a]) || F(t[a].text) >= 4); )
+    r.push(t[a]), a++;
+  for (; r.length && y(r[r.length - 1]); )
+    r.pop(), a--;
+  const o = r[0].start, s = d(r[r.length - 1]);
+  return p(n, o, s, "string"), k(n, { kind: "code", language: null, fenced: !1, open: !1 }, o), k(
+    n,
+    { kind: "codeBody", language: null },
+    o,
+    r.map((c) => S(c, 4)).map((c) => ({ start: c.start, end: c.start + c.text.length }))
+  ), $(n, s), E(n, s), { node: { kind: "code", language: null, code: r.map((c) => S(c, 4).text).join(`
+`), open: !1 }, next: a };
+}
+function $t(t, e, n) {
+  const r = Z.exec(t.text);
+  if (!r) return null;
+  const a = r[2].length, o = t.start + r[1].length;
+  p(e, o, o + a, "marker");
+  let s = r[1].length + a, l = t.text.length;
+  const c = /(^|[ \t])(#+)[ \t]*$/.exec(t.text.slice(s));
+  if (c) {
+    const h = s + c.index + c[1].length;
+    p(e, t.start + h, t.start + h + c[2].length, "marker"), l = h;
+  }
+  for (; s < l && /[ \t]/.test(t.text[s]); ) s++;
+  if (c) for (; l > s && /[ \t]/.test(t.text[l - 1]); ) l--;
+  const i = Y({ text: t.text.slice(s, l), start: t.start + s });
+  k(e, { kind: "heading", level: a }, t.start);
+  const u = X(e, [{ text: t.text.slice(s, l), start: t.start + s }], i, n === "text" ? "heading" : n);
+  return E(e, d(t)), { kind: "heading", level: a, id: nt(e, u), children: u };
+}
+function nt(t, e) {
+  const n = kt(lt(e)) || "section", r = t.ids.get(n) ?? 0;
+  return t.ids.set(n, r + 1), r === 0 ? n : `${n}-${r}`;
+}
+function yt(t, e, n, r) {
+  const a = [];
+  let o = e;
+  for (; o < t.length; ) {
+    const s = t[o], l = A.exec(s.text);
+    if (l) {
+      p(n, s.start, s.start + l[0].length, "quote"), a.push({ text: s.text.slice(l[0].length), start: s.start + l[0].length }), o++;
+      continue;
+    }
+    if (y(s) || L(s.text) || a.length === 0) break;
+    a.push(s), o++;
+  }
+  return { node: { kind: "quote", children: M(a, n, r + 1, "quote") }, next: o };
+}
+function _t(t, e, n, r, a, o) {
+  const s = T.exec(t[e].text), l = O.exec(t[e].text), c = !l && !!s, i = c ? s[3] : l[2], u = c ? Number(s[2]) : 1, h = [];
+  let f = !1, m = e;
+  for (; m < t.length; ) {
+    const x = t[m], g = c ? T.exec(x.text) : O.exec(x.text);
+    if (!g || (c ? g[3] : g[2]) !== i) break;
+    const w = g[1].length, I = c ? g[2] + g[3] : g[2], K = x.start + w, P = { kind: "listItem", checked: null, marker: I }, ot = x.start;
+    k(n, P, ot), p(n, K, K + I.length, "marker");
+    const U = w + I.length, G = x.text.slice(U), C = /^[ \t]*/.exec(G)[0].length, j = U + (G.trim() === "" || C === 0 || C > 4 ? 1 : C), b = [{ text: x.text.slice(j), start: x.start + j }];
+    m++;
+    const _ = [];
+    for (; m < t.length; ) {
+      const R = t[m];
+      if (y(R)) {
+        _.push(R), m++;
+        continue;
+      }
+      if (F(R.text) >= j) {
+        if (_.length) {
+          f = !0;
+          for (const st of _) b.push({ text: "", start: st.start });
+          _.length = 0;
+        }
+        b.push(S(R, j)), m++;
+        continue;
+      }
+      if (_.length === 0 && !L(R.text)) {
+        b.push(R), m++;
+        continue;
+      }
+      break;
+    }
+    if (_.length && m < t.length) {
+      const R = c ? T.exec(t[m].text) : O.exec(t[m].text);
+      R && (c ? R[3] : R[2]) === i && (f = !0);
+    }
+    let N = null;
+    const B = ft.exec(b[0].text);
+    B && (N = B[1] !== " ", P.checked = N, p(n, b[0].start, b[0].start + 3, "marker"), b[0] = { text: b[0].text.slice(B[0].length), start: b[0].start + B[0].length }), h.push({ checked: N, children: M(b, n, r + 1, a) });
+    const Q = b[b.length - 1];
+    E(n, Q.start + Q.text.length);
+  }
+  return o && (o.tight = !f), { node: { kind: "list", ordered: c, start: u, tight: !f, items: h }, next: m };
+}
+function Ot(t, e, n, r) {
+  const a = t[e], o = v.exec(a.text);
+  if (!o) return null;
+  const s = a.start + o[1].length;
+  p(n, s, s + o[2].length, "marker");
+  const l = [{ text: a.text.slice(o[0].length), start: a.start + o[0].length }];
+  let c = e + 1;
+  for (; c < t.length; ) {
+    const i = t[c];
+    if (y(i)) {
+      if (c + 1 < t.length && F(t[c + 1].text) >= 4) {
+        l.push({ text: "", start: i.start }), c++;
+        continue;
+      }
+      break;
+    }
+    if (F(i.text) >= 4) {
+      l.push(S(i, 4)), c++;
+      continue;
+    }
+    if (L(i.text)) break;
+    l.push(i), c++;
+  }
+  return n.footnotes.push({ label: o[3], children: M(l, n, r + 1, "text") }), { next: c };
+}
+function Tt(t, e, n) {
+  const r = t.start + e[1].length;
+  p(n, r, r + e[2].length, "marker");
+  const a = e.indices?.[4];
+  a && p(n, t.start + a[0], t.start + a[1], "url");
+  const o = e.indices?.[5];
+  o && p(n, t.start + o[0], t.start + o[1], "string");
+}
+function rt(t, e) {
+  if (e + 1 >= t.length) return !1;
+  const n = t[e], r = t[e + 1];
+  return !n.text.includes("|") || !r.text.includes("-") || !ht.test(r.text) ? !1 : D(n).cells.length === D(r).cells.length;
+}
+function D(t) {
+  const e = [], n = [], r = t.text;
+  let a = 0;
+  for (let o = 0; o < r.length; o++) {
+    if (r[o] === "\\") {
+      o++;
+      continue;
+    }
+    r[o] === "|" && (n.push({ start: t.start + o, end: t.start + o + 1 }), e.push(H({ text: r.slice(a, o), start: t.start + a })), a = o + 1);
+  }
+  return e.push(H({ text: r.slice(a), start: t.start + a })), e.length > 1 && e[0].text === "" && /^[ \t]*\|/.test(r) && e.shift(), e.length > 1 && e[e.length - 1].text === "" && /\|[ \t]*$/.test(r) && e.pop(), { cells: e, pipes: n };
+}
+function H(t) {
+  const e = /^[ \t]*/.exec(t.text)[0].length;
+  return { text: t.text.slice(e).replace(/[ \t]+$/, ""), start: t.start + e };
+}
+function Dt(t, e, n) {
+  let r = e + 1;
+  for (; r + 1 < t.length; ) {
+    const u = t[r + 1];
+    if (y(u) || !u.text.includes("|") || L(u.text)) break;
+    r++;
+  }
+  const o = D(t[e + 1]).cells.map(St), s = D(t[e]);
+  for (const u of s.pipes) p(n, u.start, u.end, "punctuation");
+  const l = J(n, t[e], s.cells, !0, o, W(n, d(t[e])));
+  p(n, t[e + 1].start, d(t[e + 1]), "marker");
+  const c = e + 1 === r ? d(t[e + 1]) : W(n, d(t[e + 1]));
+  k(n, { kind: "tableDelimiter" }, t[e + 1].start), k(n, { kind: "tableGutter" }, t[e + 1].start), $(n, c), $(n, c);
+  const i = [];
+  for (let u = e + 2; u <= r; u++) {
+    const h = t[u], f = D(h);
+    for (const g of f.pipes) p(n, g.start, g.end, "punctuation");
+    const m = u === r ? d(h) : W(n, d(h)), x = J(n, h, f.cells, !1, o, m);
+    for (; x.length < l.length; ) x.push({ children: [] });
+    i.push(x.slice(0, l.length));
+  }
+  return { node: { kind: "table", head: l, rows: i, align: o }, next: r + 1 };
+}
+function W(t, e) {
+  let n = e;
+  return t.source[n] === "\r" && n++, t.source[n] === `
+` && n++, n;
+}
+function J(t, e, n, r, a, o) {
+  k(t, { kind: "tableRow", header: r }, e.start);
+  const s = [];
+  let l = e.start;
+  const c = (i) => {
+    i <= l || (k(t, { kind: "tableGutter" }, l), $(t, i), l = i);
+  };
+  for (let i = 0; i < n.length; i++) {
+    const u = n[i];
+    c(u.start), s.push(Ft(u, t, r, a[i] ?? null)), l = u.start + u.text.length;
+  }
+  return c(o), $(t, o), s;
+}
+function Ft(t, e, n, r) {
+  k(e, { kind: "tableCell", header: n, align: r }, t.start);
+  const a = X(e, [t], Y(t), "text");
+  return $(e, t.start + t.text.length), { children: a };
+}
+function St(t) {
+  const e = t.text.trim(), n = e.startsWith(":"), r = e.endsWith(":");
+  return n && r ? "center" : r ? "right" : n ? "left" : null;
+}
+function Lt(t, e, n, r) {
+  const a = [t[e]];
+  let o = e + 1;
+  for (; o < t.length; ) {
+    const l = t[o];
+    if (y(l)) break;
+    const c = ut.exec(l.text);
+    if (c) {
+      p(n, l.start, d(l), "marker");
+      const i = c[1][0] === "=" ? 1 : 2;
+      k(n, { kind: "heading", level: i }, t[e].start);
+      const u = V(a, n, r === "text" ? "heading" : r);
+      return E(n, d(l)), { node: { kind: "heading", level: i, id: nt(n, u), children: u }, next: o + 1 };
+    }
+    if (L(l.text) || rt(t, o)) break;
+    a.push(l), o++;
+  }
+  k(n, { kind: "paragraph" }, t[e].start);
+  const s = { kind: "paragraph", children: V(a, n, r) };
+  return E(n, mt(t, e, o - 1).end), { node: s, next: o };
+}
+function V(t, e, n) {
+  return X(e, t, ct(t), n);
+}
+export {
+  q as RE_FENCE,
+  gt as parseDocument,
+  Mt as parseMarkdown,
+  kt as slug
+};
+//# sourceMappingURL=parse.js.map

package/dist/lib/syntax/markdown/parse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse.js","sources":["../../../../src/lib/syntax/markdown/parse.ts"],"sourcesContent":["/* ============================================================================\n   MARKDOWN — BLOCKS FIRST, THEN INLINE.\n\n   WHY THIS IS A PARSER AND NOT A RULE STACK (the argument in ./types.ts, made\n   concrete). Three decisions in this file cannot be made by looking at the\n   characters under the cursor:\n\n     - `---` is a thematic break, the underline of a setext heading, or the end\n       of front matter, depending on what came BEFORE it.\n     - A line indented four spaces is a code block at the top level and a\n       paragraph inside a list item whose marker was three columns wide.\n     - A line with no marker at all continues the blockquote above it (lazy\n       continuation) unless it happens to start a block of its own.\n\n   Each needs context a positional scanner does not have, which is why markdown\n   is the one language here with `tokenize` overridden and a real parse behind\n   it.\n\n   THE PARSE HAPPENS ONCE. `parseDocument` optionally takes a `Sink`; the\n   renderer's tree and the editor's token list both come out of the same walk,\n   so they cannot disagree about where a heading starts. See ./spans.ts.\n\n   RAW HTML IS NEVER INTERPRETED — a `<div>` in the source is the literal text\n   `<div>`. That is a security decision, not a missing feature; see ./inline.ts.\n   ========================================================================= */\n\nimport type { TokenType } from \"../types\";\nimport { normalizeRef, parseInline, plainText, type LinkRef } from \"./inline\";\nimport type { Frame, Range } from \"./frames\";\nimport { makeSegments, segmentOf, type Piece, type Segments, type Sink } from \"./spans\";\nimport type { MdAlign, MdCell, MdInline, MdListItem, MdNode } from \"./types\";\n\n/** A source line, without its terminator, with the offset of its first char. */\ninterface Line {\n  text: string;\n  start: number;\n}\n\ninterface Ctx {\n  source: string;\n  sink?: Sink;\n  refs: Map<string, LinkRef>;\n  footnotes: Array<{ label: string; children: MdNode[] }>;\n  ids: Map<string, number>;\n}\n\n/** Deeply nested quotes/lists recurse; a pathological document must terminate. */\nconst MAX_BLOCK_DEPTH = 12;\n\n/** Exported so any other layer that needs to find the SAME fence boundaries\n    the parser itself will — e.g. `StreamingMarkdown`'s pre-parse balancing\n    pass — imports this instead of keeping a second copy of the pattern. */\nexport const RE_FENCE = /^( {0,3})(`{3,}|~{3,})(.*)$/;\nconst RE_ATX = /^( {0,3})(#{1,6})(?:[ \\t]|$)/;\nconst RE_RULE = /^ {0,3}(?:\\*[ \\t]*){3,}$|^ {0,3}(?:-[ \\t]*){3,}$|^ {0,3}(?:_[ \\t]*){3,}$/;\nconst RE_QUOTE = /^ {0,3}>[ \\t]?/;\nconst RE_BULLET = /^( {0,3})([-*+])(?:[ \\t]|$)/;\nconst RE_ORDERED = /^( {0,3})(\\d{1,9})([.)])(?:[ \\t]|$)/;\nconst RE_SETEXT = /^ {0,3}(=+|-+)[ \\t]*$/;\nconst RE_FOOTDEF = /^( {0,3})(\\[\\^([^\\]\\s]+)\\]:)[ \\t]*/d;\nconst RE_LINKDEF = /^( {0,3})(\\[([^\\]]+)\\]:)[ \\t]*(<[^>]*>|\\S+)(?:[ \\t]+([\"'(].*[\"')]))?[ \\t]*$/d;\nconst RE_TASK = /^\\[([ xX])\\](?:[ \\t]+|$)/;\nconst RE_DELIM_ROW = /^[ \\t]*\\|?[ \\t]*:?-+:?[ \\t]*(?:\\|[ \\t]*:?-+:?[ \\t]*)*\\|?[ \\t]*$/;\nconst RE_FRONT = /^(---|\\+\\+\\+)[ \\t]*$/;\n\n/* --- Public API ----------------------------------------------------------- */\n\n/** The renderer's entry point: tree only, no token bookkeeping. */\nexport function parseMarkdown(source: string): MdNode[] {\n  return parseDocument(source);\n}\n\n/**\n * The shared entry point. `sink` is supplied only by the grammar; without it\n * the span reporting compiles down to a handful of `undefined` checks.\n */\nexport function parseDocument(source: string, sink?: Sink): MdNode[] {\n  const lines = toLines(source);\n  const ctx: Ctx = { source, sink, refs: collectRefs(lines), footnotes: [], ids: new Map() };\n\n  const nodes: MdNode[] = [];\n  let start = 0;\n\n  const front = readFrontMatter(lines, ctx);\n  if (front) {\n    nodes.push(front.node);\n    start = front.next;\n  }\n\n  nodes.push(...parseBlocks(lines.slice(start), ctx, 0, \"text\"));\n\n  /* Footnote definitions are gathered wherever they appeared and rendered once,\n     at the end — which is where a reader looks for them regardless of where the\n     author happened to type them. */\n  if (ctx.footnotes.length) nodes.push({ kind: \"footnotes\", items: ctx.footnotes });\n\n  return nodes;\n}\n\n/** Heading anchors: lowercase, non-word runs to hyphens, trimmed. */\nexport function slug(text: string): string {\n  return text\n    .toLowerCase()\n    .replace(/[^\\p{L}\\p{N}]+/gu, \"-\")\n    .replace(/^-+|-+$/g, \"\");\n}\n\n/* --- Lines ---------------------------------------------------------------- */\n\nfunction toLines(source: string): Line[] {\n  const lines: Line[] = [];\n  let start = 0;\n  for (;;) {\n    const nl = source.indexOf(\"\\n\", start);\n    const raw = nl < 0 ? source.slice(start) : source.slice(start, nl);\n    /* A CRLF document keeps its `\\r` in the source but not in the line text;\n       the stray byte is left uncovered on purpose, so the token normaliser\n       reports it as plain text and every offset after it stays correct. */\n    lines.push({ text: raw.endsWith(\"\\r\") ? raw.slice(0, -1) : raw, start });\n    if (nl < 0) break;\n    start = nl + 1;\n  }\n  return lines;\n}\n\nfunction isBlank(line: Line): boolean {\n  return line.text.trim() === \"\";\n}\n\nfunction indentOf(text: string): number {\n  let n = 0;\n  for (const ch of text) {\n    if (ch === \" \") n += 1;\n    else if (ch === \"\\t\") n += 4;\n    else break;\n  }\n  return n;\n}\n\n/** Removes up to `n` columns of leading whitespace, keeping offsets truthful. */\nfunction stripIndent(line: Line, n: number): Line {\n  let taken = 0;\n  let i = 0;\n  while (i < line.text.length && taken < n) {\n    const ch = line.text[i];\n    if (ch === \" \") taken += 1;\n    else if (ch === \"\\t\") taken += 4;\n    else break;\n    i++;\n  }\n  return { text: line.text.slice(i), start: line.start + i };\n}\n\nfunction mark(ctx: Ctx, start: number, end: number, type: TokenType): void {\n  if (ctx.sink && end > start) ctx.sink.span(start, end, type);\n}\n\n/* --- Frames --------------------------------------------------------------- */\n\n/**\n * Blocks are bracketed in `parseBlocks` rather than inside each `read*`,\n * because that is the ONE place that knows both ends: a `read*` returns `next`,\n * and `lines[next - 1]` is the last line it took. Doing it inside each reader\n * would mean thirteen places computing the same end offset, and the setext case\n * proves how that goes wrong — the underline is not in the paragraph's pieces,\n * so a reader that measured its own content would stop one line short.\n */\nfunction frame(ctx: Ctx, f: Frame, start: number, content?: readonly Range[]): void {\n  ctx.sink?.open(f, start, content);\n}\n\nfunction endFrame(ctx: Ctx, end: number): void {\n  ctx.sink?.close(end);\n}\n\n/**\n * Closes a BLOCK frame, extending it over its own line terminator and claiming\n * that terminator as its text.\n *\n * WHY A BLOCK OWNS ITS LINE ENDING. A newline and a box both mean \"break the\n * line\", and a projection that keeps both prints every break twice — so exactly\n * one of them has to win, per construct. The rule this expresses is: a block\n * OWNS the newline that ends it, renders it, and therefore needs no box of its\n * own. The one construct where the box wins instead is the table, whose rows\n * must be real `<tr>` elements; its internal newlines stay unclaimed and\n * collapse, which is what stops a table double-spacing.\n *\n * Measured, not reasoned: with the terminator left unclaimed, a two-item list\n * rendered on ONE line, and making the item a box instead rendered it on five.\n */\nfunction endBlock(ctx: Ctx, end: number): void {\n  if (!ctx.sink) return;\n  let at = end;\n  /* `\\r\\n` counts as one ending — the parser drops the `\\r` from the line text\n     but it is still a source character and still part of the break. */\n  if (ctx.source[at] === \"\\r\") at++;\n  if (ctx.source[at] === \"\\n\") at++;\n  ctx.sink.close(at, at > end ? [{ start: end, end: at }] : undefined);\n}\n\n/** The span a run of lines occupies, from the first character to the last. */\nfunction spanOf(lines: Line[], from: number, to: number): { start: number; end: number } {\n  return { start: lines[from].start, end: lineEnd(lines[to]) };\n}\n\n/**\n * Opens the frame that holds one run of prose, and declares what of it is text.\n *\n * THE TWO KINDS OF CHARACTER BETWEEN TWO LINES, which is the whole reason this\n * lives here rather than inside `parseInline`. A paragraph's pieces are its\n * lines with every block prefix already cut off, so what sits between piece N\n * and piece N+1 is a line terminator FOLLOWED BY a prefix — and they are\n * opposites. The terminator is the author's own line break and must survive as\n * text, or two lines of a paragraph would run together with no space; the\n * `> ` or the list indent is markup and must collapse. Declaring the pieces\n * alone loses the first; declaring the hull keeps the second.\n *\n * Only this layer can tell them apart, because only it has the source string.\n */\nfunction inlineFrame(ctx: Ctx, pieces: Line[], seg: Segments, ambient: TokenType): MdInline[] {\n  /* SG-794 — AN EMPTY RUN GETS NO FRAME OF ITS OWN, not even a zero-width one.\n     `pieces.length` can be 1 with the one piece itself holding no characters —\n     an empty table cell, notably, once `toCell()` trims its content down to \"\".\n     Opening `{kind:\"inline\"}` there would put a SECOND zero-width frame at the\n     exact same offset as the caller's own zero-width frame (a table cell, a\n     list item, whatever called this) — and `project.ts`'s `walk()` never\n     recurses into a zero-width frame's children (a zero-width element already\n     gets its one synthetic empty text leaf for free, so there is nothing for\n     a nested frame to usefully hold anyway). The inline frame's content is\n     therefore never visited as this element's child; it surfaces instead as\n     an ORPHANED SIBLING at the same offset, one level up — a stray `<span\n     data-md=\"inline\">` sitting directly inside a `<tr>`, which is not\n     something a browser's table model can place: it gets wrapped in an\n     anonymous cell box, adding a column the row's own gutters never declared\n     and throwing off every other row's column alignment. Skip opening the\n     frame when there is nothing in it to declare — `parseInline` still runs,\n     and still correctly returns no children for no text. */\n  const empty = pieces.length > 0 && pieces[pieces.length - 1].start + pieces[pieces.length - 1].text.length === pieces[0].start;\n  if (!ctx.sink || !pieces.length || empty) return parseInline(seg, ctx.refs, ctx.sink, ambient);\n\n  const ranges: Range[] = [];\n  for (let i = 0; i < pieces.length; i++) {\n    const piece = pieces[i];\n    const end = piece.start + piece.text.length;\n    ranges.push({ start: piece.start, end });\n    if (i === pieces.length - 1) break;\n    /* The terminator, `\\r\\n` included — the parser drops the `\\r` from the line\n       text but it is still a source character and still belongs to the break. */\n    let at = end;\n    if (ctx.source[at] === \"\\r\") at++;\n    if (ctx.source[at] === \"\\n\") at++;\n    if (at > end) ranges.push({ start: end, end: at });\n  }\n\n  frame(ctx, { kind: \"inline\" }, pieces[0].start, ranges);\n  const children = parseInline(seg, ctx.refs, ctx.sink, ambient);\n  const tail = pieces[pieces.length - 1];\n  endFrame(ctx, tail.start + tail.text.length);\n  return children;\n}\n\nfunction lineEnd(line: Line): number {\n  return line.start + line.text.length;\n}\n\n/* --- Link reference definitions ------------------------------------------- */\n\n/**\n * A reference definition may appear AFTER the link that uses it, so they are\n * collected in their own pass. Fenced regions are skipped: `[x]: y` inside a\n * code block is code, and letting it register a definition would silently\n * change how prose elsewhere in the document renders.\n */\nfunction collectRefs(lines: Line[]): Map<string, LinkRef> {\n  const refs = new Map<string, LinkRef>();\n  let fence: string | null = null;\n  let canStart = true;\n\n  for (const line of lines) {\n    const fenceMatch = RE_FENCE.exec(line.text);\n    if (fence) {\n      if (fenceMatch && fenceMatch[2][0] === fence[0] && fenceMatch[2].length >= fence.length) fence = null;\n      continue;\n    }\n    if (fenceMatch) {\n      fence = fenceMatch[2];\n      continue;\n    }\n\n    const def = canStart ? RE_LINKDEF.exec(line.text) : null;\n    if (def) {\n      const key = normalizeRef(def[3]);\n      if (!refs.has(key)) refs.set(key, { href: cleanDest(def[4]), title: def[5] ? def[5].slice(1, -1) : undefined });\n      canStart = true;\n      continue;\n    }\n    canStart = isBlank(line);\n  }\n\n  return refs;\n}\n\nfunction cleanDest(dest: string): string {\n  const inner = dest.startsWith(\"<\") && dest.endsWith(\">\") ? dest.slice(1, -1) : dest;\n  return inner.replace(/\\\\([!-/:-@[-`{-~])/g, \"$1\");\n}\n\n/* --- Front matter --------------------------------------------------------- */\n\nfunction readFrontMatter(lines: Line[], ctx: Ctx): { node: MdNode; next: number } | null {\n  if (!lines.length) return null;\n  const open = RE_FRONT.exec(lines[0].text);\n  if (!open) return null;\n\n  let close = -1;\n  for (let i = 1; i < lines.length; i++) {\n    if (lines[i].text.trimEnd() === open[1]) {\n      close = i;\n      break;\n    }\n  }\n  /* An unterminated `---` at the top of a file is a thematic break, not front\n     matter that will eventually close — otherwise every document starting with\n     a horizontal rule would swallow itself. */\n  if (close < 0) return null;\n\n  const language = open[1] === \"---\" ? \"yaml\" : \"toml\";\n  const body = lines.slice(1, close);\n  mark(ctx, lines[0].start, lineEnd(lines[0]), \"marker\");\n  mark(ctx, lines[close].start, lineEnd(lines[close]), \"marker\");\n\n  if (body.length && ctx.sink) {\n    const from = body[0].start;\n    const to = lineEnd(body[body.length - 1]);\n    ctx.sink.embed(ctx.source.slice(from, to), language, from);\n  }\n\n  frame(ctx, { kind: \"frontmatter\", language }, lines[0].start);\n  if (body.length) {\n    const bodyFrom = body[0].start;\n    const bodyTo = lineEnd(body[body.length - 1]);\n    frame(ctx, { kind: \"codeBody\", language }, bodyFrom, [{ start: bodyFrom, end: bodyTo }]);\n    endFrame(ctx, bodyTo);\n  }\n  endBlock(ctx, lineEnd(lines[close]));\n\n  return { node: { kind: \"frontmatter\", language, body: body.map((l) => l.text).join(\"\\n\") }, next: close + 1 };\n}\n\n/* --- Blocks --------------------------------------------------------------- */\n\nfunction parseBlocks(lines: Line[], ctx: Ctx, depth: number, ambient: TokenType): MdNode[] {\n  const nodes: MdNode[] = [];\n  if (depth > MAX_BLOCK_DEPTH) return nodes;\n  let i = 0;\n\n  while (i < lines.length) {\n    const line = lines[i];\n\n    if (isBlank(line)) {\n      i++;\n      continue;\n    }\n\n    /* WHERE A FRAME IS OPENED depends on one thing only: whether the block has\n       CHILD frames. `open`/`close` must nest properly with each other (spans do\n       not participate), so a reader that recurses — quote, list, footnote,\n       table — is bracketed HERE, before it runs. A reader with no children, or\n       one whose own children come last, opens its frame itself: the fence knows\n       its language only after scanning, and paragraph-versus-setext is not\n       decided until the terminating line is read. */\n    const fence = readFence(lines, i, ctx);\n    if (fence) {\n      nodes.push(fence.node);\n      i = fence.next;\n      continue;\n    }\n\n    const atx = readAtx(line, ctx, ambient);\n    if (atx) {\n      nodes.push(atx);\n      i++;\n      continue;\n    }\n\n    if (RE_RULE.test(line.text)) {\n      frame(ctx, { kind: \"rule\" }, line.start);\n      mark(ctx, line.start, lineEnd(line), \"marker\");\n      nodes.push({ kind: \"rule\" });\n      endBlock(ctx, lineEnd(line));\n      i++;\n      continue;\n    }\n\n    if (RE_QUOTE.test(line.text)) {\n      frame(ctx, { kind: \"quote\" }, line.start);\n      const quote = readQuote(lines, i, ctx, depth);\n      nodes.push(quote.node);\n      endBlock(ctx, lineEnd(lines[quote.next - 1]));\n      i = quote.next;\n      continue;\n    }\n\n    const footMatch = RE_FOOTDEF.exec(line.text);\n    if (footMatch) {\n      frame(ctx, { kind: \"footnoteDef\", label: footMatch[3] }, line.start);\n      const foot = readFootnoteDef(lines, i, ctx, depth)!;\n      endBlock(ctx, lineEnd(lines[foot.next - 1]));\n      i = foot.next;\n      continue;\n    }\n\n    const def = RE_LINKDEF.exec(line.text);\n    if (def) {\n      frame(ctx, { kind: \"linkDef\" }, line.start);\n      markLinkDef(line, def, ctx);\n      endBlock(ctx, lineEnd(line));\n      i++;\n      continue;\n    }\n\n    if (isTableStart(lines, i)) {\n      frame(ctx, { kind: \"table\" }, line.start);\n      const table = readTable(lines, i, ctx);\n      nodes.push(table.node);\n      /* THE ONE BLOCK THAT DOES NOT OWN ITS LINE ENDING. A table renders as a\n         real box because its rows must be real rows, and a box cannot hold\n         loose text — claiming the terminator put a text node directly inside\n         <table>, which is invalid markup. So the box wins here and the\n         terminator stays at document level, where it still renders. */\n      endFrame(ctx, lineEnd(lines[table.next - 1]));\n      i = table.next;\n      continue;\n    }\n\n    if (RE_BULLET.test(line.text) || RE_ORDERED.test(line.text)) {\n      const first = RE_ORDERED.exec(line.text);\n      const bullet = RE_BULLET.exec(line.text);\n      const ordered = !bullet && !!first;\n      /* `tight` is only known once the whole list is read, so the frame carries\n         the value the reader will land on — filled in by `readList` through the\n         record it is handed, rather than guessed here. */\n      const listFrame: Frame = { kind: \"list\", ordered, start: ordered ? Number(first![2]) : 1, tight: true };\n      frame(ctx, listFrame, line.start);\n      const list = readList(lines, i, ctx, depth, ambient, listFrame);\n      nodes.push(list.node);\n      endBlock(ctx, lineEnd(lines[list.next - 1]));\n      i = list.next;\n      continue;\n    }\n\n    if (indentOf(line.text) >= 4) {\n      const code = readIndentedCode(lines, i, ctx);\n      nodes.push(code.node);\n      i = code.next;\n      continue;\n    }\n\n    /* Paragraph and setext share a reader, and which one it produced is only\n       known afterwards — so this frame is opened by the reader, not here. */\n    const para = readParagraph(lines, i, ctx, ambient);\n    nodes.push(para.node);\n    i = para.next;\n  }\n\n  return nodes;\n}\n\n/** Everything that ends a paragraph by starting something of its own. */\nfunction startsBlock(text: string): boolean {\n  return (\n    RE_FENCE.test(text) ||\n    RE_ATX.test(text) ||\n    RE_RULE.test(text) ||\n    RE_QUOTE.test(text) ||\n    RE_BULLET.test(text) ||\n    RE_ORDERED.test(text) ||\n    RE_FOOTDEF.test(text)\n  );\n}\n\n/* --- Fenced code ---------------------------------------------------------- */\n\nfunction readFence(lines: Line[], i: number, ctx: Ctx): { node: MdNode; next: number } | null {\n  const line = lines[i];\n  const m = RE_FENCE.exec(line.text);\n  if (!m) return null;\n  /* A backtick fence's info string cannot contain a backtick, which is what\n     keeps `` `a` `` from being read as an opening fence. */\n  if (m[2][0] === \"`\" && m[3].includes(\"`\")) return null;\n\n  const indent = m[1].length;\n  const fenceStart = line.start + indent;\n  mark(ctx, fenceStart, fenceStart + m[2].length, \"marker\");\n\n  const info = m[3].trim();\n  if (info) {\n    const at = line.text.indexOf(info, indent + m[2].length);\n    mark(ctx, line.start + at, line.start + at + info.length, \"attribute\");\n  }\n  const language = info ? info.split(/\\s+/)[0] : null;\n\n  /* Built rather than written literally: the closing fence must be the SAME\n     character and at least as long, so `~~~` inside a ``` block stays content. */\n  const fenceChar = m[2][0] === \"~\" ? \"~\" : \"\\\\u0060\";\n  const closer = new RegExp(\"^ {0,3}\" + fenceChar + \"{\" + m[2].length + \",}[ \\\\t]*$\");\n  const body: Line[] = [];\n  let j = i + 1;\n  let open = true;\n\n  for (; j < lines.length; j++) {\n    if (closer.test(lines[j].text)) {\n      mark(ctx, lines[j].start, lineEnd(lines[j]), \"marker\");\n      open = false;\n      j++;\n      break;\n    }\n    body.push(lines[j]);\n  }\n\n  if (body.length && ctx.sink) {\n    /* The RAW region is handed to the inner grammar, indentation included: the\n       node's `code` has the fence's indent stripped, but a token list must\n       still cover the source it was cut from. */\n    const from = body[0].start;\n    const to = lineEnd(body[body.length - 1]);\n    ctx.sink.embed(ctx.source.slice(from, to), language, from);\n  }\n\n  /* Emitted here rather than by the caller because the language and the\n     closed-ness are only known now — and a fence has no child frames, so\n     opening it after its own spans breaks no nesting. The body's RAW range is\n     its content: the fence lines around it are syntax, everything between is\n     text the user edits. */\n  frame(ctx, { kind: \"code\", language, fenced: true, open }, line.start);\n  /* The body gets a frame of its own so the code's own decoration stops before\n     the terminator this block is about to claim — see `codeBody` in frames.ts.\n     The outer frame declares nothing, which leaves the fence lines syntax. */\n  if (body.length) {\n    const bodyFrom = body[0].start;\n    const bodyTo = lineEnd(body[body.length - 1]);\n    frame(ctx, { kind: \"codeBody\", language }, bodyFrom, [{ start: bodyFrom, end: bodyTo }]);\n    endFrame(ctx, bodyTo);\n  }\n  endBlock(ctx, lineEnd(lines[j - 1]));\n\n  const code = body.map((l) => stripIndent(l, indent).text).join(\"\\n\");\n  return { node: { kind: \"code\", language, code, open }, next: j };\n}\n\nfunction readIndentedCode(lines: Line[], i: number, ctx: Ctx): { node: MdNode; next: number } {\n  const body: Line[] = [];\n  let j = i;\n  while (j < lines.length && (isBlank(lines[j]) || indentOf(lines[j].text) >= 4)) {\n    body.push(lines[j]);\n    j++;\n  }\n  /* Trailing blank lines belong to the document, not to the code — keeping\n     them would render an indented block with phantom empty lines at the end. */\n  while (body.length && isBlank(body[body.length - 1])) {\n    body.pop();\n    j--;\n  }\n\n  const from = body[0].start;\n  const to = lineEnd(body[body.length - 1]);\n  mark(ctx, from, to, \"string\");\n  /* One range PER LINE, not one spanning the block: every line carries its own\n     four columns of indentation, and a single hull would swallow all of them\n     but the first — projecting real syntax as editable prose. */\n  frame(ctx, { kind: \"code\", language: null, fenced: false, open: false }, from);\n  frame(\n    ctx,\n    { kind: \"codeBody\", language: null },\n    from,\n    body.map((l) => stripIndent(l, 4)).map((l) => ({ start: l.start, end: l.start + l.text.length })),\n  );\n  endFrame(ctx, to);\n  endBlock(ctx, to);\n\n  const code = body.map((l) => stripIndent(l, 4).text).join(\"\\n\");\n  return { node: { kind: \"code\", language: null, code, open: false }, next: j };\n}\n\n/* --- Headings ------------------------------------------------------------- */\n\nfunction readAtx(line: Line, ctx: Ctx, ambient: TokenType): MdNode | null {\n  const m = RE_ATX.exec(line.text);\n  if (!m) return null;\n\n  const level = m[2].length as 1 | 2 | 3 | 4 | 5 | 6;\n  const hashStart = line.start + m[1].length;\n  mark(ctx, hashStart, hashStart + level, \"marker\");\n\n  let from = m[1].length + level;\n  let to = line.text.length;\n\n  /* The closing-hash form: `## Title ##`. The hashes must be preceded by\n     whitespace, or `# C#` would lose its sharp. */\n  const closing = /(^|[ \\t])(#+)[ \\t]*$/.exec(line.text.slice(from));\n  if (closing) {\n    const at = from + closing.index + closing[1].length;\n    mark(ctx, line.start + at, line.start + at + closing[2].length, \"marker\");\n    to = at;\n  }\n\n  while (from < to && /[ \\t]/.test(line.text[from])) from++;\n  /* TRAILING WHITESPACE IS TRIMMED ONLY WHEN IT PRECEDES A CLOSING `##`\n     SEQUENCE — SG-792. An earlier version of this function ALWAYS trimmed\n     trailing whitespace/tabs off `to`, unconditionally, which pulled it out of\n     the inline frame's own content range. That reclassified it as SYNTAX\n     (this frame's own `content` is `[]`; see `project.ts`'s `emitText` —\n     anything not claimed by a child frame's content is markup), which the\n     caret map then treats as a construct's own TRAILING markup\n     (`caret-map.ts`'s \"BLOCK'S TRAILING MARKUP\" rule: stand BEFORE it, the\n     same rule a closing code fence gets). The instant a reviewer pressed\n     Space at the end of a heading line, that space became \"trailing\" and the\n     caret snapped back to stand before it — so the NEXT character typed\n     landed before the space instead of after it. Every following space\n     repeated the trap, which is why a whole line of typed words ran together\n     with every space shoved to the end: confirmed by a real Chromium probe\n     stepping one keystroke at a time (`gpt-manager`'s SG-792 investigation),\n     never by re-deriving the rule.\n     A trailing space with nothing else on the line is harmless in the SOURCE\n     — a spec-compliant renderer ignores it exactly like it ignores one in a\n     paragraph — so there is nothing there that needs hiding, and it is now\n     left as ordinary editable content, exactly like a paragraph's own\n     trailing space already was.\n     The explicit closing-hash form (`## Title ##`) is different: CommonMark\n     really does treat the whitespace between the title and the closing hashes\n     as part of that construct's own markup, `strips the closing-hash form\n     but keeps a sharp that is part of a word` (syntax-markdown.test.tsx)\n     depends on exactly that, and unlike a just-typed trailing space this\n     whitespace sits BETWEEN two things that already both exist — it is never\n     \"maybe more text is coming\" the way end-of-line trailing space is while\n     someone is actively typing. So the trim stays, scoped to that one case. */\n  if (closing) while (to > from && /[ \\t]/.test(line.text[to - 1])) to--;\n\n  const seg = segmentOf({ text: line.text.slice(from, to), start: line.start + from });\n  /* Opened around the inline parse so the inline frame nests inside it, and\n     spanning the WHOLE line so the hashes and the trailing `##` are inside a\n     frame that does not claim them as content — which is what makes them\n     project as collapsible syntax rather than as prose. */\n  frame(ctx, { kind: \"heading\", level }, line.start);\n  const children = inlineFrame(ctx, [{ text: line.text.slice(from, to), start: line.start + from }], seg, ambient === \"text\" ? \"heading\" : ambient);\n  endBlock(ctx, lineEnd(line));\n  return { kind: \"heading\", level, id: headingId(ctx, children), children };\n}\n\nfunction headingId(ctx: Ctx, children: MdInline[]): string {\n  const base = slug(plainText(children)) || \"section\";\n  const seen = ctx.ids.get(base) ?? 0;\n  ctx.ids.set(base, seen + 1);\n  /* Anchors must be unique or every duplicate heading links to the first one —\n     the classic broken table of contents. */\n  return seen === 0 ? base : `${base}-${seen}`;\n}\n\n/* --- Blockquote ----------------------------------------------------------- */\n\nfunction readQuote(lines: Line[], i: number, ctx: Ctx, depth: number): { node: MdNode; next: number } {\n  const body: Line[] = [];\n  let j = i;\n\n  while (j < lines.length) {\n    const line = lines[j];\n    const m = RE_QUOTE.exec(line.text);\n    if (m) {\n      mark(ctx, line.start, line.start + m[0].length, \"quote\");\n      body.push({ text: line.text.slice(m[0].length), start: line.start + m[0].length });\n      j++;\n      continue;\n    }\n    /* Lazy continuation: a bare line under a quoted paragraph stays in the\n       quote. It stops at a blank line or at anything that starts a block,\n       because those end the paragraph it would have continued. */\n    if (isBlank(line) || startsBlock(line.text) || body.length === 0) break;\n    body.push(line);\n    j++;\n  }\n\n  return { node: { kind: \"quote\", children: parseBlocks(body, ctx, depth + 1, \"quote\") }, next: j };\n}\n\n/* --- Lists ---------------------------------------------------------------- */\n\nfunction readList(\n  lines: Line[],\n  i: number,\n  ctx: Ctx,\n  depth: number,\n  ambient: TokenType,\n  /* Opened by the caller, because the items nest inside it — but `tight` is not\n     known until the last item has been read, so the caller hands the record\n     over and this function stamps the answer onto it. The alternative is a\n     look-ahead that re-implements the whole loop just to count blank lines. */\n  frameToFill?: Frame & { kind: \"list\" },\n): { node: MdNode; next: number } {\n  const firstOrdered = RE_ORDERED.exec(lines[i].text);\n  const firstBullet = RE_BULLET.exec(lines[i].text);\n  const ordered = !firstBullet && !!firstOrdered;\n  const delimiter = ordered ? firstOrdered![3] : firstBullet![2];\n  const start = ordered ? Number(firstOrdered![2]) : 1;\n\n  const items: MdListItem[] = [];\n  let loose = false;\n  let j = i;\n\n  while (j < lines.length) {\n    const line = lines[j];\n    const m = ordered ? RE_ORDERED.exec(line.text) : RE_BULLET.exec(line.text);\n    /* A different bullet character or delimiter starts a NEW list — that is\n       how an author separates two adjacent lists with no prose between. */\n    if (!m || (ordered ? m[3] : m[2]) !== delimiter) break;\n\n    const indent = m[1].length;\n    const markerText = ordered ? m[2] + m[3] : m[2];\n    const markerStart = line.start + indent;\n    /* Opened at the line's own start, not at the marker: the item's leading\n       indentation is part of the item in the source, and a projection that left\n       it outside every frame would have nowhere to put those characters. */\n    const itemFrame: Frame & { kind: \"listItem\" } = { kind: \"listItem\", checked: null, marker: markerText };\n    const itemStart = line.start;\n    frame(ctx, itemFrame, itemStart);\n    mark(ctx, markerStart, markerStart + markerText.length, \"marker\");\n\n    const afterMarker = indent + markerText.length;\n    const rest = line.text.slice(afterMarker);\n    const spaces = /^[ \\t]*/.exec(rest)![0].length;\n    /* An empty item, or one whose content is indented far enough to be code,\n       both put the content column one space past the marker. */\n    const contentIndent = afterMarker + (rest.trim() === \"\" || spaces === 0 || spaces > 4 ? 1 : spaces);\n\n    /* The FIRST line is cut by character index, not by stripping whitespace:\n       `- one` begins with the marker, so a whitespace-only strip removes\n       nothing and the item's content is re-parsed as the same list item, one\n       level deeper, until the recursion cap. Continuation lines below DO start\n       with whitespace and are stripped by column. */\n    const body: Line[] = [{ text: line.text.slice(contentIndent), start: line.start + contentIndent }];\n    j++;\n\n    const blanks: Line[] = [];\n    while (j < lines.length) {\n      const next = lines[j];\n      if (isBlank(next)) {\n        blanks.push(next);\n        j++;\n        continue;\n      }\n      if (indentOf(next.text) >= contentIndent) {\n        if (blanks.length) {\n          /* A blank line INSIDE an item makes the whole list loose, which is\n             what turns tight `<li>text</li>` into `<li><p>text</p></li>`. */\n          loose = true;\n          for (const blank of blanks) body.push({ text: \"\", start: blank.start });\n          blanks.length = 0;\n        }\n        body.push(stripIndent(next, contentIndent));\n        j++;\n        continue;\n      }\n      if (blanks.length === 0 && !startsBlock(next.text)) {\n        body.push(next);\n        j++;\n        continue;\n      }\n      break;\n    }\n    if (blanks.length && j < lines.length) {\n      const more = ordered ? RE_ORDERED.exec(lines[j].text) : RE_BULLET.exec(lines[j].text);\n      if (more && (ordered ? more[3] : more[2]) === delimiter) loose = true;\n    }\n\n    let checked: boolean | null = null;\n    const task = RE_TASK.exec(body[0].text);\n    if (task) {\n      checked = task[1] !== \" \";\n      itemFrame.checked = checked;\n      mark(ctx, body[0].start, body[0].start + 3, \"marker\");\n      body[0] = { text: body[0].text.slice(task[0].length), start: body[0].start + task[0].length };\n    }\n\n    items.push({ checked, children: parseBlocks(body, ctx, depth + 1, ambient) });\n    /* The last BODY line, not `lines[j - 1]`: trailing blanks are consumed by\n       the look-ahead above without joining the item, and stretching the frame\n       over them would put document whitespace inside a list item. */\n    const tail = body[body.length - 1];\n    endBlock(ctx, tail.start + tail.text.length);\n  }\n\n  if (frameToFill) frameToFill.tight = !loose;\n  return { node: { kind: \"list\", ordered, start, tight: !loose, items }, next: j };\n}\n\n/* --- Footnote definitions ------------------------------------------------- */\n\nfunction readFootnoteDef(lines: Line[], i: number, ctx: Ctx, depth: number): { next: number } | null {\n  const line = lines[i];\n  const m = RE_FOOTDEF.exec(line.text);\n  if (!m) return null;\n\n  const markerStart = line.start + m[1].length;\n  mark(ctx, markerStart, markerStart + m[2].length, \"marker\");\n\n  const body: Line[] = [{ text: line.text.slice(m[0].length), start: line.start + m[0].length }];\n  let j = i + 1;\n  while (j < lines.length) {\n    const next = lines[j];\n    if (isBlank(next)) {\n      if (j + 1 < lines.length && indentOf(lines[j + 1].text) >= 4) {\n        body.push({ text: \"\", start: next.start });\n        j++;\n        continue;\n      }\n      break;\n    }\n    if (indentOf(next.text) >= 4) {\n      body.push(stripIndent(next, 4));\n      j++;\n      continue;\n    }\n    if (startsBlock(next.text)) break;\n    body.push(next);\n    j++;\n  }\n\n  ctx.footnotes.push({ label: m[3], children: parseBlocks(body, ctx, depth + 1, \"text\") });\n  return { next: j };\n}\n\nfunction markLinkDef(line: Line, def: RegExpExecArray, ctx: Ctx): void {\n  const markerStart = line.start + def[1].length;\n  mark(ctx, markerStart, markerStart + def[2].length, \"marker\");\n  const dest = def.indices?.[4];\n  if (dest) mark(ctx, line.start + dest[0], line.start + dest[1], \"url\");\n  const title = def.indices?.[5];\n  if (title) mark(ctx, line.start + title[0], line.start + title[1], \"string\");\n}\n\n/* --- Tables --------------------------------------------------------------- */\n\nfunction isTableStart(lines: Line[], i: number): boolean {\n  if (i + 1 >= lines.length) return false;\n  const head = lines[i];\n  const rule = lines[i + 1];\n  if (!head.text.includes(\"|\") || !rule.text.includes(\"-\")) return false;\n  if (!RE_DELIM_ROW.test(rule.text)) return false;\n  /* GFM: the delimiter row must describe exactly as many columns as the header\n     has, which is also what stops a paragraph containing a pipe from being\n     mistaken for a table. */\n  return splitRow(head).cells.length === splitRow(rule).cells.length;\n}\n\nfunction splitRow(line: Line): { cells: Piece[]; pipes: Array<{ start: number; end: number }> } {\n  const cells: Piece[] = [];\n  const pipes: Array<{ start: number; end: number }> = [];\n  const text = line.text;\n  let from = 0;\n\n  for (let i = 0; i < text.length; i++) {\n    if (text[i] === \"\\\\\") {\n      i++;\n      continue;\n    }\n    if (text[i] !== \"|\") continue;\n    pipes.push({ start: line.start + i, end: line.start + i + 1 });\n    cells.push(trimPiece({ text: text.slice(from, i), start: line.start + from }));\n    from = i + 1;\n  }\n  cells.push(trimPiece({ text: text.slice(from), start: line.start + from }));\n\n  if (cells.length > 1 && cells[0].text === \"\" && /^[ \\t]*\\|/.test(text)) cells.shift();\n  if (cells.length > 1 && cells[cells.length - 1].text === \"\" && /\\|[ \\t]*$/.test(text)) cells.pop();\n  return { cells, pipes };\n}\n\nfunction trimPiece(piece: Piece): Piece {\n  const lead = /^[ \\t]*/.exec(piece.text)![0].length;\n  const text = piece.text.slice(lead).replace(/[ \\t]+$/, \"\");\n  return { text, start: piece.start + lead };\n}\n\nfunction readTable(lines: Line[], i: number, ctx: Ctx): { node: MdNode; next: number } {\n  /* THE EXTENT IS FOUND FIRST, and that is not a tidiness choice. Every row but\n     the last swallows the newline that ends it — into its own trailing gutter\n     cell, because a `<table>` cannot hold text between its rows any more than a\n     `<tr>` can hold text between its cells. Whether a row is the last one is\n     therefore something the emitter has to know BEFORE it emits, so the scan\n     runs to completion first. */\n  let last = i + 1;\n  while (last + 1 < lines.length) {\n    const line = lines[last + 1];\n    if (isBlank(line) || !line.text.includes(\"|\") || startsBlock(line.text)) break;\n    last++;\n  }\n\n  const ruleRow = splitRow(lines[i + 1]);\n  const align = ruleRow.cells.map(alignOf);\n\n  const headRow = splitRow(lines[i]);\n  for (const pipe of headRow.pipes) mark(ctx, pipe.start, pipe.end, \"punctuation\");\n  const head = readRow(ctx, lines[i], headRow.cells, true, align, terminatorAfter(ctx, lineEnd(lines[i])));\n\n  /* The delimiter row carries no prose at all, so it is one marker span rather\n     than pipes-plus-dashes; nothing in it is ever editable content. It still\n     gets a row AND a cell, because in a projection every source character needs\n     somewhere legal to live, and \"legal\" inside a table means inside a cell. */\n  mark(ctx, lines[i + 1].start, lineEnd(lines[i + 1]), \"marker\");\n  const ruleEnd = i + 1 === last ? lineEnd(lines[i + 1]) : terminatorAfter(ctx, lineEnd(lines[i + 1]));\n  frame(ctx, { kind: \"tableDelimiter\" }, lines[i + 1].start);\n  frame(ctx, { kind: \"tableGutter\" }, lines[i + 1].start);\n  endFrame(ctx, ruleEnd);\n  endFrame(ctx, ruleEnd);\n\n  const rows: MdCell[][] = [];\n  for (let j = i + 2; j <= last; j++) {\n    const line = lines[j];\n    const row = splitRow(line);\n    for (const pipe of row.pipes) mark(ctx, pipe.start, pipe.end, \"punctuation\");\n    const end = j === last ? lineEnd(line) : terminatorAfter(ctx, lineEnd(line));\n    const cells = readRow(ctx, line, row.cells, false, align, end);\n    /* Ragged rows are normalised to the header width: a short row gets empty\n       cells and a long one is truncated, so the DOM table is never jagged. */\n    while (cells.length < head.length) cells.push({ children: [] });\n    rows.push(cells.slice(0, head.length));\n  }\n\n  return { node: { kind: \"table\", head, rows, align }, next: last + 1 };\n}\n\n/** The offset past the line terminator at `end`, or `end` if there is none. */\nfunction terminatorAfter(ctx: Ctx, end: number): number {\n  let at = end;\n  if (ctx.source[at] === \"\\r\") at++;\n  if (ctx.source[at] === \"\\n\") at++;\n  return at;\n}\n\n/**\n * One table row: alternating gutters and cells, so every character is in a cell.\n *\n * A DOM table cannot hold text outside a cell. Text placed directly in a `<tr>`\n * gets an anonymous cell box that the browser will not step a caret into, which\n * the arrow-key torture test caught as Right moving from offset 2 to offset 2 —\n * the pipes and the padding were unreachable. So the pipes get cells of their\n * own, hidden rather than absent.\n *\n * The cell frames stay TRIMMED, which is what keeps the padding out of a cell\n * edit's range: an editor that re-pads cells is the Obsidian 1.5 revolt, and\n * padding that is not inside the cell frame cannot be rewritten by one.\n */\nfunction readRow(\n  ctx: Ctx,\n  line: Line,\n  cells: Piece[],\n  header: boolean,\n  align: (MdAlign | null)[],\n  /* Past the row's own newline for every row but the last, so the character\n     that ends the line lands in a cell rather than loose in the table. */\n  end: number,\n): MdCell[] {\n  frame(ctx, { kind: \"tableRow\", header }, line.start);\n  const out: MdCell[] = [];\n  let at = line.start;\n\n  const gutter = (to: number) => {\n    if (to <= at) return;\n    frame(ctx, { kind: \"tableGutter\" }, at);\n    endFrame(ctx, to);\n    at = to;\n  };\n\n  for (let c = 0; c < cells.length; c++) {\n    const piece = cells[c];\n    gutter(piece.start);\n    out.push(toCell(piece, ctx, header, align[c] ?? null));\n    at = piece.start + piece.text.length;\n  }\n  gutter(end);\n\n  endFrame(ctx, end);\n  return out;\n}\n\nfunction toCell(piece: Piece, ctx: Ctx, header: boolean, align: MdAlign | null): MdCell {\n  /* `trimPiece` already moved `start` past the leading padding, so the frame\n     opens at the trimmed start and the surrounding spaces belong to the ROW.\n     That is deliberate: Obsidian 1.5's revolt was over an editor reflowing cell\n     padding, and padding that is not inside the cell cannot be rewritten by a\n     cell edit. */\n  frame(ctx, { kind: \"tableCell\", header, align }, piece.start);\n  const children = inlineFrame(ctx, [piece], segmentOf(piece), \"text\");\n  endFrame(ctx, piece.start + piece.text.length);\n  return { children };\n}\n\nfunction alignOf(cell: Piece): MdAlign | null {\n  const text = cell.text.trim();\n  const left = text.startsWith(\":\");\n  const right = text.endsWith(\":\");\n  if (left && right) return \"center\";\n  if (right) return \"right\";\n  if (left) return \"left\";\n  return null;\n}\n\n/* --- Paragraphs and setext headings --------------------------------------- */\n\nfunction readParagraph(lines: Line[], i: number, ctx: Ctx, ambient: TokenType): { node: MdNode; next: number } {\n  const pieces: Line[] = [lines[i]];\n  let j = i + 1;\n\n  while (j < lines.length) {\n    const line = lines[j];\n    if (isBlank(line)) break;\n\n    /* Setext is checked BEFORE the thematic-break rule that would otherwise\n       claim `---`: an underline under an open paragraph is a heading, and only\n       the paragraph above it can decide that. */\n    const setext = RE_SETEXT.exec(line.text);\n    if (setext) {\n      mark(ctx, line.start, lineEnd(line), \"marker\");\n      const level = setext[1][0] === \"=\" ? 1 : 2;\n      frame(ctx, { kind: \"heading\", level }, lines[i].start);\n      const children = inlineOf(pieces, ctx, ambient === \"text\" ? \"heading\" : ambient);\n      endBlock(ctx, lineEnd(line));\n      return { node: { kind: \"heading\", level, id: headingId(ctx, children), children }, next: j + 1 };\n    }\n\n    if (startsBlock(line.text) || isTableStart(lines, j)) break;\n    pieces.push(line);\n    j++;\n  }\n\n  /* Opened here, not by `parseBlocks`, because whether this is a paragraph or a\n     setext heading is not decided until the terminating line has been read —\n     and the underline is not one of the pieces, so a frame measured from the\n     content alone would stop one line short of the source it owns. */\n  frame(ctx, { kind: \"paragraph\" }, lines[i].start);\n  const node: MdNode = { kind: \"paragraph\", children: inlineOf(pieces, ctx, ambient) };\n  endBlock(ctx, spanOf(lines, i, j - 1).end);\n  return { node, next: j };\n}\n\nfunction inlineOf(pieces: Line[], ctx: Ctx, ambient: TokenType): MdInline[] {\n  return inlineFrame(ctx, pieces, makeSegments(pieces), ambient);\n}\n"],"names":["MAX_BLOCK_DEPTH","RE_FENCE","RE_ATX","RE_RULE","RE_QUOTE","RE_BULLET","RE_ORDERED","RE_SETEXT","RE_FOOTDEF","RE_LINKDEF","RE_TASK","RE_DELIM_ROW","RE_FRONT","parseMarkdown","source","parseDocument","sink","lines","toLines","ctx","collectRefs","nodes","start","front","readFrontMatter","parseBlocks","slug","text","nl","raw","isBlank","line","indentOf","n","ch","stripIndent","taken","i","mark","end","type","frame","f","content","endFrame","endBlock","at","spanOf","from","to","lineEnd","inlineFrame","pieces","seg","ambient","empty","parseInline","ranges","piece","children","tail","refs","fence","canStart","fenceMatch","def","key","normalizeRef","cleanDest","dest","open","close","language","body","bodyFrom","bodyTo","l","depth","readFence","atx","readAtx","quote","readQuote","footMatch","foot","readFootnoteDef","markLinkDef","isTableStart","table","readTable","first","ordered","listFrame","list","readList","code","readIndentedCode","para","readParagraph","startsBlock","m","indent","fenceStart","info","fenceChar","closer","j","level","hashStart","closing","segmentOf","headingId","base","plainText","seen","frameToFill","firstOrdered","firstBullet","delimiter","items","loose","markerText","markerStart","itemFrame","itemStart","afterMarker","rest","spaces","contentIndent","blanks","next","blank","more","checked","task","title","head","rule","splitRow","cells","pipes","trimPiece","lead","last","align","alignOf","headRow","pipe","readRow","terminatorAfter","ruleEnd","rows","row","header","out","gutter","c","toCell","cell","left","right","setext","inlineOf","node","makeSegments"],"mappings":";;AA+CA,MAAMA,KAAkB,IAKXC,IAAW,+BAClBC,IAAS,gCACTC,KAAU,4EACVC,IAAW,kBACXC,IAAY,+BACZC,IAAa,uCACbC,KAAY,yBACZC,IAAa,uCACbC,KAAa,gFACbC,KAAU,4BACVC,KAAe,mEACfC,KAAW;AAKV,SAASC,GAAcC,GAA0B;AACtD,SAAOC,GAAcD,CAAM;AAC7B;AAMO,SAASC,GAAcD,GAAgBE,GAAuB;AACnE,QAAMC,IAAQC,GAAQJ,CAAM,GACtBK,IAAW,EAAE,QAAAL,GAAQ,MAAAE,GAAM,MAAMI,GAAYH,CAAK,GAAG,WAAW,CAAA,GAAI,KAAK,oBAAI,MAAI,GAEjFI,IAAkB,CAAA;AACxB,MAAIC,IAAQ;AAEZ,QAAMC,IAAQC,GAAgBP,GAAOE,CAAG;AACxC,SAAII,MACFF,EAAM,KAAKE,EAAM,IAAI,GACrBD,IAAQC,EAAM,OAGhBF,EAAM,KAAK,GAAGI,EAAYR,EAAM,MAAMK,CAAK,GAAGH,GAAK,GAAG,MAAM,CAAC,GAKzDA,EAAI,UAAU,UAAQE,EAAM,KAAK,EAAE,MAAM,aAAa,OAAOF,EAAI,UAAA,CAAW,GAEzEE;AACT;AAGO,SAASK,GAAKC,GAAsB;AACzC,SAAOA,EACJ,cACA,QAAQ,oBAAoB,GAAG,EAC/B,QAAQ,YAAY,EAAE;AAC3B;AAIA,SAAST,GAAQJ,GAAwB;AACvC,QAAMG,IAAgB,CAAA;AACtB,MAAIK,IAAQ;AACZ,aAAS;AACP,UAAMM,IAAKd,EAAO,QAAQ;AAAA,GAAMQ,CAAK,GAC/BO,IAAMD,IAAK,IAAId,EAAO,MAAMQ,CAAK,IAAIR,EAAO,MAAMQ,GAAOM,CAAE;AAKjE,QADAX,EAAM,KAAK,EAAE,MAAMY,EAAI,SAAS,IAAI,IAAIA,EAAI,MAAM,GAAG,EAAE,IAAIA,GAAK,OAAAP,GAAO,GACnEM,IAAK,EAAG;AACZ,IAAAN,IAAQM,IAAK;AAAA,EACf;AACA,SAAOX;AACT;AAEA,SAASa,EAAQC,GAAqB;AACpC,SAAOA,EAAK,KAAK,KAAA,MAAW;AAC9B;AAEA,SAASC,EAASL,GAAsB;AACtC,MAAIM,IAAI;AACR,aAAWC,KAAMP;AACf,QAAIO,MAAO,IAAK,CAAAD,KAAK;AAAA,aACZC,MAAO,IAAM,CAAAD,KAAK;AAAA,QACtB;AAEP,SAAOA;AACT;AAGA,SAASE,EAAYJ,GAAYE,GAAiB;AAChD,MAAIG,IAAQ,GACRC,IAAI;AACR,SAAOA,IAAIN,EAAK,KAAK,UAAUK,IAAQH,KAAG;AACxC,UAAMC,IAAKH,EAAK,KAAKM,CAAC;AACtB,QAAIH,MAAO,IAAK,CAAAE,KAAS;AAAA,aAChBF,MAAO,IAAM,CAAAE,KAAS;AAAA,QAC1B;AACL,IAAAC;AAAA,EACF;AACA,SAAO,EAAE,MAAMN,EAAK,KAAK,MAAMM,CAAC,GAAG,OAAON,EAAK,QAAQM,EAAA;AACzD;AAEA,SAASC,EAAKnB,GAAUG,GAAeiB,GAAaC,GAAuB;AACzE,EAAIrB,EAAI,QAAQoB,IAAMjB,OAAW,KAAK,KAAKA,GAAOiB,GAAKC,CAAI;AAC7D;AAYA,SAASC,EAAMtB,GAAUuB,GAAUpB,GAAeqB,GAAkC;AAClF,EAAAxB,EAAI,MAAM,KAAKuB,GAAGpB,GAAOqB,CAAO;AAClC;AAEA,SAASC,EAASzB,GAAUoB,GAAmB;AAC7C,EAAApB,EAAI,MAAM,MAAMoB,CAAG;AACrB;AAiBA,SAASM,EAAS1B,GAAUoB,GAAmB;AAC7C,MAAI,CAACpB,EAAI,KAAM;AACf,MAAI2B,IAAKP;AAGT,EAAIpB,EAAI,OAAO2B,CAAE,MAAM,QAAMA,KACzB3B,EAAI,OAAO2B,CAAE,MAAM;AAAA,KAAMA,KAC7B3B,EAAI,KAAK,MAAM2B,GAAIA,IAAKP,IAAM,CAAC,EAAE,OAAOA,GAAK,KAAKO,EAAA,CAAI,IAAI,MAAS;AACrE;AAGA,SAASC,GAAO9B,GAAe+B,GAAcC,GAA4C;AACvF,SAAO,EAAE,OAAOhC,EAAM+B,CAAI,EAAE,OAAO,KAAKE,EAAQjC,EAAMgC,CAAE,CAAC,EAAA;AAC3D;AAgBA,SAASE,EAAYhC,GAAUiC,GAAgBC,GAAeC,GAAgC;AAkB5F,QAAMC,IAAQH,EAAO,SAAS,KAAKA,EAAOA,EAAO,SAAS,CAAC,EAAE,QAAQA,EAAOA,EAAO,SAAS,CAAC,EAAE,KAAK,WAAWA,EAAO,CAAC,EAAE;AACzH,MAAI,CAACjC,EAAI,QAAQ,CAACiC,EAAO,UAAUG,EAAO,QAAOC,EAAYH,GAAKlC,EAAI,MAAMA,EAAI,MAAMmC,CAAO;AAE7F,QAAMG,IAAkB,CAAA;AACxB,WAASpB,IAAI,GAAGA,IAAIe,EAAO,QAAQf,KAAK;AACtC,UAAMqB,IAAQN,EAAOf,CAAC,GAChBE,IAAMmB,EAAM,QAAQA,EAAM,KAAK;AAErC,QADAD,EAAO,KAAK,EAAE,OAAOC,EAAM,OAAO,KAAAnB,GAAK,GACnCF,MAAMe,EAAO,SAAS,EAAG;AAG7B,QAAIN,IAAKP;AACT,IAAIpB,EAAI,OAAO2B,CAAE,MAAM,QAAMA,KACzB3B,EAAI,OAAO2B,CAAE,MAAM;AAAA,KAAMA,KACzBA,IAAKP,KAAKkB,EAAO,KAAK,EAAE,OAAOlB,GAAK,KAAKO,GAAI;AAAA,EACnD;AAEA,EAAAL,EAAMtB,GAAK,EAAE,MAAM,SAAA,GAAYiC,EAAO,CAAC,EAAE,OAAOK,CAAM;AACtD,QAAME,IAAWH,EAAYH,GAAKlC,EAAI,MAAMA,EAAI,MAAMmC,CAAO,GACvDM,IAAOR,EAAOA,EAAO,SAAS,CAAC;AACrC,SAAAR,EAASzB,GAAKyC,EAAK,QAAQA,EAAK,KAAK,MAAM,GACpCD;AACT;AAEA,SAAST,EAAQnB,GAAoB;AACnC,SAAOA,EAAK,QAAQA,EAAK,KAAK;AAChC;AAUA,SAASX,GAAYH,GAAqC;AACxD,QAAM4C,wBAAW,IAAA;AACjB,MAAIC,IAAuB,MACvBC,IAAW;AAEf,aAAWhC,KAAQd,GAAO;AACxB,UAAM+C,IAAa/D,EAAS,KAAK8B,EAAK,IAAI;AAC1C,QAAI+B,GAAO;AACT,MAAIE,KAAcA,EAAW,CAAC,EAAE,CAAC,MAAMF,EAAM,CAAC,KAAKE,EAAW,CAAC,EAAE,UAAUF,EAAM,WAAQA,IAAQ;AACjG;AAAA,IACF;AACA,QAAIE,GAAY;AACd,MAAAF,IAAQE,EAAW,CAAC;AACpB;AAAA,IACF;AAEA,UAAMC,IAAMF,IAAWtD,GAAW,KAAKsB,EAAK,IAAI,IAAI;AACpD,QAAIkC,GAAK;AACP,YAAMC,IAAMC,GAAaF,EAAI,CAAC,CAAC;AAC/B,MAAKJ,EAAK,IAAIK,CAAG,KAAGL,EAAK,IAAIK,GAAK,EAAE,MAAME,GAAUH,EAAI,CAAC,CAAC,GAAG,OAAOA,EAAI,CAAC,IAAIA,EAAI,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,OAAA,CAAW,GAC9GF,IAAW;AACX;AAAA,IACF;AACA,IAAAA,IAAWjC,EAAQC,CAAI;AAAA,EACzB;AAEA,SAAO8B;AACT;AAEA,SAASO,GAAUC,GAAsB;AAEvC,UADcA,EAAK,WAAW,GAAG,KAAKA,EAAK,SAAS,GAAG,IAAIA,EAAK,MAAM,GAAG,EAAE,IAAIA,GAClE,QAAQ,uBAAuB,IAAI;AAClD;AAIA,SAAS7C,GAAgBP,GAAeE,GAAiD;AACvF,MAAI,CAACF,EAAM,OAAQ,QAAO;AAC1B,QAAMqD,IAAO1D,GAAS,KAAKK,EAAM,CAAC,EAAE,IAAI;AACxC,MAAI,CAACqD,EAAM,QAAO;AAElB,MAAIC,IAAQ;AACZ,WAASlC,IAAI,GAAGA,IAAIpB,EAAM,QAAQoB;AAChC,QAAIpB,EAAMoB,CAAC,EAAE,KAAK,cAAciC,EAAK,CAAC,GAAG;AACvC,MAAAC,IAAQlC;AACR;AAAA,IACF;AAKF,MAAIkC,IAAQ,EAAG,QAAO;AAEtB,QAAMC,IAAWF,EAAK,CAAC,MAAM,QAAQ,SAAS,QACxCG,IAAOxD,EAAM,MAAM,GAAGsD,CAAK;AAIjC,MAHAjC,EAAKnB,GAAKF,EAAM,CAAC,EAAE,OAAOiC,EAAQjC,EAAM,CAAC,CAAC,GAAG,QAAQ,GACrDqB,EAAKnB,GAAKF,EAAMsD,CAAK,EAAE,OAAOrB,EAAQjC,EAAMsD,CAAK,CAAC,GAAG,QAAQ,GAEzDE,EAAK,UAAUtD,EAAI,MAAM;AAC3B,UAAM6B,IAAOyB,EAAK,CAAC,EAAE,OACfxB,IAAKC,EAAQuB,EAAKA,EAAK,SAAS,CAAC,CAAC;AACxC,IAAAtD,EAAI,KAAK,MAAMA,EAAI,OAAO,MAAM6B,GAAMC,CAAE,GAAGuB,GAAUxB,CAAI;AAAA,EAC3D;AAGA,MADAP,EAAMtB,GAAK,EAAE,MAAM,eAAe,UAAAqD,KAAYvD,EAAM,CAAC,EAAE,KAAK,GACxDwD,EAAK,QAAQ;AACf,UAAMC,IAAWD,EAAK,CAAC,EAAE,OACnBE,IAASzB,EAAQuB,EAAKA,EAAK,SAAS,CAAC,CAAC;AAC5C,IAAAhC,EAAMtB,GAAK,EAAE,MAAM,YAAY,UAAAqD,KAAYE,GAAU,CAAC,EAAE,OAAOA,GAAU,KAAKC,EAAA,CAAQ,CAAC,GACvF/B,EAASzB,GAAKwD,CAAM;AAAA,EACtB;AACA,SAAA9B,EAAS1B,GAAK+B,EAAQjC,EAAMsD,CAAK,CAAC,CAAC,GAE5B,EAAE,MAAM,EAAE,MAAM,eAAe,UAAAC,GAAU,MAAMC,EAAK,IAAI,CAACG,MAAMA,EAAE,IAAI,EAAE,KAAK;AAAA,CAAI,KAAK,MAAML,IAAQ,EAAA;AAC5G;AAIA,SAAS9C,EAAYR,GAAeE,GAAU0D,GAAevB,GAA8B;AACzF,QAAMjC,IAAkB,CAAA;AACxB,MAAIwD,IAAQ7E,GAAiB,QAAOqB;AACpC,MAAIgB,IAAI;AAER,SAAOA,IAAIpB,EAAM,UAAQ;AACvB,UAAMc,IAAOd,EAAMoB,CAAC;AAEpB,QAAIP,EAAQC,CAAI,GAAG;AACjB,MAAAM;AACA;AAAA,IACF;AASA,UAAMyB,IAAQgB,GAAU7D,GAAOoB,GAAGlB,CAAG;AACrC,QAAI2C,GAAO;AACT,MAAAzC,EAAM,KAAKyC,EAAM,IAAI,GACrBzB,IAAIyB,EAAM;AACV;AAAA,IACF;AAEA,UAAMiB,IAAMC,GAAQjD,GAAMZ,GAAKmC,CAAO;AACtC,QAAIyB,GAAK;AACP,MAAA1D,EAAM,KAAK0D,CAAG,GACd1C;AACA;AAAA,IACF;AAEA,QAAIlC,GAAQ,KAAK4B,EAAK,IAAI,GAAG;AAC3B,MAAAU,EAAMtB,GAAK,EAAE,MAAM,OAAA,GAAUY,EAAK,KAAK,GACvCO,EAAKnB,GAAKY,EAAK,OAAOmB,EAAQnB,CAAI,GAAG,QAAQ,GAC7CV,EAAM,KAAK,EAAE,MAAM,OAAA,CAAQ,GAC3BwB,EAAS1B,GAAK+B,EAAQnB,CAAI,CAAC,GAC3BM;AACA;AAAA,IACF;AAEA,QAAIjC,EAAS,KAAK2B,EAAK,IAAI,GAAG;AAC5B,MAAAU,EAAMtB,GAAK,EAAE,MAAM,QAAA,GAAWY,EAAK,KAAK;AACxC,YAAMkD,IAAQC,GAAUjE,GAAOoB,GAAGlB,GAAK0D,CAAK;AAC5C,MAAAxD,EAAM,KAAK4D,EAAM,IAAI,GACrBpC,EAAS1B,GAAK+B,EAAQjC,EAAMgE,EAAM,OAAO,CAAC,CAAC,CAAC,GAC5C5C,IAAI4C,EAAM;AACV;AAAA,IACF;AAEA,UAAME,IAAY3E,EAAW,KAAKuB,EAAK,IAAI;AAC3C,QAAIoD,GAAW;AACb,MAAA1C,EAAMtB,GAAK,EAAE,MAAM,eAAe,OAAOgE,EAAU,CAAC,EAAA,GAAKpD,EAAK,KAAK;AACnE,YAAMqD,IAAOC,GAAgBpE,GAAOoB,GAAGlB,GAAK0D,CAAK;AACjD,MAAAhC,EAAS1B,GAAK+B,EAAQjC,EAAMmE,EAAK,OAAO,CAAC,CAAC,CAAC,GAC3C/C,IAAI+C,EAAK;AACT;AAAA,IACF;AAEA,UAAMnB,IAAMxD,GAAW,KAAKsB,EAAK,IAAI;AACrC,QAAIkC,GAAK;AACP,MAAAxB,EAAMtB,GAAK,EAAE,MAAM,UAAA,GAAaY,EAAK,KAAK,GAC1CuD,GAAYvD,GAAMkC,GAAK9C,CAAG,GAC1B0B,EAAS1B,GAAK+B,EAAQnB,CAAI,CAAC,GAC3BM;AACA;AAAA,IACF;AAEA,QAAIkD,GAAatE,GAAOoB,CAAC,GAAG;AAC1B,MAAAI,EAAMtB,GAAK,EAAE,MAAM,QAAA,GAAWY,EAAK,KAAK;AACxC,YAAMyD,IAAQC,GAAUxE,GAAOoB,GAAGlB,CAAG;AACrC,MAAAE,EAAM,KAAKmE,EAAM,IAAI,GAMrB5C,EAASzB,GAAK+B,EAAQjC,EAAMuE,EAAM,OAAO,CAAC,CAAC,CAAC,GAC5CnD,IAAImD,EAAM;AACV;AAAA,IACF;AAEA,QAAInF,EAAU,KAAK0B,EAAK,IAAI,KAAKzB,EAAW,KAAKyB,EAAK,IAAI,GAAG;AAC3D,YAAM2D,IAAQpF,EAAW,KAAKyB,EAAK,IAAI,GAEjC4D,IAAU,CADDtF,EAAU,KAAK0B,EAAK,IAAI,KACZ,CAAC,CAAC2D,GAIvBE,IAAmB,EAAE,MAAM,QAAQ,SAAAD,GAAS,OAAOA,IAAU,OAAOD,EAAO,CAAC,CAAC,IAAI,GAAG,OAAO,GAAA;AACjG,MAAAjD,EAAMtB,GAAKyE,GAAW7D,EAAK,KAAK;AAChC,YAAM8D,IAAOC,GAAS7E,GAAOoB,GAAGlB,GAAK0D,GAAOvB,GAASsC,CAAS;AAC9D,MAAAvE,EAAM,KAAKwE,EAAK,IAAI,GACpBhD,EAAS1B,GAAK+B,EAAQjC,EAAM4E,EAAK,OAAO,CAAC,CAAC,CAAC,GAC3CxD,IAAIwD,EAAK;AACT;AAAA,IACF;AAEA,QAAI7D,EAASD,EAAK,IAAI,KAAK,GAAG;AAC5B,YAAMgE,IAAOC,GAAiB/E,GAAOoB,GAAGlB,CAAG;AAC3C,MAAAE,EAAM,KAAK0E,EAAK,IAAI,GACpB1D,IAAI0D,EAAK;AACT;AAAA,IACF;AAIA,UAAME,IAAOC,GAAcjF,GAAOoB,GAAGlB,GAAKmC,CAAO;AACjD,IAAAjC,EAAM,KAAK4E,EAAK,IAAI,GACpB5D,IAAI4D,EAAK;AAAA,EACX;AAEA,SAAO5E;AACT;AAGA,SAAS8E,EAAYxE,GAAuB;AAC1C,SACE1B,EAAS,KAAK0B,CAAI,KAClBzB,EAAO,KAAKyB,CAAI,KAChBxB,GAAQ,KAAKwB,CAAI,KACjBvB,EAAS,KAAKuB,CAAI,KAClBtB,EAAU,KAAKsB,CAAI,KACnBrB,EAAW,KAAKqB,CAAI,KACpBnB,EAAW,KAAKmB,CAAI;AAExB;AAIA,SAASmD,GAAU7D,GAAeoB,GAAWlB,GAAiD;AAC5F,QAAMY,IAAOd,EAAMoB,CAAC,GACd+D,IAAInG,EAAS,KAAK8B,EAAK,IAAI;AAIjC,MAHI,CAACqE,KAGDA,EAAE,CAAC,EAAE,CAAC,MAAM,OAAOA,EAAE,CAAC,EAAE,SAAS,GAAG,EAAG,QAAO;AAElD,QAAMC,IAASD,EAAE,CAAC,EAAE,QACdE,IAAavE,EAAK,QAAQsE;AAChC,EAAA/D,EAAKnB,GAAKmF,GAAYA,IAAaF,EAAE,CAAC,EAAE,QAAQ,QAAQ;AAExD,QAAMG,IAAOH,EAAE,CAAC,EAAE,KAAA;AAClB,MAAIG,GAAM;AACR,UAAMzD,IAAKf,EAAK,KAAK,QAAQwE,GAAMF,IAASD,EAAE,CAAC,EAAE,MAAM;AACvD,IAAA9D,EAAKnB,GAAKY,EAAK,QAAQe,GAAIf,EAAK,QAAQe,IAAKyD,EAAK,QAAQ,WAAW;AAAA,EACvE;AACA,QAAM/B,IAAW+B,IAAOA,EAAK,MAAM,KAAK,EAAE,CAAC,IAAI,MAIzCC,IAAYJ,EAAE,CAAC,EAAE,CAAC,MAAM,MAAM,MAAM,WACpCK,IAAS,IAAI,OAAO,YAAYD,IAAY,MAAMJ,EAAE,CAAC,EAAE,SAAS,YAAY,GAC5E3B,IAAe,CAAA;AACrB,MAAIiC,IAAIrE,IAAI,GACRiC,IAAO;AAEX,SAAOoC,IAAIzF,EAAM,QAAQyF,KAAK;AAC5B,QAAID,EAAO,KAAKxF,EAAMyF,CAAC,EAAE,IAAI,GAAG;AAC9B,MAAApE,EAAKnB,GAAKF,EAAMyF,CAAC,EAAE,OAAOxD,EAAQjC,EAAMyF,CAAC,CAAC,GAAG,QAAQ,GACrDpC,IAAO,IACPoC;AACA;AAAA,IACF;AACA,IAAAjC,EAAK,KAAKxD,EAAMyF,CAAC,CAAC;AAAA,EACpB;AAEA,MAAIjC,EAAK,UAAUtD,EAAI,MAAM;AAI3B,UAAM6B,IAAOyB,EAAK,CAAC,EAAE,OACfxB,IAAKC,EAAQuB,EAAKA,EAAK,SAAS,CAAC,CAAC;AACxC,IAAAtD,EAAI,KAAK,MAAMA,EAAI,OAAO,MAAM6B,GAAMC,CAAE,GAAGuB,GAAUxB,CAAI;AAAA,EAC3D;AAWA,MAJAP,EAAMtB,GAAK,EAAE,MAAM,QAAQ,UAAAqD,GAAU,QAAQ,IAAM,MAAAF,KAAQvC,EAAK,KAAK,GAIjE0C,EAAK,QAAQ;AACf,UAAMC,IAAWD,EAAK,CAAC,EAAE,OACnBE,IAASzB,EAAQuB,EAAKA,EAAK,SAAS,CAAC,CAAC;AAC5C,IAAAhC,EAAMtB,GAAK,EAAE,MAAM,YAAY,UAAAqD,KAAYE,GAAU,CAAC,EAAE,OAAOA,GAAU,KAAKC,EAAA,CAAQ,CAAC,GACvF/B,EAASzB,GAAKwD,CAAM;AAAA,EACtB;AACA,EAAA9B,EAAS1B,GAAK+B,EAAQjC,EAAMyF,IAAI,CAAC,CAAC,CAAC;AAEnC,QAAMX,IAAOtB,EAAK,IAAI,CAACG,MAAMzC,EAAYyC,GAAGyB,CAAM,EAAE,IAAI,EAAE,KAAK;AAAA,CAAI;AACnE,SAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,UAAA7B,GAAU,MAAAuB,GAAM,MAAAzB,EAAA,GAAQ,MAAMoC,EAAA;AAC/D;AAEA,SAASV,GAAiB/E,GAAeoB,GAAWlB,GAA0C;AAC5F,QAAMsD,IAAe,CAAA;AACrB,MAAIiC,IAAIrE;AACR,SAAOqE,IAAIzF,EAAM,WAAWa,EAAQb,EAAMyF,CAAC,CAAC,KAAK1E,EAASf,EAAMyF,CAAC,EAAE,IAAI,KAAK;AAC1E,IAAAjC,EAAK,KAAKxD,EAAMyF,CAAC,CAAC,GAClBA;AAIF,SAAOjC,EAAK,UAAU3C,EAAQ2C,EAAKA,EAAK,SAAS,CAAC,CAAC;AACjD,IAAAA,EAAK,IAAA,GACLiC;AAGF,QAAM1D,IAAOyB,EAAK,CAAC,EAAE,OACfxB,IAAKC,EAAQuB,EAAKA,EAAK,SAAS,CAAC,CAAC;AACxC,SAAAnC,EAAKnB,GAAK6B,GAAMC,GAAI,QAAQ,GAI5BR,EAAMtB,GAAK,EAAE,MAAM,QAAQ,UAAU,MAAM,QAAQ,IAAO,MAAM,GAAA,GAAS6B,CAAI,GAC7EP;AAAA,IACEtB;AAAA,IACA,EAAE,MAAM,YAAY,UAAU,KAAA;AAAA,IAC9B6B;AAAA,IACAyB,EAAK,IAAI,CAACG,MAAMzC,EAAYyC,GAAG,CAAC,CAAC,EAAE,IAAI,CAACA,OAAO,EAAE,OAAOA,EAAE,OAAO,KAAKA,EAAE,QAAQA,EAAE,KAAK,SAAS;AAAA,EAAA,GAElGhC,EAASzB,GAAK8B,CAAE,GAChBJ,EAAS1B,GAAK8B,CAAE,GAGT,EAAE,MAAM,EAAE,MAAM,QAAQ,UAAU,MAAM,MADlCwB,EAAK,IAAI,CAACG,MAAMzC,EAAYyC,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK;AAAA,CAAI,GACT,MAAM,MAAS,MAAM8B,EAAA;AAC5E;AAIA,SAAS1B,GAAQjD,GAAYZ,GAAUmC,GAAmC;AACxE,QAAM8C,IAAIlG,EAAO,KAAK6B,EAAK,IAAI;AAC/B,MAAI,CAACqE,EAAG,QAAO;AAEf,QAAMO,IAAQP,EAAE,CAAC,EAAE,QACbQ,IAAY7E,EAAK,QAAQqE,EAAE,CAAC,EAAE;AACpC,EAAA9D,EAAKnB,GAAKyF,GAAWA,IAAYD,GAAO,QAAQ;AAEhD,MAAI3D,IAAOoD,EAAE,CAAC,EAAE,SAASO,GACrB1D,IAAKlB,EAAK,KAAK;AAInB,QAAM8E,IAAU,uBAAuB,KAAK9E,EAAK,KAAK,MAAMiB,CAAI,CAAC;AACjE,MAAI6D,GAAS;AACX,UAAM/D,IAAKE,IAAO6D,EAAQ,QAAQA,EAAQ,CAAC,EAAE;AAC7C,IAAAvE,EAAKnB,GAAKY,EAAK,QAAQe,GAAIf,EAAK,QAAQe,IAAK+D,EAAQ,CAAC,EAAE,QAAQ,QAAQ,GACxE5D,IAAKH;AAAA,EACP;AAEA,SAAOE,IAAOC,KAAM,QAAQ,KAAKlB,EAAK,KAAKiB,CAAI,CAAC,IAAG,CAAAA;AA8BnD,MAAI6D,EAAS,QAAO5D,IAAKD,KAAQ,QAAQ,KAAKjB,EAAK,KAAKkB,IAAK,CAAC,CAAC,IAAG,CAAAA;AAElE,QAAMI,IAAMyD,EAAU,EAAE,MAAM/E,EAAK,KAAK,MAAMiB,GAAMC,CAAE,GAAG,OAAOlB,EAAK,QAAQiB,GAAM;AAKnF,EAAAP,EAAMtB,GAAK,EAAE,MAAM,WAAW,OAAAwF,EAAA,GAAS5E,EAAK,KAAK;AACjD,QAAM4B,IAAWR,EAAYhC,GAAK,CAAC,EAAE,MAAMY,EAAK,KAAK,MAAMiB,GAAMC,CAAE,GAAG,OAAOlB,EAAK,QAAQiB,EAAA,CAAM,GAAGK,GAAKC,MAAY,SAAS,YAAYA,CAAO;AAChJ,SAAAT,EAAS1B,GAAK+B,EAAQnB,CAAI,CAAC,GACpB,EAAE,MAAM,WAAW,OAAA4E,GAAO,IAAII,GAAU5F,GAAKwC,CAAQ,GAAG,UAAAA,EAAA;AACjE;AAEA,SAASoD,GAAU5F,GAAUwC,GAA8B;AACzD,QAAMqD,IAAOtF,GAAKuF,GAAUtD,CAAQ,CAAC,KAAK,WACpCuD,IAAO/F,EAAI,IAAI,IAAI6F,CAAI,KAAK;AAClC,SAAA7F,EAAI,IAAI,IAAI6F,GAAME,IAAO,CAAC,GAGnBA,MAAS,IAAIF,IAAO,GAAGA,CAAI,IAAIE,CAAI;AAC5C;AAIA,SAAShC,GAAUjE,GAAeoB,GAAWlB,GAAU0D,GAA+C;AACpG,QAAMJ,IAAe,CAAA;AACrB,MAAIiC,IAAIrE;AAER,SAAOqE,IAAIzF,EAAM,UAAQ;AACvB,UAAMc,IAAOd,EAAMyF,CAAC,GACdN,IAAIhG,EAAS,KAAK2B,EAAK,IAAI;AACjC,QAAIqE,GAAG;AACL,MAAA9D,EAAKnB,GAAKY,EAAK,OAAOA,EAAK,QAAQqE,EAAE,CAAC,EAAE,QAAQ,OAAO,GACvD3B,EAAK,KAAK,EAAE,MAAM1C,EAAK,KAAK,MAAMqE,EAAE,CAAC,EAAE,MAAM,GAAG,OAAOrE,EAAK,QAAQqE,EAAE,CAAC,EAAE,QAAQ,GACjFM;AACA;AAAA,IACF;AAIA,QAAI5E,EAAQC,CAAI,KAAKoE,EAAYpE,EAAK,IAAI,KAAK0C,EAAK,WAAW,EAAG;AAClE,IAAAA,EAAK,KAAK1C,CAAI,GACd2E;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,EAAE,MAAM,SAAS,UAAUjF,EAAYgD,GAAMtD,GAAK0D,IAAQ,GAAG,OAAO,EAAA,GAAK,MAAM6B,EAAA;AAChG;AAIA,SAASZ,GACP7E,GACAoB,GACAlB,GACA0D,GACAvB,GAKA6D,GACgC;AAChC,QAAMC,IAAe9G,EAAW,KAAKW,EAAMoB,CAAC,EAAE,IAAI,GAC5CgF,IAAchH,EAAU,KAAKY,EAAMoB,CAAC,EAAE,IAAI,GAC1CsD,IAAU,CAAC0B,KAAe,CAAC,CAACD,GAC5BE,IAAY3B,IAAUyB,EAAc,CAAC,IAAIC,EAAa,CAAC,GACvD/F,IAAQqE,IAAU,OAAOyB,EAAc,CAAC,CAAC,IAAI,GAE7CG,IAAsB,CAAA;AAC5B,MAAIC,IAAQ,IACRd,IAAIrE;AAER,SAAOqE,IAAIzF,EAAM,UAAQ;AACvB,UAAMc,IAAOd,EAAMyF,CAAC,GACdN,IAAIT,IAAUrF,EAAW,KAAKyB,EAAK,IAAI,IAAI1B,EAAU,KAAK0B,EAAK,IAAI;AAGzE,QAAI,CAACqE,MAAMT,IAAUS,EAAE,CAAC,IAAIA,EAAE,CAAC,OAAOkB,EAAW;AAEjD,UAAMjB,IAASD,EAAE,CAAC,EAAE,QACdqB,IAAa9B,IAAUS,EAAE,CAAC,IAAIA,EAAE,CAAC,IAAIA,EAAE,CAAC,GACxCsB,IAAc3F,EAAK,QAAQsE,GAI3BsB,IAA0C,EAAE,MAAM,YAAY,SAAS,MAAM,QAAQF,EAAA,GACrFG,KAAY7F,EAAK;AACvB,IAAAU,EAAMtB,GAAKwG,GAAWC,EAAS,GAC/BtF,EAAKnB,GAAKuG,GAAaA,IAAcD,EAAW,QAAQ,QAAQ;AAEhE,UAAMI,IAAcxB,IAASoB,EAAW,QAClCK,IAAO/F,EAAK,KAAK,MAAM8F,CAAW,GAClCE,IAAS,UAAU,KAAKD,CAAI,EAAG,CAAC,EAAE,QAGlCE,IAAgBH,KAAeC,EAAK,KAAA,MAAW,MAAMC,MAAW,KAAKA,IAAS,IAAI,IAAIA,IAOtFtD,IAAe,CAAC,EAAE,MAAM1C,EAAK,KAAK,MAAMiG,CAAa,GAAG,OAAOjG,EAAK,QAAQiG,GAAe;AACjG,IAAAtB;AAEA,UAAMuB,IAAiB,CAAA;AACvB,WAAOvB,IAAIzF,EAAM,UAAQ;AACvB,YAAMiH,IAAOjH,EAAMyF,CAAC;AACpB,UAAI5E,EAAQoG,CAAI,GAAG;AACjB,QAAAD,EAAO,KAAKC,CAAI,GAChBxB;AACA;AAAA,MACF;AACA,UAAI1E,EAASkG,EAAK,IAAI,KAAKF,GAAe;AACxC,YAAIC,EAAO,QAAQ;AAGjB,UAAAT,IAAQ;AACR,qBAAWW,MAASF,EAAQ,CAAAxD,EAAK,KAAK,EAAE,MAAM,IAAI,OAAO0D,GAAM,MAAA,CAAO;AACtE,UAAAF,EAAO,SAAS;AAAA,QAClB;AACA,QAAAxD,EAAK,KAAKtC,EAAY+F,GAAMF,CAAa,CAAC,GAC1CtB;AACA;AAAA,MACF;AACA,UAAIuB,EAAO,WAAW,KAAK,CAAC9B,EAAY+B,EAAK,IAAI,GAAG;AAClD,QAAAzD,EAAK,KAAKyD,CAAI,GACdxB;AACA;AAAA,MACF;AACA;AAAA,IACF;AACA,QAAIuB,EAAO,UAAUvB,IAAIzF,EAAM,QAAQ;AACrC,YAAMmH,IAAOzC,IAAUrF,EAAW,KAAKW,EAAMyF,CAAC,EAAE,IAAI,IAAIrG,EAAU,KAAKY,EAAMyF,CAAC,EAAE,IAAI;AACpF,MAAI0B,MAASzC,IAAUyC,EAAK,CAAC,IAAIA,EAAK,CAAC,OAAOd,MAAWE,IAAQ;AAAA,IACnE;AAEA,QAAIa,IAA0B;AAC9B,UAAMC,IAAO5H,GAAQ,KAAK+D,EAAK,CAAC,EAAE,IAAI;AACtC,IAAI6D,MACFD,IAAUC,EAAK,CAAC,MAAM,KACtBX,EAAU,UAAUU,GACpB/F,EAAKnB,GAAKsD,EAAK,CAAC,EAAE,OAAOA,EAAK,CAAC,EAAE,QAAQ,GAAG,QAAQ,GACpDA,EAAK,CAAC,IAAI,EAAE,MAAMA,EAAK,CAAC,EAAE,KAAK,MAAM6D,EAAK,CAAC,EAAE,MAAM,GAAG,OAAO7D,EAAK,CAAC,EAAE,QAAQ6D,EAAK,CAAC,EAAE,OAAA,IAGvFf,EAAM,KAAK,EAAE,SAAAc,GAAS,UAAU5G,EAAYgD,GAAMtD,GAAK0D,IAAQ,GAAGvB,CAAO,EAAA,CAAG;AAI5E,UAAMM,IAAOa,EAAKA,EAAK,SAAS,CAAC;AACjC,IAAA5B,EAAS1B,GAAKyC,EAAK,QAAQA,EAAK,KAAK,MAAM;AAAA,EAC7C;AAEA,SAAIuD,MAAaA,EAAY,QAAQ,CAACK,IAC/B,EAAE,MAAM,EAAE,MAAM,QAAQ,SAAA7B,GAAS,OAAArE,GAAO,OAAO,CAACkG,GAAO,OAAAD,KAAS,MAAMb,EAAA;AAC/E;AAIA,SAASrB,GAAgBpE,GAAeoB,GAAWlB,GAAU0D,GAAwC;AACnG,QAAM9C,IAAOd,EAAMoB,CAAC,GACd+D,IAAI5F,EAAW,KAAKuB,EAAK,IAAI;AACnC,MAAI,CAACqE,EAAG,QAAO;AAEf,QAAMsB,IAAc3F,EAAK,QAAQqE,EAAE,CAAC,EAAE;AACtC,EAAA9D,EAAKnB,GAAKuG,GAAaA,IAActB,EAAE,CAAC,EAAE,QAAQ,QAAQ;AAE1D,QAAM3B,IAAe,CAAC,EAAE,MAAM1C,EAAK,KAAK,MAAMqE,EAAE,CAAC,EAAE,MAAM,GAAG,OAAOrE,EAAK,QAAQqE,EAAE,CAAC,EAAE,QAAQ;AAC7F,MAAIM,IAAIrE,IAAI;AACZ,SAAOqE,IAAIzF,EAAM,UAAQ;AACvB,UAAMiH,IAAOjH,EAAMyF,CAAC;AACpB,QAAI5E,EAAQoG,CAAI,GAAG;AACjB,UAAIxB,IAAI,IAAIzF,EAAM,UAAUe,EAASf,EAAMyF,IAAI,CAAC,EAAE,IAAI,KAAK,GAAG;AAC5D,QAAAjC,EAAK,KAAK,EAAE,MAAM,IAAI,OAAOyD,EAAK,OAAO,GACzCxB;AACA;AAAA,MACF;AACA;AAAA,IACF;AACA,QAAI1E,EAASkG,EAAK,IAAI,KAAK,GAAG;AAC5B,MAAAzD,EAAK,KAAKtC,EAAY+F,GAAM,CAAC,CAAC,GAC9BxB;AACA;AAAA,IACF;AACA,QAAIP,EAAY+B,EAAK,IAAI,EAAG;AAC5B,IAAAzD,EAAK,KAAKyD,CAAI,GACdxB;AAAA,EACF;AAEA,SAAAvF,EAAI,UAAU,KAAK,EAAE,OAAOiF,EAAE,CAAC,GAAG,UAAU3E,EAAYgD,GAAMtD,GAAK0D,IAAQ,GAAG,MAAM,GAAG,GAChF,EAAE,MAAM6B,EAAA;AACjB;AAEA,SAASpB,GAAYvD,GAAYkC,GAAsB9C,GAAgB;AACrE,QAAMuG,IAAc3F,EAAK,QAAQkC,EAAI,CAAC,EAAE;AACxC,EAAA3B,EAAKnB,GAAKuG,GAAaA,IAAczD,EAAI,CAAC,EAAE,QAAQ,QAAQ;AAC5D,QAAMI,IAAOJ,EAAI,UAAU,CAAC;AAC5B,EAAII,KAAM/B,EAAKnB,GAAKY,EAAK,QAAQsC,EAAK,CAAC,GAAGtC,EAAK,QAAQsC,EAAK,CAAC,GAAG,KAAK;AACrE,QAAMkE,IAAQtE,EAAI,UAAU,CAAC;AAC7B,EAAIsE,KAAOjG,EAAKnB,GAAKY,EAAK,QAAQwG,EAAM,CAAC,GAAGxG,EAAK,QAAQwG,EAAM,CAAC,GAAG,QAAQ;AAC7E;AAIA,SAAShD,GAAatE,GAAeoB,GAAoB;AACvD,MAAIA,IAAI,KAAKpB,EAAM,OAAQ,QAAO;AAClC,QAAMuH,IAAOvH,EAAMoB,CAAC,GACdoG,IAAOxH,EAAMoB,IAAI,CAAC;AAExB,SADI,CAACmG,EAAK,KAAK,SAAS,GAAG,KAAK,CAACC,EAAK,KAAK,SAAS,GAAG,KACnD,CAAC9H,GAAa,KAAK8H,EAAK,IAAI,IAAU,KAInCC,EAASF,CAAI,EAAE,MAAM,WAAWE,EAASD,CAAI,EAAE,MAAM;AAC9D;AAEA,SAASC,EAAS3G,GAA8E;AAC9F,QAAM4G,IAAiB,CAAA,GACjBC,IAA+C,CAAA,GAC/CjH,IAAOI,EAAK;AAClB,MAAIiB,IAAO;AAEX,WAASX,IAAI,GAAGA,IAAIV,EAAK,QAAQU,KAAK;AACpC,QAAIV,EAAKU,CAAC,MAAM,MAAM;AACpB,MAAAA;AACA;AAAA,IACF;AACA,IAAIV,EAAKU,CAAC,MAAM,QAChBuG,EAAM,KAAK,EAAE,OAAO7G,EAAK,QAAQM,GAAG,KAAKN,EAAK,QAAQM,IAAI,EAAA,CAAG,GAC7DsG,EAAM,KAAKE,EAAU,EAAE,MAAMlH,EAAK,MAAMqB,GAAMX,CAAC,GAAG,OAAON,EAAK,QAAQiB,EAAA,CAAM,CAAC,GAC7EA,IAAOX,IAAI;AAAA,EACb;AACA,SAAAsG,EAAM,KAAKE,EAAU,EAAE,MAAMlH,EAAK,MAAMqB,CAAI,GAAG,OAAOjB,EAAK,QAAQiB,EAAA,CAAM,CAAC,GAEtE2F,EAAM,SAAS,KAAKA,EAAM,CAAC,EAAE,SAAS,MAAM,YAAY,KAAKhH,CAAI,OAAS,MAAA,GAC1EgH,EAAM,SAAS,KAAKA,EAAMA,EAAM,SAAS,CAAC,EAAE,SAAS,MAAM,YAAY,KAAKhH,CAAI,OAAS,IAAA,GACtF,EAAE,OAAAgH,GAAO,OAAAC,EAAA;AAClB;AAEA,SAASC,EAAUnF,GAAqB;AACtC,QAAMoF,IAAO,UAAU,KAAKpF,EAAM,IAAI,EAAG,CAAC,EAAE;AAE5C,SAAO,EAAE,MADIA,EAAM,KAAK,MAAMoF,CAAI,EAAE,QAAQ,WAAW,EAAE,GAC1C,OAAOpF,EAAM,QAAQoF,EAAA;AACtC;AAEA,SAASrD,GAAUxE,GAAeoB,GAAWlB,GAA0C;AAOrF,MAAI4H,IAAO1G,IAAI;AACf,SAAO0G,IAAO,IAAI9H,EAAM,UAAQ;AAC9B,UAAMc,IAAOd,EAAM8H,IAAO,CAAC;AAC3B,QAAIjH,EAAQC,CAAI,KAAK,CAACA,EAAK,KAAK,SAAS,GAAG,KAAKoE,EAAYpE,EAAK,IAAI,EAAG;AACzE,IAAAgH;AAAA,EACF;AAGA,QAAMC,IADUN,EAASzH,EAAMoB,IAAI,CAAC,CAAC,EACf,MAAM,IAAI4G,EAAO,GAEjCC,IAAUR,EAASzH,EAAMoB,CAAC,CAAC;AACjC,aAAW8G,KAAQD,EAAQ,MAAO,CAAA5G,EAAKnB,GAAKgI,EAAK,OAAOA,EAAK,KAAK,aAAa;AAC/E,QAAMX,IAAOY,EAAQjI,GAAKF,EAAMoB,CAAC,GAAG6G,EAAQ,OAAO,IAAMF,GAAOK,EAAgBlI,GAAK+B,EAAQjC,EAAMoB,CAAC,CAAC,CAAC,CAAC;AAMvG,EAAAC,EAAKnB,GAAKF,EAAMoB,IAAI,CAAC,EAAE,OAAOa,EAAQjC,EAAMoB,IAAI,CAAC,CAAC,GAAG,QAAQ;AAC7D,QAAMiH,IAAUjH,IAAI,MAAM0G,IAAO7F,EAAQjC,EAAMoB,IAAI,CAAC,CAAC,IAAIgH,EAAgBlI,GAAK+B,EAAQjC,EAAMoB,IAAI,CAAC,CAAC,CAAC;AACnG,EAAAI,EAAMtB,GAAK,EAAE,MAAM,iBAAA,GAAoBF,EAAMoB,IAAI,CAAC,EAAE,KAAK,GACzDI,EAAMtB,GAAK,EAAE,MAAM,cAAA,GAAiBF,EAAMoB,IAAI,CAAC,EAAE,KAAK,GACtDO,EAASzB,GAAKmI,CAAO,GACrB1G,EAASzB,GAAKmI,CAAO;AAErB,QAAMC,IAAmB,CAAA;AACzB,WAAS7C,IAAIrE,IAAI,GAAGqE,KAAKqC,GAAMrC,KAAK;AAClC,UAAM3E,IAAOd,EAAMyF,CAAC,GACd8C,IAAMd,EAAS3G,CAAI;AACzB,eAAWoH,KAAQK,EAAI,MAAO,CAAAlH,EAAKnB,GAAKgI,EAAK,OAAOA,EAAK,KAAK,aAAa;AAC3E,UAAM5G,IAAMmE,MAAMqC,IAAO7F,EAAQnB,CAAI,IAAIsH,EAAgBlI,GAAK+B,EAAQnB,CAAI,CAAC,GACrE4G,IAAQS,EAAQjI,GAAKY,GAAMyH,EAAI,OAAO,IAAOR,GAAOzG,CAAG;AAG7D,WAAOoG,EAAM,SAASH,EAAK,SAAQ,CAAAG,EAAM,KAAK,EAAE,UAAU,CAAA,GAAI;AAC9D,IAAAY,EAAK,KAAKZ,EAAM,MAAM,GAAGH,EAAK,MAAM,CAAC;AAAA,EACvC;AAEA,SAAO,EAAE,MAAM,EAAE,MAAM,SAAS,MAAAA,GAAM,MAAAe,GAAM,OAAAP,EAAA,GAAS,MAAMD,IAAO,EAAA;AACpE;AAGA,SAASM,EAAgBlI,GAAUoB,GAAqB;AACtD,MAAIO,IAAKP;AACT,SAAIpB,EAAI,OAAO2B,CAAE,MAAM,QAAMA,KACzB3B,EAAI,OAAO2B,CAAE,MAAM;AAAA,KAAMA,KACtBA;AACT;AAeA,SAASsG,EACPjI,GACAY,GACA4G,GACAc,GACAT,GAGAzG,GACU;AACV,EAAAE,EAAMtB,GAAK,EAAE,MAAM,YAAY,QAAAsI,EAAA,GAAU1H,EAAK,KAAK;AACnD,QAAM2H,IAAgB,CAAA;AACtB,MAAI5G,IAAKf,EAAK;AAEd,QAAM4H,IAAS,CAAC1G,MAAe;AAC7B,IAAIA,KAAMH,MACVL,EAAMtB,GAAK,EAAE,MAAM,cAAA,GAAiB2B,CAAE,GACtCF,EAASzB,GAAK8B,CAAE,GAChBH,IAAKG;AAAA,EACP;AAEA,WAAS2G,IAAI,GAAGA,IAAIjB,EAAM,QAAQiB,KAAK;AACrC,UAAMlG,IAAQiF,EAAMiB,CAAC;AACrB,IAAAD,EAAOjG,EAAM,KAAK,GAClBgG,EAAI,KAAKG,GAAOnG,GAAOvC,GAAKsI,GAAQT,EAAMY,CAAC,KAAK,IAAI,CAAC,GACrD9G,IAAKY,EAAM,QAAQA,EAAM,KAAK;AAAA,EAChC;AACA,SAAAiG,EAAOpH,CAAG,GAEVK,EAASzB,GAAKoB,CAAG,GACVmH;AACT;AAEA,SAASG,GAAOnG,GAAcvC,GAAUsI,GAAiBT,GAA+B;AAMtF,EAAAvG,EAAMtB,GAAK,EAAE,MAAM,aAAa,QAAAsI,GAAQ,OAAAT,EAAA,GAAStF,EAAM,KAAK;AAC5D,QAAMC,IAAWR,EAAYhC,GAAK,CAACuC,CAAK,GAAGoD,EAAUpD,CAAK,GAAG,MAAM;AACnE,SAAAd,EAASzB,GAAKuC,EAAM,QAAQA,EAAM,KAAK,MAAM,GACtC,EAAE,UAAAC,EAAA;AACX;AAEA,SAASsF,GAAQa,GAA6B;AAC5C,QAAMnI,IAAOmI,EAAK,KAAK,KAAA,GACjBC,IAAOpI,EAAK,WAAW,GAAG,GAC1BqI,IAAQrI,EAAK,SAAS,GAAG;AAC/B,SAAIoI,KAAQC,IAAc,WACtBA,IAAc,UACdD,IAAa,SACV;AACT;AAIA,SAAS7D,GAAcjF,GAAeoB,GAAWlB,GAAUmC,GAAoD;AAC7G,QAAMF,IAAiB,CAACnC,EAAMoB,CAAC,CAAC;AAChC,MAAIqE,IAAIrE,IAAI;AAEZ,SAAOqE,IAAIzF,EAAM,UAAQ;AACvB,UAAMc,IAAOd,EAAMyF,CAAC;AACpB,QAAI5E,EAAQC,CAAI,EAAG;AAKnB,UAAMkI,IAAS1J,GAAU,KAAKwB,EAAK,IAAI;AACvC,QAAIkI,GAAQ;AACV,MAAA3H,EAAKnB,GAAKY,EAAK,OAAOmB,EAAQnB,CAAI,GAAG,QAAQ;AAC7C,YAAM4E,IAAQsD,EAAO,CAAC,EAAE,CAAC,MAAM,MAAM,IAAI;AACzC,MAAAxH,EAAMtB,GAAK,EAAE,MAAM,WAAW,OAAAwF,KAAS1F,EAAMoB,CAAC,EAAE,KAAK;AACrD,YAAMsB,IAAWuG,EAAS9G,GAAQjC,GAAKmC,MAAY,SAAS,YAAYA,CAAO;AAC/E,aAAAT,EAAS1B,GAAK+B,EAAQnB,CAAI,CAAC,GACpB,EAAE,MAAM,EAAE,MAAM,WAAW,OAAA4E,GAAO,IAAII,GAAU5F,GAAKwC,CAAQ,GAAG,UAAAA,EAAA,GAAY,MAAM+C,IAAI,EAAA;AAAA,IAC/F;AAEA,QAAIP,EAAYpE,EAAK,IAAI,KAAKwD,GAAatE,GAAOyF,CAAC,EAAG;AACtD,IAAAtD,EAAO,KAAKrB,CAAI,GAChB2E;AAAA,EACF;AAMA,EAAAjE,EAAMtB,GAAK,EAAE,MAAM,YAAA,GAAeF,EAAMoB,CAAC,EAAE,KAAK;AAChD,QAAM8H,IAAe,EAAE,MAAM,aAAa,UAAUD,EAAS9G,GAAQjC,GAAKmC,CAAO,EAAA;AACjF,SAAAT,EAAS1B,GAAK4B,GAAO9B,GAAOoB,GAAGqE,IAAI,CAAC,EAAE,GAAG,GAClC,EAAE,MAAAyD,GAAM,MAAMzD,EAAA;AACvB;AAEA,SAASwD,EAAS9G,GAAgBjC,GAAUmC,GAAgC;AAC1E,SAAOH,EAAYhC,GAAKiC,GAAQgH,GAAahH,CAAM,GAAGE,CAAO;AAC/D;"}