@poe-platform/safe-bash 0.1.806 → 0.1.807

package/dist/safe-bash/command-chunks/{biff-AU4VGVMD-6EQ64QPG.js → biff-YBHP7ZES-M7TU7NA5.js}

@@ -18,81 +18,81 @@ import {
 import "./chunk-WHWIZ2B7.js";
 import "./chunk-65DS4IOB.js";
 
-// packages/safe-bash-command-ssconvert/dist/chunks/biff-AU4VGVMD.js
+// packages/safe-bash-command-ssconvert/dist/chunks/biff-YBHP7ZES.js
 import { SsconvertError as be } from "../../spreadsheet-engine/contracts.js";
 import { SsconvertError as Fe } from "../../spreadsheet-engine/contracts.js";
-import { SsconvertError as Le } from "../../spreadsheet-engine/contracts.js";
-import { SsconvertError as $e } from "../../spreadsheet-engine/contracts.js";
-import { SsconvertError as Kt } from "../../spreadsheet-engine/contracts.js";
+import { SsconvertError as De } from "../../spreadsheet-engine/contracts.js";
+import { SsconvertError as Ke } from "../../spreadsheet-engine/contracts.js";
+import { SsconvertError as Yt } from "../../spreadsheet-engine/contracts.js";
 import { SsconvertError as Ee } from "../../spreadsheet-engine/contracts.js";
-import { SsconvertError as nt } from "../../spreadsheet-engine/contracts.js";
-import { exportOptionPairs as ar } from "../../spreadsheet-engine/cli/export-options.js";
+import { SsconvertError as rt } from "../../spreadsheet-engine/contracts.js";
+import { exportOptionPairs as fr } from "../../spreadsheet-engine/cli/export-options.js";
 import { SsconvertError as ke } from "../../spreadsheet-engine/contracts.js";
-import { parseExpression as Zt } from "../../spreadsheet-engine/formulas/parser.js";
-import { functionDescriptors as Un } from "../../spreadsheet-engine/formulas/function-descriptors.js";
-import { excelGrammar as On, gnumericGrammar as it } from "../../spreadsheet-engine/formulas/conventions.js";
-import { quoteFormulaString as st } from "../../spreadsheet-engine/formulas/serialization.js";
-import { SsconvertError as Nt } from "../../spreadsheet-engine/contracts.js";
-import { SsconvertError as at } from "../../spreadsheet-engine/contracts.js";
-import { gnumericGrammar as Ln } from "../../spreadsheet-engine/formulas/conventions.js";
-import { quoteFormulaString as Dn } from "../../spreadsheet-engine/formulas/serialization.js";
-import { SsconvertError as We } from "../../spreadsheet-engine/contracts.js";
-import { formatA1 as _n } from "../../spreadsheet-ast/model.js";
-import { parseExpression as Pn } from "../../spreadsheet-engine/formulas/parser.js";
+import { parseExpression as Jt } from "../../spreadsheet-engine/formulas/parser.js";
+import { functionDescriptors as On } from "../../spreadsheet-engine/formulas/function-descriptors.js";
+import { excelGrammar as Mn, gnumericGrammar as st } from "../../spreadsheet-engine/formulas/conventions.js";
+import { quoteFormulaString as ot } from "../../spreadsheet-engine/formulas/serialization.js";
+import { SsconvertError as vt } from "../../spreadsheet-engine/contracts.js";
+import { SsconvertError as ft } from "../../spreadsheet-engine/contracts.js";
+import { gnumericGrammar as Dn } from "../../spreadsheet-engine/formulas/conventions.js";
+import { quoteFormulaString as _n } from "../../spreadsheet-engine/formulas/serialization.js";
 import { SsconvertError as je } from "../../spreadsheet-engine/contracts.js";
-import { DEFAULT_SHEET_SIZE as ft } from "../../spreadsheet-ast/index.js";
-import { SsconvertError as Gn } from "../../spreadsheet-engine/contracts.js";
-import { parseExpression as Hn } from "../../spreadsheet-engine/formulas/parser.js";
-import { gnumericGrammar as Vn } from "../../spreadsheet-engine/formulas/conventions.js";
-import { quoteFormulaString as Xn } from "../../spreadsheet-engine/formulas/serialization.js";
-import { SsconvertError as ln } from "../../spreadsheet-engine/contracts.js";
-import { formatA1 as ct } from "../../spreadsheet-ast/index.js";
-import { SsconvertError as Ce } from "../../spreadsheet-engine/contracts.js";
+import { formatA1 as Pn } from "../../spreadsheet-ast/model.js";
+import { parseExpression as Gn } from "../../spreadsheet-engine/formulas/parser.js";
+import { SsconvertError as ze } from "../../spreadsheet-engine/contracts.js";
+import { DEFAULT_SHEET_SIZE as lt } from "../../spreadsheet-ast/index.js";
+import { SsconvertError as Hn } from "../../spreadsheet-engine/contracts.js";
+import { parseExpression as Vn } from "../../spreadsheet-engine/formulas/parser.js";
+import { gnumericGrammar as Xn } from "../../spreadsheet-engine/formulas/conventions.js";
+import { quoteFormulaString as Wn } from "../../spreadsheet-engine/formulas/serialization.js";
+import { SsconvertError as cn } from "../../spreadsheet-engine/contracts.js";
+import { formatA1 as ut } from "../../spreadsheet-ast/index.js";
+import { SsconvertError as Ue } from "../../spreadsheet-engine/contracts.js";
 import { SsconvertError as Ie } from "../../spreadsheet-engine/contracts.js";
-import { encodeText as Zn } from "../../spreadsheet-engine/encoding/encode.js";
+import { encodeText as Jn } from "../../spreadsheet-engine/encoding/encode.js";
 import { SsconvertError as le } from "../../spreadsheet-engine/contracts.js";
-import { parseExpression as Wn } from "../../spreadsheet-engine/formulas/parser.js";
-import { parseNamedExpression as jn } from "../../spreadsheet-engine/formulas/named-expressions.js";
-import { foldSheetName as Ue } from "../../spreadsheet-ast/case-fold.js";
-import { expandIndexSheetAreas as zn } from "../../spreadsheet-engine/formulas/index-sheet-areas.js";
-import { SsconvertError as hn } from "../../spreadsheet-engine/contracts.js";
-import { cellValueFormat as qn } from "../../spreadsheet-engine/workbook/value-format.js";
-import { metadataNode as Qn } from "../../spreadsheet-engine/codecs/xlsx-write-support.js";
-import { SsconvertError as ht } from "../../spreadsheet-engine/contracts.js";
-import { parseA1 as pt } from "../../spreadsheet-ast/index.js";
-import { metadataNode as pn } from "../../spreadsheet-engine/codecs/xlsx-write-support.js";
-import { singleByteTables as Jn } from "../../spreadsheet-engine/encoding/tables.js";
-import { SsconvertError as Oe } from "../../spreadsheet-engine/contracts.js";
-import { SsconvertError as gt } from "../../spreadsheet-engine/contracts.js";
-import { singleByteTables as rr } from "../../spreadsheet-engine/encoding/tables.js";
-import { biffDbcsTables as ir } from "../../spreadsheet-engine/encoding/biff-dbcs-tables.js";
-function Ge(s, e, r) {
-  let n2 = new h(s);
-  n2.check(0, 28), (n2.u16(0) !== 65534 || n2.u16(2) > 1) && n("invalid property-set header");
-  let t = n2.u32(24), u = 28 + t * 20;
-  n2.check(28, t * 20), e(t);
+import { parseExpression as jn } from "../../spreadsheet-engine/formulas/parser.js";
+import { parseNamedExpression as zn } from "../../spreadsheet-engine/formulas/named-expressions.js";
+import { foldSheetName as Oe } from "../../spreadsheet-ast/case-fold.js";
+import { expandIndexSheetAreas as $n } from "../../spreadsheet-engine/formulas/index-sheet-areas.js";
+import { SsconvertError as pn } from "../../spreadsheet-engine/contracts.js";
+import { cellValueFormat as Qn } from "../../spreadsheet-engine/workbook/value-format.js";
+import { metadataNode as Zn } from "../../spreadsheet-engine/codecs/xlsx-write-support.js";
+import { SsconvertError as pt } from "../../spreadsheet-engine/contracts.js";
+import { parseA1 as wt } from "../../spreadsheet-ast/index.js";
+import { metadataNode as wn } from "../../spreadsheet-engine/codecs/xlsx-write-support.js";
+import { singleByteTables as er } from "../../spreadsheet-engine/encoding/tables.js";
+import { SsconvertError as Me } from "../../spreadsheet-engine/contracts.js";
+import { SsconvertError as xt } from "../../spreadsheet-engine/contracts.js";
+import { singleByteTables as ir } from "../../spreadsheet-engine/encoding/tables.js";
+import { biffDbcsTables as sr } from "../../spreadsheet-engine/encoding/biff-dbcs-tables.js";
+function He(s, e, n2) {
+  let r = new h(s);
+  r.check(0, 28), (r.u16(0) !== 65534 || r.u16(2) > 1) && n("invalid property-set header");
+  let t = r.u32(24), u = 28 + t * 20;
+  r.check(28, t * 20), e(t);
   let i = [];
   for (let h2 = 0; h2 < t; h2++) {
-    let g = 28 + h2 * 20, a = n2.u32(g + 16);
+    let g = 28 + h2 * 20, a = r.u32(g + 16);
     (a < u || a % 4) && n("invalid property section offset");
-    let l = n2.u32(a);
-    (l < 8 || l % 4) && n("invalid property section size"), n2.check(a, l);
-    let d = Array.from(n2.slice(g, 16), (m2) => m2.toString(16).padStart(2, "0")).join("");
+    let l = r.u32(a);
+    (l < 8 || l % 4) && n("invalid property section size"), r.check(a, l);
+    let d = Array.from(r.slice(g, 16), (m2) => m2.toString(16).padStart(2, "0")).join("");
     i.push({ guid: d, offset: a, end: a + l });
   }
-  r(t * Math.ceil(Math.log2(t + 1))), i.sort((h2, g) => h2.offset - g.offset);
+  n2(t * Math.ceil(Math.log2(t + 1))), i.sort((h2, g) => h2.offset - g.offset);
   for (let h2 = 1; h2 < i.length; h2++) i[h2].offset < i[h2 - 1].end && n("overlapping property sections");
   return i;
 }
-function He(s, e, r) {
-  let n2 = s.u32(4);
-  s.check(8, n2 * 8), e(n2);
+function Ve(s, e, n2) {
+  let r = s.u32(4);
+  s.check(8, r * 8), e(r);
   let t = [], u = /* @__PURE__ */ new Set();
-  for (let h2 = 0; h2 < n2; h2++) {
+  for (let h2 = 0; h2 < r; h2++) {
     let g = s.u32(8 + h2 * 8), a = s.u32(12 + h2 * 8);
-    (a < 8 + n2 * 8 || a % 4 || a > s.bytes.length - 4) && n("invalid property offset"), u.has(g) && n("duplicate property ID"), u.add(g), t.push({ id: g, at: a });
+    (a < 8 + r * 8 || a % 4 || a > s.bytes.length - 4) && n("invalid property offset"), u.has(g) && n("duplicate property ID"), u.add(g), t.push({ id: g, at: a });
   }
-  r(n2 * Math.ceil(Math.log2(n2 + 1))), t.sort((h2, g) => h2.at - g.at);
+  n2(r * Math.ceil(Math.log2(r + 1))), t.sort((h2, g) => h2.at - g.at);
   let i = /* @__PURE__ */ new Map();
   for (let h2 = 0; h2 < t.length; h2++) {
     let { id: g, at: a } = t[h2], l = t[h2 + 1]?.at ?? s.bytes.length;
@@ -101,153 +101,153 @@ function He(s, e, r) {
   return i;
 }
 var me = { summary: "e0859ff2f94f6810ab9108002b27b3d9", document: "02d5cdd59c2e1b10939708002b2cf9ae", custom: "05d5cdd59c2e1b10939708002b2cf9ae" };
-var { summary: It, document: Nn, custom: kt } = me;
-var Ve = /* @__PURE__ */ new Map([[It, /* @__PURE__ */ new Map([[2, "dc:title"], [3, "dc:subject"], [4, "meta:initial-creator"], [5, "dc:keywords"], [6, "dc:description"], [7, "meta:template"], [8, "dc:creator"], [9, "meta:editing-cycles"], [10, "meta:editing-duration"], [11, "meta:print-date"], [12, "meta:creation-date"], [13, "dc:date"], [14, "gsf:page-count"], [15, "gsf:word-count"], [16, "gsf:character-count"], [18, "meta:generator"], [19, "gsf:security"]])], [Nn, /* @__PURE__ */ new Map([[2, "gsf:category"], [14, "gsf:manager"], [15, "dc:publisher"]])]]);
-function Ke(s) {
+var { summary: Rt, document: vn, custom: It } = me;
+var Xe = /* @__PURE__ */ new Map([[Rt, /* @__PURE__ */ new Map([[2, "dc:title"], [3, "dc:subject"], [4, "meta:initial-creator"], [5, "dc:keywords"], [6, "dc:description"], [7, "meta:template"], [8, "dc:creator"], [9, "meta:editing-cycles"], [10, "meta:editing-duration"], [11, "meta:print-date"], [12, "meta:creation-date"], [13, "dc:date"], [14, "gsf:page-count"], [15, "gsf:word-count"], [16, "gsf:character-count"], [18, "meta:generator"], [19, "gsf:security"]])], [vn, /* @__PURE__ */ new Map([[2, "gsf:category"], [14, "gsf:manager"], [15, "dc:publisher"]])]]);
+function Ye(s) {
   return s > 0 && s <= 32 || s >= 8192 && s <= 8203 || s === 8232 || s === 8233;
 }
-async function Xe(s, e, r, n2, t, u) {
+async function We(s, e, n2, r, t, u) {
   let i = /* @__PURE__ */ Object.create(null), h2 = 0, g = (l) => {
-    if (n2(l), h2 += l, h2 > (e.limits.workbookNodes ?? e.limits.inputBytes)) throw new $e("resource-limit", "ssconvert BIFF property node limit exceeded");
+    if (r(l), h2 += l, h2 > (e.limits.workbookNodes ?? e.limits.inputBytes)) throw new Ke("resource-limit", "ssconvert BIFF property node limit exceeded");
   }, a = (l, d, m2) => {
     let f = l.u32(d), o = m2 === 1200 ? 2 : 1, E = f * o;
-    if (f || n("empty property string buffer"), l.check(d + 4, E), (f - 1) * 3 > (e.limits.workbookTextBytes ?? e.limits.inputBytes)) throw new $e("resource-limit", "ssconvert BIFF property text limit exceeded");
-    n2(E);
+    if (f || n("empty property string buffer"), l.check(d + 4, E), (f - 1) * 3 > (e.limits.workbookTextBytes ?? e.limits.inputBytes)) throw new Ke("resource-limit", "ssconvert BIFF property text limit exceeded");
+    r(E);
     let k = d + 4 + E;
-    for (let R2 = k - o; R2 < k; R2++) l.u8(R2) && n("unterminated property string");
-    let S = l.slice(d + 4, E - o), A;
+    for (let S = k - o; S < k; S++) l.u8(S) && n("unterminated property string");
+    let N = l.slice(d + 4, E - o), A;
     if (m2 === 1200 || m2 === 65001) try {
-      A = new TextDecoder(m2 === 1200 ? "utf-16le" : "utf-8", { fatal: true, ignoreBOM: true }).decode(S);
+      A = new TextDecoder(m2 === 1200 ? "utf-16le" : "utf-8", { fatal: true, ignoreBOM: true }).decode(N);
     } catch {
       n("invalid property string encoding");
     }
-    else A = m(S, m2);
-    return { value: r(A), end: o === 2 ? Math.ceil(k / 4) * 4 : k };
+    else A = m(N, m2);
+    return { value: n2(A), end: o === 2 ? Math.ceil(k / 4) * 4 : k };
   };
   for (let l of ["SummaryInformation", "DocumentSummaryInformation"]) {
     let d = l, m2 = s.get(l);
     if (!m2) {
-      for (let [S, A] of s) if (n2(1), S.toUpperCase() === l.toUpperCase()) {
-        d = S, m2 = A;
+      for (let [N, A] of s) if (r(1), N.toUpperCase() === l.toUpperCase()) {
+        d = N, m2 = A;
         break;
       }
     }
     if (!m2) continue;
-    n2(m2.length);
-    let f = new h(m2), o = Ge(m2, g, n2), E = false, k = [];
-    for (let { guid: S, offset: A, end: R2 } of o) {
-      if (!Ve.has(S) && S !== kt) {
+    r(m2.length);
+    let f = new h(m2), o = He(m2, g, r), E = false, k = [];
+    for (let { guid: N, offset: A, end: S } of o) {
+      if (!Xe.has(N) && N !== It) {
         E = true;
         continue;
       }
-      let B = He(new h(f.slice(A, R2 - A)), g, n2), N = B.get(1), w2 = 1252;
-      N && (N.u32(0) !== 2 && n("invalid property codepage type"), w2 = N.u16(4));
+      let B = Ve(new h(f.slice(A, S - A)), g, r), F = B.get(1), p = 1252;
+      F && (F.u32(0) !== 2 && n("invalid property codepage type"), p = F.u16(4));
       let D = /* @__PURE__ */ new Map(), x = B.get(0);
       try {
-        if (x && S === kt) {
+        if (x && N === It) {
           let b = x.u32(0);
           x.check(4, b * 9), g(b);
           let O = 4;
           for (let C2 = 0; C2 < b; C2++) {
-            let v = x.u32(O), F = a(x, O + 4, w2);
-            (v < 2 || D.has(v) || !F.value) && n("invalid property dictionary entry"), D.set(v, F.value), O = F.end;
+            let v = x.u32(O), R2 = a(x, O + 4, p);
+            (v < 2 || D.has(v) || !R2.value) && n("invalid property dictionary entry"), D.set(v, R2.value), O = R2.end;
           }
         }
       } catch (b) {
-        if (!(b instanceof $e) || b.code !== "unsupported-feature") throw b;
+        if (!(b instanceof Ke) || b.code !== "unsupported-feature") throw b;
         E = true;
         continue;
       }
       for (let [b, O] of B) {
         if (e.signal.throwIfAborted(), b < 2) continue;
-        let C2 = S === kt ? D.get(b) : Ve.get(S)?.get(b);
+        let C2 = N === It ? D.get(b) : Xe.get(N)?.get(b);
         if (C2 === void 0 || Object.hasOwn(i, C2)) {
           E = true;
           continue;
         }
-        let v, F = O.u32(0);
+        let v, R2 = O.u32(0);
         try {
-          if (F === 30 || F === 31) v = a(O, 4, F === 31 ? 1200 : w2).value;
-          else if (F === 3) v = O.u32(4) | 0;
-          else if (F === 5) v = O.f64(4), Number.isFinite(v) || n("nonfinite property value");
-          else if (F === 11) v = O.u16(4) !== 0;
-          else if (F === 64) {
+          if (R2 === 30 || R2 === 31) v = a(O, 4, R2 === 31 ? 1200 : p).value;
+          else if (R2 === 3) v = O.u32(4) | 0;
+          else if (R2 === 5) v = O.f64(4), Number.isFinite(v) || n("nonfinite property value");
+          else if (R2 === 11) v = O.u16(4) !== 0;
+          else if (R2 === 64) {
             let M = BigInt(O.u32(4)) + (BigInt(O.u32(8)) << 32n);
-            if (S === It && b === 10) {
-              let _ = (M % 10000000n).toString().padStart(7, "0"), p = _.length;
-              for (; p && _[p - 1] === "0"; ) p--;
-              v = `PT${M / 600000000n}M${M / 10000000n % 60n}${p ? "." + _.slice(0, p) : ""}S`;
+            if (N === Rt && b === 10) {
+              let _ = (M % 10000000n).toString().padStart(7, "0"), w2 = _.length;
+              for (; w2 && _[w2 - 1] === "0"; ) w2--;
+              v = `PT${M / 600000000n}M${M / 10000000n % 60n}${w2 ? "." + _.slice(0, w2) : ""}S`;
             } else v = new Date(Number(M / 10000n) - 116444736e5).toISOString(), M % 10000n && (E = true);
-            r(v);
-          } else if (F === 7) {
+            n2(v);
+          } else if (R2 === 7) {
             let M = O.f64(4);
-            (!Number.isFinite(M) || M <= -657435 || M >= 2958466) && n("invalid OLE property date"), v = new Date(-22091616e5 + Math.round((Math.trunc(M) + Math.abs(M % 1)) * 864e5)).toISOString(), r(v);
+            (!Number.isFinite(M) || M <= -657435 || M >= 2958466) && n("invalid OLE property date"), v = new Date(-22091616e5 + Math.round((Math.trunc(M) + Math.abs(M % 1)) * 864e5)).toISOString(), n2(v);
           }
         } catch (M) {
-          if (!(M instanceof $e) || M.code !== "unsupported-feature") throw M;
+          if (!(M instanceof Ke) || M.code !== "unsupported-feature") throw M;
         }
         if (v === void 0) {
           E = true;
           continue;
         }
-        if (S === It && b === 5 && typeof v == "string") {
+        if (N === Rt && b === 5 && typeof v == "string") {
           let M = 1;
           for (let _ of v) _ === "," && M++;
-          g(M), n2(v.length), v = v.split(",").map((_) => {
-            let p = 0, c = _.length;
-            for (; p < c && Ke(_.charCodeAt(p)); ) p++;
-            for (; c > p && Ke(_.charCodeAt(c - 1)); ) c--;
-            return _.slice(p, c);
+          g(M), r(v.length), v = v.split(",").map((_) => {
+            let w2 = 0, c = _.length;
+            for (; w2 < c && Ye(_.charCodeAt(w2)); ) w2++;
+            for (; c > w2 && Ye(_.charCodeAt(c - 1)); ) c--;
+            return _.slice(w2, c);
           }).filter(Boolean);
         }
-        r(C2), i[C2] = v, k.push([A, b, C2]), u?.({ stream: d, section: A, id: b, key: C2, value: v });
+        n2(C2), i[C2] = v, k.push([A, b, C2]), u?.({ stream: d, section: A, id: b, key: C2, value: v });
       }
     }
     if (E && t) {
-      if (m2.length * 2 > (e.limits.workbookTextBytes ?? e.limits.inputBytes * 2)) throw new $e("resource-limit", "ssconvert BIFF property retention limit exceeded");
-      let S = r(Array.from(m2, (A) => A.toString(16).padStart(2, "0")).join(""));
-      t.push({ source: "biff", kind: "ole-properties", disposition: "retained", data: { stream: d, bytes: S, modeled: k } }), await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `BIFF property stream ${d.slice(1)} retained with uninterpreted values` });
+      if (m2.length * 2 > (e.limits.workbookTextBytes ?? e.limits.inputBytes * 2)) throw new Ke("resource-limit", "ssconvert BIFF property retention limit exceeded");
+      let N = n2(Array.from(m2, (A) => A.toString(16).padStart(2, "0")).join(""));
+      t.push({ source: "biff", kind: "ole-properties", disposition: "retained", data: { stream: d, bytes: N, modeled: k } }), await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `BIFF property stream ${d.slice(1)} retained with uninterpreted values` });
     }
   }
   return i;
 }
-function Xt(s, e, r) {
-  let n2, t = 0, u = /* @__PURE__ */ new Set(), i = (h2) => {
-    if (r(h2), t += h2, t > (e.limits.workbookNodes ?? e.limits.inputBytes)) throw new Le("resource-limit", "ssconvert encrypted BIFF property node limit exceeded");
+function Wt(s, e, n2) {
+  let r, t = 0, u = /* @__PURE__ */ new Set(), i = (h2) => {
+    if (n2(h2), t += h2, t > (e.limits.workbookNodes ?? e.limits.inputBytes)) throw new De("resource-limit", "ssconvert encrypted BIFF property node limit exceeded");
   };
   for (let [h2, g] of s ?? []) {
-    r(h2.length);
+    n2(h2.length);
     let a = h2.toUpperCase();
     if (["ENCRYPTION", "SUMMARYINFORMATION", "DOCUMENTSUMMARYINFORMATION"].includes(a)) {
       if (u.has(a) && n("duplicate encrypted property stream"), u.add(a), a === "ENCRYPTION") {
-        n2 = g;
+        r = g;
         continue;
       }
       if (g.length) {
-        a === "SUMMARYINFORMATION" && n("ambiguous plaintext document properties"), r(g.length);
-        for (let l of Ge(g, i, r)) {
+        a === "SUMMARYINFORMATION" && n("ambiguous plaintext document properties"), n2(g.length);
+        for (let l of He(g, i, n2)) {
           [me.document, me.custom].includes(l.guid) || n("ambiguous plaintext document properties");
-          let d = He(new h(g.subarray(l.offset, l.end)), i, r);
+          let d = Ve(new h(g.subarray(l.offset, l.end)), i, n2);
           for (let [m2, f] of d) (m2 > 1 || m2 === 0 && f.u32(0) !== 0 || m2 === 1 && f.u32(0) !== 2) && n("ambiguous plaintext document properties");
         }
       }
     }
   }
-  if (!n2) throw new Le("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook ancillary properties require the encryption stream");
-  if (n2.length > e.limits.inputBytes) throw new Le("resource-limit", "ssconvert encrypted BIFF property input limit exceeded");
-  return new h(n2).check(0, 8), n2;
+  if (!r) throw new De("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook ancillary properties require the encryption stream");
+  if (r.length > e.limits.inputBytes) throw new De("resource-limit", "ssconvert encrypted BIFF property input limit exceeded");
+  return new h(r).check(0, 8), r;
 }
-function Wt(s, e, r, n2) {
+function jt(s, e, n2, r) {
   let t = [], u = /* @__PURE__ */ new Map(), i = false, h2 = () => {
     i = true;
     for (let l of t) l.fill(0);
     u.clear();
   };
-  r.own(h2);
+  n2.own(h2);
   let g = () => {
-    if (r.signal.throwIfAborted(), i) throw new Le("invalid-request", "Encrypted BIFF property reader disposed");
+    if (n2.signal.throwIfAborted(), i) throw new De("invalid-request", "Encrypted BIFF property reader disposed");
   }, a = (l, d) => {
-    g(), n2(l.length * 2 + 320);
+    g(), r(l.length * 2 + 320);
     let m2 = l.slice();
     t.push(m2);
     let f = e(d, l.length);
@@ -260,129 +260,129 @@ function Wt(s, e, r, n2) {
     return m2;
   };
   try {
-    if (g(), s.length > r.limits.inputBytes) throw new Le("resource-limit", "ssconvert encrypted BIFF property input limit exceeded");
+    if (g(), s.length > n2.limits.inputBytes) throw new De("resource-limit", "ssconvert encrypted BIFF property input limit exceeded");
     let l = new h(s), d = new h(a(l.slice(0, 8), 0)), m2 = d.u32(0), f = d.u32(4);
     d.bytes.fill(0), (m2 < 8 || f < 4) && n("invalid encrypted property descriptor range"), l.check(m2, f);
     let o = new h(a(l.slice(m2, f), 0)), E = o.u32(0);
-    if (E > Math.floor((f - 4) / 18) && n("invalid encrypted property descriptor count"), E > (r.limits.workbookNodes ?? r.limits.inputBytes)) throw new Le("resource-limit", "ssconvert encrypted BIFF property node limit exceeded");
-    n2(E);
-    let k = 4, S = 0, A = [], R2 = /* @__PURE__ */ new Set();
-    for (let N = 0; N < E; N++) {
-      r.signal.throwIfAborted(), o.check(k, 18);
-      let w2 = o.u32(k), D = o.u32(k + 4), x = o.u16(k + 8), b = o.u8(k + 10);
-      if ((o.u8(k + 11) !== 1 || o.u32(k + 12) !== 0) && n("invalid encrypted property descriptor flags"), k += 16, (!b || b > 31) && n("invalid encrypted property stream name"), o.check(k, (b + 1) * 2), n2(b), o.u16(k + b * 2) !== 0 && n("unterminated encrypted property stream name"), S += b * 3, S > (r.limits.workbookTextBytes ?? r.limits.inputBytes)) throw new Le("resource-limit", "ssconvert encrypted BIFF property text limit exceeded");
+    if (E > Math.floor((f - 4) / 18) && n("invalid encrypted property descriptor count"), E > (n2.limits.workbookNodes ?? n2.limits.inputBytes)) throw new De("resource-limit", "ssconvert encrypted BIFF property node limit exceeded");
+    r(E);
+    let k = 4, N = 0, A = [], S = /* @__PURE__ */ new Set();
+    for (let F = 0; F < E; F++) {
+      n2.signal.throwIfAborted(), o.check(k, 18);
+      let p = o.u32(k), D = o.u32(k + 4), x = o.u16(k + 8), b = o.u8(k + 10);
+      if ((o.u8(k + 11) !== 1 || o.u32(k + 12) !== 0) && n("invalid encrypted property descriptor flags"), k += 16, (!b || b > 31) && n("invalid encrypted property stream name"), o.check(k, (b + 1) * 2), r(b), o.u16(k + b * 2) !== 0 && n("unterminated encrypted property stream name"), N += b * 3, N > (n2.limits.workbookTextBytes ?? n2.limits.inputBytes)) throw new De("resource-limit", "ssconvert encrypted BIFF property text limit exceeded");
       let C2;
       try {
         C2 = new TextDecoder("utf-16le", { fatal: true, ignoreBOM: true }).decode(o.slice(k, b * 2));
       } catch {
         n("invalid encrypted property stream name");
       }
-      (C2.includes("\0") || R2.has(C2.toUpperCase())) && n("duplicate or invalid encrypted property stream name"), R2.add(C2.toUpperCase()), k += (b + 1) * 2, l.check(w2, D), (w2 < 8 || w2 < m2 + f && w2 + D > m2) && n("overlapping encrypted property ranges"), A.push({ offset: w2, size: D, block: x, name: C2 });
+      (C2.includes("\0") || S.has(C2.toUpperCase())) && n("duplicate or invalid encrypted property stream name"), S.add(C2.toUpperCase()), k += (b + 1) * 2, l.check(p, D), (p < 8 || p < m2 + f && p + D > m2) && n("overlapping encrypted property ranges"), A.push({ offset: p, size: D, block: x, name: C2 });
     }
-    k !== f && n("invalid encrypted property descriptor size"), o.bytes.fill(0), n2(E * Math.ceil(Math.log2(E + 1)));
-    let B = [...A].sort((N, w2) => N.offset - w2.offset);
-    for (let N = 1; N < B.length; N++) B[N].offset < B[N - 1].offset + B[N - 1].size && n("overlapping encrypted property payloads");
-    for (let N of A) u.set(N.name, a(l.slice(N.offset, N.size), N.block));
+    k !== f && n("invalid encrypted property descriptor size"), o.bytes.fill(0), r(E * Math.ceil(Math.log2(E + 1)));
+    let B = [...A].sort((F, p) => F.offset - p.offset);
+    for (let F = 1; F < B.length; F++) B[F].offset < B[F - 1].offset + B[F - 1].size && n("overlapping encrypted property payloads");
+    for (let F of A) u.set(F.name, a(l.slice(F.offset, F.size), F.block));
     return u;
   } catch (l) {
     throw h2(), l;
   }
 }
-function Rt(s, e, r) {
-  let n2 = Uint8Array.from({ length: 256 }, (h2, g) => g), t = 0;
-  for (let h2 = 0; h2 < 256; h2++) t = t + n2[h2] + s[h2 % s.length] & 255, [n2[h2], n2[t]] = [n2[t], n2[h2]];
+function Ft(s, e, n2) {
+  let r = Uint8Array.from({ length: 256 }, (h2, g) => g), t = 0;
+  for (let h2 = 0; h2 < 256; h2++) t = t + r[h2] + s[h2 % s.length] & 255, [r[h2], r[t]] = [r[t], r[h2]];
   let u = new Uint8Array(e), i = 0;
   t = 0;
   try {
-    for (let h2 = 0; h2 < e; h2++) (h2 & 255) === 0 && r.signal.throwIfAborted(), i = i + 1 & 255, t = t + n2[i] & 255, [n2[i], n2[t]] = [n2[t], n2[i]], u[h2] = n2[n2[i] + n2[t] & 255];
+    for (let h2 = 0; h2 < e; h2++) (h2 & 255) === 0 && n2.signal.throwIfAborted(), i = i + 1 & 255, t = t + r[i] & 255, [r[i], r[t]] = [r[t], r[i]], u[h2] = r[r[i] + r[t] & 255];
     return u;
   } catch (h2) {
     throw u.fill(0), h2;
   } finally {
-    n2.fill(0);
+    r.fill(0);
   }
 }
-async function jt(s, e, r, n2) {
+async function zt(s, e, n2, r) {
   let t, u, i = 0, h2 = -1, g, a = false, l = 128, d, m2 = [], f = false;
-  r.own(() => {
+  n2.own(() => {
     f = true;
     for (let B of m2) B.fill(0);
   });
   let o = R, E = (B) => {
-    if (r.signal.throwIfAborted(), f) throw new Fe("invalid-request", "BIFF decryptor disposed");
-    if (i += B, i > (r.limits.workbookWork ?? r.limits.inputBytes * 8)) throw new Fe("resource-limit", "ssconvert BIFF decryption work limit exceeded");
+    if (n2.signal.throwIfAborted(), f) throw new Fe("invalid-request", "BIFF decryptor disposed");
+    if (i += B, i > (n2.limits.workbookWork ?? n2.limits.inputBytes * 8)) throw new Fe("resource-limit", "ssconvert BIFF decryption work limit exceeded");
   }, k = 0;
-  for (let B = 0; B < s.length; B++) (B & 1023) === 0 && r.signal.throwIfAborted(), s[B].opcode === 47 && ++k > 1 && n("duplicate FILEPASS");
-  let S = async (B) => {
-    if (!r.password) return;
-    r.signal.throwIfAborted();
-    let N = B === "xor", w2 = N ? 15 : 510, D;
+  for (let B = 0; B < s.length; B++) (B & 1023) === 0 && n2.signal.throwIfAborted(), s[B].opcode === 47 && ++k > 1 && n("duplicate FILEPASS");
+  let N = async (B) => {
+    if (!n2.password) return;
+    n2.signal.throwIfAborted();
+    let F = B === "xor", p = F ? 15 : 510, D;
     try {
-      D = await r.password.read(Object.freeze({ format: "biff", algorithm: B, revision: e, encoding: N ? "bytes" : "utf16le", maxBytes: w2, signal: r.signal, ...r.inputFilename === void 0 ? {} : { inputFilename: r.inputFilename } }));
+      D = await n2.password.read(Object.freeze({ format: "biff", algorithm: B, revision: e, encoding: F ? "bytes" : "utf16le", maxBytes: p, signal: n2.signal, ...n2.inputFilename === void 0 ? {} : { inputFilename: n2.inputFilename } }));
     } catch {
-      throw r.signal.throwIfAborted(), new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password acquisition failed");
+      throw n2.signal.throwIfAborted(), new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password acquisition failed");
     }
-    if (r.signal.throwIfAborted(), D !== void 0) {
-      if (typeof D == "string" && !N && D.length <= 255) {
+    if (n2.signal.throwIfAborted(), D !== void 0) {
+      if (typeof D == "string" && !F && D.length <= 255) {
         let x = new Uint8Array(D.length * 2), b = new DataView(x.buffer);
         for (let O = 0; O < D.length; O++) b.setUint16(O * 2, D.charCodeAt(O), true);
         return x;
       }
-      if (D instanceof Uint8Array && D.byteLength <= w2 && (N || D.byteLength % 2 === 0)) return new Uint8Array(D);
+      if (D instanceof Uint8Array && D.byteLength <= p && (F || D.byteLength % 2 === 0)) return new Uint8Array(D);
       throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password encoding or length");
     }
   }, A = (B) => {
-    let N = a ? 20 : 5, w2 = new Uint8Array(N + 4);
-    w2.set(u.subarray(0, N)), new DataView(w2.buffer).setUint32(N, B, true);
-    let D = o(w2);
-    if (w2.fill(0), !a) return D;
+    let F = a ? 20 : 5, p = new Uint8Array(F + 4);
+    p.set(u.subarray(0, F)), new DataView(p.buffer).setUint32(F, B, true);
+    let D = o(p);
+    if (p.fill(0), !a) return D;
     let x = new Uint8Array(l === 40 ? 16 : l / 8);
     return x.set(D.subarray(0, l / 8)), D.fill(0), x;
-  }, R2 = (B, N) => {
-    let w2 = A(B);
+  }, S = (B, F) => {
+    let p = A(B);
     try {
-      return Rt(w2, N, r);
+      return Ft(p, F, n2);
     } finally {
-      w2.fill(0);
+      p.fill(0);
     }
   };
   try {
     for (let B = 0; B < s.length; B++) {
-      r.signal.throwIfAborted();
-      let N = s[B], w2 = N.data, D = N.opcode;
+      n2.signal.throwIfAborted();
+      let F = s[B], p = F.data, D = F.opcode;
       if (D === 47) {
-        let F = e >= 8 ? 2 : 0, M = F ? w2.u16(0) : 0;
+        let R2 = e >= 8 ? 2 : 0, M = R2 ? p.u16(0) : 0;
         if (M === 1) {
-          w2.check(0, 6);
-          let c = w2.u16(2), I = w2.u16(4), L2 = 6, X2 = 22, z = 38, W = 16;
+          p.check(0, 6);
+          let c = p.u16(2), I = p.u16(4), L2 = 6, X2 = 22, z = 38, W = 16;
           if (c >= 2 && c <= 4 && I === 2) {
             a = true, o = L, W = 20;
-            let re = w2.u32(6), oe = w2.u32(10);
-            if (w2.check(14, oe), (oe < 34 || oe % 2) && n("invalid CryptoAPI header size"), (re !== w2.u32(14) || w2.u32(18) !== 0) && n("invalid CryptoAPI header fields"), (re & 52) !== 4 || w2.u32(22) !== 26625 || w2.u32(26) !== 32772 || w2.u32(34) !== 1) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook method");
-            if (re & 8 || (d = Xt(n2, r, E)), l = w2.u32(30) || 40, l < 40 || l > 128 || l % 8) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook key size");
+            let re = p.u32(6), oe = p.u32(10);
+            if (p.check(14, oe), (oe < 34 || oe % 2) && n("invalid CryptoAPI header size"), (re !== p.u32(14) || p.u32(18) !== 0) && n("invalid CryptoAPI header fields"), (re & 52) !== 4 || p.u32(22) !== 26625 || p.u32(26) !== 32772 || p.u32(34) !== 1) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook method");
+            if (re & 8 || (d = Wt(r, n2, E)), l = p.u32(30) || 40, l < 40 || l > 128 || l % 8) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook key size");
             E(oe);
-            for (let Se = 46; Se < 14 + oe; Se += 2) (Se & 1023) === 0 && r.signal.throwIfAborted(), w2.u16(Se) || Se !== 12 + oe && n("invalid CryptoAPI provider terminator");
-            w2.u16(12 + oe) !== 0 && n("unterminated CryptoAPI provider");
+            for (let Se = 46; Se < 14 + oe; Se += 2) (Se & 1023) === 0 && n2.signal.throwIfAborted(), p.u16(Se) || Se !== 12 + oe && n("invalid CryptoAPI provider terminator");
+            p.u16(12 + oe) !== 0 && n("unterminated CryptoAPI provider");
             let he = 14 + oe;
-            w2.check(he, 60), (w2.bytes.length !== he + 60 || w2.u32(he) !== 16 || w2.u32(he + 36) !== 20) && n("invalid CryptoAPI verifier size"), L2 = he + 4, X2 = he + 20, z = he + 40;
+            p.check(he, 60), (p.bytes.length !== he + 60 || p.u32(he) !== 16 || p.u32(he + 36) !== 20) && n("invalid CryptoAPI verifier size"), L2 = he + 4, X2 = he + 20, z = he + 40;
           } else {
             if (c !== 1 || I !== 1) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook method");
-            w2.bytes.length !== 54 && n("invalid RC4 FILEPASS size");
+            p.bytes.length !== 54 && n("invalid RC4 FILEPASS size");
           }
           let q = (re) => {
             if (E(800 + Math.max(0, re.length - 30)), u?.fill(0), a) {
               let de = new Uint8Array(16 + re.length);
-              de.set(w2.bytes.subarray(L2, L2 + 16)), de.set(re, 16), u = o(de), de.fill(0);
+              de.set(p.bytes.subarray(L2, L2 + 16)), de.set(re, 16), u = o(de), de.fill(0);
             } else {
-              let de = o(re), Pe = new Uint8Array(336);
-              for (let Ne = 0; Ne < 16; Ne++) Pe.set(de.subarray(0, 5), Ne * 21), Pe.set(w2.bytes.subarray(L2, L2 + 16), Ne * 21 + 5);
-              u = o(Pe), de.fill(0), Pe.fill(0);
+              let de = o(re), Ge = new Uint8Array(336);
+              for (let Ne = 0; Ne < 16; Ne++) Ge.set(de.subarray(0, 5), Ne * 21), Ge.set(p.bytes.subarray(L2, L2 + 16), Ne * 21 + 5);
+              u = o(Ge), de.fill(0), Ge.fill(0);
             }
-            let oe = R2(0, 16 + W), he = new Uint8Array(16 + W);
-            for (let de = 0; de < he.length; de++) he[de] = w2.bytes[de < 16 ? X2 + de : z + de - 16] ^ oe[de];
-            let Se = o(he.subarray(0, 16)), _e = 0;
-            for (let de = 0; de < W; de++) _e |= Se[de] ^ he[de + 16];
-            return oe.fill(0), he.fill(0), Se.fill(0), _e && (u?.fill(0), u = void 0), _e === 0;
+            let oe = S(0, 16 + W), he = new Uint8Array(16 + W);
+            for (let de = 0; de < he.length; de++) he[de] = p.bytes[de < 16 ? X2 + de : z + de - 16] ^ oe[de];
+            let Se = o(he.subarray(0, 16)), Pe = 0;
+            for (let de = 0; de < W; de++) Pe |= Se[de] ^ he[de + 16];
+            return oe.fill(0), he.fill(0), Se.fill(0), Pe && (u?.fill(0), u = void 0), Pe === 0;
           }, Q2 = "VelvetSweatshop", te = new Uint8Array(Q2.length * 2);
           for (let re = 0; re < Q2.length; re++) te[re * 2] = Q2.charCodeAt(re);
           let ie;
@@ -392,7 +392,7 @@ async function jt(s, e, r, n2) {
             te.fill(0);
           }
           if (!ie) {
-            let re = await S(a ? "rc4-cryptoapi" : "rc4");
+            let re = await N(a ? "rc4-cryptoapi" : "rc4");
             try {
               if (re === void 0 || !q(re)) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password required");
             } finally {
@@ -401,106 +401,106 @@ async function jt(s, e, r, n2) {
           }
           continue;
         }
-        if (M !== 0 || !F && w2.bytes.length !== 4) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook");
-        w2.check(0, F + 4), w2.bytes.length !== F + 4 && n("invalid XOR FILEPASS size");
+        if (M !== 0 || !R2 && p.bytes.length !== 4) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook");
+        p.check(0, R2 + 4), p.bytes.length !== R2 + 4 && n("invalid XOR FILEPASS size");
         let _ = (c) => {
           E(c.length + 1);
           let I = 0;
           for (let L2 = c.length - 1; L2 >= -1; L2--) I = (I << 1 & 32767 | I >> 14) ^ (L2 < 0 ? c.length : c[L2]);
-          return (I ^ 52811) === w2.u16(F + 2);
-        }, p = new TextEncoder().encode("VelvetSweatshop");
+          return (I ^ 52811) === p.u16(R2 + 2);
+        }, w2 = new TextEncoder().encode("VelvetSweatshop");
         try {
-          if (!_(p)) {
-            let L2 = await S("xor");
-            if (p.fill(0), L2 === void 0) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password required");
-            if (p = L2, !_(p)) throw p.fill(0), new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password required");
+          if (!_(w2)) {
+            let L2 = await N("xor");
+            if (w2.fill(0), L2 === void 0) throw new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password required");
+            if (w2 = L2, !_(w2)) throw w2.fill(0), new Fe("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password required");
           }
-          let c = w2.u16(F), I = [187, 255, 255, 186, 255, 255, 185, 128, 0, 190, 15, 0, 191, 15, 0, 0];
+          let c = p.u16(R2), I = [187, 255, 255, 186, 255, 255, 185, 128, 0, 190, 15, 0, 191, 15, 0, 0];
           t = Uint8Array.from({ length: 16 }, (L2, X2) => {
-            let W = (X2 < p.length ? p[X2] : I[X2 - p.length]) ^ (X2 % 2 ? c >> 8 : c & 255);
+            let W = (X2 < w2.length ? w2[X2] : I[X2 - w2.length]) ^ (X2 % 2 ? c >> 8 : c & 255);
             return W >> 1 | W << 7;
           });
         } finally {
-          p.fill(0);
+          w2.fill(0);
         }
         continue;
       }
       if (!t && !u || [9, 521, 1033, 2057, 404, 405, 225, 406, 312].includes(D)) continue;
       let x = D === 133 ? 4 : 0;
-      w2.check(0, x);
-      let b = w2.bytes.length - x, O = 0;
+      p.check(0, x);
+      let b = p.bytes.length - x, O = 0;
       if (u && b) {
-        let F = Math.floor((N.offset + 4 + x) / 1024);
-        O = Math.floor((N.offset + 3 + w2.bytes.length) / 1024) - F + 1 - (F === h2 ? 1 : 0);
+        let R2 = Math.floor((F.offset + 4 + x) / 1024);
+        O = Math.floor((F.offset + 3 + p.bytes.length) / 1024) - R2 + 1 - (R2 === h2 ? 1 : 0);
       }
       E(b + O * 1344);
-      let C2 = w2.bytes.slice(), v = N.offset + 4 + C2.length;
+      let C2 = p.bytes.slice(), v = F.offset + 4 + C2.length;
       m2.push(C2);
-      for (let F = x; F < C2.length; F++) if ((F & 1023) === 0 && r.signal.throwIfAborted(), u) {
-        let M = N.offset + 4 + F, _ = Math.floor(M / 1024);
-        _ !== h2 && (g?.fill(0), g = R2(_, 1024), h2 = _), C2[F] = C2[F] ^ g[M % 1024];
+      for (let R2 = x; R2 < C2.length; R2++) if ((R2 & 1023) === 0 && n2.signal.throwIfAborted(), u) {
+        let M = F.offset + 4 + R2, _ = Math.floor(M / 1024);
+        _ !== h2 && (g?.fill(0), g = S(_, 1024), h2 = _), C2[R2] = C2[R2] ^ g[M % 1024];
       } else {
-        let M = C2[F] ^ t[(v + F) % 16];
-        C2[F] = M >> 5 | M << 3;
+        let M = C2[R2] ^ t[(v + R2) % 16];
+        C2[R2] = M >> 5 | M << 3;
       }
-      s[B] = { ...N, data: new h(C2) };
+      s[B] = { ...F, data: new h(C2) };
     }
-    return d ? Wt(d, R2, r, E) : void 0;
+    return d ? jt(d, S, n2, E) : void 0;
   } catch (B) {
-    for (let N of m2) N.fill(0);
+    for (let F of m2) F.fill(0);
     throw B;
   } finally {
     t?.fill(0), u?.fill(0), g?.fill(0);
   }
 }
-function zt(s, e, r, n2) {
+function $t(s, e, n2, r) {
   let t = 0, u = 0, i = 0, h2 = 0, g = false, a = [], l = () => {
     g = true;
     for (let f of a) f.fill(0);
   };
-  n2.own(l);
+  r.own(l);
   let d = (f) => {
-    if (n2.signal.throwIfAborted(), g) throw new Ee("invalid-request", "Encrypted BIFF ancillary writer disposed");
-    if (t += f, t > (n2.limits.workbookWork ?? n2.limits.outputBytes * 8)) throw new Ee("resource-limit", "ssconvert BIFF ancillary work limit exceeded");
+    if (r.signal.throwIfAborted(), g) throw new Ee("invalid-request", "Encrypted BIFF ancillary writer disposed");
+    if (t += f, t > (r.limits.workbookWork ?? r.limits.outputBytes * 8)) throw new Ee("resource-limit", "ssconvert BIFF ancillary work limit exceeded");
   }, m2 = /* @__PURE__ */ new Set(["SUMMARYINFORMATION", "DOCUMENTSUMMARYINFORMATION"]);
   try {
     for (let [f, o] of e) d(1), m2.add(f.toUpperCase()), h2 += o.length;
     for (let f of s.unsupportedRecords ?? []) {
-      if (d(1), ++u > (n2.limits.workbookNodes ?? n2.limits.outputBytes)) throw new Ee("resource-limit", "ssconvert BIFF ancillary node limit exceeded");
+      if (d(1), ++u > (r.limits.workbookNodes ?? r.limits.outputBytes)) throw new Ee("resource-limit", "ssconvert BIFF ancillary node limit exceeded");
       if (f.source !== "biff" || f.kind !== "encrypted-ancillary" || f.disposition !== "retained") continue;
       let o = f.data;
       if (!o || typeof o != "object" || Array.isArray(o)) continue;
       let E = o;
-      if (d(Object.keys(E).length), Object.keys(E).some((S) => !["stream", "bytes"].includes(S)) || typeof E.stream != "string" || typeof E.bytes != "string") continue;
-      if (d(E.stream.length + E.bytes.length), i += E.stream.length * 3 + E.bytes.length, i > (n2.limits.workbookTextBytes ?? n2.limits.outputBytes * 2)) throw new Ee("resource-limit", "ssconvert BIFF ancillary text limit exceeded");
+      if (d(Object.keys(E).length), Object.keys(E).some((N) => !["stream", "bytes"].includes(N)) || typeof E.stream != "string" || typeof E.bytes != "string") continue;
+      if (d(E.stream.length + E.bytes.length), i += E.stream.length * 3 + E.bytes.length, i > (r.limits.workbookTextBytes ?? r.limits.outputBytes * 2)) throw new Ee("resource-limit", "ssconvert BIFF ancillary text limit exceeded");
       if (m2.has(E.stream.toUpperCase())) throw new Ee("unsupported-feature", "Ambiguous encrypted BIFF ancillary stream name");
       if (m2.add(E.stream.toUpperCase()), E.bytes.length % 2) throw new Ee("invalid-request", "Invalid retained BIFF ancillary bytes");
-      if (h2 += E.bytes.length / 2, h2 > n2.limits.outputBytes || h2 > 4294967295) throw new Ee("resource-limit", "ssconvert BIFF ancillary output bytes limit exceeded");
+      if (h2 += E.bytes.length / 2, h2 > r.limits.outputBytes || h2 > 4294967295) throw new Ee("resource-limit", "ssconvert BIFF ancillary output bytes limit exceeded");
       let k = new Uint8Array(E.bytes.length / 2);
       a.push(k);
-      for (let S = 0; S < k.length; S++) {
-        S % 1024 || d(1);
-        let A = "0123456789abcdef".indexOf(E.bytes[S * 2].toLowerCase()), R2 = "0123456789abcdef".indexOf(E.bytes[S * 2 + 1].toLowerCase());
-        if (A < 0 || R2 < 0) throw new Ee("invalid-request", "Invalid retained BIFF ancillary bytes");
-        k[S] = A * 16 + R2;
+      for (let N = 0; N < k.length; N++) {
+        N % 1024 || d(1);
+        let A = "0123456789abcdef".indexOf(E.bytes[N * 2].toLowerCase()), S = "0123456789abcdef".indexOf(E.bytes[N * 2 + 1].toLowerCase());
+        if (A < 0 || S < 0) throw new Ee("invalid-request", "Invalid retained BIFF ancillary bytes");
+        k[N] = A * 16 + S;
       }
-      e.set(E.stream, k), r.add(f);
+      e.set(E.stream, k), n2.add(f);
     }
   } catch (f) {
     throw l(), f;
   }
 }
-function $t(s, e, r) {
+function Kt(s, e, n2) {
   if (e.signal.throwIfAborted(), s.size > 65536 || s.size > (e.limits.workbookNodes ?? e.limits.outputBytes)) throw new Ee("resource-limit", "ssconvert encrypted BIFF property node limit exceeded");
-  let n2 = 0, t = 4, u = 0, i = /* @__PURE__ */ new Set(), h2 = [...s];
+  let r = 0, t = 4, u = 0, i = /* @__PURE__ */ new Set(), h2 = [...s];
   for (let [o, E] of h2) {
-    if (r(1 + o.length), !o.length || o.length > 31 || [...o].some((k) => ["\0", "/", "\\", ":", "!"].includes(k) || k.codePointAt(0) >= 55296 && k.codePointAt(0) <= 57343) || i.has(o.toUpperCase())) throw new Ee("unsupported-feature", "Invalid encrypted BIFF property stream name");
-    i.add(o.toUpperCase()), u += o.length * 3, n2 += E.length, t += 18 + o.length * 2;
+    if (n2(1 + o.length), !o.length || o.length > 31 || [...o].some((k) => ["\0", "/", "\\", ":", "!"].includes(k) || k.codePointAt(0) >= 55296 && k.codePointAt(0) <= 57343) || i.has(o.toUpperCase())) throw new Ee("unsupported-feature", "Invalid encrypted BIFF property stream name");
+    i.add(o.toUpperCase()), u += o.length * 3, r += E.length, t += 18 + o.length * 2;
   }
   if (u > (e.limits.workbookTextBytes ?? e.limits.outputBytes)) throw new Ee("resource-limit", "ssconvert encrypted BIFF property text limit exceeded");
-  let g = 8 + n2, a = g + t;
+  let g = 8 + r, a = g + t;
   if (a > 4294967295 || a > e.limits.outputBytes) throw new Ee("resource-limit", "ssconvert encrypted BIFF property output bytes limit exceeded");
-  r(a * 2 + (h2.length + 2) * 320);
+  n2(a * 2 + (h2.length + 2) * 320);
   let l = false, d, m2 = () => {
     l = true, d?.fill(0);
   };
@@ -510,133 +510,133 @@ function $t(s, e, r) {
   };
   return (o) => {
     f(), d = new Uint8Array(a);
-    let E = new DataView(d.buffer), k = (S, A, R2) => {
+    let E = new DataView(d.buffer), k = (N, A, S) => {
       f();
-      let B = o(R2, A);
+      let B = o(S, A);
       try {
         f();
-        for (let N = 0; N < A; N++) N % 1024 || f(), d[S + N] = d[S + N] ^ B[N];
+        for (let F = 0; F < A; F++) F % 1024 || f(), d[N + F] = d[N + F] ^ B[F];
       } finally {
         B.fill(0);
       }
     };
     try {
       E.setUint32(0, g, true), E.setUint32(4, t, true), E.setUint32(g, h2.length, true);
-      let S = 8, A = g + 4, R2 = 0;
-      for (let [B, N] of h2) {
-        f(), d.set(N, S), E.setUint32(A, S, true), E.setUint32(A + 4, N.length, true), E.setUint16(A + 8, R2, true), d[A + 10] = B.length, d[A + 11] = 1;
-        for (let w2 = 0; w2 < B.length; w2++) E.setUint16(A + 16 + w2 * 2, B.charCodeAt(w2), true);
-        k(S, N.length, R2++), S += N.length, A += 18 + B.length * 2;
+      let N = 8, A = g + 4, S = 0;
+      for (let [B, F] of h2) {
+        f(), d.set(F, N), E.setUint32(A, N, true), E.setUint32(A + 4, F.length, true), E.setUint16(A + 8, S, true), d[A + 10] = B.length, d[A + 11] = 1;
+        for (let p = 0; p < B.length; p++) E.setUint16(A + 16 + p * 2, B.charCodeAt(p), true);
+        k(N, F.length, S++), N += F.length, A += 18 + B.length * 2;
       }
       return k(g, t, 0), k(0, 8, 0), d;
-    } catch (S) {
-      throw m2(), S;
+    } catch (N) {
+      throw m2(), N;
     }
   };
 }
-var Ft = new Map([["xor", { algorithm: "xor" }], ["rc4", { algorithm: "rc4" }], ...[false, true].flatMap((s) => [40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128].map((e) => [`rc4-cryptoapi-${e}${s ? "-properties" : ""}`, { algorithm: "rc4-cryptoapi", keyBits: e, encryptedProperties: s }]))]);
-var Or = [...Ft].filter(([, s]) => s.algorithm === "xor").map(([s]) => s);
-function Tt(s, e = 8) {
+var Tt = new Map([["xor", { algorithm: "xor" }], ["rc4", { algorithm: "rc4" }], ...[false, true].flatMap((s) => [40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128].map((e) => [`rc4-cryptoapi-${e}${s ? "-properties" : ""}`, { algorithm: "rc4-cryptoapi", keyBits: e, encryptedProperties: s }]))]);
+var Mr = [...Tt].filter(([, s]) => s.algorithm === "xor").map(([s]) => s);
+function St(s, e = 8) {
   if (s.algorithm === "xor") return new Uint8Array(e === 8 ? 6 : 4);
   if (s.algorithm === "rc4") return new Uint8Array(54);
-  let r = "Microsoft Enhanced Cryptographic Provider v1.0", n2 = 32 + (r.length + 1) * 2, t = new Uint8Array(14 + n2 + 60), u = new DataView(t.buffer);
+  let n2 = "Microsoft Enhanced Cryptographic Provider v1.0", r = 32 + (n2.length + 1) * 2, t = new Uint8Array(14 + r + 60), u = new DataView(t.buffer);
   u.setUint16(0, 1, true), u.setUint16(2, 4, true), u.setUint16(4, 2, true);
   let i = s.encryptedProperties ? 4 : 12;
-  u.setUint32(6, i, true), u.setUint32(10, n2, true), u.setUint32(14, i, true), u.setUint32(22, 26625, true), u.setUint32(26, 32772, true), u.setUint32(30, s.keyBits, true), u.setUint32(34, 1, true);
-  for (let h2 = 0; h2 < r.length; h2++) u.setUint16(46 + h2 * 2, r.charCodeAt(h2), true);
-  return u.setUint32(14 + n2, 16, true), u.setUint32(50 + n2, 20, true), t;
+  u.setUint32(6, i, true), u.setUint32(10, r, true), u.setUint32(14, i, true), u.setUint32(22, 26625, true), u.setUint32(26, 32772, true), u.setUint32(30, s.keyBits, true), u.setUint32(34, 1, true);
+  for (let h2 = 0; h2 < n2.length; h2++) u.setUint16(46 + h2 * 2, n2.charCodeAt(h2), true);
+  return u.setUint32(14 + r, 16, true), u.setUint32(50 + r, 20, true), t;
 }
-function De(s) {
-  throw new Kt("unsupported-feature", `Unsupported ssconvert feature: encrypted Excel workbook ${s}`);
+function _e(s) {
+  throw new Yt("unsupported-feature", `Unsupported ssconvert feature: encrypted Excel workbook ${s}`);
 }
-async function Yt(s, e, r = { algorithm: "rc4" }, n2 = /* @__PURE__ */ new Map()) {
-  e.signal.throwIfAborted(), (!e.password || !e.entropy) && De("export requires password and cryptographic entropy capabilities");
-  let t = r.algorithm === "rc4-cryptoapi", u = t ? L : R, i = r.algorithm === "rc4-cryptoapi" ? r.keyBits : 128, h2 = t ? 20 : 16, g = 0, a = (w2) => {
-    if (e.signal.throwIfAborted(), g += w2, g > (e.limits.workbookWork ?? e.limits.inputBytes * 8)) throw new Kt("resource-limit", "ssconvert BIFF encryption work limit exceeded");
+async function qt(s, e, n2 = { algorithm: "rc4" }, r = /* @__PURE__ */ new Map()) {
+  e.signal.throwIfAborted(), (!e.password || !e.entropy) && _e("export requires password and cryptographic entropy capabilities");
+  let t = n2.algorithm === "rc4-cryptoapi", u = t ? L : R, i = n2.algorithm === "rc4-cryptoapi" ? n2.keyBits : 128, h2 = t ? 20 : 16, g = 0, a = (p) => {
+    if (e.signal.throwIfAborted(), g += p, g > (e.limits.workbookWork ?? e.limits.inputBytes * 8)) throw new Yt("resource-limit", "ssconvert BIFF encryption work limit exceeded");
   };
   a(1296 + h2 + s.length + Math.ceil(s.length / 1024) * 1344);
-  let l = r.algorithm === "rc4-cryptoapi" && r.encryptedProperties ? $t(n2, e, a) : void 0, d;
+  let l = n2.algorithm === "rc4-cryptoapi" && n2.encryptedProperties ? Kt(r, e, a) : void 0, d;
   try {
-    d = await e.password.read(Object.freeze({ purpose: "encrypt", format: "biff", algorithm: r.algorithm, revision: 8, encoding: "utf16le", maxBytes: 510, signal: e.signal, ...e.outputFilename === void 0 ? {} : { outputFilename: e.outputFilename } }));
+    d = await e.password.read(Object.freeze({ purpose: "encrypt", format: "biff", algorithm: n2.algorithm, revision: 8, encoding: "utf16le", maxBytes: 510, signal: e.signal, ...e.outputFilename === void 0 ? {} : { outputFilename: e.outputFilename } }));
   } catch {
-    e.signal.throwIfAborted(), De("password acquisition failed");
+    e.signal.throwIfAborted(), _e("password acquisition failed");
   }
-  e.signal.throwIfAborted(), d === void 0 && De("password required"), (typeof d == "string" ? d.length > 255 : !(d instanceof Uint8Array) || d.length > 510 || d.length % 2 !== 0) && De("password encoding or length");
+  e.signal.throwIfAborted(), d === void 0 && _e("password required"), (typeof d == "string" ? d.length > 255 : !(d instanceof Uint8Array) || d.length > 510 || d.length % 2 !== 0) && _e("password encoding or length");
   let m2 = typeof d == "string" ? new Uint8Array(d.length * 2) : new Uint8Array(d);
   if (typeof d == "string") {
-    let w2 = new DataView(m2.buffer);
-    for (let D = 0; D < d.length; D++) w2.setUint16(D * 2, d.charCodeAt(D), true);
+    let p = new DataView(m2.buffer);
+    for (let D = 0; D < d.length; D++) p.setUint16(D * 2, d.charCodeAt(D), true);
   }
-  let f, o, E, k, S, A = new Uint8Array(t ? 16 + m2.length : 336), R2 = t ? 20 : 5, B = new Uint8Array(R2 + 4), N = (w2, D) => {
-    B.set(E.subarray(0, R2)), new DataView(B.buffer).setUint32(R2, w2, true);
+  let f, o, E, k, N, A = new Uint8Array(t ? 16 + m2.length : 336), S = t ? 20 : 5, B = new Uint8Array(S + 4), F = (p, D) => {
+    B.set(E.subarray(0, S)), new DataView(B.buffer).setUint32(S, p, true);
     let x = u(B), b = t ? new Uint8Array(i === 40 ? 16 : i / 8) : x;
     t && b.set(x.subarray(0, i / 8));
     try {
-      return Rt(b, D, e);
+      return Ft(b, D, e);
     } finally {
       b.fill(0), x.fill(0);
     }
   };
   try {
-    let w2;
+    let p;
     try {
-      w2 = await e.entropy.read(Object.freeze({ length: 32, signal: e.signal }));
+      p = await e.entropy.read(Object.freeze({ length: 32, signal: e.signal }));
     } catch {
-      e.signal.throwIfAborted(), De("entropy acquisition failed");
+      e.signal.throwIfAborted(), _e("entropy acquisition failed");
     }
-    if (e.signal.throwIfAborted(), (!(w2 instanceof Uint8Array) || w2.length !== 32) && De("entropy must provide exactly 32 bytes"), f = new Uint8Array(w2), t) f.subarray(0, 16).every((M, _) => M === f[_ + 16]) && De("salt and verifier must differ"), A.set(f.subarray(0, 16)), A.set(m2, 16);
+    if (e.signal.throwIfAborted(), (!(p instanceof Uint8Array) || p.length !== 32) && _e("entropy must provide exactly 32 bytes"), f = new Uint8Array(p), t) f.subarray(0, 16).every((M, _) => M === f[_ + 16]) && _e("salt and verifier must differ"), A.set(f.subarray(0, 16)), A.set(m2, 16);
     else {
       o = R(m2);
       for (let M = 0; M < 16; M++) A.set(o.subarray(0, 5), M * 21), A.set(f.subarray(0, 16), M * 21 + 5);
     }
-    E = u(A), S = u(f.subarray(16)), k = N(0, 16 + h2);
+    E = u(A), N = u(f.subarray(16)), k = F(0, 16 + h2);
     let D = new DataView(s.buffer, s.byteOffset, s.byteLength), x = 4 + D.getUint16(2, true), b = t ? D.getUint32(x + 14, true) : 0;
     if (D.getUint16(x, true) !== 47 || D.getUint16(x + 2, true) !== (t ? 74 + b : 54)) throw new TypeError("Missing BIFF8 encryption header slot");
     t || s.set([1, 0, 1, 0, 1, 0], x + 4);
     let O = t ? x + 22 + b : x + 10, C2 = O + 16, v = C2 + 16 + (t ? 4 : 0);
     s.set(f.subarray(0, 16), O);
     for (let M = 0; M < 16; M++) s[C2 + M] = f[16 + M] ^ k[M];
-    for (let M = 0; M < h2; M++) s[v + M] = S[M] ^ k[M + 16];
+    for (let M = 0; M < h2; M++) s[v + M] = N[M] ^ k[M + 16];
     k.fill(0), k = void 0;
-    let F = -1;
+    let R2 = -1;
     for (let M = 0; M < s.length; ) {
       e.signal.throwIfAborted();
-      let _ = D.getUint16(M, true), p = D.getUint16(M + 2, true), c = M + 4 + p;
+      let _ = D.getUint16(M, true), w2 = D.getUint16(M + 2, true), c = M + 4 + w2;
       if (![2057, 47, 404, 405, 225, 406, 312].includes(_)) for (let I = M + 4 + (_ === 133 ? 4 : 0); I < c; I++) {
         let L2 = Math.floor(I / 1024);
-        L2 !== F && (k?.fill(0), k = N(L2, 1024), F = L2), s[I] = s[I] ^ k[I % 1024];
+        L2 !== R2 && (k?.fill(0), k = F(L2, 1024), R2 = L2), s[I] = s[I] ^ k[I % 1024];
       }
       M = c;
     }
-    return l?.(N);
+    return l?.(F);
   } finally {
-    m2.fill(0), f?.fill(0), o?.fill(0), E?.fill(0), A.fill(0), B.fill(0), k?.fill(0), S?.fill(0);
+    m2.fill(0), f?.fill(0), o?.fill(0), E?.fill(0), A.fill(0), B.fill(0), k?.fill(0), N?.fill(0);
   }
 }
-var vn = [57840, 7439, 52380, 33984, 4364, 3600, 61902, 12606, 6258, 57657, 54287, 34041, 10252, 43370, 20163];
-var Bn = [44796, 19929, 39858, 10053, 20106, 40212, 10761, 31585, 63170, 64933, 60267, 50935, 40399, 11199, 17763, 35526, 1453, 2906, 5812, 11624, 23248, 885, 1770, 3540, 7080, 14160, 28320, 56640, 55369, 41139, 20807, 41614, 21821, 43642, 17621, 28485, 56970, 44341, 19019, 38038, 14605, 29210, 60195, 50791, 40175, 10751, 21502, 43004, 24537, 18387, 36774, 3949, 7898, 15796, 31592, 63184, 47201, 24803, 49606, 37805, 14203, 28406, 56812, 17824, 35648, 1697, 3394, 6788, 13576, 27152, 43601, 17539, 35078, 557, 1114, 2228, 4456, 30388, 60776, 51953, 34243, 7079, 14158, 28316, 14128, 28256, 56512, 43425, 17251, 34502, 7597, 13105, 26210, 52420, 35241, 883, 1766, 3532, 4129, 8258, 16516, 33032, 4657, 9314, 18628];
-var Cn = [187, 255, 255, 186, 255, 255, 185, 128, 0, 190, 15, 0, 191, 15, 0];
-async function qt(s, e, r) {
-  if (r.signal.throwIfAborted(), !r.password) throw new nt("unsupported-feature", "Unsupported ssconvert feature: XOR export requires a password capability");
-  if (256 + s.reduce((h2, g) => h2 + g.length, 0) > (r.limits.workbookWork ?? r.limits.inputBytes * 8)) throw new nt("resource-limit", "ssconvert BIFF encryption work limit exceeded");
+var Bn = [57840, 7439, 52380, 33984, 4364, 3600, 61902, 12606, 6258, 57657, 54287, 34041, 10252, 43370, 20163];
+var Cn = [44796, 19929, 39858, 10053, 20106, 40212, 10761, 31585, 63170, 64933, 60267, 50935, 40399, 11199, 17763, 35526, 1453, 2906, 5812, 11624, 23248, 885, 1770, 3540, 7080, 14160, 28320, 56640, 55369, 41139, 20807, 41614, 21821, 43642, 17621, 28485, 56970, 44341, 19019, 38038, 14605, 29210, 60195, 50791, 40175, 10751, 21502, 43004, 24537, 18387, 36774, 3949, 7898, 15796, 31592, 63184, 47201, 24803, 49606, 37805, 14203, 28406, 56812, 17824, 35648, 1697, 3394, 6788, 13576, 27152, 43601, 17539, 35078, 557, 1114, 2228, 4456, 30388, 60776, 51953, 34243, 7079, 14158, 28316, 14128, 28256, 56512, 43425, 17251, 34502, 7597, 13105, 26210, 52420, 35241, 883, 1766, 3532, 4129, 8258, 16516, 33032, 4657, 9314, 18628];
+var Un = [187, 255, 255, 186, 255, 255, 185, 128, 0, 190, 15, 0, 191, 15, 0];
+async function Qt(s, e, n2) {
+  if (n2.signal.throwIfAborted(), !n2.password) throw new rt("unsupported-feature", "Unsupported ssconvert feature: XOR export requires a password capability");
+  if (256 + s.reduce((h2, g) => h2 + g.length, 0) > (n2.limits.workbookWork ?? n2.limits.inputBytes * 8)) throw new rt("resource-limit", "ssconvert BIFF encryption work limit exceeded");
   let t;
   try {
-    t = await r.password.read(Object.freeze({ purpose: "encrypt", format: "biff", algorithm: "xor", revision: e, encoding: "bytes", maxBytes: 15, signal: r.signal, ...r.outputFilename === void 0 ? {} : { outputFilename: r.outputFilename } }));
+    t = await n2.password.read(Object.freeze({ purpose: "encrypt", format: "biff", algorithm: "xor", revision: e, encoding: "bytes", maxBytes: 15, signal: n2.signal, ...n2.outputFilename === void 0 ? {} : { outputFilename: n2.outputFilename } }));
   } catch {
-    throw r.signal.throwIfAborted(), new nt("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password acquisition failed");
+    throw n2.signal.throwIfAborted(), new rt("unsupported-feature", "Unsupported ssconvert feature: encrypted Excel workbook password acquisition failed");
   }
-  if (r.signal.throwIfAborted(), !(t instanceof Uint8Array) || !t.length || t.length > 15) throw new nt("unsupported-feature", "Unsupported ssconvert feature: XOR export requires 1 to 15 explicitly encoded password bytes");
+  if (n2.signal.throwIfAborted(), !(t instanceof Uint8Array) || !t.length || t.length > 15) throw new rt("unsupported-feature", "Unsupported ssconvert feature: XOR export requires 1 to 15 explicitly encoded password bytes");
   let u = new Uint8Array(t), i = new Uint8Array(16);
   try {
-    let h2 = vn[u.length - 1], g = 104, a = 0;
+    let h2 = Bn[u.length - 1], g = 104, a = 0;
     for (let l = u.length - 1; l >= 0; l--) {
       let d = u[l];
-      for (let m2 = 0; m2 < 7; m2++, g--, d <<= 1) d & 64 && (h2 ^= Bn[g]);
+      for (let m2 = 0; m2 < 7; m2++, g--, d <<= 1) d & 64 && (h2 ^= Cn[g]);
     }
     for (let l = u.length - 1; l >= -1; l--) a = (a << 1 & 32767 | a >> 14) ^ (l < 0 ? u.length : u[l]);
     a ^= 52811;
     for (let l = 0; l < i.length; l++) {
-      let d = (l < u.length ? u[l] : Cn[l - u.length]) ^ (l % 2 ? h2 >> 8 : h2 & 255);
+      let d = (l < u.length ? u[l] : Un[l - u.length]) ^ (l % 2 ? h2 >> 8 : h2 & 255);
       i[l] = d >> 1 | d << 7;
     }
     for (let l of s) {
@@ -644,69 +644,69 @@ async function qt(s, e, r) {
       if (d.getUint16(m2, true) !== 47 || f !== (d.getUint16(4, true) === 1536 ? 6 : 4)) throw new TypeError("Missing BIFF XOR encryption header slot");
       d.setUint16(m2 + f, h2, true), d.setUint16(m2 + f + 2, a, true);
       for (let o = 0; o < l.length; ) {
-        r.signal.throwIfAborted();
-        let E = d.getUint16(o, true), k = d.getUint16(o + 2, true), S = o + 4 + k;
+        n2.signal.throwIfAborted();
+        let E = d.getUint16(o, true), k = d.getUint16(o + 2, true), N = o + 4 + k;
         if (![9, 521, 1033, 2057, 47, 404, 405, 225, 406, 312].includes(E)) for (let A = E === 133 ? 4 : 0; A < k; A++) {
-          (A & 1023) === 0 && r.signal.throwIfAborted();
-          let R2 = o + 4 + A, B = l[R2];
-          l[R2] = (B << 5 | B >> 3) ^ i[(S + A) % 16];
+          (A & 1023) === 0 && n2.signal.throwIfAborted();
+          let S = o + 4 + A, B = l[S];
+          l[S] = (B << 5 | B >> 3) ^ i[(N + A) % 16];
         }
-        o = S;
+        o = N;
       }
     }
   } finally {
     u.fill(0), i.fill(0);
   }
 }
-var Qt = { 0: ["DIMENSIONS_v0"], 512: ["DIMENSIONS_v2"], 1: ["BLANK_v0"], 513: ["BLANK_v2"], 2: ["INTEGER"], 3: ["NUMBER_v0"], 515: ["NUMBER_v2"], 4: ["LABEL_v0"], 516: ["LABEL_v2"], 5: ["BOOLERR_v0"], 517: ["BOOLERR_v2"], 6: ["FORMULA_v0"], 518: ["FORMULA_v2"], 1030: ["FORMULA_v4"], 7: ["STRING_v0"], 519: ["STRING_v2"], 8: ["ROW_v0"], 520: ["ROW_v2"], 9: ["BOF_v0"], 521: ["BOF_v2"], 1033: ["BOF_v4"], 2057: ["BOF_v8"], 10: ["EOF"], 11: ["INDEX_v0"], 523: ["INDEX_v2"], 12: ["CALCCOUNT"], 13: ["CALCMODE"], 14: ["PRECISION"], 15: ["REFMODE"], 16: ["DELTA"], 17: ["ITERATION"], 18: ["PROTECT"], 19: ["PASSWORD"], 20: ["HEADER"], 21: ["FOOTER"], 22: ["EXTERNCOUNT"], 23: ["EXTERNSHEET"], 24: ["NAME_v0"], 536: ["NAME_v2"], 25: ["WINDOWPROTECT"], 26: ["VERTICALPAGEBREAKS"], 27: ["HORIZONTALPAGEBREAKS"], 28: ["NOTE"], 29: ["SELECTION"], 30: ["FORMAT_v0"], 1054: ["FORMAT_v4"], 31: ["FORMATCOUNT"], 32: ["COLUMNDEFAULT"], 33: ["ARRAY_v0"], 545: ["ARRAY_v2"], 34: ["1904"], 35: ["EXTERNNAME_v0"], 547: ["EXTERNNAME_v2"], 36: ["COLWIDTH"], 37: ["DEFAULTROWHEIGHT_v0"], 549: ["DEFAULTROWHEIGHT_v2"], 38: ["LEFT_MARGIN"], 39: ["RIGHT_MARGIN"], 40: ["TOP_MARGIN"], 41: ["BOTTOM_MARGIN"], 42: ["PRINTHEADERS"], 43: ["PRINTGRIDLINES"], 47: ["FILEPASS"], 49: ["FONT_v0"], 561: ["FONT_v2"], 50: ["FONTCOUNT"], 51: ["PRINTSIZE"], 54: ["TABLE_v0"], 566: ["TABLE_v2"], 55: ["TABLE2"], 56: ["WNDESK"], 57: ["ZOOM"], 58: ["BEGINPREF"], 59: ["ENDPREF"], 60: ["CONTINUE"], 61: ["WINDOW1"], 62: ["WINDOW2_v0"], 574: ["WINDOW2_v2"], 63: ["PANE_V2"], 64: ["BACKUP"], 65: ["PANE"], 66: ["CODEPAGE"], 67: ["XF_OLD_v0"], 579: ["XF_OLD_v2"], 1091: ["XF_OLD_v4"], 68: ["XF_INDEX"], 69: ["FONT_COLOR"], 77: ["PLS"], 80: ["DCON"], 81: ["DCONREF"], 82: ["DCONNAME"], 85: ["DEFCOLWIDTH"], 89: ["XCT"], 90: ["CRN"], 91: ["FILESHARING"], 92: ["WRITEACCESS"], 93: ["OBJ"], 94: ["UNCALCED"], 95: ["SAVERECALC"], 96: ["TEMPLATE"], 97: ["INTL"], 2146: ["TAB_COLOR", "SHEETEXT"], 99: ["OBJPROTECT"], 125: ["COLINFO"], 638: ["RK"], 127: ["IMDATA"], 128: ["GUTS"], 129: ["WSBOOL"], 130: ["GRIDSET"], 131: ["HCENTER"], 132: ["VCENTER"], 133: ["BOUNDSHEET"], 134: ["WRITEPROT"], 135: ["ADDIN"], 136: ["EDG"], 137: ["PUB"], 140: ["COUNTRY"], 141: ["HIDEOBJ"], 142: ["BUNDLESOFFSET"], 143: ["BUNDLEHEADER"], 144: ["SORT"], 145: ["SUB"], 146: ["PALETTE"], 659: ["STYLE"], 148: ["LHRECORD"], 149: ["LHNGRAPH"], 150: ["SOUND"], 151: ["SYNC"], 152: ["LPR"], 153: ["STANDARDWIDTH"], 154: ["FNGROUPNAME"], 155: ["FILTERMODE"], 156: ["FNGROUPCOUNT"], 157: ["AUTOFILTERINFO"], 158: ["AUTOFILTER"], 160: ["SCL"], 161: ["SETUP"], 164: ["TOOLBARVER"], 169: ["COORDLIST"], 171: ["GCW"], 174: ["SCENMAN"], 175: ["SCENARIO"], 176: ["SXVIEW"], 177: ["SXVD"], 178: ["SXVI"], 179: ["SXSI"], 180: ["SXIVD"], 181: ["SXLI"], 182: ["SXPI"], 183: ["FACENUM"], 184: ["DOCROUTE"], 185: ["RECIPNAME"], 186: ["SSLIST"], 187: ["MASKIMDATA"], 1212: ["SHRFMLA"], 189: ["MULRK"], 190: ["MULBLANK"], 191: ["TOOLBARHDR"], 192: ["TOOLBAREND"], 193: ["MMS"], 194: ["ADDMENU"], 195: ["DELMENU"], 196: ["TIPHISTORY"], 197: ["SXDI"], 198: ["SXDB"], 199: ["SXFDB"], 200: ["SXDDB"], 201: ["SXNUM"], 202: ["SXBOOL"], 203: ["SXERR"], 204: ["SXINT"], 205: ["SXSTRING"], 206: ["SXDTR"], 207: ["SXNIL"], 208: ["SXTBL"], 209: ["SXTBRGIITM"], 210: ["SXTBPG"], 211: ["OBPROJ"], 213: ["SXStreamID"], 214: ["RSTRING"], 215: ["DBCELL"], 216: ["SXNUMGROUP"], 218: ["BOOKBOOL"], 220: ["PARAMQRY", "SXEXT"], 221: ["SCENPROTECT"], 222: ["OLESIZE"], 223: ["UDDESC"], 224: ["XF"], 225: ["INTERFACEHDR"], 226: ["INTERFACEEND"], 227: ["SXVS"], 229: ["MERGECELLS"], 233: ["BG_PIC"], 234: ["TABIDCONF"], 235: ["MS_O_DRAWING_GROUP"], 236: ["MS_O_DRAWING"], 237: ["MS_O_DRAWING_SELECTION"], 239: ["PHONETIC"], 240: ["SXRULE"], 241: ["SXEX"], 242: ["SXFILT"], 246: ["SXNAME"], 247: ["SXSELECT"], 248: ["SXPAIR"], 249: ["SXFMLA"], 251: ["SXFORMAT"], 252: ["SST"], 253: ["LABELSST"], 255: ["EXTSST"], 256: ["SXVDEX"], 259: ["SXFORMULA"], 290: ["SXDBEX"], 311: ["CHTRINSERT"], 312: ["CHTRINFO"], 315: ["CHTRCELLCONTENT"], 317: ["TABID"], 320: ["CHTRMOVERANGE"], 333: ["CHTRINSERTTAB"], 351: ["LABELRANGES"], 352: ["USESELFS"], 353: ["DSF"], 354: ["XL5MODIFY"], 406: ["CHTRHEADER"], 421: ["FILESHARING2"], 425: ["USERDBVIEW"], 426: ["USERSVIEWBEGIN"], 427: ["USERSVIEWEND"], 429: ["QSI"], 430: ["SUPBOOK"], 431: ["PROT4REV"], 432: ["CONDFMT"], 433: ["CF"], 434: ["DVAL"], 437: ["DCONBIN"], 438: ["TXO"], 439: ["REFRESHALL"], 440: ["HLINK"], 442: ["CODENAME"], 443: ["SXFDBTYPE"], 444: ["PROT4REVPASS"], 446: ["DV"], 448: ["XL9FILE"], 449: ["RECALCID"], 2048: ["LINK_TIP"], 2049: ["WEBPUB"], 2050: ["QSISXTAG"], 2051: ["DBQUERYEXT"], 2052: ["EXTSTRING"], 2053: ["TXTQUERY"], 2054: ["QSIR"], 2055: ["QSIF"], 2058: ["OLEDBCONN"], 2059: ["WOPT"], 2060: ["SXVIEWEX"], 2061: ["SXTH"], 2062: ["SXPIEX"], 2063: ["SXVDTEX"], 2064: ["SXVIEWEX9"], 2066: ["CONTINUEFRT"], 2067: ["REALTIMEDATA"], 2147: ["BOOKEXT"], 2148: ["SXADDL"], 2149: ["CRASHRECERR"], 2150: ["HFPICTURE"], 2151: ["SHEETPROTECTION"], 2152: ["RANGEPROTECTION"], 4097: ["CHART_units"], 4098: ["CHART_chart"], 4099: ["CHART_series"], 4102: ["CHART_dataformat"], 4103: ["CHART_lineformat"], 4105: ["CHART_markerformat"], 4106: ["CHART_areaformat"], 4107: ["CHART_pieformat"], 4108: ["CHART_attachedlabel"], 4109: ["CHART_seriestext"], 4116: ["CHART_chartformat"], 4117: ["CHART_legend"], 4118: ["CHART_serieslist"], 4119: ["CHART_bar"], 4120: ["CHART_line"], 4121: ["CHART_pie"], 4122: ["CHART_area"], 4123: ["CHART_scatter"], 4124: ["CHART_chartline"], 4125: ["CHART_axis"], 4126: ["CHART_tick"], 4127: ["CHART_valuerange"], 4128: ["CHART_catserrange"], 4129: ["CHART_axislineformat"], 4130: ["CHART_chartformatlink"], 4132: ["CHART_defaulttext"], 4133: ["CHART_text"], 4134: ["CHART_fontx"], 4135: ["CHART_objectlink"], 4146: ["CHART_frame"], 4147: ["CHART_begin"], 4148: ["CHART_end"], 4149: ["CHART_plotarea"], 4154: ["CHART_3d"], 4156: ["CHART_picf"], 4157: ["CHART_dropbar"], 4158: ["CHART_radar"], 4159: ["CHART_surf"], 4160: ["CHART_radararea"], 4161: ["CHART_axisparent"], 4163: ["CHART_legendxn"], 4164: ["CHART_shtprops"], 4165: ["CHART_sertocrt"], 4166: ["CHART_axesused"], 4168: ["CHART_sbaseref"], 4170: ["CHART_serparent"], 4171: ["CHART_serauxtrend"], 4174: ["CHART_ifmt"], 4175: ["CHART_pos"], 4176: ["CHART_alruns"], 4177: ["CHART_ai"], 4187: ["CHART_serauxerrbar"], 4188: ["CHART_clrtclient"], 4189: ["CHART_serfmt"], 4191: ["CHART_3dbarshape"], 4192: ["CHART_fbi"], 4193: ["CHART_boppop"], 4194: ["CHART_axcext"], 4195: ["CHART_dat"], 4196: ["CHART_plotgrowth"], 4197: ["CHART_siindex"], 4198: ["CHART_gelframe"], 4199: ["CHART_boppopcustom"], 4288: ["CHART_trendlimits"] };
-var rt = { 0: ["COUNT", 0, 30], 1: ["IF", 2, 3], 2: ["ISNA", 1, 1], 3: ["ISERROR", 1, 1], 4: ["SUM", 0, 30], 5: ["AVERAGE", 1, 30], 6: ["MIN", 1, 30], 7: ["MAX", 1, 30], 8: ["ROW", 0, 1], 9: ["COLUMN", 0, 1], 10: ["NA", 0, 0], 11: ["NPV", 2, 30], 12: ["STDEV", 1, 30], 13: ["DOLLAR", 1, 2], 14: ["FIXED", 2, 3], 15: ["SIN", 1, 1], 16: ["COS", 1, 1], 17: ["TAN", 1, 1], 18: ["ATAN", 1, 1], 19: ["PI", 0, 0], 20: ["SQRT", 1, 1], 21: ["EXP", 1, 1], 22: ["LN", 1, 1], 23: ["LOG10", 1, 1], 24: ["ABS", 1, 1], 25: ["INT", 1, 1], 26: ["SIGN", 1, 1], 27: ["ROUND", 2, 2], 28: ["LOOKUP", 2, 3], 29: ["INDEX", 2, 4], 30: ["REPT", 2, 2], 31: ["MID", 3, 3], 32: ["LEN", 1, 1], 33: ["VALUE", 1, 1], 34: ["TRUE", 0, 0], 35: ["FALSE", 0, 0], 36: ["AND", 1, 30], 37: ["OR", 1, 30], 38: ["NOT", 1, 1], 39: ["MOD", 2, 2], 40: ["DCOUNT", 3, 3], 41: ["DSUM", 3, 3], 42: ["DAVERAGE", 3, 3], 43: ["DMIN", 3, 3], 44: ["DMAX", 3, 3], 45: ["DSTDEV", 3, 3], 46: ["VAR", 1, 30], 47: ["DVAR", 3, 3], 48: ["TEXT", 2, 2], 49: ["LINEST", 1, 4], 50: ["TREND", 1, 4], 51: ["LOGEST", 1, 4], 52: ["GROWTH", 1, 4], 53: ["GOTO", -1, -1], 54: ["HALT", -1, -1], 55: ["RETURN", -1, -1], 56: ["PV", 3, 5], 57: ["FV", 3, 5], 58: ["NPER", 3, 5], 59: ["PMT", 3, 5], 60: ["RATE", 3, 6], 61: ["MIRR", 3, 3], 62: ["IRR", 1, 2], 63: ["RAND", 0, 0], 64: ["MATCH", 2, 3], 65: ["DATE", 3, 3], 66: ["TIME", 3, 3], 67: ["DAY", 1, 1], 68: ["MONTH", 1, 1], 69: ["YEAR", 1, 1], 70: ["WEEKDAY", 1, 2], 71: ["HOUR", 1, 1], 72: ["MINUTE", 1, 1], 73: ["SECOND", 1, 1], 74: ["NOW", 0, 0], 75: ["AREAS", 1, 1], 76: ["ROWS", 1, 1], 77: ["COLUMNS", 1, 1], 78: ["OFFSET", 3, 5], 79: ["ABSREF", -1, -1], 80: ["RELREF", -1, -1], 81: ["ARGUMENT", -1, -1], 82: ["SEARCH", 2, 3], 83: ["TRANSPOSE", 1, 1], 84: ["ERROR", -1, -1], 85: ["STEP", -1, -1], 86: ["TYPE", 1, 1], 87: ["ECHO", -1, -1], 88: ["SETNAME", -1, -1], 89: ["CALLER", -1, -1], 90: ["DEREF", -1, -1], 91: ["WINDOWS", -1, -1], 92: ["SERIES", 4, 4], 93: ["DOCUMENTS", -1, -1], 94: ["ACTIVE.CELL", -1, -1], 95: ["SELECTION", -1, -1], 96: ["RESULT", -1, -1], 97: ["ATAN2", 2, 2], 98: ["ASIN", 1, 1], 99: ["ACOS", 1, 1], 100: ["CHOOSE", 2, 30], 101: ["HLOOKUP", 3, 4], 102: ["VLOOKUP", 3, 4], 103: ["LINKS", -1, -1], 104: ["INPUT", -1, -1], 105: ["ISREF", 1, 1], 106: ["GET.FORMULA", 1, 1], 107: ["GET.NAME", 1, 1], 108: ["SET.VALUE", -1, -1], 109: ["LOG", 1, 2], 110: ["EXEC", -1, -1], 111: ["CHAR", 1, 1], 112: ["LOWER", 1, 1], 113: ["UPPER", 1, 1], 114: ["PROPER", 1, 1], 115: ["LEFT", 1, 2], 116: ["RIGHT", 1, 2], 117: ["EXACT", 2, 2], 118: ["TRIM", 1, 1], 119: ["REPLACE", 4, 4], 120: ["SUBSTITUTE", 3, 4], 121: ["CODE", 1, 1], 122: ["NAMES", -1, -1], 123: ["DIRECTORY", -1, -1], 124: ["FIND", 2, 3], 125: ["CELL", 1, 2], 126: ["ISERR", 1, 1], 127: ["ISTEXT", 1, 1], 128: ["ISNUMBER", 1, 1], 129: ["ISBLANK", 1, 1], 130: ["T", 1, 1], 131: ["N", 1, 1], 132: ["FOPEN", -1, -1], 133: ["FCLOSE", -1, -1], 134: ["FSIZE", -1, -1], 135: ["FREADLN", -1, -1], 136: ["FREAD", -1, -1], 137: ["FWRITELN", -1, -1], 138: ["FWRITE", -1, -1], 139: ["FPOS", -1, -1], 140: ["DATEVALUE", 1, 1], 141: ["TIMEVALUE", 1, 1], 142: ["SLN", 3, 3], 143: ["SYD", 4, 4], 144: ["DDB", 4, 5], 145: ["GET.DEF", -1, -1], 146: ["REFTEXT", -1, -1], 147: ["TEXTREF", -1, -1], 148: ["INDIRECT", 1, 2], 149: ["REGISTER", -1, -1], 150: ["CALL", -1, -1], 151: ["ADD.BAR", -1, -1], 152: ["ADD.MENU", -1, -1], 153: ["ADD.COMMAND", -1, -1], 154: ["ENABLE.COMMAND", -1, -1], 155: ["CHECK.COMMAND", -1, -1], 156: ["RENAME.COMMAND", -1, -1], 157: ["SHOW.BAR", -1, -1], 158: ["DELETE.MENU", -1, -1], 159: ["DELETE.COMMAND", -1, -1], 160: ["GET.CHART.ITEM", -1, -1], 161: ["DIALOG.BOX", -1, -1], 162: ["CLEAN", 1, 1], 163: ["MDETERM", 1, 1], 164: ["MINVERSE", 1, 1], 165: ["MMULT", 2, 2], 166: ["FILES", -1, -1], 167: ["IPMT", 4, 6], 168: ["PPMT", 4, 6], 169: ["COUNTA", 0, 30], 170: ["CANCELKEY", -1, -1], 171: ["FOR", -1, -1], 172: ["WHILE", -1, -1], 173: ["BREAK", -1, -1], 174: ["NEXT", -1, -1], 175: ["INITIATE", -1, -1], 176: ["REQUEST", -1, -1], 177: ["POKE", -1, -1], 178: ["EXECUTE", -1, -1], 179: ["TERMINATE", -1, -1], 180: ["RESTART", -1, -1], 181: ["HELP", -1, -1], 182: ["GET.BAR", -1, -1], 183: ["PRODUCT", 0, 30], 184: ["FACT", 1, 1], 185: ["GET.CELL", -1, -1], 186: ["GET.WORKSPACE", -1, -1], 187: ["GET.WINDOW", -1, -1], 188: ["GET.DOCUMENT", -1, -1], 189: ["DPRODUCT", 3, 3], 190: ["ISNONTEXT", 1, 1], 191: ["GET.NOTE", -1, -1], 192: ["NOTE", -1, -1], 193: ["STDEVP", 1, 30], 194: ["VARP", 1, 30], 195: ["DSTDEVP", 3, 3], 196: ["DVARP", 3, 3], 197: ["TRUNC", 1, 2], 198: ["ISLOGICAL", 1, 1], 199: ["DCOUNTA", 3, 3], 200: ["DELETE.BAR", -1, -1], 201: ["UNREGISTER", -1, -1], 202: ["EXCELFUNC202", -1, -1], 203: ["EXCELFUNC203", -1, -1], 204: ["USDOLLAR", 1, 2], 205: ["FINDB", 2, 3], 206: ["SEARCHB", 2, 3], 207: ["REPLACEB", 4, 4], 208: ["LEFTB", 1, 2], 209: ["RIGHTB", 1, 2], 210: ["MIDB", 3, 3], 211: ["LENB", 1, 1], 212: ["ROUNDUP", 2, 2], 213: ["ROUNDDOWN", 2, 2], 214: ["ASC", 1, 1], 215: ["DBCS", 1, 1], 216: ["RANK", 2, 3], 217: ["EXCELFUNC217", -1, -1], 218: ["EXCELFUNC218", -1, -1], 219: ["ADDRESS", 2, 5], 220: ["DAYS360", 2, 3], 221: ["TODAY", 0, 0], 222: ["VDB", 5, 7], 223: ["ELSE", -1, -1], 224: ["ELSE.IF", -1, -1], 225: ["END.IF", -1, -1], 226: ["FOR.CELL", -1, -1], 227: ["MEDIAN", 1, 30], 228: ["SUMPRODUCT", 1, 30], 229: ["SINH", 1, 1], 230: ["COSH", 1, 1], 231: ["TANH", 1, 1], 232: ["ASINH", 1, 1], 233: ["ACOSH", 1, 1], 234: ["ATANH", 1, 1], 235: ["DGET", 3, 3], 236: ["CREATE.OBJECT", -1, -1], 237: ["VOLATILE", -1, -1], 238: ["LAST.ERROR", -1, -1], 239: ["CUSTOM.UNDO", -1, -1], 240: ["CUSTOM.REPEAT", -1, -1], 241: ["FORMULA.CONVERT", -1, -1], 242: ["GET.LINK.INFO", -1, -1], 243: ["TEXT.BOX", -1, -1], 244: ["INFO", 1, 1], 245: ["GROUP", -1, -1], 246: ["GET.OBJECT", -1, -1], 247: ["DB", 4, 5], 248: ["PAUSE", -1, -1], 249: ["EXCELFUNC249", -1, -1], 250: ["EXCELFUNC250", -1, -1], 251: ["RESUME", -1, -1], 252: ["FREQUENCY", 2, 2], 253: ["ADD.TOOLBAR", -1, -1], 254: ["DELETE.TOOLBAR", -1, -1], 255: ["extension slot", -1, -1], 256: ["RESET.TOOLBAR", -1, -1], 257: ["EVALUATE", -1, -1], 258: ["GET.TOOLBAR", -1, -1], 259: ["GET.TOOL", -1, -1], 260: ["SPELLING.CHECK", -1, -1], 261: ["ERROR.TYPE", 1, 1], 262: ["APP.TITLE", -1, -1], 263: ["WINDOW.TITLE", -1, -1], 264: ["SAVE.TOOLBAR", -1, -1], 265: ["ENABLE.TOOL", -1, -1], 266: ["PRESS.TOOL", -1, -1], 267: ["REGISTER.ID", -1, -1], 268: ["GET.WORKBOOK", -1, -1], 269: ["AVEDEV", 1, 30], 270: ["BETADIST", 3, 5], 271: ["GAMMALN", 1, 1], 272: ["BETAINV", 3, 5], 273: ["BINOMDIST", 4, 4], 274: ["CHIDIST", 2, 2], 275: ["CHIINV", 2, 2], 276: ["COMBIN", 2, 2], 277: ["CONFIDENCE", 3, 3], 278: ["CRITBINOM", 3, 3], 279: ["EVEN", 1, 1], 280: ["EXPONDIST", 3, 3], 281: ["FDIST", 3, 3], 282: ["FINV", 3, 3], 283: ["FISHER", 1, 1], 284: ["FISHERINV", 1, 1], 285: ["FLOOR", 2, 2], 286: ["GAMMADIST", 4, 4], 287: ["GAMMAINV", 3, 3], 288: ["CEILING", 2, 2], 289: ["HYPGEOMDIST", 4, 4], 290: ["LOGNORMDIST", 3, 3], 291: ["LOGINV", 3, 3], 292: ["NEGBINOMDIST", 3, 3], 293: ["NORMDIST", 4, 4], 294: ["NORMSDIST", 1, 1], 295: ["NORMINV", 3, 3], 296: ["NORMSINV", 1, 1], 297: ["STANDARDIZE", 3, 3], 298: ["ODD", 1, 1], 299: ["PERMUT", 2, 2], 300: ["POISSON", 3, 3], 301: ["TDIST", 3, 3], 302: ["WEIBULL", 4, 4], 303: ["SUMXMY2", 2, 2], 304: ["SUMX2MY2", 2, 2], 305: ["SUMX2PY2", 2, 2], 306: ["CHITEST", 2, 2], 307: ["CORREL", 2, 2], 308: ["COVAR", 2, 2], 309: ["FORECAST", 3, 3], 310: ["FTEST", 2, 2], 311: ["INTERCEPT", 2, 2], 312: ["PEARSON", 2, 2], 313: ["RSQ", 2, 2], 314: ["STEYX", 2, 2], 315: ["SLOPE", 2, 2], 316: ["TTEST", 4, 4], 317: ["PROB", 3, 4], 318: ["DEVSQ", 1, 30], 319: ["GEOMEAN", 1, 30], 320: ["HARMEAN", 1, 30], 321: ["SUMSQ", 0, 30], 322: ["KURT", 1, 30], 323: ["SKEW", 1, 30], 324: ["ZTEST", 2, 3], 325: ["LARGE", 2, 2], 326: ["SMALL", 2, 2], 327: ["QUARTILE", 2, 2], 328: ["PERCENTILE", 2, 2], 329: ["PERCENTRANK", 2, 3], 330: ["MODE", 1, 30], 331: ["TRIMMEAN", 2, 2], 332: ["TINV", 2, 2], 333: ["EXCELFUNC333", -1, -1], 334: ["MOVIE.COMMAND", -1, -1], 335: ["GET.MOVIE", -1, -1], 336: ["CONCATENATE", 0, 30], 337: ["POWER", 2, 2], 338: ["PIVOT.ADD.DATA", -1, -1], 339: ["GET.PIVOT.TABLE", -1, -1], 340: ["GET.PIVOT.FIELD", -1, -1], 341: ["GET.PIVOT.ITEM", -1, -1], 342: ["RADIANS", 1, 1], 343: ["DEGREES", 1, 1], 344: ["SUBTOTAL", 2, 30], 345: ["SUMIF", 2, 3], 346: ["COUNTIF", 2, 2], 347: ["COUNTBLANK", 1, 1], 348: ["SCENARIO.GET", -1, -1], 349: ["OPTIONS.LISTS.GET", -1, -1], 350: ["ISPMT", 4, 4], 351: ["DATEDIF", 3, 3], 352: ["DATESTRING", 1, 1], 353: ["NUMBERSTRING", 2, 2], 354: ["ROMAN", 1, 2], 355: ["OPEN.DIALOG", -1, -1], 356: ["SAVE.DIALOG", -1, -1], 357: ["VIEW.GET", -1, -1], 358: ["GETPIVOTDATA", 2, 30], 359: ["HYPERLINK", 1, 2], 360: ["PHONETIC", 1, 1], 361: ["AVERAGEA", 1, 30], 362: ["MAXA", 1, 30], 363: ["MINA", 1, 30], 364: ["STDEVPA", 1, 30], 365: ["VARPA", 1, 30], 366: ["STDEVA", 1, 30], 367: ["VARA", 1, 30], 368: ["BAHTTEXT", 1, 1], 369: ["THAIDAYOFWEEK", 1, 1], 370: ["THAIDIGIT", 1, 1], 371: ["THAIMONTHOFYEAR", 1, 1], 372: ["THAINUMSOUND", 1, 1], 373: ["THAINUMSTRING", 1, 1], 374: ["THAISTRINGLENGTH", 1, 1], 375: ["ISTHAIDIGIT", 1, 1], 376: ["ROUNDBAHTDOWN", 1, 1], 377: ["ROUNDBAHTUP", 1, 1], 378: ["THAIYEAR", 1, 1], 379: ["RTD", 2, 5], 380: ["ISHYPERLINK", 1, 1] };
-var Jt = { 3: ["+", 3], 4: ["-", 3], 5: ["*", 4], 6: ["/", 4], 7: ["^", 5], 8: ["&", 2], 9: ["<", 1], 10: ["<=", 1], 11: ["=", 1], 12: [">=", 1], 13: [">", 1], 14: ["<>", 1], 15: [" ", 7], 16: [",", 6], 17: [":", 8] };
-var Be = { 0: "#NULL!", 7: "#DIV/0!", 15: "#VALUE!", 23: "#REF!", 29: "#NAME?", 36: "#NUM!", 42: "#N/A" };
-var Mn = { 14: [2, 3, 2], 70: [2, 4, 1], 101: [2, 4, 3], 102: [2, 4, 3], 197: [2, 2, 1], 220: [3, 4, 2] };
-function St(s, e, [r, n2, t, u]) {
-  let i = r === n2 && s === r && (e === t - 1 || e === u + 1), h2 = t === u && e === t && (s === r - 1 || s === n2 + 1);
-  return r <= n2 && t <= u && u < 256 && i !== h2;
+var Zt = { 0: ["DIMENSIONS_v0"], 512: ["DIMENSIONS_v2"], 1: ["BLANK_v0"], 513: ["BLANK_v2"], 2: ["INTEGER"], 3: ["NUMBER_v0"], 515: ["NUMBER_v2"], 4: ["LABEL_v0"], 516: ["LABEL_v2"], 5: ["BOOLERR_v0"], 517: ["BOOLERR_v2"], 6: ["FORMULA_v0"], 518: ["FORMULA_v2"], 1030: ["FORMULA_v4"], 7: ["STRING_v0"], 519: ["STRING_v2"], 8: ["ROW_v0"], 520: ["ROW_v2"], 9: ["BOF_v0"], 521: ["BOF_v2"], 1033: ["BOF_v4"], 2057: ["BOF_v8"], 10: ["EOF"], 11: ["INDEX_v0"], 523: ["INDEX_v2"], 12: ["CALCCOUNT"], 13: ["CALCMODE"], 14: ["PRECISION"], 15: ["REFMODE"], 16: ["DELTA"], 17: ["ITERATION"], 18: ["PROTECT"], 19: ["PASSWORD"], 20: ["HEADER"], 21: ["FOOTER"], 22: ["EXTERNCOUNT"], 23: ["EXTERNSHEET"], 24: ["NAME_v0"], 536: ["NAME_v2"], 25: ["WINDOWPROTECT"], 26: ["VERTICALPAGEBREAKS"], 27: ["HORIZONTALPAGEBREAKS"], 28: ["NOTE"], 29: ["SELECTION"], 30: ["FORMAT_v0"], 1054: ["FORMAT_v4"], 31: ["FORMATCOUNT"], 32: ["COLUMNDEFAULT"], 33: ["ARRAY_v0"], 545: ["ARRAY_v2"], 34: ["1904"], 35: ["EXTERNNAME_v0"], 547: ["EXTERNNAME_v2"], 36: ["COLWIDTH"], 37: ["DEFAULTROWHEIGHT_v0"], 549: ["DEFAULTROWHEIGHT_v2"], 38: ["LEFT_MARGIN"], 39: ["RIGHT_MARGIN"], 40: ["TOP_MARGIN"], 41: ["BOTTOM_MARGIN"], 42: ["PRINTHEADERS"], 43: ["PRINTGRIDLINES"], 47: ["FILEPASS"], 49: ["FONT_v0"], 561: ["FONT_v2"], 50: ["FONTCOUNT"], 51: ["PRINTSIZE"], 54: ["TABLE_v0"], 566: ["TABLE_v2"], 55: ["TABLE2"], 56: ["WNDESK"], 57: ["ZOOM"], 58: ["BEGINPREF"], 59: ["ENDPREF"], 60: ["CONTINUE"], 61: ["WINDOW1"], 62: ["WINDOW2_v0"], 574: ["WINDOW2_v2"], 63: ["PANE_V2"], 64: ["BACKUP"], 65: ["PANE"], 66: ["CODEPAGE"], 67: ["XF_OLD_v0"], 579: ["XF_OLD_v2"], 1091: ["XF_OLD_v4"], 68: ["XF_INDEX"], 69: ["FONT_COLOR"], 77: ["PLS"], 80: ["DCON"], 81: ["DCONREF"], 82: ["DCONNAME"], 85: ["DEFCOLWIDTH"], 89: ["XCT"], 90: ["CRN"], 91: ["FILESHARING"], 92: ["WRITEACCESS"], 93: ["OBJ"], 94: ["UNCALCED"], 95: ["SAVERECALC"], 96: ["TEMPLATE"], 97: ["INTL"], 2146: ["TAB_COLOR", "SHEETEXT"], 99: ["OBJPROTECT"], 125: ["COLINFO"], 638: ["RK"], 127: ["IMDATA"], 128: ["GUTS"], 129: ["WSBOOL"], 130: ["GRIDSET"], 131: ["HCENTER"], 132: ["VCENTER"], 133: ["BOUNDSHEET"], 134: ["WRITEPROT"], 135: ["ADDIN"], 136: ["EDG"], 137: ["PUB"], 140: ["COUNTRY"], 141: ["HIDEOBJ"], 142: ["BUNDLESOFFSET"], 143: ["BUNDLEHEADER"], 144: ["SORT"], 145: ["SUB"], 146: ["PALETTE"], 659: ["STYLE"], 148: ["LHRECORD"], 149: ["LHNGRAPH"], 150: ["SOUND"], 151: ["SYNC"], 152: ["LPR"], 153: ["STANDARDWIDTH"], 154: ["FNGROUPNAME"], 155: ["FILTERMODE"], 156: ["FNGROUPCOUNT"], 157: ["AUTOFILTERINFO"], 158: ["AUTOFILTER"], 160: ["SCL"], 161: ["SETUP"], 164: ["TOOLBARVER"], 169: ["COORDLIST"], 171: ["GCW"], 174: ["SCENMAN"], 175: ["SCENARIO"], 176: ["SXVIEW"], 177: ["SXVD"], 178: ["SXVI"], 179: ["SXSI"], 180: ["SXIVD"], 181: ["SXLI"], 182: ["SXPI"], 183: ["FACENUM"], 184: ["DOCROUTE"], 185: ["RECIPNAME"], 186: ["SSLIST"], 187: ["MASKIMDATA"], 1212: ["SHRFMLA"], 189: ["MULRK"], 190: ["MULBLANK"], 191: ["TOOLBARHDR"], 192: ["TOOLBAREND"], 193: ["MMS"], 194: ["ADDMENU"], 195: ["DELMENU"], 196: ["TIPHISTORY"], 197: ["SXDI"], 198: ["SXDB"], 199: ["SXFDB"], 200: ["SXDDB"], 201: ["SXNUM"], 202: ["SXBOOL"], 203: ["SXERR"], 204: ["SXINT"], 205: ["SXSTRING"], 206: ["SXDTR"], 207: ["SXNIL"], 208: ["SXTBL"], 209: ["SXTBRGIITM"], 210: ["SXTBPG"], 211: ["OBPROJ"], 213: ["SXStreamID"], 214: ["RSTRING"], 215: ["DBCELL"], 216: ["SXNUMGROUP"], 218: ["BOOKBOOL"], 220: ["PARAMQRY", "SXEXT"], 221: ["SCENPROTECT"], 222: ["OLESIZE"], 223: ["UDDESC"], 224: ["XF"], 225: ["INTERFACEHDR"], 226: ["INTERFACEEND"], 227: ["SXVS"], 229: ["MERGECELLS"], 233: ["BG_PIC"], 234: ["TABIDCONF"], 235: ["MS_O_DRAWING_GROUP"], 236: ["MS_O_DRAWING"], 237: ["MS_O_DRAWING_SELECTION"], 239: ["PHONETIC"], 240: ["SXRULE"], 241: ["SXEX"], 242: ["SXFILT"], 246: ["SXNAME"], 247: ["SXSELECT"], 248: ["SXPAIR"], 249: ["SXFMLA"], 251: ["SXFORMAT"], 252: ["SST"], 253: ["LABELSST"], 255: ["EXTSST"], 256: ["SXVDEX"], 259: ["SXFORMULA"], 290: ["SXDBEX"], 311: ["CHTRINSERT"], 312: ["CHTRINFO"], 315: ["CHTRCELLCONTENT"], 317: ["TABID"], 320: ["CHTRMOVERANGE"], 333: ["CHTRINSERTTAB"], 351: ["LABELRANGES"], 352: ["USESELFS"], 353: ["DSF"], 354: ["XL5MODIFY"], 406: ["CHTRHEADER"], 421: ["FILESHARING2"], 425: ["USERDBVIEW"], 426: ["USERSVIEWBEGIN"], 427: ["USERSVIEWEND"], 429: ["QSI"], 430: ["SUPBOOK"], 431: ["PROT4REV"], 432: ["CONDFMT"], 433: ["CF"], 434: ["DVAL"], 437: ["DCONBIN"], 438: ["TXO"], 439: ["REFRESHALL"], 440: ["HLINK"], 442: ["CODENAME"], 443: ["SXFDBTYPE"], 444: ["PROT4REVPASS"], 446: ["DV"], 448: ["XL9FILE"], 449: ["RECALCID"], 2048: ["LINK_TIP"], 2049: ["WEBPUB"], 2050: ["QSISXTAG"], 2051: ["DBQUERYEXT"], 2052: ["EXTSTRING"], 2053: ["TXTQUERY"], 2054: ["QSIR"], 2055: ["QSIF"], 2058: ["OLEDBCONN"], 2059: ["WOPT"], 2060: ["SXVIEWEX"], 2061: ["SXTH"], 2062: ["SXPIEX"], 2063: ["SXVDTEX"], 2064: ["SXVIEWEX9"], 2066: ["CONTINUEFRT"], 2067: ["REALTIMEDATA"], 2147: ["BOOKEXT"], 2148: ["SXADDL"], 2149: ["CRASHRECERR"], 2150: ["HFPICTURE"], 2151: ["SHEETPROTECTION"], 2152: ["RANGEPROTECTION"], 4097: ["CHART_units"], 4098: ["CHART_chart"], 4099: ["CHART_series"], 4102: ["CHART_dataformat"], 4103: ["CHART_lineformat"], 4105: ["CHART_markerformat"], 4106: ["CHART_areaformat"], 4107: ["CHART_pieformat"], 4108: ["CHART_attachedlabel"], 4109: ["CHART_seriestext"], 4116: ["CHART_chartformat"], 4117: ["CHART_legend"], 4118: ["CHART_serieslist"], 4119: ["CHART_bar"], 4120: ["CHART_line"], 4121: ["CHART_pie"], 4122: ["CHART_area"], 4123: ["CHART_scatter"], 4124: ["CHART_chartline"], 4125: ["CHART_axis"], 4126: ["CHART_tick"], 4127: ["CHART_valuerange"], 4128: ["CHART_catserrange"], 4129: ["CHART_axislineformat"], 4130: ["CHART_chartformatlink"], 4132: ["CHART_defaulttext"], 4133: ["CHART_text"], 4134: ["CHART_fontx"], 4135: ["CHART_objectlink"], 4146: ["CHART_frame"], 4147: ["CHART_begin"], 4148: ["CHART_end"], 4149: ["CHART_plotarea"], 4154: ["CHART_3d"], 4156: ["CHART_picf"], 4157: ["CHART_dropbar"], 4158: ["CHART_radar"], 4159: ["CHART_surf"], 4160: ["CHART_radararea"], 4161: ["CHART_axisparent"], 4163: ["CHART_legendxn"], 4164: ["CHART_shtprops"], 4165: ["CHART_sertocrt"], 4166: ["CHART_axesused"], 4168: ["CHART_sbaseref"], 4170: ["CHART_serparent"], 4171: ["CHART_serauxtrend"], 4174: ["CHART_ifmt"], 4175: ["CHART_pos"], 4176: ["CHART_alruns"], 4177: ["CHART_ai"], 4187: ["CHART_serauxerrbar"], 4188: ["CHART_clrtclient"], 4189: ["CHART_serfmt"], 4191: ["CHART_3dbarshape"], 4192: ["CHART_fbi"], 4193: ["CHART_boppop"], 4194: ["CHART_axcext"], 4195: ["CHART_dat"], 4196: ["CHART_plotgrowth"], 4197: ["CHART_siindex"], 4198: ["CHART_gelframe"], 4199: ["CHART_boppopcustom"], 4288: ["CHART_trendlimits"] };
+var it = { 0: ["COUNT", 0, 30], 1: ["IF", 2, 3], 2: ["ISNA", 1, 1], 3: ["ISERROR", 1, 1], 4: ["SUM", 0, 30], 5: ["AVERAGE", 1, 30], 6: ["MIN", 1, 30], 7: ["MAX", 1, 30], 8: ["ROW", 0, 1], 9: ["COLUMN", 0, 1], 10: ["NA", 0, 0], 11: ["NPV", 2, 30], 12: ["STDEV", 1, 30], 13: ["DOLLAR", 1, 2], 14: ["FIXED", 2, 3], 15: ["SIN", 1, 1], 16: ["COS", 1, 1], 17: ["TAN", 1, 1], 18: ["ATAN", 1, 1], 19: ["PI", 0, 0], 20: ["SQRT", 1, 1], 21: ["EXP", 1, 1], 22: ["LN", 1, 1], 23: ["LOG10", 1, 1], 24: ["ABS", 1, 1], 25: ["INT", 1, 1], 26: ["SIGN", 1, 1], 27: ["ROUND", 2, 2], 28: ["LOOKUP", 2, 3], 29: ["INDEX", 2, 4], 30: ["REPT", 2, 2], 31: ["MID", 3, 3], 32: ["LEN", 1, 1], 33: ["VALUE", 1, 1], 34: ["TRUE", 0, 0], 35: ["FALSE", 0, 0], 36: ["AND", 1, 30], 37: ["OR", 1, 30], 38: ["NOT", 1, 1], 39: ["MOD", 2, 2], 40: ["DCOUNT", 3, 3], 41: ["DSUM", 3, 3], 42: ["DAVERAGE", 3, 3], 43: ["DMIN", 3, 3], 44: ["DMAX", 3, 3], 45: ["DSTDEV", 3, 3], 46: ["VAR", 1, 30], 47: ["DVAR", 3, 3], 48: ["TEXT", 2, 2], 49: ["LINEST", 1, 4], 50: ["TREND", 1, 4], 51: ["LOGEST", 1, 4], 52: ["GROWTH", 1, 4], 53: ["GOTO", -1, -1], 54: ["HALT", -1, -1], 55: ["RETURN", -1, -1], 56: ["PV", 3, 5], 57: ["FV", 3, 5], 58: ["NPER", 3, 5], 59: ["PMT", 3, 5], 60: ["RATE", 3, 6], 61: ["MIRR", 3, 3], 62: ["IRR", 1, 2], 63: ["RAND", 0, 0], 64: ["MATCH", 2, 3], 65: ["DATE", 3, 3], 66: ["TIME", 3, 3], 67: ["DAY", 1, 1], 68: ["MONTH", 1, 1], 69: ["YEAR", 1, 1], 70: ["WEEKDAY", 1, 2], 71: ["HOUR", 1, 1], 72: ["MINUTE", 1, 1], 73: ["SECOND", 1, 1], 74: ["NOW", 0, 0], 75: ["AREAS", 1, 1], 76: ["ROWS", 1, 1], 77: ["COLUMNS", 1, 1], 78: ["OFFSET", 3, 5], 79: ["ABSREF", -1, -1], 80: ["RELREF", -1, -1], 81: ["ARGUMENT", -1, -1], 82: ["SEARCH", 2, 3], 83: ["TRANSPOSE", 1, 1], 84: ["ERROR", -1, -1], 85: ["STEP", -1, -1], 86: ["TYPE", 1, 1], 87: ["ECHO", -1, -1], 88: ["SETNAME", -1, -1], 89: ["CALLER", -1, -1], 90: ["DEREF", -1, -1], 91: ["WINDOWS", -1, -1], 92: ["SERIES", 4, 4], 93: ["DOCUMENTS", -1, -1], 94: ["ACTIVE.CELL", -1, -1], 95: ["SELECTION", -1, -1], 96: ["RESULT", -1, -1], 97: ["ATAN2", 2, 2], 98: ["ASIN", 1, 1], 99: ["ACOS", 1, 1], 100: ["CHOOSE", 2, 30], 101: ["HLOOKUP", 3, 4], 102: ["VLOOKUP", 3, 4], 103: ["LINKS", -1, -1], 104: ["INPUT", -1, -1], 105: ["ISREF", 1, 1], 106: ["GET.FORMULA", 1, 1], 107: ["GET.NAME", 1, 1], 108: ["SET.VALUE", -1, -1], 109: ["LOG", 1, 2], 110: ["EXEC", -1, -1], 111: ["CHAR", 1, 1], 112: ["LOWER", 1, 1], 113: ["UPPER", 1, 1], 114: ["PROPER", 1, 1], 115: ["LEFT", 1, 2], 116: ["RIGHT", 1, 2], 117: ["EXACT", 2, 2], 118: ["TRIM", 1, 1], 119: ["REPLACE", 4, 4], 120: ["SUBSTITUTE", 3, 4], 121: ["CODE", 1, 1], 122: ["NAMES", -1, -1], 123: ["DIRECTORY", -1, -1], 124: ["FIND", 2, 3], 125: ["CELL", 1, 2], 126: ["ISERR", 1, 1], 127: ["ISTEXT", 1, 1], 128: ["ISNUMBER", 1, 1], 129: ["ISBLANK", 1, 1], 130: ["T", 1, 1], 131: ["N", 1, 1], 132: ["FOPEN", -1, -1], 133: ["FCLOSE", -1, -1], 134: ["FSIZE", -1, -1], 135: ["FREADLN", -1, -1], 136: ["FREAD", -1, -1], 137: ["FWRITELN", -1, -1], 138: ["FWRITE", -1, -1], 139: ["FPOS", -1, -1], 140: ["DATEVALUE", 1, 1], 141: ["TIMEVALUE", 1, 1], 142: ["SLN", 3, 3], 143: ["SYD", 4, 4], 144: ["DDB", 4, 5], 145: ["GET.DEF", -1, -1], 146: ["REFTEXT", -1, -1], 147: ["TEXTREF", -1, -1], 148: ["INDIRECT", 1, 2], 149: ["REGISTER", -1, -1], 150: ["CALL", -1, -1], 151: ["ADD.BAR", -1, -1], 152: ["ADD.MENU", -1, -1], 153: ["ADD.COMMAND", -1, -1], 154: ["ENABLE.COMMAND", -1, -1], 155: ["CHECK.COMMAND", -1, -1], 156: ["RENAME.COMMAND", -1, -1], 157: ["SHOW.BAR", -1, -1], 158: ["DELETE.MENU", -1, -1], 159: ["DELETE.COMMAND", -1, -1], 160: ["GET.CHART.ITEM", -1, -1], 161: ["DIALOG.BOX", -1, -1], 162: ["CLEAN", 1, 1], 163: ["MDETERM", 1, 1], 164: ["MINVERSE", 1, 1], 165: ["MMULT", 2, 2], 166: ["FILES", -1, -1], 167: ["IPMT", 4, 6], 168: ["PPMT", 4, 6], 169: ["COUNTA", 0, 30], 170: ["CANCELKEY", -1, -1], 171: ["FOR", -1, -1], 172: ["WHILE", -1, -1], 173: ["BREAK", -1, -1], 174: ["NEXT", -1, -1], 175: ["INITIATE", -1, -1], 176: ["REQUEST", -1, -1], 177: ["POKE", -1, -1], 178: ["EXECUTE", -1, -1], 179: ["TERMINATE", -1, -1], 180: ["RESTART", -1, -1], 181: ["HELP", -1, -1], 182: ["GET.BAR", -1, -1], 183: ["PRODUCT", 0, 30], 184: ["FACT", 1, 1], 185: ["GET.CELL", -1, -1], 186: ["GET.WORKSPACE", -1, -1], 187: ["GET.WINDOW", -1, -1], 188: ["GET.DOCUMENT", -1, -1], 189: ["DPRODUCT", 3, 3], 190: ["ISNONTEXT", 1, 1], 191: ["GET.NOTE", -1, -1], 192: ["NOTE", -1, -1], 193: ["STDEVP", 1, 30], 194: ["VARP", 1, 30], 195: ["DSTDEVP", 3, 3], 196: ["DVARP", 3, 3], 197: ["TRUNC", 1, 2], 198: ["ISLOGICAL", 1, 1], 199: ["DCOUNTA", 3, 3], 200: ["DELETE.BAR", -1, -1], 201: ["UNREGISTER", -1, -1], 202: ["EXCELFUNC202", -1, -1], 203: ["EXCELFUNC203", -1, -1], 204: ["USDOLLAR", 1, 2], 205: ["FINDB", 2, 3], 206: ["SEARCHB", 2, 3], 207: ["REPLACEB", 4, 4], 208: ["LEFTB", 1, 2], 209: ["RIGHTB", 1, 2], 210: ["MIDB", 3, 3], 211: ["LENB", 1, 1], 212: ["ROUNDUP", 2, 2], 213: ["ROUNDDOWN", 2, 2], 214: ["ASC", 1, 1], 215: ["DBCS", 1, 1], 216: ["RANK", 2, 3], 217: ["EXCELFUNC217", -1, -1], 218: ["EXCELFUNC218", -1, -1], 219: ["ADDRESS", 2, 5], 220: ["DAYS360", 2, 3], 221: ["TODAY", 0, 0], 222: ["VDB", 5, 7], 223: ["ELSE", -1, -1], 224: ["ELSE.IF", -1, -1], 225: ["END.IF", -1, -1], 226: ["FOR.CELL", -1, -1], 227: ["MEDIAN", 1, 30], 228: ["SUMPRODUCT", 1, 30], 229: ["SINH", 1, 1], 230: ["COSH", 1, 1], 231: ["TANH", 1, 1], 232: ["ASINH", 1, 1], 233: ["ACOSH", 1, 1], 234: ["ATANH", 1, 1], 235: ["DGET", 3, 3], 236: ["CREATE.OBJECT", -1, -1], 237: ["VOLATILE", -1, -1], 238: ["LAST.ERROR", -1, -1], 239: ["CUSTOM.UNDO", -1, -1], 240: ["CUSTOM.REPEAT", -1, -1], 241: ["FORMULA.CONVERT", -1, -1], 242: ["GET.LINK.INFO", -1, -1], 243: ["TEXT.BOX", -1, -1], 244: ["INFO", 1, 1], 245: ["GROUP", -1, -1], 246: ["GET.OBJECT", -1, -1], 247: ["DB", 4, 5], 248: ["PAUSE", -1, -1], 249: ["EXCELFUNC249", -1, -1], 250: ["EXCELFUNC250", -1, -1], 251: ["RESUME", -1, -1], 252: ["FREQUENCY", 2, 2], 253: ["ADD.TOOLBAR", -1, -1], 254: ["DELETE.TOOLBAR", -1, -1], 255: ["extension slot", -1, -1], 256: ["RESET.TOOLBAR", -1, -1], 257: ["EVALUATE", -1, -1], 258: ["GET.TOOLBAR", -1, -1], 259: ["GET.TOOL", -1, -1], 260: ["SPELLING.CHECK", -1, -1], 261: ["ERROR.TYPE", 1, 1], 262: ["APP.TITLE", -1, -1], 263: ["WINDOW.TITLE", -1, -1], 264: ["SAVE.TOOLBAR", -1, -1], 265: ["ENABLE.TOOL", -1, -1], 266: ["PRESS.TOOL", -1, -1], 267: ["REGISTER.ID", -1, -1], 268: ["GET.WORKBOOK", -1, -1], 269: ["AVEDEV", 1, 30], 270: ["BETADIST", 3, 5], 271: ["GAMMALN", 1, 1], 272: ["BETAINV", 3, 5], 273: ["BINOMDIST", 4, 4], 274: ["CHIDIST", 2, 2], 275: ["CHIINV", 2, 2], 276: ["COMBIN", 2, 2], 277: ["CONFIDENCE", 3, 3], 278: ["CRITBINOM", 3, 3], 279: ["EVEN", 1, 1], 280: ["EXPONDIST", 3, 3], 281: ["FDIST", 3, 3], 282: ["FINV", 3, 3], 283: ["FISHER", 1, 1], 284: ["FISHERINV", 1, 1], 285: ["FLOOR", 2, 2], 286: ["GAMMADIST", 4, 4], 287: ["GAMMAINV", 3, 3], 288: ["CEILING", 2, 2], 289: ["HYPGEOMDIST", 4, 4], 290: ["LOGNORMDIST", 3, 3], 291: ["LOGINV", 3, 3], 292: ["NEGBINOMDIST", 3, 3], 293: ["NORMDIST", 4, 4], 294: ["NORMSDIST", 1, 1], 295: ["NORMINV", 3, 3], 296: ["NORMSINV", 1, 1], 297: ["STANDARDIZE", 3, 3], 298: ["ODD", 1, 1], 299: ["PERMUT", 2, 2], 300: ["POISSON", 3, 3], 301: ["TDIST", 3, 3], 302: ["WEIBULL", 4, 4], 303: ["SUMXMY2", 2, 2], 304: ["SUMX2MY2", 2, 2], 305: ["SUMX2PY2", 2, 2], 306: ["CHITEST", 2, 2], 307: ["CORREL", 2, 2], 308: ["COVAR", 2, 2], 309: ["FORECAST", 3, 3], 310: ["FTEST", 2, 2], 311: ["INTERCEPT", 2, 2], 312: ["PEARSON", 2, 2], 313: ["RSQ", 2, 2], 314: ["STEYX", 2, 2], 315: ["SLOPE", 2, 2], 316: ["TTEST", 4, 4], 317: ["PROB", 3, 4], 318: ["DEVSQ", 1, 30], 319: ["GEOMEAN", 1, 30], 320: ["HARMEAN", 1, 30], 321: ["SUMSQ", 0, 30], 322: ["KURT", 1, 30], 323: ["SKEW", 1, 30], 324: ["ZTEST", 2, 3], 325: ["LARGE", 2, 2], 326: ["SMALL", 2, 2], 327: ["QUARTILE", 2, 2], 328: ["PERCENTILE", 2, 2], 329: ["PERCENTRANK", 2, 3], 330: ["MODE", 1, 30], 331: ["TRIMMEAN", 2, 2], 332: ["TINV", 2, 2], 333: ["EXCELFUNC333", -1, -1], 334: ["MOVIE.COMMAND", -1, -1], 335: ["GET.MOVIE", -1, -1], 336: ["CONCATENATE", 0, 30], 337: ["POWER", 2, 2], 338: ["PIVOT.ADD.DATA", -1, -1], 339: ["GET.PIVOT.TABLE", -1, -1], 340: ["GET.PIVOT.FIELD", -1, -1], 341: ["GET.PIVOT.ITEM", -1, -1], 342: ["RADIANS", 1, 1], 343: ["DEGREES", 1, 1], 344: ["SUBTOTAL", 2, 30], 345: ["SUMIF", 2, 3], 346: ["COUNTIF", 2, 2], 347: ["COUNTBLANK", 1, 1], 348: ["SCENARIO.GET", -1, -1], 349: ["OPTIONS.LISTS.GET", -1, -1], 350: ["ISPMT", 4, 4], 351: ["DATEDIF", 3, 3], 352: ["DATESTRING", 1, 1], 353: ["NUMBERSTRING", 2, 2], 354: ["ROMAN", 1, 2], 355: ["OPEN.DIALOG", -1, -1], 356: ["SAVE.DIALOG", -1, -1], 357: ["VIEW.GET", -1, -1], 358: ["GETPIVOTDATA", 2, 30], 359: ["HYPERLINK", 1, 2], 360: ["PHONETIC", 1, 1], 361: ["AVERAGEA", 1, 30], 362: ["MAXA", 1, 30], 363: ["MINA", 1, 30], 364: ["STDEVPA", 1, 30], 365: ["VARPA", 1, 30], 366: ["STDEVA", 1, 30], 367: ["VARA", 1, 30], 368: ["BAHTTEXT", 1, 1], 369: ["THAIDAYOFWEEK", 1, 1], 370: ["THAIDIGIT", 1, 1], 371: ["THAIMONTHOFYEAR", 1, 1], 372: ["THAINUMSOUND", 1, 1], 373: ["THAINUMSTRING", 1, 1], 374: ["THAISTRINGLENGTH", 1, 1], 375: ["ISTHAIDIGIT", 1, 1], 376: ["ROUNDBAHTDOWN", 1, 1], 377: ["ROUNDBAHTUP", 1, 1], 378: ["THAIYEAR", 1, 1], 379: ["RTD", 2, 5], 380: ["ISHYPERLINK", 1, 1] };
+var en = { 3: ["+", 3], 4: ["-", 3], 5: ["*", 4], 6: ["/", 4], 7: ["^", 5], 8: ["&", 2], 9: ["<", 1], 10: ["<=", 1], 11: ["=", 1], 12: [">=", 1], 13: [">", 1], 14: ["<>", 1], 15: [" ", 7], 16: [",", 6], 17: [":", 8] };
+var Ce = { 0: "#NULL!", 7: "#DIV/0!", 15: "#VALUE!", 23: "#REF!", 29: "#NAME?", 36: "#NUM!", 42: "#N/A" };
+var Ln = { 14: [2, 3, 2], 70: [2, 4, 1], 101: [2, 4, 3], 102: [2, 4, 3], 197: [2, 2, 1], 220: [3, 4, 2] };
+function Nt(s, e, [n2, r, t, u]) {
+  let i = n2 === r && s === n2 && (e === t - 1 || e === u + 1), h2 = t === u && e === t && (s === n2 - 1 || s === r + 1);
+  return n2 <= r && t <= u && u < 256 && i !== h2;
 }
-function ot(s, e) {
-  let r = new h(s), n2 = [], t = 0, u = 0, i = (m2, f = 99, o) => {
+function at(s, e) {
+  let n2 = new h(s), r = [], t = 0, u = 0, i = (m2, f = 99, o) => {
     if (u += m2.length, u > e.limit) throw new ke("resource-limit", "ssconvert BIFF formula work limit exceeded");
-    e.accountWork?.(m2.length), n2.push({ text: m2, precedence: f, ...o === void 0 ? {} : { functionName: o } });
+    e.accountWork?.(m2.length), r.push({ text: m2, precedence: f, ...o === void 0 ? {} : { functionName: o } });
   };
   function h2(m2, f) {
     let o = e.names[m2 - 1], E = e.nameSheets === void 0 ? f : e.nameSheets[m2 - 1];
     if (E !== void 0) return "'" + E.split("'").join("''") + "'!" + o;
     if (e.globalNameDefinition) return o;
     if (e.nameSheets !== void 0) for (let k = 0; k < e.names.length; k++) {
-      let S = e.names[k];
-      if (u += S.length + 1, u > e.limit) throw new ke("resource-limit", "ssconvert BIFF formula work limit exceeded");
-      if (e.accountWork?.(S.length + 1), e.nameSheets[k] !== void 0 && S.toUpperCase() === o.toUpperCase()) return "[]" + o;
+      let N = e.names[k];
+      if (u += N.length + 1, u > e.limit) throw new ke("resource-limit", "ssconvert BIFF formula work limit exceeded");
+      if (e.accountWork?.(N.length + 1), e.nameSheets[k] !== void 0 && N.toUpperCase() === o.toUpperCase()) return "[]" + o;
     }
     return o;
   }
   let g = () => {
-    let m2 = n2.pop();
+    let m2 = r.pop();
     return m2 || n("formula stack underflow"), m2;
   }, a = (m2, f) => m2.precedence < f ? `(${m2.text})` : m2.text, l = (m2, f) => {
-    let o = r.u16(m2), E = e.revision >= 8 ? r.u16(m2 + 2) : r.u8(m2 + 2), k = e.revision >= 8 ? !!(E & 32768) : !!(o & 32768), S = e.revision >= 8 ? !!(E & 16384) : !!(o & 16384), A = e.revision >= 8 ? o : o & 16383, R2 = E & 255;
+    let o = n2.u16(m2), E = e.revision >= 8 ? n2.u16(m2 + 2) : n2.u8(m2 + 2), k = e.revision >= 8 ? !!(E & 32768) : !!(o & 32768), N = e.revision >= 8 ? !!(E & 16384) : !!(o & 16384), A = e.revision >= 8 ? o : o & 16383, S = E & 255;
     if (f && k) {
-      let N = e.revision >= 8 ? 65536 : 16384;
-      A = (e.row + (A >= N / 2 ? A - N : A) + N) % N;
+      let F = e.revision >= 8 ? 65536 : 16384;
+      A = (e.row + (A >= F / 2 ? A - F : A) + F) % F;
     }
-    f && S && (R2 = (e.column + (R2 >= 128 ? R2 - 256 : R2) + 256) % 256);
+    f && N && (S = (e.column + (S >= 128 ? S - 256 : S) + 256) % 256);
     let B = "";
-    for (let N = R2 + 1; N; N = Math.floor((N - 1) / 26)) B = String.fromCharCode(65 + (N - 1) % 26) + B;
-    return `${S ? "" : "$"}${B}${k ? "" : "$"}${A + 1}`;
+    for (let F = S + 1; F; F = Math.floor((F - 1) / 26)) B = String.fromCharCode(65 + (F - 1) % 26) + B;
+    return `${N ? "" : "$"}${B}${k ? "" : "$"}${A + 1}`;
   }, d = (m2, f) => {
     let o = e.revision >= 8 ? 2 : 1, E = new Uint8Array(2 + o), k = new Uint8Array(2 + o);
-    E.set(r.slice(m2, 2)), E.set(r.slice(m2 + 4, o), 2), k.set(r.slice(m2 + 2, 2)), k.set(r.slice(m2 + 4 + o, o), 2);
-    let S = { ...e }, A = f ? 44 : 36;
-    return ot(new Uint8Array([A, ...E]), S).slice(1) + ":" + ot(new Uint8Array([A, ...k]), S).slice(1);
+    E.set(n2.slice(m2, 2)), E.set(n2.slice(m2 + 4, o), 2), k.set(n2.slice(m2 + 2, 2)), k.set(n2.slice(m2 + 4 + o, o), 2);
+    let N = { ...e }, A = f ? 44 : 36;
+    return at(new Uint8Array([A, ...E]), N).slice(1) + ":" + at(new Uint8Array([A, ...k]), N).slice(1);
   };
   for (; t < s.length; ) {
-    let m2 = r.u8(t++), f = m2 >= 32 ? m2 & 31 | 32 : m2;
-    if (e.shared && f === 24 && n("ELF label in shared formula"), Jt[f]) {
-      let [o, E] = Jt[f], k = g(), S = g();
-      i(a(S, E) + o + a(k, E + (f === 4 || f === 6 || f === 7 ? 1 : 0)), E);
+    let m2 = n2.u8(t++), f = m2 >= 32 ? m2 & 31 | 32 : m2;
+    if (e.shared && f === 24 && n("ELF label in shared formula"), en[f]) {
+      let [o, E] = en[f], k = g(), N = g();
+      i(a(N, E) + o + a(k, E + (f === 4 || f === 6 || f === 7 ? 1 : 0)), E);
     } else if (f === 18 || f === 19) {
       let o = g();
       i((f === 18 ? "+" : "-") + a(o, 5), 5);
@@ -716,87 +716,87 @@ function ot(s, e) {
     } else if (f === 21) i("(" + g().text + ")");
     else if (f === 22) i("");
     else if (f === 23) {
-      let o = r.u8(t++), E;
+      let o = n2.u8(t++), E;
       if (e.revision >= 8) {
-        let k = r.u8(t++);
+        let k = n2.u8(t++);
         if (k > 1 && n("invalid formula string flags"), k) {
-          r.check(t, o * 2), E = "";
-          for (let S = 0; S < o; S++) E += String.fromCharCode(r.u16(t + S * 2));
-        } else E = m(r.slice(t, o), 1200);
+          n2.check(t, o * 2), E = "";
+          for (let N = 0; N < o; N++) E += String.fromCharCode(n2.u16(t + N * 2));
+        } else E = m(n2.slice(t, o), 1200);
         t += o * (k ? 2 : 1);
-      } else E = m(r.slice(t, o), e.codepage), t += o;
+      } else E = m(n2.slice(t, o), e.codepage), t += o;
       i('"' + E.split('"').join('""') + '"', 99, E);
-    } else if (f === 24 && e.revision === 8 && [1, 16].includes(r.u8(t))) r.check(t, 5), t += 5, i("#NAME?");
-    else if (f === 24 && e.revision === 8 && [2, 3, 6, 7, 10, 11].includes(r.u8(t))) {
-      r.check(t, 5);
-      let o = r.u8(t), E = o === 11 ? e.readLabels?.() : void 0;
+    } else if (f === 24 && e.revision === 8 && [1, 16].includes(n2.u8(t))) n2.check(t, 5), t += 5, i("#NAME?");
+    else if (f === 24 && e.revision === 8 && [2, 3, 6, 7, 10, 11].includes(n2.u8(t))) {
+      n2.check(t, 5);
+      let o = n2.u8(t), E = o === 11 ? e.readLabels?.() : void 0;
       o === 11 && !E?.cells.length && n("missing multiple label references");
-      let k = E?.cells[E.cells.length - 1], S = k?.row ?? r.u16(t + 1), A = k ? k.column | (E.relative ? 32768 : 0) : r.u16(t + 3), R2 = A & 16383;
-      R2 > 255 && n("invalid label column");
-      let B = A & 32768 ? "" : "$", N = o === 2 || o === 6 ? "row" : "column", w2 = "";
-      for (let x = R2 + 1; x; x = Math.floor((x - 1) / 26)) w2 = String.fromCharCode(65 + (x - 1) % 26) + w2;
-      let D = (A & 16384 ? ".quoted" : "") + ":" + B + w2 + B + (S + 1);
+      let k = E?.cells[E.cells.length - 1], N = k?.row ?? n2.u16(t + 1), A = k ? k.column | (E.relative ? 32768 : 0) : n2.u16(t + 3), S = A & 16383;
+      S > 255 && n("invalid label column");
+      let B = A & 32768 ? "" : "$", F = o === 2 || o === 6 ? "row" : "column", p = "";
+      for (let x = S + 1; x; x = Math.floor((x - 1) / 26)) p = String.fromCharCode(65 + (x - 1) % 26) + p;
+      let D = (A & 16384 ? ".quoted" : "") + ":" + B + p + B + (N + 1);
       if (t += 5, o === 10 || o === 11) {
-        r.check(t, 9);
-        let x = r.u8(t);
+        n2.check(t, 9);
+        let x = n2.u8(t);
         [37, 69, 101, 43, 75, 107].includes(x) || n("radical label requires Area or AreaErr");
         let b = (x & 31) === 11;
-        !b && (!St(S, R2, [r.u16(t + 1), r.u16(t + 3), r.u16(t + 5) & 16383, r.u16(t + 7) & 16383]) || E && (R2 !== (r.u16(t + 5) & 16383) || (r.u16(t + 5) & 16383) !== (r.u16(t + 7) & 16383))) && n("invalid radical label area");
+        !b && (!Nt(N, S, [n2.u16(t + 1), n2.u16(t + 3), n2.u16(t + 5) & 16383, n2.u16(t + 7) & 16383]) || E && (S !== (n2.u16(t + 5) & 16383) || (n2.u16(t + 5) & 16383) !== (n2.u16(t + 7) & 16383))) && n("invalid radical label area");
         let O = E?.cells.map((C2) => {
           let v = "";
-          for (let F = C2.column + 1; F; F = Math.floor((F - 1) / 26)) v = String.fromCharCode(65 + (F - 1) % 26) + v;
+          for (let R2 = C2.column + 1; R2; R2 = Math.floor((R2 - 1) / 26)) v = String.fromCharCode(65 + (R2 - 1) % 26) + v;
           return B + v + B + (C2.row + 1);
         });
         i("@range" + ((x & 96) === 64 ? ".value" : (x & 96) === 96 ? ".array" : "") + (O ? ".multi:{" + O.join(";") + "}" : D) + "->" + (b ? "#REF!" : d(t + 1, false))), t += 9;
-      } else i("@" + N + (o >= 6 ? ".value" : "") + D);
+      } else i("@" + F + (o >= 6 ? ".value" : "") + D);
     } else if (f === 25) {
-      let o = e.revision === 2 ? 1 : 2, E = r.u8(t), k = o === 1 ? r.u8(t + 1) : r.u16(t + 1);
-      t += 1 + o, E & 4 ? (r.check(t, (k + 1) * o), t += (k + 1) * o) : E & 16 && i("SUM(" + g().text + ")");
-    } else if (f === 28) i(Be[r.u8(t++)] ?? "#UNKNOWN!");
-    else if (f === 29) i(r.u8(t++) ? "TRUE" : "FALSE");
-    else if (f === 30) i(String(r.u16(t))), t += 2;
+      let o = e.revision === 2 ? 1 : 2, E = n2.u8(t), k = o === 1 ? n2.u8(t + 1) : n2.u16(t + 1);
+      t += 1 + o, E & 4 ? (n2.check(t, (k + 1) * o), t += (k + 1) * o) : E & 16 && i("SUM(" + g().text + ")");
+    } else if (f === 28) i(Ce[n2.u8(t++)] ?? "#UNKNOWN!");
+    else if (f === 29) i(n2.u8(t++) ? "TRUE" : "FALSE");
+    else if (f === 30) i(String(n2.u16(t))), t += 2;
     else if (f === 31) {
-      let o = r.f64(t);
+      let o = n2.f64(t);
       Number.isFinite(o) || n("invalid formula number"), i(String(o)), t += 8;
     } else if (f === 32 && e.readArray) {
       let o = e.revision === 2 ? 6 : 7;
-      r.check(t, o), t += o, i(e.readArray());
+      n2.check(t, o), t += o, i(e.readArray());
     } else if (f === 33 || f === 34) {
-      let o = f === 34 ? r.u8(t++) & 127 : void 0, E = e.revision >= 4 ? r.u16(t) : r.u8(t);
+      let o = f === 34 ? n2.u8(t++) & 127 : void 0, E = e.revision >= 4 ? n2.u16(t) : n2.u8(t);
       if (t += e.revision >= 4 ? 2 : 1, (E & 32767) === 255) {
         if (o === void 0) throw new ke("unsupported-feature", "Unsupported ssconvert feature: fixed-arity BIFF custom function");
-        (o < 1 || o > n2.length) && n("invalid custom function argument count");
-        let N = n2.splice(n2.length - o + 1).map((x) => x.text), w2 = g().functionName;
-        if (w2 === void 0) return i('#"#Unknown!"'), "=" + g().text;
-        for (let x of ["_xlfn.", "_xlfnodf."]) if (w2.startsWith(x)) {
-          let b = w2.slice(x.length).toUpperCase(), O = x === "_xlfn." ? On.functionPrefixAliases?.["_XLFN."]?.[b] ?? b : b;
-          Un[O] && (w2 = O);
+        (o < 1 || o > r.length) && n("invalid custom function argument count");
+        let F = r.splice(r.length - o + 1).map((x) => x.text), p = g().functionName;
+        if (p === void 0) return i('#"#Unknown!"'), "=" + g().text;
+        for (let x of ["_xlfn.", "_xlfnodf."]) if (p.startsWith(x)) {
+          let b = p.slice(x.length).toUpperCase(), O = x === "_xlfn." ? Mn.functionPrefixAliases?.["_XLFN."]?.[b] ?? b : b;
+          On[O] && (p = O);
           break;
         }
-        let D = Zt("=" + w2 + "()", { position: { sheet: "", row: e.row, column: e.column }, maximumLength: e.limit, maximumNodes: 1 });
-        if (!D.ok || D.document.root.kind !== "call" || D.document.root.spelling !== w2) throw new ke("unsupported-feature", "Unsupported ssconvert feature: BIFF custom function name");
-        i(w2 + "(" + N.join(",") + ")");
+        let D = Jt("=" + p + "()", { position: { sheet: "", row: e.row, column: e.column }, maximumLength: e.limit, maximumNodes: 1 });
+        if (!D.ok || D.document.root.kind !== "call" || D.document.root.spelling !== p) throw new ke("unsupported-feature", "Unsupported ssconvert feature: BIFF custom function name");
+        i(p + "(" + F.join(",") + ")");
         continue;
       }
-      let k = rt[E & 32767], S = Mn[E & 32767], A = S && e.revision >= S[0] && e.revision <= S[1] ? S[2] : k && k[1] === k[2] ? k[1] : void 0, R2 = o ?? A;
-      if (!k || R2 === void 0) throw new ke("unsupported-feature", `Unsupported ssconvert feature: BIFF function ${E}`);
-      (R2 < 0 || R2 > n2.length) && n("invalid function argument count");
-      let B = n2.splice(n2.length - R2, R2).map((N) => N.text);
+      let k = it[E & 32767], N = Ln[E & 32767], A = N && e.revision >= N[0] && e.revision <= N[1] ? N[2] : k && k[1] === k[2] ? k[1] : void 0, S = o ?? A;
+      if (!k || S === void 0) throw new ke("unsupported-feature", `Unsupported ssconvert feature: BIFF function ${E}`);
+      (S < 0 || S > r.length) && n("invalid function argument count");
+      let B = r.splice(r.length - S, S).map((F) => F.text);
       i(k[0] + "(" + B.join(",") + ")");
     } else if (f === 57) {
       let o = e.revision >= 8 ? 6 : 24;
-      r.check(t, o);
-      let E = r.u16(t), k = E >= 32768 ? E - 65536 : E, S = e.revision >= 8 ? r.u32(t + 2) : r.u16(t + 10);
+      n2.check(t, o);
+      let E = n2.u16(t), k = E >= 32768 ? E - 65536 : E, N = e.revision >= 8 ? n2.u32(t + 2) : n2.u16(t + 10);
       t += o;
-      let A = e.revision >= 8 ? E : k > 0 ? k - 1 : void 0, R2 = A === void 0 ? void 0 : e.externalNames?.[A];
-      if (R2 !== void 0) {
-        let b = R2[S - 1];
+      let A = e.revision >= 8 ? E : k > 0 ? k - 1 : void 0, S = A === void 0 ? void 0 : e.externalNames?.[A];
+      if (S !== void 0) {
+        let b = S[N - 1];
         if (!b) {
           i("#REF!");
           continue;
         }
         if (b.workbook !== void 0) {
-          let O = "[" + st(b.workbook, "'", it) + "]" + (b.sheet === void 0 ? "" : st(b.sheet, "'", it) + "!") + b.name, C2 = Zt("=" + O, { position: { sheet: e.currentSheet ?? "", row: e.row, column: e.column }, maximumNodes: e.limit, maximumLength: e.limit }), v = C2.ok ? C2.document.root : void 0;
+          let O = "[" + ot(b.workbook, "'", st) + "]" + (b.sheet === void 0 ? "" : ot(b.sheet, "'", st) + "!") + b.name, C2 = Jt("=" + O, { position: { sheet: e.currentSheet ?? "", row: e.row, column: e.column }, maximumNodes: e.limit, maximumLength: e.limit }), v = C2.ok ? C2.document.root : void 0;
           if (v?.kind !== "name" || v.name !== b.name || v.workbook !== b.workbook || v.sheet !== b.sheet) throw new ke("unsupported-feature", "Unsupported ssconvert feature: invalid external BIFF name");
           i(O);
           continue;
@@ -808,92 +808,92 @@ function ot(s, e) {
       if (e.revision < 8 && k >= 0) throw new ke("unsupported-feature", "Unsupported ssconvert feature: external BIFF workbook reference");
       let B = e.revision >= 8 ? (e.externalNameSheets ?? e.externalSheets)[E] : e.externalSheets[-k - 1];
       if (B === void 0) throw new ke("unsupported-feature", "Unsupported ssconvert feature: external BIFF workbook reference");
-      let N = e.resolveName?.(S, true), w2 = N?.value ?? S;
-      if (typeof w2 == "string") {
-        i(w2, 99, N?.functionName);
+      let F = e.resolveName?.(N, true), p = F?.value ?? N;
+      if (typeof p == "string") {
+        i(p, 99, F?.functionName);
         continue;
       }
-      let D = e.names[w2 - 1];
+      let D = e.names[p - 1];
       if (!D) {
         i("#REF!");
         continue;
       }
-      let x = B === null ? e.nameSheets?.[w2 - 1] ?? e.currentSheet : typeof B == "string" ? B : B[0];
-      i(h2(w2, x), 99, N === void 0 ? D : N.functionName);
+      let x = B === null ? e.nameSheets?.[p - 1] ?? e.currentSheet : typeof B == "string" ? B : B[0];
+      i(h2(p, x), 99, F === void 0 ? D : F.functionName);
     } else if (f === 35) {
-      let o = e.revision >= 8 ? r.u32(t) : r.u16(t), E = e.revision >= 8 ? 4 : e.revision >= 5 ? 14 : e.revision === 2 ? 7 : 10;
-      r.check(t, E), t += E;
-      let k = e.resolveName?.(o, false), S = k?.value ?? o;
-      if (typeof S == "string") {
-        i(S, 99, k?.functionName);
+      let o = e.revision >= 8 ? n2.u32(t) : n2.u16(t), E = e.revision >= 8 ? 4 : e.revision >= 5 ? 14 : e.revision === 2 ? 7 : 10;
+      n2.check(t, E), t += E;
+      let k = e.resolveName?.(o, false), N = k?.value ?? o;
+      if (typeof N == "string") {
+        i(N, 99, k?.functionName);
         continue;
       }
-      let A = e.names[S - 1];
-      A || n("invalid formula name index"), i(h2(S), 99, k === void 0 ? A : k.functionName);
+      let A = e.names[N - 1];
+      A || n("invalid formula name index"), i(h2(N), 99, k === void 0 ? A : k.functionName);
     } else if (f === 36 || f === 44) i(l(t, f === 44)), t += e.revision >= 8 ? 4 : 3;
     else if (f === 37 || f === 45) i(d(t, f === 45)), t += e.revision >= 8 ? 8 : 6;
     else if (f === 42 || f === 43) {
       let o = e.revision >= 8 ? f === 42 ? 4 : 8 : f === 42 ? 3 : 6;
-      r.check(t, o), t += o, i("#REF!");
+      n2.check(t, o), t += o, i("#REF!");
     } else if (f === 60 || f === 61) {
       let o = e.revision >= 8 ? f === 60 ? 6 : 10 : f === 60 ? 17 : 20;
-      r.check(t, o), t += o, i("#REF!");
+      n2.check(t, o), t += o, i("#REF!");
     } else if (f === 58 || f === 59) {
       let o, E;
       if (e.revision >= 8) {
         let B = f === 58 ? 6 : 10;
-        r.check(t, B);
-        let N = r.u16(t);
-        if (E = e.externalWorkbooks?.[N], e.deletedExternalSheets?.[N] || !E && e.unavailableExternalSheets?.[N]) {
+        n2.check(t, B);
+        let F = n2.u16(t);
+        if (E = e.externalWorkbooks?.[F], e.deletedExternalSheets?.[F] || !E && e.unavailableExternalSheets?.[F]) {
           t += B, i("#REF!");
           continue;
         }
-        o = E ? E.first === E.last ? E.first : [E.first, E.last] : e.externalSheets[N], t += 2;
+        o = E ? E.first === E.last ? E.first : [E.first, E.last] : e.externalSheets[F], t += 2;
       } else {
         let B = f === 58 ? 17 : 20;
-        r.check(t, B);
-        let N = (b) => {
-          let O = r.u16(b);
+        n2.check(t, B);
+        let F = (b) => {
+          let O = n2.u16(b);
           return O >= 32768 ? O - 65536 : O;
-        }, w2 = N(t), D = N(t + 10), x = N(t + 12);
-        if (E = w2 > 0 ? e.externalWorkbooks?.[w2 - 1] : void 0, E) o = E.first;
+        }, p = F(t), D = F(t + 10), x = F(t + 12);
+        if (E = p > 0 ? e.externalWorkbooks?.[p - 1] : void 0, E) o = E.first;
         else {
-          if (w2 <= 0 && (D < 0 || x < 0)) {
+          if (p <= 0 && (D < 0 || x < 0)) {
             t += B, i("#REF!");
             continue;
           }
-          let b = e.externalSheets[Math.abs(w2) - 1], C2 = w2 < 0 && D === -w2 - 1 && typeof b == "string" && e.localSheets?.[D] === b ? e.localSheets?.[x] : w2 < 0 && D === x ? b : w2 < 0 && x === 0 ? e.currentSheet ?? null : e.externalSheets[x - 1];
+          let b = e.externalSheets[Math.abs(p) - 1], C2 = p < 0 && D === -p - 1 && typeof b == "string" && e.localSheets?.[D] === b ? e.localSheets?.[x] : p < 0 && D === x ? b : p < 0 && x === 0 ? e.currentSheet ?? null : e.externalSheets[x - 1];
           if (b === void 0 || C2 === void 0 || typeof b == "object" && b !== null || typeof C2 == "object" && C2 !== null) throw new ke("unsupported-feature", "Unsupported ssconvert feature: external BIFF workbook reference");
           o = b === null ? null : C2 === null || b === C2 ? b : [b, C2];
         }
         t += 14;
       }
       if (o === void 0) throw new ke("unsupported-feature", "Unsupported ssconvert feature: external BIFF workbook reference");
-      let k = e.revision < 8 && !!e.shared, S = f === 58 ? l(t, k) : d(t, k);
+      let k = e.revision < 8 && !!e.shared, N = f === 58 ? l(t, k) : d(t, k);
       t += e.revision >= 8 ? f === 58 ? 4 : 8 : f === 58 ? 3 : 6;
-      let R2 = (o === null ? [] : typeof o == "string" ? [o] : o).map((B) => E ? st(B, "'", it) : "'" + B.split("'").join("''") + "'").join(":");
-      i((E ? "[" + st(E.workbook, "'", it) + "]" : "") + (R2 ? R2 + "!" : "") + S);
+      let S = (o === null ? [] : typeof o == "string" ? [o] : o).map((B) => E ? ot(B, "'", st) : "'" + B.split("'").join("''") + "'").join(":");
+      i((E ? "[" + ot(E.workbook, "'", st) + "]" : "") + (S ? S + "!" : "") + N);
     } else if (f === 38 || f === 39 || f === 40) {
       let o = e.revision === 2 ? 4 : 6;
-      r.check(t, o), t += o, f === 38 && e.readMemory?.();
+      n2.check(t, o), t += o, f === 38 && e.readMemory?.();
     } else if (f === 41 || f === 46 || f === 47) {
       let o = e.revision === 2 ? 1 : 2;
-      r.check(t, o), t += o;
+      n2.check(t, o), t += o;
     } else throw new ke("unsupported-feature", `Unsupported ssconvert feature: BIFF formula token 0x${m2.toString(16)}`);
   }
-  return n2.length !== 1 && n("formula stack did not resolve"), "=" + n2[0].text;
+  return r.length !== 1 && n("formula stack did not resolve"), "=" + r[0].text;
 }
-function en(s, e, r) {
-  let n2 = "", t = 0;
+function tn(s, e, n2) {
+  let r = "", t = 0;
   if (s[0] === 1) for (let l = 1; l < s.length; l++) {
     if (s[l] !== 5) continue;
     let d = s[l + 1];
     (d === void 0 || d > s.length - l - 2) && n("truncated external workbook URL");
     let m2 = m(s.subarray(l + 2, l + 2 + d), e);
-    n2 += m(s.subarray(t, l), e) + "" + String.fromCharCode(m2.length) + m2, l += d + 1, t = l + 1;
+    r += m(s.subarray(t, l), e) + "" + String.fromCharCode(m2.length) + m2, l += d + 1, t = l + 1;
   }
-  n2 += m(s.subarray(t), e);
-  let u = vt(r(n2));
+  r += m(s.subarray(t), e);
+  let u = Bt(n2(r));
   if (u === void 0) return;
   let i = u.indexOf("["), h2 = u.indexOf("]");
   if (i < 0) return h2 < 0 ? { workbook: u } : void 0;
@@ -901,302 +901,302 @@ function en(s, e, r) {
   let g = u.slice(0, i) + u.slice(i + 1, h2), a = u.slice(h2 + 1);
   if (!(!a || Array.from(a).some((l) => l.charCodeAt(0) < 32))) return { workbook: g, sheet: a };
 }
-function tn(s) {
-  if (s.length > 254) throw new Nt("unsupported-feature", "Excel BIFF external workbook path is too long");
-  if (!s || Array.from(s).some((n2) => n2.charCodeAt(0) < 32)) throw new Nt("unsupported-feature", "Excel BIFF external workbook path contains control characters");
-  let r = Array.from(s).some((n2) => "/\\:[]".includes(n2)) ? "
" + String.fromCharCode(s.length) + s : "
" + s;
-  if (r.length > 255) throw new Nt("unsupported-feature", "Excel BIFF external workbook path is too long");
-  return r;
+function nn(s) {
+  if (s.length > 254) throw new vt("unsupported-feature", "Excel BIFF external workbook path is too long");
+  if (!s || Array.from(s).some((r) => r.charCodeAt(0) < 32)) throw new vt("unsupported-feature", "Excel BIFF external workbook path contains control characters");
+  let n2 = Array.from(s).some((r) => "/\\:[]".includes(r)) ? "
" + String.fromCharCode(s.length) + s : "
" + s;
+  if (n2.length > 255) throw new vt("unsupported-feature", "Excel BIFF external workbook path is too long");
+  return n2;
 }
-function vt(s) {
+function Bt(s) {
   if (!s || s === "\0" || s[0] === "" || s[0] === "") return;
-  if (s.length > 255 && n("external workbook path is too long"), s[0] !== "
") return Array.from(s).some((r) => r.charCodeAt(0) < 32) ? void 0 : s;
+  if (s.length > 255 && n("external workbook path is too long"), s[0] !== "
") return Array.from(s).some((n2) => n2.charCodeAt(0) < 32) ? void 0 : s;
   let e = "";
-  for (let r = 1; r < s.length; r++) {
-    let n2 = s[r];
-    if (n2 === "
") {
-      let t = s[++r];
+  for (let n2 = 1; n2 < s.length; n2++) {
+    let r = s[n2];
+    if (r === "
") {
+      let t = s[++n2];
       if (t === void 0 && n("truncated external workbook drive"), t !== "@" && !(t >= "A" && t <= "Z" || t >= "a" && t <= "z")) return;
       e += t === "@" ? "\\\\" : t + ":\\";
-    } else if (n2 === "" || n2 === "") e += "\\";
-    else if (n2 === "") e += "..\\";
-    else if (n2 === "") {
-      let t = s.charCodeAt(++r);
-      (!Number.isFinite(t) || t > s.length - r - 1) && n("truncated external workbook URL"), e += s.slice(r + 1, r + 1 + t), r += t;
+    } else if (r === "" || r === "") e += "\\";
+    else if (r === "") e += "..\\";
+    else if (r === "") {
+      let t = s.charCodeAt(++n2);
+      (!Number.isFinite(t) || t > s.length - n2 - 1) && n("truncated external workbook URL"), e += s.slice(n2 + 1, n2 + 1 + t), n2 += t;
     } else {
-      if (n2.charCodeAt(0) < 32) return;
-      e += n2;
+      if (r.charCodeAt(0) < 32) return;
+      e += r;
     }
   }
   return e || void 0;
 }
-function nn(s, e, r, n2, t) {
-  let u = new w(s, n2, r), i = new Uint8Array(8), h2 = new DataView(i.buffer), g = new TextEncoder(), a = n2.limits.workbookWork ?? n2.limits.inputBytes * 8, l = n2.limits.workbookTextBytes ?? n2.limits.inputBytes, d = 0, m2 = 0;
+function rn(s, e, n2, r, t) {
+  let u = new w(s, r, n2), i = new Uint8Array(8), h2 = new DataView(i.buffer), g = new TextEncoder(), a = r.limits.workbookWork ?? r.limits.inputBytes * 8, l = r.limits.workbookTextBytes ?? r.limits.inputBytes, d = 0, m2 = 0;
   return { readArray: () => {
-    n2.signal.throwIfAborted();
-    let k = u.byte(), S = u.word(), A = e >= 8 ? k + 1 : k || 256, R2 = e >= 8 ? S + 1 : S || 1;
-    if (d += A * R2, d > a) throw new at("resource-limit", "ssconvert BIFF array work limit exceeded");
-    t?.(A * R2);
-    let B = [], N = (w2) => {
-      if (m2 += g.encode(w2).length, m2 > l) throw new at("resource-limit", "ssconvert BIFF array text limit exceeded");
-      B.push(w2);
+    r.signal.throwIfAborted();
+    let k = u.byte(), N = u.word(), A = e >= 8 ? k + 1 : k || 256, S = e >= 8 ? N + 1 : N || 1;
+    if (d += A * S, d > a) throw new ft("resource-limit", "ssconvert BIFF array work limit exceeded");
+    t?.(A * S);
+    let B = [], F = (p) => {
+      if (m2 += g.encode(p).length, m2 > l) throw new ft("resource-limit", "ssconvert BIFF array text limit exceeded");
+      B.push(p);
     };
-    N("{");
-    for (let w2 = 0; w2 < R2; w2++) {
-      w2 && N(";");
+    F("{");
+    for (let p = 0; p < S; p++) {
+      p && F(";");
       for (let D = 0; D < A; D++) {
-        n2.signal.throwIfAborted(), D && N(",");
+        r.signal.throwIfAborted(), D && F(",");
         let x = u.byte();
         if (x === 2) {
           let b = e >= 8 ? u.word() : u.byte(), O = e >= 8 ? u.unicode(b).text : u.legacy(b);
-          N(Dn(O, '"', Ln));
+          F(_n(O, '"', Dn));
         } else {
           [0, 1, 4, 16].includes(x) || n("invalid array value type");
           for (let b = 0; b < 8; b++) i[b] = u.byte();
           if (x === 1) {
             let b = h2.getFloat64(0, true);
-            Number.isFinite(b) || n("nonfinite array number"), N(String(b));
-          } else N(x === 0 ? "" : x === 4 ? i[0] ? "TRUE" : "FALSE" : Be[i[0]] ?? '#"#UNKNOWN!"');
+            Number.isFinite(b) || n("nonfinite array number"), F(String(b));
+          } else F(x === 0 ? "" : x === 4 ? i[0] ? "TRUE" : "FALSE" : Ce[i[0]] ?? '#"#UNKNOWN!"');
         }
       }
     }
-    return N("}"), B.join("");
+    return F("}"), B.join("");
   }, readMemory: () => {
-    n2.signal.throwIfAborted();
-    let k = u.word(), S = e >= 8 ? 8 : 6;
-    if (d += k * S, d > a) throw new at("resource-limit", "ssconvert BIFF cached area work limit exceeded");
-    t?.(k * S);
+    r.signal.throwIfAborted();
+    let k = u.word(), N = e >= 8 ? 8 : 6;
+    if (d += k * N, d > a) throw new ft("resource-limit", "ssconvert BIFF cached area work limit exceeded");
+    t?.(k * N);
     for (let A = 0; A < k; A++) {
-      n2.signal.throwIfAborted();
-      for (let R2 = 0; R2 < S; R2++) u.byte();
+      r.signal.throwIfAborted();
+      for (let S = 0; S < N; S++) u.byte();
     }
   }, readLabels: () => {
-    n2.signal.throwIfAborted();
-    let k = u.word(), S = u.word(), A = k + (S & 16383) * 65536;
+    r.signal.throwIfAborted();
+    let k = u.word(), N = u.word(), A = k + (N & 16383) * 65536;
     A || n("empty multiple label references");
-    let R2 = [];
+    let S = [];
     for (let B = 0; B < A; B++) {
-      if (n2.signal.throwIfAborted(), d += 4, d > a) throw new at("resource-limit", "ssconvert BIFF label work limit exceeded");
+      if (r.signal.throwIfAborted(), d += 4, d > a) throw new ft("resource-limit", "ssconvert BIFF label work limit exceeded");
       t?.(4);
-      let N = u.word(), w2 = u.word() & 16383;
-      w2 > 255 && n("invalid multiple label column"), R2.push({ row: N, column: w2 });
+      let F = u.word(), p = u.word() & 16383;
+      p > 255 && n("invalid multiple label column"), S.push({ row: F, column: p });
     }
-    return { relative: !!(S & 32768), cells: R2 };
+    return { relative: !!(N & 32768), cells: S };
   } };
 }
-function rn(s, e, r) {
-  let n2 = e === 2 ? r === 55 : !!(s.u16(6) & 8);
-  s.check(0, e === 2 && !n2 ? 12 : 16);
+function sn(s, e, n2) {
+  let r = e === 2 ? n2 === 55 : !!(s.u16(6) & 8);
+  s.check(0, e === 2 && !r ? 12 : 16);
   let t = e === 2 ? s.u8(7) : s.u16(6);
-  if (e === 2 ? !n2 && t > 1 : e < 8 && t & -16) return;
+  if (e === 2 ? !r && t > 1 : e < 8 && t & -16) return;
   let u = e === 2 ? !!t : !!(t & 4), i = (g, a) => {
     let l = s.u16(g), d = s.u16(g + 2);
-    return a ? "#REF!" : ((d >= 256 || l >= (e === 8 ? 65536 : 16384)) && n("invalid data-table input cell"), _n(l, d));
+    return a ? "#REF!" : ((d >= 256 || l >= (e === 8 ? 65536 : 16384)) && n("invalid data-table input cell"), Pn(l, d));
   }, h2 = i(8, e >= 8 && !!(t & 16));
-  return `=TABLE(${n2 || u ? h2 : ""},${n2 ? i(12, e >= 8 && !!(t & 32)) : u ? "" : h2})`;
+  return `=TABLE(${r || u ? h2 : ""},${r ? i(12, e >= 8 && !!(t & 32)) : u ? "" : h2})`;
 }
-function sn(s, e, r, n2, t) {
-  let u = { sheet: e, row: s.range.startRow, column: s.range.startColumn }, i = Pn(s.expression, { maximumDepth: n2.limits.formulaDepth, workbook: r, position: u, signal: n2.signal, maximumNodes: n2.limits.workbookNodes ?? n2.limits.cells, maximumLength: n2.limits.workbookTextBytes ?? n2.limits.outputBytes });
+function on(s, e, n2, r, t) {
+  let u = { sheet: e, row: s.range.startRow, column: s.range.startColumn }, i = Gn(s.expression, { maximumDepth: r.limits.formulaDepth, workbook: n2, position: u, signal: r.signal, maximumNodes: r.limits.workbookNodes ?? r.limits.cells, maximumLength: r.limits.workbookTextBytes ?? r.limits.outputBytes });
   if (!i.ok) return;
   let h2 = i.document.root;
   for (; h2.kind === "parentheses"; ) h2 = h2.child;
   if (h2.kind !== "call" || h2.name !== "TABLE") return;
-  if (h2.args.length !== 2 || u.row < 1 || u.column < 1) throw new We("unsupported-feature", "Cannot export Excel data table without its border or two input slots");
+  if (h2.args.length !== 2 || u.row < 1 || u.column < 1) throw new je("unsupported-feature", "Cannot export Excel data table without its border or two input slots");
   let g = h2.args.map((m2) => {
     let f = m2;
     for (; f.kind === "parentheses"; ) f = f.child;
     if (f.kind === "omitted" || f.kind === "literal" && f.value.kind === "blank") return;
     if (f.kind === "literal" && f.value.kind === "error" && f.value.value === "#REF!") {
-      if (t < 65536) throw new We("unsupported-feature", "Cannot export deleted Excel data table input before BIFF8");
+      if (t < 65536) throw new je("unsupported-feature", "Cannot export deleted Excel data table input before BIFF8");
       return { row: 65535, column: 65535, deleted: true };
     }
-    if (f.kind !== "reference" || f.label || f.last || !f.first.row || !f.first.column) throw new We("unsupported-feature", "Cannot export Excel data table input expression");
+    if (f.kind !== "reference" || f.label || f.last || !f.first.row || !f.first.column) throw new je("unsupported-feature", "Cannot export Excel data table input expression");
     let o = f.first.row.value + (f.first.row.relative ? u.row : 0), E = f.first.column.value + (f.first.column.relative ? u.column : 0);
-    if (o < 0 || o >= t || E < 0 || E >= 256) throw new We("unsupported-feature", "Cannot export Excel data table input outside version limits");
+    if (o < 0 || o >= t || E < 0 || E >= 256) throw new je("unsupported-feature", "Cannot export Excel data table input outside version limits");
     return { row: o, column: E };
   });
-  if (!g[0] && !g[1]) throw new We("unsupported-feature", "Cannot export Excel data table without an input cell");
-  if (n2.limits.outputBytes < 16) throw new We("resource-limit", "ssconvert BIFF data-table bytes limit exceeded");
+  if (!g[0] && !g[1]) throw new je("unsupported-feature", "Cannot export Excel data table without an input cell");
+  if (r.limits.outputBytes < 16) throw new je("resource-limit", "ssconvert BIFF data-table bytes limit exceeded");
   let a = new Uint8Array(16), l = new DataView(a.buffer);
   l.setUint16(0, u.row, true), l.setUint16(2, Math.min(s.range.endRow, t - 1), true), a[4] = u.column, a[5] = Math.min(s.range.endColumn, 255);
   let d = g[0] ?? g[1];
   return l.setUint16(6, (g[0] && g[1] ? 12 : g[0] ? 4 : 0) | (d.deleted ? 16 : 0) | (g[0] && g[1]?.deleted ? 32 : 0), true), l.setUint16(8, d.row, true), l.setUint16(10, d.column, true), g[0] && g[1] && (l.setUint16(12, g[1].row, true), l.setUint16(14, g[1].column, true)), a;
 }
-function on(s, e) {
-  return e === "row" ? s.endColumn < ft.columns - 1 ? { ...s, startColumn: s.endColumn + 1, endColumn: ft.columns - 1 } : s.startColumn > 0 ? { ...s, startColumn: 0, endColumn: s.startColumn - 1 } : { ...s } : s.endRow < ft.rows - 1 ? { ...s, startRow: s.endRow + 1, endRow: ft.rows - 1 } : s.startRow > 0 ? { ...s, startRow: 0, endRow: s.startRow - 1 } : { ...s };
-}
 function an(s, e) {
-  let r = 0, n2 = 0, t = () => {
-    for (; r < s.length && n2 === s[r].bytes.length; ) r++, n2 = 0;
-    return r === s.length && n("truncated LABELRANGES"), s[r].u8(n2++);
+  return e === "row" ? s.endColumn < lt.columns - 1 ? { ...s, startColumn: s.endColumn + 1, endColumn: lt.columns - 1 } : s.startColumn > 0 ? { ...s, startColumn: 0, endColumn: s.startColumn - 1 } : { ...s } : s.endRow < lt.rows - 1 ? { ...s, startRow: s.endRow + 1, endRow: lt.rows - 1 } : s.startRow > 0 ? { ...s, startRow: 0, endRow: s.startRow - 1 } : { ...s };
+}
+function fn(s, e) {
+  let n2 = 0, r = 0, t = () => {
+    for (; n2 < s.length && r === s[n2].bytes.length; ) n2++, r = 0;
+    return n2 === s.length && n("truncated LABELRANGES"), s[n2].u8(r++);
   }, u = () => t() | t() << 8, i = [];
   for (let h2 of ["row", "column"]) {
     let g = u();
     for (let a = 0; a < g; a++) {
       let l = { startRow: u(), endRow: u(), startColumn: u(), endColumn: u() };
-      (l.startRow > l.endRow || l.startColumn > l.endColumn || l.endColumn >= 256) && n("invalid LABELRANGES rectangle"), e(1), i.push({ axis: h2, labels: l, data: on(l, h2) });
+      (l.startRow > l.endRow || l.startColumn > l.endColumn || l.endColumn >= 256) && n("invalid LABELRANGES rectangle"), e(1), i.push({ axis: h2, labels: l, data: an(l, h2) });
     }
   }
-  return s.some((h2, g) => g > r ? h2.bytes.length !== 0 : g === r && n2 !== h2.bytes.length) && n("trailing LABELRANGES bytes"), i;
+  return s.some((h2, g) => g > n2 ? h2.bytes.length !== 0 : g === n2 && r !== h2.bytes.length) && n("trailing LABELRANGES bytes"), i;
 }
-function fn(s, e, r, n2) {
+function ln(s, e, n2, r) {
   let t = s.labelRanges ?? [];
   if (!t.length) return;
-  if (e !== 8) throw new je("unsupported-feature", "Excel BIFF7 cannot encode label ranges");
+  if (e !== 8) throw new ze("unsupported-feature", "Excel BIFF7 cannot encode label ranges");
   let u = [], i = [];
   for (let m2 of t) {
-    if (n2(1), m2.axis !== "row" && m2.axis !== "column") throw new je("invalid-request", "Invalid label range axis");
-    if (m2.dataSheet !== void 0 && m2.dataSheet !== s.id) throw new je("unsupported-feature", "Excel BIFF8 cannot preserve label data on another sheet");
-    let f = m2.labels, o = on(f, m2.axis);
-    for (let [k, S] of [["startRow", 65536], ["endRow", 65536], ["startColumn", 256], ["endColumn", 256]]) if (!Number.isSafeInteger(f[k]) || f[k] < 0 || f[k] >= S || m2.data[k] !== o[k]) throw new je("unsupported-feature", "Excel BIFF8 cannot preserve these label/data ranges");
-    if (f.startRow > f.endRow || f.startColumn > f.endColumn) throw new je("invalid-request", "Reversed label range");
+    if (r(1), m2.axis !== "row" && m2.axis !== "column") throw new ze("invalid-request", "Invalid label range axis");
+    if (m2.dataSheet !== void 0 && m2.dataSheet !== s.id) throw new ze("unsupported-feature", "Excel BIFF8 cannot preserve label data on another sheet");
+    let f = m2.labels, o = an(f, m2.axis);
+    for (let [k, N] of [["startRow", 65536], ["endRow", 65536], ["startColumn", 256], ["endColumn", 256]]) if (!Number.isSafeInteger(f[k]) || f[k] < 0 || f[k] >= N || m2.data[k] !== o[k]) throw new ze("unsupported-feature", "Excel BIFF8 cannot preserve these label/data ranges");
+    if (f.startRow > f.endRow || f.startColumn > f.endColumn) throw new ze("invalid-request", "Reversed label range");
     let E = m2.axis === "row" ? u : i;
-    if (E.length >= 65535) throw new je("unsupported-feature", "Excel BIFF8 label range count exceeds version limits");
+    if (E.length >= 65535) throw new ze("unsupported-feature", "Excel BIFF8 label range count exceeds version limits");
     E.push(f);
   }
-  let h2 = new Uint8Array(r.maximumRecord), g = 0, a = 351, l = (m2) => {
-    g + m2 > h2.length && (r.record(a, h2.subarray(0, g)), a = 60, h2 = new Uint8Array(r.maximumRecord), g = 0);
+  let h2 = new Uint8Array(n2.maximumRecord), g = 0, a = 351, l = (m2) => {
+    g + m2 > h2.length && (n2.record(a, h2.subarray(0, g)), a = 60, h2 = new Uint8Array(n2.maximumRecord), g = 0);
   }, d = (m2) => {
     h2[g++] = m2 & 255, h2[g++] = m2 >> 8;
   };
   for (let m2 of [u, i]) {
     l(2), d(m2.length);
-    for (let f of m2) n2(1), l(8), d(f.startRow), d(f.endRow), d(f.startColumn), d(f.endColumn);
+    for (let f of m2) r(1), l(8), d(f.startRow), d(f.endRow), d(f.startColumn), d(f.endColumn);
   }
-  r.record(a, h2.subarray(0, g));
+  n2.record(a, h2.subarray(0, g));
 }
-var lt = class {
+var ct = class {
   context;
   slots = /* @__PURE__ */ new Map();
   scopes = /* @__PURE__ */ new Map();
   definitions = /* @__PURE__ */ new Map();
   work = 0;
-  constructor(e, r) {
+  constructor(e, n2) {
     this.context = e;
-    for (let n2 of r) this.tick(), this.scopes.set(n2.name, /* @__PURE__ */ new Map([["Sheet_Title", { name: "Sheet_Title", dependencies: [], permanent: true, defaultExpression: "=" + Xn(n2.name, '"', Vn) }], ["Print_Area", { name: "Print_Area", dependencies: [], permanent: true, defaultExpression: "=#REF!" }]]));
+    for (let r of n2) this.tick(), this.scopes.set(r.name, /* @__PURE__ */ new Map([["Sheet_Title", { name: "Sheet_Title", dependencies: [], permanent: true, defaultExpression: "=" + Wn(r.name, '"', Xn) }], ["Print_Area", { name: "Print_Area", dependencies: [], permanent: true, defaultExpression: "=#REF!" }]]));
   }
   tick() {
-    if (this.context.signal.throwIfAborted(), ++this.work > (this.context.limits.workbookWork ?? this.context.limits.inputBytes * 8)) throw new Gn("resource-limit", "ssconvert BIFF name binding work limit exceeded");
+    if (this.context.signal.throwIfAborted(), ++this.work > (this.context.limits.workbookWork ?? this.context.limits.inputBytes * 8)) throw new Hn("resource-limit", "ssconvert BIFF name binding work limit exceeded");
   }
-  reference(e, r) {
+  reference(e, n2) {
     this.tick();
-    let n2 = this.slots.get(e);
-    if (n2) return n2;
-    if (r) return "#REF!";
+    let r = this.slots.get(e);
+    if (r) return r;
+    if (n2) return "#REF!";
     if (e < 1 || e >= 256) return "#NAME?";
     let t = { name: `FwdDecl${e}`, dependencies: [] };
     return this.slots.set(e, t), t;
   }
-  resolve = (e, r) => {
-    let n2 = this.reference(e, r);
-    return typeof n2 == "string" ? { value: n2, functionName: void 0 } : { value: n2.index ?? "#REF!", functionName: n2.name };
+  resolve = (e, n2) => {
+    let r = this.reference(e, n2);
+    return typeof r == "string" ? { value: r, functionName: void 0 } : { value: r.index ?? "#REF!", functionName: r.name };
   };
-  define(e, r, n2, t) {
+  define(e, n2, r, t) {
     this.tick();
-    let u = this.slots.get(e), i = [], h2 = t((S, A) => {
-      let R2 = this.reference(S, A), B = typeof R2 == "string" ? void 0 : R2.name;
-      return i.push({ target: R2, functionName: B }), { value: typeof R2 == "string" ? R2 : S, functionName: B };
-    }), g = i.map((S) => S.target), a = [...g], l = /* @__PURE__ */ new Set();
+    let u = this.slots.get(e), i = [], h2 = t((N, A) => {
+      let S = this.reference(N, A), B = typeof S == "string" ? void 0 : S.name;
+      return i.push({ target: S, functionName: B }), { value: typeof S == "string" ? S : N, functionName: B };
+    }), g = i.map((N) => N.target), a = [...g], l = /* @__PURE__ */ new Set();
     for (; a.length; ) {
       this.tick();
-      let S = a.pop();
-      if (!(typeof S == "string" || l.has(S))) {
-        if (S.name === r || u !== void 0 && S.name === u.name) {
+      let N = a.pop();
+      if (!(typeof N == "string" || l.has(N))) {
+        if (N.name === n2 || u !== void 0 && N.name === u.name) {
           this.slots.delete(e);
           return;
         }
-        l.add(S);
-        for (let A of S.dependencies) this.tick(), a.push(A);
+        l.add(N);
+        for (let A of N.dependencies) this.tick(), a.push(A);
       }
     }
-    let d = this.scopes.get(n2) ?? /* @__PURE__ */ new Map(), m2 = d.get(r);
+    let d = this.scopes.get(r) ?? /* @__PURE__ */ new Map(), m2 = d.get(n2);
     if (m2 && !m2.placeholder && !m2.permanent) {
       this.slots.delete(e);
       return;
     }
-    let f = Hn(h2, { maximumDepth: this.context.limits.formulaDepth, position: { sheet: "", row: 0, column: 0 }, signal: this.context.signal, maximumLength: this.context.limits.inputBytes, ...this.context.limits.workbookNodes === void 0 ? {} : { maximumNodes: this.context.limits.workbookNodes } }), o = f.ok ? f.document.root : void 0;
+    let f = Vn(h2, { maximumDepth: this.context.limits.formulaDepth, position: { sheet: "", row: 0, column: 0 }, signal: this.context.signal, maximumLength: this.context.limits.inputBytes, ...this.context.limits.workbookNodes === void 0 ? {} : { maximumNodes: this.context.limits.workbookNodes } }), o = f.ok ? f.document.root : void 0;
     for (; o?.kind === "parentheses"; ) this.tick(), o = o.child;
-    let E = o?.kind === "literal" && o.value.kind === "error" && o.value.value === "#NAME?", k = m2 ?? u ?? { name: r, dependencies: [] };
-    k.index !== void 0 && this.definitions.delete(k.index), k.name = r, k.index = e, k.dependencies = g, k.placeholder = E, delete k.defaultExpression, this.slots.set(e, k), d.set(r, k), this.scopes.set(n2, d), this.definitions.set(e, { translate: t, references: i, placeholder: E });
+    let E = o?.kind === "literal" && o.value.kind === "error" && o.value.value === "#NAME?", k = m2 ?? u ?? { name: n2, dependencies: [] };
+    k.index !== void 0 && this.definitions.delete(k.index), k.name = n2, k.index = e, k.dependencies = g, k.placeholder = E, delete k.defaultExpression, this.slots.set(e, k), d.set(n2, k), this.scopes.set(r, d), this.definitions.set(e, { translate: t, references: i, placeholder: E });
   }
   finish() {
-    for (let [r, n2] of Array.from(this.definitions).reverse()) this.tick(), n2.placeholder && (delete this.slots.get(r).index, this.definitions.delete(r));
+    for (let [n2, r] of Array.from(this.definitions).reverse()) this.tick(), r.placeholder && (delete this.slots.get(n2).index, this.definitions.delete(n2));
     let e = [];
-    for (let [r, n2] of this.scopes) for (let t of n2.values()) this.tick(), t.defaultExpression !== void 0 && e.push({ name: t.name, expression: t.defaultExpression, ...r === void 0 ? {} : { sheet: r } });
+    for (let [n2, r] of this.scopes) for (let t of r.values()) this.tick(), t.defaultExpression !== void 0 && e.push({ name: t.name, expression: t.defaultExpression, ...n2 === void 0 ? {} : { sheet: n2 } });
     return { indices: Array.from(this.definitions.keys()), defaults: e };
   }
   expression(e) {
     this.tick();
-    let r = this.definitions.get(e), n2 = 0;
-    return r.translate(() => {
+    let n2 = this.definitions.get(e), r = 0;
+    return n2.translate(() => {
       this.tick();
-      let { target: t, functionName: u } = r.references[n2++];
+      let { target: t, functionName: u } = n2.references[r++];
       return { value: typeof t == "string" ? t : t.index ?? "#REF!", functionName: u };
     });
   }
 };
-function fe(s, e, r = "", n2 = []) {
-  return { name: s, namespace: "http://www.gnumeric.org/v10.dtd", attributes: Object.entries(e).map(([t, u]) => ({ name: t, namespace: "", value: String(u) })), text: r, children: n2 };
+function fe(s, e, n2 = "", r = []) {
+  return { name: s, namespace: "http://www.gnumeric.org/v10.dtd", attributes: Object.entries(e).map(([t, u]) => ({ name: t, namespace: "", value: String(u) })), text: n2, children: r };
 }
-var un = /* @__PURE__ */ new Set([42, 43, 37, 549, 129, 131, 132, 161, 85, 574, 62, 29, 26, 27, 65, 160, 2151, 28, 438]);
-function cn(s) {
-  let e = { Left: "", Middle: "", Right: "" }, r = { P: "&[PAGE]", N: "&[PAGES]", D: "&[DATE]", T: "&[TIME]", F: "&[FILE]", A: "&[TAB]", Z: "&[PATH]" }, n2 = "Middle";
+var dn = /* @__PURE__ */ new Set([42, 43, 37, 549, 129, 131, 132, 161, 85, 574, 62, 29, 26, 27, 65, 160, 2151, 28, 438]);
+function un(s) {
+  let e = { Left: "", Middle: "", Right: "" }, n2 = { P: "&[PAGE]", N: "&[PAGES]", D: "&[DATE]", T: "&[TIME]", F: "&[FILE]", A: "&[TAB]", Z: "&[PATH]" }, r = "Middle";
   for (let t = 0; t < s.length; t++) {
     let u = s[t];
     if (u !== "&" || t + 1 >= s.length) {
-      e[n2] += u;
+      e[r] += u;
       continue;
     }
     let i = s[++t];
-    ["L", "C", "R"].includes(i) ? n2 = i === "L" ? "Left" : i === "R" ? "Right" : "Middle" : e[n2] += r[i] ?? (i === "&" ? "&" : "&" + i);
+    ["L", "C", "R"].includes(i) ? r = i === "L" ? "Left" : i === "R" ? "Right" : "Middle" : e[r] += n2[i] ?? (i === "&" ? "&" : "&" + i);
   }
   return e;
 }
-function dn(s, e, r, n2) {
-  let t = { vcenter: 0, hcenter: 0, grid: 0, titles: 0, monochrome: 0, draft: 0 }, u = { top: 120, bottom: 120, left: 72, right: 72, header: 72, footer: 72 }, i = { type: "percentage", percentage: 100 }, h2 = "portrait", g = "iso_a4", a = "d_then_r", l = false, d = 1, m2 = 1, f = "&A", o = "Page &P", E = "GNM_PRINT_COMMENTS_NONE", k = "GNM_PRINT_ERRORS_AS_DISPLAYED", S = [], A = [], R2 = {}, B = false, N = false, w2, D, x = /* @__PURE__ */ new Map(), b, O = 0, C2 = (F) => {
-    if (O += new TextEncoder().encode(F).length, O > (n2.limits.workbookTextBytes ?? n2.limits.inputBytes)) throw new ln("resource-limit", "ssconvert BIFF metadata text limit exceeded");
+function mn(s, e, n2, r) {
+  let t = { vcenter: 0, hcenter: 0, grid: 0, titles: 0, monochrome: 0, draft: 0 }, u = { top: 120, bottom: 120, left: 72, right: 72, header: 72, footer: 72 }, i = { type: "percentage", percentage: 100 }, h2 = "portrait", g = "iso_a4", a = "d_then_r", l = false, d = 1, m2 = 1, f = "&A", o = "Page &P", E = "GNM_PRINT_COMMENTS_NONE", k = "GNM_PRINT_ERRORS_AS_DISPLAYED", N = [], A = [], S = {}, B = false, F = false, p, D, x = /* @__PURE__ */ new Map(), b, O = 0, C2 = (R2) => {
+    if (O += new TextEncoder().encode(R2).length, O > (r.limits.workbookTextBytes ?? r.limits.inputBytes)) throw new cn("resource-limit", "ssconvert BIFF metadata text limit exceeded");
   };
-  for (let F = 0; F < s.length; F++) {
-    n2.signal.throwIfAborted();
-    let M = s[F], _ = M.data, p = M.opcode;
-    if (p === 93) {
+  for (let R2 = 0; R2 < s.length; R2++) {
+    r.signal.throwIfAborted();
+    let M = s[R2], _ = M.data, w2 = M.opcode;
+    if (w2 === 93) {
       b = void 0;
       for (let c = 0; c + 4 <= _.bytes.length; ) {
         let I = _.u16(c), L2 = _.u16(c + 2);
         if (_.check(c + 4, L2), I === 21 && L2 >= 6 && (b = _.u16(c + 6)), c += 4 + L2, !I) break;
       }
-    } else if (p === 438 && b !== void 0) {
+    } else if (w2 === 438 && b !== void 0) {
       let c = _.u16(10), I = [];
-      for (; s[F + 1]?.opcode === 60; ) I.push(s[++F].data);
-      c && x.set(b, new w(I, n2, r).unicode(c).text);
-    } else if (p === 28) {
+      for (; s[R2 + 1]?.opcode === 60; ) I.push(s[++R2].data);
+      c && x.set(b, new w(I, r, n2).unicode(c).text);
+    } else if (w2 === 28) {
       let c = _.u16(0), I = _.u16(2);
       I > 255 && n("invalid comment position");
       let L2 = "", X2 = "";
       if (e >= 8) {
         let z = _.u16(6), W = _.u16(8);
-        X2 = W ? new w([new h(_.slice(10, _.bytes.length - 10))], n2, r).unicode(W).text : "", L2 = x.get(z) ?? "";
+        X2 = W ? new w([new h(_.slice(10, _.bytes.length - 10))], r, n2).unicode(W).text : "", L2 = x.get(z) ?? "";
       } else {
         let z = _.u16(4), W = _;
-        if (z > (n2.limits.workbookTextBytes ?? n2.limits.inputBytes)) throw new ln("resource-limit", "ssconvert BIFF metadata text limit exceeded");
+        if (z > (r.limits.workbookTextBytes ?? r.limits.inputBytes)) throw new cn("resource-limit", "ssconvert BIFF metadata text limit exceeded");
         for (; z; ) {
-          n2.signal.throwIfAborted();
+          r.signal.throwIfAborted();
           let q = Math.min(2048, z);
-          if (L2 += m(W.slice(6, q), r), z -= q, !z) break;
-          let Q2 = s[++F];
+          if (L2 += m(W.slice(6, q), n2), z -= q, !z) break;
+          let Q2 = s[++R2];
           (!Q2 || Q2.opcode !== 28 || Q2.data.u16(0) !== 65535 || Q2.data.u16(2) !== 0) && n("missing NOTE continuation"), W = Q2.data;
         }
       }
-      C2(L2), C2(X2), S.push(fe("CellComment", { ObjectBound: ct(c, I), ObjectOffset: "1 0 1 0", Direction: 17, Print: 1, Author: X2, Text: L2 }));
-    } else if (p >= 38 && p <= 41) {
+      C2(L2), C2(X2), N.push(fe("CellComment", { ObjectBound: ut(c, I), ObjectOffset: "1 0 1 0", Direction: 17, Print: 1, Author: X2, Text: L2 }));
+    } else if (w2 >= 38 && w2 <= 41) {
       let c = _.f64(0) * 72;
-      Number.isFinite(c) || n("invalid print margin"), u[["left", "right", "top", "bottom"][p - 38]] = c, N = true;
-    } else if (p === 20 || p === 21) {
+      Number.isFinite(c) || n("invalid print margin"), u[["left", "right", "top", "bottom"][w2 - 38]] = c, F = true;
+    } else if (w2 === 20 || w2 === 21) {
       if (!_.bytes.length) continue;
-      let c = e >= 8 ? 2 : 1, I = e >= 8 ? _.u16(0) : _.u8(0), L2 = new w([new h(_.slice(c, _.bytes.length - c))], n2, r), X2 = I ? e >= 8 ? L2.unicode(I).text : L2.legacy(I) : "";
-      C2(X2), p === 20 ? f = X2 : o = X2, N = true;
-    } else if (p === 42 || p === 43 || p === 131 || p === 132) t[p === 42 ? "titles" : p === 43 ? "grid" : p === 131 ? "hcenter" : "vcenter"] = _.u16(0) ? 1 : 0, N = true;
-    else if (p === 161) {
+      let c = e >= 8 ? 2 : 1, I = e >= 8 ? _.u16(0) : _.u8(0), L2 = new w([new h(_.slice(c, _.bytes.length - c))], r, n2), X2 = I ? e >= 8 ? L2.unicode(I).text : L2.legacy(I) : "";
+      C2(X2), w2 === 20 ? f = X2 : o = X2, F = true;
+    } else if (w2 === 42 || w2 === 43 || w2 === 131 || w2 === 132) t[w2 === 42 ? "titles" : w2 === 43 ? "grid" : w2 === 131 ? "hcenter" : "vcenter"] = _.u16(0) ? 1 : 0, F = true;
+    else if (w2 === 161) {
       _.check(0, e > 4 ? 34 : 12);
       let c = _.u16(10);
       if (d = _.u16(6), m2 = _.u16(8), t.monochrome = c & 8 ? 1 : 0, t.draft = c & 16 ? 1 : 0, h2 = c & 2 ? "portrait" : "landscape", a = c & 1 ? "r_then_d" : "d_then_r", E = c & 32 ? e >= 8 && c & 512 ? "GNM_PRINT_COMMENTS_AT_END" : "GNM_PRINT_COMMENTS_IN_PLACE" : "GNM_PRINT_COMMENTS_NONE", k = ["GNM_PRINT_ERRORS_AS_DISPLAYED", "GNM_PRINT_ERRORS_AS_BLANK", "GNM_PRINT_ERRORS_AS_DASHES", "GNM_PRINT_ERRORS_AS_NA"][e >= 8 ? c >> 10 & 3 : 0], !(c & 4)) {
@@ -1204,51 +1204,51 @@ function dn(s, e, r, n2) {
         let I = _.u16(2);
         i = { type: "percentage", percentage: I >= 1 && I <= 1e3 ? I : 100 };
       }
-      e > 4 && (u.header = _.f64(16) * 72, u.footer = _.f64(24) * 72, (!Number.isFinite(u.header) || !Number.isFinite(u.footer)) && n("invalid print margin")), N = true;
-    } else if (p === 129) {
+      e > 4 && (u.header = _.f64(16) * 72, u.footer = _.f64(24) * 72, (!Number.isFinite(u.header) || !Number.isFinite(u.footer)) && n("invalid print margin")), F = true;
+    } else if (w2 === 129) {
       let c = _.u16(0);
-      R2.gnumeric = { OutlineSymbolsBelow: c & 64 ? "1" : "0", OutlineSymbolsRight: c & 128 ? "1" : "0" }, l = !!(c & 256);
-    } else if (p === 574) {
+      S.gnumeric = { ...S.gnumeric, OutlineSymbolsBelow: c & 64 ? "1" : "0", OutlineSymbolsRight: c & 128 ? "1" : "0" }, l = !!(c & 256);
+    } else if (w2 === 574) {
       let c = _.u16(0);
-      B = !!(c & 512), w2 = { row: _.u16(2), column: _.u16(4), frozen: !!(c & 8) }, (w2.column > 255 || w2.row >= (e >= 8 ? 65536 : 16384)) && n("invalid sheet layout position"), R2.gnumeric = { ...R2.gnumeric, DisplayFormulas: c & 1 ? "1" : "0", HideGrid: c & 2 ? "0" : "1", HideColHeader: c & 4 ? "0" : "1", HideRowHeader: c & 4 ? "0" : "1", HideZero: c & 16 ? "0" : "1", DisplayOutlines: c & 128 ? "1" : "0" }, e >= 8 && _.bytes.length >= 14 && (R2.zoom = _.u16(12) ? _.u16(12) / 100 : 1);
-    } else if (p === 65) _.check(0, e >= 5 ? 10 : 9), D = { x: _.u16(0), y: _.u16(2), row: _.u16(4), column: _.u16(6) };
-    else if (p === 160) {
+      B = !!(c & 1024), p = { row: _.u16(2), column: _.u16(4), frozen: !!(c & 8) }, (p.column > 255 || p.row >= (e >= 8 ? 65536 : 16384)) && n("invalid sheet layout position"), S.gnumeric = { ...S.gnumeric, DisplayFormulas: c & 1 ? "1" : "0", HideGrid: c & 2 ? "0" : "1", HideColHeader: c & 4 ? "0" : "1", HideRowHeader: c & 4 ? "0" : "1", HideZero: c & 16 ? "0" : "1", RTL_Layout: c & 64 ? "1" : "0", DisplayOutlines: c & 128 ? "1" : "0" }, e >= 8 && _.bytes.length >= 14 && (S.zoom = _.u16(12) ? _.u16(12) / 100 : 1);
+    } else if (w2 === 65) _.check(0, e >= 5 ? 10 : 9), D = { x: _.u16(0), y: _.u16(2), row: _.u16(4), column: _.u16(6) };
+    else if (w2 === 160) {
       let c = _.u16(2);
-      c || n("invalid sheet zoom"), R2.zoom = _.u16(0) / c;
-    } else if (p === 26 || p === 27) {
+      c || n("invalid sheet zoom"), S.zoom = _.u16(0) / c;
+    } else if (w2 === 26 || w2 === 27) {
       let c = _.u16(0), I = e >= 8 ? 6 : 2;
-      _.check(2, c * I), A.push(fe(p === 27 ? "hPageBreaks" : "vPageBreaks", { count: c }, "", Array.from({ length: c }, (L2, X2) => fe("break", { pos: _.u16(2 + X2 * I), type: "manual" })))), N = true;
+      _.check(2, c * I), A.push(fe(w2 === 27 ? "hPageBreaks" : "vPageBreaks", { count: c }, "", Array.from({ length: c }, (L2, X2) => fe("break", { pos: _.u16(2 + X2 * I), type: "manual" })))), F = true;
     }
   }
   let v = [];
-  if (w2) {
-    let F = w2.frozen && D && (D.x || D.y) ? D : void 0;
-    F && (F.column > 255 || w2.column + F.x > 255 || F.row >= (e >= 8 ? 65536 : 16384) || w2.row + F.y >= (e >= 8 ? 65536 : 16384)) && n("invalid frozen sheet layout"), v.push({ source: "Gnumeric_XmlIO:sax", kind: "SheetLayout", disposition: "retained", data: fe("SheetLayout", { TopLeft: ct(F?.y ? F.row : w2.row, F?.x ? F.column : w2.column) }, "", F ? [fe("FreezePanes", { FrozenTopLeft: ct(F.y ? w2.row : 0, F.x ? w2.column : 0), UnfrozenTopLeft: ct(F.y ? w2.row + F.y : 0, F.x ? w2.column + F.x : 0) })] : []) });
+  if (p) {
+    let R2 = p.frozen && D && (D.x || D.y) ? D : void 0;
+    R2 && (R2.column > 255 || p.column + R2.x > 255 || R2.row >= (e >= 8 ? 65536 : 16384) || p.row + R2.y >= (e >= 8 ? 65536 : 16384)) && n("invalid frozen sheet layout"), v.push({ source: "Gnumeric_XmlIO:sax", kind: "SheetLayout", disposition: "retained", data: fe("SheetLayout", { TopLeft: ut(R2?.y ? R2.row : p.row, R2?.x ? R2.column : p.column) }, "", R2 ? [fe("FreezePanes", { FrozenTopLeft: ut(R2.y ? p.row : 0, R2.x ? p.column : 0), UnfrozenTopLeft: ut(R2.y ? p.row + R2.y : 0, R2.x ? p.column + R2.x : 0) })] : []) });
   }
-  return N && v.push({ source: "Gnumeric_XmlIO:sax", kind: "PrintInformation", disposition: "retained", data: fe("PrintInformation", {}, "", [fe("Margins", {}, "", Object.entries(u).map(([F, M]) => fe(F, { Points: M, PrefUnit: "mm" }))), fe("Scale", l ? { type: "fit", cols: d, rows: m2 } : i), ...Object.entries(t).map(([F, M]) => fe(F, { value: M })), fe("order", {}, a), fe("orientation", {}, h2), fe("Header", cn(f)), fe("Footer", cn(o)), fe("paper", {}, g), fe("comments", { placement: E }), fe("errors", { PrintErrorsAs: k }), ...A]) }), S.length && v.push({ source: "Gnumeric_XmlIO:sax", kind: "Objects", disposition: "retained", data: fe("Objects", {}, "", S) }), { records: v, view: R2, active: B };
+  return F && v.push({ source: "Gnumeric_XmlIO:sax", kind: "PrintInformation", disposition: "retained", data: fe("PrintInformation", {}, "", [fe("Margins", {}, "", Object.entries(u).map(([R2, M]) => fe(R2, { Points: M, PrefUnit: "mm" }))), fe("Scale", l ? { type: "fit", cols: d, rows: m2 } : i), ...Object.entries(t).map(([R2, M]) => fe(R2, { value: M })), fe("order", {}, a), fe("orientation", {}, h2), fe("Header", un(f)), fe("Footer", un(o)), fe("paper", {}, g), fe("comments", { placement: E }), fe("errors", { PrintErrorsAs: k }), ...A]) }), N.length && v.push({ source: "Gnumeric_XmlIO:sax", kind: "Objects", disposition: "retained", data: fe("Objects", {}, "", N) }), { records: v, view: S, active: B };
 }
-var ut = class {
+var dt = class {
   context;
   maximumRecord;
   parts = [];
   length = 0;
-  constructor(e, r) {
-    this.context = e, this.maximumRecord = r;
+  constructor(e, n2) {
+    this.context = e, this.maximumRecord = n2;
   }
-  record(e, r = new Uint8Array()) {
-    if (this.context.signal.throwIfAborted(), r.length > this.maximumRecord) throw new Ce("unsupported-feature", "Excel BIFF record is too large");
-    if (r.length + 4 > this.context.limits.outputBytes - this.length) throw new Ce("resource-limit", "ssconvert BIFF output bytes limit exceeded");
-    if (this.parts.length >= (this.context.limits.workbookNodes ?? this.context.limits.outputBytes / 4)) throw new Ce("resource-limit", "ssconvert BIFF record limit exceeded");
-    let n2 = this.length, t = new Uint8Array(r.length + 4), u = new DataView(t.buffer);
-    return u.setUint16(0, e, true), u.setUint16(2, r.length, true), t.set(r, 4), this.parts.push(t), this.length += t.length, n2;
+  record(e, n2 = new Uint8Array()) {
+    if (this.context.signal.throwIfAborted(), n2.length > this.maximumRecord) throw new Ue("unsupported-feature", "Excel BIFF record is too large");
+    if (n2.length + 4 > this.context.limits.outputBytes - this.length) throw new Ue("resource-limit", "ssconvert BIFF output bytes limit exceeded");
+    if (this.parts.length >= (this.context.limits.workbookNodes ?? this.context.limits.outputBytes / 4)) throw new Ue("resource-limit", "ssconvert BIFF record limit exceeded");
+    let r = this.length, t = new Uint8Array(n2.length + 4), u = new DataView(t.buffer);
+    return u.setUint16(0, e, true), u.setUint16(2, n2.length, true), t.set(n2, 4), this.parts.push(t), this.length += t.length, r;
   }
-  continuedRecord(e, r, n2, t = []) {
+  continuedRecord(e, n2, r, t = []) {
     let u = this.length, i = 0, h2 = 0, g = 0;
     do {
       for (; t[g] && t[g].end <= i; ) g++;
-      let l = t[g] && t[g].start < i ? 1 : 0, d = Math.min(r.length, i + this.maximumRecord - l), m2 = d;
-      if (n2 && d < r.length) {
-        for (m2 = i; h2 < n2.length && n2[h2] <= d; ) m2 = n2[h2++];
+      let l = t[g] && t[g].start < i ? 1 : 0, d = Math.min(n2.length, i + this.maximumRecord - l), m2 = d;
+      if (r && d < n2.length) {
+        for (m2 = i; h2 < r.length && r[h2] <= d; ) m2 = r[h2++];
         let o = g;
         for (; t[o] && t[o].end <= d; ) o++;
         let E = t[o];
@@ -1256,92 +1256,92 @@ var ut = class {
           let k = d - (d - E.start) % 2;
           k > E.start && (m2 = Math.max(m2, k));
         }
-        if (m2 <= i) throw new Ce("unsupported-feature", "Excel BIFF formula token is too large");
+        if (m2 <= i) throw new Ue("unsupported-feature", "Excel BIFF formula token is too large");
       }
-      let f = r.subarray(i, m2);
+      let f = n2.subarray(i, m2);
       if (l) {
         let o = new Uint8Array(f.length + 1);
         o[0] = 1, o.set(f, 1), f = o;
       }
       this.record(i === 0 ? e : 60, f), i = m2;
-    } while (i < r.length);
+    } while (i < n2.length);
     return u;
   }
   finish() {
     this.context.signal.throwIfAborted();
-    let e = new Uint8Array(this.length), r = 0;
-    for (let n2 of this.parts) e.set(n2, r), r += n2.length;
+    let e = new Uint8Array(this.length), n2 = 0;
+    for (let r of this.parts) e.set(r, n2), n2 += r.length;
     return e;
   }
 };
 function K2(...s) {
-  let e = new Uint8Array(s.length * 2), r = new DataView(e.buffer);
-  return s.forEach((n2, t) => r.setUint16(t * 2, n2, true)), e;
+  let e = new Uint8Array(s.length * 2), n2 = new DataView(e.buffer);
+  return s.forEach((r, t) => n2.setUint16(t * 2, r, true)), e;
 }
-function mn(s, e) {
-  if (e.signal.throwIfAborted(), s.size + 1 > (e.limits.workbookNodes ?? 1 / 0)) throw new Ce("resource-limit", "ssconvert CFB directory node limit exceeded");
-  if ((s.size + 1) * 128 > e.limits.outputBytes) throw new Ce("resource-limit", "ssconvert CFB output bytes limit exceeded");
-  let r = 0, n2 = () => {
-    if (e.signal.throwIfAborted(), ++r > (e.limits.workbookWork ?? 1 / 0)) throw new Ce("resource-limit", "ssconvert CFB directory work limit exceeded");
-  }, t = [...s].sort(([c], [I]) => (n2(), c.length - I.length || (c.toUpperCase() < I.toUpperCase() ? -1 : 1))), u = t.map(([, c]) => c.length >= 4096 ? Math.ceil(c.length / 512) : 0), i = t.map(([, c]) => c.length < 4096 ? Math.ceil(c.length / 64) : 0), h2 = i.reduce((c, I) => c + I, 0), g = h2 * 64, a = Math.ceil(g / 512), l = Math.ceil(h2 / 128), d = u.reduce((c, I) => c + I, 0), m2 = d + a, f = m2 + l, o = Math.ceil((t.length + 1) / 4), E = 0, k = 0;
+function hn(s, e) {
+  if (e.signal.throwIfAborted(), s.size + 1 > (e.limits.workbookNodes ?? 1 / 0)) throw new Ue("resource-limit", "ssconvert CFB directory node limit exceeded");
+  if ((s.size + 1) * 128 > e.limits.outputBytes) throw new Ue("resource-limit", "ssconvert CFB output bytes limit exceeded");
+  let n2 = 0, r = () => {
+    if (e.signal.throwIfAborted(), ++n2 > (e.limits.workbookWork ?? 1 / 0)) throw new Ue("resource-limit", "ssconvert CFB directory work limit exceeded");
+  }, t = [...s].sort(([c], [I]) => (r(), c.length - I.length || (c.toUpperCase() < I.toUpperCase() ? -1 : 1))), u = t.map(([, c]) => c.length >= 4096 ? Math.ceil(c.length / 512) : 0), i = t.map(([, c]) => c.length < 4096 ? Math.ceil(c.length / 64) : 0), h2 = i.reduce((c, I) => c + I, 0), g = h2 * 64, a = Math.ceil(g / 512), l = Math.ceil(h2 / 128), d = u.reduce((c, I) => c + I, 0), m2 = d + a, f = m2 + l, o = Math.ceil((t.length + 1) / 4), E = 0, k = 0;
   for (; ; ) {
     let c = Math.ceil((f + o + E + k) / 128), I = Math.ceil(Math.max(0, c - 109) / 127);
     if (c === E && I === k) break;
     E = c, k = I;
   }
-  let S = f + o + E + k, A = (S + 1) * 512;
-  if (A > e.limits.outputBytes) throw new Ce("resource-limit", "ssconvert CFB output bytes limit exceeded");
-  let R2 = new Uint8Array(A), B = new DataView(R2.buffer), N = (c, I) => B.setUint16(c, I, true), w2 = (c, I) => B.setUint32(c, I, true), D = (c) => (c + 1) * 512, x = f, b = x + o, O = b + E;
-  R2.set([208, 207, 17, 224, 161, 177, 26, 225]), N(24, 62), N(26, 3), N(28, 65534), N(30, 9), N(32, 6), w2(44, E), w2(48, x), w2(56, 4096), w2(60, l ? m2 : 4294967294), w2(64, l), w2(68, k ? O : 4294967294), w2(72, k);
-  for (let c = 0; c < 109; c++) w2(76 + c * 4, c < E ? b + c : 4294967295);
+  let N = f + o + E + k, A = (N + 1) * 512;
+  if (A > e.limits.outputBytes) throw new Ue("resource-limit", "ssconvert CFB output bytes limit exceeded");
+  let S = new Uint8Array(A), B = new DataView(S.buffer), F = (c, I) => B.setUint16(c, I, true), p = (c, I) => B.setUint32(c, I, true), D = (c) => (c + 1) * 512, x = f, b = x + o, O = b + E;
+  S.set([208, 207, 17, 224, 161, 177, 26, 225]), F(24, 62), F(26, 3), F(28, 65534), F(30, 9), F(32, 6), p(44, E), p(48, x), p(56, 4096), p(60, l ? m2 : 4294967294), p(64, l), p(68, k ? O : 4294967294), p(72, k);
+  for (let c = 0; c < 109; c++) p(76 + c * 4, c < E ? b + c : 4294967295);
   for (let c = 0; c < k; c++) {
     e.signal.throwIfAborted();
     for (let I = 0; I < 127; I++) {
       let L2 = 109 + c * 127 + I;
-      w2(D(O + c) + I * 4, L2 < E ? b + L2 : 4294967295);
+      p(D(O + c) + I * 4, L2 < E ? b + L2 : 4294967295);
     }
-    w2(D(O + c) + 508, c + 1 < k ? O + c + 1 : 4294967294);
+    p(D(O + c) + 508, c + 1 < k ? O + c + 1 : 4294967294);
   }
-  for (let c = 0; c < E * 128; c++) w2(D(b) + c * 4, 4294967295);
-  let C2 = (c, I) => w2(D(b) + c * 4, I);
-  for (let c = 0; c < l * 128; c++) w2(D(m2) + c * 4, 4294967295);
+  for (let c = 0; c < E * 128; c++) p(D(b) + c * 4, 4294967295);
+  let C2 = (c, I) => p(D(b) + c * 4, I);
+  for (let c = 0; c < l * 128; c++) p(D(m2) + c * 4, 4294967295);
   let v = (c, I, L2, X2, z) => {
-    n2();
+    r();
     let W = D(x) + c * 128;
-    for (let q = 0; q < I.length; q++) N(W + q * 2, I.charCodeAt(q));
-    N(W + 64, (I.length + 1) * 2), R2[W + 66] = L2, R2[W + 67] = 1, w2(W + 68, 4294967295), w2(W + 72, 4294967295), w2(W + 76, 4294967295), w2(W + 116, X2), w2(W + 120, z);
+    for (let q = 0; q < I.length; q++) F(W + q * 2, I.charCodeAt(q));
+    F(W + 64, (I.length + 1) * 2), S[W + 66] = L2, S[W + 67] = 1, p(W + 68, 4294967295), p(W + 72, 4294967295), p(W + 76, 4294967295), p(W + 116, X2), p(W + 120, z);
   };
   v(0, "Root Entry", 5, g ? d : 4294967294, g);
-  let F = 0, M = 0;
+  let R2 = 0, M = 0;
   t.forEach(([c, I], L2) => {
     e.signal.throwIfAborted();
-    let X2 = I.length < 4096, z = X2 ? i[L2] : u[L2], W = X2 ? M : F;
-    I.length && R2.set(I, X2 ? D(d) + M * 64 : D(F)), v(L2 + 1, c, 2, z ? W : 4294967294, I.length);
+    let X2 = I.length < 4096, z = X2 ? i[L2] : u[L2], W = X2 ? M : R2;
+    I.length && S.set(I, X2 ? D(d) + M * 64 : D(R2)), v(L2 + 1, c, 2, z ? W : 4294967294, I.length);
     for (let q = W; q < W + z; q++) {
       (q & 1023) === 0 && e.signal.throwIfAborted();
       let Q2 = q + 1 < W + z ? q + 1 : 4294967294;
-      X2 ? w2(D(m2) + q * 4, Q2) : C2(q, Q2);
+      X2 ? p(D(m2) + q * 4, Q2) : C2(q, Q2);
     }
-    X2 ? M += z : F += z;
+    X2 ? M += z : R2 += z;
   });
-  let _ = Math.floor(Math.log2(t.length + 1)), p = (c, I, L2) => {
+  let _ = Math.floor(Math.log2(t.length + 1)), w2 = (c, I, L2) => {
     if (c > I) return 4294967295;
-    n2();
+    r();
     let X2 = Math.floor((c + I) / 2), z = D(x) + X2 * 128;
-    return R2[z + 67] = L2 === _ ? 0 : 1, w2(z + 68, p(c, X2 - 1, L2 + 1)), w2(z + 72, p(X2 + 1, I, L2 + 1)), X2;
+    return S[z + 67] = L2 === _ ? 0 : 1, p(z + 68, w2(c, X2 - 1, L2 + 1)), p(z + 72, w2(X2 + 1, I, L2 + 1)), X2;
   };
-  w2(D(x) + 76, p(1, t.length, 0));
+  p(D(x) + 76, w2(1, t.length, 0));
   for (let c = 0; c < a; c++) C2(d + c, c + 1 < a ? d + c + 1 : 4294967294);
   for (let c = 0; c < l; c++) C2(m2 + c, c + 1 < l ? m2 + c + 1 : 4294967294);
-  for (let c = 0; c < o; c++) n2(), C2(x + c, c + 1 < o ? x + c + 1 : 4294967294);
+  for (let c = 0; c < o; c++) r(), C2(x + c, c + 1 < o ? x + c + 1 : 4294967294);
   for (let c = 0; c < E; c++) C2(b + c, 4294967293);
   for (let c = 0; c < k; c++) C2(O + c, 4294967292);
-  return R2;
+  return S;
 }
-var $n = { "+": 3, "-": 4, "*": 5, "/": 6, "^": 7, "&": 8, "<": 9, "<=": 10, "=": 11, ">=": 12, ">": 13, "<>": 14, intersection: 15, union: 16, ":": 17 };
-var Kn = new Map(Object.entries(rt).map(([s, e]) => [e[0], { id: Number(s), min: e[1], max: e[2] }]));
-var Yn = /* @__PURE__ */ new Set(["AVERAGEIF", "AVERAGEIFS", "CUBEKPIMEMBER", "CUBEMEMBER", "CUBEMEMBERPROPERTY", "CUBERANKEDMEMBER", "CUBESET", "CUBESETCOUNT", "CUBEVALUE", "COUNTIFS", "IFERROR", "SUMIFS"]);
-var dt = class {
+var Kn = { "+": 3, "-": 4, "*": 5, "/": 6, "^": 7, "&": 8, "<": 9, "<=": 10, "=": 11, ">=": 12, ">": 13, "<>": 14, intersection: 15, union: 16, ":": 17 };
+var Yn = new Map(Object.entries(it).map(([s, e]) => [e[0], { id: Number(s), min: e[1], max: e[2] }]));
+var qn = /* @__PURE__ */ new Set(["AVERAGEIF", "AVERAGEIFS", "CUBEKPIMEMBER", "CUBEMEMBER", "CUBEMEMBERPROPERTY", "CUBERANKEDMEMBER", "CUBESET", "CUBESETCOUNT", "CUBEVALUE", "COUNTIFS", "IFERROR", "SUMIFS"]);
+var mt = class {
   book;
   revision;
   context;
@@ -1352,50 +1352,50 @@ var dt = class {
   workbookIndices = /* @__PURE__ */ new Map();
   linkIndices = /* @__PURE__ */ new Map();
   relocations = [];
-  constructor(e, r, n2) {
-    this.book = e, this.revision = r, this.context = n2;
+  constructor(e, n2, r) {
+    this.book = e, this.revision = n2, this.context = r;
   }
   externalBook(e) {
-    let r = this.workbookIndices.get(e);
-    return r === void 0 && (r = this.externalBooks.length, this.externalBooks.push({ workbook: e, sheets: [], names: [] }), this.workbookIndices.set(e, r)), r;
+    let n2 = this.workbookIndices.get(e);
+    return n2 === void 0 && (n2 = this.externalBooks.length, this.externalBooks.push({ workbook: e, sheets: [], names: [] }), this.workbookIndices.set(e, n2)), n2;
   }
-  externalScope(e, r) {
-    if (!r || r.length > 31) throw new le("unsupported-feature", "Excel BIFF external sheet name exceeds version limits");
-    let n2 = this.externalBooks[e].sheets, t = n2.indexOf(r);
+  externalScope(e, n2) {
+    if (!n2 || n2.length > 31) throw new le("unsupported-feature", "Excel BIFF external sheet name exceeds version limits");
+    let r = this.externalBooks[e].sheets, t = r.indexOf(n2);
     if (t < 0) {
-      if (t = n2.length, t >= 65534) throw new le("unsupported-feature", "Excel BIFF external sheet index exceeds version limits");
-      n2.push(r);
+      if (t = r.length, t >= 65534) throw new le("unsupported-feature", "Excel BIFF external sheet index exceeds version limits");
+      r.push(n2);
     }
     return t;
   }
-  sheetLink(e, r, n2) {
-    let t = `${e ?? -1}:${r}:${n2}`, u = this.linkIndices.get(t);
-    return u === void 0 && (u = this.externalSheets.length, this.externalSheets.push({ ...e === void 0 ? {} : { book: e }, first: r, last: n2 }), this.linkIndices.set(t, u)), u;
+  sheetLink(e, n2, r) {
+    let t = `${e ?? -1}:${n2}:${r}`, u = this.linkIndices.get(t);
+    return u === void 0 && (u = this.externalSheets.length, this.externalSheets.push({ ...e === void 0 ? {} : { book: e }, first: n2, last: r }), this.linkIndices.set(t, u)), u;
   }
   finalize(e = []) {
-    let r = (this.book.names?.length ?? 0) + this.macroNames.length, n2 = new Int32Array(r).fill(-1), t = new Int32Array(r), u = new Uint8Array(r), i = [], h2 = [], g = 0;
-    for (let m2 = 0; m2 < r; m2++) {
-      if (n2[m2] !== -1) continue;
+    let n2 = (this.book.names?.length ?? 0) + this.macroNames.length, r = new Int32Array(n2).fill(-1), t = new Int32Array(n2), u = new Uint8Array(n2), i = [], h2 = [], g = 0;
+    for (let m2 = 0; m2 < n2; m2++) {
+      if (r[m2] !== -1) continue;
       let f = [{ index: m2, next: 0 }];
       for (; f.length; ) {
         this.context.signal.throwIfAborted();
         let o = f[f.length - 1];
-        n2[o.index] === -1 && (n2[o.index] = t[o.index] = g++, u[o.index] = 1, i.push(o.index));
+        r[o.index] === -1 && (r[o.index] = t[o.index] = g++, u[o.index] = 1, i.push(o.index));
         let E = e[o.index]?.nameDependencies ?? [];
         if (o.next < E.length) {
           let k = E[o.next++];
-          n2[k] === -1 ? f.push({ index: k, next: 0 }) : u[k] && (t[o.index] = Math.min(t[o.index], n2[k]));
+          r[k] === -1 ? f.push({ index: k, next: 0 }) : u[k] && (t[o.index] = Math.min(t[o.index], r[k]));
         } else {
           if (f.pop(), f.length) {
             let k = f[f.length - 1].index;
             t[k] = Math.min(t[k], t[o.index]);
           }
-          if (t[o.index] === n2[o.index]) {
-            let k = [], S;
+          if (t[o.index] === r[o.index]) {
+            let k = [], N;
             do
-              this.context.signal.throwIfAborted(), S = i.pop(), u[S] = 0, k.push(S);
-            while (S !== o.index);
-            k.sort((A, R2) => A - R2);
+              this.context.signal.throwIfAborted(), N = i.pop(), u[N] = 0, k.push(N);
+            while (N !== o.index);
+            k.sort((A, S) => A - S);
             for (let A of k) h2.push(A);
           }
         }
@@ -1422,56 +1422,56 @@ var dt = class {
     }
     return h2;
   }
-  compile(e, r, n2, t, u, i) {
+  compile(e, n2, r, t, u, i) {
     let h2 = (x, b, O = i ?? false) => {
-      let C2 = Wn(x, { maximumDepth: this.context.limits.formulaDepth, workbook: this.book, position: b, arrayStringLiterals: O, signal: this.context.signal, maximumNodes: this.context.limits.workbookNodes ?? this.context.limits.cells, maximumLength: this.context.limits.workbookTextBytes ?? this.context.limits.outputBytes });
+      let C2 = jn(x, { maximumDepth: this.context.limits.formulaDepth, workbook: this.book, position: b, arrayStringLiterals: O, signal: this.context.signal, maximumNodes: this.context.limits.workbookNodes ?? this.context.limits.cells, maximumLength: this.context.limits.workbookTextBytes ?? this.context.limits.outputBytes });
       if (!C2.ok) throw new le("unsupported-feature", `Cannot export Excel formula: ${x}`);
       let v = 0;
-      return zn(C2.document, () => {
+      return $n(C2.document, () => {
         if (this.context.signal.throwIfAborted(), ++v > (this.context.limits.workbookNodes ?? this.context.limits.cells)) throw new le("resource-limit", "ssconvert BIFF formula node limit exceeded");
       }).root;
-    }, g = u !== void 0, a = u ? jn(u, this.book, h2, () => this.context.signal.throwIfAborted()) : h2(e, { sheet: r, row: n2, column: t }), l = [], d = [], m2 = [], f = [], o = [], E = [], k = () => {
+    }, g = u !== void 0, a = u ? zn(u, this.book, h2, () => this.context.signal.throwIfAborted()) : h2(e, { sheet: n2, row: r, column: t }), l = [], d = [], m2 = [], f = [], o = [], E = [], k = () => {
       l.length && f.at(-1) !== l.length && f.push(l.length);
-    }, S = false, A = [], R2 = (x, b = l) => {
+    }, N = false, A = [], S = (x, b = l) => {
       if (x.length > this.context.limits.outputBytes - l.length - d.length) throw new le("resource-limit", "ssconvert BIFF formula bytes limit exceeded");
       for (let O of x) b.push(O);
     }, B = (x) => {
-      let b = x.row, O = x.column, C2 = b.value + (b.relative ? n2 : 0), v = O.value + (O.relative ? t : 0);
+      let b = x.row, O = x.column, C2 = b.value + (b.relative ? r : 0), v = O.value + (O.relative ? t : 0);
       if (C2 < 0 || C2 >= (this.revision === 8 ? 65536 : 16384) || v < 0 || v >= 256) throw new le("unsupported-feature", "Excel BIFF formula reference exceeds version limits");
-      let F = g && b.relative ? b.value : C2, M = g && O.relative ? O.value : v;
-      return this.revision === 8 ? K2(F, M & 255 | (b.relative ? 32768 : 0) | (O.relative ? 16384 : 0)) : new Uint8Array([F & 255, F >> 8 & 63 | (b.relative ? 128 : 0) | (O.relative ? 64 : 0), M & 255]);
-    }, N = (x) => {
-      if (x.kind === "number") if (x.value >= 0 && x.value <= 65535 && Number.isInteger(x.value)) R2([30, ...K2(x.value)]);
+      let R2 = g && b.relative ? b.value : C2, M = g && O.relative ? O.value : v;
+      return this.revision === 8 ? K2(R2, M & 255 | (b.relative ? 32768 : 0) | (O.relative ? 16384 : 0)) : new Uint8Array([R2 & 255, R2 >> 8 & 63 | (b.relative ? 128 : 0) | (O.relative ? 64 : 0), M & 255]);
+    }, F = (x) => {
+      if (x.kind === "number") if (x.value >= 0 && x.value <= 65535 && Number.isInteger(x.value)) S([30, ...K2(x.value)]);
       else {
         let b = new Uint8Array(9);
-        b[0] = 31, new DataView(b.buffer).setFloat64(1, x.value, true), R2(b);
+        b[0] = 31, new DataView(b.buffer).setFloat64(1, x.value, true), S(b);
       }
-      else if (x.kind === "boolean") R2([29, Number(x.value)]);
-      else if (x.kind === "error") R2([28, Ye(x.value)]);
-      else if (x.kind === "blank") R2([22]);
+      else if (x.kind === "boolean") S([29, Number(x.value)]);
+      else if (x.kind === "error") S([28, qe(x.value)]);
+      else if (x.kind === "blank") S([22]);
       else {
         let b = [], O = "";
         for (let C2 of x.value) O.length + C2.length > 255 && (b.push(O), O = ""), O += C2;
         b.push(O), b.forEach((C2, v) => {
-          R2([23]), R2(ce(C2, this.revision, this.context, 1)), v && R2([8]), k();
-        }), b.length > 1 && R2([21]);
-      }
-    }, w2 = (x) => {
-      if (this.context.signal.throwIfAborted(), k(), x.kind === "literal") N(x.value);
-      else if (x.kind === "omitted") R2([22]);
-      else if (x.kind === "parentheses") w2(x.child), R2([21]);
-      else if (x.kind === "unary") w2(x.child), R2([x.op === "+" ? 18 : x.op === "-" ? 19 : 20]);
+          S([23]), S(ce(C2, this.revision, this.context, 1)), v && S([8]), k();
+        }), b.length > 1 && S([21]);
+      }
+    }, p = (x) => {
+      if (this.context.signal.throwIfAborted(), k(), x.kind === "literal") F(x.value);
+      else if (x.kind === "omitted") S([22]);
+      else if (x.kind === "parentheses") p(x.child), S([21]);
+      else if (x.kind === "unary") p(x.child), S([x.op === "+" ? 18 : x.op === "-" ? 19 : 20]);
       else if (x.kind === "binary") {
-        let b = $n[x.op];
+        let b = Kn[x.op];
         if (b === void 0) throw new le("unsupported-feature", `Unsupported Excel operator '${x.op}'`);
-        w2(x.left), w2(x.right), R2([b]);
+        p(x.left), p(x.right), S([b]);
       } else if (x.kind === "reference") {
         if (x.label) {
           if (x.label.kind !== "radical" && x.label.semantics === "openformula") throw new le("unsupported-feature", "Excel BIFF live label reference cannot retain OpenFormula automatic-range semantics");
           if (u) throw new le("unsupported-feature", "Excel BIFF live label reference in a named expression is not yet supported");
-          let p = x.first, c = p.row, I = p.column;
-          if (this.revision !== 8 || x.last || !c || !I || c.relative !== I.relative || p.workbook !== void 0 || p.sheet !== void 0) throw new le("unsupported-feature", "Excel BIFF live label reference requires a local BIFF8 anchor with matching row/column relativity");
-          let L2 = c.value + (c.relative ? n2 : 0), X2 = I.value + (I.relative ? t : 0);
+          let w2 = x.first, c = w2.row, I = w2.column;
+          if (this.revision !== 8 || x.last || !c || !I || c.relative !== I.relative || w2.workbook !== void 0 || w2.sheet !== void 0) throw new le("unsupported-feature", "Excel BIFF live label reference requires a local BIFF8 anchor with matching row/column relativity");
+          let L2 = c.value + (c.relative ? r : 0), X2 = I.value + (I.relative ? t : 0);
           if (L2 < 0 || L2 >= 65536 || X2 < 0 || X2 >= 256) throw new le("unsupported-feature", "Excel BIFF live label reference exceeds version limits");
           let z = X2 | (c.relative ? 32768 : 0) | (x.label.quoted ? 16384 : 0);
           if (x.label.kind === "radical") {
@@ -1479,122 +1479,122 @@ var dt = class {
             if (Q2) {
               if (x.label.quoted || Q2.length >= 1073741823) throw new le("unsupported-feature", "Excel BIFF multiple label flags or count cannot be represented");
               let te = Q2.length + 1;
-              R2([24, 11, 0, 0, 0, 0]), R2(K2(te & 65535, Math.floor(te / 65536) | (c.relative ? 32768 : 0)), d);
-              for (let ie of [...Q2.map((re) => re.first), p]) {
+              S([24, 11, 0, 0, 0, 0]), S(K2(te & 65535, Math.floor(te / 65536) | (c.relative ? 32768 : 0)), d);
+              for (let ie of [...Q2.map((re) => re.first), w2]) {
                 if (this.context.signal.throwIfAborted(), !ie.row || !ie.column || ie.row.relative !== c.relative || ie.column.relative !== c.relative || ie.sheet !== void 0 || ie.workbook !== void 0) throw new le("unsupported-feature", "Excel BIFF multiple labels require local cells with matching relativity");
                 let re = B(ie);
-                R2([re[0], re[1], re[2], 0], d);
+                S([re[0], re[1], re[2], 0], d);
               }
-            } else R2([24, 10, ...K2(L2, z)]);
-            if (!W) R2([q | 11, ...new Uint8Array(8)]);
+            } else S([24, 10, ...K2(L2, z)]);
+            if (!W) S([q | 11, ...new Uint8Array(8)]);
             else {
               if ([W.first, W.last].some((he) => !he.row || !he.column || he.sheet !== void 0 || he.workbook !== void 0)) throw new le("unsupported-feature", "Excel BIFF radical label requires a local explicit area");
               let te = B(W.first), ie = B(W.last), re = new DataView(te.buffer), oe = new DataView(ie.buffer);
-              if (!St(L2, X2, [re.getUint16(0, true), oe.getUint16(0, true), re.getUint16(2, true) & 255, oe.getUint16(2, true) & 255]) || Q2 && (X2 !== te[2] || te[2] !== ie[2])) throw new le("unsupported-feature", "Excel BIFF radical label must adjoin its explicit area");
-              R2([q | 5]), R2(te.subarray(0, 2)), R2(ie.subarray(0, 2)), R2(te.subarray(2)), R2(ie.subarray(2));
+              if (!Nt(L2, X2, [re.getUint16(0, true), oe.getUint16(0, true), re.getUint16(2, true) & 255, oe.getUint16(2, true) & 255]) || Q2 && (X2 !== te[2] || te[2] !== ie[2])) throw new le("unsupported-feature", "Excel BIFF radical label must adjoin its explicit area");
+              S([q | 5]), S(te.subarray(0, 2)), S(ie.subarray(0, 2)), S(te.subarray(2)), S(ie.subarray(2));
             }
-          } else R2([24, (x.label.axis === "row" ? 2 : 3) + (x.label.referenceClass === "value" ? 4 : 0), ...K2(L2, z)]);
+          } else S([24, (x.label.axis === "row" ? 2 : 3) + (x.label.referenceClass === "value" ? 4 : 0), ...K2(L2, z)]);
           return;
         }
-        if (!S && (x.first.sheetRelative && (x.first.sheet || x.last?.sheet) || x.last?.sheet && x.last.sheetRelative)) {
-          let p = u ? `name '${u.name}'` : `cell '${this.book.sheets.find((c) => c.id === r)?.name ?? r}' R${n2 + 1}C${t + 1}`;
-          m2.push({ code: "biff-loss-warning", severity: "warning", message: `Excel BIFF exports relative sheet references in ${p} as fixed sheet references; copying across sheets or evaluating names from another sheet can change results` }), S = true;
+        if (!N && (x.first.sheetRelative && (x.first.sheet || x.last?.sheet) || x.last?.sheet && x.last.sheetRelative)) {
+          let w2 = u ? `name '${u.name}'` : `cell '${this.book.sheets.find((c) => c.id === n2)?.name ?? n2}' R${r + 1}C${t + 1}`;
+          m2.push({ code: "biff-loss-warning", severity: "warning", message: `Excel BIFF exports relative sheet references in ${w2} as fixed sheet references; copying across sheets or evaluating names from another sheet can change results` }), N = true;
         }
         if (x.last?.workbook && x.last.workbook !== x.first.workbook) throw new le("unsupported-feature", "Excel BIFF range spans different workbooks");
-        let b = (p, c) => ({ ...p, row: p.row ?? { value: c ? this.revision === 8 ? 65535 : 16383 : 0, relative: false }, column: p.column ?? { value: c ? 255 : 0, relative: false } }), O = B(b(x.first, false)), C2 = x.last ? B(b(x.last, true)) : void 0, v = x.first.sheet !== void 0 || x.last?.sheet !== void 0 || !!x.first.workbook, F = 0, M = 0, _ = 0;
+        let b = (w2, c) => ({ ...w2, row: w2.row ?? { value: c ? this.revision === 8 ? 65535 : 16383 : 0, relative: false }, column: w2.column ?? { value: c ? 255 : 0, relative: false } }), O = B(b(x.first, false)), C2 = x.last ? B(b(x.last, true)) : void 0, v = x.first.sheet !== void 0 || x.last?.sheet !== void 0 || !!x.first.workbook, R2 = 0, M = 0, _ = 0;
         if (v) if (x.first.workbook) {
           if (x.first.sheet === void 0) throw new le("unsupported-feature", "Excel BIFF external reference requires a sheet");
-          let p = this.externalBook(x.first.workbook);
-          if (M = this.externalScope(p, x.first.sheet), _ = x.last?.sheet === void 0 ? M : this.externalScope(p, x.last.sheet), this.revision === 7 && M !== _) throw new le("unsupported-feature", "Excel BIFF7 external range cannot span sheets");
-          F = this.sheetLink(p, M, _);
-        } else M = x.first.sheet === void 0 ? this.book.sheets.findIndex((p) => p.id === r) : this.book.sheets.findIndex((p) => Ue(p.name) === Ue(x.first.sheet)), _ = x.last?.sheet !== void 0 ? this.book.sheets.findIndex((p) => Ue(p.name) === Ue(x.last.sheet)) : M, M < 0 && (M = 65535), _ < 0 && (_ = 65535), F = this.sheetLink(void 0, M, _);
-        if (R2([v ? C2 ? 91 : 90 : C2 ? g ? 77 : 69 : g ? 76 : 68]), v) if (this.revision === 8) A.push({ offset: l.length, index: F, kind: "sheet" }), R2(K2(F));
+          let w2 = this.externalBook(x.first.workbook);
+          if (M = this.externalScope(w2, x.first.sheet), _ = x.last?.sheet === void 0 ? M : this.externalScope(w2, x.last.sheet), this.revision === 7 && M !== _) throw new le("unsupported-feature", "Excel BIFF7 external range cannot span sheets");
+          R2 = this.sheetLink(w2, M, _);
+        } else M = x.first.sheet === void 0 ? this.book.sheets.findIndex((w2) => w2.id === n2) : this.book.sheets.findIndex((w2) => Oe(w2.name) === Oe(x.first.sheet)), _ = x.last?.sheet !== void 0 ? this.book.sheets.findIndex((w2) => Oe(w2.name) === Oe(x.last.sheet)) : M, M < 0 && (M = 65535), _ < 0 && (_ = 65535), R2 = this.sheetLink(void 0, M, _);
+        if (S([v ? C2 ? 91 : 90 : C2 ? g ? 77 : 69 : g ? 76 : 68]), v) if (this.revision === 8) A.push({ offset: l.length, index: R2, kind: "sheet" }), S(K2(R2));
         else {
-          let p = new Uint8Array(14), c = new DataView(p.buffer);
-          if (x.first.workbook) A.push({ offset: l.length, index: F, kind: "sheet" });
+          let w2 = new Uint8Array(14), c = new DataView(w2.buffer);
+          if (x.first.workbook) A.push({ offset: l.length, index: R2, kind: "sheet" });
           else {
             let I = M === 65535 ? this.book.sheets.length + 2 : M + 1;
             c.setInt16(0, -I, true), c.setUint16(10, M, true), c.setUint16(12, _, true);
           }
-          R2(p);
+          S(w2);
         }
-        C2 ? (R2(O.subarray(0, 2)), R2(C2.subarray(0, 2)), R2(O.subarray(2)), R2(C2.subarray(2))) : R2(O);
+        C2 ? (S(O.subarray(0, 2)), S(C2.subarray(0, 2)), S(O.subarray(2)), S(C2.subarray(2))) : S(O);
       } else if (x.kind === "name") {
         if (x.relocation) throw new le("unsupported-feature", "Unsupported ssconvert feature: live name relocation in BIFF output");
         if (x.workbook) {
-          let F = this.externalBook(x.workbook), M = this.externalBooks[F], _ = x.sheet === void 0 ? void 0 : this.externalScope(F, x.sheet), p = M.names.findIndex((X2) => X2.name === x.name && X2.sheet === _);
-          p < 0 && (p = M.names.length, M.names.push({ name: x.name, ..._ === void 0 ? {} : { sheet: _ } }));
-          let c = this.sheetLink(F, this.revision === 7 ? 65534 : _ ?? 65534, this.revision === 7 ? 65534 : _ ?? 65534), I = new Uint8Array(this.revision === 8 ? 7 : 25), L2 = new DataView(I.buffer);
-          if (I[0] = 89, this.revision === 8) L2.setUint32(3, p + 1, true);
+          let R2 = this.externalBook(x.workbook), M = this.externalBooks[R2], _ = x.sheet === void 0 ? void 0 : this.externalScope(R2, x.sheet), w2 = M.names.findIndex((X2) => X2.name === x.name && X2.sheet === _);
+          w2 < 0 && (w2 = M.names.length, M.names.push({ name: x.name, ..._ === void 0 ? {} : { sheet: _ } }));
+          let c = this.sheetLink(R2, this.revision === 7 ? 65534 : _ ?? 65534, this.revision === 7 ? 65534 : _ ?? 65534), I = new Uint8Array(this.revision === 8 ? 7 : 25), L2 = new DataView(I.buffer);
+          if (I[0] = 89, this.revision === 8) L2.setUint32(3, w2 + 1, true);
           else {
-            if (p >= 65535) throw new le("unsupported-feature", "Excel BIFF external name index exceeds version limits");
-            L2.setUint16(11, p + 1, true);
+            if (w2 >= 65535) throw new le("unsupported-feature", "Excel BIFF external name index exceeds version limits");
+            L2.setUint16(11, w2 + 1, true);
           }
-          A.push({ offset: l.length + 1, index: c, kind: "sheet" }), R2(I);
+          A.push({ offset: l.length + 1, index: c, kind: "sheet" }), S(I);
           return;
         }
-        let b = this.book.sheets.find((F) => F.id === r) ?? this.book.sheets.find((F) => Ue(F.name) === Ue(r)), O = x.sheet === void 0 ? b : this.book.sheets.find((F) => Ue(F.name) === Ue(x.sheet)), C2 = (F) => F.name === x.name, v = x.workbook === "" && x.sheet === void 0 ? -1 : this.book.names?.findIndex((F) => C2(F) && F.sheet !== void 0 && O !== void 0 && F.sheet === O.id) ?? -1;
-        if (v < 0 && (x.sheet === void 0 || O !== void 0) && (v = this.book.names?.findIndex((F) => C2(F) && F.sheet === void 0) ?? -1), v < 0) {
-          R2([28, 29]);
+        let b = this.book.sheets.find((R2) => R2.id === n2) ?? this.book.sheets.find((R2) => Oe(R2.name) === Oe(n2)), O = x.sheet === void 0 ? b : this.book.sheets.find((R2) => Oe(R2.name) === Oe(x.sheet)), C2 = (R2) => R2.name === x.name, v = x.workbook === "" && x.sheet === void 0 ? -1 : this.book.names?.findIndex((R2) => C2(R2) && R2.sheet !== void 0 && O !== void 0 && R2.sheet === O.id) ?? -1;
+        if (v < 0 && (x.sheet === void 0 || O !== void 0) && (v = this.book.names?.findIndex((R2) => C2(R2) && R2.sheet === void 0) ?? -1), v < 0) {
+          S([28, 29]);
           return;
         }
         if (x.sheet !== void 0 && O !== void 0 && this.revision === 8) {
-          let F = new Uint8Array(7), M = new DataView(F.buffer);
-          F[0] = 89;
-          let _ = this.book.sheets.indexOf(O), p = this.sheetLink(void 0, _, _);
-          A.push({ offset: l.length + 1, index: p, kind: "sheet" }), M.setUint16(1, p, true), M.setUint16(3, v + 1, true), A.push({ offset: l.length + 3, index: v, kind: "name" }), R2(F);
+          let R2 = new Uint8Array(7), M = new DataView(R2.buffer);
+          R2[0] = 89;
+          let _ = this.book.sheets.indexOf(O), w2 = this.sheetLink(void 0, _, _);
+          A.push({ offset: l.length + 1, index: w2, kind: "sheet" }), M.setUint16(1, w2, true), M.setUint16(3, v + 1, true), A.push({ offset: l.length + 3, index: v, kind: "name" }), S(R2);
         } else {
-          let F = new Uint8Array(this.revision === 8 ? 5 : 15);
-          F[0] = 67, new DataView(F.buffer).setUint16(1, v + 1, true), A.push({ offset: l.length + 1, index: v, kind: "name" }), R2(F);
+          let R2 = new Uint8Array(this.revision === 8 ? 5 : 15);
+          R2[0] = 67, new DataView(R2.buffer).setUint16(1, v + 1, true), A.push({ offset: l.length + 1, index: v, kind: "name" }), S(R2);
         }
       } else if (x.kind === "call") {
-        let b = x.name.toUpperCase(), O = Kn.get(b), C2 = Yn.has(b), v = !O || O.id === 255, F = C2 && b === "IFERROR" ? { id: 255, min: 2, max: 2 } : v ? { id: 255, min: x.args.length, max: x.args.length } : O;
+        let b = x.name.toUpperCase(), O = Yn.get(b), C2 = qn.has(b), v = !O || O.id === 255, R2 = C2 && b === "IFERROR" ? { id: 255, min: 2, max: 2 } : v ? { id: 255, min: x.args.length, max: x.args.length } : O;
         if (v || C2) {
-          let _ = new Uint8Array(C2 ? this.revision === 8 ? 5 : 15 : this.revision === 8 ? 7 : 25), p = new DataView(_.buffer);
+          let _ = new Uint8Array(C2 ? this.revision === 8 ? 5 : 15 : this.revision === 8 ? 7 : 25), w2 = new DataView(_.buffer);
           if (C2) {
             let c = `_xlfn.${b}`, I = this.macroNames.indexOf(c);
-            I < 0 && (I = this.macroNames.length, this.macroNames.push(c)), _[0] = 35, A.push({ offset: l.length + 1, index: (this.book.names?.length ?? 0) + I, kind: "name" }), p.setUint16(1, (this.book.names?.length ?? 0) + I + 1, true);
+            I < 0 && (I = this.macroNames.length, this.macroNames.push(c)), _[0] = 35, A.push({ offset: l.length + 1, index: (this.book.names?.length ?? 0) + I, kind: "name" }), w2.setUint16(1, (this.book.names?.length ?? 0) + I + 1, true);
           } else {
             let c = this.externNames.indexOf(b);
-            if (c < 0 && (c = this.externNames.length, this.externNames.push(b)), _[0] = 57, p.setUint16(1, this.revision === 8 ? 0 : this.book.sheets.length + 1, true), this.revision === 8) p.setUint32(3, c + 1, true);
+            if (c < 0 && (c = this.externNames.length, this.externNames.push(b)), _[0] = 57, w2.setUint16(1, this.revision === 8 ? 0 : this.book.sheets.length + 1, true), this.revision === 8) w2.setUint32(3, c + 1, true);
             else {
               if (c >= 65535) throw new le("unsupported-feature", "Excel BIFF formula index exceeds version limits");
-              p.setUint16(11, c + 1, true);
+              w2.setUint16(11, c + 1, true);
             }
           }
-          R2(_);
+          S(_);
         }
-        let M = Math.min(x.args.length, F.max);
-        x.args.length > F.max && m2.push({ code: "biff-loss-warning", severity: "warning", message: `Too many arguments for function '${x.name}', MS Excel can only handle ${F.max} not ${x.args.length}` });
-        for (let _ of x.args.slice(0, M)) w2(_);
-        for (let _ = M; _ < F.min; _++) R2([22]);
-        v || C2 ? R2([66, Math.max(M, F.min) + 1, ...K2(255)]) : F.min === F.max ? R2([65, ...K2(F.id)]) : R2([66, Math.max(M, F.min), ...K2(F.id)]);
+        let M = Math.min(x.args.length, R2.max);
+        x.args.length > R2.max && m2.push({ code: "biff-loss-warning", severity: "warning", message: `Too many arguments for function '${x.name}', MS Excel can only handle ${R2.max} not ${x.args.length}` });
+        for (let _ of x.args.slice(0, M)) p(_);
+        for (let _ = M; _ < R2.min; _++) S([22]);
+        v || C2 ? S([66, Math.max(M, R2.min) + 1, ...K2(255)]) : R2.min === R2.max ? S([65, ...K2(R2.id)]) : S([66, Math.max(M, R2.min), ...K2(R2.id)]);
       } else {
         let b = x.rows[0]?.length ?? 0;
         if (!b || b > 256 || x.rows.length > 65536) throw new le("unsupported-feature", "Excel BIFF array dimensions exceed limits");
-        R2([64, ...new Uint8Array(7)]), R2([this.revision === 8 ? b - 1 : b & 255, ...K2(x.rows.length - (this.revision === 8 ? 1 : 0))], d), o.push(d.length);
+        S([64, ...new Uint8Array(7)]), S([this.revision === 8 ? b - 1 : b & 255, ...K2(x.rows.length - (this.revision === 8 ? 1 : 0))], d), o.push(d.length);
         for (let O of x.rows) for (let C2 of O) {
           if (C2.kind !== "literal") throw new le("unsupported-feature", "Excel BIFF array requires literals");
           let v = C2.value;
           if (v.kind === "string") {
-            let F = d.length + 4;
-            R2([2], d), R2(ce(v.value, this.revision, this.context, this.revision === 8 ? 2 : 1), d), this.revision === 8 && d.length > F && E.push({ start: F, end: d.length });
+            let R2 = d.length + 4;
+            S([2], d), S(ce(v.value, this.revision, this.context, this.revision === 8 ? 2 : 1), d), this.revision === 8 && d.length > R2 && E.push({ start: R2, end: d.length });
           } else {
-            let F = new Uint8Array(9), M = new DataView(F.buffer);
-            F[0] = v.kind === "number" ? 1 : v.kind === "boolean" ? 4 : v.kind === "error" ? 16 : 0, v.kind === "number" ? M.setFloat64(1, v.value, true) : v.kind === "boolean" ? F[1] = Number(v.value) : v.kind === "error" && (F[1] = Ye(v.value)), R2(F, d);
+            let R2 = new Uint8Array(9), M = new DataView(R2.buffer);
+            R2[0] = v.kind === "number" ? 1 : v.kind === "boolean" ? 4 : v.kind === "error" ? 16 : 0, v.kind === "number" ? M.setFloat64(1, v.value, true) : v.kind === "boolean" ? R2[1] = Number(v.value) : v.kind === "error" && (R2[1] = qe(v.value)), S(R2, d);
           }
           o.push(d.length);
         }
       }
       k();
     };
-    if (w2(a), k(), l.length > 65535) throw new le("unsupported-feature", "Excel BIFF formula token length exceeds version limits");
+    if (p(a), k(), l.length > 65535) throw new le("unsupported-feature", "Excel BIFF formula token length exceeds version limits");
     let D = new Uint8Array(l);
     for (let x of A) this.relocations.push({ ...x, tokens: D });
     return { tokens: D, tokenBoundaries: f, arrays: new Uint8Array(d), arrayBoundaries: o, arrayStrings: E, diagnostics: m2, nameDependencies: A.filter((x) => x.kind === "name").map((x) => x.index) };
   }
 };
-var mt = class {
+var ht = class {
   context;
   diagnostics = [];
   styles = [{ format: "General" }];
@@ -1603,22 +1603,22 @@ var mt = class {
     this.context = e;
   }
   register(e) {
-    let r = Qn(e.style?.gnumeric, (g) => this.charge(g)), n2 = e.format ?? r?.attributes.Format ?? r?.children.find((g) => g.name === "Format")?.text ?? "General", t = { format: n2 === "General" ? qn(e) ?? n2 : n2, ...r ? { node: r } : {} };
-    if (!r && t.format === "General") return 15;
+    let n2 = Zn(e.style?.gnumeric, (g) => this.charge(g)), r = e.format ?? n2?.attributes.Format ?? n2?.children.find((g) => g.name === "Format")?.text ?? "General", t = { format: r === "General" ? Qn(e) ?? r : r, ...n2 ? { node: n2 } : {} };
+    if (!n2 && t.format === "General") return 15;
     let u = JSON.stringify(t);
     this.charge(u.length);
     let i = this.ids.get(u);
     if (i !== void 0) return i;
-    if (this.styles.length >= 4080) throw new hn("unsupported-feature", "Excel BIFF XF limit exceeded");
+    if (this.styles.length >= 4080) throw new pn("unsupported-feature", "Excel BIFF XF limit exceeded");
     let h2 = 15 + this.styles.length;
     return this.ids.set(u, h2), this.styles.push(t), h2;
   }
   work = 0;
   charge(e = 1) {
-    if (this.context.signal.throwIfAborted(), this.work += e, this.work > (this.context.limits.workbookWork ?? this.context.limits.outputBytes * 8)) throw new hn("resource-limit", "ssconvert BIFF style work limit exceeded");
+    if (this.context.signal.throwIfAborted(), this.work += e, this.work > (this.context.limits.workbookWork ?? this.context.limits.outputBytes * 8)) throw new pn("resource-limit", "ssconvert BIFF style work limit exceeded");
   }
-  serialize(e, r) {
-    let n2 = [], t = /* @__PURE__ */ new Map(), u = [], i = /* @__PURE__ */ new Map(), h2 = /* @__PURE__ */ new Map(), g = (l, d) => {
+  serialize(e, n2) {
+    let r = [], t = /* @__PURE__ */ new Map(), u = [], i = /* @__PURE__ */ new Map(), h2 = /* @__PURE__ */ new Map(), g = (l, d) => {
       if (!l) return d;
       let m2 = l.split(":").map((E) => (parseInt(E, 16) >>> 8).toString(16).padStart(2, "0")).join("").toUpperCase(), f = ["000000", "FFFFFF", "FF0000", "00FF00", "0000FF", "FFFF00", "FF00FF", "00FFFF"].indexOf(m2);
       if (f >= 0) return f;
@@ -1636,32 +1636,32 @@ var mt = class {
     }, a = [];
     for (let l of this.styles) {
       this.charge();
-      let d = l.node?.attributes ?? {}, m2 = l.node?.children.find((F) => F.name === "Font"), f = m2?.attributes ?? {}, o = g(d.Fore, 32767), E = JSON.stringify({ font: m2, fore: o }), k = t.get(E);
+      let d = l.node?.attributes ?? {}, m2 = l.node?.children.find((R2) => R2.name === "Font"), f = m2?.attributes ?? {}, o = g(d.Fore, 32767), E = JSON.stringify({ font: m2, fore: o }), k = t.get(E);
       if (k === void 0) {
-        k = n2.length + (n2.length >= 4 ? 1 : 0), t.set(E, k);
-        let F = ce(m2?.text || "Sans", r, this.context, 1), M = new Uint8Array(14 + F.length), _ = new DataView(M.buffer);
-        _.setUint16(0, Math.round(Number(f.Unit ?? 10) * 20), true), _.setUint16(2, (Number(f.Bold) ? 1 : 0) | (Number(f.Italic) ? 2 : 0) | (Number(f.StrikeThrough) ? 8 : 0), true), _.setUint16(4, o, true), _.setUint16(6, Number(f.Bold) ? 700 : 400, true), _.setUint16(8, Number(f.Script) > 0 ? 1 : Number(f.Script) < 0 ? 2 : 0, true), M[10] = [0, 1, 2, 33, 34][Number(f.Underline ?? 0)] ?? 0, M.set(F, 14), n2.push(M);
+        k = r.length + (r.length >= 4 ? 1 : 0), t.set(E, k);
+        let R2 = ce(m2?.text || "Sans", n2, this.context, 1), M = new Uint8Array(14 + R2.length), _ = new DataView(M.buffer);
+        _.setUint16(0, Math.round(Number(f.Unit ?? 10) * 20), true), _.setUint16(2, (Number(f.Bold) ? 1 : 0) | (Number(f.Italic) ? 2 : 0) | (Number(f.StrikeThrough) ? 8 : 0), true), _.setUint16(4, o, true), _.setUint16(6, Number(f.Bold) ? 700 : 400, true), _.setUint16(8, Number(f.Script) > 0 ? 1 : Number(f.Script) < 0 ? 2 : 0, true), M[10] = [0, 1, 2, 33, 34][Number(f.Underline ?? 0)] ?? 0, M.set(R2, 14), r.push(M);
       }
       l.format !== "General" && !i.has(l.format) && i.set(l.format, 164 + i.size);
-      let S = new Uint8Array(r === 8 ? 20 : 16), A = new DataView(S.buffer);
+      let N = new Uint8Array(n2 === 8 ? 20 : 16), A = new DataView(N.buffer);
       A.setUint16(0, k, true), A.setUint16(2, i.get(l.format) ?? 0, true), A.setUint16(4, (Number(d.Locked ?? 1) ? 1 : 0) | (Number(d.Hidden) ? 2 : 0), true);
-      let R2 = ["GENERAL", "LEFT", "CENTER", "RIGHT", "FILL", "JUSTIFY", "CENTER_ACROSS_SELECTION", "DISTRIBUTED"].indexOf((d.HAlign ?? "GNM_HALIGN_GENERAL").slice(11)), B = ["TOP", "CENTER", "BOTTOM", "JUSTIFY", "DISTRIBUTED"].indexOf((d.VAlign ?? "GNM_VALIGN_BOTTOM").slice(11));
-      S[6] = Math.max(0, R2) | (Number(d.WrapText) ? 8 : 0) | Math.max(0, B) << 4;
-      let N = Number(d.Rotation ?? 0), w2 = g(d.PatternColor, 64) | g(d.Back, 65) << 7, D = l.node?.children.find((F) => F.name === "StyleBorder")?.children ?? [], x = (F) => {
-        let M = D.find((_) => _.name === F);
+      let S = ["GENERAL", "LEFT", "CENTER", "RIGHT", "FILL", "JUSTIFY", "CENTER_ACROSS_SELECTION", "DISTRIBUTED"].indexOf((d.HAlign ?? "GNM_HALIGN_GENERAL").slice(11)), B = ["TOP", "CENTER", "BOTTOM", "JUSTIFY", "DISTRIBUTED"].indexOf((d.VAlign ?? "GNM_VALIGN_BOTTOM").slice(11));
+      N[6] = Math.max(0, S) | (Number(d.WrapText) ? 8 : 0) | Math.max(0, B) << 4;
+      let F = Number(d.Rotation ?? 0), p = g(d.PatternColor, 64) | g(d.Back, 65) << 7, D = l.node?.children.find((R2) => R2.name === "StyleBorder")?.children ?? [], x = (R2) => {
+        let M = D.find((_) => _.name === R2);
         return { style: Number(M?.attributes.Style ?? 0), color: g(M?.attributes.Color, 64) };
       }, b = x("Left"), O = x("Right"), C2 = x("Top"), v = x("Bottom");
-      if (r === 8) {
-        let F = N % 360;
-        S[7] = N < 0 ? 255 : F > 90 ? 450 - F : F, S[8] = Number(d.Indent ?? 0) & 15 | (Number(d.ShrinkToFit) ? 16 : 0), S[9] = 252, A.setUint16(10, b.style | O.style << 4 | C2.style << 8 | v.style << 12, true);
-        let M = x("Diagonal"), _ = x("RevDiagonal"), p = M.style ? M : _;
-        A.setUint16(12, b.color | O.color << 7 | (M.style ? 16384 : 0) | (_.style ? 32768 : 0), true), A.setUint32(14, C2.color | v.color << 7 | p.color << 14 | p.style << 21 | Number(d.Shade ?? 0) << 26, true), A.setUint16(18, w2, true);
-      } else S[7] = 252 | (N < 0 ? 1 : N > 45 && N <= 135 ? 2 : N > 225 && N <= 315 ? 3 : 0), A.setUint16(8, w2, true), A.setUint16(10, Number(d.Shade ?? 0) | (v.style & 7) << 6 | v.color << 9, true), A.setUint16(12, C2.style & 7 | (b.style & 7) << 3 | (O.style & 7) << 6 | C2.color << 9, true), A.setUint16(14, b.color | O.color << 7, true);
-      a.push(S);
-    }
-    for (let l of n2) e.record(49, l);
+      if (n2 === 8) {
+        let R2 = F % 360;
+        N[7] = F < 0 ? 255 : R2 > 90 ? 450 - R2 : R2, N[8] = Number(d.Indent ?? 0) & 15 | (Number(d.ShrinkToFit) ? 16 : 0), N[9] = 252, A.setUint16(10, b.style | O.style << 4 | C2.style << 8 | v.style << 12, true);
+        let M = x("Diagonal"), _ = x("RevDiagonal"), w2 = M.style ? M : _;
+        A.setUint16(12, b.color | O.color << 7 | (M.style ? 16384 : 0) | (_.style ? 32768 : 0), true), A.setUint32(14, C2.color | v.color << 7 | w2.color << 14 | w2.style << 21 | Number(d.Shade ?? 0) << 26, true), A.setUint16(18, p, true);
+      } else N[7] = 252 | (F < 0 ? 1 : F > 45 && F <= 135 ? 2 : F > 225 && F <= 315 ? 3 : 0), A.setUint16(8, p, true), A.setUint16(10, Number(d.Shade ?? 0) | (v.style & 7) << 6 | v.color << 9, true), A.setUint16(12, C2.style & 7 | (b.style & 7) << 3 | (O.style & 7) << 6 | C2.color << 9, true), A.setUint16(14, b.color | O.color << 7, true);
+      a.push(N);
+    }
+    for (let l of r) e.record(49, l);
     for (let [l, d] of i) {
-      let m2 = ce(l, r, this.context, r === 8 ? 2 : 1), f = new Uint8Array(2 + m2.length);
+      let m2 = ce(l, n2, this.context, n2 === 8 ? 2 : 1), f = new Uint8Array(2 + m2.length);
       f.set(K2(d)), f.set(m2, 2), e.record(1054, f);
     }
     for (let l = 0; l < 15; l++) {
@@ -1678,19 +1678,23 @@ var mt = class {
   }
 };
 function Ae(...s) {
-  let e = new Uint8Array(s.reduce((n2, t) => n2 + t.length, 0)), r = 0;
-  for (let n2 of s) e.set(n2, r), r += n2.length;
+  let e = new Uint8Array(s.reduce((r, t) => r + t.length, 0)), n2 = 0;
+  for (let r of s) e.set(r, n2), n2 += r.length;
   return e;
 }
-function Te(s, e, r, n2) {
+function Te(s, e, n2, r) {
   let t = new Uint8Array(8), u = new DataView(t.buffer);
-  return u.setUint16(0, e << 4 | r, true), u.setUint16(2, s, true), u.setUint32(4, n2.length, true), Ae(t, n2);
+  return u.setUint16(0, e << 4 | n2, true), u.setUint16(2, s, true), u.setUint32(4, r.length, true), Ae(t, r);
 }
 function ve(...s) {
-  let e = new Uint8Array(s.length * 4), r = new DataView(e.buffer);
-  return s.forEach((n2, t) => r.setUint32(t * 4, n2, true)), e;
+  let e = new Uint8Array(s.length * 4), n2 = new DataView(e.buffer);
+  return s.forEach((r, t) => n2.setUint32(t * 4, r, true)), e;
+}
+function Be(s, e, n2 = false) {
+  let r = s.view?.gnumeric, t = r && typeof r == "object" && !Array.isArray(r) ? r[e] : void 0;
+  return t === void 0 ? n2 : t === true || t === 1 || t === "1" || t === "true";
 }
-var wt = class {
+var gt = class {
   book;
   context;
   maxRows;
@@ -1698,107 +1702,109 @@ var wt = class {
   records = /* @__PURE__ */ new Map();
   comments = /* @__PURE__ */ new Map();
   exported = /* @__PURE__ */ new Set();
-  constructor(e, r, n2) {
-    this.book = e, this.context = r, this.maxRows = n2;
+  constructor(e, n2, r) {
+    this.book = e, this.context = n2, this.maxRows = r;
     for (let t of e.sheets) {
-      let u = (t.unsupportedRecords ?? []).map((i) => ({ record: i, ...i.data === void 0 ? {} : { node: pn(i.data, (h2) => this.charge(h2)) } }));
+      let u = (t.unsupportedRecords ?? []).map((i) => ({ record: i, ...i.data === void 0 ? {} : { node: wn(i.data, (h2) => this.charge(h2)) } }));
       this.records.set(t, u), this.comments.set(t, u.flatMap((i) => i.record.kind === "Objects" ? i.node?.children.filter((h2) => ["CellComment", "GnmCellComment"].includes(h2.name)) ?? [] : []));
     }
   }
   charge(e = 1) {
-    if (this.context.signal.throwIfAborted(), this.work += e, this.work > (this.context.limits.workbookWork ?? this.context.limits.outputBytes * 8)) throw new ht("resource-limit", "ssconvert BIFF metadata work limit exceeded");
+    if (this.context.signal.throwIfAborted(), this.work += e, this.work > (this.context.limits.workbookWork ?? this.context.limits.outputBytes * 8)) throw new pt("resource-limit", "ssconvert BIFF metadata work limit exceeded");
   }
   async prepare() {
     for (let e of this.book.sheets) {
-      let r = [];
-      for (let n2 of this.comments.get(e)) {
+      let n2 = [];
+      for (let r of this.comments.get(e)) {
         this.charge();
-        let t = pt(n2.attributes.ObjectBound?.split(":")[0] ?? "A1");
-        t.row >= this.maxRows || t.column >= 256 ? await this.context.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `Unsupported Excel BIFF comment anchor: ${n2.attributes.ObjectBound}` }) : r.push(n2);
+        let t = wt(r.attributes.ObjectBound?.split(":")[0] ?? "A1");
+        t.row >= this.maxRows || t.column >= 256 ? await this.context.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `Unsupported Excel BIFF comment anchor: ${r.attributes.ObjectBound}` }) : n2.push(r);
       }
-      this.comments.set(e, r);
+      this.comments.set(e, n2);
     }
   }
-  async loss(e, r) {
-    let n2 = /* @__PURE__ */ new Map(), t = new DataView(e.buffer, e.byteOffset, e.byteLength);
+  async loss(e, n2) {
+    let r = /* @__PURE__ */ new Map(), t = new DataView(e.buffer, e.byteOffset, e.byteLength);
     for (let h2 = 0; h2 + 4 <= e.length; ) {
       this.charge();
-      let g = t.getUint16(h2, true), a = t.getUint16(h2 + 2, true), l = Array.from(e.subarray(h2 + 4, h2 + 4 + a), (m2) => m2.toString(16).padStart(2, "0")).join(""), d = n2.get(g) ?? /* @__PURE__ */ new Set();
-      d.add(l), n2.set(g, d), h2 += a + 4;
+      let g = t.getUint16(h2, true), a = t.getUint16(h2 + 2, true), l = Array.from(e.subarray(h2 + 4, h2 + 4 + a), (m2) => m2.toString(16).padStart(2, "0")).join(""), d = r.get(g) ?? /* @__PURE__ */ new Set();
+      d.add(l), r.set(g, d), h2 += a + 4;
     }
-    let u = r ? r.unsupportedRecords ?? [] : this.book.unsupportedRecords ?? [], i = { headings: 42, gridLines: 43, horizontalCentered: 131, verticalCentered: 132 };
+    let u = n2 ? n2.unsupportedRecords ?? [] : this.book.unsupportedRecords ?? [], i = { headings: 42, gridLines: 43, horizontalCentered: 131, verticalCentered: 132 };
     for (let h2 of u) {
       if (this.charge(), this.exported.has(h2)) continue;
       if (h2.source === "biff" && h2.data && typeof h2.data == "object" && !Array.isArray(h2.data)) {
         let a = h2.data;
-        if (typeof a.opcode == "number" && typeof a.bytes == "string" && n2.get(a.opcode)?.has(a.bytes)) continue;
+        if (typeof a.opcode == "number" && typeof a.bytes == "string" && r.get(a.opcode)?.has(a.bytes)) continue;
       }
       if (["PrintInformation", "Styles", "Rows", "Cols"].includes(h2.kind)) continue;
-      let g = r ? this.records.get(r)?.find((a) => a.record === h2)?.node : void 0;
-      h2.kind === "printOptions" && g?.namespace === "http://schemas.openxmlformats.org/spreadsheetml/2006/main" && !g.text.trim() && !g.children.length && Object.entries(g.attributes).every(([a, l]) => Object.hasOwn(i, a) && ["0", "1", "false", "true"].includes(l) && n2.get(i[a])?.has(l === "1" || l === "true" ? "0100" : "0000")) || h2.kind === "Objects" && g?.children.every((a) => ["CellComment", "GnmCellComment"].includes(a.name)) || await this.context.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `Unsupported Excel BIFF export metadata: ${h2.kind}` });
+      let g = n2 ? this.records.get(n2)?.find((a) => a.record === h2)?.node : void 0;
+      h2.kind === "printOptions" && g?.namespace === "http://schemas.openxmlformats.org/spreadsheetml/2006/main" && !g.text.trim() && !g.children.length && Object.entries(g.attributes).every(([a, l]) => Object.hasOwn(i, a) && ["0", "1", "false", "true"].includes(l) && r.get(i[a])?.has(l === "1" || l === "true" ? "0100" : "0000")) || h2.kind === "Objects" && g?.children.every((a) => ["CellComment", "GnmCellComment"].includes(a.name)) || await this.context.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `Unsupported Excel BIFF export metadata: ${h2.kind}` });
     }
   }
   global(e) {
-    let r = this.book.sheets.filter((i) => this.comments.get(i).length);
-    if (!r.length) return;
-    let n2 = r.map((i) => this.comments.get(i).length + 1), t = r.length * 1024 + n2.at(-1), u = Ae(ve(t, r.length + 1, n2.reduce((i, h2) => i + h2, 0), r.length), ...n2.map((i, h2) => ve(h2 + 1, i)));
+    let n2 = this.book.sheets.filter((i) => this.comments.get(i).length);
+    if (!n2.length) return;
+    let r = n2.map((i) => this.comments.get(i).length + 1), t = n2.length * 1024 + r.at(-1), u = Ae(ve(t, n2.length + 1, r.reduce((i, h2) => i + h2, 0), n2.length), ...r.map((i, h2) => ve(h2 + 1, i)));
     e.record(235, Te(61440, 0, 15, Te(61446, 0, 0, u)));
   }
-  view(e, r, n2, t) {
-    fn(r, n2, e, (R2) => this.charge(R2));
-    let u = this.records.get(r).filter((R2) => R2.record.kind === "SheetLayout"), i = u[0]?.node, h2 = i?.children.find((R2) => R2.name === "FreezePanes"), g = (R2) => {
-      let B = pt(R2);
-      if (B.row >= this.maxRows || B.column >= 256) throw new ht("unsupported-feature", "Unsupported Excel BIFF sheet layout position");
-      return B;
+  async view(e, n2, r, t) {
+    ln(n2, r, e, (F) => this.charge(F));
+    let u = this.records.get(n2).filter((F) => F.record.kind === "SheetLayout"), i = u[0]?.node, h2 = i?.children.find((F) => F.name === "FreezePanes"), g = (F) => {
+      let p = wt(F);
+      if (p.row >= this.maxRows || p.column >= 256) throw new pt("unsupported-feature", "Unsupported Excel BIFF sheet layout position");
+      return p;
     }, a = g(i?.attributes.TopLeft ?? "A1"), l = h2 ? g(h2.attributes.FrozenTopLeft ?? "A1") : a, d = h2 ? g(h2.attributes.UnfrozenTopLeft ?? "A1") : l, m2 = d.column - l.column, f = d.row - l.row;
-    if (m2 < 0 || f < 0) throw new ht("unsupported-feature", "Unsupported Excel BIFF reversed frozen layout");
-    let o = !!(m2 || f), E = Math.round(Number(r.view?.zoom ?? 1) * 100), k = 182 | (t ? 1536 : 0) | (o ? 264 : 0), S = f ? l.row : a.row, A = m2 ? l.column : a.column;
-    e.record(574, n2 === 8 ? K2(k, S, A, 64, 0, 0, E, E, 0) : K2(k, S, A, 64, 0)), e.record(160, K2(E, 100)), o && e.record(65, K2(m2, f, a.row, a.column, m2 ? f ? 0 : 1 : 2)), u.length === 1 && i && !i.text && Object.keys(i.attributes).every((R2) => R2 === "TopLeft") && i.children.length <= 1 && i.children.every((R2) => R2 === h2 && !R2.text && !R2.children.length && Object.keys(R2.attributes).every((B) => B === "FrozenTopLeft" || B === "UnfrozenTopLeft")) && this.exported.add(u[0].record);
-  }
-  async sheet(e, r, n2) {
-    let t = this.records.get(r), u = t.find((o) => o.record.kind === "PrintInformation")?.node, i = (o) => u?.children.find((E) => E.name === o), h2 = (o) => Number(i(o)?.attributes.value ?? 0);
-    e.record(129, K2(1217 | (["fit", "size_fit"].includes(i("Scale")?.attributes.type ?? "") ? 256 : 0))), e.record(42, K2(h2("titles"))), e.record(43, K2(h2("grid"))), e.record(131, K2(h2("hcenter"))), e.record(132, K2(h2("vcenter")));
+    if (m2 < 0 || f < 0) throw new pt("unsupported-feature", "Unsupported Excel BIFF reversed frozen layout");
+    let o = !!(m2 || f), E = Math.round(Number(n2.view?.zoom ?? 1) * 100), k = Be(n2, "HideColHeader"), N = Be(n2, "HideRowHeader");
+    k !== N && (await this.context.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: "Excel BIFF combines row and column header visibility; both headers are shown" }), this.charge());
+    let A = 32 | (t ? 1536 : 0) | (o ? 264 : 0) | (Be(n2, "DisplayFormulas") ? 1 : 0) | (Be(n2, "HideGrid") ? 0 : 2) | (!k || !N ? 4 : 0) | (Be(n2, "HideZero") ? 0 : 16) | (Be(n2, "RTL_Layout") ? 64 : 0) | (Be(n2, "DisplayOutlines", true) ? 128 : 0), S = f ? l.row : a.row, B = m2 ? l.column : a.column;
+    e.record(574, r === 8 ? K2(A, S, B, 64, 0, 0, E, E, 0) : K2(A, S, B, 64, 0)), e.record(160, K2(E, 100)), o && e.record(65, K2(m2, f, a.row, a.column, m2 ? f ? 0 : 1 : 2)), u.length === 1 && i && !i.text && Object.keys(i.attributes).every((F) => F === "TopLeft") && i.children.length <= 1 && i.children.every((F) => F === h2 && !F.text && !F.children.length && Object.keys(F.attributes).every((p) => p === "FrozenTopLeft" || p === "UnfrozenTopLeft")) && this.exported.add(u[0].record);
+  }
+  async sheet(e, n2, r) {
+    let t = this.records.get(n2), u = t.find((o) => o.record.kind === "PrintInformation")?.node, i = (o) => u?.children.find((E) => E.name === o), h2 = (o) => Number(i(o)?.attributes.value ?? 0);
+    e.record(129, K2(1 | (Be(n2, "OutlineSymbolsBelow", true) ? 64 : 0) | (Be(n2, "OutlineSymbolsRight", true) ? 128 : 0) | (Be(n2, "DisplayOutlines", true) ? 1024 : 0) | (["fit", "size_fit"].includes(i("Scale")?.attributes.type ?? "") ? 256 : 0))), e.record(42, K2(h2("titles"))), e.record(43, K2(h2("grid"))), e.record(131, K2(h2("hcenter"))), e.record(132, K2(h2("vcenter")));
     for (let [o, E, k] of [["left", 38, 72], ["right", 39, 72], ["top", 40, 120], ["bottom", 41, 120]]) {
-      let S = new Uint8Array(8);
-      new DataView(S.buffer).setFloat64(0, Number(i("Margins")?.children.find((A) => A.name === o)?.attributes.Points ?? k) / 72, true), e.record(E, S);
+      let N = new Uint8Array(8);
+      new DataView(N.buffer).setFloat64(0, Number(i("Margins")?.children.find((A) => A.name === o)?.attributes.Points ?? k) / 72, true), e.record(E, N);
     }
     let g = new Uint8Array(34), a = new DataView(g.buffer), l = i("Scale")?.attributes;
     a.setUint16(0, { na_letter: 1, na_legal: 5, iso_a3: 8, iso_a4: 9, iso_a5: 11 }[i("paper")?.text ?? "iso_a4"] ?? 9, true), a.setUint16(2, Number(l?.percentage ?? 100), true), a.setUint16(4, 1, true), a.setUint16(6, Number(l?.cols ?? 1), true), a.setUint16(8, Number(l?.rows ?? 1), true);
     let d = i("comments")?.attributes.placement, m2 = Math.max(0, ["GNM_PRINT_ERRORS_AS_DISPLAYED", "GNM_PRINT_ERRORS_AS_BLANK", "GNM_PRINT_ERRORS_AS_DASHES", "GNM_PRINT_ERRORS_AS_NA"].indexOf(i("errors")?.attributes.PrintErrorsAs ?? "GNM_PRINT_ERRORS_AS_DISPLAYED"));
-    n2 === 7 && d === "GNM_PRINT_COMMENTS_AT_END" && await this.context.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: "Excel BIFF7 cannot print comments at the end; using in-place comments" }), n2 === 7 && m2 && await this.context.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: "Excel BIFF7 cannot change printed error values; using displayed errors" }), a.setUint16(10, (i("orientation")?.text === "landscape" ? 0 : 2) | (i("order")?.text === "r_then_d" ? 1 : 0) | (h2("monochrome") ? 8 : 0) | (h2("draft") ? 16 : 0) | (["GNM_PRINT_COMMENTS_IN_PLACE", "GNM_PRINT_COMMENTS_AT_END"].includes(d ?? "") ? 32 : 0) | (n2 === 8 ? (d === "GNM_PRINT_COMMENTS_AT_END" ? 512 : 0) | m2 << 10 : 0), true), a.setUint16(12, 600, true), a.setUint16(14, 600, true), a.setFloat64(16, Number(i("Margins")?.children.find((o) => o.name === "header")?.attributes.Points ?? 72) / 72, true), a.setFloat64(24, Number(i("Margins")?.children.find((o) => o.name === "footer")?.attributes.Points ?? 72) / 72, true), a.setUint16(32, 1, true), e.record(161, g);
+    r === 7 && d === "GNM_PRINT_COMMENTS_AT_END" && await this.context.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: "Excel BIFF7 cannot print comments at the end; using in-place comments" }), r === 7 && m2 && await this.context.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: "Excel BIFF7 cannot change printed error values; using displayed errors" }), a.setUint16(10, (i("orientation")?.text === "landscape" ? 0 : 2) | (i("order")?.text === "r_then_d" ? 1 : 0) | (h2("monochrome") ? 8 : 0) | (h2("draft") ? 16 : 0) | (["GNM_PRINT_COMMENTS_IN_PLACE", "GNM_PRINT_COMMENTS_AT_END"].includes(d ?? "") ? 32 : 0) | (r === 8 ? (d === "GNM_PRINT_COMMENTS_AT_END" ? 512 : 0) | m2 << 10 : 0), true), a.setUint16(12, 600, true), a.setUint16(14, 600, true), a.setFloat64(16, Number(i("Margins")?.children.find((o) => o.name === "header")?.attributes.Points ?? 72) / 72, true), a.setFloat64(24, Number(i("Margins")?.children.find((o) => o.name === "footer")?.attributes.Points ?? 72) / 72, true), a.setUint16(32, 1, true), e.record(161, g);
     let f = { PAGE: "P", PAGES: "N", DATE: "D", TIME: "T", FILE: "F", TAB: "A", PATH: "Z" };
     for (let [o, E, k] of [["Header", 20, "&A"], ["Footer", 21, "Page &P"]]) {
-      let S = i(o), A = S ? "" : k;
-      for (let [R2, B] of [["Left", "L"], ["Middle", "C"], ["Right", "R"]]) {
-        let N = S?.attributes[R2];
-        if (N) {
-          (R2 !== "Middle" || S?.attributes.Left || S?.attributes.Right) && (A += "&" + B);
-          for (let w2 = 0; w2 < N.length; w2++) {
-            if (N[w2] === "&" && N[w2 + 1] === "[") {
-              let D = N.indexOf("]", w2 + 2), x = f[N.slice(w2 + 2, D)];
+      let N = i(o), A = N ? "" : k;
+      for (let [S, B] of [["Left", "L"], ["Middle", "C"], ["Right", "R"]]) {
+        let F = N?.attributes[S];
+        if (F) {
+          (S !== "Middle" || N?.attributes.Left || N?.attributes.Right) && (A += "&" + B);
+          for (let p = 0; p < F.length; p++) {
+            if (F[p] === "&" && F[p + 1] === "[") {
+              let D = F.indexOf("]", p + 2), x = f[F.slice(p + 2, D)];
               if (D >= 0 && x) {
-                A += "&" + x, w2 = D;
+                A += "&" + x, p = D;
                 continue;
               }
             }
-            A += N[w2] === "&" ? "&&" : N[w2];
+            A += F[p] === "&" ? "&&" : F[p];
           }
         }
       }
-      e.record(E, ce(A, n2, this.context, n2 === 8 ? 2 : 1));
+      e.record(E, ce(A, r, this.context, r === 8 ? 2 : 1));
     }
     for (let [o, E] of [["hPageBreaks", 27], ["vPageBreaks", 26]]) {
-      let k = n2 === 8 ? 6 : 2, S = Math.floor((e.maximumRecord - 4) / k), A = (i(o)?.children.filter((R2) => R2.name === "break" && R2.attributes.type !== "auto") ?? []).slice(0, S);
-      A.length && e.record(E, K2(A.length, ...A.flatMap((R2) => n2 === 8 ? [Number(R2.attributes.pos), 0, o === "hPageBreaks" ? 256 : 65536] : [Number(R2.attributes.pos)])));
+      let k = r === 8 ? 6 : 2, N = Math.floor((e.maximumRecord - 4) / k), A = (i(o)?.children.filter((S) => S.name === "break" && S.attributes.type !== "auto") ?? []).slice(0, N);
+      A.length && e.record(E, K2(A.length, ...A.flatMap((S) => r === 8 ? [Number(S.attributes.pos), 0, o === "hPageBreaks" ? 256 : 65536] : [Number(S.attributes.pos)])));
     }
-    for (let o of r.rows ?? []) o.index < this.maxRows && e.record(520, K2(o.index, 0, 256, Math.round((o.sizePoints ?? 12.75) * 20), 0, 0, 320 | (o.hidden ? 32 : 0) | (o.collapsed ? 16 : 0) | (o.outlineLevel ?? 0), 15));
-    for (let o of r.columns ?? []) o.index < 256 && e.record(125, K2(o.index, o.index, Math.round(((o.sizePoints ?? 48) / 0.75 - 64) * 36.5 + 2340), 15, (o.hidden ? 1 : 0) | (o.collapsed ? 4096 : 0) | (o.outlineLevel ?? 0) << 8, 0));
-    n2 === 7 ? this.legacyComments(e, r) : this.drawComments(e, r);
+    for (let o of n2.rows ?? []) o.index < this.maxRows && e.record(520, K2(o.index, 0, 256, Math.round((o.sizePoints ?? 12.75) * 20), 0, 0, 320 | (o.hidden ? 32 : 0) | (o.collapsed ? 16 : 0) | (o.outlineLevel ?? 0), 15));
+    for (let o of n2.columns ?? []) o.index < 256 && e.record(125, K2(o.index, o.index, Math.round(((o.sizePoints ?? 48) / 0.75 - 64) * 36.5 + 2340), 15, (o.hidden ? 1 : 0) | (o.collapsed ? 4096 : 0) | (o.outlineLevel ?? 0) << 8, 0));
+    r === 7 ? this.legacyComments(e, n2) : this.drawComments(e, n2);
   }
-  async links(e, r, n2) {
-    if (n2 === 8) for (let t of r.cells) {
+  async links(e, n2, r) {
+    if (r === 8) for (let t of n2.cells) {
       if (t.row >= this.maxRows || t.column >= 256) continue;
-      let u = pn(t.style?.gnumeric, (m2) => this.charge(m2)), i = u?.children.find((m2) => m2.name === "HyperLink");
+      let u = wn(t.style?.gnumeric, (m2) => this.charge(m2)), i = u?.children.find((m2) => m2.name === "HyperLink");
       if (!i) continue;
       let h2 = ce(i.attributes.target ?? "", 8, this.context).subarray(3), g = new Uint8Array(2), a = K2(t.row, t.row, t.column, t.column), l = new Uint8Array([208, 201, 234, 121, 249, 186, 206, 17, 140, 130, 0, 170, 0, 75, 169, 11]), d = i.attributes.type;
       if (d === "GnmHLinkCurWB") e.record(440, Ae(a, l, ve(2, 8, h2.length / 2 + 1), h2, g));
@@ -1812,21 +1818,21 @@ var wt = class {
       i.attributes.tip !== void 0 && e.record(2048, Ae(K2(2048), a, ce(i.attributes.tip, 8, this.context).subarray(3), g));
     }
   }
-  legacyComments(e, r) {
-    for (let n2 of this.comments.get(r)) {
+  legacyComments(e, n2) {
+    for (let r of this.comments.get(n2)) {
       this.charge();
-      let t = pt(n2.attributes.ObjectBound?.split(":")[0] ?? "A1");
+      let t = wt(r.attributes.ObjectBound?.split(":")[0] ?? "A1");
       if (!t || t.row >= this.maxRows || t.column >= 256) continue;
-      let u = ce(n2.attributes.Text ?? "", 7, this.context).subarray(2);
+      let u = ce(r.attributes.Text ?? "", 7, this.context).subarray(2);
       for (let i = 0; i < u.length; i += 2048) e.record(28, Ae(K2(i ? 65535 : t.row, i ? 0 : t.column, i ? Math.min(2048, u.length - i) : u.length), u.subarray(i, i + 2048)));
     }
   }
-  drawComments(e, r) {
-    let n2 = this.comments.get(r);
-    if (!n2.length) return;
-    let t = this.book.sheets.filter((d) => this.comments.get(d).length).indexOf(r) + 1, u = t * 1024, i = n2.map((d, m2) => {
-      let f = pt(d.attributes.ObjectBound?.split(":")[0] ?? "A1");
-      if (!f) throw new ht("unsupported-feature", "Invalid Excel comment anchor");
+  drawComments(e, n2) {
+    let r = this.comments.get(n2);
+    if (!r.length) return;
+    let t = this.book.sheets.filter((d) => this.comments.get(d).length).indexOf(n2) + 1, u = t * 1024, i = r.map((d, m2) => {
+      let f = wt(d.attributes.ObjectBound?.split(":")[0] ?? "A1");
+      if (!f) throw new pt("unsupported-feature", "Invalid Excel comment anchor");
       let o = K2(0, Math.min(f.column + 1, 255), 512, Math.max(0, f.row - 1), 128, Math.min(f.column + 3, 255), 512, Math.min(f.row + 3, this.maxRows - 1), 128), E = Ae(Te(61450, 202, 2, ve(u + m2 + 1, 2560)), Te(61456, 0, 0, o), Te(61457, 0, 0, new Uint8Array())), k = Te(61444, 0, 15, E);
       return new DataView(k.buffer).setUint32(4, E.length + 8, true), { comment: d, pos: f, shape: k };
     }), h2 = Te(61444, 0, 15, Ae(Te(61449, 0, 1, new Uint8Array(16)), Te(61450, 0, 2, ve(u, 5)))), g = i.reduce((d, m2) => d + m2.shape.length + 8, 0), a = Te(61448, t, 0, ve(i.length + 1, u + i.length)), l = Ae(K2(15, 61442), ve(a.length + 8 + h2.length + g), a, K2(15, 61443), ve(h2.length + g), h2);
@@ -1836,199 +1842,199 @@ var wt = class {
       E.set(K2(21, 18, 25, o + 1, 16401));
       let k = new Uint8Array(26);
       k.set(K2(13, 22)), e.record(93, Ae(E, k, K2(0, 0))), e.record(236, Te(61453, 0, 0, new Uint8Array()));
-      let S = ce(d.attributes.Text || " ", 8, this.context), A = new Uint8Array(18);
-      A.set(K2(530)), new DataView(A.buffer).setUint16(10, (S.length - 3) / 2, true), new DataView(A.buffer).setUint16(12, 16, true), e.record(438, A);
-      for (let B = 3; B < S.length; B += 8222) e.record(60, Ae(new Uint8Array([1]), S.subarray(B, B + 8222)));
-      let R2 = new Uint8Array(16);
-      new DataView(R2.buffer).setUint16(8, (S.length - 3) / 2, true), e.record(60, R2), e.record(28, Ae(K2(m2.row, m2.column, 0, o + 1), ce(d.attributes.Author ?? "", 8, this.context), new Uint8Array([0])));
+      let N = ce(d.attributes.Text || " ", 8, this.context), A = new Uint8Array(18);
+      A.set(K2(530)), new DataView(A.buffer).setUint16(10, (N.length - 3) / 2, true), new DataView(A.buffer).setUint16(12, 16, true), e.record(438, A);
+      for (let B = 3; B < N.length; B += 8222) e.record(60, Ae(new Uint8Array([1]), N.subarray(B, B + 8222)));
+      let S = new Uint8Array(16);
+      new DataView(S.buffer).setUint16(8, (N.length - 3) / 2, true), e.record(60, S), e.record(28, Ae(K2(m2.row, m2.column, 0, o + 1), ce(d.attributes.Author ?? "", 8, this.context), new Uint8Array([0])));
     });
   }
 };
-function ce(s, e, r, n2 = 2) {
-  let t = Jn["windows-1252"];
-  if (r.signal.throwIfAborted(), s.length > r.limits.outputBytes) throw new Ie("resource-limit", "ssconvert BIFF string bytes limit exceeded");
-  let u = e === 8 ? Zn(s, "UTF-16LE", false, r) : new Uint8Array(Array.from(s, (a) => {
+function ce(s, e, n2, r = 2) {
+  let t = er["windows-1252"];
+  if (n2.signal.throwIfAborted(), s.length > n2.limits.outputBytes) throw new Ie("resource-limit", "ssconvert BIFF string bytes limit exceeded");
+  let u = e === 8 ? Jn(s, "UTF-16LE", false, n2) : new Uint8Array(Array.from(s, (a) => {
     let l = t.indexOf(a);
     return l < 0 ? 63 : l;
   })), i = e === 8 ? u.length / 2 : u.length;
-  if (i > (n2 === 1 ? 255 : 65535)) throw new Ie("unsupported-feature", "Excel BIFF string is too long");
-  let h2 = new Uint8Array(n2 + (e === 8 ? 1 : 0) + u.length), g = new DataView(h2.buffer);
-  return n2 === 1 ? h2[0] = i : g.setUint16(0, i, true), e === 8 && (h2[n2] = 1), h2.set(u, n2 + (e === 8 ? 1 : 0)), h2;
+  if (i > (r === 1 ? 255 : 65535)) throw new Ie("unsupported-feature", "Excel BIFF string is too long");
+  let h2 = new Uint8Array(r + (e === 8 ? 1 : 0) + u.length), g = new DataView(h2.buffer);
+  return r === 1 ? h2[0] = i : g.setUint16(0, i, true), e === 8 && (h2[r] = 1), h2.set(u, r + (e === 8 ? 1 : 0)), h2;
 }
-function Ye(s) {
-  return Number(Object.entries(Be).find(([, e]) => e === s)?.[0] ?? 15);
+function qe(s) {
+  return Number(Object.entries(Ce).find(([, e]) => e === s)?.[0] ?? 15);
 }
-function wn(s, e) {
+function gn(s, e) {
   return s === 8 ? K2(1536, e, 7093, 1997, 193, 0, 6, 0) : K2(1280, e, 2412, 1993);
 }
 function ye(s, e) {
-  let r = new Uint8Array(s.length + e.length);
-  return r.set(s), r.set(e, s.length), r;
+  let n2 = new Uint8Array(s.length + e.length);
+  return n2.set(s), n2.set(e, s.length), n2;
 }
-function er(s, e, r) {
-  let n2 = new Uint8Array(8224), t = 8, u = 252, i = new DataView(n2.buffer);
+function tr(s, e, n2) {
+  let r = new Uint8Array(8224), t = 8, u = 252, i = new DataView(r.buffer);
   i.setUint32(0, e.length, true), i.setUint32(4, e.length, true);
   let h2 = () => {
-    s.record(u, n2.subarray(0, t)), u = 60, n2 = new Uint8Array(8224), t = 0;
+    s.record(u, r.subarray(0, t)), u = 60, r = new Uint8Array(8224), t = 0;
   };
   for (let g of e) {
-    r.signal.throwIfAborted();
-    let a = ce(g, 8, r);
-    8224 - t < 5 && h2(), n2.set(a.subarray(0, 3), t), t += 3;
+    n2.signal.throwIfAborted();
+    let a = ce(g, 8, n2);
+    8224 - t < 5 && h2(), r.set(a.subarray(0, 3), t), t += 3;
     for (let l = 3; l < a.length; ) {
-      8224 - t < 2 && (h2(), n2[t++] = 1);
+      8224 - t < 2 && (h2(), r[t++] = 1);
       let d = Math.min(a.length - l, Math.floor((8224 - t) / 2) * 2);
-      n2.set(a.subarray(l, l + d), t), t += d, l += d;
+      r.set(a.subarray(l, l + d), t), t += d, l += d;
     }
   }
-  s.record(u, n2.subarray(0, t));
+  s.record(u, r.subarray(0, t));
 }
-function tr(s, e, r, n2) {
-  let t = ce(e, r, n2), u = 0;
+function nr(s, e, n2, r) {
+  let t = ce(e, n2, r), u = 0;
   for (; u < t.length; ) {
-    let i = u && r === 8 ? 1 : 0, h2 = !u && r === 8 ? 3 : 0, g = s.maximumRecord - i - h2, a = Math.min(t.length - u, h2 + (r === 8 ? Math.floor(g / 2) * 2 : g)), l = new Uint8Array(i + a);
+    let i = u && n2 === 8 ? 1 : 0, h2 = !u && n2 === 8 ? 3 : 0, g = s.maximumRecord - i - h2, a = Math.min(t.length - u, h2 + (n2 === 8 ? Math.floor(g / 2) * 2 : g)), l = new Uint8Array(i + a);
     i && (l[0] = 1), l.set(t.subarray(u, u + a), i), s.record(u ? 60 : 519, l), u += a;
   }
 }
-async function Bt(s, e, r, n2, t) {
-  if (n2.signal.throwIfAborted(), e !== 8 && s.automaticLabelLookup) throw new Ie("unsupported-feature", "Excel BIFF7 cannot enable automatic label lookup");
-  if (s.sheets.length > n2.limits.sheets) throw new Ie("resource-limit", "ssconvert BIFF sheets limit exceeded");
+async function Ct(s, e, n2, r, t) {
+  if (r.signal.throwIfAborted(), e !== 8 && s.automaticLabelLookup) throw new Ie("unsupported-feature", "Excel BIFF7 cannot enable automatic label lookup");
+  if (s.sheets.length > r.limits.sheets) throw new Ie("resource-limit", "ssconvert BIFF sheets limit exceeded");
   let u = 0;
-  for (let b of s.sheets) if (n2.signal.throwIfAborted(), u += b.cells.length, u > n2.limits.cells) throw new Ie("resource-limit", "ssconvert BIFF cells limit exceeded");
-  let i = new ut(n2, e === 8 ? 8224 : 2080), h2 = s.sheets.find((b) => b.id === s.activeSheet || b.name === s.activeSheet) ?? s.sheets[0], g = e === 7 || r ? 16384 : 65536, a = new wt(s, n2, g);
+  for (let b of s.sheets) if (r.signal.throwIfAborted(), u += b.cells.length, u > r.limits.cells) throw new Ie("resource-limit", "ssconvert BIFF cells limit exceeded");
+  let i = new dt(r, e === 8 ? 8224 : 2080), h2 = s.sheets.find((b) => b.id === s.activeSheet || b.name === s.activeSheet) ?? s.sheets[0], g = e === 7 || n2 ? 16384 : 65536, a = new gt(s, r, g);
   await a.prepare();
-  let l = [], d = /* @__PURE__ */ new Map(), m2 = new mt(n2), f = /* @__PURE__ */ new Map(), o = new dt(s, e, n2), E = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map(), A = (s.names ?? []).map((b) => ({ name: b, formula: o.compile(b.expression, b.position?.sheet ?? b.sheet ?? s.sheets[0].id, b.position?.row ?? 0, b.position?.column ?? 0, b) }));
-  for (let { formula: b } of A) for (let O of b.diagnostics) await n2.diagnostic?.(O);
-  let R2 = false;
+  let l = [], d = /* @__PURE__ */ new Map(), m2 = new ht(r), f = /* @__PURE__ */ new Map(), o = new mt(s, e, r), E = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), A = (s.names ?? []).map((b) => ({ name: b, formula: o.compile(b.expression, b.position?.sheet ?? b.sheet ?? s.sheets[0].id, b.position?.row ?? 0, b.position?.column ?? 0, b) }));
+  for (let { formula: b } of A) for (let O of b.diagnostics) await r.diagnostic?.(O);
+  let S = false;
   for (let b of s.sheets) {
     for (let v of b.formulaGroups ?? []) if (v.kind === "array" && v.range.startRow < g && v.range.startColumn < 256) {
-      let F = sn(v, b.id, s, n2, g);
-      if (F) {
-        S.set(v, F);
+      let R2 = on(v, b.id, s, r, g);
+      if (R2) {
+        N.set(v, R2);
         continue;
       }
       let M = o.compile(v.expression, b.id, v.range.startRow, v.range.startColumn, void 0, v.arrayStringLiterals);
       k.set(v, M);
-      for (let _ of M.diagnostics) await n2.diagnostic?.(_);
+      for (let _ of M.diagnostics) await r.diagnostic?.(_);
     }
     let O = 0, C2 = 0;
     for (let v of b.cells) O = Math.max(O, v.column), C2 = Math.max(C2, v.row);
-    for (let [v, F, M] of [["columns", 256, O], ["rows", g, C2]]) M >= F && !(r && e === 8) && !R2 && (R2 = true, await n2.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `W Some content will be lost when saving.  This format only supports ${F} ${v}, and this workbook has ${M}` }));
+    for (let [v, R2, M] of [["columns", 256, O], ["rows", g, C2]]) M >= R2 && !(n2 && e === 8) && !S && (S = true, await r.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `W Some content will be lost when saving.  This format only supports ${R2} ${v}, and this workbook has ${M}` }));
     for (let v of b.cells) {
-      if (n2.signal.throwIfAborted(), v.row >= g || v.column >= 256) continue;
+      if (r.signal.throwIfAborted(), v.row >= g || v.column >= 256) continue;
       v.value.kind === "string" && !v.formula && !d.has(v.value.value) && (d.set(v.value.value, l.length), l.push(v.value.value)), f.set(v, m2.register(v));
-      let F = b.formulaGroups?.find((M) => M.id === v.formulaGroup && M.kind === "array");
-      if (F) E.set(v, { tokens: new Uint8Array([S.has(F) ? 2 : 1, ...K2(F.range.startRow, F.range.startColumn)]), tokenBoundaries: [5], arrays: new Uint8Array(), arrayBoundaries: [], arrayStrings: [], diagnostics: [], nameDependencies: [] });
+      let R2 = b.formulaGroups?.find((M) => M.id === v.formulaGroup && M.kind === "array");
+      if (R2) E.set(v, { tokens: new Uint8Array([N.has(R2) ? 2 : 1, ...K2(R2.range.startRow, R2.range.startColumn)]), tokenBoundaries: [5], arrays: new Uint8Array(), arrayBoundaries: [], arrayStrings: [], diagnostics: [], nameDependencies: [] });
       else if (v.formula) {
         let M = o.compile(v.formula, b.id, v.row, v.column, void 0, v.arrayStringLiterals);
         E.set(v, M);
-        for (let _ of M.diagnostics) await n2.diagnostic?.(_);
+        for (let _ of M.diagnostics) await r.diagnostic?.(_);
       }
     }
   }
   let B = o.finalize(A.map((b) => b.formula));
-  i.record(2057, wn(e, 5)), t && i.record(47, t), i.record(225, e === 8 ? K2(1200) : new Uint8Array()), i.record(193, K2(0)), i.record(226), i.record(66, K2(e === 8 ? 1200 : 1252)), e === 8 && s.automaticLabelLookup && i.record(352, K2(1)), e === 8 && (i.record(353, K2(r ? 1 : 0)), i.record(448), i.record(317, K2(...s.sheets.map((b, O) => O + 1)))), i.record(156, K2(14)), i.record(25, K2(0)), i.record(18, K2(0)), i.record(19, K2(0)), i.record(61, K2(0, 0, 16335, 10830, 56, Math.max(0, s.sheets.findIndex((b) => b.id === s.activeSheet)), 0, 1, 600)), i.record(64, K2(0)), i.record(141, K2(0)), i.record(34, K2(s.dateSystem === "1904" ? 1 : 0)), i.record(14, K2(1)), i.record(439, K2(0)), i.record(218, K2(0)), m2.serialize(i, e);
-  for (let b of m2.diagnostics) await n2.diagnostic?.(b);
-  let N = [];
+  i.record(2057, gn(e, 5)), t && i.record(47, t), i.record(225, e === 8 ? K2(1200) : new Uint8Array()), i.record(193, K2(0)), i.record(226), i.record(66, K2(e === 8 ? 1200 : 1252)), e === 8 && s.automaticLabelLookup && i.record(352, K2(1)), e === 8 && (i.record(353, K2(n2 ? 1 : 0)), i.record(448), i.record(317, K2(...s.sheets.map((b, O) => O + 1)))), i.record(156, K2(14)), i.record(25, K2(0)), i.record(18, K2(0)), i.record(19, K2(0)), i.record(61, K2(0, 0, 16335, 10830, 56, Math.max(0, s.sheets.findIndex((b) => b.id === s.activeSheet)), 0, 1, 600)), i.record(64, K2(0)), i.record(141, K2(0)), i.record(34, K2(s.dateSystem === "1904" ? 1 : 0)), i.record(14, K2(1)), i.record(439, K2(0)), i.record(218, K2(0)), m2.serialize(i, e);
+  for (let b of m2.diagnostics) await r.diagnostic?.(b);
+  let F = [];
   for (let b of s.sheets) {
-    let O = ce(b.name.slice(0, 31), e, n2, 1), C2 = new Uint8Array(6 + O.length);
-    C2[4] = b.visibility === "hidden" ? 1 : b.visibility === "very-hidden" ? 2 : 0, C2.set(O, 6), N.push(i.record(133, C2));
+    let O = ce(b.name.slice(0, 31), e, r, 1), C2 = new Uint8Array(6 + O.length);
+    C2[4] = b.visibility === "hidden" ? 1 : b.visibility === "very-hidden" ? 2 : 0, C2.set(O, 6), F.push(i.record(133, C2));
   }
-  if (e === 7 && gn(i, o, n2), e === 8) {
+  if (e === 7 && xn(i, o, r), e === 8) {
     i.record(140, K2(1, 1));
     let b = o.externNames.length > 0;
     if (o.externalBooks.length + Number(b) > 65535) throw new Ie("unsupported-feature", "Excel BIFF external workbook index exceeds version limits");
     if (b) {
       i.record(430, new Uint8Array([1, 0, 1, 58]));
-      for (let O of o.externNames) i.record(35, ye(ye(new Uint8Array(6), ce(O, e, n2, 1)), new Uint8Array([2, 0, 28, 23])));
+      for (let O of o.externNames) i.record(35, ye(ye(new Uint8Array(6), ce(O, e, r, 1)), new Uint8Array([2, 0, 28, 23])));
     }
     i.record(430, K2(s.sheets.length, 1025));
     for (let O of o.externalBooks) {
-      let C2 = ye(K2(O.sheets.length), ce(tn(O.workbook), e, n2));
+      let C2 = ye(K2(O.sheets.length), ce(nn(O.workbook), e, r));
       for (let v of O.sheets) {
-        let F = ce(v, e, n2);
-        if (C2.length + F.length > i.maximumRecord) throw new Ie("unsupported-feature", "Excel BIFF external workbook record is too large");
-        if (C2.length + F.length + 4 > n2.limits.outputBytes - i.length) throw new Ie("resource-limit", "ssconvert BIFF output bytes limit exceeded");
-        C2 = ye(C2, F);
+        let R2 = ce(v, e, r);
+        if (C2.length + R2.length > i.maximumRecord) throw new Ie("unsupported-feature", "Excel BIFF external workbook record is too large");
+        if (C2.length + R2.length + 4 > r.limits.outputBytes - i.length) throw new Ie("resource-limit", "ssconvert BIFF output bytes limit exceeded");
+        C2 = ye(C2, R2);
       }
       i.record(430, C2);
-      for (let v of O.names) i.record(35, ye(ye(K2(0, v.sheet === void 0 ? 0 : v.sheet + 1, 0), ce(v.name, e, n2, 1)), new Uint8Array([2, 0, 28, 23])));
+      for (let v of O.names) i.record(35, ye(ye(K2(0, v.sheet === void 0 ? 0 : v.sheet + 1, 0), ce(v.name, e, r, 1)), new Uint8Array([2, 0, 28, 23])));
     }
     i.record(23, K2(o.externalSheets.length + Number(b), ...b ? [0, 65534, 65534] : [], ...o.externalSheets.flatMap((O) => [Number(b) + (O.book === void 0 ? 0 : O.book + 1), O.first, O.last])));
   }
   for (let b of B) {
     let O = A[b];
     if (!O) {
-      let I = ce(o.macroNames[b - A.length], e, n2, 1), L2 = new Uint8Array(14);
+      let I = ce(o.macroNames[b - A.length], e, r, 1), L2 = new Uint8Array(14);
       L2[0] = 14, L2[3] = I[0], i.record(24, ye(L2, I.subarray(1)));
       continue;
     }
-    let { name: C2, formula: v } = O, F = ce(C2.name, e, n2, 1), M = new Uint8Array(14), _ = new DataView(M.buffer);
-    M[3] = F[0], _.setUint16(4, v.tokens.length, true);
-    let p = C2.sheet === void 0 ? 0 : s.sheets.findIndex((I) => I.id === C2.sheet) + 1;
-    e === 7 && p && _.setUint16(6, p - 1, true), _.setUint16(8, p, true);
-    let c = M.length + F.length - 1;
-    i.continuedRecord(24, ye(ye(M, F.subarray(1)), ye(v.tokens, v.arrays)), [c, ...v.tokenBoundaries.map((I) => I + c), ...v.arrayBoundaries.map((I) => I + c + v.tokens.length)], v.arrayStrings.map((I) => ({ start: c + v.tokens.length + I.start, end: c + v.tokens.length + I.end })));
+    let { name: C2, formula: v } = O, R2 = ce(C2.name, e, r, 1), M = new Uint8Array(14), _ = new DataView(M.buffer);
+    M[3] = R2[0], _.setUint16(4, v.tokens.length, true);
+    let w2 = C2.sheet === void 0 ? 0 : s.sheets.findIndex((I) => I.id === C2.sheet) + 1;
+    e === 7 && w2 && _.setUint16(6, w2 - 1, true), _.setUint16(8, w2, true);
+    let c = M.length + R2.length - 1;
+    i.continuedRecord(24, ye(ye(M, R2.subarray(1)), ye(v.tokens, v.arrays)), [c, ...v.tokenBoundaries.map((I) => I + c), ...v.arrayBoundaries.map((I) => I + c + v.tokens.length)], v.arrayStrings.map((I) => ({ start: c + v.tokens.length + I.start, end: c + v.tokens.length + I.end })));
   }
-  e === 8 && (a.global(i), er(i, l, n2)), i.record(10);
-  let w2 = [];
+  e === 8 && (a.global(i), tr(i, l, r)), i.record(10);
+  let p = [];
   for (let b of s.sheets) {
-    w2.push(i.length), i.record(2057, wn(e, 16)), i.record(13, K2(s.calculationMode === "manual" ? 0 : 1)), i.record(12, K2(s.iteration?.maximum ?? 100)), i.record(15, K2(1)), i.record(17, K2(s.iteration?.enabled ? 1 : 0));
+    p.push(i.length), i.record(2057, gn(e, 16)), i.record(13, K2(s.calculationMode === "manual" ? 0 : 1)), i.record(12, K2(s.iteration?.maximum ?? 100)), i.record(15, K2(1)), i.record(17, K2(s.iteration?.enabled ? 1 : 0));
     let O = new Uint8Array(8);
-    new DataView(O.buffer).setFloat64(0, s.iteration?.tolerance ?? 1e-3, true), i.record(16, O), e === 7 && gn(i, o, n2), i.record(95, K2(1)), i.record(130, K2(1)), i.record(128, K2(0, 0, 0, 0)), i.record(549, K2(0, 255));
-    let C2 = b.cells.filter((p) => p.row < g && p.column < 256).sort((p, c) => p.row - c.row || p.column - c.column), v = 0, F = 0;
-    for (let p of C2) v = Math.max(v, p.row + 1), F = Math.max(F, p.column + 1);
+    new DataView(O.buffer).setFloat64(0, s.iteration?.tolerance ?? 1e-3, true), i.record(16, O), e === 7 && xn(i, o, r), i.record(95, K2(1)), i.record(130, K2(1)), i.record(128, K2(0, 0, 0, 0)), i.record(549, K2(0, 255));
+    let C2 = b.cells.filter((w2) => w2.row < g && w2.column < 256).sort((w2, c) => w2.row - c.row || w2.column - c.column), v = 0, R2 = 0;
+    for (let w2 of C2) v = Math.max(v, w2.row + 1), R2 = Math.max(R2, w2.column + 1);
     let M = new Uint8Array(e === 8 ? 14 : 10), _ = new DataView(M.buffer);
-    e === 8 ? (_.setUint32(4, v, true), _.setUint16(10, F, true)) : (_.setUint16(2, v, true), _.setUint16(6, F, true)), i.record(512, M), await a.sheet(i, b, e);
-    for (let p of C2) {
-      await nr(i, p, f.get(p) ?? 15, e, d, n2, E.get(p));
-      let c = b.formulaGroups?.find((L2) => L2.id === p.formulaGroup && L2.kind === "array");
-      if (c && p.row === c.range.startRow && p.column === c.range.startColumn) {
-        let L2 = S.get(c);
+    e === 8 ? (_.setUint32(4, v, true), _.setUint16(10, R2, true)) : (_.setUint16(2, v, true), _.setUint16(6, R2, true)), i.record(512, M), await a.sheet(i, b, e);
+    for (let w2 of C2) {
+      await rr(i, w2, f.get(w2) ?? 15, e, d, r, E.get(w2));
+      let c = b.formulaGroups?.find((L2) => L2.id === w2.formulaGroup && L2.kind === "array");
+      if (c && w2.row === c.range.startRow && w2.column === c.range.startColumn) {
+        let L2 = N.get(c);
         if (L2) i.record(566, L2);
         else {
           let X2 = k.get(c), z = new Uint8Array(14 + X2.tokens.length + X2.arrays.length), W = new DataView(z.buffer);
           W.setUint16(0, c.range.startRow, true), W.setUint16(2, Math.min(c.range.endRow, g - 1), true), z[4] = c.range.startColumn, z[5] = Math.min(c.range.endColumn, 255), W.setUint16(12, X2.tokens.length, true), z.set(X2.tokens, 14), z.set(X2.arrays, 14 + X2.tokens.length), i.continuedRecord(545, z, [14, ...X2.tokenBoundaries.map((q) => q + 14), ...X2.arrayBoundaries.map((q) => q + 14 + X2.tokens.length)], X2.arrayStrings.map((q) => ({ start: 14 + X2.tokens.length + q.start, end: 14 + X2.tokens.length + q.end })));
         }
       }
-      let I = p.cachedResult ?? p.value;
-      E.has(p) && I.kind === "string" && tr(i, I.value, e, n2);
+      let I = w2.cachedResult ?? w2.value;
+      E.has(w2) && I.kind === "string" && nr(i, I.value, e, r);
     }
-    if (await a.links(i, b, e), a.view(i, b, e, b === h2), b.merges?.length) {
-      let p = b.merges.filter((I) => I.startRow < g && I.startColumn < 256), c = Math.floor((i.maximumRecord - 2) / 8);
-      for (let I = 0; I < p.length; I += c) {
-        let L2 = p.slice(I, I + c);
+    if (await a.links(i, b, e), await a.view(i, b, e, b === h2), b.merges?.length) {
+      let w2 = b.merges.filter((I) => I.startRow < g && I.startColumn < 256), c = Math.floor((i.maximumRecord - 2) / 8);
+      for (let I = 0; I < w2.length; I += c) {
+        let L2 = w2.slice(I, I + c);
         i.record(229, K2(L2.length, ...L2.flatMap((X2) => [X2.startRow, Math.min(X2.endRow, g - 1), X2.startColumn, Math.min(X2.endColumn, 255)])));
       }
     }
     i.record(10);
   }
   let D = i.finish(), x = new DataView(D.buffer);
-  N.forEach((b, O) => x.setUint32(b + 4, w2[O], true)), await a.loss(D.subarray(0, w2[0]));
-  for (let b = 0; b < s.sheets.length; b++) await a.loss(D.subarray(w2[b], w2[b + 1]), s.sheets[b]);
+  F.forEach((b, O) => x.setUint32(b + 4, p[O], true)), await a.loss(D.subarray(0, p[0]));
+  for (let b = 0; b < s.sheets.length; b++) await a.loss(D.subarray(p[b], p[b + 1]), s.sheets[b]);
   return D;
 }
-function gn(s, e, r) {
-  let { book: n2, externNames: t, externalBooks: u } = e;
-  s.record(22, K2(n2.sheets.length + 2 + u.reduce((a, l) => a + l.sheets.length + 1, 0)));
-  for (let a of n2.sheets) {
-    let l = ce(a.name, 7, r, 1);
+function xn(s, e, n2) {
+  let { book: r, externNames: t, externalBooks: u } = e;
+  s.record(22, K2(r.sheets.length + 2 + u.reduce((a, l) => a + l.sheets.length + 1, 0)));
+  for (let a of r.sheets) {
+    let l = ce(a.name, 7, n2, 1);
     s.record(23, new Uint8Array([l[0], 3, ...l.subarray(1)]));
   }
   s.record(23, new Uint8Array([1, 58]));
-  for (let a of t) s.record(35, ye(ye(new Uint8Array(6), ce(a, 7, r, 1)), new Uint8Array([2, 0, 28, 23])));
+  for (let a of t) s.record(35, ye(ye(new Uint8Array(6), ce(a, 7, n2, 1)), new Uint8Array([2, 0, 28, 23])));
   s.record(23, new Uint8Array([1, 4]));
   let i = (a) => {
-    let l = ce(a, 7, r, 1);
+    let l = ce(a, 7, n2, 1);
     if (m(l.subarray(1), 1252) !== a) throw new Ie("unsupported-feature", "Excel BIFF7 external identity is not representable in Windows-1252");
     return l;
   }, h2 = (a, l) => {
-    if (!a || Array.from(a + (l ?? "")).some((S) => S.charCodeAt(0) < 32 || "[]".includes(S))) throw new Ie("unsupported-feature", "Excel BIFF7 external path is not representable");
+    if (!a || Array.from(a + (l ?? "")).some((N) => N.charCodeAt(0) < 32 || "[]".includes(N))) throw new Ie("unsupported-feature", "Excel BIFF7 external path is not representable");
     let d = Math.max(a.lastIndexOf("/"), a.lastIndexOf("\\")) + 1, m2 = l === void 0 ? a : a.slice(0, d), f = l === void 0 ? "" : "[" + a.slice(d) + "]" + l, o = 1 + m2.length + f.length + (m2 ? 2 : 0);
     if (o > 255) throw new Ie("unsupported-feature", "Excel BIFF7 external path is too long");
     let E = i(m2), k = i(f);
     return new Uint8Array([o, 1, ...m2 ? [5, E[0], ...E.subarray(1)] : [], ...k.subarray(1)]);
-  }, g = n2.sheets.length + 2;
+  }, g = r.sheets.length + 2;
   for (let a of u) {
     for (let l of a.sheets) s.record(23, h2(a.workbook, l));
     s.record(23, h2(a.workbook));
@@ -2036,19 +2042,19 @@ function gn(s, e, r) {
     g += a.sheets.length + 1;
   }
 }
-async function nr(s, e, r, n2, t, u, i) {
-  let h2 = K2(e.row, e.column, r), g = e.value;
+async function rr(s, e, n2, r, t, u, i) {
+  let h2 = K2(e.row, e.column, n2), g = e.value;
   if (i) {
     let a = new Uint8Array(22 + i.tokens.length + i.arrays.length), l = new DataView(a.buffer);
     a.set(h2);
     let d = e.cachedResult ?? e.value;
-    d.kind === "number" ? l.setFloat64(6, d.value, true) : (a[6] = d.kind === "string" ? 0 : d.kind === "boolean" ? 1 : d.kind === "error" ? 2 : 3, a[8] = d.kind === "boolean" ? Number(d.value) : d.kind === "error" ? Ye(d.value) : 0, a[12] = 255, a[13] = 255), l.setUint16(14, e.formulaDirty ? 3 : 0, true), l.setUint16(20, i.tokens.length, true), a.set(i.tokens, 22), a.set(i.arrays, 22 + i.tokens.length), s.continuedRecord(6, a, [22, ...i.tokenBoundaries.map((m2) => m2 + 22), ...i.arrayBoundaries.map((m2) => m2 + 22 + i.tokens.length)], i.arrayStrings.map((m2) => ({ start: 22 + i.tokens.length + m2.start, end: 22 + i.tokens.length + m2.end })));
+    d.kind === "number" ? l.setFloat64(6, d.value, true) : (a[6] = d.kind === "string" ? 0 : d.kind === "boolean" ? 1 : d.kind === "error" ? 2 : 3, a[8] = d.kind === "boolean" ? Number(d.value) : d.kind === "error" ? qe(d.value) : 0, a[12] = 255, a[13] = 255), l.setUint16(14, e.formulaDirty ? 3 : 0, true), l.setUint16(20, i.tokens.length, true), a.set(i.tokens, 22), a.set(i.arrays, 22 + i.tokens.length), s.continuedRecord(6, a, [22, ...i.tokenBoundaries.map((m2) => m2 + 22), ...i.arrayBoundaries.map((m2) => m2 + 22 + i.tokens.length)], i.arrayStrings.map((m2) => ({ start: 22 + i.tokens.length + m2.start, end: 22 + i.tokens.length + m2.end })));
     return;
   }
   if (g.kind === "number") {
     let a = new Uint8Array(14);
     a.set(h2), new DataView(a.buffer).setFloat64(6, g.value, true), s.record(515, a);
-  } else if (g.kind === "string") if (n2 === 8) {
+  } else if (g.kind === "string") if (r === 8) {
     let a = new Uint8Array(10);
     a.set(h2), new DataView(a.buffer).setUint32(6, t.get(g.value), true), s.record(253, a);
   } else {
@@ -2058,26 +2064,26 @@ async function nr(s, e, r, n2, t, u, i) {
       let d = Array.from(a);
       d.length > 65535 && (await u.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `Truncating string of ${d.length} bytes` }), u.signal.throwIfAborted(), a = d.slice(0, 65535).join(""));
     }
-    let l = ye(h2, ce(a, n2, u));
+    let l = ye(h2, ce(a, r, u));
     for (let d = 0; d < l.length; d += 2080) s.record(d ? 60 : 516, l.subarray(d, d + 2080));
   }
-  else g.kind === "boolean" || g.kind === "error" ? s.record(517, ye(h2, new Uint8Array([g.kind === "boolean" ? Number(g.value) : Ye(g.value), g.kind === "error" ? 1 : 0]))) : s.record(513, h2);
+  else g.kind === "boolean" || g.kind === "error" ? s.record(517, ye(h2, new Uint8Array([g.kind === "boolean" ? Number(g.value) : qe(g.value), g.kind === "error" ? 1 : 0]))) : s.record(513, h2);
 }
-async function xn(s, e, r, n2, t, u) {
-  let i = (p) => ["SummaryInformation", "DocumentSummaryInformation"].find((c) => c.toUpperCase() === p.toUpperCase()), h2 = /* @__PURE__ */ new Map(), g = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), l = 0, d = 0, m2 = (p) => {
-    if (t(p), l += p, l > (n2.limits.workbookNodes ?? n2.limits.outputBytes)) throw new gt("resource-limit", "ssconvert BIFF property node limit exceeded");
-  }, f = (p) => {
-    t(p.length);
-    for (let c of p) {
+async function yn(s, e, n2, r, t, u) {
+  let i = (w2) => ["SummaryInformation", "DocumentSummaryInformation"].find((c) => c.toUpperCase() === w2.toUpperCase()), h2 = /* @__PURE__ */ new Map(), g = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), l = 0, d = 0, m2 = (w2) => {
+    if (t(w2), l += w2, l > (r.limits.workbookNodes ?? r.limits.outputBytes)) throw new xt("resource-limit", "ssconvert BIFF property node limit exceeded");
+  }, f = (w2) => {
+    t(w2.length);
+    for (let c of w2) {
       let I = c.codePointAt(0);
       d += I < 128 ? 1 : I < 2048 ? 2 : I < 65536 ? 3 : 4;
     }
-    if (d > (n2.limits.workbookTextBytes ?? n2.limits.outputBytes)) throw new gt("resource-limit", "ssconvert BIFF property text limit exceeded");
-    return p;
+    if (d > (r.limits.workbookTextBytes ?? r.limits.outputBytes)) throw new xt("resource-limit", "ssconvert BIFF property text limit exceeded");
+    return w2;
   };
-  for (let p of s.unsupportedRecords ?? []) {
-    if (m2(1), p.source !== "biff" || p.kind !== "ole-properties" || p.disposition !== "retained") continue;
-    let c = p.data;
+  for (let w2 of s.unsupportedRecords ?? []) {
+    if (m2(1), w2.source !== "biff" || w2.kind !== "ole-properties" || w2.disposition !== "retained") continue;
+    let c = w2.data;
     if (!c || typeof c != "object" || Array.isArray(c)) continue;
     let I = c;
     if (t(Object.keys(I).length), Object.keys(I).some((z) => !["stream", "bytes", "modeled"].includes(z)) || typeof I.stream != "string" || typeof I.bytes != "string" || I.modeled !== void 0 && !Array.isArray(I.modeled)) continue;
@@ -2094,23 +2100,23 @@ async function xn(s, e, r, n2, t, u) {
       let W = "0123456789abcdef".indexOf(I.bytes[z * 2].toLowerCase()), q = "0123456789abcdef".indexOf(I.bytes[z * 2 + 1].toLowerCase());
       (W < 0 || q < 0) && n("invalid retained property bytes"), X2[z] = W * 16 + q;
     }
-    h2.set(L2, { record: p, bytes: X2, modeled: I.modeled });
+    h2.set(L2, { record: w2, bytes: X2, modeled: I.modeled });
   }
-  for (let p of g) h2.delete(p);
+  for (let w2 of g) h2.delete(w2);
   if (!h2.size) return a;
-  let o = (p) => Ge(p, m2, t).map((c) => {
-    let I = p.subarray(c.offset, c.end);
-    return { ...c, bytes: I, ...Ve.has(c.guid) || c.guid === me.custom ? { values: He(new h(I), m2, t) } : {} };
-  }), E = new Map([...h2].map(([p, c]) => [p, o(c.bytes)])), k = new Map([...e].map(([p, c]) => [p, o(c)])), S = /* @__PURE__ */ new Map(), A = /* @__PURE__ */ new Map(), R2 = (p) => `${p.stream}:${p.section}:${p.id}`, B = { ...n2, limits: { ...n2.limits, inputBytes: n2.limits.outputBytes } };
-  await Xe(new Map([...h2].map(([p, c]) => [p, c.bytes])), B, f, t, void 0, (p) => {
-    m2(1), S.set(R2(p), p);
-  }), await Xe(e, B, f, t, void 0, (p) => {
-    m2(1), A.set(p.key, p);
+  let o = (w2) => He(w2, m2, t).map((c) => {
+    let I = w2.subarray(c.offset, c.end);
+    return { ...c, bytes: I, ...Xe.has(c.guid) || c.guid === me.custom ? { values: Ve(new h(I), m2, t) } : {} };
+  }), E = new Map([...h2].map(([w2, c]) => [w2, o(c.bytes)])), k = new Map([...e].map(([w2, c]) => [w2, o(c)])), N = /* @__PURE__ */ new Map(), A = /* @__PURE__ */ new Map(), S = (w2) => `${w2.stream}:${w2.section}:${w2.id}`, B = { ...r, limits: { ...r.limits, inputBytes: r.limits.outputBytes } };
+  await We(new Map([...h2].map(([w2, c]) => [w2, c.bytes])), B, f, t, void 0, (w2) => {
+    m2(1), N.set(S(w2), w2);
+  }), await We(e, B, f, t, void 0, (w2) => {
+    m2(1), A.set(w2.key, w2);
   });
-  let N = (p) => {
-    let c = p.values?.get(0);
+  let F = (w2) => {
+    let c = w2.values?.get(0);
     if (!c) return [];
-    let I = p.values?.get(1)?.u16(4) ?? 1252, L2 = I === 1200 ? 2 : 1, X2 = c.u32(0);
+    let I = w2.values?.get(1)?.u16(4) ?? 1252, L2 = I === 1200 ? 2 : 1, X2 = c.u32(0);
     c.check(4, X2 * 9), m2(X2);
     let z = 4, W = [];
     for (let q = 0; q < X2; q++) {
@@ -2120,127 +2126,127 @@ async function xn(s, e, r, n2, t, u) {
       f(oe), z += ie * L2, L2 === 2 && (z = Math.ceil(z / 4) * 4), W.push({ id: te, name: oe, bytes: c.slice(Q2, z - Q2) });
     }
     return W;
-  }, w2 = (p, c) => {
+  }, p = (w2, c) => {
     let I = u(4 + c.reduce((X2, z) => X2 + z.bytes.length, 0));
     new DataView(I.buffer).setUint32(0, c.length, true);
     let L2 = 4;
     for (let X2 of c) t(X2.bytes.length), I.set(X2.bytes, L2), L2 += X2.bytes.length;
-    p.values.set(0, new h(I));
-  }, D = (p, c) => {
-    p.values.delete(c), p.guid === me.custom && w2(p, N(p).filter((I) => I.id !== c));
-  }, x = (p) => {
-    t(k.get(p.stream).length);
-    let c = k.get(p.stream).find((L2) => L2.offset === p.section), I = c.values.get(p.id);
-    return D(c, p.id), A.delete(p.key), I;
-  }, b = (p, c) => {
-    if (p.u32(0) !== 30 || (c.values.get(1)?.u16(4) ?? 1252) === 65001) return p;
-    let I = new TextDecoder("utf-8", { fatal: true, ignoreBOM: true }).decode(p.slice(8, p.u32(4) - 1));
+    w2.values.set(0, new h(I));
+  }, D = (w2, c) => {
+    w2.values.delete(c), w2.guid === me.custom && p(w2, F(w2).filter((I) => I.id !== c));
+  }, x = (w2) => {
+    t(k.get(w2.stream).length);
+    let c = k.get(w2.stream).find((L2) => L2.offset === w2.section), I = c.values.get(w2.id);
+    return D(c, w2.id), A.delete(w2.key), I;
+  }, b = (w2, c) => {
+    if (w2.u32(0) !== 30 || (c.values.get(1)?.u16(4) ?? 1252) === 65001) return w2;
+    let I = new TextDecoder("utf-8", { fatal: true, ignoreBOM: true }).decode(w2.slice(8, w2.u32(4) - 1));
     t(I.length);
     let L2 = u(8 + (I.length + 1) * 2), X2 = new DataView(L2.buffer);
     X2.setUint32(0, 31, true), X2.setUint32(4, I.length + 1, true);
     for (let z = 0; z < I.length; z++) X2.setUint16(8 + z * 2, I.charCodeAt(z), true);
     return new h(L2);
-  }, O = (p, c) => !Array.isArray(p) || !Array.isArray(c) ? Object.is(p, c) : (t(p.length + c.length), p.length === c.length && p.every((I, L2) => Object.is(I, c[L2])));
-  for (let [p, c] of h2) {
+  }, O = (w2, c) => !Array.isArray(w2) || !Array.isArray(c) ? Object.is(w2, c) : (t(w2.length + c.length), w2.length === c.length && w2.every((I, L2) => Object.is(I, c[L2])));
+  for (let [w2, c] of h2) {
     let I = /* @__PURE__ */ new Set(), L2 = c.modeled;
     if (!L2) {
       L2 = [];
-      for (let X2 of S.values()) t(1), X2.stream === p && (p === "SummaryInformation" || h2.has("SummaryInformation") || Object.hasOwn(s.properties ?? {}, X2.key) && O(X2.value, s.properties?.[X2.key])) && (m2(1), L2.push([X2.section, X2.id, X2.key]));
+      for (let X2 of N.values()) t(1), X2.stream === w2 && (w2 === "SummaryInformation" || h2.has("SummaryInformation") || Object.hasOwn(s.properties ?? {}, X2.key) && O(X2.value, s.properties?.[X2.key])) && (m2(1), L2.push([X2.section, X2.id, X2.key]));
     }
     for (let X2 of L2) {
       m2(1), (!Array.isArray(X2) || X2.length !== 3 || typeof X2[0] != "number" || typeof X2[1] != "number" || typeof X2[2] != "string") && n("invalid retained property identity");
-      let [z, W, q] = X2, Q2 = S.get(R2({ stream: p, section: z, id: W }));
-      (!Q2 || Q2.key !== q || I.has(q)) && n("invalid retained property identity"), I.add(q), t(E.get(p).length);
-      let te = E.get(p).find((oe) => oe.offset === z), ie = s.properties?.[q], re = A.get(q);
+      let [z, W, q] = X2, Q2 = N.get(S({ stream: w2, section: z, id: W }));
+      (!Q2 || Q2.key !== q || I.has(q)) && n("invalid retained property identity"), I.add(q), t(E.get(w2).length);
+      let te = E.get(w2).find((oe) => oe.offset === z), ie = s.properties?.[q], re = A.get(q);
       Object.hasOwn(s.properties ?? {}, q) ? O(Q2.value, ie) ? (a.add(q), re && x(re)) : re && te.values.set(W, b(x(re), te)) : D(te, W);
     }
   }
-  let C2 = /* @__PURE__ */ new Map(), v = (p, c) => {
-    if (f(p), c === 65001) return new TextEncoder().encode(p + "\0");
+  let C2 = /* @__PURE__ */ new Map(), v = (w2, c) => {
+    if (f(w2), c === 65001) return new TextEncoder().encode(w2 + "\0");
     if (c === 1200) {
-      let z = u((p.length + 1) * 2), W = new DataView(z.buffer);
-      for (let q = 0; q < p.length; q++) W.setUint16(q * 2, p.charCodeAt(q), true);
+      let z = u((w2.length + 1) * 2), W = new DataView(z.buffer);
+      for (let q = 0; q < w2.length; q++) W.setUint16(q * 2, w2.charCodeAt(q), true);
       return z;
     }
     let I = C2.get(c);
     if (!I) {
       I = /* @__PURE__ */ new Map(), C2.set(c, I);
-      let z = ir[c], W = z?.single ?? rr[c === 1201 ? "iso-8859-1" : c === 1e4 ? "macintosh" : c >= 1250 && c <= 1258 ? `windows-${c}` : `cp${c}`];
+      let z = sr[c], W = z?.single ?? ir[c === 1201 ? "iso-8859-1" : c === 1e4 ? "macintosh" : c >= 1250 && c <= 1258 ? `windows-${c}` : `cp${c}`];
       if (!W) return;
       for (let q = 0; q < W.length; q++) t(1), W[q] !== "\uFFFF" && !I.has(W[q]) && I.set(W[q], [q]);
       if (z) for (let [q, Q2] of Object.entries(z.double)) for (let te = 0; te < Q2.length; te++) t(1), Q2[te] !== "\uFFFF" && !I.has(Q2[te]) && I.set(Q2[te], [Number(q), te]);
     }
     let L2 = [];
-    for (let z of p + "\0") {
+    for (let z of w2 + "\0") {
       t(1);
       let W = I.get(z);
       if (!W) return;
-      if (L2.push(...W), L2.length > n2.limits.outputBytes) throw new gt("resource-limit", "ssconvert BIFF property output bytes limit exceeded");
+      if (L2.push(...W), L2.length > r.limits.outputBytes) throw new xt("resource-limit", "ssconvert BIFF property output bytes limit exceeded");
     }
     let X2 = Uint8Array.from(L2);
-    return m(X2, c) === p + "\0" ? X2 : void 0;
-  }, F = async (p, c) => n2.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `Unsupported Excel BIFF document property: ${p} (${c}; original property bytes retained)` });
-  for (let p of [...A.values()]) {
-    t(k.get(p.stream).length + (E.get(p.stream)?.length ?? 0));
-    let c = k.get(p.stream).find((W) => W.offset === p.section), I = E.get(p.stream)?.find((W) => W.guid === c.guid);
+    return m(X2, c) === w2 + "\0" ? X2 : void 0;
+  }, R2 = async (w2, c) => r.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `Unsupported Excel BIFF document property: ${w2} (${c}; original property bytes retained)` });
+  for (let w2 of [...A.values()]) {
+    t(k.get(w2.stream).length + (E.get(w2.stream)?.length ?? 0));
+    let c = k.get(w2.stream).find((W) => W.offset === w2.section), I = E.get(w2.stream)?.find((W) => W.guid === c.guid);
     if (!I) continue;
-    let L2 = x(p), X2 = I.values, z = p.id;
+    let L2 = x(w2), X2 = I.values, z = w2.id;
     if (I.guid === me.custom) {
       let W;
       try {
-        W = N(I);
+        W = F(I);
       } catch (oe) {
-        if (!(oe instanceof gt) || oe.code !== "unsupported-feature") throw oe;
-        await F(p.key, "unknown dictionary encoding");
+        if (!(oe instanceof xt) || oe.code !== "unsupported-feature") throw oe;
+        await R2(w2.key, "unknown dictionary encoding");
         continue;
       }
-      if (t(W.length + X2.size), W.some((oe) => oe.name === p.key)) {
-        await F(p.key, "opaque name collision");
+      if (t(W.length + X2.size), W.some((oe) => oe.name === w2.key)) {
+        await R2(w2.key, "opaque name collision");
         continue;
       }
-      let q = X2.get(1)?.u16(4) ?? 1252, Q2 = v(p.key, q);
+      let q = X2.get(1)?.u16(4) ?? 1252, Q2 = v(w2.key, q);
       if (!Q2) {
-        await F(p.key, "name cannot be encoded in the original codepage");
+        await R2(w2.key, "name cannot be encoded in the original codepage");
         continue;
       }
       z = 1;
       for (let oe of X2.keys()) z = Math.max(z, oe);
       for (let oe of W) z = Math.max(z, oe.id);
       if (z++, z > 4294967295) {
-        await F(p.key, "no free property ID");
+        await R2(w2.key, "no free property ID");
         continue;
       }
       let te = 8 + Q2.length, ie = u(q === 1200 ? Math.ceil(te / 4) * 4 : te), re = new DataView(ie.buffer);
-      re.setUint32(0, z, true), re.setUint32(4, Q2.length / (q === 1200 ? 2 : 1), true), ie.set(Q2, 8), w2(I, [...W, { id: z, name: p.key, bytes: ie }]);
+      re.setUint32(0, z, true), re.setUint32(4, Q2.length / (q === 1200 ? 2 : 1), true), ie.set(Q2, 8), p(I, [...W, { id: z, name: w2.key, bytes: ie }]);
     } else if (X2.has(z)) {
-      await F(p.key, "opaque property ID collision");
+      await R2(w2.key, "opaque property ID collision");
       continue;
     }
     X2.set(z, b(L2, I));
   }
-  let M = (p) => {
-    if (!p.values) return p.bytes;
-    let c = [...p.values], I = u(8 + c.length * 8 + c.reduce((z, [, W]) => z + Math.ceil(W.bytes.length / 4) * 4, 0)), L2 = new DataView(I.buffer);
+  let M = (w2) => {
+    if (!w2.values) return w2.bytes;
+    let c = [...w2.values], I = u(8 + c.length * 8 + c.reduce((z, [, W]) => z + Math.ceil(W.bytes.length / 4) * 4, 0)), L2 = new DataView(I.buffer);
     L2.setUint32(0, I.length, true), L2.setUint32(4, c.length, true);
     let X2 = 8 + c.length * 8;
     return c.forEach(([z, W], q) => {
       t(W.bytes.length), L2.setUint32(8 + q * 8, z, true), L2.setUint32(12 + q * 8, X2, true), I.set(W.bytes, X2), X2 += Math.ceil(W.bytes.length / 4) * 4;
     }), I;
   };
-  for (let p of /* @__PURE__ */ new Set([...e.keys(), ...h2.keys()])) {
-    for (let Q2 of k.get(p) ?? []) t(1 + Q2.values.size);
-    let c = k.get(p)?.filter((Q2) => [...Q2.values.keys()].some((te) => te >= 2)) ?? [];
-    if (!E.has(p) && c.some((Q2) => Q2.guid === me.custom) && !c.some((Q2) => Q2.guid === me.document)) {
-      let Q2 = k.get(p)?.find((te) => te.guid === me.document);
+  for (let w2 of /* @__PURE__ */ new Set([...e.keys(), ...h2.keys()])) {
+    for (let Q2 of k.get(w2) ?? []) t(1 + Q2.values.size);
+    let c = k.get(w2)?.filter((Q2) => [...Q2.values.keys()].some((te) => te >= 2)) ?? [];
+    if (!E.has(w2) && c.some((Q2) => Q2.guid === me.custom) && !c.some((Q2) => Q2.guid === me.document)) {
+      let Q2 = k.get(w2)?.find((te) => te.guid === me.document);
       Q2 && c.unshift(Q2);
     }
-    let I = [...E.get(p) ?? [], ...c];
+    let I = [...E.get(w2) ?? [], ...c];
     if (!I.length) {
-      e.delete(p);
+      e.delete(w2);
       continue;
     }
     let L2 = I.map(M), X2 = u(28 + I.length * 20 + L2.reduce((Q2, te) => Q2 + te.length, 0));
-    X2.set((h2.get(p)?.bytes ?? e.get(p)).subarray(0, 28));
+    X2.set((h2.get(w2)?.bytes ?? e.get(w2)).subarray(0, 28));
     let z = new DataView(X2.buffer);
     z.setUint32(24, I.length, true);
     let W = 28 + I.length * 20;
@@ -2248,34 +2254,34 @@ async function xn(s, e, r, n2, t, u) {
       t(1);
       for (let ie = 0; ie < 16; ie++) X2[28 + te * 20 + ie] = parseInt(Q2.guid.slice(ie * 2, ie * 2 + 2), 16);
       z.setUint32(44 + te * 20, W, true), X2.set(L2[te], W), W += L2[te].length;
-    }), e.set(p, X2);
-    let q = h2.get(p);
-    q && r.add(q.record);
+    }), e.set(w2, X2);
+    let q = h2.get(w2);
+    q && n2.add(q.record);
   }
   let _ = /* @__PURE__ */ new Set();
-  await Xe(e, B, f, t, void 0, (p) => {
-    m2(1), Object.hasOwn(s.properties ?? {}, p.key) || _.add(p.key);
+  await We(e, B, f, t, void 0, (w2) => {
+    m2(1), Object.hasOwn(s.properties ?? {}, w2.key) || _.add(w2.key);
   });
-  for (let p of _) await F(p, "opaque property exposes a field absent from the model");
+  for (let w2 of _) await R2(w2, "opaque property exposes a field absent from the model");
   return a;
 }
-var Ct = new Map([...Ve].flatMap(([s, e]) => [...e].map(([r, n2]) => [n2, { guid: s, id: r }])));
-var Ut = 0xffffffffffffffffn;
-function sr(s, e, r) {
+var Ut = new Map([...Xe].flatMap(([s, e]) => [...e].map(([n2, r]) => [r, { guid: s, id: n2 }])));
+var Ot = 0xffffffffffffffffn;
+function or(s, e, n2) {
   if (s.disposition !== "retained" || s.source !== "Gnumeric_XmlIO:sax" || s.kind !== "document-meta") return false;
-  let n2 = "urn:oasis:names:tc:opendocument:xmlns:office:1.0", t = "urn:oasis:names:tc:opendocument:xmlns:meta:1.0", u = (m2) => {
-    if (r(1), !m2 || typeof m2 != "object" || Array.isArray(m2)) return;
+  let r = "urn:oasis:names:tc:opendocument:xmlns:office:1.0", t = "urn:oasis:names:tc:opendocument:xmlns:meta:1.0", u = (m2) => {
+    if (n2(1), !m2 || typeof m2 != "object" || Array.isArray(m2)) return;
     let f = m2;
-    for (let o in f) if (Object.hasOwn(f, o) && (r(1), !["name", "namespace", "text", "attributes", "children"].includes(o))) return;
-    if (!(typeof f.name != "string" || typeof f.namespace != "string" || typeof f.text != "string" || !Array.isArray(f.attributes) || !Array.isArray(f.children))) return r(f.name.length + f.namespace.length + f.text.length + f.attributes.length + f.children.length), f;
+    for (let o in f) if (Object.hasOwn(f, o) && (n2(1), !["name", "namespace", "text", "attributes", "children"].includes(o))) return;
+    if (!(typeof f.name != "string" || typeof f.namespace != "string" || typeof f.text != "string" || !Array.isArray(f.attributes) || !Array.isArray(f.children))) return n2(f.name.length + f.namespace.length + f.text.length + f.attributes.length + f.children.length), f;
   }, i = (m2, f, o) => {
     let E = /* @__PURE__ */ new Map();
     for (let k of m2.attributes) {
-      if (r(1), !k || typeof k != "object" || Array.isArray(k)) return;
-      let S = k;
-      for (let A in S) if (Object.hasOwn(S, A) && (r(1), !["name", "namespace", "value"].includes(A))) return;
-      if (typeof S.name != "string" || S.namespace !== f || typeof S.value != "string" || !o.includes(S.name) || E.has(S.name)) return;
-      r(S.name.length + f.length + S.value.length), E.set(S.name, S.value);
+      if (n2(1), !k || typeof k != "object" || Array.isArray(k)) return;
+      let N = k;
+      for (let A in N) if (Object.hasOwn(N, A) && (n2(1), !["name", "namespace", "value"].includes(A))) return;
+      if (typeof N.name != "string" || N.namespace !== f || typeof N.value != "string" || !o.includes(N.name) || E.has(N.name)) return;
+      n2(N.name.length + f.length + N.value.length), E.set(N.name, N.value);
     }
     return E;
   }, h2 = (m2) => {
@@ -2283,11 +2289,11 @@ function sr(s, e, r) {
 `].includes(f)) return false;
     return true;
   }, g = u(s.data);
-  if (!g || g.name !== "document-meta" || g.namespace !== n2 || !h2(g.text) || g.children.length !== 1) return false;
-  let a = i(g, n2, ["version"]);
+  if (!g || g.name !== "document-meta" || g.namespace !== r || !h2(g.text) || g.children.length !== 1) return false;
+  let a = i(g, r, ["version"]);
   if (!a || a.has("version") && !["1.0", "1.1", "1.2", "1.3"].includes(a.get("version"))) return false;
   let l = u(g.children[0]);
-  if (!l || l.name !== "meta" || l.namespace !== n2 || !h2(l.text) || l.attributes.length) return false;
+  if (!l || l.name !== "meta" || l.namespace !== r || !h2(l.text) || l.attributes.length) return false;
   let d = /* @__PURE__ */ new Map();
   for (let m2 of l.children) {
     let f = u(m2);
@@ -2296,21 +2302,21 @@ function sr(s, e, r) {
     if (f.namespace === t && f.name === "user-defined") {
       let k = i(f, t, ["name", "value-type", "type"]);
       if (!k?.has("name") || k.has("type") && k.has("value-type")) return false;
-      let S = k.get("value-type") ?? k.get("type") ?? "string";
-      if (!["string", "float", "boolean"].includes(S) || S === "boolean" && !["true", "false"].includes(f.text) || S === "float" && (!f.text.trim() || !Number.isFinite(Number(f.text)))) return false;
+      let N = k.get("value-type") ?? k.get("type") ?? "string";
+      if (!["string", "float", "boolean"].includes(N) || N === "boolean" && !["true", "false"].includes(f.text) || N === "float" && (!f.text.trim() || !Number.isFinite(Number(f.text)))) return false;
       o = k.get("name");
-    } else if (f.attributes.length || (o = f.namespace === t ? f.name === "keyword" ? "dc:keywords" : "meta:" + f.name : f.namespace === "http://purl.org/dc/elements/1.1/" ? "dc:" + f.name : void 0, o === void 0 || !Ct.has(o))) return false;
+    } else if (f.attributes.length || (o = f.namespace === t ? f.name === "keyword" ? "dc:keywords" : "meta:" + f.name : f.namespace === "http://purl.org/dc/elements/1.1/" ? "dc:" + f.name : void 0, o === void 0 || !Ut.has(o))) return false;
     let E = f.namespace === t && f.name === "keyword";
     if (o === void 0 || !e.has(o) || d.has(o) && !(E && d.get(o))) return false;
     d.set(o, E);
   }
   return true;
 }
-function or(s) {
+function ar(s) {
   if (!s.startsWith("P")) return;
-  let e = 1, r = false, n2 = -1, t = 0n;
+  let e = 1, n2 = false, r = -1, t = 0n;
   for (; e < s.length; ) {
-    if (s[e] === "T" && !r && (r = true, e++, e === s.length)) return;
+    if (s[e] === "T" && !n2 && (n2 = true, e++, e === s.length)) return;
     let u = 0n, i = 0, h2 = 0n, g = false, a = 0;
     for (; e < s.length; ) {
       let f = s.charCodeAt(e) - 48;
@@ -2319,174 +2325,174 @@ function or(s) {
           if (a < 7) h2 = h2 * 10n + BigInt(f);
           else if (f) return;
           a++;
-        } else if (u = u * 10n + BigInt(f), i++, u > Ut) return;
+        } else if (u = u * 10n + BigInt(f), i++, u > Ot) return;
         e++;
       } else if (s[e] === "." && !g) g = true, e++;
       else break;
     }
-    let l = s[e++], d = l === "D" && !r ? 0 : r ? ["H", "M", "S"].indexOf(l ?? "") + 1 : -1;
-    if (!i || d <= n2 || d < 0 || r && d === 0 || g && (l !== "S" || !a) || (n2 = d, t += u * [864000000000n, 36000000000n, 600000000n, 10000000n][d] + h2 * 10n ** BigInt(Math.max(0, 7 - a)), t > Ut)) return;
+    let l = s[e++], d = l === "D" && !n2 ? 0 : n2 ? ["H", "M", "S"].indexOf(l ?? "") + 1 : -1;
+    if (!i || d <= r || d < 0 || n2 && d === 0 || g && (l !== "S" || !a) || (r = d, t += u * [864000000000n, 36000000000n, 600000000n, 10000000n][d] + h2 * 10n ** BigInt(Math.max(0, 7 - a)), t > Ot)) return;
   }
-  return n2 < 0 ? void 0 : t;
+  return r < 0 ? void 0 : t;
 }
-async function yn(s, e) {
-  let r = /* @__PURE__ */ new Map(), n2 = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Set(), u = [], i = 0, h2 = 0, g = 0, a = 0, l = (A) => {
-    if (e.signal.throwIfAborted(), i += A, i > (e.limits.workbookWork ?? e.limits.outputBytes * 8)) throw new Oe("resource-limit", "ssconvert BIFF property work limit exceeded");
+async function bn(s, e) {
+  let n2 = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Set(), u = [], i = 0, h2 = 0, g = 0, a = 0, l = (A) => {
+    if (e.signal.throwIfAborted(), i += A, i > (e.limits.workbookWork ?? e.limits.outputBytes * 8)) throw new Me("resource-limit", "ssconvert BIFF property work limit exceeded");
   }, d = (A) => {
-    if (l(A), A > 4294967295 || A > e.limits.outputBytes) throw new Oe("resource-limit", "ssconvert BIFF property output bytes limit exceeded");
+    if (l(A), A > 4294967295 || A > e.limits.outputBytes) throw new Me("resource-limit", "ssconvert BIFF property output bytes limit exceeded");
     return new Uint8Array(A);
   }, m2 = (A) => {
-    let R2 = 0;
-    for (let N = 0; N < A.length; N++) {
+    let S = 0;
+    for (let F = 0; F < A.length; F++) {
       l(1);
-      let w2 = A.codePointAt(N);
-      if (w2 >= 55296 && w2 <= 57343) throw new Oe("unsupported-feature", "Excel BIFF property text contains an unpaired surrogate");
-      R2 += w2 < 128 ? 1 : w2 < 2048 ? 2 : w2 < 65536 ? 3 : 4, w2 >= 65536 && N++;
-    }
-    if (h2 += R2, h2 > (e.limits.workbookTextBytes ?? e.limits.outputBytes)) throw new Oe("resource-limit", "ssconvert BIFF property text limit exceeded");
-    let B = d(5 + R2);
-    return new DataView(B.buffer).setUint32(0, R2 + 1, true), new TextEncoder().encodeInto(A, B.subarray(4, 4 + R2)), B;
-  }, f = (A, R2) => {
-    let B = ["meta:creation-date", "meta:print-date", "dc:date"].includes(R2);
-    if (B || R2 === "meta:editing-duration") {
+      let p = A.codePointAt(F);
+      if (p >= 55296 && p <= 57343) throw new Me("unsupported-feature", "Excel BIFF property text contains an unpaired surrogate");
+      S += p < 128 ? 1 : p < 2048 ? 2 : p < 65536 ? 3 : 4, p >= 65536 && F++;
+    }
+    if (h2 += S, h2 > (e.limits.workbookTextBytes ?? e.limits.outputBytes)) throw new Me("resource-limit", "ssconvert BIFF property text limit exceeded");
+    let B = d(5 + S);
+    return new DataView(B.buffer).setUint32(0, S + 1, true), new TextEncoder().encodeInto(A, B.subarray(4, 4 + S)), B;
+  }, f = (A, S) => {
+    let B = ["meta:creation-date", "meta:print-date", "dc:date"].includes(S);
+    if (B || S === "meta:editing-duration") {
       if (typeof A != "string") return;
       l(A.length);
-      let w2;
+      let p;
       if (B) {
         let b = A.slice(-6), C2 = A.endsWith("Z") || (b[0] === "+" || b[0] === "-") && b[3] === ":" ? Date.parse(A) + 116444736e5 : NaN;
         if (Number.isSafeInteger(C2) && C2 >= 0) {
-          w2 = BigInt(C2) * 10000n;
+          p = BigInt(C2) * 10000n;
           let v = A.indexOf(".", A.indexOf("T"));
           if (v >= 0) {
-            let F = v + 1;
-            for (; F < A.length && A[F] >= "0" && A[F] <= "9"; ) F++;
-            let M = A.slice(v + 1, F);
+            let R2 = v + 1;
+            for (; R2 < A.length && A[R2] >= "0" && A[R2] <= "9"; ) R2++;
+            let M = A.slice(v + 1, R2);
             if ([...M.slice(7)].some((_) => _ !== "0")) return;
-            w2 += BigInt(M.slice(3, 7).padEnd(4, "0"));
+            p += BigInt(M.slice(3, 7).padEnd(4, "0"));
           }
         }
-      } else w2 = or(A);
-      if (w2 === void 0 || w2 > Ut) return;
+      } else p = ar(A);
+      if (p === void 0 || p > Ot) return;
       let D = d(12), x = new DataView(D.buffer);
-      return x.setUint32(0, 64, true), x.setBigUint64(4, w2, true), D;
+      return x.setUint32(0, 64, true), x.setBigUint64(4, p, true), D;
     }
-    let N = Ct.get(R2);
-    if (N) {
-      if (N.guid === me.summary && [14, 15, 16, 19].includes(N.id)) {
+    let F = Ut.get(S);
+    if (F) {
+      if (F.guid === me.summary && [14, 15, 16, 19].includes(F.id)) {
         if (typeof A != "number" || !Number.isInteger(A) || A < -2147483648 || A > 2147483647) return;
         Object.is(A, -0) && (A = 0);
       } else if (typeof A == "number" && Number.isFinite(A) && (A = String(A)), typeof A != "string") return;
     }
     if (typeof A == "string") {
-      let w2 = m2(A), D = d(4 + w2.length);
-      return new DataView(D.buffer).setUint32(0, 30, true), D.set(w2, 4), D;
+      let p = m2(A), D = d(4 + p.length);
+      return new DataView(D.buffer).setUint32(0, 30, true), D.set(p, 4), D;
     }
     if (typeof A == "boolean") {
-      let w2 = d(8), D = new DataView(w2.buffer);
-      return D.setUint32(0, 11, true), D.setUint16(4, A ? 65535 : 0, true), w2;
+      let p = d(8), D = new DataView(p.buffer);
+      return D.setUint32(0, 11, true), D.setUint16(4, A ? 65535 : 0, true), p;
     }
     if (typeof A == "number" && Number.isFinite(A)) {
-      let w2 = Number.isInteger(A) && A >= -2147483648 && A <= 2147483647 && !Object.is(A, -0), D = d(w2 ? 8 : 12), x = new DataView(D.buffer);
-      return x.setUint32(0, w2 ? 3 : 5, true), w2 ? x.setInt32(4, A, true) : x.setFloat64(4, A, true), D;
+      let p = Number.isInteger(A) && A >= -2147483648 && A <= 2147483647 && !Object.is(A, -0), D = d(p ? 8 : 12), x = new DataView(D.buffer);
+      return x.setUint32(0, p ? 3 : 5, true), p ? x.setInt32(4, A, true) : x.setFloat64(4, A, true), D;
     }
   }, o = [];
   for (let A in s.properties) if (Object.hasOwn(s.properties, A)) {
-    if (l(1), ++g > (e.limits.workbookNodes ?? e.limits.outputBytes)) throw new Oe("resource-limit", "ssconvert BIFF property node limit exceeded");
-    let R2 = Ct.get(A);
+    if (l(1), ++g > (e.limits.workbookNodes ?? e.limits.outputBytes)) throw new Me("resource-limit", "ssconvert BIFF property node limit exceeded");
+    let S = Ut.get(A);
     t.add(A);
     let B = s.properties[A];
     if (A === "dc:keywords" && Array.isArray(B)) {
-      if (l(B.length), g += B.length, g > (e.limits.workbookNodes ?? e.limits.outputBytes)) throw new Oe("resource-limit", "ssconvert BIFF property node limit exceeded");
+      if (l(B.length), g += B.length, g > (e.limits.workbookNodes ?? e.limits.outputBytes)) throw new Me("resource-limit", "ssconvert BIFF property node limit exceeded");
       let O = true, C2 = Math.max(0, B.length - 1) * 2;
       for (let v of B) {
-        if (typeof v != "string" || v.includes(",") || !v.length || Ke(v.charCodeAt(0)) || Ke(v.charCodeAt(v.length - 1))) {
+        if (typeof v != "string" || v.includes(",") || !v.length || Ye(v.charCodeAt(0)) || Ye(v.charCodeAt(v.length - 1))) {
           O = false;
           break;
         }
-        if (C2 += v.length, C2 > (e.limits.workbookTextBytes ?? e.limits.outputBytes) - h2) throw new Oe("resource-limit", "ssconvert BIFF property text limit exceeded");
+        if (C2 += v.length, C2 > (e.limits.workbookTextBytes ?? e.limits.outputBytes) - h2) throw new Me("resource-limit", "ssconvert BIFF property text limit exceeded");
       }
       O && (B = B.join(", "));
     }
-    let N = A ? f(B, A) : void 0;
-    if (!N) {
+    let F = A ? f(B, A) : void 0;
+    if (!F) {
       u.push(A);
       continue;
     }
-    let w2 = R2?.guid ?? me.custom, D = R2?.id ?? o.length + 2, x = 0;
-    if (!R2) {
+    let p = S?.guid ?? me.custom, D = S?.id ?? o.length + 2, x = 0;
+    if (!S) {
       let O = m2(A);
       x = O.length, o.push({ id: D, bytes: O });
     }
-    if (a += N.length + x, a > e.limits.outputBytes) throw new Oe("resource-limit", "ssconvert BIFF property output bytes limit exceeded");
-    let b = n2.get(w2) ?? /* @__PURE__ */ new Map();
-    b.set(D, N), n2.set(w2, b);
+    if (a += F.length + x, a > e.limits.outputBytes) throw new Me("resource-limit", "ssconvert BIFF property output bytes limit exceeded");
+    let b = r.get(p) ?? /* @__PURE__ */ new Map();
+    b.set(D, F), r.set(p, b);
   }
   let E = /* @__PURE__ */ new Set();
-  for (let A of s.unsupportedRecords ?? []) l(1), sr(A, t, l) && E.add(A);
+  for (let A of s.unsupportedRecords ?? []) l(1), or(A, t, l) && E.add(A);
   if (o.length) {
-    let A = d(4 + o.reduce((N, w2) => N + 4 + w2.bytes.length, 0)), R2 = new DataView(A.buffer);
-    R2.setUint32(0, o.length, true);
+    let A = d(4 + o.reduce((F, p) => F + 4 + p.bytes.length, 0)), S = new DataView(A.buffer);
+    S.setUint32(0, o.length, true);
     let B = 4;
-    for (let N of o) l(1), R2.setUint32(B, N.id, true), A.set(N.bytes, B + 4), B += 4 + N.bytes.length;
-    n2.get(me.custom).set(0, A), n2.has(me.document) || n2.set(me.document, /* @__PURE__ */ new Map());
+    for (let F of o) l(1), S.setUint32(B, F.id, true), A.set(F.bytes, B + 4), B += 4 + F.bytes.length;
+    r.get(me.custom).set(0, A), r.has(me.document) || r.set(me.document, /* @__PURE__ */ new Map());
   }
   let k = /* @__PURE__ */ new Map();
-  for (let [A, R2] of n2) {
-    let B = d(8), N = new DataView(B.buffer);
-    N.setUint32(0, 2, true), N.setUint16(4, 65001, true), R2.set(1, B);
-    let w2 = [...R2].sort(([C2], [v]) => C2 - v);
-    l(w2.length * Math.ceil(Math.log2(w2.length + 1)));
-    let D = 8 + w2.length * 8 + w2.reduce((C2, [, v]) => C2 + Math.ceil(v.length / 4) * 4, 0), x = d(D), b = new DataView(x.buffer);
-    b.setUint32(0, D, true), b.setUint32(4, w2.length, true);
-    let O = 8 + w2.length * 8;
-    for (let C2 = 0; C2 < w2.length; C2++) {
+  for (let [A, S] of r) {
+    let B = d(8), F = new DataView(B.buffer);
+    F.setUint32(0, 2, true), F.setUint16(4, 65001, true), S.set(1, B);
+    let p = [...S].sort(([C2], [v]) => C2 - v);
+    l(p.length * Math.ceil(Math.log2(p.length + 1)));
+    let D = 8 + p.length * 8 + p.reduce((C2, [, v]) => C2 + Math.ceil(v.length / 4) * 4, 0), x = d(D), b = new DataView(x.buffer);
+    b.setUint32(0, D, true), b.setUint32(4, p.length, true);
+    let O = 8 + p.length * 8;
+    for (let C2 = 0; C2 < p.length; C2++) {
       l(1);
-      let [v, F] = w2[C2];
-      b.setUint32(8 + C2 * 8, v, true), b.setUint32(12 + C2 * 8, O, true), x.set(F, O), O += Math.ceil(F.length / 4) * 4;
+      let [v, R2] = p[C2];
+      b.setUint32(8 + C2 * 8, v, true), b.setUint32(12 + C2 * 8, O, true), x.set(R2, O), O += Math.ceil(R2.length / 4) * 4;
     }
     k.set(A, x);
   }
-  for (let [A, R2] of [["SummaryInformation", [me.summary]], ["DocumentSummaryInformation", [me.document, me.custom]]]) {
-    let B = R2.filter((x) => k.has(x));
+  for (let [A, S] of [["SummaryInformation", [me.summary]], ["DocumentSummaryInformation", [me.document, me.custom]]]) {
+    let B = S.filter((x) => k.has(x));
     if (!B.length) continue;
-    let N = d(28 + B.length * 20 + B.reduce((x, b) => x + k.get(b).length, 0)), w2 = new DataView(N.buffer);
-    w2.setUint16(0, 65534, true), w2.setUint32(4, 131073, true), w2.setUint32(24, B.length, true);
+    let F = d(28 + B.length * 20 + B.reduce((x, b) => x + k.get(b).length, 0)), p = new DataView(F.buffer);
+    p.setUint16(0, 65534, true), p.setUint32(4, 131073, true), p.setUint32(24, B.length, true);
     let D = 28 + B.length * 20;
     for (let x = 0; x < B.length; x++) {
       l(1);
       let b = B[x], O = k.get(b);
-      for (let C2 = 0; C2 < 16; C2++) N[28 + x * 20 + C2] = parseInt(b.slice(C2 * 2, C2 * 2 + 2), 16);
-      w2.setUint32(44 + x * 20, D, true), N.set(O, D), D += O.length;
+      for (let C2 = 0; C2 < 16; C2++) F[28 + x * 20 + C2] = parseInt(b.slice(C2 * 2, C2 * 2 + 2), 16);
+      p.setUint32(44 + x * 20, D, true), F.set(O, D), D += O.length;
     }
-    r.set(A, N);
+    n2.set(A, F);
   }
-  let S = await xn(s, r, E, e, l, d);
-  for (let A of u) S.has(A) || await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `Unsupported Excel BIFF document property: ${A}` });
-  return { streams: r, handledMetadata: E };
+  let N = await yn(s, n2, E, e, l, d);
+  for (let A of u) N.has(A) || await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `Unsupported Excel BIFF document property: ${A}` });
+  return { streams: n2, handledMetadata: E };
 }
-function Ps(s) {
-  return async (e, r, n2) => {
-    n2.signal.throwIfAborted();
+function Gs(s) {
+  return async (e, n2, r) => {
+    r.signal.throwIfAborted();
     let t;
-    for (let a of r) for (let [l, d] of ar(a)) if (l === "encryption" && (t = Ft.get(d), !t || s !== 8 && t.algorithm !== "xor")) throw new be("invalid-request", "Invalid Excel BIFF encryption profile");
-    let u = await yn(e, n2), i = new Map(u.streams), h2 = new Set(u.handledMetadata), g = /* @__PURE__ */ new Map();
+    for (let a of n2) for (let [l, d] of fr(a)) if (l === "encryption" && (t = Tt.get(d), !t || s !== 8 && t.algorithm !== "xor")) throw new be("invalid-request", "Invalid Excel BIFF encryption profile");
+    let u = await bn(e, r), i = new Map(u.streams), h2 = new Set(u.handledMetadata), g = /* @__PURE__ */ new Map();
     try {
-      t?.algorithm === "rc4-cryptoapi" && t.encryptedProperties && zt(e, i, h2, n2);
+      t?.algorithm === "rc4-cryptoapi" && t.encryptedProperties && $t(e, i, h2, r);
       let a = h2.size ? { ...e, unsupportedRecords: (e.unsupportedRecords ?? []).filter((l) => !h2.has(l)) } : e;
-      if ((s === 7 || s === "dsf") && g.set("Book", await Bt(a, 7, s === "dsf", n2, t ? Tt(t, 7) : void 0)), s === 8 || s === "dsf") {
-        let l = await Bt(a, 8, s === "dsf", n2, t ? Tt(t) : void 0);
+      if ((s === 7 || s === "dsf") && g.set("Book", await Ct(a, 7, s === "dsf", r, t ? St(t, 7) : void 0)), s === 8 || s === "dsf") {
+        let l = await Ct(a, 8, s === "dsf", r, t ? St(t) : void 0);
         if (g.set("Workbook", l), t && t.algorithm !== "xor") {
-          let d = await Yt(l, n2, t, i);
+          let d = await qt(l, r, t, i);
           d && g.set("encryption", d);
         }
       }
-      if (t?.algorithm === "xor" && await qt([...g.values()], s === 7 ? 7 : 8, n2), g.has("encryption")) {
+      if (t?.algorithm === "xor" && await Qt([...g.values()], s === 7 ? 7 : 8, r), g.has("encryption")) {
         let l = new Uint8Array(56), d = new DataView(l.buffer);
         d.setUint16(0, 65534, true), d.setUint32(24, 1, true), d.setUint32(44, 48, true), d.setUint32(48, 8, true);
         for (let m2 = 0; m2 < 16; m2++) l[28 + m2] = parseInt(me.document.slice(m2 * 2, m2 * 2 + 2), 16);
         g.set("DocumentSummaryInformation", l);
       } else for (let [l, d] of i) g.set(l, d);
-      return mn(g, n2);
+      return hn(g, r);
     } finally {
       if (t) {
         for (let a of g.values()) a.fill(0);
@@ -2495,51 +2501,51 @@ function Ps(s) {
     }
   };
 }
-var kn = ["Workbook", "WORKBOOK", "workbook", "Book", "BOOK", "book"];
-var Ot = /* @__PURE__ */ new Set([9, 521, 1033, 2057]);
-var fr = { 0: "General", 1: "0", 2: "0.00", 3: "#,##0", 4: "#,##0.00", 5: "$#,##0_);($#,##0)", 6: "$#,##0_);[Red]($#,##0)", 7: "$#,##0.00_);($#,##0.00)", 8: "$#,##0.00_);[Red]($#,##0.00)", 9: "0%", 10: "0.00%", 11: "0.00E+00", 12: "# ?/?", 13: "# ??/??", 14: "m/d/yy", 15: "d-mmm-yy", 16: "d-mmm", 17: "mmm-yy", 18: "h:mm AM/PM", 19: "h:mm:ss AM/PM", 20: "h:mm", 21: "h:mm:ss", 22: "m/d/yy h:mm", 37: "#,##0_);(#,##0)", 38: "#,##0_);[Red](#,##0)", 39: "#,##0.00_);(#,##0.00)", 40: "#,##0.00_);[Red](#,##0.00)", 45: "mm:ss", 46: "[h]:mm:ss", 47: "mm:ss.0", 48: "##0.0E+0", 49: "@" };
-var bn = ["000000", "FFFFFF", "FF0000", "00FF00", "0000FF", "FFFF00", "FF00FF", "00FFFF", "800000", "008000", "000080", "808000", "800080", "008080", "C0C0C0", "808080", "9999FF", "993366", "FFFFCC", "CCFFFF", "660066", "FF8080", "0066CC", "CCCCFF", "000080", "FF00FF", "FFFF00", "00FFFF", "800080", "800000", "008080", "0000FF", "00CCFF", "CCFFFF", "CCFFCC", "FFFF99", "99CCFF", "FF99CC", "CC99FF", "FFCC99", "3366FF", "33CCCC", "99CC00", "FFCC00", "FF9900", "FF6600", "666699", "969696", "003366", "339966", "003300", "333300", "993300", "993366", "333399", "333333"];
-var lr = /* @__PURE__ */ new Set([11, 523, 215, 255, 22, 31, 91, 92, 192, 193, 225, 226, 64, 140, 156, 191, 218, 352, 353, 317, 448, 449, 450, 134, 135, 155, 128, 130, 141, 95, 139, 142, 1070, 431, 14, 659, 439, 444]);
-function En(s) {
+var In = ["Workbook", "WORKBOOK", "workbook", "Book", "BOOK", "book"];
+var Mt = /* @__PURE__ */ new Set([9, 521, 1033, 2057]);
+var lr = { 0: "General", 1: "0", 2: "0.00", 3: "#,##0", 4: "#,##0.00", 5: "$#,##0_);($#,##0)", 6: "$#,##0_);[Red]($#,##0)", 7: "$#,##0.00_);($#,##0.00)", 8: "$#,##0.00_);[Red]($#,##0.00)", 9: "0%", 10: "0.00%", 11: "0.00E+00", 12: "# ?/?", 13: "# ??/??", 14: "m/d/yy", 15: "d-mmm-yy", 16: "d-mmm", 17: "mmm-yy", 18: "h:mm AM/PM", 19: "h:mm:ss AM/PM", 20: "h:mm", 21: "h:mm:ss", 22: "m/d/yy h:mm", 37: "#,##0_);(#,##0)", 38: "#,##0_);[Red](#,##0)", 39: "#,##0.00_);(#,##0.00)", 40: "#,##0.00_);[Red](#,##0.00)", 45: "mm:ss", 46: "[h]:mm:ss", 47: "mm:ss.0", 48: "##0.0E+0", 49: "@" };
+var En = ["000000", "FFFFFF", "FF0000", "00FF00", "0000FF", "FFFF00", "FF00FF", "00FFFF", "800000", "008000", "000080", "808000", "800080", "008080", "C0C0C0", "808080", "9999FF", "993366", "FFFFCC", "CCFFFF", "660066", "FF8080", "0066CC", "CCCCFF", "000080", "FF00FF", "FFFF00", "00FFFF", "800080", "800000", "008080", "0000FF", "00CCFF", "CCFFFF", "CCFFCC", "FFFF99", "99CCFF", "FF99CC", "CC99FF", "FFCC99", "3366FF", "33CCCC", "99CC00", "FFCC00", "FF9900", "FF6600", "666699", "969696", "003366", "339966", "003300", "333300", "993300", "993366", "333399", "333333"];
+var cr = /* @__PURE__ */ new Set([11, 523, 215, 255, 22, 31, 91, 92, 192, 193, 225, 226, 64, 140, 156, 191, 218, 352, 353, 317, 448, 449, 450, 134, 135, 155, 128, 130, 141, 95, 139, 142, 1070, 431, 14, 659, 439, 444]);
+function An(s) {
   if (s.data.check(0, 4), s.opcode !== 2057) return s.opcode === 9 ? 2 : s.opcode === 521 ? 3 : 4;
-  let e = s.data.u16(0), n2 = { 1536: 8, 1280: 7, 1024: 4, 768: 3, 512: 2, 7: 2, 0: 2 }[e];
-  return n2 || n("unknown BIFF revision"), n2;
+  let e = s.data.u16(0), r = { 1536: 8, 1280: 7, 1024: 4, 768: 3, 512: 2, 7: 2, 0: 2 }[e];
+  return r || n("unknown BIFF revision"), r;
 }
-function cr(s, e) {
+function ur(s, e) {
   if (!K(s)) return s;
-  let r = Q(s, e);
-  for (let n2 of kn) {
-    let t = r.get(n2);
+  let n2 = Q(s, e);
+  for (let r of In) {
+    let t = n2.get(r);
     if (t) return t;
   }
 }
-async function Gs(s, e) {
+async function Hs(s, e) {
   if (e.signal.throwIfAborted(), !K(s)) return s[0] === 9 && (s[1] & 241) === 0;
   try {
-    return cr(s, e) !== void 0;
-  } catch (r) {
-    if (e.signal.throwIfAborted(), r instanceof be && r.code === "io") return false;
-    throw r;
+    return ur(s, e) !== void 0;
+  } catch (n2) {
+    if (e.signal.throwIfAborted(), n2 instanceof be && n2.code === "io") return false;
+    throw n2;
   }
 }
-async function Hs(s, e, r) {
+async function Vs(s, e, n2) {
   if (e.signal.throwIfAborted(), s.length > e.limits.inputBytes) throw new be("resource-limit", "ssconvert input bytes limit exceeded");
-  let n2 = new Uint8Array(s), t = K(n2) ? Q(n2, e) : void 0, u = t ? kn.map((T) => t.get(T)).find((T) => T !== void 0) : n2;
+  let r = new Uint8Array(s), t = K(r) ? Q(r, e) : void 0, u = t ? In.map((T) => t.get(T)).find((T) => T !== void 0) : r;
   if (!u) throw new be("io", "E No Workbook or Book streams found.");
   let i = X(u, e);
-  (!i[0] || !Ot.has(i[0].opcode)) && n("missing BOF");
-  let h2 = C(r), g = h2 ?? 1252, a = En(i[0]), l = "1900", d = await jt(i, a, e, t), m2 = "automatic", f = 100, o = 1e-3, E = false, k = false, S = 0, A = 0, R2 = 0, B = 0, N = [], w2 = [], D = [], x = [], b = [], O = /* @__PURE__ */ new Map(), C2 = [], v = [], F = [], M = [], _ = [...bn], p = new Map(Object.entries(fr).map(([T, G]) => [Number(T), G])), c = [], I = [], L2, X2 = 0, z = 0, W = (T) => {
+  (!i[0] || !Mt.has(i[0].opcode)) && n("missing BOF");
+  let h2 = C(n2), g = h2 ?? 1252, a = An(i[0]), l = "1900", d = await zt(i, a, e, t), m2 = "automatic", f = 100, o = 1e-3, E = false, k = false, N = 0, A = 0, S = 0, B = 0, F = [], p = [], D = [], x = [], b = [], O = /* @__PURE__ */ new Map(), C2 = [], v = [], R2 = [], M = [], _ = [...En], w2 = new Map(Object.entries(lr).map(([T, G]) => [Number(T), G])), c = [], I = [], L2, X2 = 0, z = 0, W = (T) => {
     if (A += new TextEncoder().encode(T).length, A > (e.limits.workbookTextBytes ?? e.limits.inputBytes)) throw new be("resource-limit", "ssconvert BIFF text limit exceeded");
     return T;
   }, q = (T) => {
     if (e.signal.throwIfAborted(), B += T, B > (e.limits.workbookWork ?? e.limits.inputBytes * 8)) throw new be("resource-limit", "ssconvert BIFF formula work limit exceeded");
   }, Q2 = async (T, G, y = true) => {
-    if (R2 += T.data.bytes.length * 2, R2 > (e.limits.workbookTextBytes ?? e.limits.inputBytes * 2)) throw new be("resource-limit", "ssconvert BIFF metadata limit exceeded");
-    let P = Qt[T.opcode]?.join("/") ?? `opcode-0x${T.opcode.toString(16)}`;
+    if (S += T.data.bytes.length * 2, S > (e.limits.workbookTextBytes ?? e.limits.inputBytes * 2)) throw new be("resource-limit", "ssconvert BIFF metadata limit exceeded");
+    let P = Zt[T.opcode]?.join("/") ?? `opcode-0x${T.opcode.toString(16)}`;
     G.push({ source: "biff", kind: P, disposition: "retained", data: { opcode: T.opcode, offset: T.offset, bytes: Array.from(T.data.bytes, (Z) => Z.toString(16).padStart(2, "0")).join("") } }), y && await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `BIFF ${P} retained without semantic interpretation` });
   }, te = (T, G, y, P = {}) => {
     let Z = G.u16(0), j = G.u16(2);
-    if ((j > 255 || Z >= (a >= 8 ? 65536 : 16384)) && n("cell outside worksheet"), ++S > e.limits.cells) throw new be("resource-limit", "ssconvert cells limit exceeded");
+    if ((j > 255 || Z >= (a >= 8 ? 65536 : 16384)) && n("cell outside worksheet"), ++N > e.limits.cells) throw new be("resource-limit", "ssconvert cells limit exceeded");
     let U = a === 2 ? G.u8(4) & 63 : G.u16(4), V = { cell: { row: Z, column: j, value: y, ...P }, xf: U, revision: a, codepage: g };
     return T.cells.push(V), V;
   }, ie = (T, G) => {
@@ -2564,13 +2570,13 @@ async function Hs(s, e, r) {
   for (let T = 0; T < i.length; T++) {
     e.signal.throwIfAborted();
     let G = i[T], y = G.data, P = G.opcode;
-    if (Ot.has(P)) {
-      a = En(G);
-      let U = y.u16(2), V = N.find((Y) => Y.offset === G.offset), $;
+    if (Mt.has(P)) {
+      a = An(G);
+      let U = y.u16(2), V = F.find((Y) => Y.offset === G.offset), $;
       if (U === 16 || U === 64 || U === 32 && !I.length) {
-        if (w2.length >= e.limits.sheets) throw new be("resource-limit", "ssconvert sheets limit exceeded");
-        let Y = W(V?.name ?? (w2.length ? `Worksheet${w2.length + 1}` : "Worksheet"));
-        w2.some((J) => J.name === Y) && n("duplicate worksheet name"), $ = { id: Y, name: Y, offset: G.offset, visibility: V?.visibility ?? "visible", cells: [], merges: [], rows: [], columns: [], labelRanges: [], unsupportedRecords: [], view: {}, records: [], revision: a, codepage: g, groups: [], legacyExternalSheets: [], legacyExternalLinks: /* @__PURE__ */ new Map() }, w2.push($);
+        if (p.length >= e.limits.sheets) throw new be("resource-limit", "ssconvert sheets limit exceeded");
+        let Y = W(V?.name ?? (p.length ? `Worksheet${p.length + 1}` : "Worksheet"));
+        p.some((J) => J.name === Y) && n("duplicate worksheet name"), $ = { id: Y, name: Y, offset: G.offset, visibility: V?.visibility ?? "visible", cells: [], merges: [], rows: [], columns: [], labelRanges: [], unsupportedRecords: [], view: {}, records: [], revision: a, codepage: g, groups: [], legacyExternalSheets: [], legacyExternalLinks: /* @__PURE__ */ new Map() }, p.push($);
       }
       I.push({ type: U, ...$ ? { sheet: $ } : {}, revision: a }), L2 = void 0, [5, 16, 64, 256].includes(U) || await Q2(G, $?.unsupportedRecords ?? D);
       continue;
@@ -2618,14 +2624,14 @@ async function Hs(s, e, r) {
       if (P === 351 && a === 8 && j) {
         let U = [y];
         for (; i[T + 1]?.opcode === 60; ) U.push(i[++T].data);
-        for (let V of an(U, q)) j.labelRanges.push(V);
+        for (let V of fn(U, q)) j.labelRanges.push(V);
         continue;
       }
       if (P === 133) {
         let U = y.u32(0), V = y.u8(4), $ = y.u8(5), Y = y.u8(6);
         (V > 2 || U >= u.length) && n("invalid BOUNDSHEET");
         let J = new w([new h(y.slice(7, y.bytes.length - 7))], e, g), ee = W(a >= 8 ? J.unicode(Y).text : J.legacy(Y));
-        N.push({ offset: U, name: ee, type: $, visibility: V === 0 ? "visible" : V === 1 ? "hidden" : "very-hidden" });
+        F.push({ offset: U, name: ee, type: $, visibility: V === 0 ? "visible" : V === 1 ? "hidden" : "very-hidden" });
         continue;
       }
       if (P === 252) {
@@ -2644,7 +2650,7 @@ async function Hs(s, e, r) {
         let U = a >= 7 ? y.u16(0) : z++, V = a >= 4 ? 2 : 0, $ = a >= 8 ? y.u16(V) : y.u8(V), Y = V + (a >= 8 ? 2 : 1), J = ie(T, Y);
         T = J.next;
         let ee = new w(J.parts, e, g);
-        p.set(U, W(a >= 8 ? ee.unicode($).text : ee.legacy($)));
+        w2.set(U, W(a >= 8 ? ee.unicode($).text : ee.legacy($)));
         continue;
       }
       if ([224, 67, 579, 1091].includes(P)) {
@@ -2653,9 +2659,9 @@ async function Hs(s, e, r) {
       }
       if ([49, 561].includes(P)) {
         let U = y.u16(2), V = a >= 5, $ = V ? 15 : a >= 3 ? 7 : 5, Y = y.u8($ - 1), J = new w([new h(y.slice($, y.bytes.length - $))], e, g);
-        F.length === 4 && F.push(F[0]);
+        R2.length === 4 && R2.push(R2[0]);
         let ee = V ? y.u8(12) : 1, ne = { 0: h2 ?? 1252, 1: 1252, 255: 1252, 77: 1e4, 128: 932, 129: 949, 130: 1361, 134: 936, 136: 950, 161: 1253, 162: 1254, 163: 1258, 177: 1255, 178: 1256, 186: 1257, 204: 1251, 222: 874, 238: 1250 };
-        F.push({ name: W(a >= 8 ? J.unicode(Y).text : J.legacy(Y)), color: a >= 3 ? y.u16(4) : 32767, codepage: ne[ee] ?? 1252, attributes: { Unit: y.u16(0) / 20, Bold: V ? y.u16(6) >= 700 ? 1 : 0 : U & 1 ? 1 : 0, Italic: U & 2 ? 1 : 0, StrikeThrough: U & 8 ? 1 : 0, Underline: V ? { 1: 1, 2: 2, 33: 3, 34: 4 }[y.u8(10)] ?? 0 : U & 4 ? 1 : 0, Script: V ? y.u16(8) === 1 ? 1 : y.u16(8) === 2 ? -1 : 0 : 0 } });
+        R2.push({ name: W(a >= 8 ? J.unicode(Y).text : J.legacy(Y)), color: a >= 3 ? y.u16(4) : 32767, codepage: ne[ee] ?? 1252, attributes: { Unit: y.u16(0) / 20, Bold: V ? y.u16(6) >= 700 ? 1 : 0 : U & 1 ? 1 : 0, Italic: U & 2 ? 1 : 0, StrikeThrough: U & 8 ? 1 : 0, Underline: V ? { 1: 1, 2: 2, 33: 3, 34: 4 }[y.u8(10)] ?? 0 : U & 4 ? 1 : 0, Script: V ? y.u16(8) === 1 ? 1 : y.u16(8) === 2 ? -1 : 0 : 0 } });
         continue;
       }
       if (P === 146) {
@@ -2673,7 +2679,7 @@ async function Hs(s, e, r) {
           let J = new w(Y.parts, e, g), ee = W(J.unicode(y.u16(2)).text);
           if (ee === "\0") U = "local";
           else {
-            V = vt(ee);
+            V = Bt(ee);
             for (let ne = 0; ne < y.u16(0); ne++) $.push(W(J.unicode(J.word()).text));
           }
         }
@@ -2700,7 +2706,7 @@ async function Hs(s, e, r) {
         else if (V === 2) $.push(j?.name);
         else if (V === 4) $.push(null);
         else {
-          let Y = V === 58 && U === 1 && y.bytes.length === 2, J = y.slice(1, U), ee = Y ? void 0 : en(J, g, W);
+          let Y = V === 58 && U === 1 && y.bytes.length === 2, J = y.slice(1, U), ee = Y ? void 0 : tn(J, g, W);
           (j?.legacyExternalLinks ?? O).set($.length, { ...ee, addin: Y, names: [] }), $.push(void 0), Y || await Q2(G, j?.unsupportedRecords ?? D, ee === void 0);
         }
         continue;
@@ -2715,7 +2721,7 @@ async function Hs(s, e, r) {
         T = ge.next, x.push({ name: W(pe), flags: U, tokens: ge.tokens, arrays: ge.arrays, sheetIndex: ee, scopeIsWorksheet: J, revision: a, codepage: g, record: G, ...j ? { owner: j } : {} });
         continue;
       }
-      if (!lr.has(P)) {
+      if (!cr.has(P)) {
         if (P === 15) {
           j && (j.view.referenceMode = y.u16(0) ? "A1" : "R1C1");
           continue;
@@ -2739,15 +2745,15 @@ async function Hs(s, e, r) {
           else if (P === 3 || P === 515) {
             let V = y.f64(U);
             Number.isFinite(V) || n("nonfinite cell number"), te(j, y, { kind: "number", value: V });
-          } else if (P === 5 || P === 517) te(j, y, y.u8(U + 1) ? { kind: "error", value: Be[y.u8(U)] ?? "#UNKNOWN!" } : { kind: "boolean", value: !!y.u8(U) });
-          else if (P === 638) te(j, y, { kind: "number", value: An(y.u32(6)) });
+          } else if (P === 5 || P === 517) te(j, y, y.u8(U + 1) ? { kind: "error", value: Ce[y.u8(U)] ?? "#UNKNOWN!" } : { kind: "boolean", value: !!y.u8(U) });
+          else if (P === 638) te(j, y, { kind: "number", value: kn(y.u32(6)) });
           else if (P === 253) {
             let V = c[y.u32(6)];
             V || n("invalid shared string index"), te(j, y, { kind: "string", value: V.text }, V.richText ? { richText: V.richText } : {});
           } else {
             let V = P === 4 ? y.u8(7) : y.u16(6), $ = ie(T, 8);
             T = $.next;
-            let Y = M[a === 2 ? y.u8(4) & 63 : y.u16(4)], J = Y ? F[Y.revision >= 5 ? Y.data.u16(0) : Y.data.u8(0)] : void 0, ee = new w($.parts, e, J?.codepage ?? g), ne = a >= 8 ? ee.unicode(V) : { text: ee.legacy(V) };
+            let Y = M[a === 2 ? y.u8(4) & 63 : y.u16(4)], J = Y ? R2[Y.revision >= 5 ? Y.data.u16(0) : Y.data.u8(0)] : void 0, ee = new w($.parts, e, J?.codepage ?? g), ne = a >= 8 ? ee.unicode(V) : { text: ee.legacy(V) };
             te(j, y, { kind: "string", value: W(ne.text) }, ne.richText ? { richText: ne.richText } : {}), P === 214 && await Q2(G, j.unsupportedRecords);
           }
           L2 = void 0;
@@ -2758,7 +2764,7 @@ async function Hs(s, e, r) {
           (V < U || V > 255 || y.bytes.length !== 6 + (V - U + 1) * $) && n("invalid multiple-cell record");
           for (let Y = U; Y <= V; Y++) {
             let J = new Uint8Array(6), ee = new DataView(J.buffer);
-            ee.setUint16(0, y.u16(0), true), ee.setUint16(2, Y, true), ee.setUint16(4, y.u16(4 + (Y - U) * $), true), te(j, new h(J), P === 189 ? { kind: "number", value: An(y.u32(6 + (Y - U) * $)) } : { kind: "blank" });
+            ee.setUint16(0, y.u16(0), true), ee.setUint16(2, Y, true), ee.setUint16(4, y.u16(4 + (Y - U) * $), true), te(j, new h(J), P === 189 ? { kind: "number", value: kn(y.u32(6 + (Y - U) * $)) } : { kind: "blank" });
           }
           continue;
         }
@@ -2769,7 +2775,7 @@ async function Hs(s, e, r) {
             Number.isFinite(ue) || n("nonfinite formula cache"), Y = { kind: "number", value: ue };
           } else {
             let ue = y.u8(U);
-            J = ue === 0, Y = ue === 1 ? { kind: "boolean", value: !!y.u8(U + 2) } : ue === 2 ? { kind: "error", value: Be[y.u8(U + 2)] ?? "#UNKNOWN!" } : { kind: "blank" }, ue > 3 && n("invalid formula cache tag");
+            J = ue === 0, Y = ue === 1 ? { kind: "boolean", value: !!y.u8(U + 2) } : ue === 2 ? { kind: "error", value: Ce[y.u8(U + 2)] ?? "#UNKNOWN!" } : { kind: "blank" }, ue > 3 && n("invalid formula cache tag");
           }
           L2 = te(j, y, Y, { cachedResult: Y, formulaDirty: !!(y.u16(14) & 3) });
           let ee = re(T, V, $);
@@ -2780,9 +2786,9 @@ async function Hs(s, e, r) {
           if (J && ae !== 7 && ae !== 519) {
             let ue = { kind: "error", value: "MISSING STRING" };
             L2.cell = { ...L2.cell, value: ue, cachedResult: ue };
-            let Me = "";
-            for (let Je = L2.cell.column + 1; Je; Je = Math.floor((Je - 1) / 26)) Me = String.fromCharCode(65 + (Je - 1) % 26) + Me;
-            await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `EXCEL: missing STRING record for ${Me}${L2.cell.row + 1}` }), pe || (L2 = void 0);
+            let Le = "";
+            for (let et = L2.cell.column + 1; et; et = Math.floor((et - 1) / 26)) Le = String.fromCharCode(65 + (et - 1) % 26) + Le;
+            await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `EXCEL: missing STRING record for ${Le}${L2.cell.row + 1}` }), pe || (L2 = void 0);
           }
           continue;
         }
@@ -2791,7 +2797,7 @@ async function Hs(s, e, r) {
           if ((U.endRow < U.startRow || U.endColumn < U.startColumn || !L2) && n("invalid shared/array formula group"), (L2.cell.row < U.startRow || L2.cell.row > U.endRow || L2.cell.column < U.startColumn || L2.cell.column > U.endColumn || U.endRow >= (a >= 8 ? 65536 : 16384)) && n("invalid shared/array formula group"), ++X2 > e.limits.operations) throw new be("resource-limit", "ssconvert BIFF formula group limit exceeded");
           if (P === 54 || P === 55 || P === 566) {
             (a === 2 != (P !== 566) || U.startRow < 1 || U.startColumn < 1 || L2.cell.row !== U.startRow || L2.cell.column !== U.startColumn) && n("invalid data-table anchor or version");
-            let J = rn(y, a, P);
+            let J = sn(y, a, P);
             J === void 0 && await Q2(G, j.unsupportedRecords), j.groups.push({ id: `biff-${j.offset}-${G.offset}`, kind: "table", range: U, tokens: Uint8Array.of(2), arrays: [], ...J === void 0 ? {} : { expression: J }, keyRow: U.startRow, keyColumn: U.startColumn });
             continue;
           }
@@ -2856,7 +2862,7 @@ async function Hs(s, e, r) {
           Number.isFinite(U) || n("invalid print margin"), j.view[["marginLeft", "marginRight", "marginTop", "marginBottom"][P - 38]] = U, await Q2(G, j.unsupportedRecords, false);
           continue;
         }
-        if (un.has(P)) {
+        if (dn.has(P)) {
           await Q2(G, j.unsupportedRecords, false);
           continue;
         }
@@ -2865,29 +2871,29 @@ async function Hs(s, e, r) {
     }
   }
   I.length && n("missing EOF");
-  for (let T of N) i.some((G) => G.offset === T.offset && Ot.has(G.opcode)) || n("BOUNDSHEET offset is not a BOF"), T.type === 0 && !w2.some((G) => G.offset === T.offset) && n("missing declared worksheet");
-  w2.sort((T, G) => {
-    let y = N.findIndex((Z) => Z.offset === T.offset), P = N.findIndex((Z) => Z.offset === G.offset);
+  for (let T of F) i.some((G) => G.offset === T.offset && Mt.has(G.opcode)) || n("BOUNDSHEET offset is not a BOF"), T.type === 0 && !p.some((G) => G.offset === T.offset) && n("missing declared worksheet");
+  p.sort((T, G) => {
+    let y = F.findIndex((Z) => Z.offset === T.offset), P = F.findIndex((Z) => Z.offset === G.offset);
     return y < 0 || P < 0 ? T.offset - G.offset : y - P;
   });
   let oe = v.map((T) => {
     if (C2[T.book]?.kind !== "local") return;
-    let G = w2[T.first]?.name, y = w2[T.last]?.name;
+    let G = p[T.first]?.name, y = p[T.last]?.name;
     if (!(G === void 0 || y === void 0)) return T.first === T.last ? G : [G, y];
-  }), he = v.map((T) => C2[T.book]?.kind !== "local" ? void 0 : T.first >= 65534 ? null : w2[T.first]?.name), Se = v.map((T) => {
+  }), he = v.map((T) => C2[T.book]?.kind !== "local" ? void 0 : T.first >= 65534 ? null : p[T.first]?.name), Se = v.map((T) => {
     let G = C2[T.book], y = G?.sheets[T.first], P = G?.sheets[T.last];
     return G?.workbook === void 0 || y === void 0 || P === void 0 ? void 0 : { workbook: G.workbook, first: y, last: P };
-  }), _e = v.map((T) => C2[T.book]?.kind === "local" && (T.first === 65535 || T.last === 65535)), de = v.map((T) => C2[T.book]?.kind === "external"), Pe = w2.map((T) => T.name), Ne = x.map((T) => {
-    if (T.sheetIndex) return (T.scopeIsWorksheet ? w2[T.sheetIndex - 1]?.name : (T.owner?.legacyExternalSheets ?? b)[T.sheetIndex - 1]) ?? void 0;
-  }), xt = /* @__PURE__ */ new Map(), Mt = x.map((T) => T.name), qe = new lt(e, w2), Qe = /* @__PURE__ */ new WeakSet(), yt = (T, G, y, P, Z = 0, j = 0, U, V = false, $ = qe.resolve, Y = false) => {
-    let J = nn(G ?? [], y, P, { ...e, limits: { ...e.limits, workbookTextBytes: (e.limits.workbookTextBytes ?? e.limits.inputBytes) - A } }, q);
-    return ot(T, { revision: y, codepage: P, row: Z, column: j, accountWork: q, ...J, readArray() {
+  }), Pe = v.map((T) => C2[T.book]?.kind === "local" && (T.first === 65535 || T.last === 65535)), de = v.map((T) => C2[T.book]?.kind === "external"), Ge = p.map((T) => T.name), Ne = x.map((T) => {
+    if (T.sheetIndex) return (T.scopeIsWorksheet ? p[T.sheetIndex - 1]?.name : (T.owner?.legacyExternalSheets ?? b)[T.sheetIndex - 1]) ?? void 0;
+  }), yt = /* @__PURE__ */ new Map(), Lt = x.map((T) => T.name), Qe = new ct(e, p), Ze = /* @__PURE__ */ new WeakSet(), bt = (T, G, y, P, Z = 0, j = 0, U, V = false, $ = Qe.resolve, Y = false) => {
+    let J = rn(G ?? [], y, P, { ...e, limits: { ...e.limits, workbookTextBytes: (e.limits.workbookTextBytes ?? e.limits.inputBytes) - A } }, q);
+    return at(T, { revision: y, codepage: P, row: Z, column: j, accountWork: q, ...J, readArray() {
       let ee = J.readArray();
-      return Qe.add(T), ee;
-    }, names: Mt, resolveName: $, externalSheets: y >= 8 ? oe : U?.legacyExternalSheets ?? b, ...U ? { currentSheet: U.name } : {}, shared: V, globalNameDefinition: Y, localSheets: Pe, nameSheets: Ne, deletedExternalSheets: _e, unavailableExternalSheets: de, externalNameSheets: he, externalWorkbooks: y >= 8 ? Se : Dt.get(U), externalNames: y >= 8 ? Tn : Lt.get(U), limit: e.limits.workbookWork ?? e.limits.inputBytes * 8 });
-  }, In = [...C2.filter((T) => T.kind !== "local").map((T) => T.names), ...[O, ...w2.map((T) => T.legacyExternalLinks)].flatMap((T) => [...T.values()].filter((G) => G.addin).map((G) => G.names))], Rn = new Map(x.filter((T) => T.sheetIndex === 0).map((T) => [T.name, T])), Fn = new Map(C2.filter((T) => T.kind === "external").map((T) => [T.names, T]));
-  for (let T of In) {
-    let G = [], y = Fn.get(T);
+      return Ze.add(T), ee;
+    }, names: Lt, resolveName: $, externalSheets: y >= 8 ? oe : U?.legacyExternalSheets ?? b, ...U ? { currentSheet: U.name } : {}, shared: V, globalNameDefinition: Y, localSheets: Ge, nameSheets: Ne, deletedExternalSheets: Pe, unavailableExternalSheets: de, externalNameSheets: he, externalWorkbooks: y >= 8 ? Se : _t.get(U), externalNames: y >= 8 ? Sn : Dt.get(U), limit: e.limits.workbookWork ?? e.limits.inputBytes * 8 });
+  }, Rn = [...C2.filter((T) => T.kind !== "local").map((T) => T.names), ...[O, ...p.map((T) => T.legacyExternalLinks)].flatMap((T) => [...T.values()].filter((G) => G.addin).map((G) => G.names))], Fn = new Map(x.filter((T) => T.sheetIndex === 0).map((T) => [T.name, T])), Tn = new Map(C2.filter((T) => T.kind === "external").map((T) => [T.names, T]));
+  for (let T of Rn) {
+    let G = [], y = Tn.get(T);
     for (let P of T) {
       if (!P.supported) {
         G.push({ name: P.name });
@@ -2902,7 +2908,7 @@ async function Hs(s, e, r) {
         G.push(P.sheetIndex && j === void 0 ? void 0 : { name: P.name, workbook: y.workbook, ...j === void 0 ? {} : { sheet: j } });
         continue;
       }
-      let Z = Rn.get(P.name);
+      let Z = Fn.get(P.name);
       if (Z && Z.record.offset < P.record.offset) {
         if (!(Z.tokens.length === 0 || Z.tokens.length === 2 && Z.tokens[0] === 28 && Z.tokens[1] === 29)) {
           G.push(void 0);
@@ -2911,55 +2917,55 @@ async function Hs(s, e, r) {
         Z.tokens = P.tokens, Z.arrays = P.arrays ?? [], Z.revision = P.revision, Z.codepage = P.codepage, G.push({ name: P.name, expression: "=[]" + P.name });
       } else G.push({ name: P.name, expression: "=#REF!" });
     }
-    xt.set(T, G);
+    yt.set(T, G);
   }
-  let Tn = v.map((T) => {
+  let Sn = v.map((T) => {
     let G = C2[T.book];
-    return G ? xt.get(G.names) : void 0;
-  }), Lt = /* @__PURE__ */ new Map(), Dt = /* @__PURE__ */ new Map();
-  for (let T of [void 0, ...w2]) {
+    return G ? yt.get(G.names) : void 0;
+  }), Dt = /* @__PURE__ */ new Map(), _t = /* @__PURE__ */ new Map();
+  for (let T of [void 0, ...p]) {
     let G = T?.legacyExternalLinks ?? O, y = T?.legacyExternalSheets ?? b;
-    Dt.set(T, y.map((P, Z) => {
+    _t.set(T, y.map((P, Z) => {
       let j = G.get(Z);
       return j?.workbook !== void 0 && j.sheet !== void 0 ? { workbook: j.workbook, first: j.sheet, last: j.sheet } : void 0;
-    })), Lt.set(T, y.map((P, Z) => {
+    })), Dt.set(T, y.map((P, Z) => {
       let j = G.get(Z);
-      if (j) return j.addin ? xt.get(j.names) : j.names.map((U) => {
+      if (j) return j.addin ? yt.get(j.names) : j.names.map((U) => {
         if (!U.supported || j.workbook === void 0 || j.sheet !== void 0) return { name: U.name };
         let V = U.sheetIndex ? G.get(U.sheetIndex - 1) : void 0;
         if (!(U.sheetIndex && (U.sheetIndex > Z || V?.workbook !== j.workbook || V?.sheet === void 0))) return { name: U.name, workbook: j.workbook, ...V?.sheet === void 0 ? {} : { sheet: V.sheet } };
       });
     }));
   }
-  let Ze = [];
+  let Je = [];
   for (let [T, G] of x.entries()) {
     G.sheetIndex && Ne[T] === void 0 && n("invalid name sheet scope");
     try {
-      qe.define(T + 1, G.name, Ne[T], (y) => G.tokens.length ? yt(G.tokens, G.arrays, G.revision, G.codepage, 0, 0, G.owner, false, y, !G.sheetIndex) : "=#NAME?");
+      Qe.define(T + 1, G.name, Ne[T], (y) => G.tokens.length ? bt(G.tokens, G.arrays, G.revision, G.codepage, 0, 0, G.owner, false, y, !G.sheetIndex) : "=#NAME?");
     } catch (y) {
       if (!(y instanceof be) || y.code !== "unsupported-feature") throw y;
       await Q2(G.record, D, false), D.push({ source: "biff", kind: "untranslated-name", disposition: "retained", data: { name: G.name } }), await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: y.message });
     }
   }
-  let bt = qe.finish();
-  for (let T of bt.defaults) Mt.push(T.name), Ne.push(T.sheet);
-  for (let T of bt.indices) {
+  let Et = Qe.finish();
+  for (let T of Et.defaults) Lt.push(T.name), Ne.push(T.sheet);
+  for (let T of Et.indices) {
     let G = T - 1, y = x[G];
-    Ze.push({ name: y.name, expression: W(qe.expression(G + 1)), ...Qe.has(y.tokens) ? { arrayStringLiterals: true } : {}, ...y.sheetIndex ? { sheet: Ne[G] ?? n("invalid name sheet scope") } : {} });
+    Je.push({ name: y.name, expression: W(Qe.expression(G + 1)), ...Ze.has(y.tokens) ? { arrayStringLiterals: true } : {}, ...y.sheetIndex ? { sheet: Ne[G] ?? n("invalid name sheet scope") } : {} });
   }
-  for (let T of bt.defaults) W(T.name), W(T.expression), Ze.push(T);
+  for (let T of Et.defaults) W(T.name), W(T.expression), Je.push(T);
   let Re = (T) => {
-    let G = T === 32767 || T === 64 ? "000000" : T === 65 ? "FFFFFF" : T < 8 ? bn[T] ?? "000000" : _[T - 8] ?? "000000";
+    let G = T === 32767 || T === 64 ? "000000" : T === 65 ? "FFFFFF" : T < 8 ? En[T] ?? "000000" : _[T - 8] ?? "000000";
     return [0, 2, 4].map((y) => {
       let P = G.slice(y, y + 2);
       return P === "00" ? "0" : (P + P).toUpperCase();
     }).join(":");
-  }, Sn = (T) => {
+  }, Nn = (T) => {
     let G = M[T];
     if (!G) return {};
     let y = G.data, P = G.revision < 5;
     y.check(0, P ? G.revision >= 3 ? 12 : 4 : G.revision >= 8 ? 20 : 16);
-    let Z = F[P ? y.u8(0) : y.u16(0)], j = p.get(P ? G.revision >= 3 ? y.u8(1) : y.u8(2) & 63 : y.u16(2)) ?? "General", U = P ? G.revision >= 3 ? y.u8(2) : y.u8(1) >> 6 : y.u16(4), V = y.u8(P ? G.revision >= 3 ? 4 : 3 : 6), $ = { Locked: U & 1 ? 1 : 0, Hidden: U & 2 ? 1 : 0, WrapText: V & 8 ? 1 : 0, HAlign: ["GNM_HALIGN_GENERAL", "GNM_HALIGN_LEFT", "GNM_HALIGN_CENTER", "GNM_HALIGN_RIGHT", "GNM_HALIGN_FILL", "GNM_HALIGN_JUSTIFY", "GNM_HALIGN_CENTER_ACROSS_SELECTION", "GNM_HALIGN_DISTRIBUTED"][V & 7], VAlign: ["GNM_VALIGN_TOP", "GNM_VALIGN_CENTER", "GNM_VALIGN_BOTTOM", "GNM_VALIGN_JUSTIFY", "GNM_VALIGN_DISTRIBUTED"][V >> 4 & 7] ?? "GNM_VALIGN_BOTTOM", Fore: Re(Z?.color ?? 32767) };
+    let Z = R2[P ? y.u8(0) : y.u16(0)], j = w2.get(P ? G.revision >= 3 ? y.u8(1) : y.u8(2) & 63 : y.u16(2)) ?? "General", U = P ? G.revision >= 3 ? y.u8(2) : y.u8(1) >> 6 : y.u16(4), V = y.u8(P ? G.revision >= 3 ? 4 : 3 : 6), $ = { Locked: U & 1 ? 1 : 0, Hidden: U & 2 ? 1 : 0, WrapText: V & 8 ? 1 : 0, HAlign: ["GNM_HALIGN_GENERAL", "GNM_HALIGN_LEFT", "GNM_HALIGN_CENTER", "GNM_HALIGN_RIGHT", "GNM_HALIGN_FILL", "GNM_HALIGN_JUSTIFY", "GNM_HALIGN_CENTER_ACROSS_SELECTION", "GNM_HALIGN_DISTRIBUTED"][V & 7], VAlign: ["GNM_VALIGN_TOP", "GNM_VALIGN_CENTER", "GNM_VALIGN_BOTTOM", "GNM_VALIGN_JUSTIFY", "GNM_VALIGN_DISTRIBUTED"][V >> 4 & 7] ?? "GNM_VALIGN_BOTTOM", Fore: Re(Z?.color ?? 32767) };
     if (G.revision >= 8) {
       let J = y.u8(7), ee = y.u8(8), ne = y.u16(18);
       $.Rotation = J === 255 ? -1 : J > 90 ? 450 - J : J, $.Indent = ee & 15, $.ShrinkToFit = ee & 16 ? 1 : 0, $.PatternColor = Re(ne & 127), $.Back = Re(ne >> 7 & 127), $.Shade = y.u32(14) >>> 26;
@@ -2974,8 +2980,8 @@ async function Hs(s, e, r) {
     if (G.revision >= 8) {
       let J = y.u16(10), ee = y.u16(12), ne = y.u32(14);
       for (let [ge, ae, ue] of [["Left", 0, ee & 127], ["Right", 4, ee >> 7 & 127], ["Top", 8, ne & 127], ["Bottom", 12, ne >>> 7 & 127]]) {
-        let Me = J >> ae & 15;
-        Me && Y.push(fe(ge, { Style: Me, Color: Re(ue) }));
+        let Le = J >> ae & 15;
+        Le && Y.push(fe(ge, { Style: Le, Color: Re(ue) }));
       }
       let pe = ne >>> 21 & 15;
       pe && ee & 16384 && Y.push(fe("Diagonal", { Style: pe, Color: Re(ne >>> 14 & 127) })), pe && ee & 32768 && Y.push(fe("RevDiagonal", { Style: pe, Color: Re(ne >>> 14 & 127) }));
@@ -2984,13 +2990,13 @@ async function Hs(s, e, r) {
       for (let [pe, ge, ae] of [["Bottom", J >> 6 & 7, J >> 9 & 127], ["Top", ee & 7, ee >> 9 & 127], ["Left", ee >> 3 & 7, ne & 127], ["Right", ee >> 6 & 7, ne >> 7 & 127]]) ge && Y.push(fe(pe, { Style: ge, Color: Re(ae) }));
     }
     return { format: j, style: { biff: { xf: T, revision: G.revision }, gnumeric: fe("Style", $, "", [...Z ? [fe("Font", Z.attributes, Z.name)] : [], ...Y.length ? [fe("StyleBorder", {}, "", Y)] : []]) } };
-  }, _t = [], Et;
-  for (let T of w2) {
-    let G = dn(T.records, T.revision, T.codepage, e);
-    T.unsupportedRecords.push(...G.records), Object.assign(T.view, G.view), G.active && (Et = T.id);
+  }, Pt = [], At;
+  for (let T of p) {
+    let G = mn(T.records, T.revision, T.codepage, e);
+    T.unsupportedRecords.push(...G.records), Object.assign(T.view, G.view), G.active && (At = T.id);
     let y = [], P = [];
     for (let Z of T.groups) try {
-      P.push({ id: Z.id, kind: Z.kind === "table" ? "array" : Z.kind, range: Z.range, expression: W(Z.expression ?? yt(Z.tokens, Z.arrays, T.revision, T.codepage, Z.range.startRow, Z.range.startColumn, T, Z.kind === "shared")), ...Qe.has(Z.tokens) ? { arrayStringLiterals: true } : {} });
+      P.push({ id: Z.id, kind: Z.kind === "table" ? "array" : Z.kind, range: Z.range, expression: W(Z.expression ?? bt(Z.tokens, Z.arrays, T.revision, T.codepage, Z.range.startRow, Z.range.startColumn, T, Z.kind === "shared")), ...Ze.has(Z.tokens) ? { arrayStringLiterals: true } : {} });
     } catch (j) {
       if (!(j instanceof be) || j.code !== "unsupported-feature") throw j;
       await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: j.message });
@@ -3005,34 +3011,34 @@ async function Hs(s, e, r) {
           let ne = new h(U), pe = ne.u16(1), ge = Z.revision >= 3 ? ne.u16(3) : ne.u8(3), ae = T.groups.find((ue) => ue.keyRow === pe && ue.keyColumn === ge && ue.kind === "table" == (U[0] === 2));
           ae || n(U[0] === 2 ? "unresolved data-table formula" : "unresolved shared/array formula"), (j.row < ae.range.startRow || j.row > ae.range.endRow || j.column < ae.range.startColumn || j.column > ae.range.endColumn) && n("formula outside group range"), U = ae.tokens, V = ae.arrays, ee = ae.expression, J = ae.kind === "shared", P.some((ue) => ue.id === ae.id) && (j = { ...j, formulaGroup: ae.id }), ae.kind !== "shared" && ($ = ae.range.startRow, Y = ae.range.startColumn);
         }
-        j = { ...j, formula: W(ee ?? yt(U, V, Z.revision, Z.codepage, $, Y, T, J)), ...Qe.has(U) ? { arrayStringLiterals: true } : {} };
+        j = { ...j, formula: W(ee ?? bt(U, V, Z.revision, Z.codepage, $, Y, T, J)), ...Ze.has(U) ? { arrayStringLiterals: true } : {} };
       } catch (U) {
         if (!(U instanceof be) || U.code !== "unsupported-feature") throw U;
         T.unsupportedRecords.push({ source: "biff", kind: "untranslated-formula", disposition: "retained", data: { row: j.row, column: j.column, tokens: Array.from(Z.tokens, (V) => V.toString(16).padStart(2, "0")).join("") } }), await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: U.message });
       }
-      y.push({ ...j, ...Sn(Z.xf) });
+      y.push({ ...j, ...Nn(Z.xf) });
     }
-    _t.push({ id: T.id, name: T.name, cells: y, visibility: T.visibility, size: { rows: T.cells.some((Z) => Z.revision >= 8) || a >= 8 ? 65536 : 16384, columns: 256 }, ...T.merges.length ? { merges: T.merges } : {}, ...T.rows.length ? { rows: T.rows } : {}, ...T.columns.length ? { columns: T.columns } : {}, ...Object.keys(T.view).length ? { view: T.view } : {}, ...P.length ? { formulaGroups: P } : {}, ...T.labelRanges.length ? { labelRanges: T.labelRanges } : {}, ...T.unsupportedRecords.length ? { unsupportedRecords: T.unsupportedRecords } : {} });
+    Pt.push({ id: T.id, name: T.name, cells: y, visibility: T.visibility, size: { rows: T.cells.some((Z) => Z.revision >= 8) || a >= 8 ? 65536 : 16384, columns: 256 }, ...T.merges.length ? { merges: T.merges } : {}, ...T.rows.length ? { rows: T.rows } : {}, ...T.columns.length ? { columns: T.columns } : {}, ...Object.keys(T.view).length ? { view: T.view } : {}, ...P.length ? { formulaGroups: P } : {}, ...T.labelRanges.length ? { labelRanges: T.labelRanges } : {}, ...T.unsupportedRecords.length ? { unsupportedRecords: T.unsupportedRecords } : {} });
   }
-  let Pt = d ?? t;
+  let Gt = d ?? t;
   for (let [T, G] of d ?? []) if (!["SUMMARYINFORMATION", "DOCUMENTSUMMARYINFORMATION"].includes(T.toUpperCase())) {
-    if (q(G.length * 2), R2 += G.length * 2, R2 > (e.limits.workbookTextBytes ?? e.limits.inputBytes * 2)) throw new be("resource-limit", "ssconvert BIFF metadata byte limit exceeded");
+    if (q(G.length * 2), S += G.length * 2, S > (e.limits.workbookTextBytes ?? e.limits.inputBytes * 2)) throw new be("resource-limit", "ssconvert BIFF metadata byte limit exceeded");
     D.push({ source: "biff", kind: "encrypted-ancillary", disposition: "retained", data: { stream: W(T), bytes: W(Array.from(G, (y) => y.toString(16).padStart(2, "0")).join("")) } }), await e.diagnostic?.({ code: "biff-loss-warning", severity: "warning", message: `BIFF encrypted ancillary stream ${T} retained without interpretation` });
   }
-  let Gt = Pt ? await Xe(Pt, e, W, q, D) : {};
-  return { sheets: _t, dateSystem: l, calculationMode: m2, automaticLabelLookup: k, iteration: { enabled: E, maximum: f, tolerance: o }, ...Object.keys(Gt).length ? { properties: Gt } : {}, ...Et === void 0 ? {} : { activeSheet: Et }, ...Ze.length ? { names: Ze } : {}, ...D.length ? { unsupportedRecords: D } : {} };
+  let Ht = Gt ? await We(Gt, e, W, q, D) : {};
+  return { sheets: Pt, dateSystem: l, calculationMode: m2, automaticLabelLookup: k, iteration: { enabled: E, maximum: f, tolerance: o }, ...Object.keys(Ht).length ? { properties: Ht } : {}, ...At === void 0 ? {} : { activeSheet: At }, ...Je.length ? { names: Je } : {}, ...D.length ? { unsupportedRecords: D } : {} };
 }
-function An(s) {
+function kn(s) {
   let e;
   if (s & 2) e = s >> 2;
   else {
-    let r = new Uint8Array(8), n2 = new DataView(r.buffer);
-    n2.setUint32(4, s & 4294967292, true), e = n2.getFloat64(0, true);
+    let n2 = new Uint8Array(8), r = new DataView(n2.buffer);
+    r.setUint32(4, s & 4294967292, true), e = r.getFloat64(0, true);
   }
   return Number.isFinite(e) || n("nonfinite RK number"), s & 1 ? e / 100 : e;
 }
 export {
-  Ps as createBiffWriter,
-  Gs as probeBiff,
-  Hs as readBiff
+  Gs as createBiffWriter,
+  Hs as probeBiff,
+  Vs as readBiff
 };