@forevka/wordcanvas 0.7.1 → 0.7.3

package/dist-lib/browser-DkKxreJM.js

@@ -1,1305 +0,0 @@
-const je = [
-  "header",
-  "footer",
-  "headerFirst",
-  "headerEven",
-  "footerFirst",
-  "footerEven"
-], er = new Intl.Segmenter(void 0, { granularity: "grapheme" }), rr = new Intl.Segmenter(void 0, { granularity: "word" }), jr = (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;
-}, hr = (r, e) => Be(r.section[e] ?? [], !0), qr = (r) => Be(r.blocks, !0), nr = (r) => [
-  ...Be(r.blocks, !0),
-  ...je.flatMap((e) => hr(r, e)),
-  ...Object.values(r.footnotes ?? {}).flat()
-], vr = (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 i = s.rows[o];
-        for (let a = 0; a < i.cells.length; a++) {
-          const l = i.cells[a];
-          for (let f = 0; f < l.blocks.length; f++) {
-            const c = l.blocks[f];
-            if (c.kind === "paragraph" && c.id === n)
-              return { kind: "cell", where: e, bi: t, ri: o, ci: a, pi: f };
-          }
-        }
-      }
-  }
-  return null;
-}
-function Se(r, e) {
-  const n = Ye(r.blocks, "body", e);
-  if (n) return n;
-  for (const t of je) {
-    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((i) => i.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 l = r.footnotes[e.noteId].slice();
-    return l[e.pi] = n, { ...r, footnotes: { ...r.footnotes, [e.noteId]: l } };
-  }
-  if (e.kind === "band") {
-    const l = (r.section[e.band] ?? []).slice();
-    return l[e.bi] = n, { ...r, section: { ...r.section, [e.band]: l } };
-  }
-  if (e.kind === "top") {
-    const l = r.blocks.slice();
-    return l[e.bi] = n, { ...r, blocks: l };
-  }
-  const t = tr(r, e.where).slice(), s = t[e.bi], o = s.rows.slice(), i = { cells: o[e.ri].cells.slice() }, a = { ...i.cells[e.ci], blocks: i.cells[e.ci].blocks.slice() };
-  return a.blocks[e.pi] = n, i.cells[e.ci] = a, o[e.ri] = i, 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) => Se(r, e)?.kind === "cell", Ne = (r) => r.map((e) => e.text).join(""), Yr = (r, e) => {
-  const n = vr(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 && // content-control boundaries survive normalization
-  r.fieldId === e.fieldId;
-}
-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], i = t[t.length - 1];
-    kr(i.style, o.style) ? i.text += o.text : t.push({ ...o });
-  }
-  return t;
-}
-function J(r, e) {
-  const n = [], t = [];
-  let s = 0;
-  for (const o of r) {
-    const i = s + o.text.length;
-    i <= 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 = i;
-  }
-  return [n, t];
-}
-function gr(r, e, n) {
-  const [, t] = J(r, e), [s] = J(t, n - e);
-  return s;
-}
-function le(r, e) {
-  return dr(r, e) ?? {
-    fontFamily: "Georgia, serif",
-    fontSizePx: 16,
-    bold: !1,
-    italic: !1,
-    underline: !1,
-    strikethrough: !1,
-    color: "#202124"
-  };
-}
-function wr(r, e, n, t) {
-  const s = t ?? le(r, e), [o, i] = J(r, e);
-  return ne([...o, { text: n, style: s }, ...i], s);
-}
-function br(r, e, n) {
-  const [t, s] = J(r, e);
-  return ne([...t, ...n, ...s], le(r, e));
-}
-function Ir(r, e, n) {
-  const [t, s] = J(r, e), [, o] = J(s, n - e);
-  return ne([...t, ...o], le(r, e));
-}
-function Zr(r, e, n, t) {
-  const [s, o] = J(r, e), [i, a] = J(o, n - e), l = i.map((f) => ({ text: f.text, style: { ...f.style, ...t } }));
-  return ne([...s, ...l, ...a], le(r, e));
-}
-function _r(r, e, n, t) {
-  const [s, o] = J(r, e), [i, a] = J(o, n - e), l = i.map((h) => h.text).join(""), f = t(l);
-  let c = 0;
-  const u = f.length === l.length ? i.map((h) => {
-    const v = f.slice(c, c + h.text.length);
-    return c += h.text.length, { text: v, style: h.style };
-  }) : i;
-  return ne([...s, ...u, ...a], le(r, e));
-}
-const H = (r) => r;
-function ge(r, e) {
-  const n = Se(r, e);
-  if (!n) throw new Error(`paragraph ${e} not found`);
-  return { loc: n, block: Oe(r, n) };
-}
-function $(r, e) {
-  return e === "body" ? r.blocks : r.section[e] ?? [];
-}
-function ie(r, e, n) {
-  return e === "body" ? { ...r, blocks: n } : { ...r, section: { ...r.section, [e]: n } };
-}
-function qe(r, e) {
-  for (const n of ["body", ...je]) {
-    const t = $(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 ? $(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 = $(r, e).slice();
-  return s[n] = { ...t, revision: t.revision + 1 }, ie(r, e, s);
-}
-function pe(r, e, n, t, s, o) {
-  const i = $(r, e).slice(), a = i[n], l = a.rows.slice(), f = { cells: l[t].cells.slice() };
-  return f.cells[s] = { ...f.cells[s], blocks: o }, l[t] = f, i[n] = { ...a, rows: l, revision: a.revision + 1 }, ie(r, e, i);
-}
-function Pe(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 = $(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 i = s.rows[o];
-        for (let a = 0; a < i.cells.length; a++) {
-          const l = i.cells[a];
-          for (let f = 0; f < l.blocks.length; f++) {
-            const c = l.blocks[f];
-            if (c.kind === "image" && c.id === e) return { kind: "cell", bi: t, ri: o, ci: a, 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 i = Math.max(1, o.colSpan ?? 1), a = Math.max(1, o.rowSpan ?? 1);
-      if (a > 1) for (let l = 0; l < i; l++) n[s + l] = a;
-      s += i;
-    }
-    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 = wr(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: (i) => i.blockId === t.id && i.offset >= e.at.offset ? { blockId: i.blockId, offset: i.offset + o } : i,
-        dirtyBlockIds: [t.id]
-      };
-    }
-    case "insertRuns": {
-      const { loc: n, block: t } = ge(r, e.at.blockId), s = Ne(e.runs).length, o = br(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: (i) => i.blockId === t.id && i.offset >= e.at.offset ? { blockId: i.blockId, offset: i.offset + s } : i,
-        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), i = 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: (a) => a.blockId !== t.id || a.offset <= e.start ? a : { blockId: a.blockId, offset: a.offset >= e.end ? a.offset - i : 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: H,
-        // callers use setRuns for length-preserving restyles
-        dirtyBlockIds: [t.id]
-      };
-    }
-    case "setParaStyle": {
-      const { loc: n, block: t } = ge(r, e.blockId), s = {};
-      for (const i of Object.keys(e.patch))
-        s[i] = t.style[i];
-      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: H,
-        dirtyBlockIds: [t.id]
-      };
-    }
-    case "splitParagraph": {
-      const n = Se(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), i = le(t.runs, e.at.offset), a = ue(t, ne(s, i)), l = {
-        kind: "paragraph",
-        id: e.newBlockId,
-        revision: 0,
-        runs: ne(o, i),
-        style: e.newStyle ?? { ...t.style }
-      };
-      let f;
-      if (n.kind === "cell") {
-        const u = $(r, n.where)[n.bi].rows[n.ri].cells[n.ci].blocks.slice();
-        u.splice(n.pi, 1, a, l), 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, a, l), f = { ...r, footnotes: { ...r.footnotes, [n.noteId]: c } };
-      } else {
-        const c = n.kind === "band" ? n.band : "body", u = $(r, c).slice();
-        u.splice(n.bi, 1, a, l), f = ie(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 = Se(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 = $(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 l = r.footnotes[n.noteId][n.pi + 1];
-        if (!l) throw new Error("mergeParagraphs: no next paragraph in footnote");
-        s = l;
-      } else {
-        const l = n.kind === "band" ? n.band : "body", f = $(r, l)[n.bi + 1];
-        if (!f || f.kind !== "paragraph")
-          throw new Error("mergeParagraphs: no next paragraph");
-        s = f;
-      }
-      const o = Ne(t.runs).length, i = ue(
-        t,
-        ne([...t.runs, ...s.runs], le(t.runs, o))
-      );
-      let a;
-      if (n.kind === "cell") {
-        const f = $(r, n.where)[n.bi].rows[n.ri].cells[n.ci].blocks.slice();
-        f.splice(n.pi, 2, i), a = pe(r, n.where, n.bi, n.ri, n.ci, f);
-      } else if (n.kind === "footnote") {
-        const l = r.footnotes[n.noteId].slice();
-        l.splice(n.pi, 2, i), a = { ...r, footnotes: { ...r.footnotes, [n.noteId]: l } };
-      } else {
-        const l = n.kind === "band" ? n.band : "body", f = $(r, l).slice();
-        f.splice(n.bi, 2, i), a = ie(r, l, f);
-      }
-      return {
-        doc: a,
-        inverse: {
-          type: "splitParagraph",
-          at: { blockId: t.id, offset: o },
-          newBlockId: s.id,
-          newStyle: s.style
-        },
-        mapPosition: (l) => l.blockId === s.id ? { blockId: t.id, offset: o + l.offset } : l,
-        dirtyBlockIds: [t.id, s.id]
-      };
-    }
-    case "insertBlock": {
-      const n = e.where ?? "body", t = $(r, n).slice();
-      return t.splice(e.index, 0, e.block), {
-        doc: ie(r, n, t),
-        inverse: { type: "removeBlock", blockId: e.block.id },
-        mapPosition: H,
-        dirtyBlockIds: [e.block.id]
-      };
-    }
-    case "removeBlock": {
-      const n = qe(r, e.blockId);
-      if (!n) throw new Error(`block ${e.blockId} not found`);
-      const t = $(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: ie(r, n.where, t),
-        inverse: { type: "insertBlock", index: n.index, block: s, where: n.where },
-        mapPosition: (i) => i.blockId === e.blockId && o ? { blockId: o.id, offset: 0 } : i,
-        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 = {};
-      e.patch.widthPx !== void 0 && (s.widthPx = t.widthPx), e.patch.heightPx !== void 0 && (s.heightPx = t.heightPx), e.patch.align !== void 0 && (s.align = t.align), e.patch.wrap !== void 0 && (s.wrap = t.wrap ?? null), e.patch.anchor !== void 0 && (s.anchor = t.anchor ?? null);
-      const o = { ...t, revision: t.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 i;
-      if (n.kind === "top") {
-        const a = $(r, n.where).slice();
-        a[n.index] = o, i = ie(r, n.where, a);
-      } else {
-        const l = r.blocks[n.bi].rows[n.ri].cells[n.ci].blocks.slice();
-        l[n.ii] = o, i = pe(r, "body", n.bi, n.ri, n.ci, l);
-      }
-      return {
-        doc: i,
-        inverse: { type: "setImageProps", blockId: e.blockId, patch: s },
-        mapPosition: H,
-        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: H,
-        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 i = new Set(o.cells.flatMap((f) => f.blocks.map((c) => c.id))), a = s.rows.slice();
-      a[e.rowIndex] = e.row;
-      const l = Pe([e.row]);
-      return {
-        doc: oe(r, n, t, { ...s, rows: a }),
-        inverse: { type: "setTableRow", tableId: e.tableId, rowIndex: e.rowIndex, row: o },
-        mapPosition: (f) => i.has(f.blockId) ? e.row.cells.some((u) => u.blocks.some((h) => h.id === f.blockId)) || !l ? f : { blockId: l.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: H,
-        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 i = s.rows.slice();
-      i.splice(e.rowIndex, 1);
-      const a = new Set(o.cells.flatMap((c) => c.blocks.map((u) => u.id))), l = i[Math.min(e.rowIndex, i.length - 1)], f = l ? Pe([l]) : void 0;
-      return {
-        doc: oe(r, n, t, { ...s, rows: i }),
-        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 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: H,
-        // 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)))
-      ), i = Pe(e.rows), a = { ...s, rows: e.rows };
-      e.colFractions ? a.colFractions = e.colFractions : delete a.colFractions;
-      const l = { type: "setTableStructure", tableId: e.tableId, rows: s.rows };
-      return s.colFractions && (l.colFractions = s.colFractions), {
-        doc: oe(r, n, t, a),
-        inverse: l,
-        mapPosition: (f) => o.has(f.blockId) ? e.rows.some(
-          (u) => u.cells.some((h) => h.blocks.some((v) => v.id === f.blockId))
-        ) || !i ? f : { blockId: i.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 i = s.rows.map((l, f) => {
-        const c = [];
-        let u = 0, h = !1;
-        for (const v of l.cells) {
-          const d = v.colSpan ?? 1;
-          if (!h && e.colIndex > u && e.colIndex < u + d)
-            c.push({ ...v, colSpan: d + 1 }), h = !0;
-          else if (!h && e.colIndex === u) {
-            const g = e.cells[f];
-            g && c.push(g), c.push(v), h = !0;
-          } else
-            c.push(v);
-          u += d;
-        }
-        if (!h) {
-          const v = e.cells[f];
-          v && c.push(v);
-        }
-        return { cells: c };
-      });
-      let a = e.fractions;
-      if (!a) {
-        const l = Ce(s), f = 1 / (l.length + 1);
-        a = l.map((c) => c * (1 - f)), a.splice(e.colIndex, 0, f);
-      }
-      return {
-        doc: oe(r, n, t, { ...s, rows: i, colFractions: a }),
-        inverse: o,
-        mapPosition: H,
-        dirtyBlockIds: [e.tableId]
-      };
-    }
-    case "setStylesheet": {
-      const n = r.stylesheet ?? { styles: [], defaultStyleId: "Normal" };
-      return {
-        doc: { ...r, stylesheet: e.stylesheet },
-        inverse: { type: "setStylesheet", stylesheet: n },
-        mapPosition: H,
-        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: H,
-        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((i) => i.id)), o = r.blocks.find((i) => i.kind === "paragraph");
-      return {
-        doc: { ...r, footnotes: t },
-        inverse: { type: "setFootnote", noteId: e.noteId, paras: n },
-        mapPosition: (i) => s.has(i.blockId) ? (e.paras ?? []).some((l) => l.id === i.blockId) || !o ? i : { blockId: o.id, offset: 0 } : i,
-        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: H,
-        dirtyBlockIds: []
-        // run markers change via setRuns/applyStylePatch ops
-      };
-    }
-    case "setField": {
-      const n = r.fields?.[e.id] ?? null, t = { ...r.fields ?? {} };
-      return e.def ? t[e.id] = e.def : delete t[e.id], {
-        doc: { ...r, fields: t },
-        inverse: { type: "setField", id: e.id, def: n },
-        mapPosition: H,
-        dirtyBlockIds: []
-        // run/block fieldId markers change via setRuns/insert ops
-      };
-    }
-    case "setTocInstruction": {
-      const n = r.tocInstruction ?? null, t = { ...r };
-      return e.instruction !== null ? t.tocInstruction = e.instruction : delete t.tocInstruction, {
-        doc: t,
-        inverse: { type: "setTocInstruction", instruction: n },
-        mapPosition: H,
-        dirtyBlockIds: []
-        // entries are regenerated via insert/removeBlock ops in the same tx
-      };
-    }
-    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: H,
-        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((i) => i.kind === "paragraph").map((i) => i.id)
-      ), o = r.blocks.find((i) => i.kind === "paragraph");
-      return {
-        doc: { ...r, section: t },
-        inverse: { type: "setSectionBand", band: e.band, blocks: n },
-        mapPosition: (i) => s.has(i.blockId) ? (e.blocks ?? []).some((l) => l.id === i.blockId) || !o ? i : { blockId: o.id, offset: 0 } : i,
-        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 i = Ce(s), a = /* @__PURE__ */ new Set(), l = s.rows.map((v) => {
-        const d = [];
-        let g = 0;
-        for (const b of v.cells) {
-          const I = b.colSpan ?? 1;
-          if (e.colIndex >= g && e.colIndex < g + I)
-            if (I > 1) {
-              const y = { ...b };
-              I - 1 > 1 ? y.colSpan = I - 1 : delete y.colSpan, d.push(y);
-            } else
-              for (const y of b.blocks) a.add(y.id);
-          else
-            d.push(b);
-          g += I;
-        }
-        return { cells: d };
-      }), f = i.filter((v, d) => d !== e.colIndex), c = f.reduce((v, d) => v + d, 0) || 1, u = f.map((v) => v / c), h = Pe(l);
-      return {
-        doc: oe(r, n, t, { ...s, rows: l, colFractions: u }),
-        inverse: o,
-        mapPosition: (v) => a.has(v.blockId) && h ? { blockId: h.id, offset: 0 } : v,
-        dirtyBlockIds: [e.tableId]
-      };
-    }
-  }
-}
-var R = Uint8Array, q = 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 q(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), ir = or.b, De = or.r;
-ir[28] = 258, De[258] = 28;
-var lr = sr(Re, 0), xr = lr.b, Je = lr.r, He = new q(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 q(e); s < t; ++s)
-    r[s] && ++o[r[s] - 1];
-  var i = new q(e);
-  for (s = 1; s < e; ++s)
-    i[s] = i[s - 1] + o[s - 1] << 1;
-  var a;
-  if (n) {
-    a = new q(1 << e);
-    var l = 15 - e;
-    for (s = 0; s < t; ++s)
-      if (r[s])
-        for (var f = s << 4 | r[s], c = e - r[s], u = i[r[s] - 1]++ << c, h = u | (1 << c) - 1; u <= h; ++u)
-          a[He[u] >> l] = f;
-  } else
-    for (a = new q(t), s = 0; s < t; ++s)
-      r[s] && (a[s] = He[i[r[s] - 1]++] >> 15 - r[s]);
-  return a;
-}), 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 Pr = /* @__PURE__ */ X(te, 9, 0), Sr = /* @__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 i = !n, a = i || e.i != 2, l = e.i;
-  i && (n = new R(s * 3));
-  var f = function(ve) {
-    var de = n.length;
-    if (ve > de) {
-      var fe = new R(Math.max(de * 2, ve));
-      fe.set(n), n = fe;
-    }
-  }, c = e.f || 0, u = e.p || 0, h = e.b || 0, v = e.l, d = e.d, g = e.m, b = e.n, I = s * 8;
-  do {
-    if (!v) {
-      c = Y(r, u, 1);
-      var y = Y(r, u + 1, 3);
-      if (u += 3, y)
-        if (y == 1)
-          v = Sr, d = Fr, g = 9, b = 5;
-        else if (y == 2) {
-          var C = Y(r, u, 31) + 257, F = Y(r, u + 10, 15) + 4, w = C + Y(r, u + 5, 31) + 1;
-          u += 14;
-          for (var k = new R(w), 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, U = X(M, O, 1), T = 0; T < w; ) {
-            var W = U[Y(r, u, ee)];
-            u += W & 15;
-            var S = W >> 4;
-            if (S < 16)
-              k[T++] = S;
-            else {
-              var E = 0, x = 0;
-              for (S == 16 ? (x = 3 + Y(r, u, 3), u += 2, E = k[T - 1]) : S == 17 ? (x = 3 + Y(r, u, 7), u += 3) : S == 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), b = Me(A), v = X(D, g, 1), d = X(A, b, 1);
-        } else
-          N(1);
-      else {
-        var S = Ve(u) + 4, B = r[S - 4] | r[S - 3] << 8, p = S + B;
-        if (p > s) {
-          l && N(0);
-          break;
-        }
-        a && f(h + B), n.set(r.subarray(S, p), h), e.b = h += B, e.p = u = p * 8, e.f = c;
-        continue;
-      }
-      if (u > I) {
-        l && N(0);
-        break;
-      }
-    }
-    a && f(h + 131072);
-    for (var he = (1 << g) - 1, G = (1 << b) - 1, Z = u; ; Z = u) {
-      var E = v[Ee(r, u) & he], L = E >> 4;
-      if (u += E & 15, u > I) {
-        l && N(0);
-        break;
-      }
-      if (E || N(2), L < 256)
-        n[h++] = L;
-      else if (L == 256) {
-        Z = u, v = null;
-        break;
-      } else {
-        var j = L - 254;
-        if (L > 264) {
-          var T = L - 257, P = Fe[T];
-          j = Y(r, u, (1 << P) - 1) + ir[T], u += P;
-        }
-        var K = d[Ee(r, u) & G], ae = K >> 4;
-        K || N(3), u += K & 15;
-        var A = xr[ae];
-        if (ae > 3) {
-          var P = Re[ae];
-          A += Ee(r, u) & (1 << P) - 1, u += P;
-        }
-        if (u > I) {
-          l && N(0);
-          break;
-        }
-        a && f(h + 131072);
-        var ce = h + j;
-        if (h < A) {
-          var ye = o - A, xe = Math.min(A, ce);
-          for (ye + h < 0 && N(3); h < xe; ++h)
-            n[h] = t[ye + h];
-        }
-        for (; h < ce; ++h)
-          n[h] = n[h - A];
-      }
-    }
-    e.l = v, e.p = Z, e.b = h, e.f = c, v && (c = 1, e.m = g, e.d = d, e.n = b);
-  } while (!c);
-  return h != n.length && i ? me(n, 0, h) : n.subarray(0, h);
-}, _ = function(r, e, n) {
-  n <<= e & 7;
-  var t = e / 8 | 0;
-  r[t] |= n, r[t + 1] |= n >> 8;
-}, we = 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 i = new R(n[0].s + 1);
-    return i[n[0].s] = 1, { t: i, l: 1 };
-  }
-  n.sort(function(p, C) {
-    return p.f - C.f;
-  }), n.push({ s: -1, f: 25001 });
-  var a = n[0], l = n[1], f = 0, c = 1, u = 2;
-  for (n[0] = { s: -1, f: a.f + l.f, l: a, r: l }; c != s - 1; )
-    a = n[n[f].f < n[u].f ? f++ : u++], l = n[f != c && n[f].f < n[u].f ? f++ : u++], n[c++] = { s: -1, f: a.f + l.f, l: a, r: l };
-  for (var h = o[0].s, t = 1; t < s; ++t)
-    o[t].s > h && (h = o[t].s);
-  var v = new q(h + 1), d = $e(n[c - 1], v, 0);
-  if (d > e) {
-    var t = 0, g = 0, b = d - e, I = 1 << b;
-    for (o.sort(function(C, F) {
-      return v[F.s] - v[C.s] || C.f - F.f;
-    }); t < s; ++t) {
-      var y = o[t].s;
-      if (v[y] > e)
-        g += I - (1 << d - v[y]), v[y] = e;
-      else
-        break;
-    }
-    for (g >>= b; g > 0; ) {
-      var S = o[t].s;
-      v[S] < e ? g -= 1 << e - v[S]++ - 1 : ++t;
-    }
-    for (; t >= 0 && g; --t) {
-      var B = o[t].s;
-      v[B] == e && (--v[B], ++g);
-    }
-    d = e;
-  }
-  return { t: new R(v), 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 q(++e), t = 0, s = r[0], o = 1, i = function(l) {
-    n[t++] = l;
-  }, a = 1; a <= e; ++a)
-    if (r[a] == s && a != e)
-      ++o;
-    else {
-      if (!s && o > 2) {
-        for (; o > 138; o -= 138)
-          i(32754);
-        o > 2 && (i(o > 10 ? o - 11 << 5 | 28690 : o - 3 << 5 | 12305), o = 0);
-      } else if (o > 3) {
-        for (i(s), --o; o > 6; o -= 6)
-          i(8304);
-        o > 2 && (i(o - 3 << 5 | 8208), o = 0);
-      }
-      for (; o--; )
-        i(s);
-      o = 1, s = r[a];
-    }
-  return { c: n.subarray(0, t), n: e };
-}, be = function(r, e) {
-  for (var n = 0, t = 0; t < e.length; ++t)
-    n += r[t] * e[t];
-  return n;
-}, ar = 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, i, a, l, f, c) {
-  _(e, c++, n), ++s[256];
-  for (var u = Ae(s, 15), h = u.t, v = u.l, d = Ae(o, 15), g = d.t, b = d.l, I = Ke(h), y = I.c, S = I.n, B = Ke(g), p = B.c, C = B.n, F = new q(19), w = 0; w < y.length; ++w)
-    ++F[y[w] & 31];
-  for (var w = 0; w < p.length; ++w)
-    ++F[p[w] & 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, U = be(s, te) + be(o, Ie) + i, W = be(s, h) + be(o, g) + i + 14 + 3 * O + be(F, M) + 2 * F[16] + 3 * F[17] + 7 * F[18];
-  if (l >= 0 && ee <= U && ee <= W)
-    return ar(e, c, r.subarray(l, l + f));
-  var E, x, D, A;
-  if (_(e, c, 1 + (W < U)), c += 2, W < U) {
-    E = X(h, v, 0), x = h, D = X(g, b, 0), A = g;
-    var he = X(M, T, 0);
-    _(e, c, S - 257), _(e, c + 5, C - 1), _(e, c + 10, O - 4), c += 14;
-    for (var w = 0; w < O; ++w)
-      _(e, c + 3 * w, M[We[w]]);
-    c += 3 * O;
-    for (var G = [y, p], Z = 0; Z < 2; ++Z)
-      for (var L = G[Z], w = 0; w < L.length; ++w) {
-        var j = L[w] & 31;
-        _(e, c, he[j]), c += M[j], j > 15 && (_(e, c, L[w] >> 5 & 127), c += L[w] >> 12);
-      }
-  } else
-    E = Pr, x = te, D = Br, A = Ie;
-  for (var w = 0; w < a; ++w) {
-    var P = t[w];
-    if (P > 255) {
-      var j = P >> 18 & 31;
-      we(e, c, E[j + 257]), c += x[j + 257], j > 7 && (_(e, c, P >> 23 & 31), c += Fe[j]);
-      var K = P & 31;
-      we(e, c, D[K]), c += A[K], K > 3 && (we(e, c, P >> 5 & 8191), c += Re[K]);
-    } else
-      we(e, c, E[P]), c += x[P];
-  }
-  return we(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 i = o.z || r.length, a = new R(t + i + 5 * (1 + Math.ceil(i / 7e3)) + s), l = a.subarray(t, a.length - s), f = o.l, c = (o.r || 0) & 7;
-  if (e) {
-    c && (l[0] = o.r >> 3);
-    for (var u = pr[e - 1], h = u >> 13, v = u & 8191, d = (1 << n) - 1, g = o.p || new q(32768), b = o.h || new q(d + 1), I = Math.ceil(n / 3), y = 2 * I, S = function(Te) {
-      return (r[Te] ^ r[Te + 1] << I ^ r[Te + 2] << y) & d;
-    }, B = new Ge(25e3), p = new q(288), C = new q(32), F = 0, w = 0, k = o.i || 0, M = 0, T = o.w || 0, O = 0; k + 2 < i; ++k) {
-      var ee = S(k), U = k & 32767, W = b[ee];
-      if (g[U] = W, b[ee] = U, T <= k) {
-        var E = i - k;
-        if ((F > 7e3 || M > 24576) && (E > 423 || !f)) {
-          c = Qe(r, l, 0, B, p, C, w, M, O, k - O, c), M = F = w = 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, he = v, G = U - W & 32767;
-        if (E > 2 && ee == S(k - G))
-          for (var Z = Math.min(h, E) - 1, L = Math.min(32767, k), j = Math.min(258, E); G <= L && --he && U != W; ) {
-            if (r[k + D] == r[k + D - G]) {
-              for (var P = 0; P < j && r[k + P] == r[k + P - G]; ++P)
-                ;
-              if (P > D) {
-                if (D = P, A = G, P > Z)
-                  break;
-                for (var K = Math.min(G, P - 2), ae = 0, x = 0; x < K; ++x) {
-                  var ce = k - G + x & 32767, ye = g[ce], xe = ce - ye & 32767;
-                  xe > ae && (ae = xe, W = ce);
-                }
-              }
-            }
-            U = W, W = g[U], G += U - W & 32767;
-          }
-        if (A) {
-          B[M++] = 268435456 | De[D] << 18 | Je[A];
-          var ve = De[D] & 31, de = Je[A] & 31;
-          w += Fe[ve] + Re[de], ++p[257 + ve], ++C[de], T = k + D, ++F;
-        } else
-          B[M++] = r[k], ++p[r[k]];
-      }
-    }
-    for (k = Math.max(k, T); k < i; ++k)
-      B[M++] = r[k], ++p[r[k]];
-    c = Qe(r, l, f, B, p, C, w, M, O, k - O, c), f || (o.r = c & 7 | l[c / 8 | 0] << 3, c -= 7, o.h = b, o.p = g, o.i = k, o.w = T);
-  } else {
-    for (var k = o.w || 0; k < i + f; k += 65535) {
-      var fe = k + 65535;
-      fe >= i && (l[c / 8 | 0] = f, fe = i), c = ar(l, c + 1, r.subarray(k, fe));
-    }
-    o.i = i;
-  }
-  return me(a, 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), i = new R(o.length + r.length);
-    i.set(o), i.set(r, o.length), r = i, 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], i = e + s, a = t;
-    Array.isArray(o) && (a = fr(t, o[1]), o = o[0]), ArrayBuffer.isView(o) ? n[i] = [o, a] : (n[i += "/"] = [new R(0), a], ur(o, i, 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, i = function(f) {
-    s[o++] = f;
-  }, n = 0; n < t; ++n) {
-    if (o + 5 > s.length) {
-      var a = new R(o + 8 + (t - n << 1));
-      a.set(s), s = a;
-    }
-    var l = r.charCodeAt(n);
-    l < 128 || e ? i(l) : l < 2048 ? (i(192 | l >> 6), i(128 | l & 63)) : l > 55295 && l < 57344 ? (l = 65536 + (l & 1047552) | r.charCodeAt(++n) & 1023, i(240 | l >> 18), i(128 | l >> 12 & 63), i(128 | l >> 6 & 63), i(128 | l & 63)) : (i(224 | l >> 12), i(128 | l >> 6 & 63), i(128 | l & 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)), i = e + 46 + t, a = Ur(r, i, s, n, V(r, e + 20), V(r, e + 24), V(r, e + 42)), l = a[0], f = a[1], c = a[2];
-  return [Q(r, e + 10), l, f, o, i + s + Q(r, e + 32), c];
-}, Ur = function(r, e, n, t, s, o, i) {
-  var a = s == 4294967295, l = o == 4294967295, f = i == 4294967295, c = e + n, u = a + l + f;
-  if (t && u) {
-    for (; e + 4 < c; e += 4 + Q(r, e + 2))
-      if (Q(r, e) == 1)
-        return [
-          a ? ze(r, e + 4 + 8 * l) : s,
-          l ? ze(r, e + 4) : o,
-          f ? ze(r, e + 4 + 8 * (l + a)) : i,
-          1
-        ];
-    t < 2 && N(13);
-  }
-  return [s, o, i, 0];
-}, Le = 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, i, a) {
-  var l = t.length, f = n.extra, c = a && a.length, u = Le(f);
-  z(r, e, i != null ? 33639248 : 67324752), e += 4, i != 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 h = new Date(n.mtime == null ? Date.now() : n.mtime), v = h.getFullYear() - 1980;
-  if ((v < 0 || v > 119) && N(10), z(r, e, v << 25 | h.getMonth() + 1 << 21 | h.getDate() << 16 | h.getHours() << 11 | h.getMinutes() << 5 | h.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, l), z(r, e + 14, u), e += 16, i != null && (z(r, e, c), z(r, e + 6, n.attrs), z(r, e + 10, i), e += 14), r.set(t, e), e += l, u)
-    for (var d in f) {
-      var g = f[d], b = g.length;
-      z(r, e, +d), z(r, e + 2, b), r.set(g, e + 4), e += 4 + b;
-    }
-  return c && (r.set(a, e), e += c), e;
-}, Lr = 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 i in n) {
-    var a = n[i], l = a[0], f = a[1], c = f.level == 0 ? 0 : 8, u = Ze(i), h = u.length, v = f.comment, d = v && Ze(v), g = d && d.length, b = Le(f.extra);
-    h > 65535 && N(11);
-    var I = c ? zr(l, f) : l, y = I.length, S = Er();
-    S.p(l), t.push(fr(f, {
-      size: l.length,
-      crc: S.d(),
-      c: I,
-      f: u,
-      m: d,
-      u: h != i.length || d && v.length != g,
-      o: s,
-      compression: c
-    })), s += 30 + h + b + y, o += 76 + 2 * (h + b) + (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 w = 30 + u.f.length + Le(u.extra);
-    B.set(u.c, u.o + w), _e(B, s, u, u.f, u.u, u.c.length, u.o, u.m), s += 16 + w + (u.m ? u.m.length : 0);
-  }
-  return Lr(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), i = V(r, t - 20) == 117853008;
-  if (i) {
-    var a = V(r, t - 12);
-    i = V(r, a) == 101075792, i && (s = V(r, a + 32), o = V(r, a + 48));
-  }
-  for (var l = e && e.filter, f = 0; f < s; ++f) {
-    var c = $r(r, o, i), u = c[0], h = c[1], v = c[2], d = c[3], g = c[4], b = c[5], I = Hr(r, b);
-    o = g, (!l || l({
-      name: d,
-      size: h,
-      originalSize: v,
-      compression: u
-    })) && (u ? u == 8 ? n[d] = Or(r.subarray(I, I + h), { out: new R(v) }) : N(14, "unknown compression type " + u) : n[d] = me(r, I, I + h));
-  }
-  return n;
-}
-export {
-  ne as A,
-  je as B,
-  hr as C,
-  Qr as D,
-  Xr as E,
-  Ce as F,
-  Dr as a,
-  en as b,
-  vr as c,
-  Zr as d,
-  Gr as e,
-  dr as f,
-  yr as g,
-  $ as h,
-  Vr as i,
-  tr as j,
-  Jr as k,
-  Se as l,
-  _r as m,
-  Yr as n,
-  qe as o,
-  nr as p,
-  mr as q,
-  jr as r,
-  Ze as s,
-  Ne as t,
-  nn as u,
-  gr as v,
-  rr as w,
-  Kr as x,
-  qr as y,
-  rn as z
-};