@forevka/wordcanvas 0.7.1 → 0.7.2

package/dist-lib/browser-p_rkUcqE.js

@@ -0,0 +1,1339 @@
+const Be = [
+  "header",
+  "footer",
+  "headerFirst",
+  "headerEven",
+  "footerFirst",
+  "footerEven"
+], rr = new Intl.Segmenter(void 0, { granularity: "grapheme" }), tr = new Intl.Segmenter(void 0, { granularity: "word" }), Lr = (r) => r.runs.some((e) => e.text.length > 0) && r.runs.every((e) => e.text.length === 0 || e.style.hidden === !0), Fe = (r, e) => {
+  const t = [];
+  for (const n of r)
+    if (n.kind === "paragraph") t.push(n);
+    else if (n.kind === "table" && e)
+      for (const s of n.rows)
+        for (const o of s.cells) t.push(...Fe(o.blocks, e));
+  return t;
+}, hr = (r, e) => Fe(r.section[e] ?? [], !0), qr = (r) => Fe(r.blocks, !0), nr = (r) => [
+  ...Fe(r.blocks, !0),
+  ...Be.flatMap((e) => hr(r, e)),
+  ...Object.values(r.footnotes ?? {}).flat()
+], vr = (r, e) => nr(r).find((t) => t.id === e), Vr = (r, e) => nr(r).findIndex((t) => t.id === e), ze = (r, e) => {
+  for (const t of r)
+    if (e.add(t.id), t.kind === "table")
+      for (const n of t.rows) for (const s of n.cells) ze(s.blocks, e);
+}, Yr = (r, e) => {
+  const t = /* @__PURE__ */ new Set();
+  ze(r.blocks, t);
+  for (const n of Be) ze(r.section[n] ?? [], t);
+  for (const n of Object.values(r.footnotes ?? {})) for (const s of n) t.add(s.id);
+  return t.has(e);
+}, sr = (r, e) => e === "body" ? r.blocks : r.section[e] ?? [];
+function Je(r, e, t) {
+  for (let n = 0; n < r.length; n++) {
+    const s = r[n];
+    if (s.kind === "paragraph") {
+      if (s.id === t)
+        return e === "body" ? { kind: "top", bi: n } : { kind: "band", band: e, bi: n };
+    } else if (s.kind === "table")
+      for (let o = 0; o < s.rows.length; o++) {
+        const l = s.rows[o];
+        for (let a = 0; a < l.cells.length; a++) {
+          const i = l.cells[a];
+          for (let f = 0; f < i.blocks.length; f++) {
+            const c = i.blocks[f];
+            if (c.kind === "paragraph" && c.id === t)
+              return { kind: "cell", where: e, bi: n, ri: o, ci: a, pi: f };
+          }
+        }
+      }
+  }
+  return null;
+}
+function Se(r, e) {
+  const t = Je(r.blocks, "body", e);
+  if (t) return t;
+  for (const n of Be) {
+    const s = Je(r.section[n] ?? [], n, e);
+    if (s) return s;
+  }
+  for (const [n, s] of Object.entries(r.footnotes ?? {})) {
+    const o = s.findIndex((l) => l.id === e);
+    if (o >= 0) return { kind: "footnote", noteId: n, pi: o };
+  }
+  return null;
+}
+function He(r, e) {
+  return e.kind === "top" ? r.blocks[e.bi] : e.kind === "band" ? r.section[e.band][e.bi] : e.kind === "footnote" ? r.footnotes[e.noteId][e.pi] : sr(r, e.where)[e.bi].rows[e.ri].cells[e.ci].blocks[e.pi];
+}
+function ke(r, e, t) {
+  if (e.kind === "footnote") {
+    const i = r.footnotes[e.noteId].slice();
+    return i[e.pi] = t, { ...r, footnotes: { ...r.footnotes, [e.noteId]: i } };
+  }
+  if (e.kind === "band") {
+    const i = (r.section[e.band] ?? []).slice();
+    return i[e.bi] = t, { ...r, section: { ...r.section, [e.band]: i } };
+  }
+  if (e.kind === "top") {
+    const i = r.blocks.slice();
+    return i[e.bi] = t, { ...r, blocks: i };
+  }
+  const n = sr(r, e.where).slice(), s = n[e.bi], o = s.rows.slice(), l = { cells: o[e.ri].cells.slice() }, a = { ...l.cells[e.ci], blocks: l.cells[e.ci].blocks.slice() };
+  return a.blocks[e.pi] = t, l.cells[e.ci] = a, o[e.ri] = l, n[e.bi] = { ...s, rows: o, revision: s.revision + 1 }, e.where === "body" ? { ...r, blocks: n } : { ...r, section: { ...r.section, [e.where]: n } };
+}
+const Jr = (r, e) => Se(r, e)?.kind === "cell", Ne = (r) => r.map((e) => e.text).join(""), Kr = (r, e) => {
+  const t = vr(r, e);
+  return t ? Ne(t.runs) : "";
+};
+function Qr(r, e) {
+  let t = 0;
+  for (const n of rr.segment(r)) {
+    if (n.index >= e) break;
+    t = n.index;
+  }
+  return t;
+}
+function Xr(r, e) {
+  for (const t of rr.segment(r)) {
+    const n = t.index + t.segment.length;
+    if (n > e) return n;
+  }
+  return r.length;
+}
+function Zr(r, e) {
+  let t = 0;
+  for (const n of tr.segment(r)) {
+    if (n.index >= e) break;
+    n.isWordLike && (t = n.index);
+  }
+  return t;
+}
+function _r(r, e) {
+  for (const t of tr.segment(r)) {
+    const n = t.index + t.segment.length;
+    if (t.isWordLike && n > e) return n;
+  }
+  return r.length;
+}
+function kr(r, e) {
+  let t = 0;
+  for (const n of r) {
+    const s = t + n.text.length;
+    if (e > t && e <= s && n.text.length > 0) return n.style;
+    t = s;
+  }
+  return r[0]?.style;
+}
+function gr(r, e) {
+  return r.fontFamily === e.fontFamily && r.fontSizePx === e.fontSizePx && r.bold === e.bold && r.italic === e.italic && r.underline === e.underline && r.strikethrough === e.strikethrough && r.color === e.color && !!r.hidden == !!e.hidden && // hidden runs must never merge with visible ones
+  (r.letterSpacingPx ?? 0) === (e.letterSpacingPx ?? 0) && r.highlightColor === e.highlightColor && r.verticalAlign === e.verticalAlign && r.link === e.link && r.footnoteRef === e.footnoteRef && // adjacent refs must never merge into one run
+  r.sdtId === e.sdtId && // content-control boundaries survive normalization
+  r.fieldId === e.fieldId;
+}
+function se(r, e) {
+  const t = r.filter((s) => s.text.length > 0);
+  if (t.length === 0) return [{ text: "", style: r[0]?.style ?? e }];
+  const n = [{ ...t[0] }];
+  for (let s = 1; s < t.length; s++) {
+    const o = t[s], l = n[n.length - 1];
+    gr(l.style, o.style) ? l.text += o.text : n.push({ ...o });
+  }
+  return n;
+}
+function J(r, e) {
+  const t = [], n = [];
+  let s = 0;
+  for (const o of r) {
+    const l = s + o.text.length;
+    l <= e ? t.push(o) : s >= e ? n.push(o) : (t.push({ text: o.text.slice(0, e - s), style: o.style }), n.push({ text: o.text.slice(e - s), style: o.style })), s = l;
+  }
+  return [t, n];
+}
+function br(r, e, t) {
+  const [, n] = J(r, e), [s] = J(n, t - e);
+  return s;
+}
+function ie(r, e) {
+  return kr(r, e) ?? {
+    fontFamily: "Georgia, serif",
+    fontSizePx: 16,
+    bold: !1,
+    italic: !1,
+    underline: !1,
+    strikethrough: !1,
+    color: "#202124"
+  };
+}
+function wr(r, e, t, n) {
+  const s = n ?? ie(r, e), [o, l] = J(r, e);
+  return se([...o, { text: t, style: s }, ...l], s);
+}
+function Ir(r, e, t) {
+  const [n, s] = J(r, e);
+  return se([...n, ...t, ...s], ie(r, e));
+}
+function yr(r, e, t) {
+  const [n, s] = J(r, e), [, o] = J(s, t - e);
+  return se([...n, ...o], ie(r, e));
+}
+function et(r, e, t, n) {
+  const [s, o] = J(r, e), [l, a] = J(o, t - e), i = l.map((f) => ({ text: f.text, style: { ...f.style, ...n } }));
+  return se([...s, ...i, ...a], ie(r, e));
+}
+function rt(r, e, t, n) {
+  const [s, o] = J(r, e), [l, a] = J(o, t - e), i = l.map((d) => d.text).join(""), f = n(i);
+  let c = 0;
+  const u = f.length === i.length ? l.map((d) => {
+    const h = f.slice(c, c + d.text.length);
+    return c += d.text.length, { text: h, style: d.style };
+  }) : l;
+  return se([...s, ...u, ...a], ie(r, e));
+}
+const z = (r) => r;
+function ge(r, e) {
+  const t = Se(r, e);
+  if (!t) throw new Error(`paragraph ${e} not found`);
+  return { loc: t, block: He(r, t) };
+}
+function $(r, e) {
+  return e === "body" ? r.blocks : r.section[e] ?? [];
+}
+function le(r, e, t) {
+  return e === "body" ? { ...r, blocks: t } : { ...r, section: { ...r.section, [e]: t } };
+}
+function qe(r, e) {
+  for (const t of ["body", ...Be]) {
+    const n = $(r, t).findIndex((s) => s.id === e);
+    if (n >= 0) return { where: t, index: n };
+  }
+  return null;
+}
+function re(r, e) {
+  const t = qe(r, e), n = t ? $(r, t.where)[t.index] : void 0;
+  if (!t || !n || n.kind !== "table") throw new Error(`table ${e} not found`);
+  return { where: t.where, bi: t.index, block: n };
+}
+function te(r, e, t, n) {
+  const s = $(r, e).slice();
+  return s[t] = { ...n, revision: n.revision + 1 }, le(r, e, s);
+}
+function pe(r, e, t, n, s, o) {
+  const l = $(r, e).slice(), a = l[t], i = a.rows.slice(), f = { cells: i[n].cells.slice() };
+  return f.cells[s] = { ...f.cells[s], blocks: o }, i[n] = f, l[t] = { ...a, rows: i, revision: a.revision + 1 }, le(r, e, l);
+}
+function Pe(r) {
+  for (const e of r)
+    for (const t of e.cells)
+      for (const n of t.blocks) if (n.kind === "paragraph") return n;
+}
+function mr(r, e) {
+  const t = qe(r, e);
+  if (t) {
+    const n = $(r, t.where)[t.index];
+    return n?.kind === "image" ? { kind: "top", where: t.where, index: t.index, image: n } : null;
+  }
+  for (let n = 0; n < r.blocks.length; n++) {
+    const s = r.blocks[n];
+    if (s.kind === "table")
+      for (let o = 0; o < s.rows.length; o++) {
+        const l = s.rows[o];
+        for (let a = 0; a < l.cells.length; a++) {
+          const i = l.cells[a];
+          for (let f = 0; f < i.blocks.length; f++) {
+            const c = i.blocks[f];
+            if (c.kind === "image" && c.id === e) return { kind: "cell", bi: n, ri: o, ci: a, ii: f, image: c };
+          }
+        }
+      }
+  }
+  return null;
+}
+function xr(r) {
+  let e = 1;
+  const t = [];
+  for (const n of r.rows) {
+    let s = 0;
+    for (const o of n.cells) {
+      for (; (t[s] ?? 0) > 0; ) s++;
+      const l = Math.max(1, o.colSpan ?? 1), a = Math.max(1, o.rowSpan ?? 1);
+      if (a > 1) for (let i = 0; i < l; i++) t[s + i] = a;
+      s += l;
+    }
+    e = Math.max(e, s);
+    for (let o = 0; o < t.length; o++) t[o] > 0 && t[o]--;
+  }
+  return e;
+}
+function Me(r) {
+  const e = xr(r);
+  return r.colFractions && r.colFractions.length === e ? r.colFractions : Array.from({ length: e }, () => 1 / e);
+}
+function ue(r, e) {
+  return { ...r, runs: e, revision: r.revision + 1 };
+}
+function tt(r, e) {
+  switch (e.type) {
+    case "insertText": {
+      const { loc: t, block: n } = ge(r, e.at.blockId), s = wr(n.runs, e.at.offset, e.text, e.style), o = e.text.length;
+      return {
+        doc: ke(r, t, ue(n, s)),
+        inverse: { type: "deleteRange", blockId: n.id, start: e.at.offset, end: e.at.offset + o },
+        mapPosition: (l) => l.blockId === n.id && l.offset >= e.at.offset ? { blockId: l.blockId, offset: l.offset + o } : l,
+        dirtyBlockIds: [n.id]
+      };
+    }
+    case "insertRuns": {
+      const { loc: t, block: n } = ge(r, e.at.blockId), s = Ne(e.runs).length, o = Ir(n.runs, e.at.offset, e.runs);
+      return {
+        doc: ke(r, t, ue(n, o)),
+        inverse: { type: "deleteRange", blockId: n.id, start: e.at.offset, end: e.at.offset + s },
+        mapPosition: (l) => l.blockId === n.id && l.offset >= e.at.offset ? { blockId: l.blockId, offset: l.offset + s } : l,
+        dirtyBlockIds: [n.id]
+      };
+    }
+    case "deleteRange": {
+      const { loc: t, block: n } = ge(r, e.blockId), s = br(n.runs, e.start, e.end), o = yr(n.runs, e.start, e.end), l = e.end - e.start;
+      return {
+        doc: ke(r, t, ue(n, o)),
+        inverse: { type: "insertRuns", at: { blockId: n.id, offset: e.start }, runs: s },
+        mapPosition: (a) => a.blockId !== n.id || a.offset <= e.start ? a : { blockId: a.blockId, offset: a.offset >= e.end ? a.offset - l : e.start },
+        dirtyBlockIds: [n.id]
+      };
+    }
+    case "setRuns": {
+      const { loc: t, block: n } = ge(r, e.blockId);
+      return {
+        doc: ke(r, t, ue(n, e.runs)),
+        inverse: { type: "setRuns", blockId: n.id, runs: n.runs },
+        mapPosition: z,
+        // callers use setRuns for length-preserving restyles
+        dirtyBlockIds: [n.id]
+      };
+    }
+    case "setParaStyle": {
+      const { loc: t, block: n } = ge(r, e.blockId), s = {};
+      for (const l of Object.keys(e.patch))
+        s[l] = n.style[l];
+      const o = {
+        ...n,
+        style: { ...n.style, ...e.patch },
+        revision: n.revision + 1
+      };
+      return {
+        doc: ke(r, t, o),
+        inverse: { type: "setParaStyle", blockId: n.id, patch: s },
+        mapPosition: z,
+        dirtyBlockIds: [n.id]
+      };
+    }
+    case "splitParagraph": {
+      const t = Se(r, e.at.blockId);
+      if (!t) throw new Error(`paragraph ${e.at.blockId} not found`);
+      const n = He(r, t), [s, o] = J(n.runs, e.at.offset), l = ie(n.runs, e.at.offset), a = ue(n, se(s, l)), i = {
+        kind: "paragraph",
+        id: e.newBlockId,
+        revision: 0,
+        runs: se(o, l),
+        style: e.newStyle ?? { ...n.style }
+      };
+      let f;
+      if (t.kind === "cell") {
+        const u = $(r, t.where)[t.bi].rows[t.ri].cells[t.ci].blocks.slice();
+        u.splice(t.pi, 1, a, i), f = pe(r, t.where, t.bi, t.ri, t.ci, u);
+      } else if (t.kind === "footnote") {
+        const c = r.footnotes[t.noteId].slice();
+        c.splice(t.pi, 1, a, i), f = { ...r, footnotes: { ...r.footnotes, [t.noteId]: c } };
+      } else {
+        const c = t.kind === "band" ? t.band : "body", u = $(r, c).slice();
+        u.splice(t.bi, 1, a, i), f = le(r, c, u);
+      }
+      return {
+        doc: f,
+        inverse: { type: "mergeParagraphs", firstBlockId: n.id },
+        mapPosition: (c) => c.blockId === n.id && c.offset >= e.at.offset ? { blockId: e.newBlockId, offset: c.offset - e.at.offset } : c,
+        dirtyBlockIds: [n.id, e.newBlockId]
+      };
+    }
+    case "mergeParagraphs": {
+      const t = Se(r, e.firstBlockId);
+      if (!t) throw new Error(`paragraph ${e.firstBlockId} not found`);
+      const n = He(r, t);
+      let s;
+      if (t.kind === "cell") {
+        const f = $(r, t.where)[t.bi].rows[t.ri].cells[t.ci].blocks[t.pi + 1];
+        if (!f || f.kind !== "paragraph")
+          throw new Error("mergeParagraphs: no next paragraph in cell");
+        s = f;
+      } else if (t.kind === "footnote") {
+        const i = r.footnotes[t.noteId][t.pi + 1];
+        if (!i) throw new Error("mergeParagraphs: no next paragraph in footnote");
+        s = i;
+      } else {
+        const i = t.kind === "band" ? t.band : "body", f = $(r, i)[t.bi + 1];
+        if (!f || f.kind !== "paragraph")
+          throw new Error("mergeParagraphs: no next paragraph");
+        s = f;
+      }
+      const o = Ne(n.runs).length, l = ue(
+        n,
+        se([...n.runs, ...s.runs], ie(n.runs, o))
+      );
+      let a;
+      if (t.kind === "cell") {
+        const f = $(r, t.where)[t.bi].rows[t.ri].cells[t.ci].blocks.slice();
+        f.splice(t.pi, 2, l), a = pe(r, t.where, t.bi, t.ri, t.ci, f);
+      } else if (t.kind === "footnote") {
+        const i = r.footnotes[t.noteId].slice();
+        i.splice(t.pi, 2, l), a = { ...r, footnotes: { ...r.footnotes, [t.noteId]: i } };
+      } else {
+        const i = t.kind === "band" ? t.band : "body", f = $(r, i).slice();
+        f.splice(t.bi, 2, l), a = le(r, i, f);
+      }
+      return {
+        doc: a,
+        inverse: {
+          type: "splitParagraph",
+          at: { blockId: n.id, offset: o },
+          newBlockId: s.id,
+          newStyle: s.style
+        },
+        mapPosition: (i) => i.blockId === s.id ? { blockId: n.id, offset: o + i.offset } : i,
+        dirtyBlockIds: [n.id, s.id]
+      };
+    }
+    case "insertBlock": {
+      const t = e.where ?? "body", n = $(r, t).slice();
+      return n.splice(e.index, 0, e.block), {
+        doc: le(r, t, n),
+        inverse: { type: "removeBlock", blockId: e.block.id },
+        mapPosition: z,
+        dirtyBlockIds: [e.block.id]
+      };
+    }
+    case "removeBlock": {
+      const t = qe(r, e.blockId);
+      if (!t) throw new Error(`block ${e.blockId} not found`);
+      const n = $(r, t.where).slice(), s = n[t.index];
+      n.splice(t.index, 1);
+      const o = n[Math.min(t.index, n.length - 1)];
+      return {
+        doc: le(r, t.where, n),
+        inverse: { type: "insertBlock", index: t.index, block: s, where: t.where },
+        mapPosition: (l) => l.blockId === e.blockId && o ? { blockId: o.id, offset: 0 } : l,
+        dirtyBlockIds: [e.blockId]
+      };
+    }
+    case "setImageProps": {
+      const t = mr(r, e.blockId);
+      if (!t) throw new Error(`image ${e.blockId} not found`);
+      const n = t.image, s = {};
+      e.patch.widthPx !== void 0 && (s.widthPx = n.widthPx), e.patch.heightPx !== void 0 && (s.heightPx = n.heightPx), e.patch.align !== void 0 && (s.align = n.align), e.patch.wrap !== void 0 && (s.wrap = n.wrap ?? null), e.patch.anchor !== void 0 && (s.anchor = n.anchor ?? null);
+      const o = { ...n, revision: n.revision + 1 };
+      e.patch.widthPx !== void 0 && (o.widthPx = e.patch.widthPx), e.patch.heightPx !== void 0 && (o.heightPx = e.patch.heightPx), e.patch.align !== void 0 && (o.align = e.patch.align), e.patch.wrap !== void 0 && (e.patch.wrap === null ? delete o.wrap : o.wrap = e.patch.wrap), e.patch.anchor !== void 0 && (e.patch.anchor === null ? delete o.anchor : o.anchor = e.patch.anchor);
+      let l;
+      if (t.kind === "top") {
+        const a = $(r, t.where).slice();
+        a[t.index] = o, l = le(r, t.where, a);
+      } else {
+        const i = r.blocks[t.bi].rows[t.ri].cells[t.ci].blocks.slice();
+        i[t.ii] = o, l = pe(r, "body", t.bi, t.ri, t.ci, i);
+      }
+      return {
+        doc: l,
+        inverse: { type: "setImageProps", blockId: e.blockId, patch: s },
+        mapPosition: z,
+        dirtyBlockIds: [e.blockId]
+      };
+    }
+    case "setTableColFractions": {
+      const { where: t, bi: n, block: s } = re(r, e.blockId), o = Me(s);
+      return {
+        doc: te(r, t, n, { ...s, colFractions: e.fractions }),
+        inverse: { type: "setTableColFractions", blockId: e.blockId, fractions: o },
+        mapPosition: z,
+        dirtyBlockIds: [e.blockId]
+      };
+    }
+    case "setTableRow": {
+      const { where: t, bi: n, block: s } = re(r, e.tableId), o = s.rows[e.rowIndex];
+      if (!o) throw new Error("setTableRow: no such row");
+      const l = new Set(o.cells.flatMap((f) => f.blocks.map((c) => c.id))), a = s.rows.slice();
+      a[e.rowIndex] = e.row;
+      const i = Pe([e.row]);
+      return {
+        doc: te(r, t, n, { ...s, rows: a }),
+        inverse: { type: "setTableRow", tableId: e.tableId, rowIndex: e.rowIndex, row: o },
+        mapPosition: (f) => l.has(f.blockId) ? e.row.cells.some((u) => u.blocks.some((d) => d.id === f.blockId)) || !i ? f : { blockId: i.id, offset: 0 } : f,
+        dirtyBlockIds: [e.tableId]
+      };
+    }
+    case "insertTableRow": {
+      const { where: t, bi: n, block: s } = re(r, e.tableId), o = s.rows.slice();
+      return o.splice(e.rowIndex, 0, e.row), {
+        doc: te(r, t, n, { ...s, rows: o }),
+        inverse: { type: "removeTableRow", tableId: e.tableId, rowIndex: e.rowIndex },
+        mapPosition: z,
+        dirtyBlockIds: [e.tableId]
+      };
+    }
+    case "removeTableRow": {
+      const { where: t, bi: n, block: s } = re(r, e.tableId), o = s.rows[e.rowIndex];
+      if (!o) throw new Error("removeTableRow: no such row");
+      const l = s.rows.slice();
+      l.splice(e.rowIndex, 1);
+      const a = new Set(o.cells.flatMap((c) => c.blocks.map((u) => u.id))), i = l[Math.min(e.rowIndex, l.length - 1)], f = i ? Pe([i]) : void 0;
+      return {
+        doc: te(r, t, n, { ...s, rows: l }),
+        inverse: { type: "insertTableRow", tableId: e.tableId, rowIndex: e.rowIndex, row: o },
+        mapPosition: (c) => a.has(c.blockId) && f ? { blockId: f.id, offset: 0 } : c,
+        dirtyBlockIds: [e.tableId]
+      };
+    }
+    case "setListDefinition": {
+      const t = r.lists?.[e.listId] ?? null, n = { ...r.lists ?? {} };
+      return e.def ? n[e.listId] = e.def : delete n[e.listId], {
+        doc: { ...r, lists: n },
+        inverse: { type: "setListDefinition", listId: e.listId, def: t },
+        mapPosition: z,
+        // Indents come from the definition → every paragraph in the list must
+        // re-measure; their (revision,width) line-cache keys change with width.
+        dirtyBlockIds: []
+      };
+    }
+    case "setTableStructure": {
+      const { where: t, bi: n, block: s } = re(r, e.tableId), o = new Set(
+        s.rows.flatMap((f) => f.cells.flatMap((c) => c.blocks.map((u) => u.id)))
+      ), l = Pe(e.rows), a = { ...s, rows: e.rows };
+      e.colFractions ? a.colFractions = e.colFractions : delete a.colFractions;
+      const i = { type: "setTableStructure", tableId: e.tableId, rows: s.rows };
+      return s.colFractions && (i.colFractions = s.colFractions), {
+        doc: te(r, t, n, a),
+        inverse: i,
+        mapPosition: (f) => o.has(f.blockId) ? e.rows.some(
+          (u) => u.cells.some((d) => d.blocks.some((h) => h.id === f.blockId))
+        ) || !l ? f : { blockId: l.id, offset: 0 } : f,
+        dirtyBlockIds: [e.tableId]
+      };
+    }
+    case "insertTableColumn": {
+      const { where: t, bi: n, block: s } = re(r, e.tableId), o = { type: "setTableStructure", tableId: e.tableId, rows: s.rows };
+      s.colFractions && (o.colFractions = s.colFractions);
+      const l = s.rows.map((i, f) => {
+        const c = [];
+        let u = 0, d = !1;
+        for (const h of i.cells) {
+          const v = h.colSpan ?? 1;
+          if (!d && e.colIndex > u && e.colIndex < u + v)
+            c.push({ ...h, colSpan: v + 1 }), d = !0;
+          else if (!d && e.colIndex === u) {
+            const g = e.cells[f];
+            g && c.push(g), c.push(h), d = !0;
+          } else
+            c.push(h);
+          u += v;
+        }
+        if (!d) {
+          const h = e.cells[f];
+          h && c.push(h);
+        }
+        return { cells: c };
+      });
+      let a = e.fractions;
+      if (!a) {
+        const i = Me(s), f = 1 / (i.length + 1);
+        a = i.map((c) => c * (1 - f)), a.splice(e.colIndex, 0, f);
+      }
+      return {
+        doc: te(r, t, n, { ...s, rows: l, colFractions: a }),
+        inverse: o,
+        mapPosition: z,
+        dirtyBlockIds: [e.tableId]
+      };
+    }
+    case "setStylesheet": {
+      const t = r.stylesheet ?? { styles: [], defaultStyleId: "Normal" };
+      return {
+        doc: { ...r, stylesheet: e.stylesheet },
+        inverse: { type: "setStylesheet", stylesheet: t },
+        mapPosition: z,
+        dirtyBlockIds: []
+        // restyling paragraphs happens via setRuns/setParaStyle ops
+      };
+    }
+    case "setTableStyleSheet": {
+      const t = r.tableStyles ?? {};
+      return {
+        doc: { ...r, tableStyles: e.tableStyles },
+        inverse: { type: "setTableStyleSheet", tableStyles: t },
+        mapPosition: z,
+        dirtyBlockIds: []
+        // re-baking cells happens via the table-replace ops
+      };
+    }
+    case "setTableStyleRef": {
+      const { where: t, bi: n, block: s } = re(r, e.tableId), o = s.styleId ?? null, l = s.condOverrides ?? null, a = { ...s };
+      return e.styleId === null ? delete a.styleId : a.styleId = e.styleId, e.condOverrides !== void 0 && (e.condOverrides === null ? delete a.condOverrides : a.condOverrides = e.condOverrides), {
+        doc: te(r, t, n, a),
+        inverse: { type: "setTableStyleRef", tableId: e.tableId, styleId: o, condOverrides: l },
+        mapPosition: z,
+        dirtyBlockIds: [e.tableId]
+      };
+    }
+    case "setSectionProps": {
+      const t = r.section, n = {
+        pageWidthPx: t.pageWidthPx,
+        pageHeightPx: t.pageHeightPx,
+        marginPx: { ...t.marginPx },
+        columns: t.columns ? { ...t.columns, ...t.columns.cols ? { cols: t.columns.cols.map((o) => ({ ...o })) } : {} } : null,
+        pageNumberStart: t.pageNumberStart ?? null,
+        headerDistancePx: t.headerDistancePx ?? null,
+        footerDistancePx: t.footerDistancePx ?? null,
+        pageColorHex: t.pageColorHex ?? null,
+        pageBorders: t.pageBorders ?? null
+      }, s = {
+        ...t,
+        pageWidthPx: e.geometry.pageWidthPx,
+        pageHeightPx: e.geometry.pageHeightPx,
+        marginPx: e.geometry.marginPx
+      };
+      return e.geometry.columns ? s.columns = e.geometry.columns : delete s.columns, e.geometry.pageNumberStart !== null ? s.pageNumberStart = e.geometry.pageNumberStart : delete s.pageNumberStart, e.geometry.headerDistancePx !== null ? s.headerDistancePx = e.geometry.headerDistancePx : delete s.headerDistancePx, e.geometry.footerDistancePx !== null ? s.footerDistancePx = e.geometry.footerDistancePx : delete s.footerDistancePx, e.geometry.pageColorHex !== null ? s.pageColorHex = e.geometry.pageColorHex : delete s.pageColorHex, e.geometry.pageBorders !== null ? s.pageBorders = e.geometry.pageBorders : delete s.pageBorders, {
+        doc: { ...r, section: s },
+        inverse: { type: "setSectionProps", geometry: n },
+        mapPosition: z,
+        dirtyBlockIds: []
+        // geometry change → full re-walk; line caches keyed by width
+      };
+    }
+    case "setFootnote": {
+      const t = r.footnotes?.[e.noteId] ?? null, n = { ...r.footnotes ?? {} };
+      e.paras ? n[e.noteId] = e.paras : delete n[e.noteId];
+      const s = new Set((t ?? []).map((l) => l.id)), o = r.blocks.find((l) => l.kind === "paragraph");
+      return {
+        doc: { ...r, footnotes: n },
+        inverse: { type: "setFootnote", noteId: e.noteId, paras: t },
+        mapPosition: (l) => s.has(l.blockId) ? (e.paras ?? []).some((i) => i.id === l.blockId) || !o ? l : { blockId: o.id, offset: 0 } : l,
+        dirtyBlockIds: []
+      };
+    }
+    case "setSdtProps": {
+      const t = r.sdts?.[e.id] ?? null, n = { ...r.sdts ?? {} };
+      return e.props ? n[e.id] = e.props : delete n[e.id], {
+        doc: { ...r, sdts: n },
+        inverse: { type: "setSdtProps", id: e.id, props: t },
+        mapPosition: z,
+        dirtyBlockIds: []
+        // run markers change via setRuns/applyStylePatch ops
+      };
+    }
+    case "setField": {
+      const t = r.fields?.[e.id] ?? null, n = { ...r.fields ?? {} };
+      return e.def ? n[e.id] = e.def : delete n[e.id], {
+        doc: { ...r, fields: n },
+        inverse: { type: "setField", id: e.id, def: t },
+        mapPosition: z,
+        dirtyBlockIds: []
+        // run/block fieldId markers change via setRuns/insert ops
+      };
+    }
+    case "setTocInstruction": {
+      const t = r.tocInstruction ?? null, n = { ...r };
+      return e.instruction !== null ? n.tocInstruction = e.instruction : delete n.tocInstruction, {
+        doc: n,
+        inverse: { type: "setTocInstruction", instruction: t },
+        mapPosition: z,
+        dirtyBlockIds: []
+        // entries are regenerated via insert/removeBlock ops in the same tx
+      };
+    }
+    case "setBookmark": {
+      const t = r.bookmarks?.[e.name] ?? null, n = { ...r.bookmarks ?? {} };
+      return e.range ? n[e.name] = e.range : delete n[e.name], {
+        doc: { ...r, bookmarks: n },
+        inverse: { type: "setBookmark", name: e.name, range: t },
+        mapPosition: z,
+        dirtyBlockIds: []
+      };
+    }
+    case "setSectionBand": {
+      const t = r.section[e.band] ?? null, n = { ...r.section };
+      e.blocks ? n[e.band] = e.blocks : delete n[e.band];
+      const s = new Set(
+        (t ?? []).filter((l) => l.kind === "paragraph").map((l) => l.id)
+      ), o = r.blocks.find((l) => l.kind === "paragraph");
+      return {
+        doc: { ...r, section: n },
+        inverse: { type: "setSectionBand", band: e.band, blocks: t },
+        mapPosition: (l) => s.has(l.blockId) ? (e.blocks ?? []).some((i) => i.id === l.blockId) || !o ? l : { blockId: o.id, offset: 0 } : l,
+        dirtyBlockIds: []
+      };
+    }
+    case "removeTableColumn": {
+      const { where: t, bi: n, block: s } = re(r, e.tableId), o = { type: "setTableStructure", tableId: e.tableId, rows: s.rows };
+      s.colFractions && (o.colFractions = s.colFractions);
+      const l = Me(s), a = /* @__PURE__ */ new Set(), i = s.rows.map((h) => {
+        const v = [];
+        let g = 0;
+        for (const w of h.cells) {
+          const I = w.colSpan ?? 1;
+          if (e.colIndex >= g && e.colIndex < g + I)
+            if (I > 1) {
+              const m = { ...w };
+              I - 1 > 1 ? m.colSpan = I - 1 : delete m.colSpan, v.push(m);
+            } else
+              for (const m of w.blocks) a.add(m.id);
+          else
+            v.push(w);
+          g += I;
+        }
+        return { cells: v };
+      }), f = l.filter((h, v) => v !== e.colIndex), c = f.reduce((h, v) => h + v, 0) || 1, u = f.map((h) => h / c), d = Pe(i);
+      return {
+        doc: te(r, t, n, { ...s, rows: i, colFractions: u }),
+        inverse: o,
+        mapPosition: (h) => a.has(h.blockId) && d ? { blockId: d.id, offset: 0 } : h,
+        dirtyBlockIds: [e.tableId]
+      };
+    }
+  }
+}
+var T = Uint8Array, L = Uint16Array, Ve = Int32Array, Te = new T([
+  0,
+  0,
+  0,
+  0,
+  0,
+  0,
+  0,
+  0,
+  1,
+  1,
+  1,
+  1,
+  2,
+  2,
+  2,
+  2,
+  3,
+  3,
+  3,
+  3,
+  4,
+  4,
+  4,
+  4,
+  5,
+  5,
+  5,
+  5,
+  0,
+  /* unused */
+  0,
+  0,
+  /* impossible */
+  0
+]), Ce = new T([
+  0,
+  0,
+  0,
+  0,
+  1,
+  1,
+  2,
+  2,
+  3,
+  3,
+  4,
+  4,
+  5,
+  5,
+  6,
+  6,
+  7,
+  7,
+  8,
+  8,
+  9,
+  9,
+  10,
+  10,
+  11,
+  11,
+  12,
+  12,
+  13,
+  13,
+  /* unused */
+  0,
+  0
+]), We = new T([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), or = function(r, e) {
+  for (var t = new L(31), n = 0; n < 31; ++n)
+    t[n] = e += 1 << r[n - 1];
+  for (var s = new Ve(t[30]), n = 1; n < 30; ++n)
+    for (var o = t[n]; o < t[n + 1]; ++o)
+      s[o] = o - t[n] << 5 | n;
+  return { b: t, r: s };
+}, lr = or(Te, 2), ir = lr.b, $e = lr.r;
+ir[28] = 258, $e[258] = 28;
+var ar = or(Ce, 0), Pr = ar.b, Ke = ar.r, Ue = new L(32768);
+for (var y = 0; y < 32768; ++y) {
+  var ne = (y & 43690) >> 1 | (y & 21845) << 1;
+  ne = (ne & 52428) >> 2 | (ne & 13107) << 2, ne = (ne & 61680) >> 4 | (ne & 3855) << 4, Ue[y] = ((ne & 65280) >> 8 | (ne & 255) << 8) >> 1;
+}
+var X = (function(r, e, t) {
+  for (var n = r.length, s = 0, o = new L(e); s < n; ++s)
+    r[s] && ++o[r[s] - 1];
+  var l = new L(e);
+  for (s = 1; s < e; ++s)
+    l[s] = l[s - 1] + o[s - 1] << 1;
+  var a;
+  if (t) {
+    a = new L(1 << e);
+    var i = 15 - e;
+    for (s = 0; s < n; ++s)
+      if (r[s])
+        for (var f = s << 4 | r[s], c = e - r[s], u = l[r[s] - 1]++ << c, d = u | (1 << c) - 1; u <= d; ++u)
+          a[Ue[u] >> i] = f;
+  } else
+    for (a = new L(n), s = 0; s < n; ++s)
+      r[s] && (a[s] = Ue[l[r[s] - 1]++] >> 15 - r[s]);
+  return a;
+}), oe = new T(288);
+for (var y = 0; y < 144; ++y)
+  oe[y] = 8;
+for (var y = 144; y < 256; ++y)
+  oe[y] = 9;
+for (var y = 256; y < 280; ++y)
+  oe[y] = 7;
+for (var y = 280; y < 288; ++y)
+  oe[y] = 8;
+var Ie = new T(32);
+for (var y = 0; y < 32; ++y)
+  Ie[y] = 5;
+var Sr = /* @__PURE__ */ X(oe, 9, 0), Br = /* @__PURE__ */ X(oe, 9, 1), Fr = /* @__PURE__ */ X(Ie, 5, 0), Tr = /* @__PURE__ */ X(Ie, 5, 1), Ee = function(r) {
+  for (var e = r[0], t = 1; t < r.length; ++t)
+    r[t] > e && (e = r[t]);
+  return e;
+}, Y = function(r, e, t) {
+  var n = e / 8 | 0;
+  return (r[n] | r[n + 1] << 8) >> (e & 7) & t;
+}, Ae = function(r, e) {
+  var t = e / 8 | 0;
+  return (r[t] | r[t + 1] << 8 | r[t + 2] << 16) >> (e & 7);
+}, Ye = function(r) {
+  return (r + 7) / 8 | 0;
+}, ye = function(r, e, t) {
+  return (e == null || e < 0) && (e = 0), (t == null || t > r.length) && (t = r.length), new T(r.subarray(e, t));
+}, Cr = [
+  "unexpected EOF",
+  "invalid block type",
+  "invalid length/literal",
+  "invalid distance",
+  "stream finished",
+  "no stream handler",
+  ,
+  // determined by compression function
+  "no callback",
+  "invalid UTF-8 data",
+  "extra field too long",
+  "date not in range 1980-2099",
+  "filename too long",
+  "stream finishing",
+  "invalid zip data"
+  // determined by unknown compression method
+], H = function(r, e, t) {
+  var n = new Error(e || Cr[r]);
+  if (n.code = r, Error.captureStackTrace && Error.captureStackTrace(n, H), !t)
+    throw n;
+  return n;
+}, Rr = function(r, e, t, n) {
+  var s = r.length, o = n ? n.length : 0;
+  if (!s || e.f && !e.l)
+    return t || new T(0);
+  var l = !t, a = l || e.i != 2, i = e.i;
+  l && (t = new T(s * 3));
+  var f = function(he) {
+    var ve = t.length;
+    if (he > ve) {
+      var fe = new T(Math.max(ve * 2, he));
+      fe.set(t), t = fe;
+    }
+  }, c = e.f || 0, u = e.p || 0, d = e.b || 0, h = e.l, v = e.d, g = e.m, w = e.n, I = s * 8;
+  do {
+    if (!h) {
+      c = Y(r, u, 1);
+      var m = Y(r, u + 1, 3);
+      if (u += 3, m)
+        if (m == 1)
+          h = Br, v = Tr, g = 9, w = 5;
+        else if (m == 2) {
+          var p = Y(r, u, 31) + 257, F = Y(r, u + 10, 15) + 4, b = p + Y(r, u + 5, 31) + 1;
+          u += 14;
+          for (var k = new T(b), M = new T(19), C = 0; C < F; ++C)
+            M[We[C]] = Y(r, u + C * 3, 7);
+          u += F * 3;
+          for (var D = Ee(M), ee = (1 << D) - 1, U = X(M, D, 1), C = 0; C < b; ) {
+            var N = U[Y(r, u, ee)];
+            u += N & 15;
+            var S = N >> 4;
+            if (S < 16)
+              k[C++] = S;
+            else {
+              var E = 0, x = 0;
+              for (S == 16 ? (x = 3 + Y(r, u, 3), u += 2, E = k[C - 1]) : S == 17 ? (x = 3 + Y(r, u, 7), u += 3) : S == 18 && (x = 11 + Y(r, u, 127), u += 7); x--; )
+                k[C++] = E;
+            }
+          }
+          var W = k.subarray(0, p), A = k.subarray(p);
+          g = Ee(W), w = Ee(A), h = X(W, g, 1), v = X(A, w, 1);
+        } else
+          H(1);
+      else {
+        var S = Ye(u) + 4, B = r[S - 4] | r[S - 3] << 8, R = S + B;
+        if (R > s) {
+          i && H(0);
+          break;
+        }
+        a && f(d + B), t.set(r.subarray(S, R), d), e.b = d += B, e.p = u = R * 8, e.f = c;
+        continue;
+      }
+      if (u > I) {
+        i && H(0);
+        break;
+      }
+    }
+    a && f(d + 131072);
+    for (var de = (1 << g) - 1, q = (1 << w) - 1, Z = u; ; Z = u) {
+      var E = h[Ae(r, u) & de], j = E >> 4;
+      if (u += E & 15, u > I) {
+        i && H(0);
+        break;
+      }
+      if (E || H(2), j < 256)
+        t[d++] = j;
+      else if (j == 256) {
+        Z = u, h = null;
+        break;
+      } else {
+        var G = j - 254;
+        if (j > 264) {
+          var C = j - 257, P = Te[C];
+          G = Y(r, u, (1 << P) - 1) + ir[C], u += P;
+        }
+        var K = v[Ae(r, u) & q], ae = K >> 4;
+        K || H(3), u += K & 15;
+        var A = Pr[ae];
+        if (ae > 3) {
+          var P = Ce[ae];
+          A += Ae(r, u) & (1 << P) - 1, u += P;
+        }
+        if (u > I) {
+          i && H(0);
+          break;
+        }
+        a && f(d + 131072);
+        var ce = d + G;
+        if (d < A) {
+          var me = o - A, xe = Math.min(A, ce);
+          for (me + d < 0 && H(3); d < xe; ++d)
+            t[d] = n[me + d];
+        }
+        for (; d < ce; ++d)
+          t[d] = t[d - A];
+      }
+    }
+    e.l = h, e.p = Z, e.b = d, e.f = c, h && (c = 1, e.m = g, e.d = v, e.n = w);
+  } while (!c);
+  return d != t.length && l ? ye(t, 0, d) : t.subarray(0, d);
+}, _ = function(r, e, t) {
+  t <<= e & 7;
+  var n = e / 8 | 0;
+  r[n] |= t, r[n + 1] |= t >> 8;
+}, be = function(r, e, t) {
+  t <<= e & 7;
+  var n = e / 8 | 0;
+  r[n] |= t, r[n + 1] |= t >> 8, r[n + 2] |= t >> 16;
+}, Oe = function(r, e) {
+  for (var t = [], n = 0; n < r.length; ++n)
+    r[n] && t.push({ s: n, f: r[n] });
+  var s = t.length, o = t.slice();
+  if (!s)
+    return { t: fr, l: 0 };
+  if (s == 1) {
+    var l = new T(t[0].s + 1);
+    return l[t[0].s] = 1, { t: l, l: 1 };
+  }
+  t.sort(function(R, p) {
+    return R.f - p.f;
+  }), t.push({ s: -1, f: 25001 });
+  var a = t[0], i = t[1], f = 0, c = 1, u = 2;
+  for (t[0] = { s: -1, f: a.f + i.f, l: a, r: i }; c != s - 1; )
+    a = t[t[f].f < t[u].f ? f++ : u++], i = t[f != c && t[f].f < t[u].f ? f++ : u++], t[c++] = { s: -1, f: a.f + i.f, l: a, r: i };
+  for (var d = o[0].s, n = 1; n < s; ++n)
+    o[n].s > d && (d = o[n].s);
+  var h = new L(d + 1), v = je(t[c - 1], h, 0);
+  if (v > e) {
+    var n = 0, g = 0, w = v - e, I = 1 << w;
+    for (o.sort(function(p, F) {
+      return h[F.s] - h[p.s] || p.f - F.f;
+    }); n < s; ++n) {
+      var m = o[n].s;
+      if (h[m] > e)
+        g += I - (1 << v - h[m]), h[m] = e;
+      else
+        break;
+    }
+    for (g >>= w; g > 0; ) {
+      var S = o[n].s;
+      h[S] < e ? g -= 1 << e - h[S]++ - 1 : ++n;
+    }
+    for (; n >= 0 && g; --n) {
+      var B = o[n].s;
+      h[B] == e && (--h[B], ++g);
+    }
+    v = e;
+  }
+  return { t: new T(h), l: v };
+}, je = function(r, e, t) {
+  return r.s == -1 ? Math.max(je(r.l, e, t + 1), je(r.r, e, t + 1)) : e[r.s] = t;
+}, Qe = function(r) {
+  for (var e = r.length; e && !r[--e]; )
+    ;
+  for (var t = new L(++e), n = 0, s = r[0], o = 1, l = function(i) {
+    t[n++] = i;
+  }, a = 1; a <= e; ++a)
+    if (r[a] == s && a != e)
+      ++o;
+    else {
+      if (!s && o > 2) {
+        for (; o > 138; o -= 138)
+          l(32754);
+        o > 2 && (l(o > 10 ? o - 11 << 5 | 28690 : o - 3 << 5 | 12305), o = 0);
+      } else if (o > 3) {
+        for (l(s), --o; o > 6; o -= 6)
+          l(8304);
+        o > 2 && (l(o - 3 << 5 | 8208), o = 0);
+      }
+      for (; o--; )
+        l(s);
+      o = 1, s = r[a];
+    }
+  return { c: t.subarray(0, n), n: e };
+}, we = function(r, e) {
+  for (var t = 0, n = 0; n < e.length; ++n)
+    t += r[n] * e[n];
+  return t;
+}, cr = function(r, e, t) {
+  var n = t.length, s = Ye(e + 2);
+  r[s] = n & 255, r[s + 1] = n >> 8, r[s + 2] = r[s] ^ 255, r[s + 3] = r[s + 1] ^ 255;
+  for (var o = 0; o < n; ++o)
+    r[s + o + 4] = t[o];
+  return (s + 4 + n) * 8;
+}, Xe = function(r, e, t, n, s, o, l, a, i, f, c) {
+  _(e, c++, t), ++s[256];
+  for (var u = Oe(s, 15), d = u.t, h = u.l, v = Oe(o, 15), g = v.t, w = v.l, I = Qe(d), m = I.c, S = I.n, B = Qe(g), R = B.c, p = B.n, F = new L(19), b = 0; b < m.length; ++b)
+    ++F[m[b] & 31];
+  for (var b = 0; b < R.length; ++b)
+    ++F[R[b] & 31];
+  for (var k = Oe(F, 7), M = k.t, C = k.l, D = 19; D > 4 && !M[We[D - 1]]; --D)
+    ;
+  var ee = f + 5 << 3, U = we(s, oe) + we(o, Ie) + l, N = we(s, d) + we(o, g) + l + 14 + 3 * D + we(F, M) + 2 * F[16] + 3 * F[17] + 7 * F[18];
+  if (i >= 0 && ee <= U && ee <= N)
+    return cr(e, c, r.subarray(i, i + f));
+  var E, x, W, A;
+  if (_(e, c, 1 + (N < U)), c += 2, N < U) {
+    E = X(d, h, 0), x = d, W = X(g, w, 0), A = g;
+    var de = X(M, C, 0);
+    _(e, c, S - 257), _(e, c + 5, p - 1), _(e, c + 10, D - 4), c += 14;
+    for (var b = 0; b < D; ++b)
+      _(e, c + 3 * b, M[We[b]]);
+    c += 3 * D;
+    for (var q = [m, R], Z = 0; Z < 2; ++Z)
+      for (var j = q[Z], b = 0; b < j.length; ++b) {
+        var G = j[b] & 31;
+        _(e, c, de[G]), c += M[G], G > 15 && (_(e, c, j[b] >> 5 & 127), c += j[b] >> 12);
+      }
+  } else
+    E = Sr, x = oe, W = Fr, A = Ie;
+  for (var b = 0; b < a; ++b) {
+    var P = n[b];
+    if (P > 255) {
+      var G = P >> 18 & 31;
+      be(e, c, E[G + 257]), c += x[G + 257], G > 7 && (_(e, c, P >> 23 & 31), c += Te[G]);
+      var K = P & 31;
+      be(e, c, W[K]), c += A[K], K > 3 && (be(e, c, P >> 5 & 8191), c += Ce[K]);
+    } else
+      be(e, c, E[P]), c += x[P];
+  }
+  return be(e, c, E[256]), c + x[256];
+}, pr = /* @__PURE__ */ new Ve([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]), fr = /* @__PURE__ */ new T(0), Mr = function(r, e, t, n, s, o) {
+  var l = o.z || r.length, a = new T(n + l + 5 * (1 + Math.ceil(l / 7e3)) + s), i = a.subarray(n, a.length - s), f = o.l, c = (o.r || 0) & 7;
+  if (e) {
+    c && (i[0] = o.r >> 3);
+    for (var u = pr[e - 1], d = u >> 13, h = u & 8191, v = (1 << t) - 1, g = o.p || new L(32768), w = o.h || new L(v + 1), I = Math.ceil(t / 3), m = 2 * I, S = function(Re) {
+      return (r[Re] ^ r[Re + 1] << I ^ r[Re + 2] << m) & v;
+    }, B = new Ve(25e3), R = new L(288), p = new L(32), F = 0, b = 0, k = o.i || 0, M = 0, C = o.w || 0, D = 0; k + 2 < l; ++k) {
+      var ee = S(k), U = k & 32767, N = w[ee];
+      if (g[U] = N, w[ee] = U, C <= k) {
+        var E = l - k;
+        if ((F > 7e3 || M > 24576) && (E > 423 || !f)) {
+          c = Xe(r, i, 0, B, R, p, b, M, D, k - D, c), M = F = b = 0, D = k;
+          for (var x = 0; x < 286; ++x)
+            R[x] = 0;
+          for (var x = 0; x < 30; ++x)
+            p[x] = 0;
+        }
+        var W = 2, A = 0, de = h, q = U - N & 32767;
+        if (E > 2 && ee == S(k - q))
+          for (var Z = Math.min(d, E) - 1, j = Math.min(32767, k), G = Math.min(258, E); q <= j && --de && U != N; ) {
+            if (r[k + W] == r[k + W - q]) {
+              for (var P = 0; P < G && r[k + P] == r[k + P - q]; ++P)
+                ;
+              if (P > W) {
+                if (W = P, A = q, P > Z)
+                  break;
+                for (var K = Math.min(q, P - 2), ae = 0, x = 0; x < K; ++x) {
+                  var ce = k - q + x & 32767, me = g[ce], xe = ce - me & 32767;
+                  xe > ae && (ae = xe, N = ce);
+                }
+              }
+            }
+            U = N, N = g[U], q += U - N & 32767;
+          }
+        if (A) {
+          B[M++] = 268435456 | $e[W] << 18 | Ke[A];
+          var he = $e[W] & 31, ve = Ke[A] & 31;
+          b += Te[he] + Ce[ve], ++R[257 + he], ++p[ve], C = k + W, ++F;
+        } else
+          B[M++] = r[k], ++R[r[k]];
+      }
+    }
+    for (k = Math.max(k, C); k < l; ++k)
+      B[M++] = r[k], ++R[r[k]];
+    c = Xe(r, i, f, B, R, p, b, M, D, k - D, c), f || (o.r = c & 7 | i[c / 8 | 0] << 3, c -= 7, o.h = w, o.p = g, o.i = k, o.w = C);
+  } else {
+    for (var k = o.w || 0; k < l + f; k += 65535) {
+      var fe = k + 65535;
+      fe >= l && (i[c / 8 | 0] = f, fe = l), c = cr(i, c + 1, r.subarray(k, fe));
+    }
+    o.i = l;
+  }
+  return ye(a, 0, n + Ye(c) + s);
+}, Er = /* @__PURE__ */ (function() {
+  for (var r = new Int32Array(256), e = 0; e < 256; ++e) {
+    for (var t = e, n = 9; --n; )
+      t = (t & 1 && -306674912) ^ t >>> 1;
+    r[e] = t;
+  }
+  return r;
+})(), Ar = function() {
+  var r = -1;
+  return {
+    p: function(e) {
+      for (var t = r, n = 0; n < e.length; ++n)
+        t = Er[t & 255 ^ e[n]] ^ t >>> 8;
+      r = t;
+    },
+    d: function() {
+      return ~r;
+    }
+  };
+}, Or = function(r, e, t, n, s) {
+  if (!s && (s = { l: 1 }, e.dictionary)) {
+    var o = e.dictionary.subarray(-32768), l = new T(o.length + r.length);
+    l.set(o), l.set(r, o.length), r = l, s.w = o.length;
+  }
+  return Mr(r, e.level == null ? 6 : e.level, e.mem == null ? s.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(r.length))) * 1.5) : 20 : 12 + e.mem, t, n, s);
+}, ur = function(r, e) {
+  var t = {};
+  for (var n in r)
+    t[n] = r[n];
+  for (var n in e)
+    t[n] = e[n];
+  return t;
+}, Q = function(r, e) {
+  return r[e] | r[e + 1] << 8;
+}, V = function(r, e) {
+  return (r[e] | r[e + 1] << 8 | r[e + 2] << 16 | r[e + 3] << 24) >>> 0;
+}, De = function(r, e) {
+  return V(r, e) + V(r, e + 4) * 4294967296;
+}, O = function(r, e, t) {
+  for (; t; ++e)
+    r[e] = t, t >>>= 8;
+};
+function Dr(r, e) {
+  return Or(r, e || {}, 0, 0);
+}
+function zr(r, e) {
+  return Rr(r, { i: 2 }, e && e.out, e && e.dictionary);
+}
+var dr = function(r, e, t, n) {
+  for (var s in r) {
+    var o = r[s], l = e + s, a = n;
+    Array.isArray(o) && (a = ur(n, o[1]), o = o[0]), ArrayBuffer.isView(o) ? t[l] = [o, a] : (t[l += "/"] = [new T(0), a], dr(o, l, t, n));
+  }
+}, Ze = typeof TextEncoder < "u" && /* @__PURE__ */ new TextEncoder(), Ge = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder(), Hr = 0;
+try {
+  Ge.decode(fr, { stream: !0 }), Hr = 1;
+} catch {
+}
+var Nr = function(r) {
+  for (var e = "", t = 0; ; ) {
+    var n = r[t++], s = (n > 127) + (n > 223) + (n > 239);
+    if (t + s > r.length)
+      return { s: e, r: ye(r, t - 1) };
+    s ? s == 3 ? (n = ((n & 15) << 18 | (r[t++] & 63) << 12 | (r[t++] & 63) << 6 | r[t++] & 63) - 65536, e += String.fromCharCode(55296 | n >> 10, 56320 | n & 1023)) : s & 1 ? e += String.fromCharCode((n & 31) << 6 | r[t++] & 63) : e += String.fromCharCode((n & 15) << 12 | (r[t++] & 63) << 6 | r[t++] & 63) : e += String.fromCharCode(n);
+  }
+};
+function _e(r, e) {
+  var t;
+  if (Ze)
+    return Ze.encode(r);
+  for (var n = r.length, s = new T(r.length + (r.length >> 1)), o = 0, l = function(f) {
+    s[o++] = f;
+  }, t = 0; t < n; ++t) {
+    if (o + 5 > s.length) {
+      var a = new T(o + 8 + (n - t << 1));
+      a.set(s), s = a;
+    }
+    var i = r.charCodeAt(t);
+    i < 128 || e ? l(i) : i < 2048 ? (l(192 | i >> 6), l(128 | i & 63)) : i > 55295 && i < 57344 ? (i = 65536 + (i & 1047552) | r.charCodeAt(++t) & 1023, l(240 | i >> 18), l(128 | i >> 12 & 63), l(128 | i >> 6 & 63), l(128 | i & 63)) : (l(224 | i >> 12), l(128 | i >> 6 & 63), l(128 | i & 63));
+  }
+  return ye(s, 0, o);
+}
+function Wr(r, e) {
+  if (e) {
+    for (var t = "", n = 0; n < r.length; n += 16384)
+      t += String.fromCharCode.apply(null, r.subarray(n, n + 16384));
+    return t;
+  } else {
+    if (Ge)
+      return Ge.decode(r);
+    var s = Nr(r), o = s.s, t = s.r;
+    return t.length && H(8), o;
+  }
+}
+var $r = function(r, e) {
+  return e + 30 + Q(r, e + 26) + Q(r, e + 28);
+}, Ur = function(r, e, t) {
+  var n = Q(r, e + 28), s = Q(r, e + 30), o = Wr(r.subarray(e + 46, e + 46 + n), !(Q(r, e + 8) & 2048)), l = e + 46 + n, a = jr(r, l, s, t, V(r, e + 20), V(r, e + 24), V(r, e + 42)), i = a[0], f = a[1], c = a[2];
+  return [Q(r, e + 10), i, f, o, l + s + Q(r, e + 32), c];
+}, jr = function(r, e, t, n, s, o, l) {
+  var a = s == 4294967295, i = o == 4294967295, f = l == 4294967295, c = e + t, u = a + i + f;
+  if (n && u) {
+    for (; e + 4 < c; e += 4 + Q(r, e + 2))
+      if (Q(r, e) == 1)
+        return [
+          a ? De(r, e + 4 + 8 * i) : s,
+          i ? De(r, e + 4) : o,
+          f ? De(r, e + 4 + 8 * (i + a)) : l,
+          1
+        ];
+    n < 2 && H(13);
+  }
+  return [s, o, l, 0];
+}, Le = function(r) {
+  var e = 0;
+  if (r)
+    for (var t in r) {
+      var n = r[t].length;
+      n > 65535 && H(9), e += n + 4;
+    }
+  return e;
+}, er = function(r, e, t, n, s, o, l, a) {
+  var i = n.length, f = t.extra, c = a && a.length, u = Le(f);
+  O(r, e, l != null ? 33639248 : 67324752), e += 4, l != null && (r[e++] = 20, r[e++] = t.os), r[e] = 20, e += 2, r[e++] = t.flag << 1 | (o < 0 && 8), r[e++] = s && 8, r[e++] = t.compression & 255, r[e++] = t.compression >> 8;
+  var d = new Date(t.mtime == null ? Date.now() : t.mtime), h = d.getFullYear() - 1980;
+  if ((h < 0 || h > 119) && H(10), O(r, e, h << 25 | d.getMonth() + 1 << 21 | d.getDate() << 16 | d.getHours() << 11 | d.getMinutes() << 5 | d.getSeconds() >> 1), e += 4, o != -1 && (O(r, e, t.crc), O(r, e + 4, o < 0 ? -o - 2 : o), O(r, e + 8, t.size)), O(r, e + 12, i), O(r, e + 14, u), e += 16, l != null && (O(r, e, c), O(r, e + 6, t.attrs), O(r, e + 10, l), e += 14), r.set(n, e), e += i, u)
+    for (var v in f) {
+      var g = f[v], w = g.length;
+      O(r, e, +v), O(r, e + 2, w), r.set(g, e + 4), e += 4 + w;
+    }
+  return c && (r.set(a, e), e += c), e;
+}, Gr = function(r, e, t, n, s) {
+  O(r, e, 101010256), O(r, e + 8, t), O(r, e + 10, t), O(r, e + 12, n), O(r, e + 16, s);
+};
+function nt(r, e) {
+  e || (e = {});
+  var t = {}, n = [];
+  dr(r, "", t, e);
+  var s = 0, o = 0;
+  for (var l in t) {
+    var a = t[l], i = a[0], f = a[1], c = f.level == 0 ? 0 : 8, u = _e(l), d = u.length, h = f.comment, v = h && _e(h), g = v && v.length, w = Le(f.extra);
+    d > 65535 && H(11);
+    var I = c ? Dr(i, f) : i, m = I.length, S = Ar();
+    S.p(i), n.push(ur(f, {
+      size: i.length,
+      crc: S.d(),
+      c: I,
+      f: u,
+      m: v,
+      u: d != l.length || v && h.length != g,
+      o: s,
+      compression: c
+    })), s += 30 + d + w + m, o += 76 + 2 * (d + w) + (g || 0) + m;
+  }
+  for (var B = new T(o + 22), R = s, p = o - s, F = 0; F < n.length; ++F) {
+    var u = n[F];
+    er(B, u.o, u, u.f, u.u, u.c.length);
+    var b = 30 + u.f.length + Le(u.extra);
+    B.set(u.c, u.o + b), er(B, s, u, u.f, u.u, u.c.length, u.o, u.m), s += 16 + b + (u.m ? u.m.length : 0);
+  }
+  return Gr(B, s, n.length, p, R), B;
+}
+function st(r, e) {
+  for (var t = {}, n = r.length - 22; V(r, n) != 101010256; --n)
+    (!n || r.length - n > 65558) && H(13);
+  var s = Q(r, n + 8);
+  if (!s)
+    return {};
+  var o = V(r, n + 16), l = V(r, n - 20) == 117853008;
+  if (l) {
+    var a = V(r, n - 12);
+    l = V(r, a) == 101075792, l && (s = V(r, a + 32), o = V(r, a + 48));
+  }
+  for (var i = e && e.filter, f = 0; f < s; ++f) {
+    var c = Ur(r, o, l), u = c[0], d = c[1], h = c[2], v = c[3], g = c[4], w = c[5], I = $r(r, w);
+    o = g, (!i || i({
+      name: v,
+      size: d,
+      originalSize: h,
+      compression: u
+    })) && (u ? u == 8 ? t[v] = zr(r.subarray(I, I + d), { out: new T(h) }) : H(14, "unknown compression type " + u) : t[v] = ye(r, I, I + d));
+  }
+  return t;
+}
+export {
+  qr as A,
+  Be as B,
+  se as C,
+  hr as D,
+  Zr as E,
+  _r as F,
+  Me as G,
+  Wr as a,
+  tt as b,
+  Yr as c,
+  vr as d,
+  et as e,
+  Vr as f,
+  xr as g,
+  qe as h,
+  kr as i,
+  $ as j,
+  Jr as k,
+  Se as l,
+  rt as m,
+  sr as n,
+  Qr as o,
+  nr as p,
+  Kr as q,
+  mr as r,
+  _e as s,
+  Ne as t,
+  st as u,
+  Lr as v,
+  tr as w,
+  br as x,
+  Xr as y,
+  nt as z
+};