@forevka/wordcanvas 0.7.0 → 0.7.2

package/dist-lib/browser-5Sv4CuNy.js

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