@fileverse-dev/dsheet 2.0.36-rtc-8 → 2.0.36-shortcut

package/dist/{xlsx-export-impl-CRw27cg1.js → xlsx-export-impl-BLKOiPKJ.js}

@@ -2,8 +2,7 @@ import { utils as dt, write as Nt } from "xlsx-js-style";
 import { Workbook as Pt } from "exceljs";
 import { toast as Ut } from "@fileverse/ui";
 import { addFortuneImagesToWorksheet as Lt } from "./xlsx-image-utils-Cvg0qxRA.js";
-import { g as jt, c as xt } from "./executeStringFunction-F9mb-SpN.js";
-import { c as Ct } from "./index-CpskXdSI.js";
+import { g as jt, c as xt } from "./executeStringFunction-6r6Tl4Z6.js";
 import { c as zt, g as Wt } from "./xlsx-hyperlink-inline-DzewAypN.js";
 const Mt = {
   1: "thin",
@@ -19,33 +18,33 @@ const Mt = {
   11: "mediumDashDotDot",
   12: "slantDashDot",
   13: "thick"
-}, Zt = (j) => {
-  if (typeof j != "string") return "000000";
-  const q = j.replace("#", "").toUpperCase();
-  return q.length === 3 ? q.replace(/(.)/g, "$1$1") : q.length === 6 ? q : "000000";
-}, vt = (j, q) => {
-  const s = Number(j);
+}, Zt = (L) => {
+  if (typeof L != "string") return "000000";
+  const K = L.replace("#", "").toUpperCase();
+  return K.length === 3 ? K.replace(/(.)/g, "$1$1") : K.length === 6 ? K : "000000";
+}, vt = (L, K) => {
+  const s = Number(L);
   if (s)
     return {
       style: Mt[s] ?? "thin",
-      color: { rgb: Zt(q) }
+      color: { rgb: Zt(K) }
     };
-}, _t = (j, q, s, C, c) => {
+}, _t = (L, K, s, C, c) => {
   if (!c || !C.l && !C.r && !C.t && !C.b) return;
-  const o = dt.encode_cell({ r: q, c: s }), a = {
-    ...j[o] || { t: "z" }
+  const o = dt.encode_cell({ r: K, c: s }), a = {
+    ...L[o] || { t: "z" }
   }, r = { ...a.s || {} }, l = { ...r.border || {} };
-  C.l && (l.left = c), C.r && (l.right = c), C.t && (l.top = c), C.b && (l.bottom = c), r.border = l, a.s = r, j[o] = a;
-}, $t = (j, q) => {
-  q.forEach((s) => {
+  C.l && (l.left = c), C.r && (l.right = c), C.t && (l.top = c), C.b && (l.bottom = c), r.border = l, a.s = r, L[o] = a;
+}, $t = (L, K) => {
+  K.forEach((s) => {
     if (s.rangeType === "cell") {
       if (!s.value) return;
       const { row_index: C, col_index: c } = s.value;
       if (C == null || c == null) return;
       const o = s.value, a = dt.encode_cell({ r: C, c }), r = {
-        ...j[a] || { t: "z" }
+        ...L[a] || { t: "z" }
       }, l = { ...r.s || {} }, d = { ...l.border || {} };
-      o.l && (d.left = vt(o.l.style, o.l.color)), o.r && (d.right = vt(o.r.style, o.r.color)), o.t && (d.top = vt(o.t.style, o.t.color)), o.b && (d.bottom = vt(o.b.style, o.b.color)), l.border = d, r.s = l, j[a] = r;
+      o.l && (d.left = vt(o.l.style, o.l.color)), o.r && (d.right = vt(o.r.style, o.r.color)), o.t && (d.top = vt(o.t.style, o.t.color)), o.b && (d.bottom = vt(o.b.style, o.b.color)), l.border = d, r.s = l, L[a] = r;
     } else if (s.rangeType === "range") {
       const { borderType: C, style: c, color: o, range: a } = s;
       if (C === "border-none" || !Array.isArray(a) || !c)
@@ -59,7 +58,7 @@ const Mt = {
             switch (C) {
               case "border-all":
                 _t(
-                  j,
+                  L,
                   n,
                   p,
                   { l: !0, r: !0, t: !0, b: !0 },
@@ -68,7 +67,7 @@ const Mt = {
                 break;
               case "border-outside":
                 _t(
-                  j,
+                  L,
                   n,
                   p,
                   { l: p === g, r: p === y, t: n === d, b: n === v },
@@ -77,7 +76,7 @@ const Mt = {
                 break;
               case "border-inside":
                 _t(
-                  j,
+                  L,
                   n,
                   p,
                   { r: p < y, b: n < v },
@@ -85,64 +84,64 @@ const Mt = {
                 );
                 break;
               case "border-horizontal":
-                _t(j, n, p, { b: n < v }, r);
+                _t(L, n, p, { b: n < v }, r);
                 break;
               case "border-vertical":
-                _t(j, n, p, { r: p < y }, r);
+                _t(L, n, p, { r: p < y }, r);
                 break;
               case "border-left":
-                p === g && _t(j, n, p, { l: !0 }, r);
+                p === g && _t(L, n, p, { l: !0 }, r);
                 break;
               case "border-right":
-                p === y && _t(j, n, p, { r: !0 }, r);
+                p === y && _t(L, n, p, { r: !0 }, r);
                 break;
               case "border-top":
-                n === d && _t(j, n, p, { t: !0 }, r);
+                n === d && _t(L, n, p, { t: !0 }, r);
                 break;
               case "border-bottom":
-                n === v && _t(j, n, p, { b: !0 }, r);
+                n === v && _t(L, n, p, { b: !0 }, r);
                 break;
             }
       });
     }
   });
 };
-function Et(j) {
-  if (!j || typeof j != "string") return null;
-  const q = j.trim();
-  if (q.startsWith("#")) {
-    const C = q.replace("#", "").toUpperCase();
+function Et(L) {
+  if (!L || typeof L != "string") return null;
+  const K = L.trim();
+  if (K.startsWith("#")) {
+    const C = K.replace("#", "").toUpperCase();
     return C.length === 3 ? "FF" + C.split("").map((c) => c + c).join("") : C.length === 6 ? "FF" + C : null;
   }
-  const s = q.match(/rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)/i);
+  const s = K.match(/rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)/i);
   if (s) {
     const C = (c) => Math.min(255, Math.max(0, Math.round(c))).toString(16).padStart(2, "0").toUpperCase();
     return "FF" + C(parseFloat(s[1])) + C(parseFloat(s[2])) + C(parseFloat(s[3]));
   }
   return null;
 }
-function Ht(j) {
-  const q = {}, s = {};
-  if (j.textColor && j.textColor.toLowerCase() !== "#000000") {
-    const c = Et(j.textColor);
+function Ht(L) {
+  const K = {}, s = {};
+  if (L.textColor && L.textColor.toLowerCase() !== "#000000") {
+    const c = Et(L.textColor);
     c && (s.color = { argb: c });
   }
-  j.bold && (s.bold = !0), j.italic && (s.italic = !0), j.underline && (s.underline = !0), j.strikethrough && (s.strike = !0), Object.keys(s).length > 0 && (q.font = s);
-  const C = j.cellColor;
+  L.bold && (s.bold = !0), L.italic && (s.italic = !0), L.underline && (s.underline = !0), L.strikethrough && (s.strike = !0), Object.keys(s).length > 0 && (K.font = s);
+  const C = L.cellColor;
   if (C && C.toLowerCase() !== "#ffffff") {
     const c = Et(C);
-    c && (q.fill = { type: "pattern", pattern: "solid", fgColor: { argb: c } });
+    c && (K.fill = { type: "pattern", pattern: "solid", fgColor: { argb: c } });
   }
-  return q;
+  return K;
 }
-function Vt(j) {
-  return !Array.isArray(j) || j.length === 0 ? "" : j.map((s) => {
+function Vt(L) {
+  return !Array.isArray(L) || L.length === 0 ? "" : L.map((s) => {
     const [C, c] = s.row, [o, a] = s.column, r = dt.encode_cell({ r: C, c: o }), l = dt.encode_cell({ r: c, c: a });
     return r === l ? r : `${r}:${l}`;
   }).filter(Boolean).join(" ");
 }
-function Gt(j, q, s) {
-  const { conditionName: C, conditionValue: c = [], format: o = {} } = j, a = Ht(o), r = (d) => d.replace(/"/g, '""'), l = q.split(/[\s:]/)[0];
+function Gt(L, K, s) {
+  const { conditionName: C, conditionValue: c = [], format: o = {} } = L, a = Ht(o), r = (d) => d.replace(/"/g, '""'), l = K.split(/[\s:]/)[0];
   switch (C) {
     case "greaterThan":
     case "greaterThanOrEqual":
@@ -388,9 +387,9 @@ function Gt(j, q, s) {
       return null;
   }
 }
-function Yt(j, q, s) {
+function qt(L, K, s) {
   var a;
-  const C = q.luckysheet_conditionformat_save, c = [];
+  const C = K.luckysheet_conditionformat_save, c = [];
   if (!Array.isArray(C) || C.length === 0)
     return { nextPriority: s, pendingDuplicateValues: c };
   let o = s;
@@ -409,10 +408,13 @@ function Yt(j, q, s) {
       continue;
     }
     const d = Gt(r, l, o);
-    d && (j.addConditionalFormatting({ ref: l, rules: [d] }), o++);
+    d && (L.addConditionalFormatting({ ref: l, rules: [d] }), o++);
   }
   return { nextPriority: o, pendingDuplicateValues: c };
 }
+function Ct(L) {
+  throw new Error('Could not dynamically require "' + L + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+}
 var Ot = { exports: {} };
 /*!
 
@@ -425,9 +427,9 @@ Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/js
 JSZip uses the library pako released under the MIT license :
 https://github.com/nodeca/pako/blob/main/LICENSE
 */
-(function(j, q) {
+(function(L, K) {
   (function(s) {
-    j.exports = s();
+    L.exports = s();
   })(function() {
     return function s(C, c, o) {
       function a(d, v) {
@@ -540,8 +542,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return h;
       }
       function a(n, p, i, h, u, _) {
-        var k, A, S = n.file, L = n.compression, O = _ !== d.utf8encode, D = r.transformTo("string", _(S.name)), I = r.transformTo("string", d.utf8encode(S.name)), H = S.comment, Y = r.transformTo("string", _(H)), b = r.transformTo("string", d.utf8encode(H)), R = I.length !== S.name.length, e = b.length !== H.length, F = "", Q = "", M = "", et = S.dir, U = S.date, K = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
-        p && !i || (K.crc32 = n.crc32, K.compressedSize = n.compressedSize, K.uncompressedSize = n.uncompressedSize);
+        var k, A, S = n.file, j = n.compression, O = _ !== d.utf8encode, D = r.transformTo("string", _(S.name)), I = r.transformTo("string", d.utf8encode(S.name)), H = S.comment, q = r.transformTo("string", _(H)), b = r.transformTo("string", d.utf8encode(H)), R = I.length !== S.name.length, e = b.length !== H.length, F = "", Q = "", M = "", et = S.dir, U = S.date, Y = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+        p && !i || (Y.crc32 = n.crc32, Y.compressedSize = n.compressedSize, Y.uncompressedSize = n.uncompressedSize);
         var E = 0;
         p && (E |= 8), O || !R && !e || (E |= 2048);
         var w = 0, N = 0;
@@ -550,10 +552,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           return B || (rt = it ? 16893 : 33204), (65535 & rt) << 16;
         }(S.unixPermissions, et)) : (N = 20, w |= function(B) {
           return 63 & (B || 0);
-        }(S.dosPermissions)), k = U.getUTCHours(), k <<= 6, k |= U.getUTCMinutes(), k <<= 5, k |= U.getUTCSeconds() / 2, A = U.getUTCFullYear() - 1980, A <<= 4, A |= U.getUTCMonth() + 1, A <<= 5, A |= U.getUTCDate(), R && (Q = o(1, 1) + o(v(D), 4) + I, F += "up" + o(Q.length, 2) + Q), e && (M = o(1, 1) + o(v(Y), 4) + b, F += "uc" + o(M.length, 2) + M);
+        }(S.dosPermissions)), k = U.getUTCHours(), k <<= 6, k |= U.getUTCMinutes(), k <<= 5, k |= U.getUTCSeconds() / 2, A = U.getUTCFullYear() - 1980, A <<= 4, A |= U.getUTCMonth() + 1, A <<= 5, A |= U.getUTCDate(), R && (Q = o(1, 1) + o(v(D), 4) + I, F += "up" + o(Q.length, 2) + Q), e && (M = o(1, 1) + o(v(q), 4) + b, F += "uc" + o(M.length, 2) + M);
         var $ = "";
         return $ += `
-\0`, $ += o(E, 2), $ += L.magic, $ += o(k, 2), $ += o(A, 2), $ += o(K.crc32, 4), $ += o(K.compressedSize, 4), $ += o(K.uncompressedSize, 4), $ += o(D.length, 2), $ += o(F.length, 2), { fileRecord: g.LOCAL_FILE_HEADER + $ + D + F, dirRecord: g.CENTRAL_FILE_HEADER + o(N, 2) + $ + o(Y.length, 2) + "\0\0\0\0" + o(w, 4) + o(h, 4) + D + F + Y };
+\0`, $ += o(E, 2), $ += j.magic, $ += o(k, 2), $ += o(A, 2), $ += o(Y.crc32, 4), $ += o(Y.compressedSize, 4), $ += o(Y.uncompressedSize, 4), $ += o(D.length, 2), $ += o(F.length, 2), { fileRecord: g.LOCAL_FILE_HEADER + $ + D + F, dirRecord: g.CENTRAL_FILE_HEADER + o(N, 2) + $ + o(q.length, 2) + "\0\0\0\0" + o(w, 4) + o(h, 4) + D + F + q };
       }
       var r = s("../utils"), l = s("../stream/GenericWorker"), d = s("../utf8"), v = s("../crc32"), g = s("../signature");
       function y(n, p, i, h) {
@@ -580,8 +582,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }, y.prototype.flush = function() {
         for (var n = this.bytesWritten, p = 0; p < this.dirRecords.length; p++) this.push({ data: this.dirRecords[p], meta: { percent: 100 } });
         var i = this.bytesWritten - n, h = function(u, _, k, A, S) {
-          var L = r.transformTo("string", S(A));
-          return g.CENTRAL_DIRECTORY_END + "\0\0\0\0" + o(u, 2) + o(u, 2) + o(_, 4) + o(k, 4) + o(L.length, 2) + L;
+          var j = r.transformTo("string", S(A));
+          return g.CENTRAL_DIRECTORY_END + "\0\0\0\0" + o(u, 2) + o(u, 2) + o(_, 4) + o(k, 4) + o(j.length, 2) + j;
         }(this.dirRecords.length, i, n, this.zipComment, this.encodeFileName);
         this.push({ data: h, meta: { percent: 100 } });
       }, y.prototype.prepareNextSource = function() {
@@ -721,24 +723,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return o && typeof o.on == "function" && typeof o.pause == "function" && typeof o.resume == "function";
       } };
     }, {}], 15: [function(s, C, c) {
-      function o(S, L, O) {
-        var D, I = r.getTypeOf(L), H = r.extend(O || {}, v);
+      function o(S, j, O) {
+        var D, I = r.getTypeOf(j), H = r.extend(O || {}, v);
         H.date = H.date || /* @__PURE__ */ new Date(), H.compression !== null && (H.compression = H.compression.toUpperCase()), typeof H.unixPermissions == "string" && (H.unixPermissions = parseInt(H.unixPermissions, 8)), H.unixPermissions && 16384 & H.unixPermissions && (H.dir = !0), H.dosPermissions && 16 & H.dosPermissions && (H.dir = !0), H.dir && (S = u(S)), H.createFolders && (D = h(S)) && _.call(this, D, !0);
-        var Y = I === "string" && H.binary === !1 && H.base64 === !1;
-        O && O.binary !== void 0 || (H.binary = !Y), (L instanceof g && L.uncompressedSize === 0 || H.dir || !L || L.length === 0) && (H.base64 = !1, H.binary = !0, L = "", H.compression = "STORE", I = "string");
+        var q = I === "string" && H.binary === !1 && H.base64 === !1;
+        O && O.binary !== void 0 || (H.binary = !q), (j instanceof g && j.uncompressedSize === 0 || H.dir || !j || j.length === 0) && (H.base64 = !1, H.binary = !0, j = "", H.compression = "STORE", I = "string");
         var b = null;
-        b = L instanceof g || L instanceof l ? L : p.isNode && p.isStream(L) ? new i(S, L) : r.prepareContent(S, L, H.binary, H.optimizedBinaryString, H.base64);
+        b = j instanceof g || j instanceof l ? j : p.isNode && p.isStream(j) ? new i(S, j) : r.prepareContent(S, j, H.binary, H.optimizedBinaryString, H.base64);
         var R = new y(S, b, H);
         this.files[S] = R;
       }
       var a = s("./utf8"), r = s("./utils"), l = s("./stream/GenericWorker"), d = s("./stream/StreamHelper"), v = s("./defaults"), g = s("./compressedObject"), y = s("./zipObject"), n = s("./generate"), p = s("./nodejsUtils"), i = s("./nodejs/NodejsStreamInputAdapter"), h = function(S) {
         S.slice(-1) === "/" && (S = S.substring(0, S.length - 1));
-        var L = S.lastIndexOf("/");
-        return 0 < L ? S.substring(0, L) : "";
+        var j = S.lastIndexOf("/");
+        return 0 < j ? S.substring(0, j) : "";
       }, u = function(S) {
         return S.slice(-1) !== "/" && (S += "/"), S;
-      }, _ = function(S, L) {
-        return L = L !== void 0 ? L : v.createFolders, S = u(S), this.files[S] || o.call(this, S, null, { dir: !0, createFolders: L }), this.files[S];
+      }, _ = function(S, j) {
+        return j = j !== void 0 ? j : v.createFolders, S = u(S), this.files[S] || o.call(this, S, null, { dir: !0, createFolders: j }), this.files[S];
       };
       function k(S) {
         return Object.prototype.toString.call(S) === "[object RegExp]";
@@ -746,19 +748,19 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       var A = { load: function() {
         throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
       }, forEach: function(S) {
-        var L, O, D;
-        for (L in this.files) D = this.files[L], (O = L.slice(this.root.length, L.length)) && L.slice(0, this.root.length) === this.root && S(O, D);
+        var j, O, D;
+        for (j in this.files) D = this.files[j], (O = j.slice(this.root.length, j.length)) && j.slice(0, this.root.length) === this.root && S(O, D);
       }, filter: function(S) {
-        var L = [];
+        var j = [];
         return this.forEach(function(O, D) {
-          S(O, D) && L.push(D);
-        }), L;
-      }, file: function(S, L, O) {
-        if (arguments.length !== 1) return S = this.root + S, o.call(this, S, L, O), this;
+          S(O, D) && j.push(D);
+        }), j;
+      }, file: function(S, j, O) {
+        if (arguments.length !== 1) return S = this.root + S, o.call(this, S, j, O), this;
         if (k(S)) {
           var D = S;
-          return this.filter(function(H, Y) {
-            return !Y.dir && D.test(H);
+          return this.filter(function(H, q) {
+            return !q.dir && D.test(H);
           });
         }
         var I = this.files[this.root + S];
@@ -768,12 +770,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (k(S)) return this.filter(function(I, H) {
           return H.dir && S.test(I);
         });
-        var L = this.root + S, O = _.call(this, L), D = this.clone();
+        var j = this.root + S, O = _.call(this, j), D = this.clone();
         return D.root = O.name, D;
       }, remove: function(S) {
         S = this.root + S;
-        var L = this.files[S];
-        if (L || (S.slice(-1) !== "/" && (S += "/"), L = this.files[S]), L && !L.dir) delete this.files[S];
+        var j = this.files[S];
+        if (j || (S.slice(-1) !== "/" && (S += "/"), j = this.files[S]), j && !j.dir) delete this.files[S];
         else for (var O = this.filter(function(I, H) {
           return H.name.slice(0, S.length) === S;
         }), D = 0; D < O.length; D++) delete this.files[O[D].name];
@@ -781,20 +783,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }, generate: function() {
         throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
       }, generateInternalStream: function(S) {
-        var L, O = {};
+        var j, O = {};
         try {
           if ((O = r.extend(S || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: a.utf8encode })).type = O.type.toLowerCase(), O.compression = O.compression.toUpperCase(), O.type === "binarystring" && (O.type = "string"), !O.type) throw new Error("No output type specified.");
           r.checkSupport(O.type), O.platform !== "darwin" && O.platform !== "freebsd" && O.platform !== "linux" && O.platform !== "sunos" || (O.platform = "UNIX"), O.platform === "win32" && (O.platform = "DOS");
           var D = O.comment || this.comment || "";
-          L = n.generateWorker(this, O, D);
+          j = n.generateWorker(this, O, D);
         } catch (I) {
-          (L = new l("error")).error(I);
+          (j = new l("error")).error(I);
         }
-        return new d(L, O.type || "string", O.mimeType);
-      }, generateAsync: function(S, L) {
-        return this.generateInternalStream(S).accumulate(L);
-      }, generateNodeStream: function(S, L) {
-        return (S = S || {}).type || (S.type = "nodebuffer"), this.generateInternalStream(S).toNodejsStream(L);
+        return new d(j, O.type || "string", O.mimeType);
+      }, generateAsync: function(S, j) {
+        return this.generateInternalStream(S).accumulate(j);
+      }, generateNodeStream: function(S, j) {
+        return (S = S || {}).type || (S.type = "nodebuffer"), this.generateInternalStream(S).toNodejsStream(j);
       } };
       C.exports = A;
     }, { "./compressedObject": 2, "./defaults": 5, "./generate": 9, "./nodejs/NodejsStreamInputAdapter": 12, "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31, "./utils": 32, "./zipObject": 35 }], 16: [function(s, C, c) {
@@ -1016,13 +1018,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function y(p, i) {
         return new v.Promise(function(h, u) {
           var _ = [], k = p._internalType, A = p._outputType, S = p._mimeType;
-          p.on("data", function(L, O) {
-            _.push(L), i && i(O);
-          }).on("error", function(L) {
-            _ = [], u(L);
+          p.on("data", function(j, O) {
+            _.push(j), i && i(O);
+          }).on("error", function(j) {
+            _ = [], u(j);
           }).on("end", function() {
             try {
-              var L = function(O, D, I) {
+              var j = function(O, D, I) {
                 switch (O) {
                   case "blob":
                     return o.newBlob(o.transformTo("arraybuffer", D), I);
@@ -1032,7 +1034,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     return o.transformTo(O, D);
                 }
               }(A, function(O, D) {
-                var I, H = 0, Y = null, b = 0;
+                var I, H = 0, q = null, b = 0;
                 for (I = 0; I < D.length; I++) b += D[I].length;
                 switch (O) {
                   case "string":
@@ -1040,15 +1042,15 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   case "array":
                     return Array.prototype.concat.apply([], D);
                   case "uint8array":
-                    for (Y = new Uint8Array(b), I = 0; I < D.length; I++) Y.set(D[I], H), H += D[I].length;
-                    return Y;
+                    for (q = new Uint8Array(b), I = 0; I < D.length; I++) q.set(D[I], H), H += D[I].length;
+                    return q;
                   case "nodebuffer":
                     return Buffer.concat(D);
                   default:
                     throw new Error("concat : unsupported type '" + O + "'");
                 }
               }(k, _), S);
-              h(L);
+              h(j);
             } catch (O) {
               u(O);
             }
@@ -1281,18 +1283,18 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return u;
       }, c.prepareContent = function(i, h, u, _, k) {
         return l.Promise.resolve(h).then(function(A) {
-          return o.blob && (A instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(A)) !== -1) && typeof FileReader < "u" ? new l.Promise(function(S, L) {
+          return o.blob && (A instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(A)) !== -1) && typeof FileReader < "u" ? new l.Promise(function(S, j) {
             var O = new FileReader();
             O.onload = function(D) {
               S(D.target.result);
             }, O.onerror = function(D) {
-              L(D.target.error);
+              j(D.target.error);
             }, O.readAsArrayBuffer(A);
           }) : A;
         }).then(function(A) {
           var S = c.getTypeOf(A);
-          return S ? (S === "arraybuffer" ? A = c.transformTo("uint8array", A) : S === "string" && (k ? A = a.decode(A) : u && _ !== !0 && (A = function(L) {
-            return v(L, o.uint8array ? new Uint8Array(L.length) : new Array(L.length));
+          return S ? (S === "arraybuffer" ? A = c.transformTo("uint8array", A) : S === "string" && (k ? A = a.decode(A) : u && _ !== !0 && (A = function(j) {
+            return v(j, o.uint8array ? new Uint8Array(j.length) : new Array(j.length));
           }(A))), A) : l.Promise.reject(new Error("Can't read the data of '" + i + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
         });
       };
@@ -1520,10 +1522,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         function S(O) {
           k || (k = !0, r.resolve(u, O));
         }
-        var L = h(function() {
+        var j = h(function() {
           _(S, A);
         });
-        L.status === "error" && A(L.value);
+        j.status === "error" && A(j.value);
       }
       function h(u, _) {
         var k = {};
@@ -1567,7 +1569,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (A) i(u, A);
         else {
           u.state = d, u.outcome = _;
-          for (var S = -1, L = u.queue.length; ++S < L; ) u.queue[S].callFulfilled(_);
+          for (var S = -1, j = u.queue.length; ++S < j; ) u.queue[S].callFulfilled(_);
         }
         return u;
       }, r.reject = function(u, _) {
@@ -1584,11 +1586,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (Object.prototype.toString.call(u) !== "[object Array]") return this.reject(new TypeError("must be an array"));
         var k = u.length, A = !1;
         if (!k) return this.resolve([]);
-        for (var S = new Array(k), L = 0, O = -1, D = new this(a); ++O < k; ) I(u[O], O);
+        for (var S = new Array(k), j = 0, O = -1, D = new this(a); ++O < k; ) I(u[O], O);
         return D;
-        function I(H, Y) {
+        function I(H, q) {
           _.resolve(H).then(function(b) {
-            S[Y] = b, ++L !== k || A || (A = !0, r.resolve(D, S));
+            S[q] = b, ++j !== k || A || (A = !0, r.resolve(D, S));
           }, function(b) {
             A || (A = !0, r.reject(D, b));
           });
@@ -1598,13 +1600,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (Object.prototype.toString.call(u) !== "[object Array]") return this.reject(new TypeError("must be an array"));
         var k = u.length, A = !1;
         if (!k) return this.resolve([]);
-        for (var S = -1, L = new this(a); ++S < k; ) O = u[S], _.resolve(O).then(function(D) {
-          A || (A = !0, r.resolve(L, D));
+        for (var S = -1, j = new this(a); ++S < k; ) O = u[S], _.resolve(O).then(function(D) {
+          A || (A = !0, r.resolve(j, D));
         }, function(D) {
-          A || (A = !0, r.reject(L, D));
+          A || (A = !0, r.reject(j, D));
         });
         var O;
-        return L;
+        return j;
       };
     }, { immediate: 36 }], 38: [function(s, C, c) {
       var o = {};
@@ -1630,11 +1632,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return k.result;
       }
       i.prototype.push = function(u, _) {
-        var k, A, S = this.strm, L = this.options.chunkSize;
+        var k, A, S = this.strm, j = this.options.chunkSize;
         if (this.ended) return !1;
         A = _ === ~~_ ? _ : _ === !0 ? 4 : 0, typeof u == "string" ? S.input = r.string2buf(u) : v.call(u) === "[object ArrayBuffer]" ? S.input = new Uint8Array(u) : S.input = u, S.next_in = 0, S.avail_in = S.input.length;
         do {
-          if (S.avail_out === 0 && (S.output = new a.Buf8(L), S.next_out = 0, S.avail_out = L), (k = o.deflate(S, A)) !== 1 && k !== g) return this.onEnd(k), !(this.ended = !0);
+          if (S.avail_out === 0 && (S.output = new a.Buf8(j), S.next_out = 0, S.avail_out = j), (k = o.deflate(S, A)) !== 1 && k !== g) return this.onEnd(k), !(this.ended = !0);
           S.avail_out !== 0 && (S.avail_in !== 0 || A !== 4 && A !== 2) || (this.options.to === "string" ? this.onData(r.buf2binstring(a.shrinkBuf(S.output, S.next_out))) : this.onData(a.shrinkBuf(S.output, S.next_out)));
         } while ((0 < S.avail_in || S.avail_out === 0) && k !== 1);
         return A === 4 ? (k = o.deflateEnd(this.strm), this.onEnd(k), this.ended = !0, k === g) : A !== 2 || (this.onEnd(g), !(S.avail_out = 0));
@@ -1664,11 +1666,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return u.result;
       }
       n.prototype.push = function(i, h) {
-        var u, _, k, A, S, L, O = this.strm, D = this.options.chunkSize, I = this.options.dictionary, H = !1;
+        var u, _, k, A, S, j, O = this.strm, D = this.options.chunkSize, I = this.options.dictionary, H = !1;
         if (this.ended) return !1;
         _ = h === ~~h ? h : h === !0 ? l.Z_FINISH : l.Z_NO_FLUSH, typeof i == "string" ? O.input = r.binstring2buf(i) : y.call(i) === "[object ArrayBuffer]" ? O.input = new Uint8Array(i) : O.input = i, O.next_in = 0, O.avail_in = O.input.length;
         do {
-          if (O.avail_out === 0 && (O.output = new a.Buf8(D), O.next_out = 0, O.avail_out = D), (u = o.inflate(O, l.Z_NO_FLUSH)) === l.Z_NEED_DICT && I && (L = typeof I == "string" ? r.string2buf(I) : y.call(I) === "[object ArrayBuffer]" ? new Uint8Array(I) : I, u = o.inflateSetDictionary(this.strm, L)), u === l.Z_BUF_ERROR && H === !0 && (u = l.Z_OK, H = !1), u !== l.Z_STREAM_END && u !== l.Z_OK) return this.onEnd(u), !(this.ended = !0);
+          if (O.avail_out === 0 && (O.output = new a.Buf8(D), O.next_out = 0, O.avail_out = D), (u = o.inflate(O, l.Z_NO_FLUSH)) === l.Z_NEED_DICT && I && (j = typeof I == "string" ? r.string2buf(I) : y.call(I) === "[object ArrayBuffer]" ? new Uint8Array(I) : I, u = o.inflateSetDictionary(this.strm, j)), u === l.Z_BUF_ERROR && H === !0 && (u = l.Z_OK, H = !1), u !== l.Z_STREAM_END && u !== l.Z_OK) return this.onEnd(u), !(this.ended = !0);
           O.next_out && (O.avail_out !== 0 && u !== l.Z_STREAM_END && (O.avail_in !== 0 || _ !== l.Z_FINISH && _ !== l.Z_SYNC_FLUSH) || (this.options.to === "string" ? (k = r.utf8border(O.output, O.next_out), A = O.next_out - k, S = r.buf2string(O.output, k), O.next_out = A, O.avail_out = D - A, A && a.arraySet(O.output, O.output, k, A, 0), this.onData(S)) : this.onData(a.shrinkBuf(O.output, O.next_out)))), O.avail_in === 0 && O.avail_out === 0 && (H = !0);
         } while ((0 < O.avail_in || O.avail_out === 0) && u !== l.Z_STREAM_END);
         return u === l.Z_STREAM_END && (_ = l.Z_FINISH), _ === l.Z_FINISH ? (u = o.inflateEnd(this.strm), this.onEnd(u), this.ended = !0, u === l.Z_OK) : _ !== l.Z_SYNC_FLUSH || (this.onEnd(l.Z_OK), !(O.avail_out = 0));
@@ -1777,14 +1779,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return -1 ^ a;
       };
     }, {}], 46: [function(s, C, c) {
-      var o, a = s("../utils/common"), r = s("./trees"), l = s("./adler32"), d = s("./crc32"), v = s("./messages"), g = 0, y = 4, n = 0, p = -2, i = -1, h = 4, u = 2, _ = 8, k = 9, A = 286, S = 30, L = 19, O = 2 * A + 1, D = 15, I = 3, H = 258, Y = H + I + 1, b = 42, R = 113, e = 1, F = 2, Q = 3, M = 4;
+      var o, a = s("../utils/common"), r = s("./trees"), l = s("./adler32"), d = s("./crc32"), v = s("./messages"), g = 0, y = 4, n = 0, p = -2, i = -1, h = 4, u = 2, _ = 8, k = 9, A = 286, S = 30, j = 19, O = 2 * A + 1, D = 15, I = 3, H = 258, q = H + I + 1, b = 42, R = 113, e = 1, F = 2, Q = 3, M = 4;
       function et(t, P) {
         return t.msg = v[P], P;
       }
       function U(t) {
         return (t << 1) - (4 < t ? 9 : 0);
       }
-      function K(t) {
+      function Y(t) {
         for (var P = t.length; 0 <= --P; ) t[P] = 0;
       }
       function E(t) {
@@ -1801,7 +1803,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         t.pending_buf[t.pending++] = P >>> 8 & 255, t.pending_buf[t.pending++] = 255 & P;
       }
       function B(t, P) {
-        var T, m, f = t.max_chain_length, x = t.strstart, W = t.prev_length, Z = t.nice_match, z = t.strstart > t.w_size - Y ? t.strstart - (t.w_size - Y) : 0, V = t.window, X = t.w_mask, G = t.prev, J = t.strstart + H, lt = V[x + W - 1], at = V[x + W];
+        var T, m, f = t.max_chain_length, x = t.strstart, W = t.prev_length, Z = t.nice_match, z = t.strstart > t.w_size - q ? t.strstart - (t.w_size - q) : 0, V = t.window, X = t.w_mask, G = t.prev, J = t.strstart + H, lt = V[x + W - 1], at = V[x + W];
         t.prev_length >= t.good_match && (f >>= 2), Z > t.lookahead && (Z = t.lookahead);
         do
           if (V[(T = P) + W] === at && V[T + W - 1] === lt && V[T] === V[x] && V[++T] === V[x + 1]) {
@@ -1820,22 +1822,22 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function it(t) {
         var P, T, m, f, x, W, Z, z, V, X, G = t.w_size;
         do {
-          if (f = t.window_size - t.lookahead - t.strstart, t.strstart >= G + (G - Y)) {
+          if (f = t.window_size - t.lookahead - t.strstart, t.strstart >= G + (G - q)) {
             for (a.arraySet(t.window, t.window, G, G, 0), t.match_start -= G, t.strstart -= G, t.block_start -= G, P = T = t.hash_size; m = t.head[--P], t.head[P] = G <= m ? m - G : 0, --T; ) ;
             for (P = T = G; m = t.prev[--P], t.prev[P] = G <= m ? m - G : 0, --T; ) ;
             f += G;
           }
           if (t.strm.avail_in === 0) break;
           if (W = t.strm, Z = t.window, z = t.strstart + t.lookahead, V = f, X = void 0, X = W.avail_in, V < X && (X = V), T = X === 0 ? 0 : (W.avail_in -= X, a.arraySet(Z, W.input, W.next_in, X, z), W.state.wrap === 1 ? W.adler = l(W.adler, Z, X, z) : W.state.wrap === 2 && (W.adler = d(W.adler, Z, X, z)), W.next_in += X, W.total_in += X, X), t.lookahead += T, t.lookahead + t.insert >= I) for (x = t.strstart - t.insert, t.ins_h = t.window[x], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[x + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[x + I - 1]) & t.hash_mask, t.prev[x & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = x, x++, t.insert--, !(t.lookahead + t.insert < I)); ) ;
-        } while (t.lookahead < Y && t.strm.avail_in !== 0);
+        } while (t.lookahead < q && t.strm.avail_in !== 0);
       }
       function rt(t, P) {
         for (var T, m; ; ) {
-          if (t.lookahead < Y) {
-            if (it(t), t.lookahead < Y && P === g) return e;
+          if (t.lookahead < q) {
+            if (it(t), t.lookahead < q && P === g) return e;
             if (t.lookahead === 0) break;
           }
-          if (T = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), T !== 0 && t.strstart - T <= t.w_size - Y && (t.match_length = B(t, T)), t.match_length >= I) if (m = r._tr_tally(t, t.strstart - t.match_start, t.match_length - I), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= I) {
+          if (T = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), T !== 0 && t.strstart - T <= t.w_size - q && (t.match_length = B(t, T)), t.match_length >= I) if (m = r._tr_tally(t, t.strstart - t.match_start, t.match_length - I), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= I) {
             for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart, --t.match_length != 0; ) ;
             t.strstart++;
           } else t.strstart += t.match_length, t.match_length = 0, t.ins_h = t.window[t.strstart], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + 1]) & t.hash_mask;
@@ -1846,11 +1848,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }
       function tt(t, P) {
         for (var T, m, f; ; ) {
-          if (t.lookahead < Y) {
-            if (it(t), t.lookahead < Y && P === g) return e;
+          if (t.lookahead < q) {
+            if (it(t), t.lookahead < q && P === g) return e;
             if (t.lookahead === 0) break;
           }
-          if (T = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), t.prev_length = t.match_length, t.prev_match = t.match_start, t.match_length = I - 1, T !== 0 && t.prev_length < t.max_lazy_match && t.strstart - T <= t.w_size - Y && (t.match_length = B(t, T), t.match_length <= 5 && (t.strategy === 1 || t.match_length === I && 4096 < t.strstart - t.match_start) && (t.match_length = I - 1)), t.prev_length >= I && t.match_length <= t.prev_length) {
+          if (T = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), t.prev_length = t.match_length, t.prev_match = t.match_start, t.match_length = I - 1, T !== 0 && t.prev_length < t.max_lazy_match && t.strstart - T <= t.w_size - q && (t.match_length = B(t, T), t.match_length <= 5 && (t.strategy === 1 || t.match_length === I && 4096 < t.strstart - t.match_start) && (t.match_length = I - 1)), t.prev_length >= I && t.match_length <= t.prev_length) {
             for (f = t.strstart + t.lookahead - I, m = r._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - I), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= f && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), --t.prev_length != 0; ) ;
             if (t.match_available = 0, t.match_length = I - 1, t.strstart++, m && (w(t, !1), t.strm.avail_out === 0)) return e;
           } else if (t.match_available) {
@@ -1863,7 +1865,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         this.good_length = t, this.max_lazy = P, this.nice_length = T, this.max_chain = m, this.func = f;
       }
       function st() {
-        this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = _, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new a.Buf16(2 * O), this.dyn_dtree = new a.Buf16(2 * (2 * S + 1)), this.bl_tree = new a.Buf16(2 * (2 * L + 1)), K(this.dyn_ltree), K(this.dyn_dtree), K(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new a.Buf16(D + 1), this.heap = new a.Buf16(2 * A + 1), K(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new a.Buf16(2 * A + 1), K(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+        this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = _, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new a.Buf16(2 * O), this.dyn_dtree = new a.Buf16(2 * (2 * S + 1)), this.bl_tree = new a.Buf16(2 * (2 * j + 1)), Y(this.dyn_ltree), Y(this.dyn_dtree), Y(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new a.Buf16(D + 1), this.heap = new a.Buf16(2 * A + 1), Y(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new a.Buf16(2 * A + 1), Y(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
       }
       function ot(t) {
         var P;
@@ -1872,7 +1874,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function ft(t) {
         var P = ot(t);
         return P === n && function(T) {
-          T.window_size = 2 * T.w_size, K(T.head), T.max_lazy_match = o[T.level].max_lazy, T.good_match = o[T.level].good_length, T.nice_match = o[T.level].nice_length, T.max_chain_length = o[T.level].max_chain, T.strstart = 0, T.block_start = 0, T.lookahead = 0, T.insert = 0, T.match_length = T.prev_length = I - 1, T.match_available = 0, T.ins_h = 0;
+          T.window_size = 2 * T.w_size, Y(T.head), T.max_lazy_match = o[T.level].max_lazy, T.good_match = o[T.level].good_length, T.nice_match = o[T.level].nice_length, T.max_chain_length = o[T.level].max_chain, T.strstart = 0, T.block_start = 0, T.lookahead = 0, T.insert = 0, T.match_length = T.prev_length = I - 1, T.match_available = 0, T.ins_h = 0;
         }(t.state), P;
       }
       function ct(t, P, T, m, f, x) {
@@ -1892,7 +1894,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           }
           t.strstart += t.lookahead, t.lookahead = 0;
           var m = t.block_start + T;
-          if ((t.strstart === 0 || t.strstart >= m) && (t.lookahead = t.strstart - m, t.strstart = m, w(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - Y && (w(t, !1), t.strm.avail_out === 0)) return e;
+          if ((t.strstart === 0 || t.strstart >= m) && (t.lookahead = t.strstart - m, t.strstart = m, w(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - q && (w(t, !1), t.strm.avail_out === 0)) return e;
         }
         return t.insert = 0, P === y ? (w(t, !0), t.strm.avail_out === 0 ? Q : M) : (t.strstart > t.block_start && (w(t, !1), t.strm.avail_out), e);
       }), new nt(4, 4, 8, 4, rt), new nt(4, 5, 16, 8, rt), new nt(4, 6, 32, 32, rt), new nt(4, 4, 16, 16, tt), new nt(8, 16, 32, 32, tt), new nt(8, 16, 128, 128, tt), new nt(8, 32, 128, 256, tt), new nt(32, 128, 258, 1024, tt), new nt(32, 258, 258, 4096, tt)], c.deflateInit = function(t, P) {
@@ -1966,7 +1968,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             return z.insert = 0, V === y ? (w(z, !0), z.strm.avail_out === 0 ? Q : M) : z.last_lit && (w(z, !1), z.strm.avail_out === 0) ? e : F;
           }(m, P) : o[m.level].func(m, P);
           if (Z !== Q && Z !== M || (m.status = 666), Z === e || Z === Q) return t.avail_out === 0 && (m.last_flush = -1), n;
-          if (Z === F && (P === 1 ? r._tr_align(m) : P !== 5 && (r._tr_stored_block(m, 0, 0, !1), P === 3 && (K(m.head), m.lookahead === 0 && (m.strstart = 0, m.block_start = 0, m.insert = 0))), E(t), t.avail_out === 0)) return m.last_flush = -1, n;
+          if (Z === F && (P === 1 ? r._tr_align(m) : P !== 5 && (r._tr_stored_block(m, 0, 0, !1), P === 3 && (Y(m.head), m.lookahead === 0 && (m.strstart = 0, m.block_start = 0, m.insert = 0))), E(t), t.avail_out === 0)) return m.last_flush = -1, n;
         }
         return P !== y ? n : m.wrap <= 0 ? 1 : (m.wrap === 2 ? (N(m, 255 & t.adler), N(m, t.adler >> 8 & 255), N(m, t.adler >> 16 & 255), N(m, t.adler >> 24 & 255), N(m, 255 & t.total_in), N(m, t.total_in >> 8 & 255), N(m, t.total_in >> 16 & 255), N(m, t.total_in >> 24 & 255)) : ($(m, t.adler >>> 16), $(m, 65535 & t.adler)), E(t), 0 < m.wrap && (m.wrap = -m.wrap), m.pending !== 0 ? n : 1);
       }, c.deflateEnd = function(t) {
@@ -1975,7 +1977,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }, c.deflateSetDictionary = function(t, P) {
         var T, m, f, x, W, Z, z, V, X = P.length;
         if (!t || !t.state || (x = (T = t.state).wrap) === 2 || x === 1 && T.status !== b || T.lookahead) return p;
-        for (x === 1 && (t.adler = l(t.adler, P, X, 0)), T.wrap = 0, X >= T.w_size && (x === 0 && (K(T.head), T.strstart = 0, T.block_start = 0, T.insert = 0), V = new a.Buf8(T.w_size), a.arraySet(V, P, X - T.w_size, T.w_size, 0), P = V, X = T.w_size), W = t.avail_in, Z = t.next_in, z = t.input, t.avail_in = X, t.next_in = 0, t.input = P, it(T); T.lookahead >= I; ) {
+        for (x === 1 && (t.adler = l(t.adler, P, X, 0)), T.wrap = 0, X >= T.w_size && (x === 0 && (Y(T.head), T.strstart = 0, T.block_start = 0, T.insert = 0), V = new a.Buf8(T.w_size), a.arraySet(V, P, X - T.w_size, T.w_size, 0), P = V, X = T.w_size), W = t.avail_in, Z = t.next_in, z = t.input, t.avail_in = X, t.next_in = 0, t.input = P, it(T); T.lookahead >= I; ) {
           for (m = T.strstart, f = T.lookahead - (I - 1); T.ins_h = (T.ins_h << T.hash_shift ^ T.window[m + I - 1]) & T.hash_mask, T.prev[m & T.w_mask] = T.head[T.ins_h], T.head[T.ins_h] = m, m++, --f; ) ;
           T.strstart = m, T.lookahead = I - 1, it(T);
         }
@@ -1987,10 +1989,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       };
     }, {}], 48: [function(s, C, c) {
       C.exports = function(o, a) {
-        var r, l, d, v, g, y, n, p, i, h, u, _, k, A, S, L, O, D, I, H, Y, b, R, e, F;
-        r = o.state, l = o.next_in, e = o.input, d = l + (o.avail_in - 5), v = o.next_out, F = o.output, g = v - (a - o.avail_out), y = v + (o.avail_out - 257), n = r.dmax, p = r.wsize, i = r.whave, h = r.wnext, u = r.window, _ = r.hold, k = r.bits, A = r.lencode, S = r.distcode, L = (1 << r.lenbits) - 1, O = (1 << r.distbits) - 1;
+        var r, l, d, v, g, y, n, p, i, h, u, _, k, A, S, j, O, D, I, H, q, b, R, e, F;
+        r = o.state, l = o.next_in, e = o.input, d = l + (o.avail_in - 5), v = o.next_out, F = o.output, g = v - (a - o.avail_out), y = v + (o.avail_out - 257), n = r.dmax, p = r.wsize, i = r.whave, h = r.wnext, u = r.window, _ = r.hold, k = r.bits, A = r.lencode, S = r.distcode, j = (1 << r.lenbits) - 1, O = (1 << r.distbits) - 1;
         t: do {
-          k < 15 && (_ += e[l++] << k, k += 8, _ += e[l++] << k, k += 8), D = A[_ & L];
+          k < 15 && (_ += e[l++] << k, k += 8, _ += e[l++] << k, k += 8), D = A[_ & j];
           e: for (; ; ) {
             if (_ >>>= I = D >>> 24, k -= I, (I = D >>> 16 & 255) === 0) F[v++] = 65535 & D;
             else {
@@ -2016,36 +2018,36 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   o.msg = "invalid distance code", r.mode = 30;
                   break t;
                 }
-                if (Y = 65535 & D, k < (I &= 15) && (_ += e[l++] << k, (k += 8) < I && (_ += e[l++] << k, k += 8)), n < (Y += _ & (1 << I) - 1)) {
+                if (q = 65535 & D, k < (I &= 15) && (_ += e[l++] << k, (k += 8) < I && (_ += e[l++] << k, k += 8)), n < (q += _ & (1 << I) - 1)) {
                   o.msg = "invalid distance too far back", r.mode = 30;
                   break t;
                 }
-                if (_ >>>= I, k -= I, (I = v - g) < Y) {
-                  if (i < (I = Y - I) && r.sane) {
+                if (_ >>>= I, k -= I, (I = v - g) < q) {
+                  if (i < (I = q - I) && r.sane) {
                     o.msg = "invalid distance too far back", r.mode = 30;
                     break t;
                   }
                   if (R = u, (b = 0) === h) {
                     if (b += p - I, I < H) {
                       for (H -= I; F[v++] = u[b++], --I; ) ;
-                      b = v - Y, R = F;
+                      b = v - q, R = F;
                     }
                   } else if (h < I) {
                     if (b += p + h - I, (I -= h) < H) {
                       for (H -= I; F[v++] = u[b++], --I; ) ;
                       if (b = 0, h < H) {
                         for (H -= I = h; F[v++] = u[b++], --I; ) ;
-                        b = v - Y, R = F;
+                        b = v - q, R = F;
                       }
                     }
                   } else if (b += h - I, I < H) {
                     for (H -= I; F[v++] = u[b++], --I; ) ;
-                    b = v - Y, R = F;
+                    b = v - q, R = F;
                   }
                   for (; 2 < H; ) F[v++] = R[b++], F[v++] = R[b++], F[v++] = R[b++], H -= 3;
                   H && (F[v++] = R[b++], 1 < H && (F[v++] = R[b++]));
                 } else {
-                  for (b = v - Y; F[v++] = F[b++], F[v++] = F[b++], F[v++] = F[b++], 2 < (H -= 3); ) ;
+                  for (b = v - q; F[v++] = F[b++], F[v++] = F[b++], F[v++] = F[b++], 2 < (H -= 3); ) ;
                   H && (F[v++] = F[b++], 1 < H && (F[v++] = F[b++]));
                 }
                 break;
@@ -2076,7 +2078,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         var e, F;
         return b && b.state ? (F = b.state, R < 0 ? (e = 0, R = -R) : (e = 1 + (R >> 4), R < 48 && (R &= 15)), R && (R < 8 || 15 < R) ? n : (F.window !== null && F.wbits !== R && (F.window = null), F.wrap = e, F.wbits = R, A(b))) : n;
       }
-      function L(b, R) {
+      function j(b, R) {
         var e, F;
         return b ? (F = new _(), (b.state = F).window = null, (e = S(b, R)) !== y && (b.state = null), e) : n;
       }
@@ -2093,16 +2095,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         }
         b.lencode = O, b.lenbits = 9, b.distcode = D, b.distbits = 5;
       }
-      function Y(b, R, e, F) {
+      function q(b, R, e, F) {
         var Q, M = b.state;
         return M.window === null && (M.wsize = 1 << M.wbits, M.wnext = 0, M.whave = 0, M.window = new o.Buf8(M.wsize)), F >= M.wsize ? (o.arraySet(M.window, R, e - M.wsize, M.wsize, 0), M.wnext = 0, M.whave = M.wsize) : (F < (Q = M.wsize - M.wnext) && (Q = F), o.arraySet(M.window, R, e - F, Q, M.wnext), (F -= Q) ? (o.arraySet(M.window, R, e - F, F, 0), M.wnext = F, M.whave = M.wsize) : (M.wnext += Q, M.wnext === M.wsize && (M.wnext = 0), M.whave < M.wsize && (M.whave += Q))), 0;
       }
       c.inflateReset = A, c.inflateReset2 = S, c.inflateResetKeep = k, c.inflateInit = function(b) {
-        return L(b, 15);
-      }, c.inflateInit2 = L, c.inflate = function(b, R) {
-        var e, F, Q, M, et, U, K, E, w, N, $, B, it, rt, tt, nt, st, ot, ft, ct, t, P, T, m, f = 0, x = new o.Buf8(4), W = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+        return j(b, 15);
+      }, c.inflateInit2 = j, c.inflate = function(b, R) {
+        var e, F, Q, M, et, U, Y, E, w, N, $, B, it, rt, tt, nt, st, ot, ft, ct, t, P, T, m, f = 0, x = new o.Buf8(4), W = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
         if (!b || !b.state || !b.output || !b.input && b.avail_in !== 0) return n;
-        (e = b.state).mode === 12 && (e.mode = 13), et = b.next_out, Q = b.output, K = b.avail_out, M = b.next_in, F = b.input, U = b.avail_in, E = e.hold, w = e.bits, N = U, $ = K, P = y;
+        (e = b.state).mode === 12 && (e.mode = 13), et = b.next_out, Q = b.output, Y = b.avail_out, M = b.next_in, F = b.input, U = b.avail_in, E = e.hold, w = e.bits, N = U, $ = Y, P = y;
         t: for (; ; ) switch (e.mode) {
           case p:
             if (e.wrap === 0) {
@@ -2205,7 +2207,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             }
             b.adler = e.check = u(E), w = E = 0, e.mode = 11;
           case 11:
-            if (e.havedict === 0) return b.next_out = et, b.avail_out = K, b.next_in = M, b.avail_in = U, e.hold = E, e.bits = w, 2;
+            if (e.havedict === 0) return b.next_out = et, b.avail_out = Y, b.next_in = M, b.avail_in = U, e.hold = E, e.bits = w, 2;
             b.adler = e.check = 1, e.mode = 12;
           case 12:
             if (R === 5 || R === 6) break t;
@@ -2248,8 +2250,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             e.mode = 16;
           case 16:
             if (B = e.length) {
-              if (U < B && (B = U), K < B && (B = K), B === 0) break t;
-              o.arraySet(Q, F, M, B, et), U -= B, M += B, K -= B, et += B, e.length -= B;
+              if (U < B && (B = U), Y < B && (B = Y), B === 0) break t;
+              o.arraySet(Q, F, M, B, et), U -= B, M += B, Y -= B, et += B, e.length -= B;
               break;
             }
             e.mode = 12;
@@ -2333,8 +2335,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           case 20:
             e.mode = 21;
           case 21:
-            if (6 <= U && 258 <= K) {
-              b.next_out = et, b.avail_out = K, b.next_in = M, b.avail_in = U, e.hold = E, e.bits = w, l(b, $), et = b.next_out, Q = b.output, K = b.avail_out, M = b.next_in, F = b.input, U = b.avail_in, E = e.hold, w = e.bits, e.mode === 12 && (e.back = -1);
+            if (6 <= U && 258 <= Y) {
+              b.next_out = et, b.avail_out = Y, b.next_in = M, b.avail_in = U, e.hold = E, e.bits = w, l(b, $), et = b.next_out, Q = b.output, Y = b.avail_out, M = b.next_in, F = b.input, U = b.avail_in, E = e.hold, w = e.bits, e.mode === 12 && (e.back = -1);
               break;
             }
             for (e.back = 0; nt = (f = e.lencode[E & (1 << e.lenbits) - 1]) >>> 16 & 255, st = 65535 & f, !((tt = f >>> 24) <= w); ) {
@@ -2401,20 +2403,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             }
             e.mode = 25;
           case 25:
-            if (K === 0) break t;
-            if (B = $ - K, e.offset > B) {
+            if (Y === 0) break t;
+            if (B = $ - Y, e.offset > B) {
               if ((B = e.offset - B) > e.whave && e.sane) {
                 b.msg = "invalid distance too far back", e.mode = 30;
                 break;
               }
               it = B > e.wnext ? (B -= e.wnext, e.wsize - B) : e.wnext - B, B > e.length && (B = e.length), rt = e.window;
             } else rt = Q, it = et - e.offset, B = e.length;
-            for (K < B && (B = K), K -= B, e.length -= B; Q[et++] = rt[it++], --B; ) ;
+            for (Y < B && (B = Y), Y -= B, e.length -= B; Q[et++] = rt[it++], --B; ) ;
             e.length === 0 && (e.mode = 21);
             break;
           case 26:
-            if (K === 0) break t;
-            Q[et++] = e.length, K--, e.mode = 21;
+            if (Y === 0) break t;
+            Q[et++] = e.length, Y--, e.mode = 21;
             break;
           case 27:
             if (e.wrap) {
@@ -2422,7 +2424,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 if (U === 0) break t;
                 U--, E |= F[M++] << w, w += 8;
               }
-              if ($ -= K, b.total_out += $, e.total += $, $ && (b.adler = e.check = e.flags ? r(e.check, Q, $, et - $) : a(e.check, Q, $, et - $)), $ = K, (e.flags ? E : u(E)) !== e.check) {
+              if ($ -= Y, b.total_out += $, e.total += $, $ && (b.adler = e.check = e.flags ? r(e.check, Q, $, et - $) : a(e.check, Q, $, et - $)), $ = Y, (e.flags ? E : u(E)) !== e.check) {
                 b.msg = "incorrect data check", e.mode = 30;
                 break;
               }
@@ -2454,7 +2456,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           default:
             return n;
         }
-        return b.next_out = et, b.avail_out = K, b.next_in = M, b.avail_in = U, e.hold = E, e.bits = w, (e.wsize || $ !== b.avail_out && e.mode < 30 && (e.mode < 27 || R !== 4)) && Y(b, b.output, b.next_out, $ - b.avail_out) ? (e.mode = 31, -4) : (N -= b.avail_in, $ -= b.avail_out, b.total_in += N, b.total_out += $, e.total += $, e.wrap && $ && (b.adler = e.check = e.flags ? r(e.check, Q, $, b.next_out - $) : a(e.check, Q, $, b.next_out - $)), b.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (N == 0 && $ === 0 || R === 4) && P === y && (P = -5), P);
+        return b.next_out = et, b.avail_out = Y, b.next_in = M, b.avail_in = U, e.hold = E, e.bits = w, (e.wsize || $ !== b.avail_out && e.mode < 30 && (e.mode < 27 || R !== 4)) && q(b, b.output, b.next_out, $ - b.avail_out) ? (e.mode = 31, -4) : (N -= b.avail_in, $ -= b.avail_out, b.total_in += N, b.total_out += $, e.total += $, e.wrap && $ && (b.adler = e.check = e.flags ? r(e.check, Q, $, b.next_out - $) : a(e.check, Q, $, b.next_out - $)), b.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (N == 0 && $ === 0 || R === 4) && P === y && (P = -5), P);
       }, c.inflateEnd = function(b) {
         if (!b || !b.state) return n;
         var R = b.state;
@@ -2464,36 +2466,36 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return b && b.state && 2 & (e = b.state).wrap ? ((e.head = R).done = !1, y) : n;
       }, c.inflateSetDictionary = function(b, R) {
         var e, F = R.length;
-        return b && b.state ? (e = b.state).wrap !== 0 && e.mode !== 11 ? n : e.mode === 11 && a(1, R, F, 0) !== e.check ? -3 : Y(b, R, F, F) ? (e.mode = 31, -4) : (e.havedict = 1, y) : n;
+        return b && b.state ? (e = b.state).wrap !== 0 && e.mode !== 11 ? n : e.mode === 11 && a(1, R, F, 0) !== e.check ? -3 : q(b, R, F, F) ? (e.mode = 31, -4) : (e.havedict = 1, y) : n;
       }, c.inflateInfo = "pako inflate (from Nodeca project)";
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(s, C, c) {
       var o = s("../utils/common"), a = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0], r = [16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78], l = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0], d = [16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64];
       C.exports = function(v, g, y, n, p, i, h, u) {
-        var _, k, A, S, L, O, D, I, H, Y = u.bits, b = 0, R = 0, e = 0, F = 0, Q = 0, M = 0, et = 0, U = 0, K = 0, E = 0, w = null, N = 0, $ = new o.Buf16(16), B = new o.Buf16(16), it = null, rt = 0;
+        var _, k, A, S, j, O, D, I, H, q = u.bits, b = 0, R = 0, e = 0, F = 0, Q = 0, M = 0, et = 0, U = 0, Y = 0, E = 0, w = null, N = 0, $ = new o.Buf16(16), B = new o.Buf16(16), it = null, rt = 0;
         for (b = 0; b <= 15; b++) $[b] = 0;
         for (R = 0; R < n; R++) $[g[y + R]]++;
-        for (Q = Y, F = 15; 1 <= F && $[F] === 0; F--) ;
+        for (Q = q, F = 15; 1 <= F && $[F] === 0; F--) ;
         if (F < Q && (Q = F), F === 0) return p[i++] = 20971520, p[i++] = 20971520, u.bits = 1, 0;
         for (e = 1; e < F && $[e] === 0; e++) ;
         for (Q < e && (Q = e), b = U = 1; b <= 15; b++) if (U <<= 1, (U -= $[b]) < 0) return -1;
         if (0 < U && (v === 0 || F !== 1)) return -1;
         for (B[1] = 0, b = 1; b < 15; b++) B[b + 1] = B[b] + $[b];
         for (R = 0; R < n; R++) g[y + R] !== 0 && (h[B[g[y + R]]++] = R);
-        if (O = v === 0 ? (w = it = h, 19) : v === 1 ? (w = a, N -= 257, it = r, rt -= 257, 256) : (w = l, it = d, -1), b = e, L = i, et = R = E = 0, A = -1, S = (K = 1 << (M = Q)) - 1, v === 1 && 852 < K || v === 2 && 592 < K) return 1;
+        if (O = v === 0 ? (w = it = h, 19) : v === 1 ? (w = a, N -= 257, it = r, rt -= 257, 256) : (w = l, it = d, -1), b = e, j = i, et = R = E = 0, A = -1, S = (Y = 1 << (M = Q)) - 1, v === 1 && 852 < Y || v === 2 && 592 < Y) return 1;
         for (; ; ) {
-          for (D = b - et, H = h[R] < O ? (I = 0, h[R]) : h[R] > O ? (I = it[rt + h[R]], w[N + h[R]]) : (I = 96, 0), _ = 1 << b - et, e = k = 1 << M; p[L + (E >> et) + (k -= _)] = D << 24 | I << 16 | H | 0, k !== 0; ) ;
+          for (D = b - et, H = h[R] < O ? (I = 0, h[R]) : h[R] > O ? (I = it[rt + h[R]], w[N + h[R]]) : (I = 96, 0), _ = 1 << b - et, e = k = 1 << M; p[j + (E >> et) + (k -= _)] = D << 24 | I << 16 | H | 0, k !== 0; ) ;
           for (_ = 1 << b - 1; E & _; ) _ >>= 1;
           if (_ !== 0 ? (E &= _ - 1, E += _) : E = 0, R++, --$[b] == 0) {
             if (b === F) break;
             b = g[y + h[R]];
           }
           if (Q < b && (E & S) !== A) {
-            for (et === 0 && (et = Q), L += e, U = 1 << (M = b - et); M + et < F && !((U -= $[M + et]) <= 0); ) M++, U <<= 1;
-            if (K += 1 << M, v === 1 && 852 < K || v === 2 && 592 < K) return 1;
-            p[A = E & S] = Q << 24 | M << 16 | L - i | 0;
+            for (et === 0 && (et = Q), j += e, U = 1 << (M = b - et); M + et < F && !((U -= $[M + et]) <= 0); ) M++, U <<= 1;
+            if (Y += 1 << M, v === 1 && 852 < Y || v === 2 && 592 < Y) return 1;
+            p[A = E & S] = Q << 24 | M << 16 | j - i | 0;
           }
         }
-        return E !== 0 && (p[L + E] = b - et << 24 | 64 << 16 | 0), u.bits = Q, 0;
+        return E !== 0 && (p[j + E] = b - et << 24 | 64 << 16 | 0), u.bits = Q, 0;
       };
     }, { "../utils/common": 41 }], 51: [function(s, C, c) {
       C.exports = { 2: "need dictionary", 1: "stream end", 0: "", "-1": "file error", "-2": "stream error", "-3": "data error", "-4": "insufficient memory", "-5": "buffer error", "-6": "incompatible version" };
@@ -2502,8 +2504,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function l(f) {
         for (var x = f.length; 0 <= --x; ) f[x] = 0;
       }
-      var d = 0, v = 29, g = 256, y = g + 1 + v, n = 30, p = 19, i = 2 * y + 1, h = 15, u = 16, _ = 7, k = 256, A = 16, S = 17, L = 18, O = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], D = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], I = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], H = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Y = new Array(2 * (y + 2));
-      l(Y);
+      var d = 0, v = 29, g = 256, y = g + 1 + v, n = 30, p = 19, i = 2 * y + 1, h = 15, u = 16, _ = 7, k = 256, A = 16, S = 17, j = 18, O = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], D = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], I = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], H = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], q = new Array(2 * (y + 2));
+      l(q);
       var b = new Array(2 * n);
       l(b);
       var R = new Array(512);
@@ -2513,7 +2515,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       var F = new Array(v);
       l(F);
       var Q, M, et, U = new Array(n);
-      function K(f, x, W, Z, z) {
+      function Y(f, x, W, Z, z) {
         this.static_tree = f, this.extra_bits = x, this.extra_base = W, this.elems = Z, this.max_length = z, this.has_stree = f && f.length;
       }
       function E(f, x) {
@@ -2587,13 +2589,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }
       function t(f, x, W) {
         var Z, z, V = -1, X = x[1], G = 0, J = 7, lt = 4;
-        for (X === 0 && (J = 138, lt = 3), x[2 * (W + 1) + 1] = 65535, Z = 0; Z <= W; Z++) z = X, X = x[2 * (Z + 1) + 1], ++G < J && z === X || (G < lt ? f.bl_tree[2 * z] += G : z !== 0 ? (z !== V && f.bl_tree[2 * z]++, f.bl_tree[2 * A]++) : G <= 10 ? f.bl_tree[2 * S]++ : f.bl_tree[2 * L]++, V = z, lt = (G = 0) === X ? (J = 138, 3) : z === X ? (J = 6, 3) : (J = 7, 4));
+        for (X === 0 && (J = 138, lt = 3), x[2 * (W + 1) + 1] = 65535, Z = 0; Z <= W; Z++) z = X, X = x[2 * (Z + 1) + 1], ++G < J && z === X || (G < lt ? f.bl_tree[2 * z] += G : z !== 0 ? (z !== V && f.bl_tree[2 * z]++, f.bl_tree[2 * A]++) : G <= 10 ? f.bl_tree[2 * S]++ : f.bl_tree[2 * j]++, V = z, lt = (G = 0) === X ? (J = 138, 3) : z === X ? (J = 6, 3) : (J = 7, 4));
       }
       function P(f, x, W) {
         var Z, z, V = -1, X = x[1], G = 0, J = 7, lt = 4;
         for (X === 0 && (J = 138, lt = 3), Z = 0; Z <= W; Z++) if (z = X, X = x[2 * (Z + 1) + 1], !(++G < J && z === X)) {
           if (G < lt) for (; B(f, z, f.bl_tree), --G != 0; ) ;
-          else z !== 0 ? (z !== V && (B(f, z, f.bl_tree), G--), B(f, A, f.bl_tree), $(f, G - 3, 2)) : G <= 10 ? (B(f, S, f.bl_tree), $(f, G - 3, 3)) : (B(f, L, f.bl_tree), $(f, G - 11, 7));
+          else z !== 0 ? (z !== V && (B(f, z, f.bl_tree), G--), B(f, A, f.bl_tree), $(f, G - 3, 2)) : G <= 10 ? (B(f, S, f.bl_tree), $(f, G - 3, 3)) : (B(f, j, f.bl_tree), $(f, G - 11, 7));
           V = z, lt = (G = 0) === X ? (J = 138, 3) : z === X ? (J = 6, 3) : (J = 7, 4);
         }
       }
@@ -2611,12 +2613,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           for (e[Z - 1] = z, z = V = 0; z < 16; z++) for (U[z] = V, x = 0; x < 1 << D[z]; x++) R[V++] = z;
           for (V >>= 7; z < n; z++) for (U[z] = V << 7, x = 0; x < 1 << D[z] - 7; x++) R[256 + V++] = z;
           for (W = 0; W <= h; W++) X[W] = 0;
-          for (x = 0; x <= 143; ) Y[2 * x + 1] = 8, x++, X[8]++;
-          for (; x <= 255; ) Y[2 * x + 1] = 9, x++, X[9]++;
-          for (; x <= 279; ) Y[2 * x + 1] = 7, x++, X[7]++;
-          for (; x <= 287; ) Y[2 * x + 1] = 8, x++, X[8]++;
-          for (rt(Y, y + 1, X), x = 0; x < n; x++) b[2 * x + 1] = 5, b[2 * x] = it(x, 5);
-          Q = new K(Y, O, g + 1, y, h), M = new K(b, D, 0, n, h), et = new K(new Array(0), I, 0, p, _);
+          for (x = 0; x <= 143; ) q[2 * x + 1] = 8, x++, X[8]++;
+          for (; x <= 255; ) q[2 * x + 1] = 9, x++, X[9]++;
+          for (; x <= 279; ) q[2 * x + 1] = 7, x++, X[7]++;
+          for (; x <= 287; ) q[2 * x + 1] = 8, x++, X[8]++;
+          for (rt(q, y + 1, X), x = 0; x < n; x++) b[2 * x + 1] = 5, b[2 * x] = it(x, 5);
+          Q = new Y(q, O, g + 1, y, h), M = new Y(b, D, 0, n, h), et = new Y(new Array(0), I, 0, p, _);
         }(), T = !0), f.l_desc = new E(f.dyn_ltree, Q), f.d_desc = new E(f.dyn_dtree, M), f.bl_desc = new E(f.bl_tree, et), f.bi_buf = 0, f.bi_valid = 0, tt(f);
       }, c._tr_stored_block = m, c._tr_flush_block = function(f, x, W, Z) {
         var z, V, X = 0;
@@ -2630,7 +2632,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           var J;
           for (t(G, G.dyn_ltree, G.l_desc.max_code), t(G, G.dyn_dtree, G.d_desc.max_code), ct(G, G.bl_desc), J = p - 1; 3 <= J && G.bl_tree[2 * H[J] + 1] === 0; J--) ;
           return G.opt_len += 3 * (J + 1) + 5 + 5 + 4, J;
-        }(f), z = f.opt_len + 3 + 7 >>> 3, (V = f.static_len + 3 + 7 >>> 3) <= z && (z = V)) : z = V = W + 5, W + 4 <= z && x !== -1 ? m(f, x, W, Z) : f.strategy === 4 || V === z ? ($(f, 2 + (Z ? 1 : 0), 3), ft(f, Y, b)) : ($(f, 4 + (Z ? 1 : 0), 3), function(G, J, lt, at) {
+        }(f), z = f.opt_len + 3 + 7 >>> 3, (V = f.static_len + 3 + 7 >>> 3) <= z && (z = V)) : z = V = W + 5, W + 4 <= z && x !== -1 ? m(f, x, W, Z) : f.strategy === 4 || V === z ? ($(f, 2 + (Z ? 1 : 0), 3), ft(f, q, b)) : ($(f, 4 + (Z ? 1 : 0), 3), function(G, J, lt, at) {
           var ht;
           for ($(G, J - 257, 5), $(G, lt - 1, 5), $(G, at - 4, 4), ht = 0; ht < at; ht++) $(G, G.bl_tree[2 * H[ht] + 1], 3);
           P(G, G.dyn_ltree, J - 1), P(G, G.dyn_dtree, lt - 1);
@@ -2638,7 +2640,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }, c._tr_tally = function(f, x, W) {
         return f.pending_buf[f.d_buf + 2 * f.last_lit] = x >>> 8 & 255, f.pending_buf[f.d_buf + 2 * f.last_lit + 1] = 255 & x, f.pending_buf[f.l_buf + f.last_lit] = 255 & W, f.last_lit++, x === 0 ? f.dyn_ltree[2 * W]++ : (f.matches++, x--, f.dyn_ltree[2 * (e[W] + g + 1)]++, f.dyn_dtree[2 * w(x)]++), f.last_lit === f.lit_bufsize - 1;
       }, c._tr_align = function(f) {
-        $(f, 2, 3), B(f, k, Y), function(x) {
+        $(f, 2, 3), B(f, k, q), function(x) {
           x.bi_valid === 16 ? (N(x, x.bi_buf), x.bi_buf = 0, x.bi_valid = 0) : 8 <= x.bi_valid && (x.pending_buf[x.pending++] = 255 & x.bi_buf, x.bi_buf >>= 8, x.bi_valid -= 8);
         }(f);
       };
@@ -2677,7 +2679,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               setTimeout(_, 0, A);
             }, h.setImmediate = function(A) {
               typeof A != "function" && (A = new Function("" + A));
-              for (var S = new Array(arguments.length - 1), L = 0; L < S.length; L++) S[L] = arguments[L + 1];
+              for (var S = new Array(arguments.length - 1), j = 0; j < S.length; j++) S[j] = arguments[j + 1];
               var O = { callback: A, args: S };
               return n[y] = O, l(y), y++;
             }, h.clearImmediate = u;
@@ -2692,8 +2694,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               if (S) {
                 p = !0;
                 try {
-                  (function(L) {
-                    var O = L.callback, D = L.args;
+                  (function(j) {
+                    var O = j.callback, D = j.args;
                     switch (D.length) {
                       case 0:
                         O();
@@ -2725,53 +2727,53 @@ https://github.com/nodeca/pako/blob/main/LICENSE
     }, {}] }, {}, [10])(10);
   });
 })(Ot);
-var Kt = Ot.exports;
-const qt = /* @__PURE__ */ jt(Kt);
-function Xt(j) {
-  let q = "";
+var Yt = Ot.exports;
+const Kt = /* @__PURE__ */ jt(Yt);
+function Xt(L) {
+  let K = "";
   const s = [];
-  if (j.bold && s.push("<b/>"), j.italic && s.push("<i/>"), j.underline && s.push("<u/>"), j.strikethrough && s.push("<strike/>"), j.textColor && j.textColor.toLowerCase() !== "#000000") {
-    const c = Et(j.textColor);
+  if (L.bold && s.push("<b/>"), L.italic && s.push("<i/>"), L.underline && s.push("<u/>"), L.strikethrough && s.push("<strike/>"), L.textColor && L.textColor.toLowerCase() !== "#000000") {
+    const c = Et(L.textColor);
     c && s.push(`<color rgb="${c}"/>`);
   }
-  s.length > 0 && (q += `<font>${s.join("")}</font>`);
-  const C = j.cellColor;
+  s.length > 0 && (K += `<font>${s.join("")}</font>`);
+  const C = L.cellColor;
   if (C && C.toLowerCase() !== "#ffffff") {
     const c = Et(C);
-    c && (q += `<fill><patternFill patternType="solid"><fgColor rgb="${c}"/></patternFill></fill>`);
+    c && (K += `<fill><patternFill patternType="solid"><fgColor rgb="${c}"/></patternFill></fill>`);
   }
-  return `<dxf>${q}</dxf>`;
+  return `<dxf>${K}</dxf>`;
 }
-function Jt(j, q) {
-  const s = j.match(/<dxfs count="(\d+)"/);
+function Jt(L, K) {
+  const s = L.match(/<dxfs count="(\d+)"/);
   if (s) {
     const C = parseInt(s[1], 10);
     return {
-      xml: j.replace(/<dxfs count="\d+"/, `<dxfs count="${C + 1}"`).replace("</dxfs>", q + "</dxfs>"),
+      xml: L.replace(/<dxfs count="\d+"/, `<dxfs count="${C + 1}"`).replace("</dxfs>", K + "</dxfs>"),
       dxfId: C
     };
   }
-  return j.includes("<dxfs/>") ? {
-    xml: j.replace("<dxfs/>", `<dxfs count="1">${q}</dxfs>`),
+  return L.includes("<dxfs/>") ? {
+    xml: L.replace("<dxfs/>", `<dxfs count="1">${K}</dxfs>`),
     dxfId: 0
   } : {
-    xml: j.replace(
+    xml: L.replace(
       "</styleSheet>",
-      `<dxfs count="1">${q}</dxfs></styleSheet>`
+      `<dxfs count="1">${K}</dxfs></styleSheet>`
     ),
     dxfId: 0
   };
 }
-function Qt(j) {
-  return j.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+function Qt(L) {
+  return L.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
 }
-function te(j, q, s) {
+function te(L, K, s) {
   const C = new RegExp(
-    `(<conditionalFormatting[^>]*\\bsqref="${Qt(q)}"[^>]*>)`
+    `(<conditionalFormatting[^>]*\\bsqref="${Qt(K)}"[^>]*>)`
   );
-  if (C.test(j))
-    return j.replace(C, `$1${s}`);
-  const c = `<conditionalFormatting sqref="${q}">${s}</conditionalFormatting>`;
+  if (C.test(L))
+    return L.replace(C, `$1${s}`);
+  const c = `<conditionalFormatting sqref="${K}">${s}</conditionalFormatting>`;
   for (const o of [
     "<pageMargins",
     "<pageSetup",
@@ -2779,27 +2781,27 @@ function te(j, q, s) {
     "<drawing",
     "</worksheet>"
   ])
-    if (j.includes(o))
-      return j.replace(o, c + o);
-  return j + c;
+    if (L.includes(o))
+      return L.replace(o, c + o);
+  return L + c;
 }
-function ee(j) {
-  return j.replace(
+function ee(L) {
+  return L.replace(
     /<cfRule([^>]*)type="containsText"([^>]*?)>([\s\S]*?)<\/cfRule>/g,
-    (q, s, C, c) => {
-      if (/\btext=/.test(s) || /\btext=/.test(C)) return q;
+    (K, s, C, c) => {
+      if (/\btext=/.test(s) || /\btext=/.test(C)) return K;
       const o = c.match(/<formula[^>]*>([\s\S]*?)<\/formula>/);
-      if (!o) return q;
+      if (!o) return K;
       const r = o[1].replace(/&quot;/g, '"').replace(/&amp;/g, "&").replace(/&lt;/g, "<").replace(/&gt;/g, ">").match(/SEARCH\s*\(\s*"([^"]*)"/i);
-      if (!r) return q;
+      if (!r) return K;
       const l = r[1].replace(/&/g, "&amp;").replace(/"/g, "&quot;").replace(/</g, "&lt;").replace(/>/g, "&gt;");
       return `<cfRule${s}type="containsText"${C} text="${l}">${c}</cfRule>`;
     }
   );
 }
-async function re(j, q) {
+async function re(L, K) {
   var a;
-  const s = await qt.loadAsync(j), C = s.file("xl/styles.xml");
+  const s = await Kt.loadAsync(L), C = s.file("xl/styles.xml");
   let c = C ? await C.async("text") : "", o = !1;
   for (const [r, l] of Object.entries(s.files)) {
     if (l.dir) continue;
@@ -2809,7 +2811,7 @@ async function re(j, q) {
     let g = await l.async("text"), y = !1;
     const n = ee(g);
     n !== g && (g = n, y = !0);
-    const p = ((a = q[v]) == null ? void 0 : a.duplicateValues) ?? [];
+    const p = ((a = K[v]) == null ? void 0 : a.duplicateValues) ?? [];
     for (const i of p) {
       const h = Xt(i.format), { xml: u, dxfId: _ } = Jt(c, h);
       c = u, o = !0;
@@ -2820,90 +2822,90 @@ async function re(j, q) {
   }
   return o && C && s.file("xl/styles.xml", c), s.generateAsync({ type: "arraybuffer", compression: "DEFLATE" });
 }
-const ne = (j) => {
-  if (!j || typeof j != "string") return null;
-  const q = j.trim().toLowerCase();
-  if (q.startsWith("#")) {
-    const c = q.replace("#", "").toUpperCase();
+const ne = (L) => {
+  if (!L || typeof L != "string") return null;
+  const K = L.trim().toLowerCase();
+  if (K.startsWith("#")) {
+    const c = K.replace("#", "").toUpperCase();
     return c.length === 3 ? c.split("").map((o) => o + o).join("").toUpperCase() : c.length === 6 ? c : null;
   }
-  const s = /rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)(?:[,\s/]+[\d.]+)?\s*\)/i, C = q.match(s);
+  const s = /rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)(?:[,\s/]+[\d.]+)?\s*\)/i, C = K.match(s);
   if (C) {
     const c = Math.min(255, Math.max(0, parseFloat(C[1]))), o = Math.min(255, Math.max(0, parseFloat(C[2]))), a = Math.min(255, Math.max(0, parseFloat(C[3])));
     return ((1 << 24) + (c << 16) + (o << 8) + a).toString(16).slice(1).toUpperCase();
   }
   return null;
 };
-function ie(j) {
-  const q = {};
-  if (j.bl === 1 && (q.bold = !0), j.it === 1 && (q.italic = !0), j.un === 1 && (q.underline = !0), j.cl === 1 && (q.strike = !0), j.fs && (q.size = Number(j.fs)), typeof j.ff == "string" && j.ff && (q.name = j.ff), j.fc) {
-    const s = ne(j.fc);
-    s && (q.color = { argb: `FF${s}` });
+function ie(L) {
+  const K = {};
+  if (L.bl === 1 && (K.bold = !0), L.it === 1 && (K.italic = !0), L.un === 1 && (K.underline = !0), L.cl === 1 && (K.strike = !0), L.fs && (K.size = Number(L.fs)), typeof L.ff == "string" && L.ff && (K.name = L.ff), L.fc) {
+    const s = ne(L.fc);
+    s && (K.color = { argb: `FF${s}` });
   }
-  return Object.keys(q).length > 0 ? q : void 0;
+  return Object.keys(K).length > 0 ? K : void 0;
 }
-function Rt(j) {
-  if (!Array.isArray(j) || j.length === 0) return null;
-  const q = [];
-  for (const s of j) {
+function Rt(L) {
+  if (!Array.isArray(L) || L.length === 0) return null;
+  const K = [];
+  for (const s of L) {
     const C = String(s.v ?? "");
     if (C === "" && !s.bl && !s.it && !s.un && !s.cl) continue;
     const c = ie(s), o = { text: C };
-    c && (o.font = c), q.push(o);
+    c && (o.font = c), K.push(o);
   }
-  return q.length === 0 || !q.some((s) => s.text !== "") ? null : { richText: q };
+  return K.length === 0 || !K.some((s) => s.text !== "") ? null : { richText: K };
 }
-function ae(j, q) {
-  q.forEach((s, C) => {
-    const c = j.getCell(C);
+function ae(L, K) {
+  K.forEach((s, C) => {
+    const c = L.getCell(C);
     c.value = s;
   });
 }
-function se(j) {
-  const q = j == null ? void 0 : j.filter, s = j == null ? void 0 : j.filter_select, C = !!(q && Object.keys(q).length > 0), c = !!s && (Array.isArray(s.row) || Array.isArray(s.column));
+function se(L) {
+  const K = L == null ? void 0 : L.filter, s = L == null ? void 0 : L.filter_select, C = !!(K && Object.keys(K).length > 0), c = !!s && (Array.isArray(s.row) || Array.isArray(s.column));
   return C || c;
 }
-const St = (j) => {
-  if (!j || typeof j != "string") return null;
-  const q = j.trim().toLowerCase();
-  if (q.startsWith("#")) {
-    const c = q.replace("#", "").toUpperCase();
+const St = (L) => {
+  if (!L || typeof L != "string") return null;
+  const K = L.trim().toLowerCase();
+  if (K.startsWith("#")) {
+    const c = K.replace("#", "").toUpperCase();
     return c.length === 3 ? c.split("").map((o) => o + o).join("").toUpperCase() : c.length === 6 ? c : null;
   }
-  const s = /rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)(?:[,\s/]+[\d.]+)?\s*\)/i, C = q.match(s);
+  const s = /rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)(?:[,\s/]+[\d.]+)?\s*\)/i, C = K.match(s);
   if (C) {
     const c = Math.min(255, Math.max(0, parseFloat(C[1]))), o = Math.min(255, Math.max(0, parseFloat(C[2]))), a = Math.min(255, Math.max(0, parseFloat(C[3])));
     return ((1 << 24) + (c << 16) + (o << 8) + a).toString(16).slice(1).toUpperCase();
   }
   return null;
-}, pe = async (j, q, s, C) => {
+}, de = async (L, K, s, C) => {
   var c, o, a, r;
-  if (!(!j.current || !q.current))
+  if (!(!L.current || !K.current))
     try {
-      const l = (o = (c = j.current).getWorkbookContext) == null ? void 0 : o.call(c), d = l == null ? void 0 : l.luckysheetfile;
+      const l = (o = (c = L.current).getWorkbookContext) == null ? void 0 : o.call(c), d = l == null ? void 0 : l.luckysheetfile;
       Array.isArray(d) && d.some(se) && Ut({
         title: "Filters are not supported in Export",
         variant: "warning",
         showCloseButton: !0,
         duration: 30 * 1e3
-      }), q.current.getArray(s);
-      const g = j.current.getAllSheets(), y = dt.book_new(), n = g.map(() => /* @__PURE__ */ new Map());
+      }), K.current.getArray(s);
+      const g = L.current.getAllSheets(), y = dt.book_new(), n = g.map(() => /* @__PURE__ */ new Map());
       g.forEach((D, I) => {
         var e, F, Q, M, et, U;
-        const H = ((e = g[I]) == null ? void 0 : e.data) || [], Y = dt.aoa_to_sheet(H);
-        Object.keys(Y).forEach((K) => {
-          if (K.startsWith("!")) return;
-          const E = Y[K];
-          E && (E.t === "s" || E.t === void 0) && E.v !== "" && !isNaN(Number(E.v)) && (Y[K] = { ...E, v: Number(E.v), t: "n" });
-        }), Y["!merges"] = [], (F = D.config) != null && F.merge && Object.values(D.config.merge).forEach((K) => {
-          Y["!merges"].push({
-            s: { r: K.r, c: K.c },
-            e: { r: K.r + K.rs - 1, c: K.c + K.cs - 1 }
+        const H = ((e = g[I]) == null ? void 0 : e.data) || [], q = dt.aoa_to_sheet(H);
+        Object.keys(q).forEach((Y) => {
+          if (Y.startsWith("!")) return;
+          const E = q[Y];
+          E && (E.t === "s" || E.t === void 0) && E.v !== "" && !isNaN(Number(E.v)) && (q[Y] = { ...E, v: Number(E.v), t: "n" });
+        }), q["!merges"] = [], (F = D.config) != null && F.merge && Object.values(D.config.merge).forEach((Y) => {
+          q["!merges"].push({
+            s: { r: Y.r, c: Y.c },
+            e: { r: Y.r + Y.rs - 1, c: Y.c + Y.cs - 1 }
           });
         });
         {
           const E = Math.round(3437.714285714286) / 256, w = D.column || 36;
-          Y["!cols"] = [];
+          q["!cols"] = [];
           for (let N = 0; N < w; N++) {
             const $ = (M = (Q = D.config) == null ? void 0 : Q.columnlen) == null ? void 0 : M[N];
             if ($ !== void 0) {
@@ -2911,26 +2913,26 @@ const St = (j) => {
                 0,
                 Math.round((Number($) - 5) / 7 * 256) / 256
               );
-              Y["!cols"][N] = { wch: B };
+              q["!cols"][N] = { wch: B };
             } else
-              Y["!cols"][N] = { wch: E };
+              q["!cols"][N] = { wch: E };
           }
         }
         {
-          const K = Math.round(60.48) / 4;
-          Y.sheetFormat = {
-            ...Y.sheetFormat || {},
-            defaultRowHeight: String(K)
-          }, (et = D.config) != null && et.rowlen && (Y["!rows"] = [], Object.entries(D.config.rowlen).forEach(([E, w]) => {
+          const Y = Math.round(60.48) / 4;
+          q.sheetFormat = {
+            ...q.sheetFormat || {},
+            defaultRowHeight: String(Y)
+          }, (et = D.config) != null && et.rowlen && (q["!rows"] = [], Object.entries(D.config.rowlen).forEach(([E, w]) => {
             const N = Math.round(Number(w) * 0.72 * 4) / 4;
-            Y["!rows"][Number(E)] = { hpt: N };
+            q["!rows"][Number(E)] = { hpt: N };
           }));
         }
         const b = /* @__PURE__ */ new Set();
-        (D.celldata ?? []).forEach((K) => {
+        (D.celldata ?? []).forEach((Y) => {
           var tt, nt, st, ot, ft;
-          const E = K.r, w = K.c, N = K.v || {}, $ = dt.encode_cell({ r: E, c: w });
-          let B = Y[$] || {};
+          const E = Y.r, w = Y.c, N = Y.v || {}, $ = dt.encode_cell({ r: E, c: w });
+          let B = q[$] || {};
           if (B = { ...B }, N.f && (B.f = N.f.replace(/^=/, "")), !N.f && ((tt = N.ct) == null ? void 0 : tt.t) === "inlineStr" && Array.isArray(N.ct.s) ? (B.v = zt(N.ct.s), B.t = "s") : B.v = N.v ?? ((ot = (st = (nt = N == null ? void 0 : N.ct) == null ? void 0 : nt.s) == null ? void 0 : st[0]) == null ? void 0 : ot.v), N.m && (B.w = N.m), !N.f && ((ft = N.ct) == null ? void 0 : ft.t) === "inlineStr" && Array.isArray(N.ct.s)) {
             const ct = Rt(N.ct.s);
             ct && n[I].set($, ct);
@@ -2960,15 +2962,15 @@ const St = (j) => {
             ...B.s.alignment || {},
             wrapText: N.tb === "1" || N.tb === "2" ? !0 : void 0,
             textRotation: N.tr !== void 0 ? N.tr : void 0
-          }, B.s.alignment.horizontal = it[N.ht] || void 0, B.s.alignment.vertical = rt[N.vt] || void 0, N.tb !== void 0 && (B.s.alignment = B.s.alignment || {}, N.tb === "1" ? B.s.alignment.wrapText = !0 : N.tb === "2" && (B.s.alignment.shrinkToFit = !0)), b.add($), Y[$] = B;
-        }), (D.data ?? []).forEach((K, E) => {
-          Array.isArray(K) && K.forEach((w, N) => {
+          }, B.s.alignment.horizontal = it[N.ht] || void 0, B.s.alignment.vertical = rt[N.vt] || void 0, N.tb !== void 0 && (B.s.alignment = B.s.alignment || {}, N.tb === "1" ? B.s.alignment.wrapText = !0 : N.tb === "2" && (B.s.alignment.shrinkToFit = !0)), b.add($), q[$] = B;
+        }), (D.data ?? []).forEach((Y, E) => {
+          Array.isArray(Y) && Y.forEach((w, N) => {
             if (!w || typeof w != "object") return;
             const $ = dt.encode_cell({ r: E, c: N });
             if (b.has($)) return;
             const B = !!w.f, it = w.bg || w.bl || w.it || w.cl || w.un || w.fs || w.ff || w.fc || w.ht !== void 0 || w.vt !== void 0 || w.tb !== void 0 || w.tr !== void 0;
             if (!B && !it) return;
-            const rt = { ...Y[$] || {} };
+            const rt = { ...q[$] || {} };
             if (rt.s = rt.s || {}, B && (rt.f = w.f.replace(/^=/, "")), w.bg) {
               const st = St(w.bg);
               st && (rt.s.fill = { patternType: "solid", fgColor: { rgb: st } });
@@ -2992,24 +2994,24 @@ const St = (j) => {
               horizontal: tt[w.ht] || void 0,
               vertical: nt[w.vt] || void 0,
               textRotation: w.tr !== void 0 ? w.tr : void 0
-            }, w.tb === "1" ? rt.s.alignment.wrapText = !0 : w.tb === "2" && (rt.s.alignment.shrinkToFit = !0), Y[$] = rt;
+            }, w.tb === "1" ? rt.s.alignment.wrapText = !0 : w.tb === "2" && (rt.s.alignment.shrinkToFit = !0), q[$] = rt;
           });
-        }), (D.data ?? []).forEach((K, E) => {
-          Array.isArray(K) && K.forEach((w, N) => {
+        }), (D.data ?? []).forEach((Y, E) => {
+          Array.isArray(Y) && Y.forEach((w, N) => {
             var rt;
             if (!w || ((rt = w.ct) == null ? void 0 : rt.t) !== "inlineStr" || !Array.isArray(w.ct.s)) return;
             const $ = dt.encode_cell({ r: E, c: N }), B = zt(w.ct.s);
-            Y[$] = {
-              ...Y[$] || {},
+            q[$] = {
+              ...q[$] || {},
               v: B,
               t: "s"
             };
             const it = Rt(w.ct.s);
             it && n[I].set($, it);
           });
-        }), (U = D.config) != null && U.borderInfo && $t(Y, D.config.borderInfo);
+        }), (U = D.config) != null && U.borderInfo && $t(q, D.config.borderInfo);
         const R = D.name.length > 30 ? D.name.slice(0, 30) : D.name;
-        dt.book_append_sheet(y, Y, R);
+        dt.book_append_sheet(y, q, R);
       });
       const p = await (C == null ? void 0 : C(s)) || "Untitled", i = Nt(y, {
         bookType: "xlsx",
@@ -3026,14 +3028,14 @@ const St = (j) => {
         const H = h.worksheets[I];
         if (!H) return;
         ae(H, n[I]);
-        const Y = D.data;
+        const q = D.data;
         Object.entries(D.hyperlink || {}).forEach(([M, et]) => {
           var rt, tt, nt, st;
           const U = Wt(et);
           if (!(U != null && U.linkAddress)) return;
-          const [K, E] = M.split("_").map(Number);
-          if (Number.isNaN(K) || Number.isNaN(E)) return;
-          const w = dt.encode_cell({ r: K, c: E }), N = H.getCell(w), $ = (rt = Y == null ? void 0 : Y[K]) == null ? void 0 : rt[E];
+          const [Y, E] = M.split("_").map(Number);
+          if (Number.isNaN(Y) || Number.isNaN(E)) return;
+          const w = dt.encode_cell({ r: Y, c: E }), N = H.getCell(w), $ = (rt = q == null ? void 0 : q[Y]) == null ? void 0 : rt[E];
           let B = "";
           $ && typeof $ == "object" && ((tt = $.ct) == null ? void 0 : tt.t) === "inlineStr" && Array.isArray($.ct.s) && (B = zt($.ct.s));
           const it = B || (typeof N.text == "string" && N.text.length > 0 ? N.text : ((nt = N.value) == null ? void 0 : nt.text) || (Array.isArray((st = N.value) == null ? void 0 : st.richText) ? N.value.richText.map((ot) => ot.text || "").join("") : "") || "");
@@ -3042,7 +3044,7 @@ const St = (j) => {
             hyperlink: U.linkAddress
           };
         });
-        const { nextPriority: b, pendingDuplicateValues: R } = Yt(H, D, 1);
+        const { nextPriority: b, pendingDuplicateValues: R } = qt(H, D, 1);
         _[I] = { duplicateValues: R };
         let e = b;
         if (!D.dataVerification) return;
@@ -3052,7 +3054,7 @@ const St = (j) => {
         Object.entries(D.dataVerification).forEach(([M, et]) => {
           const U = et;
           if (U.type !== "dropdown" && U.type !== "checkbox") return;
-          const [K, E] = M.split("_").map(Number), w = dt.encode_cell({ r: K, c: E });
+          const [Y, E] = M.split("_").map(Number), w = dt.encode_cell({ r: Y, c: E });
           if (U.type === "checkbox") {
             const $ = (U.value1 || "TRUE").trim(), B = (U.value2 || "FALSE").trim(), it = [$, B].filter(Boolean);
             Q[w] = {
@@ -3103,24 +3105,24 @@ const St = (j) => {
         if (!((R = D.images) != null && R.length)) return;
         const H = h.worksheets[I];
         if (!H) return;
-        const Y = Number(D.defaultColWidth) || 99, b = Number(D.defaultRowHeight) || 21;
+        const q = Number(D.defaultColWidth) || 99, b = Number(D.defaultRowHeight) || 21;
         Lt(
           H,
           h,
           D.images,
           D,
-          Y,
+          q,
           b
         );
       });
       const k = await h.xlsx.writeBuffer(), A = await re(k, _), S = new Blob([A], {
         type: "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet"
-      }), L = URL.createObjectURL(S), O = document.createElement("a");
-      O.href = L, O.download = `${p}.xlsx`, O.click(), URL.revokeObjectURL(L);
+      }), j = URL.createObjectURL(S), O = document.createElement("a");
+      O.href = j, O.download = `${p}.xlsx`, O.click(), URL.revokeObjectURL(j);
     } catch (l) {
       console.error("Export failed:", l);
     }
 };
 export {
-  pe as handleExportToXLSX
+  de as handleExportToXLSX
 };