ppt-dsl-renderer 1.1.6 → 1.1.7

package/dist/cli.js

@@ -7,10 +7,10 @@ import { randomUUID as qt } from "node:crypto";
 import { createRequire as oe } from "node:module";
 import Jt from "node:fs";
 function le(S) {
-  const M = { status: "loading", errors: [] };
-  S.__PPT_DSL_RENDER__ = M;
+  const L = { status: "loading", errors: [] };
+  S.__PPT_DSL_RENDER__ = L;
   const n = (k) => {
-    M.status = "error", M.errors.push(k);
+    L.status = "error", L.errors.push(k);
   };
   S.addEventListener("error", (k) => {
     var g;
@@ -19,19 +19,19 @@ function le(S) {
     var g;
     n(((g = k.reason) == null ? void 0 : g.message) || String(k.reason));
   }), S.setTimeout(() => {
-    M.status === "loading" && n("渲染超过 30 秒仍未完成");
+    L.status === "loading" && n("渲染超过 30 秒仍未完成");
   }, 3e4);
 }
 function he(S) {
-  const { width: M, height: n } = JSON.parse(S.document.getElementById("ppt-dsl-data").textContent), k = S.document.getElementById("ppt-stage"), g = S.document.getElementById("ppt-root");
-  g.style.width = `${M}px`, g.style.height = `${n}px`;
+  const { width: L, height: n } = JSON.parse(S.document.getElementById("ppt-dsl-data").textContent), k = S.document.getElementById("ppt-stage"), g = S.document.getElementById("ppt-root");
+  g.style.width = `${L}px`, g.style.height = `${n}px`;
   const l = () => {
-    const a = Math.min(1, S.innerWidth / M, S.innerHeight / n);
-    k.style.width = `${M * a}px`, k.style.height = `${n * a}px`, g.style.transform = `scale(${a})`;
+    const a = Math.min(1, S.innerWidth / L, S.innerHeight / n);
+    k.style.width = `${L * a}px`, k.style.height = `${n * a}px`, g.style.transform = `scale(${a})`;
   };
   l(), S.addEventListener("resize", l);
 }
-function ce(S, M, n) {
+function ce(S, L, n) {
   const k = S.replaceAll("<", "\\u003c").replaceAll("\u2028", "\\u2028").replaceAll("\u2029", "\\u2029");
   return `<!doctype html>
 <html lang="zh-CN">
@@ -50,27 +50,27 @@ html, body { width: 100%; height: 100%; overflow: hidden; }
 <div id="ppt-viewport"><div id="ppt-stage"><div id="ppt-root"></div></div></div>
 <script id="ppt-dsl-data" type="application/json">${k}<\/script>
 <script>(${le.toString()})(window);(${he.toString()})(window);<\/script>
-<script>${M.replace(/<\/script/gi, "<\\/script")}<\/script>
+<script>${L.replace(/<\/script/gi, "<\\/script")}<\/script>
 </body>
 </html>`;
 }
 const ue = /* @__PURE__ */ new Set(["text", "image", "shape", "line", "chart", "table", "latex", "video", "audio"]), de = /* @__PURE__ */ new Set(["area", "bar", "column", "line", "pie", "radar", "ring", "scatter"]), vt = (S) => S !== null && typeof S == "object" && !Array.isArray(S), dt = (S) => typeof S == "string", Ft = (S) => Array.isArray(S) && S.length === 2 && S.every(Number.isFinite);
-function ht(S, M) {
+function ht(S, L) {
   if (!S)
-    throw new Error(M);
+    throw new Error(L);
 }
-function Rt(S, M) {
-  ht(dt(S) && /^(https?:\/\/|data:)/i.test(S), `${M} 必须使用 HTTP(S) URL 或 data URL`);
+function Rt(S, L) {
+  ht(dt(S) && /^(https?:\/\/|data:)/i.test(S), `${L} 必须使用 HTTP(S) URL 或 data URL`);
   const n = new URL(S);
-  ht(["http:", "https:", "data:"].includes(n.protocol), `${M} 资源协议不受支持`);
+  ht(["http:", "https:", "data:"].includes(n.protocol), `${L} 资源协议不受支持`);
 }
 function Vt(S) {
-  ht(vt(S), "DSL 顶层必须是对象"), ht(dt(S.title) && S.title.length > 0, "DSL 缺少 title"), ht(Number.isFinite(S.width) && S.width > 0, "DSL width 必须是大于 0 的有限数值"), ht(Number.isFinite(S.height) && S.height > 0, "DSL height 必须是大于 0 的有限数值"), ht(Array.isArray(S.slides) && S.slides.length > 0, "DSL slides 不能为空"), S.slides.forEach((M, n) => {
+  ht(vt(S), "DSL 顶层必须是对象"), ht(dt(S.title) && S.title.length > 0, "DSL 缺少 title"), ht(Number.isFinite(S.width) && S.width > 0, "DSL width 必须是大于 0 的有限数值"), ht(Number.isFinite(S.height) && S.height > 0, "DSL height 必须是大于 0 的有限数值"), ht(Array.isArray(S.slides) && S.slides.length > 0, "DSL slides 不能为空"), S.slides.forEach((L, n) => {
     var l, a;
     const k = `第 ${n + 1} 页`;
-    ht(vt(M) && dt(M.id) && M.id && Array.isArray(M.elements), `${k}结构无效`), ((l = M.background) == null ? void 0 : l.type) === "image" && Rt((a = M.background.image) == null ? void 0 : a.src, `${k}背景图`);
+    ht(vt(L) && dt(L.id) && L.id && Array.isArray(L.elements), `${k}结构无效`), ((l = L.background) == null ? void 0 : l.type) === "image" && Rt((a = L.background.image) == null ? void 0 : a.src, `${k}背景图`);
     const g = /* @__PURE__ */ new Set();
-    M.elements.forEach((e) => {
+    L.elements.forEach((e) => {
       var u;
       ht(vt(e) && dt(e.id) && e.id && ue.has(e.type), `${k}存在无效元素`);
       const s = `${k}元素 ${e.id}`;
@@ -107,13 +107,13 @@ function Vt(S) {
     });
   });
 }
-function Qt(S, M) {
-  return M === void 0 ? Array.from({ length: S }, (n, k) => k + 1) : (ht(Array.isArray(M) && M.length > 0, "pages 必须是非空页码数组"), ht(M.every((n) => Number.isInteger(n) && n >= 1 && n <= S), `页码必须是 1 到 ${S} 的整数`), [...new Set(M)].sort((n, k) => n - k));
+function Qt(S, L) {
+  return L === void 0 ? Array.from({ length: S }, (n, k) => k + 1) : (ht(Array.isArray(L) && L.length > 0, "pages 必须是非空页码数组"), ht(L.every((n) => Number.isInteger(n) && n >= 1 && n <= S), `页码必须是 1 到 ${S} 的整数`), [...new Set(L)].sort((n, k) => n - k));
 }
 const Zt = pt(It(Ut(import.meta.url)), "..");
-async function fe(S, M = {}) {
+async function fe(S, L = {}) {
   Vt(S);
-  const k = Qt(S.slides.length, M.pages).map((a) => ({
+  const k = Qt(S.slides.length, L.pages).map((a) => ({
     pageNumber: a,
     slideId: S.slides[a - 1].id,
     width: S.width,
@@ -141,7 +141,7 @@ async function fe(S, M = {}) {
   }));
 }
 const pe = pt(It(Ut(import.meta.url)), "..");
-async function me(S, M, { pages: n, executablePath: k, timeout: g = 12e4 } = {}) {
+async function me(S, L, { pages: n, executablePath: k, timeout: g = 12e4 } = {}) {
   Vt(S);
   const l = Qt(S.slides.length, n), a = await xt(St(pe, "dist/pptx/exporter.js"), "utf8").catch((b) => {
     throw b.code !== "ENOENT" ? b : new Error("安装包缺少 PPTX 运行产物，请使用完整构建的 ppt-dsl-renderer 包。", { cause: b });
@@ -156,8 +156,8 @@ async function me(S, M, { pages: n, executablePath: k, timeout: g = 12e4 } = {})
       const m = await o.evaluate(async ({ document: i, pages: f }) => {
         const c = await window.exportToPptx(i, { pages: f });
         return new Promise((w, x) => {
-          const E = new FileReader();
-          E.onload = () => w(E.result.split(",", 2)[1]), E.onerror = () => x(E.error), E.readAsDataURL(new Blob([c]));
+          const A = new FileReader();
+          A.onload = () => w(A.result.split(",", 2)[1]), A.onerror = () => x(A.error), A.readAsDataURL(new Blob([c]));
         });
       }, { document: S, pages: l });
       return Buffer.from(m, "base64");
@@ -171,14 +171,14 @@ async function me(S, M, { pages: n, executablePath: k, timeout: g = 12e4 } = {})
   } finally {
     clearTimeout(u), await s.close();
   }
-  await Pt(It(M), { recursive: !0 });
-  const p = `${M}.${qt()}.tmp`;
+  await Pt(It(L), { recursive: !0 });
+  const p = `${L}.${qt()}.tmp`;
   try {
-    await Lt(p, h, { flag: "wx" }), await Xt(p, M);
+    await Lt(p, h, { flag: "wx" }), await Xt(p, L);
   } finally {
     await Kt(p, { force: !0 });
   }
-  return { file: M, pages: l.map((b) => ({ pageNumber: b, slideId: S.slides[b - 1].id })), bytes: h.length };
+  return { file: L, pages: l.map((b) => ({ pageNumber: b, slideId: S.slides[b - 1].id })), bytes: h.length };
 }
 const kt = `Usage:
   ppt-dsl-renderer render <deck.json> --out-dir <directory> [--pages 1,3]
@@ -200,7 +200,7 @@ export-pptx requires Chrome or Chromium installed at deployment time; it never d
 export-html-pptx has the same browser requirement; a directory reads direct .html children in natural order.`;
 async function ge() {
   var u;
-  const { values: S, positionals: M } = ae({
+  const { values: S, positionals: L } = ae({
     allowPositionals: !0,
     options: {
       "out-dir": { type: "string" },
@@ -217,8 +217,8 @@ async function ge() {
     console.log(kt);
     return;
   }
-  const [n, k] = M;
-  if (M.length !== 2 || !["render", "export-pptx", "export-html-pptx"].includes(n))
+  const [n, k] = L;
+  if (L.length !== 2 || !["render", "export-pptx", "export-html-pptx"].includes(n))
     throw new Error(kt);
   if (n === "render" && (!S["out-dir"] || S.out !== void 0 || S["browser-executable"] !== void 0 || S.timeout !== void 0 || S.selector !== void 0 || S["assets-root"] !== void 0))
     throw new Error(kt);
@@ -283,7 +283,7 @@ 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(S, M) {
+(function(S, L) {
   (function(n) {
     S.exports = n();
   })(function() {
@@ -313,8 +313,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
     }({ 1: [function(n, k, g) {
       var l = n("./utils"), a = n("./support"), e = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
       g.encode = function(s) {
-        for (var u, h, p, b, o, m, i, f = [], c = 0, w = s.length, x = w, E = l.getTypeOf(s) !== "string"; c < s.length; )
-          x = w - c, p = E ? (u = s[c++], h = c < w ? s[c++] : 0, c < w ? s[c++] : 0) : (u = s.charCodeAt(c++), h = c < w ? s.charCodeAt(c++) : 0, c < w ? s.charCodeAt(c++) : 0), b = u >> 2, o = (3 & u) << 4 | h >> 4, m = 1 < x ? (15 & h) << 2 | p >> 6 : 64, i = 2 < x ? 63 & p : 64, f.push(e.charAt(b) + e.charAt(o) + e.charAt(m) + e.charAt(i));
+        for (var u, h, p, b, o, m, i, f = [], c = 0, w = s.length, x = w, A = l.getTypeOf(s) !== "string"; c < s.length; )
+          x = w - c, p = A ? (u = s[c++], h = c < w ? s[c++] : 0, c < w ? s[c++] : 0) : (u = s.charCodeAt(c++), h = c < w ? s.charCodeAt(c++) : 0, c < w ? s.charCodeAt(c++) : 0), b = u >> 2, o = (3 & u) << 4 | h >> 4, m = 1 < x ? (15 & h) << 2 | p >> 6 : 64, i = 2 < x ? 63 & p : 64, f.push(e.charAt(b) + e.charAt(o) + e.charAt(m) + e.charAt(i));
         return f.join("");
       }, g.decode = function(s) {
         var u, h, p, b, o, m, i = 0, f = 0, c = "data:";
@@ -410,20 +410,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return f;
       }
       function a(o, m, i, f, c, w) {
-        var x, E, A = o.file, U = o.compression, N = w !== u.utf8encode, Z = e.transformTo("string", w(A.name)), v = e.transformTo("string", u.utf8encode(A.name)), T = A.comment, D = e.transformTo("string", w(T)), d = e.transformTo("string", u.utf8encode(T)), z = v.length !== A.name.length, r = d.length !== T.length, P = "", V = "", F = "", tt = A.dir, L = A.date, H = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
-        m && !i || (H.crc32 = o.crc32, H.compressedSize = o.compressedSize, H.uncompressedSize = o.uncompressedSize);
-        var B = 0;
-        m && (B |= 8), N || !z && !r || (B |= 2048);
-        var I = 0, q = 0;
-        tt && (I |= 16), c === "UNIX" ? (q = 798, I |= function(K, ot) {
-          var et = K;
-          return K || (et = ot ? 16893 : 33204), (65535 & et) << 16;
-        }(A.unixPermissions, tt)) : (q = 20, I |= function(K) {
+        var x, A, z = o.file, M = o.compression, D = w !== u.utf8encode, H = e.transformTo("string", w(z.name)), v = e.transformTo("string", u.utf8encode(z.name)), B = z.comment, R = e.transformTo("string", w(B)), d = e.transformTo("string", u.utf8encode(B)), I = v.length !== z.name.length, r = d.length !== B.length, P = "", q = "", U = "", nt = z.dir, F = z.date, Z = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+        m && !i || (Z.crc32 = o.crc32, Z.compressedSize = o.compressedSize, Z.uncompressedSize = o.uncompressedSize);
+        var T = 0;
+        m && (T |= 8), D || !I && !r || (T |= 2048);
+        var E = 0, J = 0;
+        nt && (E |= 16), c === "UNIX" ? (J = 798, E |= function(K, ot) {
+          var tt = K;
+          return K || (tt = ot ? 16893 : 33204), (65535 & tt) << 16;
+        }(z.unixPermissions, nt)) : (J = 20, E |= function(K) {
           return 63 & (K || 0);
-        }(A.dosPermissions)), x = L.getUTCHours(), x <<= 6, x |= L.getUTCMinutes(), x <<= 5, x |= L.getUTCSeconds() / 2, E = L.getUTCFullYear() - 1980, E <<= 4, E |= L.getUTCMonth() + 1, E <<= 5, E |= L.getUTCDate(), z && (V = l(1, 1) + l(h(Z), 4) + v, P += "up" + l(V.length, 2) + V), r && (F = l(1, 1) + l(h(D), 4) + d, P += "uc" + l(F.length, 2) + F);
+        }(z.dosPermissions)), x = F.getUTCHours(), x <<= 6, x |= F.getUTCMinutes(), x <<= 5, x |= F.getUTCSeconds() / 2, A = F.getUTCFullYear() - 1980, A <<= 4, A |= F.getUTCMonth() + 1, A <<= 5, A |= F.getUTCDate(), I && (q = l(1, 1) + l(h(H), 4) + v, P += "up" + l(q.length, 2) + q), r && (U = l(1, 1) + l(h(R), 4) + d, P += "uc" + l(U.length, 2) + U);
         var Y = "";
         return Y += `
-\0`, Y += l(B, 2), Y += U.magic, Y += l(x, 2), Y += l(E, 2), Y += l(H.crc32, 4), Y += l(H.compressedSize, 4), Y += l(H.uncompressedSize, 4), Y += l(Z.length, 2), Y += l(P.length, 2), { fileRecord: p.LOCAL_FILE_HEADER + Y + Z + P, dirRecord: p.CENTRAL_FILE_HEADER + l(q, 2) + Y + l(D.length, 2) + "\0\0\0\0" + l(I, 4) + l(f, 4) + Z + P + D };
+\0`, Y += l(T, 2), Y += M.magic, Y += l(x, 2), Y += l(A, 2), Y += l(Z.crc32, 4), Y += l(Z.compressedSize, 4), Y += l(Z.uncompressedSize, 4), Y += l(H.length, 2), Y += l(P.length, 2), { fileRecord: p.LOCAL_FILE_HEADER + Y + H + P, dirRecord: p.CENTRAL_FILE_HEADER + l(J, 2) + Y + l(R.length, 2) + "\0\0\0\0" + l(E, 4) + l(f, 4) + H + P + R };
       }
       var e = n("../utils"), s = n("../stream/GenericWorker"), u = n("../utf8"), h = n("../crc32"), p = n("../signature");
       function b(o, m, i, f) {
@@ -454,9 +454,9 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }, b.prototype.flush = function() {
         for (var o = this.bytesWritten, m = 0; m < this.dirRecords.length; m++)
           this.push({ data: this.dirRecords[m], meta: { percent: 100 } });
-        var i = this.bytesWritten - o, f = function(c, w, x, E, A) {
-          var U = e.transformTo("string", A(E));
-          return p.CENTRAL_DIRECTORY_END + "\0\0\0\0" + l(c, 2) + l(c, 2) + l(w, 4) + l(x, 4) + l(U.length, 2) + U;
+        var i = this.bytesWritten - o, f = function(c, w, x, A, z) {
+          var M = e.transformTo("string", z(A));
+          return p.CENTRAL_DIRECTORY_END + "\0\0\0\0" + l(c, 2) + l(c, 2) + l(w, 4) + l(x, 4) + l(M.length, 2) + M;
         }(this.dirRecords.length, i, o, this.zipComment, this.encodeFileName);
         this.push({ data: f, meta: { percent: 100 } });
       }, b.prototype.prepareNextSource = function() {
@@ -496,10 +496,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           e.forEach(function(b, o) {
             p++;
             var m = function(w, x) {
-              var E = w || x, A = l[E];
-              if (!A)
-                throw new Error(E + " is not a valid compression method !");
-              return A;
+              var A = w || x, z = l[A];
+              if (!z)
+                throw new Error(A + " is not a valid compression method !");
+              return z;
             }(o.options.compression, s.compression), i = o.options.compressionOptions || s.compressionOptions || {}, f = o.dir, c = o.date;
             o._compressWorker(m, i).withStreamInfo("file", { name: b, dir: f, date: c, comment: o.comment || "", unixPermissions: o.unixPermissions, dosPermissions: o.dosPermissions }).pipe(h);
           }), h.entriesCount = p;
@@ -549,8 +549,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           return a.Promise.all(f);
         }).then(function(i) {
           for (var f = i.shift(), c = f.files, w = 0; w < c.length; w++) {
-            var x = c[w], E = x.fileNameStr, A = l.resolve(x.fileNameStr);
-            m.file(A, x.decompressed, { binary: !0, optimizedBinaryString: !0, date: x.date, dir: x.dir, comment: x.fileCommentStr.length ? x.fileCommentStr : null, unixPermissions: x.unixPermissions, dosPermissions: x.dosPermissions, createFolders: o.createFolders }), x.dir || (m.file(A).unsafeOriginalName = E);
+            var x = c[w], A = x.fileNameStr, z = l.resolve(x.fileNameStr);
+            m.file(z, x.decompressed, { binary: !0, optimizedBinaryString: !0, date: x.date, dir: x.dir, comment: x.fileCommentStr.length ? x.fileCommentStr : null, unixPermissions: x.unixPermissions, dosPermissions: x.dosPermissions, createFolders: o.createFolders }), x.dir || (m.file(z).unsafeOriginalName = A);
           }
           return f.zipComment.length && (m.comment = f.zipComment), m;
         });
@@ -608,90 +608,90 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return l && typeof l.on == "function" && typeof l.pause == "function" && typeof l.resume == "function";
       } };
     }, {}], 15: [function(n, k, g) {
-      function l(A, U, N) {
-        var Z, v = e.getTypeOf(U), T = e.extend(N || {}, h);
-        T.date = T.date || /* @__PURE__ */ new Date(), T.compression !== null && (T.compression = T.compression.toUpperCase()), typeof T.unixPermissions == "string" && (T.unixPermissions = parseInt(T.unixPermissions, 8)), T.unixPermissions && 16384 & T.unixPermissions && (T.dir = !0), T.dosPermissions && 16 & T.dosPermissions && (T.dir = !0), T.dir && (A = c(A)), T.createFolders && (Z = f(A)) && w.call(this, Z, !0);
-        var D = v === "string" && T.binary === !1 && T.base64 === !1;
-        N && N.binary !== void 0 || (T.binary = !D), (U instanceof p && U.uncompressedSize === 0 || T.dir || !U || U.length === 0) && (T.base64 = !1, T.binary = !0, U = "", T.compression = "STORE", v = "string");
+      function l(z, M, D) {
+        var H, v = e.getTypeOf(M), B = e.extend(D || {}, h);
+        B.date = B.date || /* @__PURE__ */ new Date(), B.compression !== null && (B.compression = B.compression.toUpperCase()), typeof B.unixPermissions == "string" && (B.unixPermissions = parseInt(B.unixPermissions, 8)), B.unixPermissions && 16384 & B.unixPermissions && (B.dir = !0), B.dosPermissions && 16 & B.dosPermissions && (B.dir = !0), B.dir && (z = c(z)), B.createFolders && (H = f(z)) && w.call(this, H, !0);
+        var R = v === "string" && B.binary === !1 && B.base64 === !1;
+        D && D.binary !== void 0 || (B.binary = !R), (M instanceof p && M.uncompressedSize === 0 || B.dir || !M || M.length === 0) && (B.base64 = !1, B.binary = !0, M = "", B.compression = "STORE", v = "string");
         var d = null;
-        d = U instanceof p || U instanceof s ? U : m.isNode && m.isStream(U) ? new i(A, U) : e.prepareContent(A, U, T.binary, T.optimizedBinaryString, T.base64);
-        var z = new b(A, d, T);
-        this.files[A] = z;
-      }
-      var a = n("./utf8"), e = n("./utils"), s = n("./stream/GenericWorker"), u = n("./stream/StreamHelper"), h = n("./defaults"), p = n("./compressedObject"), b = n("./zipObject"), o = n("./generate"), m = n("./nodejsUtils"), i = n("./nodejs/NodejsStreamInputAdapter"), f = function(A) {
-        A.slice(-1) === "/" && (A = A.substring(0, A.length - 1));
-        var U = A.lastIndexOf("/");
-        return 0 < U ? A.substring(0, U) : "";
-      }, c = function(A) {
-        return A.slice(-1) !== "/" && (A += "/"), A;
-      }, w = function(A, U) {
-        return U = U !== void 0 ? U : h.createFolders, A = c(A), this.files[A] || l.call(this, A, null, { dir: !0, createFolders: U }), this.files[A];
+        d = M instanceof p || M instanceof s ? M : m.isNode && m.isStream(M) ? new i(z, M) : e.prepareContent(z, M, B.binary, B.optimizedBinaryString, B.base64);
+        var I = new b(z, d, B);
+        this.files[z] = I;
+      }
+      var a = n("./utf8"), e = n("./utils"), s = n("./stream/GenericWorker"), u = n("./stream/StreamHelper"), h = n("./defaults"), p = n("./compressedObject"), b = n("./zipObject"), o = n("./generate"), m = n("./nodejsUtils"), i = n("./nodejs/NodejsStreamInputAdapter"), f = function(z) {
+        z.slice(-1) === "/" && (z = z.substring(0, z.length - 1));
+        var M = z.lastIndexOf("/");
+        return 0 < M ? z.substring(0, M) : "";
+      }, c = function(z) {
+        return z.slice(-1) !== "/" && (z += "/"), z;
+      }, w = function(z, M) {
+        return M = M !== void 0 ? M : h.createFolders, z = c(z), this.files[z] || l.call(this, z, null, { dir: !0, createFolders: M }), this.files[z];
       };
-      function x(A) {
-        return Object.prototype.toString.call(A) === "[object RegExp]";
+      function x(z) {
+        return Object.prototype.toString.call(z) === "[object RegExp]";
       }
-      var E = { load: function() {
+      var A = { load: function() {
         throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
-      }, forEach: function(A) {
-        var U, N, Z;
-        for (U in this.files)
-          Z = this.files[U], (N = U.slice(this.root.length, U.length)) && U.slice(0, this.root.length) === this.root && A(N, Z);
-      }, filter: function(A) {
-        var U = [];
-        return this.forEach(function(N, Z) {
-          A(N, Z) && U.push(Z);
-        }), U;
-      }, file: function(A, U, N) {
+      }, forEach: function(z) {
+        var M, D, H;
+        for (M in this.files)
+          H = this.files[M], (D = M.slice(this.root.length, M.length)) && M.slice(0, this.root.length) === this.root && z(D, H);
+      }, filter: function(z) {
+        var M = [];
+        return this.forEach(function(D, H) {
+          z(D, H) && M.push(H);
+        }), M;
+      }, file: function(z, M, D) {
         if (arguments.length !== 1)
-          return A = this.root + A, l.call(this, A, U, N), this;
-        if (x(A)) {
-          var Z = A;
-          return this.filter(function(T, D) {
-            return !D.dir && Z.test(T);
+          return z = this.root + z, l.call(this, z, M, D), this;
+        if (x(z)) {
+          var H = z;
+          return this.filter(function(B, R) {
+            return !R.dir && H.test(B);
           });
         }
-        var v = this.files[this.root + A];
+        var v = this.files[this.root + z];
         return v && !v.dir ? v : null;
-      }, folder: function(A) {
-        if (!A)
+      }, folder: function(z) {
+        if (!z)
           return this;
-        if (x(A))
-          return this.filter(function(v, T) {
-            return T.dir && A.test(v);
+        if (x(z))
+          return this.filter(function(v, B) {
+            return B.dir && z.test(v);
           });
-        var U = this.root + A, N = w.call(this, U), Z = this.clone();
-        return Z.root = N.name, Z;
-      }, remove: function(A) {
-        A = this.root + A;
-        var U = this.files[A];
-        if (U || (A.slice(-1) !== "/" && (A += "/"), U = this.files[A]), U && !U.dir)
-          delete this.files[A];
+        var M = this.root + z, D = w.call(this, M), H = this.clone();
+        return H.root = D.name, H;
+      }, remove: function(z) {
+        z = this.root + z;
+        var M = this.files[z];
+        if (M || (z.slice(-1) !== "/" && (z += "/"), M = this.files[z]), M && !M.dir)
+          delete this.files[z];
         else
-          for (var N = this.filter(function(v, T) {
-            return T.name.slice(0, A.length) === A;
-          }), Z = 0; Z < N.length; Z++)
-            delete this.files[N[Z].name];
+          for (var D = this.filter(function(v, B) {
+            return B.name.slice(0, z.length) === z;
+          }), H = 0; H < D.length; H++)
+            delete this.files[D[H].name];
         return this;
       }, generate: function() {
         throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
-      }, generateInternalStream: function(A) {
-        var U, N = {};
+      }, generateInternalStream: function(z) {
+        var M, D = {};
         try {
-          if ((N = e.extend(A || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: a.utf8encode })).type = N.type.toLowerCase(), N.compression = N.compression.toUpperCase(), N.type === "binarystring" && (N.type = "string"), !N.type)
+          if ((D = e.extend(z || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: a.utf8encode })).type = D.type.toLowerCase(), D.compression = D.compression.toUpperCase(), D.type === "binarystring" && (D.type = "string"), !D.type)
             throw new Error("No output type specified.");
-          e.checkSupport(N.type), N.platform !== "darwin" && N.platform !== "freebsd" && N.platform !== "linux" && N.platform !== "sunos" || (N.platform = "UNIX"), N.platform === "win32" && (N.platform = "DOS");
-          var Z = N.comment || this.comment || "";
-          U = o.generateWorker(this, N, Z);
+          e.checkSupport(D.type), D.platform !== "darwin" && D.platform !== "freebsd" && D.platform !== "linux" && D.platform !== "sunos" || (D.platform = "UNIX"), D.platform === "win32" && (D.platform = "DOS");
+          var H = D.comment || this.comment || "";
+          M = o.generateWorker(this, D, H);
         } catch (v) {
-          (U = new s("error")).error(v);
+          (M = new s("error")).error(v);
         }
-        return new u(U, N.type || "string", N.mimeType);
-      }, generateAsync: function(A, U) {
-        return this.generateInternalStream(A).accumulate(U);
-      }, generateNodeStream: function(A, U) {
-        return (A = A || {}).type || (A.type = "nodebuffer"), this.generateInternalStream(A).toNodejsStream(U);
+        return new u(M, D.type || "string", D.mimeType);
+      }, generateAsync: function(z, M) {
+        return this.generateInternalStream(z).accumulate(M);
+      }, generateNodeStream: function(z, M) {
+        return (z = z || {}).type || (z.type = "nodebuffer"), this.generateInternalStream(z).toNodejsStream(M);
       } };
-      k.exports = E;
+      k.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(n, k, g) {
       k.exports = n("stream");
     }, { stream: void 0 }], 17: [function(n, k, g) {
@@ -927,44 +927,44 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         }
       function b(m, i) {
         return new h.Promise(function(f, c) {
-          var w = [], x = m._internalType, E = m._outputType, A = m._mimeType;
-          m.on("data", function(U, N) {
-            w.push(U), i && i(N);
-          }).on("error", function(U) {
-            w = [], c(U);
+          var w = [], x = m._internalType, A = m._outputType, z = m._mimeType;
+          m.on("data", function(M, D) {
+            w.push(M), i && i(D);
+          }).on("error", function(M) {
+            w = [], c(M);
           }).on("end", function() {
             try {
-              var U = function(N, Z, v) {
-                switch (N) {
+              var M = function(D, H, v) {
+                switch (D) {
                   case "blob":
-                    return l.newBlob(l.transformTo("arraybuffer", Z), v);
+                    return l.newBlob(l.transformTo("arraybuffer", H), v);
                   case "base64":
-                    return s.encode(Z);
+                    return s.encode(H);
                   default:
-                    return l.transformTo(N, Z);
+                    return l.transformTo(D, H);
                 }
-              }(E, function(N, Z) {
-                var v, T = 0, D = null, d = 0;
-                for (v = 0; v < Z.length; v++)
-                  d += Z[v].length;
-                switch (N) {
+              }(A, function(D, H) {
+                var v, B = 0, R = null, d = 0;
+                for (v = 0; v < H.length; v++)
+                  d += H[v].length;
+                switch (D) {
                   case "string":
-                    return Z.join("");
+                    return H.join("");
                   case "array":
-                    return Array.prototype.concat.apply([], Z);
+                    return Array.prototype.concat.apply([], H);
                   case "uint8array":
-                    for (D = new Uint8Array(d), v = 0; v < Z.length; v++)
-                      D.set(Z[v], T), T += Z[v].length;
-                    return D;
+                    for (R = new Uint8Array(d), v = 0; v < H.length; v++)
+                      R.set(H[v], B), B += H[v].length;
+                    return R;
                   case "nodebuffer":
-                    return Buffer.concat(Z);
+                    return Buffer.concat(H);
                   default:
-                    throw new Error("concat : unsupported type '" + N + "'");
+                    throw new Error("concat : unsupported type '" + D + "'");
                 }
-              }(x, w), A);
-              f(U);
-            } catch (N) {
-              c(N);
+              }(x, w), z);
+              f(M);
+            } catch (D) {
+              c(D);
             }
             w = [];
           }).resume();
@@ -1037,27 +1037,27 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }
       g.utf8encode = function(o) {
         return a.nodebuffer ? e.newBufferFrom(o, "utf-8") : function(m) {
-          var i, f, c, w, x, E = m.length, A = 0;
-          for (w = 0; w < E; w++)
-            (64512 & (f = m.charCodeAt(w))) == 55296 && w + 1 < E && (64512 & (c = m.charCodeAt(w + 1))) == 56320 && (f = 65536 + (f - 55296 << 10) + (c - 56320), w++), A += f < 128 ? 1 : f < 2048 ? 2 : f < 65536 ? 3 : 4;
-          for (i = a.uint8array ? new Uint8Array(A) : new Array(A), w = x = 0; x < A; w++)
-            (64512 & (f = m.charCodeAt(w))) == 55296 && w + 1 < E && (64512 & (c = m.charCodeAt(w + 1))) == 56320 && (f = 65536 + (f - 55296 << 10) + (c - 56320), w++), f < 128 ? i[x++] = f : (f < 2048 ? i[x++] = 192 | f >>> 6 : (f < 65536 ? i[x++] = 224 | f >>> 12 : (i[x++] = 240 | f >>> 18, i[x++] = 128 | f >>> 12 & 63), i[x++] = 128 | f >>> 6 & 63), i[x++] = 128 | 63 & f);
+          var i, f, c, w, x, A = m.length, z = 0;
+          for (w = 0; w < A; w++)
+            (64512 & (f = m.charCodeAt(w))) == 55296 && w + 1 < A && (64512 & (c = m.charCodeAt(w + 1))) == 56320 && (f = 65536 + (f - 55296 << 10) + (c - 56320), w++), z += f < 128 ? 1 : f < 2048 ? 2 : f < 65536 ? 3 : 4;
+          for (i = a.uint8array ? new Uint8Array(z) : new Array(z), w = x = 0; x < z; w++)
+            (64512 & (f = m.charCodeAt(w))) == 55296 && w + 1 < A && (64512 & (c = m.charCodeAt(w + 1))) == 56320 && (f = 65536 + (f - 55296 << 10) + (c - 56320), w++), f < 128 ? i[x++] = f : (f < 2048 ? i[x++] = 192 | f >>> 6 : (f < 65536 ? i[x++] = 224 | f >>> 12 : (i[x++] = 240 | f >>> 18, i[x++] = 128 | f >>> 12 & 63), i[x++] = 128 | f >>> 6 & 63), i[x++] = 128 | 63 & f);
           return i;
         }(o);
       }, g.utf8decode = function(o) {
         return a.nodebuffer ? l.transformTo("nodebuffer", o).toString("utf-8") : function(m) {
-          var i, f, c, w, x = m.length, E = new Array(2 * x);
+          var i, f, c, w, x = m.length, A = new Array(2 * x);
           for (i = f = 0; i < x; )
             if ((c = m[i++]) < 128)
-              E[f++] = c;
+              A[f++] = c;
             else if (4 < (w = u[c]))
-              E[f++] = 65533, i += w - 1;
+              A[f++] = 65533, i += w - 1;
             else {
               for (c &= w === 2 ? 31 : w === 3 ? 15 : 7; 1 < w && i < x; )
                 c = c << 6 | 63 & m[i++], w--;
-              1 < w ? E[f++] = 65533 : c < 65536 ? E[f++] = c : (c -= 65536, E[f++] = 55296 | c >> 10 & 1023, E[f++] = 56320 | 1023 & c);
+              1 < w ? A[f++] = 65533 : c < 65536 ? A[f++] = c : (c -= 65536, A[f++] = 55296 | c >> 10 & 1023, A[f++] = 56320 | 1023 & c);
             }
-          return E.length !== f && (E.subarray ? E = E.subarray(0, f) : E.length = f), l.applyFromCharCode(E);
+          return A.length !== f && (A.subarray ? A = A.subarray(0, f) : A.length = f), l.applyFromCharCode(A);
         }(o = l.transformTo(a.uint8array ? "uint8array" : "array", o));
       }, l.inherits(p, s), p.prototype.processChunk = function(o) {
         var m = l.transformTo(a.uint8array ? "uint8array" : "array", o.data);
@@ -1070,10 +1070,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           this.leftOver = null;
         }
         var f = function(w, x) {
-          var E;
-          for ((x = x || w.length) > w.length && (x = w.length), E = x - 1; 0 <= E && (192 & w[E]) == 128; )
-            E--;
-          return E < 0 || E === 0 ? x : E + u[w[E]] > x ? E : x;
+          var A;
+          for ((x = x || w.length) > w.length && (x = w.length), A = x - 1; 0 <= A && (192 & w[A]) == 128; )
+            A--;
+          return A < 0 || A === 0 ? x : A + u[w[A]] > x ? A : x;
         }(m), c = m;
         f !== m.length && (a.uint8array ? (c = m.subarray(0, f), this.leftOver = m.subarray(f, m.length)) : (c = m.slice(0, f), this.leftOver = m.slice(f, m.length))), this.push({ data: g.utf8decode(c), meta: o.meta });
       }, p.prototype.flush = function() {
@@ -1105,11 +1105,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         }
       };
       var p = { stringifyByChunk: function(i, f, c) {
-        var w = [], x = 0, E = i.length;
-        if (E <= c)
+        var w = [], x = 0, A = i.length;
+        if (A <= c)
           return String.fromCharCode.apply(null, i);
-        for (; x < E; )
-          f === "array" || f === "nodebuffer" ? w.push(String.fromCharCode.apply(null, i.slice(x, Math.min(x + c, E)))) : w.push(String.fromCharCode.apply(null, i.subarray(x, Math.min(x + c, E)))), x += c;
+        for (; x < A; )
+          f === "array" || f === "nodebuffer" ? w.push(String.fromCharCode.apply(null, i.slice(x, Math.min(x + c, A)))) : w.push(String.fromCharCode.apply(null, i.subarray(x, Math.min(x + c, A)))), x += c;
         return w.join("");
       }, stringifyByChar: function(i) {
         for (var f = "", c = 0; c < i.length; c++)
@@ -1217,20 +1217,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             Object.prototype.hasOwnProperty.call(arguments[i], f) && c[f] === void 0 && (c[f] = arguments[i][f]);
         return c;
       }, g.prepareContent = function(i, f, c, w, x) {
-        return s.Promise.resolve(f).then(function(E) {
-          return l.blob && (E instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(E)) !== -1) && typeof FileReader < "u" ? new s.Promise(function(A, U) {
-            var N = new FileReader();
-            N.onload = function(Z) {
-              A(Z.target.result);
-            }, N.onerror = function(Z) {
-              U(Z.target.error);
-            }, N.readAsArrayBuffer(E);
-          }) : E;
-        }).then(function(E) {
-          var A = g.getTypeOf(E);
-          return A ? (A === "arraybuffer" ? E = g.transformTo("uint8array", E) : A === "string" && (x ? E = a.decode(E) : c && w !== !0 && (E = function(U) {
-            return h(U, l.uint8array ? new Uint8Array(U.length) : new Array(U.length));
-          }(E))), E) : s.Promise.reject(new Error("Can't read the data of '" + i + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
+        return s.Promise.resolve(f).then(function(A) {
+          return l.blob && (A instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(A)) !== -1) && typeof FileReader < "u" ? new s.Promise(function(z, M) {
+            var D = new FileReader();
+            D.onload = function(H) {
+              z(H.target.result);
+            }, D.onerror = function(H) {
+              M(H.target.error);
+            }, D.readAsArrayBuffer(A);
+          }) : A;
+        }).then(function(A) {
+          var z = g.getTypeOf(A);
+          return z ? (z === "arraybuffer" ? A = g.transformTo("uint8array", A) : z === "string" && (x ? A = a.decode(A) : c && w !== !0 && (A = function(M) {
+            return h(M, l.uint8array ? new Uint8Array(M.length) : new Array(M.length));
+          }(A))), A) : s.Promise.reject(new Error("Can't read the data of '" + i + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
         });
       };
     }, { "./base64": 1, "./external": 6, "./nodejsUtils": 14, "./support": 30, setimmediate: 54 }], 33: [function(n, k, g) {
@@ -1459,13 +1459,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }
       function o(c, w, x) {
         l(function() {
-          var E;
+          var A;
           try {
-            E = w(x);
-          } catch (A) {
-            return e.reject(c, A);
+            A = w(x);
+          } catch (z) {
+            return e.reject(c, z);
           }
-          E === c ? e.reject(c, new TypeError("Cannot resolve promise with itself")) : e.resolve(c, E);
+          A === c ? e.reject(c, new TypeError("Cannot resolve promise with itself")) : e.resolve(c, A);
         });
       }
       function m(c) {
@@ -1477,23 +1477,23 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }
       function i(c, w) {
         var x = !1;
-        function E(N) {
-          x || (x = !0, e.reject(c, N));
+        function A(D) {
+          x || (x = !0, e.reject(c, D));
         }
-        function A(N) {
-          x || (x = !0, e.resolve(c, N));
+        function z(D) {
+          x || (x = !0, e.resolve(c, D));
         }
-        var U = f(function() {
-          w(A, E);
+        var M = f(function() {
+          w(z, A);
         });
-        U.status === "error" && E(U.value);
+        M.status === "error" && A(M.value);
       }
       function f(c, w) {
         var x = {};
         try {
           x.value = c(w), x.status = "success";
-        } catch (E) {
-          x.status = "error", x.value = E;
+        } catch (A) {
+          x.status = "error", x.value = A;
         }
         return x;
       }
@@ -1529,18 +1529,18 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         var x = f(m, w);
         if (x.status === "error")
           return e.reject(c, x.value);
-        var E = x.value;
-        if (E)
-          i(c, E);
+        var A = x.value;
+        if (A)
+          i(c, A);
         else {
           c.state = u, c.outcome = w;
-          for (var A = -1, U = c.queue.length; ++A < U; )
-            c.queue[A].callFulfilled(w);
+          for (var z = -1, M = c.queue.length; ++z < M; )
+            c.queue[z].callFulfilled(w);
         }
         return c;
       }, e.reject = function(c, w) {
         c.state = s, c.outcome = w;
-        for (var x = -1, E = c.queue.length; ++x < E; )
+        for (var x = -1, A = c.queue.length; ++x < A; )
           c.queue[x].callRejected(w);
         return c;
       }, p.resolve = function(c) {
@@ -1552,34 +1552,34 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         var w = this;
         if (Object.prototype.toString.call(c) !== "[object Array]")
           return this.reject(new TypeError("must be an array"));
-        var x = c.length, E = !1;
+        var x = c.length, A = !1;
         if (!x)
           return this.resolve([]);
-        for (var A = new Array(x), U = 0, N = -1, Z = new this(a); ++N < x; )
-          v(c[N], N);
-        return Z;
-        function v(T, D) {
-          w.resolve(T).then(function(d) {
-            A[D] = d, ++U !== x || E || (E = !0, e.resolve(Z, A));
+        for (var z = new Array(x), M = 0, D = -1, H = new this(a); ++D < x; )
+          v(c[D], D);
+        return H;
+        function v(B, R) {
+          w.resolve(B).then(function(d) {
+            z[R] = d, ++M !== x || A || (A = !0, e.resolve(H, z));
           }, function(d) {
-            E || (E = !0, e.reject(Z, d));
+            A || (A = !0, e.reject(H, d));
           });
         }
       }, p.race = function(c) {
         var w = this;
         if (Object.prototype.toString.call(c) !== "[object Array]")
           return this.reject(new TypeError("must be an array"));
-        var x = c.length, E = !1;
+        var x = c.length, A = !1;
         if (!x)
           return this.resolve([]);
-        for (var A = -1, U = new this(a); ++A < x; )
-          N = c[A], w.resolve(N).then(function(Z) {
-            E || (E = !0, e.resolve(U, Z));
-          }, function(Z) {
-            E || (E = !0, e.reject(U, Z));
+        for (var z = -1, M = new this(a); ++z < x; )
+          D = c[z], w.resolve(D).then(function(H) {
+            A || (A = !0, e.resolve(M, H));
+          }, function(H) {
+            A || (A = !0, e.reject(M, H));
           });
-        var N;
-        return U;
+        var D;
+        return M;
       };
     }, { immediate: 36 }], 38: [function(n, k, g) {
       var l = {};
@@ -1596,8 +1596,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (x !== p)
           throw new Error(s[x]);
         if (w.header && l.deflateSetHeader(this.strm, w.header), w.dictionary) {
-          var E;
-          if (E = typeof w.dictionary == "string" ? e.string2buf(w.dictionary) : h.call(w.dictionary) === "[object ArrayBuffer]" ? new Uint8Array(w.dictionary) : w.dictionary, (x = l.deflateSetDictionary(this.strm, E)) !== p)
+          var A;
+          if (A = typeof w.dictionary == "string" ? e.string2buf(w.dictionary) : h.call(w.dictionary) === "[object ArrayBuffer]" ? new Uint8Array(w.dictionary) : w.dictionary, (x = l.deflateSetDictionary(this.strm, A)) !== p)
             throw new Error(s[x]);
           this._dict_set = !0;
         }
@@ -1609,16 +1609,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return x.result;
       }
       i.prototype.push = function(c, w) {
-        var x, E, A = this.strm, U = this.options.chunkSize;
+        var x, A, z = this.strm, M = this.options.chunkSize;
         if (this.ended)
           return !1;
-        E = w === ~~w ? w : w === !0 ? 4 : 0, typeof c == "string" ? A.input = e.string2buf(c) : h.call(c) === "[object ArrayBuffer]" ? A.input = new Uint8Array(c) : A.input = c, A.next_in = 0, A.avail_in = A.input.length;
+        A = w === ~~w ? w : w === !0 ? 4 : 0, typeof c == "string" ? z.input = e.string2buf(c) : h.call(c) === "[object ArrayBuffer]" ? z.input = new Uint8Array(c) : z.input = c, z.next_in = 0, z.avail_in = z.input.length;
         do {
-          if (A.avail_out === 0 && (A.output = new a.Buf8(U), A.next_out = 0, A.avail_out = U), (x = l.deflate(A, E)) !== 1 && x !== p)
+          if (z.avail_out === 0 && (z.output = new a.Buf8(M), z.next_out = 0, z.avail_out = M), (x = l.deflate(z, A)) !== 1 && x !== p)
             return this.onEnd(x), !(this.ended = !0);
-          A.avail_out !== 0 && (A.avail_in !== 0 || E !== 4 && E !== 2) || (this.options.to === "string" ? this.onData(e.buf2binstring(a.shrinkBuf(A.output, A.next_out))) : this.onData(a.shrinkBuf(A.output, A.next_out)));
-        } while ((0 < A.avail_in || A.avail_out === 0) && x !== 1);
-        return E === 4 ? (x = l.deflateEnd(this.strm), this.onEnd(x), this.ended = !0, x === p) : E !== 2 || (this.onEnd(p), !(A.avail_out = 0));
+          z.avail_out !== 0 && (z.avail_in !== 0 || A !== 4 && A !== 2) || (this.options.to === "string" ? this.onData(e.buf2binstring(a.shrinkBuf(z.output, z.next_out))) : this.onData(a.shrinkBuf(z.output, z.next_out)));
+        } while ((0 < z.avail_in || z.avail_out === 0) && x !== 1);
+        return A === 4 ? (x = l.deflateEnd(this.strm), this.onEnd(x), this.ended = !0, x === p) : A !== 2 || (this.onEnd(p), !(z.avail_out = 0));
       }, i.prototype.onData = function(c) {
         this.chunks.push(c);
       }, i.prototype.onEnd = function(c) {
@@ -1648,16 +1648,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return c.result;
       }
       o.prototype.push = function(i, f) {
-        var c, w, x, E, A, U, N = this.strm, Z = this.options.chunkSize, v = this.options.dictionary, T = !1;
+        var c, w, x, A, z, M, D = this.strm, H = this.options.chunkSize, v = this.options.dictionary, B = !1;
         if (this.ended)
           return !1;
-        w = f === ~~f ? f : f === !0 ? s.Z_FINISH : s.Z_NO_FLUSH, typeof i == "string" ? N.input = e.binstring2buf(i) : b.call(i) === "[object ArrayBuffer]" ? N.input = new Uint8Array(i) : N.input = i, N.next_in = 0, N.avail_in = N.input.length;
+        w = f === ~~f ? f : f === !0 ? s.Z_FINISH : s.Z_NO_FLUSH, typeof i == "string" ? D.input = e.binstring2buf(i) : b.call(i) === "[object ArrayBuffer]" ? D.input = new Uint8Array(i) : D.input = i, D.next_in = 0, D.avail_in = D.input.length;
         do {
-          if (N.avail_out === 0 && (N.output = new a.Buf8(Z), N.next_out = 0, N.avail_out = Z), (c = l.inflate(N, s.Z_NO_FLUSH)) === s.Z_NEED_DICT && v && (U = typeof v == "string" ? e.string2buf(v) : b.call(v) === "[object ArrayBuffer]" ? new Uint8Array(v) : v, c = l.inflateSetDictionary(this.strm, U)), c === s.Z_BUF_ERROR && T === !0 && (c = s.Z_OK, T = !1), c !== s.Z_STREAM_END && c !== s.Z_OK)
+          if (D.avail_out === 0 && (D.output = new a.Buf8(H), D.next_out = 0, D.avail_out = H), (c = l.inflate(D, s.Z_NO_FLUSH)) === s.Z_NEED_DICT && v && (M = typeof v == "string" ? e.string2buf(v) : b.call(v) === "[object ArrayBuffer]" ? new Uint8Array(v) : v, c = l.inflateSetDictionary(this.strm, M)), c === s.Z_BUF_ERROR && B === !0 && (c = s.Z_OK, B = !1), c !== s.Z_STREAM_END && c !== s.Z_OK)
             return this.onEnd(c), !(this.ended = !0);
-          N.next_out && (N.avail_out !== 0 && c !== s.Z_STREAM_END && (N.avail_in !== 0 || w !== s.Z_FINISH && w !== s.Z_SYNC_FLUSH) || (this.options.to === "string" ? (x = e.utf8border(N.output, N.next_out), E = N.next_out - x, A = e.buf2string(N.output, x), N.next_out = E, N.avail_out = Z - E, E && a.arraySet(N.output, N.output, x, E, 0), this.onData(A)) : this.onData(a.shrinkBuf(N.output, N.next_out)))), N.avail_in === 0 && N.avail_out === 0 && (T = !0);
-        } while ((0 < N.avail_in || N.avail_out === 0) && c !== s.Z_STREAM_END);
-        return c === s.Z_STREAM_END && (w = s.Z_FINISH), w === s.Z_FINISH ? (c = l.inflateEnd(this.strm), this.onEnd(c), this.ended = !0, c === s.Z_OK) : w !== s.Z_SYNC_FLUSH || (this.onEnd(s.Z_OK), !(N.avail_out = 0));
+          D.next_out && (D.avail_out !== 0 && c !== s.Z_STREAM_END && (D.avail_in !== 0 || w !== s.Z_FINISH && w !== s.Z_SYNC_FLUSH) || (this.options.to === "string" ? (x = e.utf8border(D.output, D.next_out), A = D.next_out - x, z = e.buf2string(D.output, x), D.next_out = A, D.avail_out = H - A, A && a.arraySet(D.output, D.output, x, A, 0), this.onData(z)) : this.onData(a.shrinkBuf(D.output, D.next_out)))), D.avail_in === 0 && D.avail_out === 0 && (B = !0);
+        } while ((0 < D.avail_in || D.avail_out === 0) && c !== s.Z_STREAM_END);
+        return c === s.Z_STREAM_END && (w = s.Z_FINISH), w === s.Z_FINISH ? (c = l.inflateEnd(this.strm), this.onEnd(c), this.ended = !0, c === s.Z_OK) : w !== s.Z_SYNC_FLUSH || (this.onEnd(s.Z_OK), !(D.avail_out = 0));
       }, o.prototype.onData = function(i) {
         this.chunks.push(i);
       }, o.prototype.onEnd = function(i) {
@@ -1785,137 +1785,137 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return -1 ^ a;
       };
     }, {}], 46: [function(n, k, g) {
-      var l, a = n("../utils/common"), e = n("./trees"), s = n("./adler32"), u = n("./crc32"), h = n("./messages"), p = 0, b = 4, o = 0, m = -2, i = -1, f = 4, c = 2, w = 8, x = 9, E = 286, A = 30, U = 19, N = 2 * E + 1, Z = 15, v = 3, T = 258, D = T + v + 1, d = 42, z = 113, r = 1, P = 2, V = 3, F = 4;
-      function tt(t, j) {
+      var l, a = n("../utils/common"), e = n("./trees"), s = n("./adler32"), u = n("./crc32"), h = n("./messages"), p = 0, b = 4, o = 0, m = -2, i = -1, f = 4, c = 2, w = 8, x = 9, A = 286, z = 30, M = 19, D = 2 * A + 1, H = 15, v = 3, B = 258, R = B + v + 1, d = 42, I = 113, r = 1, P = 2, q = 3, U = 4;
+      function nt(t, j) {
         return t.msg = h[j], j;
       }
-      function L(t) {
+      function F(t) {
         return (t << 1) - (4 < t ? 9 : 0);
       }
-      function H(t) {
+      function Z(t) {
         for (var j = t.length; 0 <= --j; )
           t[j] = 0;
       }
-      function B(t) {
-        var j = t.state, R = j.pending;
-        R > t.avail_out && (R = t.avail_out), R !== 0 && (a.arraySet(t.output, j.pending_buf, j.pending_out, R, t.next_out), t.next_out += R, j.pending_out += R, t.total_out += R, t.avail_out -= R, j.pending -= R, j.pending === 0 && (j.pending_out = 0));
+      function T(t) {
+        var j = t.state, N = j.pending;
+        N > t.avail_out && (N = t.avail_out), N !== 0 && (a.arraySet(t.output, j.pending_buf, j.pending_out, N, t.next_out), t.next_out += N, j.pending_out += N, t.total_out += N, t.avail_out -= N, j.pending -= N, j.pending === 0 && (j.pending_out = 0));
       }
-      function I(t, j) {
-        e._tr_flush_block(t, 0 <= t.block_start ? t.block_start : -1, t.strstart - t.block_start, j), t.block_start = t.strstart, B(t.strm);
+      function E(t, j) {
+        e._tr_flush_block(t, 0 <= t.block_start ? t.block_start : -1, t.strstart - t.block_start, j), t.block_start = t.strstart, T(t.strm);
       }
-      function q(t, j) {
+      function J(t, j) {
         t.pending_buf[t.pending++] = j;
       }
       function Y(t, j) {
         t.pending_buf[t.pending++] = j >>> 8 & 255, t.pending_buf[t.pending++] = 255 & j;
       }
       function K(t, j) {
-        var R, y, _ = t.max_chain_length, C = t.strstart, W = t.prev_length, $ = t.nice_match, O = t.strstart > t.w_size - D ? t.strstart - (t.w_size - D) : 0, G = t.window, J = t.w_mask, X = t.prev, nt = t.strstart + T, st = G[C + W - 1], it = G[C + W];
+        var N, y, _ = t.max_chain_length, C = t.strstart, W = t.prev_length, $ = t.nice_match, O = t.strstart > t.w_size - R ? t.strstart - (t.w_size - R) : 0, G = t.window, V = t.w_mask, X = t.prev, rt = t.strstart + B, st = G[C + W - 1], it = G[C + W];
         t.prev_length >= t.good_match && (_ >>= 2), $ > t.lookahead && ($ = t.lookahead);
         do
-          if (G[(R = j) + W] === it && G[R + W - 1] === st && G[R] === G[C] && G[++R] === G[C + 1]) {
-            C += 2, R++;
+          if (G[(N = j) + W] === it && G[N + W - 1] === st && G[N] === G[C] && G[++N] === G[C + 1]) {
+            C += 2, N++;
             do
               ;
-            while (G[++C] === G[++R] && G[++C] === G[++R] && G[++C] === G[++R] && G[++C] === G[++R] && G[++C] === G[++R] && G[++C] === G[++R] && G[++C] === G[++R] && G[++C] === G[++R] && C < nt);
-            if (y = T - (nt - C), C = nt - T, W < y) {
+            while (G[++C] === G[++N] && G[++C] === G[++N] && G[++C] === G[++N] && G[++C] === G[++N] && G[++C] === G[++N] && G[++C] === G[++N] && G[++C] === G[++N] && G[++C] === G[++N] && C < rt);
+            if (y = B - (rt - C), C = rt - B, W < y) {
               if (t.match_start = j, $ <= (W = y))
                 break;
               st = G[C + W - 1], it = G[C + W];
             }
           }
-        while ((j = X[j & J]) > O && --_ != 0);
+        while ((j = X[j & V]) > O && --_ != 0);
         return W <= t.lookahead ? W : t.lookahead;
       }
       function ot(t) {
-        var j, R, y, _, C, W, $, O, G, J, X = t.w_size;
+        var j, N, y, _, C, W, $, O, G, V, X = t.w_size;
         do {
-          if (_ = t.window_size - t.lookahead - t.strstart, t.strstart >= X + (X - D)) {
-            for (a.arraySet(t.window, t.window, X, X, 0), t.match_start -= X, t.strstart -= X, t.block_start -= X, j = R = t.hash_size; y = t.head[--j], t.head[j] = X <= y ? y - X : 0, --R; )
+          if (_ = t.window_size - t.lookahead - t.strstart, t.strstart >= X + (X - R)) {
+            for (a.arraySet(t.window, t.window, X, X, 0), t.match_start -= X, t.strstart -= X, t.block_start -= X, j = N = t.hash_size; y = t.head[--j], t.head[j] = X <= y ? y - X : 0, --N; )
               ;
-            for (j = R = X; y = t.prev[--j], t.prev[j] = X <= y ? y - X : 0, --R; )
+            for (j = N = X; y = t.prev[--j], t.prev[j] = X <= y ? y - X : 0, --N; )
               ;
             _ += X;
           }
           if (t.strm.avail_in === 0)
             break;
-          if (W = t.strm, $ = t.window, O = t.strstart + t.lookahead, G = _, J = void 0, J = W.avail_in, G < J && (J = G), R = J === 0 ? 0 : (W.avail_in -= J, a.arraySet($, W.input, W.next_in, J, O), W.state.wrap === 1 ? W.adler = s(W.adler, $, J, O) : W.state.wrap === 2 && (W.adler = u(W.adler, $, J, O)), W.next_in += J, W.total_in += J, J), t.lookahead += R, t.lookahead + t.insert >= v)
+          if (W = t.strm, $ = t.window, O = t.strstart + t.lookahead, G = _, V = void 0, V = W.avail_in, G < V && (V = G), N = V === 0 ? 0 : (W.avail_in -= V, a.arraySet($, W.input, W.next_in, V, O), W.state.wrap === 1 ? W.adler = s(W.adler, $, V, O) : W.state.wrap === 2 && (W.adler = u(W.adler, $, V, O)), W.next_in += V, W.total_in += V, V), t.lookahead += N, t.lookahead + t.insert >= v)
             for (C = t.strstart - t.insert, t.ins_h = t.window[C], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[C + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[C + v - 1]) & t.hash_mask, t.prev[C & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = C, C++, t.insert--, !(t.lookahead + t.insert < v)); )
               ;
-        } while (t.lookahead < D && t.strm.avail_in !== 0);
+        } while (t.lookahead < R && t.strm.avail_in !== 0);
       }
-      function et(t, j) {
-        for (var R, y; ; ) {
-          if (t.lookahead < D) {
-            if (ot(t), t.lookahead < D && j === p)
+      function tt(t, j) {
+        for (var N, y; ; ) {
+          if (t.lookahead < R) {
+            if (ot(t), t.lookahead < R && j === p)
               return r;
             if (t.lookahead === 0)
               break;
           }
-          if (R = 0, t.lookahead >= v && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + v - 1]) & t.hash_mask, R = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), R !== 0 && t.strstart - R <= t.w_size - D && (t.match_length = K(t, R)), t.match_length >= v)
+          if (N = 0, t.lookahead >= v && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + v - 1]) & t.hash_mask, N = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), N !== 0 && t.strstart - N <= t.w_size - R && (t.match_length = K(t, N)), t.match_length >= v)
             if (y = e._tr_tally(t, t.strstart - t.match_start, t.match_length - v), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= v) {
-              for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + v - 1]) & t.hash_mask, R = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart, --t.match_length != 0; )
+              for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + v - 1]) & t.hash_mask, N = 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;
           else
             y = e._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
-          if (y && (I(t, !1), t.strm.avail_out === 0))
+          if (y && (E(t, !1), t.strm.avail_out === 0))
             return r;
         }
-        return t.insert = t.strstart < v - 1 ? t.strstart : v - 1, j === b ? (I(t, !0), t.strm.avail_out === 0 ? V : F) : t.last_lit && (I(t, !1), t.strm.avail_out === 0) ? r : P;
+        return t.insert = t.strstart < v - 1 ? t.strstart : v - 1, j === b ? (E(t, !0), t.strm.avail_out === 0 ? q : U) : t.last_lit && (E(t, !1), t.strm.avail_out === 0) ? r : P;
       }
       function Q(t, j) {
-        for (var R, y, _; ; ) {
-          if (t.lookahead < D) {
-            if (ot(t), t.lookahead < D && j === p)
+        for (var N, y, _; ; ) {
+          if (t.lookahead < R) {
+            if (ot(t), t.lookahead < R && j === p)
               return r;
             if (t.lookahead === 0)
               break;
           }
-          if (R = 0, t.lookahead >= v && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + v - 1]) & t.hash_mask, R = 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 = v - 1, R !== 0 && t.prev_length < t.max_lazy_match && t.strstart - R <= t.w_size - D && (t.match_length = K(t, R), t.match_length <= 5 && (t.strategy === 1 || t.match_length === v && 4096 < t.strstart - t.match_start) && (t.match_length = v - 1)), t.prev_length >= v && t.match_length <= t.prev_length) {
-            for (_ = t.strstart + t.lookahead - v, y = e._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - v), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= _ && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + v - 1]) & t.hash_mask, R = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), --t.prev_length != 0; )
+          if (N = 0, t.lookahead >= v && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + v - 1]) & t.hash_mask, N = 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 = v - 1, N !== 0 && t.prev_length < t.max_lazy_match && t.strstart - N <= t.w_size - R && (t.match_length = K(t, N), t.match_length <= 5 && (t.strategy === 1 || t.match_length === v && 4096 < t.strstart - t.match_start) && (t.match_length = v - 1)), t.prev_length >= v && t.match_length <= t.prev_length) {
+            for (_ = t.strstart + t.lookahead - v, y = e._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - v), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= _ && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + v - 1]) & t.hash_mask, N = 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 = v - 1, t.strstart++, y && (I(t, !1), t.strm.avail_out === 0))
+            if (t.match_available = 0, t.match_length = v - 1, t.strstart++, y && (E(t, !1), t.strm.avail_out === 0))
               return r;
           } else if (t.match_available) {
-            if ((y = e._tr_tally(t, 0, t.window[t.strstart - 1])) && I(t, !1), t.strstart++, t.lookahead--, t.strm.avail_out === 0)
+            if ((y = e._tr_tally(t, 0, t.window[t.strstart - 1])) && E(t, !1), t.strstart++, t.lookahead--, t.strm.avail_out === 0)
               return r;
           } else
             t.match_available = 1, t.strstart++, t.lookahead--;
         }
-        return t.match_available && (y = e._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < v - 1 ? t.strstart : v - 1, j === b ? (I(t, !0), t.strm.avail_out === 0 ? V : F) : t.last_lit && (I(t, !1), t.strm.avail_out === 0) ? r : P;
+        return t.match_available && (y = e._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < v - 1 ? t.strstart : v - 1, j === b ? (E(t, !0), t.strm.avail_out === 0 ? q : U) : t.last_lit && (E(t, !1), t.strm.avail_out === 0) ? r : P;
       }
-      function rt(t, j, R, y, _) {
-        this.good_length = t, this.max_lazy = j, this.nice_length = R, this.max_chain = y, this.func = _;
+      function et(t, j, N, y, _) {
+        this.good_length = t, this.max_lazy = j, this.nice_length = N, this.max_chain = y, this.func = _;
       }
       function at() {
-        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 = w, 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 * N), this.dyn_dtree = new a.Buf16(2 * (2 * A + 1)), this.bl_tree = new a.Buf16(2 * (2 * U + 1)), H(this.dyn_ltree), H(this.dyn_dtree), H(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new a.Buf16(Z + 1), this.heap = new a.Buf16(2 * E + 1), H(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new a.Buf16(2 * E + 1), H(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 = w, 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 * D), this.dyn_dtree = new a.Buf16(2 * (2 * z + 1)), this.bl_tree = new a.Buf16(2 * (2 * M + 1)), Z(this.dyn_ltree), Z(this.dyn_dtree), Z(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new a.Buf16(H + 1), this.heap = new a.Buf16(2 * A + 1), Z(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new a.Buf16(2 * A + 1), Z(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 lt(t) {
         var j;
-        return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = c, (j = t.state).pending = 0, j.pending_out = 0, j.wrap < 0 && (j.wrap = -j.wrap), j.status = j.wrap ? d : z, t.adler = j.wrap === 2 ? 0 : 1, j.last_flush = p, e._tr_init(j), o) : tt(t, m);
+        return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = c, (j = t.state).pending = 0, j.pending_out = 0, j.wrap < 0 && (j.wrap = -j.wrap), j.status = j.wrap ? d : I, t.adler = j.wrap === 2 ? 0 : 1, j.last_flush = p, e._tr_init(j), o) : nt(t, m);
       }
       function mt(t) {
         var j = lt(t);
-        return j === o && function(R) {
-          R.window_size = 2 * R.w_size, H(R.head), R.max_lazy_match = l[R.level].max_lazy, R.good_match = l[R.level].good_length, R.nice_match = l[R.level].nice_length, R.max_chain_length = l[R.level].max_chain, R.strstart = 0, R.block_start = 0, R.lookahead = 0, R.insert = 0, R.match_length = R.prev_length = v - 1, R.match_available = 0, R.ins_h = 0;
+        return j === o && function(N) {
+          N.window_size = 2 * N.w_size, Z(N.head), N.max_lazy_match = l[N.level].max_lazy, N.good_match = l[N.level].good_length, N.nice_match = l[N.level].nice_length, N.max_chain_length = l[N.level].max_chain, N.strstart = 0, N.block_start = 0, N.lookahead = 0, N.insert = 0, N.match_length = N.prev_length = v - 1, N.match_available = 0, N.ins_h = 0;
         }(t.state), j;
       }
-      function ut(t, j, R, y, _, C) {
+      function ut(t, j, N, y, _, C) {
         if (!t)
           return m;
         var W = 1;
-        if (j === i && (j = 6), y < 0 ? (W = 0, y = -y) : 15 < y && (W = 2, y -= 16), _ < 1 || x < _ || R !== w || y < 8 || 15 < y || j < 0 || 9 < j || C < 0 || f < C)
-          return tt(t, m);
+        if (j === i && (j = 6), y < 0 ? (W = 0, y = -y) : 15 < y && (W = 2, y -= 16), _ < 1 || x < _ || N !== w || y < 8 || 15 < y || j < 0 || 9 < j || C < 0 || f < C)
+          return nt(t, m);
         y === 8 && (y = 9);
         var $ = new at();
-        return (t.state = $).strm = t, $.wrap = W, $.gzhead = null, $.w_bits = y, $.w_size = 1 << $.w_bits, $.w_mask = $.w_size - 1, $.hash_bits = _ + 7, $.hash_size = 1 << $.hash_bits, $.hash_mask = $.hash_size - 1, $.hash_shift = ~~(($.hash_bits + v - 1) / v), $.window = new a.Buf8(2 * $.w_size), $.head = new a.Buf16($.hash_size), $.prev = new a.Buf16($.w_size), $.lit_bufsize = 1 << _ + 6, $.pending_buf_size = 4 * $.lit_bufsize, $.pending_buf = new a.Buf8($.pending_buf_size), $.d_buf = 1 * $.lit_bufsize, $.l_buf = 3 * $.lit_bufsize, $.level = j, $.strategy = C, $.method = R, mt(t);
+        return (t.state = $).strm = t, $.wrap = W, $.gzhead = null, $.w_bits = y, $.w_size = 1 << $.w_bits, $.w_mask = $.w_size - 1, $.hash_bits = _ + 7, $.hash_size = 1 << $.hash_bits, $.hash_mask = $.hash_size - 1, $.hash_shift = ~~(($.hash_bits + v - 1) / v), $.window = new a.Buf8(2 * $.w_size), $.head = new a.Buf16($.hash_size), $.prev = new a.Buf16($.w_size), $.lit_bufsize = 1 << _ + 6, $.pending_buf_size = 4 * $.lit_bufsize, $.pending_buf = new a.Buf8($.pending_buf_size), $.d_buf = 1 * $.lit_bufsize, $.l_buf = 3 * $.lit_bufsize, $.level = j, $.strategy = C, $.method = N, mt(t);
       }
-      l = [new rt(0, 0, 0, 0, function(t, j) {
-        var R = 65535;
-        for (R > t.pending_buf_size - 5 && (R = t.pending_buf_size - 5); ; ) {
+      l = [new et(0, 0, 0, 0, function(t, j) {
+        var N = 65535;
+        for (N > t.pending_buf_size - 5 && (N = t.pending_buf_size - 5); ; ) {
           if (t.lookahead <= 1) {
             if (ot(t), t.lookahead === 0 && j === p)
               return r;
@@ -1923,32 +1923,32 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               break;
           }
           t.strstart += t.lookahead, t.lookahead = 0;
-          var y = t.block_start + R;
-          if ((t.strstart === 0 || t.strstart >= y) && (t.lookahead = t.strstart - y, t.strstart = y, I(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - D && (I(t, !1), t.strm.avail_out === 0))
+          var y = t.block_start + N;
+          if ((t.strstart === 0 || t.strstart >= y) && (t.lookahead = t.strstart - y, t.strstart = y, E(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - R && (E(t, !1), t.strm.avail_out === 0))
             return r;
         }
-        return t.insert = 0, j === b ? (I(t, !0), t.strm.avail_out === 0 ? V : F) : (t.strstart > t.block_start && (I(t, !1), t.strm.avail_out), r);
-      }), new rt(4, 4, 8, 4, et), new rt(4, 5, 16, 8, et), new rt(4, 6, 32, 32, et), new rt(4, 4, 16, 16, Q), new rt(8, 16, 32, 32, Q), new rt(8, 16, 128, 128, Q), new rt(8, 32, 128, 256, Q), new rt(32, 128, 258, 1024, Q), new rt(32, 258, 258, 4096, Q)], g.deflateInit = function(t, j) {
+        return t.insert = 0, j === b ? (E(t, !0), t.strm.avail_out === 0 ? q : U) : (t.strstart > t.block_start && (E(t, !1), t.strm.avail_out), r);
+      }), new et(4, 4, 8, 4, tt), new et(4, 5, 16, 8, tt), new et(4, 6, 32, 32, tt), new et(4, 4, 16, 16, Q), new et(8, 16, 32, 32, Q), new et(8, 16, 128, 128, Q), new et(8, 32, 128, 256, Q), new et(32, 128, 258, 1024, Q), new et(32, 258, 258, 4096, Q)], g.deflateInit = function(t, j) {
         return ut(t, j, w, 15, 8, 0);
       }, g.deflateInit2 = ut, g.deflateReset = mt, g.deflateResetKeep = lt, g.deflateSetHeader = function(t, j) {
         return t && t.state ? t.state.wrap !== 2 ? m : (t.state.gzhead = j, o) : m;
       }, g.deflate = function(t, j) {
-        var R, y, _, C;
+        var N, y, _, C;
         if (!t || !t.state || 5 < j || j < 0)
-          return t ? tt(t, m) : m;
+          return t ? nt(t, m) : m;
         if (y = t.state, !t.output || !t.input && t.avail_in !== 0 || y.status === 666 && j !== b)
-          return tt(t, t.avail_out === 0 ? -5 : m);
-        if (y.strm = t, R = y.last_flush, y.last_flush = j, y.status === d)
+          return nt(t, t.avail_out === 0 ? -5 : m);
+        if (y.strm = t, N = y.last_flush, y.last_flush = j, y.status === d)
           if (y.wrap === 2)
-            t.adler = 0, q(y, 31), q(y, 139), q(y, 8), y.gzhead ? (q(y, (y.gzhead.text ? 1 : 0) + (y.gzhead.hcrc ? 2 : 0) + (y.gzhead.extra ? 4 : 0) + (y.gzhead.name ? 8 : 0) + (y.gzhead.comment ? 16 : 0)), q(y, 255 & y.gzhead.time), q(y, y.gzhead.time >> 8 & 255), q(y, y.gzhead.time >> 16 & 255), q(y, y.gzhead.time >> 24 & 255), q(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), q(y, 255 & y.gzhead.os), y.gzhead.extra && y.gzhead.extra.length && (q(y, 255 & y.gzhead.extra.length), q(y, y.gzhead.extra.length >> 8 & 255)), y.gzhead.hcrc && (t.adler = u(t.adler, y.pending_buf, y.pending, 0)), y.gzindex = 0, y.status = 69) : (q(y, 0), q(y, 0), q(y, 0), q(y, 0), q(y, 0), q(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), q(y, 3), y.status = z);
+            t.adler = 0, J(y, 31), J(y, 139), J(y, 8), y.gzhead ? (J(y, (y.gzhead.text ? 1 : 0) + (y.gzhead.hcrc ? 2 : 0) + (y.gzhead.extra ? 4 : 0) + (y.gzhead.name ? 8 : 0) + (y.gzhead.comment ? 16 : 0)), J(y, 255 & y.gzhead.time), J(y, y.gzhead.time >> 8 & 255), J(y, y.gzhead.time >> 16 & 255), J(y, y.gzhead.time >> 24 & 255), J(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), J(y, 255 & y.gzhead.os), y.gzhead.extra && y.gzhead.extra.length && (J(y, 255 & y.gzhead.extra.length), J(y, y.gzhead.extra.length >> 8 & 255)), y.gzhead.hcrc && (t.adler = u(t.adler, y.pending_buf, y.pending, 0)), y.gzindex = 0, y.status = 69) : (J(y, 0), J(y, 0), J(y, 0), J(y, 0), J(y, 0), J(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), J(y, 3), y.status = I);
           else {
             var W = w + (y.w_bits - 8 << 4) << 8;
-            W |= (2 <= y.strategy || y.level < 2 ? 0 : y.level < 6 ? 1 : y.level === 6 ? 2 : 3) << 6, y.strstart !== 0 && (W |= 32), W += 31 - W % 31, y.status = z, Y(y, W), y.strstart !== 0 && (Y(y, t.adler >>> 16), Y(y, 65535 & t.adler)), t.adler = 1;
+            W |= (2 <= y.strategy || y.level < 2 ? 0 : y.level < 6 ? 1 : y.level === 6 ? 2 : 3) << 6, y.strstart !== 0 && (W |= 32), W += 31 - W % 31, y.status = I, Y(y, W), y.strstart !== 0 && (Y(y, t.adler >>> 16), Y(y, 65535 & t.adler)), t.adler = 1;
           }
         if (y.status === 69)
           if (y.gzhead.extra) {
-            for (_ = y.pending; y.gzindex < (65535 & y.gzhead.extra.length) && (y.pending !== y.pending_buf_size || (y.gzhead.hcrc && y.pending > _ && (t.adler = u(t.adler, y.pending_buf, y.pending - _, _)), B(t), _ = y.pending, y.pending !== y.pending_buf_size)); )
-              q(y, 255 & y.gzhead.extra[y.gzindex]), y.gzindex++;
+            for (_ = y.pending; y.gzindex < (65535 & y.gzhead.extra.length) && (y.pending !== y.pending_buf_size || (y.gzhead.hcrc && y.pending > _ && (t.adler = u(t.adler, y.pending_buf, y.pending - _, _)), T(t), _ = y.pending, y.pending !== y.pending_buf_size)); )
+              J(y, 255 & y.gzhead.extra[y.gzindex]), y.gzindex++;
             y.gzhead.hcrc && y.pending > _ && (t.adler = u(t.adler, y.pending_buf, y.pending - _, _)), y.gzindex === y.gzhead.extra.length && (y.gzindex = 0, y.status = 73);
           } else
             y.status = 73;
@@ -1956,11 +1956,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           if (y.gzhead.name) {
             _ = y.pending;
             do {
-              if (y.pending === y.pending_buf_size && (y.gzhead.hcrc && y.pending > _ && (t.adler = u(t.adler, y.pending_buf, y.pending - _, _)), B(t), _ = y.pending, y.pending === y.pending_buf_size)) {
+              if (y.pending === y.pending_buf_size && (y.gzhead.hcrc && y.pending > _ && (t.adler = u(t.adler, y.pending_buf, y.pending - _, _)), T(t), _ = y.pending, y.pending === y.pending_buf_size)) {
                 C = 1;
                 break;
               }
-              C = y.gzindex < y.gzhead.name.length ? 255 & y.gzhead.name.charCodeAt(y.gzindex++) : 0, q(y, C);
+              C = y.gzindex < y.gzhead.name.length ? 255 & y.gzhead.name.charCodeAt(y.gzindex++) : 0, J(y, C);
             } while (C !== 0);
             y.gzhead.hcrc && y.pending > _ && (t.adler = u(t.adler, y.pending_buf, y.pending - _, _)), C === 0 && (y.gzindex = 0, y.status = 91);
           } else
@@ -1969,73 +1969,73 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           if (y.gzhead.comment) {
             _ = y.pending;
             do {
-              if (y.pending === y.pending_buf_size && (y.gzhead.hcrc && y.pending > _ && (t.adler = u(t.adler, y.pending_buf, y.pending - _, _)), B(t), _ = y.pending, y.pending === y.pending_buf_size)) {
+              if (y.pending === y.pending_buf_size && (y.gzhead.hcrc && y.pending > _ && (t.adler = u(t.adler, y.pending_buf, y.pending - _, _)), T(t), _ = y.pending, y.pending === y.pending_buf_size)) {
                 C = 1;
                 break;
               }
-              C = y.gzindex < y.gzhead.comment.length ? 255 & y.gzhead.comment.charCodeAt(y.gzindex++) : 0, q(y, C);
+              C = y.gzindex < y.gzhead.comment.length ? 255 & y.gzhead.comment.charCodeAt(y.gzindex++) : 0, J(y, C);
             } while (C !== 0);
             y.gzhead.hcrc && y.pending > _ && (t.adler = u(t.adler, y.pending_buf, y.pending - _, _)), C === 0 && (y.status = 103);
           } else
             y.status = 103;
-        if (y.status === 103 && (y.gzhead.hcrc ? (y.pending + 2 > y.pending_buf_size && B(t), y.pending + 2 <= y.pending_buf_size && (q(y, 255 & t.adler), q(y, t.adler >> 8 & 255), t.adler = 0, y.status = z)) : y.status = z), y.pending !== 0) {
-          if (B(t), t.avail_out === 0)
+        if (y.status === 103 && (y.gzhead.hcrc ? (y.pending + 2 > y.pending_buf_size && T(t), y.pending + 2 <= y.pending_buf_size && (J(y, 255 & t.adler), J(y, t.adler >> 8 & 255), t.adler = 0, y.status = I)) : y.status = I), y.pending !== 0) {
+          if (T(t), t.avail_out === 0)
             return y.last_flush = -1, o;
-        } else if (t.avail_in === 0 && L(j) <= L(R) && j !== b)
-          return tt(t, -5);
+        } else if (t.avail_in === 0 && F(j) <= F(N) && j !== b)
+          return nt(t, -5);
         if (y.status === 666 && t.avail_in !== 0)
-          return tt(t, -5);
+          return nt(t, -5);
         if (t.avail_in !== 0 || y.lookahead !== 0 || j !== p && y.status !== 666) {
           var $ = y.strategy === 2 ? function(O, G) {
-            for (var J; ; ) {
+            for (var V; ; ) {
               if (O.lookahead === 0 && (ot(O), O.lookahead === 0)) {
                 if (G === p)
                   return r;
                 break;
               }
-              if (O.match_length = 0, J = e._tr_tally(O, 0, O.window[O.strstart]), O.lookahead--, O.strstart++, J && (I(O, !1), O.strm.avail_out === 0))
+              if (O.match_length = 0, V = e._tr_tally(O, 0, O.window[O.strstart]), O.lookahead--, O.strstart++, V && (E(O, !1), O.strm.avail_out === 0))
                 return r;
             }
-            return O.insert = 0, G === b ? (I(O, !0), O.strm.avail_out === 0 ? V : F) : O.last_lit && (I(O, !1), O.strm.avail_out === 0) ? r : P;
+            return O.insert = 0, G === b ? (E(O, !0), O.strm.avail_out === 0 ? q : U) : O.last_lit && (E(O, !1), O.strm.avail_out === 0) ? r : P;
           }(y, j) : y.strategy === 3 ? function(O, G) {
-            for (var J, X, nt, st, it = O.window; ; ) {
-              if (O.lookahead <= T) {
-                if (ot(O), O.lookahead <= T && G === p)
+            for (var V, X, rt, st, it = O.window; ; ) {
+              if (O.lookahead <= B) {
+                if (ot(O), O.lookahead <= B && G === p)
                   return r;
                 if (O.lookahead === 0)
                   break;
               }
-              if (O.match_length = 0, O.lookahead >= v && 0 < O.strstart && (X = it[nt = O.strstart - 1]) === it[++nt] && X === it[++nt] && X === it[++nt]) {
-                st = O.strstart + T;
+              if (O.match_length = 0, O.lookahead >= v && 0 < O.strstart && (X = it[rt = O.strstart - 1]) === it[++rt] && X === it[++rt] && X === it[++rt]) {
+                st = O.strstart + B;
                 do
                   ;
-                while (X === it[++nt] && X === it[++nt] && X === it[++nt] && X === it[++nt] && X === it[++nt] && X === it[++nt] && X === it[++nt] && X === it[++nt] && nt < st);
-                O.match_length = T - (st - nt), O.match_length > O.lookahead && (O.match_length = O.lookahead);
+                while (X === it[++rt] && X === it[++rt] && X === it[++rt] && X === it[++rt] && X === it[++rt] && X === it[++rt] && X === it[++rt] && X === it[++rt] && rt < st);
+                O.match_length = B - (st - rt), O.match_length > O.lookahead && (O.match_length = O.lookahead);
               }
-              if (O.match_length >= v ? (J = e._tr_tally(O, 1, O.match_length - v), O.lookahead -= O.match_length, O.strstart += O.match_length, O.match_length = 0) : (J = e._tr_tally(O, 0, O.window[O.strstart]), O.lookahead--, O.strstart++), J && (I(O, !1), O.strm.avail_out === 0))
+              if (O.match_length >= v ? (V = e._tr_tally(O, 1, O.match_length - v), O.lookahead -= O.match_length, O.strstart += O.match_length, O.match_length = 0) : (V = e._tr_tally(O, 0, O.window[O.strstart]), O.lookahead--, O.strstart++), V && (E(O, !1), O.strm.avail_out === 0))
                 return r;
             }
-            return O.insert = 0, G === b ? (I(O, !0), O.strm.avail_out === 0 ? V : F) : O.last_lit && (I(O, !1), O.strm.avail_out === 0) ? r : P;
+            return O.insert = 0, G === b ? (E(O, !0), O.strm.avail_out === 0 ? q : U) : O.last_lit && (E(O, !1), O.strm.avail_out === 0) ? r : P;
           }(y, j) : l[y.level].func(y, j);
-          if ($ !== V && $ !== F || (y.status = 666), $ === r || $ === V)
+          if ($ !== q && $ !== U || (y.status = 666), $ === r || $ === q)
             return t.avail_out === 0 && (y.last_flush = -1), o;
-          if ($ === P && (j === 1 ? e._tr_align(y) : j !== 5 && (e._tr_stored_block(y, 0, 0, !1), j === 3 && (H(y.head), y.lookahead === 0 && (y.strstart = 0, y.block_start = 0, y.insert = 0))), B(t), t.avail_out === 0))
+          if ($ === P && (j === 1 ? e._tr_align(y) : j !== 5 && (e._tr_stored_block(y, 0, 0, !1), j === 3 && (Z(y.head), y.lookahead === 0 && (y.strstart = 0, y.block_start = 0, y.insert = 0))), T(t), t.avail_out === 0))
             return y.last_flush = -1, o;
         }
-        return j !== b ? o : y.wrap <= 0 ? 1 : (y.wrap === 2 ? (q(y, 255 & t.adler), q(y, t.adler >> 8 & 255), q(y, t.adler >> 16 & 255), q(y, t.adler >> 24 & 255), q(y, 255 & t.total_in), q(y, t.total_in >> 8 & 255), q(y, t.total_in >> 16 & 255), q(y, t.total_in >> 24 & 255)) : (Y(y, t.adler >>> 16), Y(y, 65535 & t.adler)), B(t), 0 < y.wrap && (y.wrap = -y.wrap), y.pending !== 0 ? o : 1);
+        return j !== b ? o : y.wrap <= 0 ? 1 : (y.wrap === 2 ? (J(y, 255 & t.adler), J(y, t.adler >> 8 & 255), J(y, t.adler >> 16 & 255), J(y, t.adler >> 24 & 255), J(y, 255 & t.total_in), J(y, t.total_in >> 8 & 255), J(y, t.total_in >> 16 & 255), J(y, t.total_in >> 24 & 255)) : (Y(y, t.adler >>> 16), Y(y, 65535 & t.adler)), T(t), 0 < y.wrap && (y.wrap = -y.wrap), y.pending !== 0 ? o : 1);
       }, g.deflateEnd = function(t) {
         var j;
-        return t && t.state ? (j = t.state.status) !== d && j !== 69 && j !== 73 && j !== 91 && j !== 103 && j !== z && j !== 666 ? tt(t, m) : (t.state = null, j === z ? tt(t, -3) : o) : m;
+        return t && t.state ? (j = t.state.status) !== d && j !== 69 && j !== 73 && j !== 91 && j !== 103 && j !== I && j !== 666 ? nt(t, m) : (t.state = null, j === I ? nt(t, -3) : o) : m;
       }, g.deflateSetDictionary = function(t, j) {
-        var R, y, _, C, W, $, O, G, J = j.length;
-        if (!t || !t.state || (C = (R = t.state).wrap) === 2 || C === 1 && R.status !== d || R.lookahead)
+        var N, y, _, C, W, $, O, G, V = j.length;
+        if (!t || !t.state || (C = (N = t.state).wrap) === 2 || C === 1 && N.status !== d || N.lookahead)
           return m;
-        for (C === 1 && (t.adler = s(t.adler, j, J, 0)), R.wrap = 0, J >= R.w_size && (C === 0 && (H(R.head), R.strstart = 0, R.block_start = 0, R.insert = 0), G = new a.Buf8(R.w_size), a.arraySet(G, j, J - R.w_size, R.w_size, 0), j = G, J = R.w_size), W = t.avail_in, $ = t.next_in, O = t.input, t.avail_in = J, t.next_in = 0, t.input = j, ot(R); R.lookahead >= v; ) {
-          for (y = R.strstart, _ = R.lookahead - (v - 1); R.ins_h = (R.ins_h << R.hash_shift ^ R.window[y + v - 1]) & R.hash_mask, R.prev[y & R.w_mask] = R.head[R.ins_h], R.head[R.ins_h] = y, y++, --_; )
+        for (C === 1 && (t.adler = s(t.adler, j, V, 0)), N.wrap = 0, V >= N.w_size && (C === 0 && (Z(N.head), N.strstart = 0, N.block_start = 0, N.insert = 0), G = new a.Buf8(N.w_size), a.arraySet(G, j, V - N.w_size, N.w_size, 0), j = G, V = N.w_size), W = t.avail_in, $ = t.next_in, O = t.input, t.avail_in = V, t.next_in = 0, t.input = j, ot(N); N.lookahead >= v; ) {
+          for (y = N.strstart, _ = N.lookahead - (v - 1); N.ins_h = (N.ins_h << N.hash_shift ^ N.window[y + v - 1]) & N.hash_mask, N.prev[y & N.w_mask] = N.head[N.ins_h], N.head[N.ins_h] = y, y++, --_; )
             ;
-          R.strstart = y, R.lookahead = v - 1, ot(R);
+          N.strstart = y, N.lookahead = v - 1, ot(N);
         }
-        return R.strstart += R.lookahead, R.block_start = R.strstart, R.insert = R.lookahead, R.lookahead = 0, R.match_length = R.prev_length = v - 1, R.match_available = 0, t.next_in = $, t.input = O, t.avail_in = W, R.wrap = C, o;
+        return N.strstart += N.lookahead, N.block_start = N.strstart, N.insert = N.lookahead, N.lookahead = 0, N.match_length = N.prev_length = v - 1, N.match_available = 0, t.next_in = $, t.input = O, t.avail_in = W, N.wrap = C, o;
       }, g.deflateInfo = "pako deflate (from Nodeca project)";
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(n, k, g) {
       k.exports = function() {
@@ -2043,19 +2043,19 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       };
     }, {}], 48: [function(n, k, g) {
       k.exports = function(l, a) {
-        var e, s, u, h, p, b, o, m, i, f, c, w, x, E, A, U, N, Z, v, T, D, d, z, r, P;
-        e = l.state, s = l.next_in, r = l.input, u = s + (l.avail_in - 5), h = l.next_out, P = l.output, p = h - (a - l.avail_out), b = h + (l.avail_out - 257), o = e.dmax, m = e.wsize, i = e.whave, f = e.wnext, c = e.window, w = e.hold, x = e.bits, E = e.lencode, A = e.distcode, U = (1 << e.lenbits) - 1, N = (1 << e.distbits) - 1;
+        var e, s, u, h, p, b, o, m, i, f, c, w, x, A, z, M, D, H, v, B, R, d, I, r, P;
+        e = l.state, s = l.next_in, r = l.input, u = s + (l.avail_in - 5), h = l.next_out, P = l.output, p = h - (a - l.avail_out), b = h + (l.avail_out - 257), o = e.dmax, m = e.wsize, i = e.whave, f = e.wnext, c = e.window, w = e.hold, x = e.bits, A = e.lencode, z = e.distcode, M = (1 << e.lenbits) - 1, D = (1 << e.distbits) - 1;
         t:
           do {
-            x < 15 && (w += r[s++] << x, x += 8, w += r[s++] << x, x += 8), Z = E[w & U];
+            x < 15 && (w += r[s++] << x, x += 8, w += r[s++] << x, x += 8), H = A[w & M];
             e:
               for (; ; ) {
-                if (w >>>= v = Z >>> 24, x -= v, (v = Z >>> 16 & 255) === 0)
-                  P[h++] = 65535 & Z;
+                if (w >>>= v = H >>> 24, x -= v, (v = H >>> 16 & 255) === 0)
+                  P[h++] = 65535 & H;
                 else {
                   if (!(16 & v)) {
                     if (!(64 & v)) {
-                      Z = E[(65535 & Z) + (w & (1 << v) - 1)];
+                      H = A[(65535 & H) + (w & (1 << v) - 1)];
                       continue e;
                     }
                     if (32 & v) {
@@ -2065,54 +2065,54 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     l.msg = "invalid literal/length code", e.mode = 30;
                     break t;
                   }
-                  T = 65535 & Z, (v &= 15) && (x < v && (w += r[s++] << x, x += 8), T += w & (1 << v) - 1, w >>>= v, x -= v), x < 15 && (w += r[s++] << x, x += 8, w += r[s++] << x, x += 8), Z = A[w & N];
+                  B = 65535 & H, (v &= 15) && (x < v && (w += r[s++] << x, x += 8), B += w & (1 << v) - 1, w >>>= v, x -= v), x < 15 && (w += r[s++] << x, x += 8, w += r[s++] << x, x += 8), H = z[w & D];
                   r:
                     for (; ; ) {
-                      if (w >>>= v = Z >>> 24, x -= v, !(16 & (v = Z >>> 16 & 255))) {
+                      if (w >>>= v = H >>> 24, x -= v, !(16 & (v = H >>> 16 & 255))) {
                         if (!(64 & v)) {
-                          Z = A[(65535 & Z) + (w & (1 << v) - 1)];
+                          H = z[(65535 & H) + (w & (1 << v) - 1)];
                           continue r;
                         }
                         l.msg = "invalid distance code", e.mode = 30;
                         break t;
                       }
-                      if (D = 65535 & Z, x < (v &= 15) && (w += r[s++] << x, (x += 8) < v && (w += r[s++] << x, x += 8)), o < (D += w & (1 << v) - 1)) {
+                      if (R = 65535 & H, x < (v &= 15) && (w += r[s++] << x, (x += 8) < v && (w += r[s++] << x, x += 8)), o < (R += w & (1 << v) - 1)) {
                         l.msg = "invalid distance too far back", e.mode = 30;
                         break t;
                       }
-                      if (w >>>= v, x -= v, (v = h - p) < D) {
-                        if (i < (v = D - v) && e.sane) {
+                      if (w >>>= v, x -= v, (v = h - p) < R) {
+                        if (i < (v = R - v) && e.sane) {
                           l.msg = "invalid distance too far back", e.mode = 30;
                           break t;
                         }
-                        if (z = c, (d = 0) === f) {
-                          if (d += m - v, v < T) {
-                            for (T -= v; P[h++] = c[d++], --v; )
+                        if (I = c, (d = 0) === f) {
+                          if (d += m - v, v < B) {
+                            for (B -= v; P[h++] = c[d++], --v; )
                               ;
-                            d = h - D, z = P;
+                            d = h - R, I = P;
                           }
                         } else if (f < v) {
-                          if (d += m + f - v, (v -= f) < T) {
-                            for (T -= v; P[h++] = c[d++], --v; )
+                          if (d += m + f - v, (v -= f) < B) {
+                            for (B -= v; P[h++] = c[d++], --v; )
                               ;
-                            if (d = 0, f < T) {
-                              for (T -= v = f; P[h++] = c[d++], --v; )
+                            if (d = 0, f < B) {
+                              for (B -= v = f; P[h++] = c[d++], --v; )
                                 ;
-                              d = h - D, z = P;
+                              d = h - R, I = P;
                             }
                           }
-                        } else if (d += f - v, v < T) {
-                          for (T -= v; P[h++] = c[d++], --v; )
+                        } else if (d += f - v, v < B) {
+                          for (B -= v; P[h++] = c[d++], --v; )
                             ;
-                          d = h - D, z = P;
+                          d = h - R, I = P;
                         }
-                        for (; 2 < T; )
-                          P[h++] = z[d++], P[h++] = z[d++], P[h++] = z[d++], T -= 3;
-                        T && (P[h++] = z[d++], 1 < T && (P[h++] = z[d++]));
+                        for (; 2 < B; )
+                          P[h++] = I[d++], P[h++] = I[d++], P[h++] = I[d++], B -= 3;
+                        B && (P[h++] = I[d++], 1 < B && (P[h++] = I[d++]));
                       } else {
-                        for (d = h - D; P[h++] = P[d++], P[h++] = P[d++], P[h++] = P[d++], 2 < (T -= 3); )
+                        for (d = h - R; P[h++] = P[d++], P[h++] = P[d++], P[h++] = P[d++], 2 < (B -= 3); )
                           ;
-                        T && (P[h++] = P[d++], 1 < T && (P[h++] = P[d++]));
+                        B && (P[h++] = P[d++], 1 < B && (P[h++] = P[d++]));
                       }
                       break;
                     }
@@ -2120,7 +2120,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 break;
               }
           } while (s < u && h < b);
-        s -= T = x >> 3, w &= (1 << (x -= T << 3)) - 1, l.next_in = s, l.next_out = h, l.avail_in = s < u ? u - s + 5 : 5 - (s - u), l.avail_out = h < b ? b - h + 257 : 257 - (h - b), e.hold = w, e.bits = x;
+        s -= B = x >> 3, w &= (1 << (x -= B << 3)) - 1, l.next_in = s, l.next_out = h, l.avail_in = s < u ? u - s + 5 : 5 - (s - u), l.avail_out = h < b ? b - h + 257 : 257 - (h - b), e.hold = w, e.bits = x;
       };
     }, {}], 49: [function(n, k, g) {
       var l = n("../utils/common"), a = n("./adler32"), e = n("./crc32"), s = n("./inffast"), u = n("./inftrees"), h = 1, p = 2, b = 0, o = -2, m = 1, i = 852, f = 592;
@@ -2131,50 +2131,50 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new l.Buf16(320), this.work = new l.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
       }
       function x(d) {
-        var z;
-        return d && d.state ? (z = d.state, d.total_in = d.total_out = z.total = 0, d.msg = "", z.wrap && (d.adler = 1 & z.wrap), z.mode = m, z.last = 0, z.havedict = 0, z.dmax = 32768, z.head = null, z.hold = 0, z.bits = 0, z.lencode = z.lendyn = new l.Buf32(i), z.distcode = z.distdyn = new l.Buf32(f), z.sane = 1, z.back = -1, b) : o;
+        var I;
+        return d && d.state ? (I = d.state, d.total_in = d.total_out = I.total = 0, d.msg = "", I.wrap && (d.adler = 1 & I.wrap), I.mode = m, I.last = 0, I.havedict = 0, I.dmax = 32768, I.head = null, I.hold = 0, I.bits = 0, I.lencode = I.lendyn = new l.Buf32(i), I.distcode = I.distdyn = new l.Buf32(f), I.sane = 1, I.back = -1, b) : o;
       }
-      function E(d) {
-        var z;
-        return d && d.state ? ((z = d.state).wsize = 0, z.whave = 0, z.wnext = 0, x(d)) : o;
+      function A(d) {
+        var I;
+        return d && d.state ? ((I = d.state).wsize = 0, I.whave = 0, I.wnext = 0, x(d)) : o;
       }
-      function A(d, z) {
+      function z(d, I) {
         var r, P;
-        return d && d.state ? (P = d.state, z < 0 ? (r = 0, z = -z) : (r = 1 + (z >> 4), z < 48 && (z &= 15)), z && (z < 8 || 15 < z) ? o : (P.window !== null && P.wbits !== z && (P.window = null), P.wrap = r, P.wbits = z, E(d))) : o;
+        return d && d.state ? (P = d.state, I < 0 ? (r = 0, I = -I) : (r = 1 + (I >> 4), I < 48 && (I &= 15)), I && (I < 8 || 15 < I) ? o : (P.window !== null && P.wbits !== I && (P.window = null), P.wrap = r, P.wbits = I, A(d))) : o;
       }
-      function U(d, z) {
+      function M(d, I) {
         var r, P;
-        return d ? (P = new w(), (d.state = P).window = null, (r = A(d, z)) !== b && (d.state = null), r) : o;
+        return d ? (P = new w(), (d.state = P).window = null, (r = z(d, I)) !== b && (d.state = null), r) : o;
       }
-      var N, Z, v = !0;
-      function T(d) {
+      var D, H, v = !0;
+      function B(d) {
         if (v) {
-          var z;
-          for (N = new l.Buf32(512), Z = new l.Buf32(32), z = 0; z < 144; )
-            d.lens[z++] = 8;
-          for (; z < 256; )
-            d.lens[z++] = 9;
-          for (; z < 280; )
-            d.lens[z++] = 7;
-          for (; z < 288; )
-            d.lens[z++] = 8;
-          for (u(h, d.lens, 0, 288, N, 0, d.work, { bits: 9 }), z = 0; z < 32; )
-            d.lens[z++] = 5;
-          u(p, d.lens, 0, 32, Z, 0, d.work, { bits: 5 }), v = !1;
+          var I;
+          for (D = new l.Buf32(512), H = new l.Buf32(32), I = 0; I < 144; )
+            d.lens[I++] = 8;
+          for (; I < 256; )
+            d.lens[I++] = 9;
+          for (; I < 280; )
+            d.lens[I++] = 7;
+          for (; I < 288; )
+            d.lens[I++] = 8;
+          for (u(h, d.lens, 0, 288, D, 0, d.work, { bits: 9 }), I = 0; I < 32; )
+            d.lens[I++] = 5;
+          u(p, d.lens, 0, 32, H, 0, d.work, { bits: 5 }), v = !1;
         }
-        d.lencode = N, d.lenbits = 9, d.distcode = Z, d.distbits = 5;
+        d.lencode = D, d.lenbits = 9, d.distcode = H, d.distbits = 5;
       }
-      function D(d, z, r, P) {
-        var V, F = d.state;
-        return F.window === null && (F.wsize = 1 << F.wbits, F.wnext = 0, F.whave = 0, F.window = new l.Buf8(F.wsize)), P >= F.wsize ? (l.arraySet(F.window, z, r - F.wsize, F.wsize, 0), F.wnext = 0, F.whave = F.wsize) : (P < (V = F.wsize - F.wnext) && (V = P), l.arraySet(F.window, z, r - P, V, F.wnext), (P -= V) ? (l.arraySet(F.window, z, r - P, P, 0), F.wnext = P, F.whave = F.wsize) : (F.wnext += V, F.wnext === F.wsize && (F.wnext = 0), F.whave < F.wsize && (F.whave += V))), 0;
+      function R(d, I, r, P) {
+        var q, U = d.state;
+        return U.window === null && (U.wsize = 1 << U.wbits, U.wnext = 0, U.whave = 0, U.window = new l.Buf8(U.wsize)), P >= U.wsize ? (l.arraySet(U.window, I, r - U.wsize, U.wsize, 0), U.wnext = 0, U.whave = U.wsize) : (P < (q = U.wsize - U.wnext) && (q = P), l.arraySet(U.window, I, r - P, q, U.wnext), (P -= q) ? (l.arraySet(U.window, I, r - P, P, 0), U.wnext = P, U.whave = U.wsize) : (U.wnext += q, U.wnext === U.wsize && (U.wnext = 0), U.whave < U.wsize && (U.whave += q))), 0;
       }
-      g.inflateReset = E, g.inflateReset2 = A, g.inflateResetKeep = x, g.inflateInit = function(d) {
-        return U(d, 15);
-      }, g.inflateInit2 = U, g.inflate = function(d, z) {
-        var r, P, V, F, tt, L, H, B, I, q, Y, K, ot, et, Q, rt, at, lt, mt, ut, t, j, R, y, _ = 0, C = new l.Buf8(4), W = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+      g.inflateReset = A, g.inflateReset2 = z, g.inflateResetKeep = x, g.inflateInit = function(d) {
+        return M(d, 15);
+      }, g.inflateInit2 = M, g.inflate = function(d, I) {
+        var r, P, q, U, nt, F, Z, T, E, J, Y, K, ot, tt, Q, et, at, lt, mt, ut, t, j, N, y, _ = 0, C = new l.Buf8(4), W = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
         if (!d || !d.state || !d.output || !d.input && d.avail_in !== 0)
           return o;
-        (r = d.state).mode === 12 && (r.mode = 13), tt = d.next_out, V = d.output, H = d.avail_out, F = d.next_in, P = d.input, L = d.avail_in, B = r.hold, I = r.bits, q = L, Y = H, j = b;
+        (r = d.state).mode === 12 && (r.mode = 13), nt = d.next_out, q = d.output, Z = d.avail_out, U = d.next_in, P = d.input, F = d.avail_in, T = r.hold, E = r.bits, J = F, Y = Z, j = b;
         t:
           for (; ; )
             switch (r.mode) {
@@ -2183,38 +2183,38 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   r.mode = 13;
                   break;
                 }
-                for (; I < 16; ) {
-                  if (L === 0)
+                for (; E < 16; ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                if (2 & r.wrap && B === 35615) {
-                  C[r.check = 0] = 255 & B, C[1] = B >>> 8 & 255, r.check = e(r.check, C, 2, 0), I = B = 0, r.mode = 2;
+                if (2 & r.wrap && T === 35615) {
+                  C[r.check = 0] = 255 & T, C[1] = T >>> 8 & 255, r.check = e(r.check, C, 2, 0), E = T = 0, r.mode = 2;
                   break;
                 }
-                if (r.flags = 0, r.head && (r.head.done = !1), !(1 & r.wrap) || (((255 & B) << 8) + (B >> 8)) % 31) {
+                if (r.flags = 0, r.head && (r.head.done = !1), !(1 & r.wrap) || (((255 & T) << 8) + (T >> 8)) % 31) {
                   d.msg = "incorrect header check", r.mode = 30;
                   break;
                 }
-                if ((15 & B) != 8) {
+                if ((15 & T) != 8) {
                   d.msg = "unknown compression method", r.mode = 30;
                   break;
                 }
-                if (I -= 4, t = 8 + (15 & (B >>>= 4)), r.wbits === 0)
+                if (E -= 4, t = 8 + (15 & (T >>>= 4)), r.wbits === 0)
                   r.wbits = t;
                 else if (t > r.wbits) {
                   d.msg = "invalid window size", r.mode = 30;
                   break;
                 }
-                r.dmax = 1 << t, d.adler = r.check = 1, r.mode = 512 & B ? 10 : 12, I = B = 0;
+                r.dmax = 1 << t, d.adler = r.check = 1, r.mode = 512 & T ? 10 : 12, E = T = 0;
                 break;
               case 2:
-                for (; I < 16; ) {
-                  if (L === 0)
+                for (; E < 16; ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                if (r.flags = B, (255 & r.flags) != 8) {
+                if (r.flags = T, (255 & r.flags) != 8) {
                   d.msg = "unknown compression method", r.mode = 30;
                   break;
                 }
@@ -2222,105 +2222,105 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   d.msg = "unknown header flags set", r.mode = 30;
                   break;
                 }
-                r.head && (r.head.text = B >> 8 & 1), 512 & r.flags && (C[0] = 255 & B, C[1] = B >>> 8 & 255, r.check = e(r.check, C, 2, 0)), I = B = 0, r.mode = 3;
+                r.head && (r.head.text = T >> 8 & 1), 512 & r.flags && (C[0] = 255 & T, C[1] = T >>> 8 & 255, r.check = e(r.check, C, 2, 0)), E = T = 0, r.mode = 3;
               case 3:
-                for (; I < 32; ) {
-                  if (L === 0)
+                for (; E < 32; ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                r.head && (r.head.time = B), 512 & r.flags && (C[0] = 255 & B, C[1] = B >>> 8 & 255, C[2] = B >>> 16 & 255, C[3] = B >>> 24 & 255, r.check = e(r.check, C, 4, 0)), I = B = 0, r.mode = 4;
+                r.head && (r.head.time = T), 512 & r.flags && (C[0] = 255 & T, C[1] = T >>> 8 & 255, C[2] = T >>> 16 & 255, C[3] = T >>> 24 & 255, r.check = e(r.check, C, 4, 0)), E = T = 0, r.mode = 4;
               case 4:
-                for (; I < 16; ) {
-                  if (L === 0)
+                for (; E < 16; ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                r.head && (r.head.xflags = 255 & B, r.head.os = B >> 8), 512 & r.flags && (C[0] = 255 & B, C[1] = B >>> 8 & 255, r.check = e(r.check, C, 2, 0)), I = B = 0, r.mode = 5;
+                r.head && (r.head.xflags = 255 & T, r.head.os = T >> 8), 512 & r.flags && (C[0] = 255 & T, C[1] = T >>> 8 & 255, r.check = e(r.check, C, 2, 0)), E = T = 0, r.mode = 5;
               case 5:
                 if (1024 & r.flags) {
-                  for (; I < 16; ) {
-                    if (L === 0)
+                  for (; E < 16; ) {
+                    if (F === 0)
                       break t;
-                    L--, B += P[F++] << I, I += 8;
+                    F--, T += P[U++] << E, E += 8;
                   }
-                  r.length = B, r.head && (r.head.extra_len = B), 512 & r.flags && (C[0] = 255 & B, C[1] = B >>> 8 & 255, r.check = e(r.check, C, 2, 0)), I = B = 0;
+                  r.length = T, r.head && (r.head.extra_len = T), 512 & r.flags && (C[0] = 255 & T, C[1] = T >>> 8 & 255, r.check = e(r.check, C, 2, 0)), E = T = 0;
                 } else
                   r.head && (r.head.extra = null);
                 r.mode = 6;
               case 6:
-                if (1024 & r.flags && (L < (K = r.length) && (K = L), K && (r.head && (t = r.head.extra_len - r.length, r.head.extra || (r.head.extra = new Array(r.head.extra_len)), l.arraySet(r.head.extra, P, F, K, t)), 512 & r.flags && (r.check = e(r.check, P, K, F)), L -= K, F += K, r.length -= K), r.length))
+                if (1024 & r.flags && (F < (K = r.length) && (K = F), K && (r.head && (t = r.head.extra_len - r.length, r.head.extra || (r.head.extra = new Array(r.head.extra_len)), l.arraySet(r.head.extra, P, U, K, t)), 512 & r.flags && (r.check = e(r.check, P, K, U)), F -= K, U += K, r.length -= K), r.length))
                   break t;
                 r.length = 0, r.mode = 7;
               case 7:
                 if (2048 & r.flags) {
-                  if (L === 0)
+                  if (F === 0)
                     break t;
-                  for (K = 0; t = P[F + K++], r.head && t && r.length < 65536 && (r.head.name += String.fromCharCode(t)), t && K < L; )
+                  for (K = 0; t = P[U + K++], r.head && t && r.length < 65536 && (r.head.name += String.fromCharCode(t)), t && K < F; )
                     ;
-                  if (512 & r.flags && (r.check = e(r.check, P, K, F)), L -= K, F += K, t)
+                  if (512 & r.flags && (r.check = e(r.check, P, K, U)), F -= K, U += K, t)
                     break t;
                 } else
                   r.head && (r.head.name = null);
                 r.length = 0, r.mode = 8;
               case 8:
                 if (4096 & r.flags) {
-                  if (L === 0)
+                  if (F === 0)
                     break t;
-                  for (K = 0; t = P[F + K++], r.head && t && r.length < 65536 && (r.head.comment += String.fromCharCode(t)), t && K < L; )
+                  for (K = 0; t = P[U + K++], r.head && t && r.length < 65536 && (r.head.comment += String.fromCharCode(t)), t && K < F; )
                     ;
-                  if (512 & r.flags && (r.check = e(r.check, P, K, F)), L -= K, F += K, t)
+                  if (512 & r.flags && (r.check = e(r.check, P, K, U)), F -= K, U += K, t)
                     break t;
                 } else
                   r.head && (r.head.comment = null);
                 r.mode = 9;
               case 9:
                 if (512 & r.flags) {
-                  for (; I < 16; ) {
-                    if (L === 0)
+                  for (; E < 16; ) {
+                    if (F === 0)
                       break t;
-                    L--, B += P[F++] << I, I += 8;
+                    F--, T += P[U++] << E, E += 8;
                   }
-                  if (B !== (65535 & r.check)) {
+                  if (T !== (65535 & r.check)) {
                     d.msg = "header crc mismatch", r.mode = 30;
                     break;
                   }
-                  I = B = 0;
+                  E = T = 0;
                 }
                 r.head && (r.head.hcrc = r.flags >> 9 & 1, r.head.done = !0), d.adler = r.check = 0, r.mode = 12;
                 break;
               case 10:
-                for (; I < 32; ) {
-                  if (L === 0)
+                for (; E < 32; ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                d.adler = r.check = c(B), I = B = 0, r.mode = 11;
+                d.adler = r.check = c(T), E = T = 0, r.mode = 11;
               case 11:
                 if (r.havedict === 0)
-                  return d.next_out = tt, d.avail_out = H, d.next_in = F, d.avail_in = L, r.hold = B, r.bits = I, 2;
+                  return d.next_out = nt, d.avail_out = Z, d.next_in = U, d.avail_in = F, r.hold = T, r.bits = E, 2;
                 d.adler = r.check = 1, r.mode = 12;
               case 12:
-                if (z === 5 || z === 6)
+                if (I === 5 || I === 6)
                   break t;
               case 13:
                 if (r.last) {
-                  B >>>= 7 & I, I -= 7 & I, r.mode = 27;
+                  T >>>= 7 & E, E -= 7 & E, r.mode = 27;
                   break;
                 }
-                for (; I < 3; ) {
-                  if (L === 0)
+                for (; E < 3; ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                switch (r.last = 1 & B, I -= 1, 3 & (B >>>= 1)) {
+                switch (r.last = 1 & T, E -= 1, 3 & (T >>>= 1)) {
                   case 0:
                     r.mode = 14;
                     break;
                   case 1:
-                    if (T(r), r.mode = 20, z !== 6)
+                    if (B(r), r.mode = 20, I !== 6)
                       break;
-                    B >>>= 2, I -= 2;
+                    T >>>= 2, E -= 2;
                     break t;
                   case 2:
                     r.mode = 17;
@@ -2328,93 +2328,93 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   case 3:
                     d.msg = "invalid block type", r.mode = 30;
                 }
-                B >>>= 2, I -= 2;
+                T >>>= 2, E -= 2;
                 break;
               case 14:
-                for (B >>>= 7 & I, I -= 7 & I; I < 32; ) {
-                  if (L === 0)
+                for (T >>>= 7 & E, E -= 7 & E; E < 32; ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                if ((65535 & B) != (B >>> 16 ^ 65535)) {
+                if ((65535 & T) != (T >>> 16 ^ 65535)) {
                   d.msg = "invalid stored block lengths", r.mode = 30;
                   break;
                 }
-                if (r.length = 65535 & B, I = B = 0, r.mode = 15, z === 6)
+                if (r.length = 65535 & T, E = T = 0, r.mode = 15, I === 6)
                   break t;
               case 15:
                 r.mode = 16;
               case 16:
                 if (K = r.length) {
-                  if (L < K && (K = L), H < K && (K = H), K === 0)
+                  if (F < K && (K = F), Z < K && (K = Z), K === 0)
                     break t;
-                  l.arraySet(V, P, F, K, tt), L -= K, F += K, H -= K, tt += K, r.length -= K;
+                  l.arraySet(q, P, U, K, nt), F -= K, U += K, Z -= K, nt += K, r.length -= K;
                   break;
                 }
                 r.mode = 12;
                 break;
               case 17:
-                for (; I < 14; ) {
-                  if (L === 0)
+                for (; E < 14; ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                if (r.nlen = 257 + (31 & B), B >>>= 5, I -= 5, r.ndist = 1 + (31 & B), B >>>= 5, I -= 5, r.ncode = 4 + (15 & B), B >>>= 4, I -= 4, 286 < r.nlen || 30 < r.ndist) {
+                if (r.nlen = 257 + (31 & T), T >>>= 5, E -= 5, r.ndist = 1 + (31 & T), T >>>= 5, E -= 5, r.ncode = 4 + (15 & T), T >>>= 4, E -= 4, 286 < r.nlen || 30 < r.ndist) {
                   d.msg = "too many length or distance symbols", r.mode = 30;
                   break;
                 }
                 r.have = 0, r.mode = 18;
               case 18:
                 for (; r.have < r.ncode; ) {
-                  for (; I < 3; ) {
-                    if (L === 0)
+                  for (; E < 3; ) {
+                    if (F === 0)
                       break t;
-                    L--, B += P[F++] << I, I += 8;
+                    F--, T += P[U++] << E, E += 8;
                   }
-                  r.lens[W[r.have++]] = 7 & B, B >>>= 3, I -= 3;
+                  r.lens[W[r.have++]] = 7 & T, T >>>= 3, E -= 3;
                 }
                 for (; r.have < 19; )
                   r.lens[W[r.have++]] = 0;
-                if (r.lencode = r.lendyn, r.lenbits = 7, R = { bits: r.lenbits }, j = u(0, r.lens, 0, 19, r.lencode, 0, r.work, R), r.lenbits = R.bits, j) {
+                if (r.lencode = r.lendyn, r.lenbits = 7, N = { bits: r.lenbits }, j = u(0, r.lens, 0, 19, r.lencode, 0, r.work, N), r.lenbits = N.bits, j) {
                   d.msg = "invalid code lengths set", r.mode = 30;
                   break;
                 }
                 r.have = 0, r.mode = 19;
               case 19:
                 for (; r.have < r.nlen + r.ndist; ) {
-                  for (; rt = (_ = r.lencode[B & (1 << r.lenbits) - 1]) >>> 16 & 255, at = 65535 & _, !((Q = _ >>> 24) <= I); ) {
-                    if (L === 0)
+                  for (; et = (_ = r.lencode[T & (1 << r.lenbits) - 1]) >>> 16 & 255, at = 65535 & _, !((Q = _ >>> 24) <= E); ) {
+                    if (F === 0)
                       break t;
-                    L--, B += P[F++] << I, I += 8;
+                    F--, T += P[U++] << E, E += 8;
                   }
                   if (at < 16)
-                    B >>>= Q, I -= Q, r.lens[r.have++] = at;
+                    T >>>= Q, E -= Q, r.lens[r.have++] = at;
                   else {
                     if (at === 16) {
-                      for (y = Q + 2; I < y; ) {
-                        if (L === 0)
+                      for (y = Q + 2; E < y; ) {
+                        if (F === 0)
                           break t;
-                        L--, B += P[F++] << I, I += 8;
+                        F--, T += P[U++] << E, E += 8;
                       }
-                      if (B >>>= Q, I -= Q, r.have === 0) {
+                      if (T >>>= Q, E -= Q, r.have === 0) {
                         d.msg = "invalid bit length repeat", r.mode = 30;
                         break;
                       }
-                      t = r.lens[r.have - 1], K = 3 + (3 & B), B >>>= 2, I -= 2;
+                      t = r.lens[r.have - 1], K = 3 + (3 & T), T >>>= 2, E -= 2;
                     } else if (at === 17) {
-                      for (y = Q + 3; I < y; ) {
-                        if (L === 0)
+                      for (y = Q + 3; E < y; ) {
+                        if (F === 0)
                           break t;
-                        L--, B += P[F++] << I, I += 8;
+                        F--, T += P[U++] << E, E += 8;
                       }
-                      I -= Q, t = 0, K = 3 + (7 & (B >>>= Q)), B >>>= 3, I -= 3;
+                      E -= Q, t = 0, K = 3 + (7 & (T >>>= Q)), T >>>= 3, E -= 3;
                     } else {
-                      for (y = Q + 7; I < y; ) {
-                        if (L === 0)
+                      for (y = Q + 7; E < y; ) {
+                        if (F === 0)
                           break t;
-                        L--, B += P[F++] << I, I += 8;
+                        F--, T += P[U++] << E, E += 8;
                       }
-                      I -= Q, t = 0, K = 11 + (127 & (B >>>= Q)), B >>>= 7, I -= 7;
+                      E -= Q, t = 0, K = 11 + (127 & (T >>>= Q)), T >>>= 7, E -= 7;
                     }
                     if (r.have + K > r.nlen + r.ndist) {
                       d.msg = "invalid bit length repeat", r.mode = 30;
@@ -2430,86 +2430,86 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   d.msg = "invalid code -- missing end-of-block", r.mode = 30;
                   break;
                 }
-                if (r.lenbits = 9, R = { bits: r.lenbits }, j = u(h, r.lens, 0, r.nlen, r.lencode, 0, r.work, R), r.lenbits = R.bits, j) {
+                if (r.lenbits = 9, N = { bits: r.lenbits }, j = u(h, r.lens, 0, r.nlen, r.lencode, 0, r.work, N), r.lenbits = N.bits, j) {
                   d.msg = "invalid literal/lengths set", r.mode = 30;
                   break;
                 }
-                if (r.distbits = 6, r.distcode = r.distdyn, R = { bits: r.distbits }, j = u(p, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, R), r.distbits = R.bits, j) {
+                if (r.distbits = 6, r.distcode = r.distdyn, N = { bits: r.distbits }, j = u(p, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, N), r.distbits = N.bits, j) {
                   d.msg = "invalid distances set", r.mode = 30;
                   break;
                 }
-                if (r.mode = 20, z === 6)
+                if (r.mode = 20, I === 6)
                   break t;
               case 20:
                 r.mode = 21;
               case 21:
-                if (6 <= L && 258 <= H) {
-                  d.next_out = tt, d.avail_out = H, d.next_in = F, d.avail_in = L, r.hold = B, r.bits = I, s(d, Y), tt = d.next_out, V = d.output, H = d.avail_out, F = d.next_in, P = d.input, L = d.avail_in, B = r.hold, I = r.bits, r.mode === 12 && (r.back = -1);
+                if (6 <= F && 258 <= Z) {
+                  d.next_out = nt, d.avail_out = Z, d.next_in = U, d.avail_in = F, r.hold = T, r.bits = E, s(d, Y), nt = d.next_out, q = d.output, Z = d.avail_out, U = d.next_in, P = d.input, F = d.avail_in, T = r.hold, E = r.bits, r.mode === 12 && (r.back = -1);
                   break;
                 }
-                for (r.back = 0; rt = (_ = r.lencode[B & (1 << r.lenbits) - 1]) >>> 16 & 255, at = 65535 & _, !((Q = _ >>> 24) <= I); ) {
-                  if (L === 0)
+                for (r.back = 0; et = (_ = r.lencode[T & (1 << r.lenbits) - 1]) >>> 16 & 255, at = 65535 & _, !((Q = _ >>> 24) <= E); ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                if (rt && !(240 & rt)) {
-                  for (lt = Q, mt = rt, ut = at; rt = (_ = r.lencode[ut + ((B & (1 << lt + mt) - 1) >> lt)]) >>> 16 & 255, at = 65535 & _, !(lt + (Q = _ >>> 24) <= I); ) {
-                    if (L === 0)
+                if (et && !(240 & et)) {
+                  for (lt = Q, mt = et, ut = at; et = (_ = r.lencode[ut + ((T & (1 << lt + mt) - 1) >> lt)]) >>> 16 & 255, at = 65535 & _, !(lt + (Q = _ >>> 24) <= E); ) {
+                    if (F === 0)
                       break t;
-                    L--, B += P[F++] << I, I += 8;
+                    F--, T += P[U++] << E, E += 8;
                   }
-                  B >>>= lt, I -= lt, r.back += lt;
+                  T >>>= lt, E -= lt, r.back += lt;
                 }
-                if (B >>>= Q, I -= Q, r.back += Q, r.length = at, rt === 0) {
+                if (T >>>= Q, E -= Q, r.back += Q, r.length = at, et === 0) {
                   r.mode = 26;
                   break;
                 }
-                if (32 & rt) {
+                if (32 & et) {
                   r.back = -1, r.mode = 12;
                   break;
                 }
-                if (64 & rt) {
+                if (64 & et) {
                   d.msg = "invalid literal/length code", r.mode = 30;
                   break;
                 }
-                r.extra = 15 & rt, r.mode = 22;
+                r.extra = 15 & et, r.mode = 22;
               case 22:
                 if (r.extra) {
-                  for (y = r.extra; I < y; ) {
-                    if (L === 0)
+                  for (y = r.extra; E < y; ) {
+                    if (F === 0)
                       break t;
-                    L--, B += P[F++] << I, I += 8;
+                    F--, T += P[U++] << E, E += 8;
                   }
-                  r.length += B & (1 << r.extra) - 1, B >>>= r.extra, I -= r.extra, r.back += r.extra;
+                  r.length += T & (1 << r.extra) - 1, T >>>= r.extra, E -= r.extra, r.back += r.extra;
                 }
                 r.was = r.length, r.mode = 23;
               case 23:
-                for (; rt = (_ = r.distcode[B & (1 << r.distbits) - 1]) >>> 16 & 255, at = 65535 & _, !((Q = _ >>> 24) <= I); ) {
-                  if (L === 0)
+                for (; et = (_ = r.distcode[T & (1 << r.distbits) - 1]) >>> 16 & 255, at = 65535 & _, !((Q = _ >>> 24) <= E); ) {
+                  if (F === 0)
                     break t;
-                  L--, B += P[F++] << I, I += 8;
+                  F--, T += P[U++] << E, E += 8;
                 }
-                if (!(240 & rt)) {
-                  for (lt = Q, mt = rt, ut = at; rt = (_ = r.distcode[ut + ((B & (1 << lt + mt) - 1) >> lt)]) >>> 16 & 255, at = 65535 & _, !(lt + (Q = _ >>> 24) <= I); ) {
-                    if (L === 0)
+                if (!(240 & et)) {
+                  for (lt = Q, mt = et, ut = at; et = (_ = r.distcode[ut + ((T & (1 << lt + mt) - 1) >> lt)]) >>> 16 & 255, at = 65535 & _, !(lt + (Q = _ >>> 24) <= E); ) {
+                    if (F === 0)
                       break t;
-                    L--, B += P[F++] << I, I += 8;
+                    F--, T += P[U++] << E, E += 8;
                   }
-                  B >>>= lt, I -= lt, r.back += lt;
+                  T >>>= lt, E -= lt, r.back += lt;
                 }
-                if (B >>>= Q, I -= Q, r.back += Q, 64 & rt) {
+                if (T >>>= Q, E -= Q, r.back += Q, 64 & et) {
                   d.msg = "invalid distance code", r.mode = 30;
                   break;
                 }
-                r.offset = at, r.extra = 15 & rt, r.mode = 24;
+                r.offset = at, r.extra = 15 & et, r.mode = 24;
               case 24:
                 if (r.extra) {
-                  for (y = r.extra; I < y; ) {
-                    if (L === 0)
+                  for (y = r.extra; E < y; ) {
+                    if (F === 0)
                       break t;
-                    L--, B += P[F++] << I, I += 8;
+                    F--, T += P[U++] << E, E += 8;
                   }
-                  r.offset += B & (1 << r.extra) - 1, B >>>= r.extra, I -= r.extra, r.back += r.extra;
+                  r.offset += T & (1 << r.extra) - 1, T >>>= r.extra, E -= r.extra, r.back += r.extra;
                 }
                 if (r.offset > r.dmax) {
                   d.msg = "invalid distance too far back", r.mode = 30;
@@ -2517,51 +2517,51 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 }
                 r.mode = 25;
               case 25:
-                if (H === 0)
+                if (Z === 0)
                   break t;
-                if (K = Y - H, r.offset > K) {
+                if (K = Y - Z, r.offset > K) {
                   if ((K = r.offset - K) > r.whave && r.sane) {
                     d.msg = "invalid distance too far back", r.mode = 30;
                     break;
                   }
-                  ot = K > r.wnext ? (K -= r.wnext, r.wsize - K) : r.wnext - K, K > r.length && (K = r.length), et = r.window;
+                  ot = K > r.wnext ? (K -= r.wnext, r.wsize - K) : r.wnext - K, K > r.length && (K = r.length), tt = r.window;
                 } else
-                  et = V, ot = tt - r.offset, K = r.length;
-                for (H < K && (K = H), H -= K, r.length -= K; V[tt++] = et[ot++], --K; )
+                  tt = q, ot = nt - r.offset, K = r.length;
+                for (Z < K && (K = Z), Z -= K, r.length -= K; q[nt++] = tt[ot++], --K; )
                   ;
                 r.length === 0 && (r.mode = 21);
                 break;
               case 26:
-                if (H === 0)
+                if (Z === 0)
                   break t;
-                V[tt++] = r.length, H--, r.mode = 21;
+                q[nt++] = r.length, Z--, r.mode = 21;
                 break;
               case 27:
                 if (r.wrap) {
-                  for (; I < 32; ) {
-                    if (L === 0)
+                  for (; E < 32; ) {
+                    if (F === 0)
                       break t;
-                    L--, B |= P[F++] << I, I += 8;
+                    F--, T |= P[U++] << E, E += 8;
                   }
-                  if (Y -= H, d.total_out += Y, r.total += Y, Y && (d.adler = r.check = r.flags ? e(r.check, V, Y, tt - Y) : a(r.check, V, Y, tt - Y)), Y = H, (r.flags ? B : c(B)) !== r.check) {
+                  if (Y -= Z, d.total_out += Y, r.total += Y, Y && (d.adler = r.check = r.flags ? e(r.check, q, Y, nt - Y) : a(r.check, q, Y, nt - Y)), Y = Z, (r.flags ? T : c(T)) !== r.check) {
                     d.msg = "incorrect data check", r.mode = 30;
                     break;
                   }
-                  I = B = 0;
+                  E = T = 0;
                 }
                 r.mode = 28;
               case 28:
                 if (r.wrap && r.flags) {
-                  for (; I < 32; ) {
-                    if (L === 0)
+                  for (; E < 32; ) {
+                    if (F === 0)
                       break t;
-                    L--, B += P[F++] << I, I += 8;
+                    F--, T += P[U++] << E, E += 8;
                   }
-                  if (B !== (4294967295 & r.total)) {
+                  if (T !== (4294967295 & r.total)) {
                     d.msg = "incorrect length check", r.mode = 30;
                     break;
                   }
-                  I = B = 0;
+                  E = T = 0;
                 }
                 r.mode = 29;
               case 29:
@@ -2576,63 +2576,63 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               default:
                 return o;
             }
-        return d.next_out = tt, d.avail_out = H, d.next_in = F, d.avail_in = L, r.hold = B, r.bits = I, (r.wsize || Y !== d.avail_out && r.mode < 30 && (r.mode < 27 || z !== 4)) && D(d, d.output, d.next_out, Y - d.avail_out) ? (r.mode = 31, -4) : (q -= d.avail_in, Y -= d.avail_out, d.total_in += q, d.total_out += Y, r.total += Y, r.wrap && Y && (d.adler = r.check = r.flags ? e(r.check, V, Y, d.next_out - Y) : a(r.check, V, Y, d.next_out - Y)), d.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === 12 ? 128 : 0) + (r.mode === 20 || r.mode === 15 ? 256 : 0), (q == 0 && Y === 0 || z === 4) && j === b && (j = -5), j);
+        return d.next_out = nt, d.avail_out = Z, d.next_in = U, d.avail_in = F, r.hold = T, r.bits = E, (r.wsize || Y !== d.avail_out && r.mode < 30 && (r.mode < 27 || I !== 4)) && R(d, d.output, d.next_out, Y - d.avail_out) ? (r.mode = 31, -4) : (J -= d.avail_in, Y -= d.avail_out, d.total_in += J, d.total_out += Y, r.total += Y, r.wrap && Y && (d.adler = r.check = r.flags ? e(r.check, q, Y, d.next_out - Y) : a(r.check, q, Y, d.next_out - Y)), d.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === 12 ? 128 : 0) + (r.mode === 20 || r.mode === 15 ? 256 : 0), (J == 0 && Y === 0 || I === 4) && j === b && (j = -5), j);
       }, g.inflateEnd = function(d) {
         if (!d || !d.state)
           return o;
-        var z = d.state;
-        return z.window && (z.window = null), d.state = null, b;
-      }, g.inflateGetHeader = function(d, z) {
+        var I = d.state;
+        return I.window && (I.window = null), d.state = null, b;
+      }, g.inflateGetHeader = function(d, I) {
         var r;
-        return d && d.state && 2 & (r = d.state).wrap ? ((r.head = z).done = !1, b) : o;
-      }, g.inflateSetDictionary = function(d, z) {
-        var r, P = z.length;
-        return d && d.state ? (r = d.state).wrap !== 0 && r.mode !== 11 ? o : r.mode === 11 && a(1, z, P, 0) !== r.check ? -3 : D(d, z, P, P) ? (r.mode = 31, -4) : (r.havedict = 1, b) : o;
+        return d && d.state && 2 & (r = d.state).wrap ? ((r.head = I).done = !1, b) : o;
+      }, g.inflateSetDictionary = function(d, I) {
+        var r, P = I.length;
+        return d && d.state ? (r = d.state).wrap !== 0 && r.mode !== 11 ? o : r.mode === 11 && a(1, I, P, 0) !== r.check ? -3 : R(d, I, P, P) ? (r.mode = 31, -4) : (r.havedict = 1, b) : o;
       }, g.inflateInfo = "pako inflate (from Nodeca project)";
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(n, k, g) {
       var l = n("../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], e = [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], s = [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], u = [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];
       k.exports = function(h, p, b, o, m, i, f, c) {
-        var w, x, E, A, U, N, Z, v, T, D = c.bits, d = 0, z = 0, r = 0, P = 0, V = 0, F = 0, tt = 0, L = 0, H = 0, B = 0, I = null, q = 0, Y = new l.Buf16(16), K = new l.Buf16(16), ot = null, et = 0;
+        var w, x, A, z, M, D, H, v, B, R = c.bits, d = 0, I = 0, r = 0, P = 0, q = 0, U = 0, nt = 0, F = 0, Z = 0, T = 0, E = null, J = 0, Y = new l.Buf16(16), K = new l.Buf16(16), ot = null, tt = 0;
         for (d = 0; d <= 15; d++)
           Y[d] = 0;
-        for (z = 0; z < o; z++)
-          Y[p[b + z]]++;
-        for (V = D, P = 15; 1 <= P && Y[P] === 0; P--)
+        for (I = 0; I < o; I++)
+          Y[p[b + I]]++;
+        for (q = R, P = 15; 1 <= P && Y[P] === 0; P--)
           ;
-        if (P < V && (V = P), P === 0)
+        if (P < q && (q = P), P === 0)
           return m[i++] = 20971520, m[i++] = 20971520, c.bits = 1, 0;
         for (r = 1; r < P && Y[r] === 0; r++)
           ;
-        for (V < r && (V = r), d = L = 1; d <= 15; d++)
-          if (L <<= 1, (L -= Y[d]) < 0)
+        for (q < r && (q = r), d = F = 1; d <= 15; d++)
+          if (F <<= 1, (F -= Y[d]) < 0)
             return -1;
-        if (0 < L && (h === 0 || P !== 1))
+        if (0 < F && (h === 0 || P !== 1))
           return -1;
         for (K[1] = 0, d = 1; d < 15; d++)
           K[d + 1] = K[d] + Y[d];
-        for (z = 0; z < o; z++)
-          p[b + z] !== 0 && (f[K[p[b + z]]++] = z);
-        if (N = h === 0 ? (I = ot = f, 19) : h === 1 ? (I = a, q -= 257, ot = e, et -= 257, 256) : (I = s, ot = u, -1), d = r, U = i, tt = z = B = 0, E = -1, A = (H = 1 << (F = V)) - 1, h === 1 && 852 < H || h === 2 && 592 < H)
+        for (I = 0; I < o; I++)
+          p[b + I] !== 0 && (f[K[p[b + I]]++] = I);
+        if (D = h === 0 ? (E = ot = f, 19) : h === 1 ? (E = a, J -= 257, ot = e, tt -= 257, 256) : (E = s, ot = u, -1), d = r, M = i, nt = I = T = 0, A = -1, z = (Z = 1 << (U = q)) - 1, h === 1 && 852 < Z || h === 2 && 592 < Z)
           return 1;
         for (; ; ) {
-          for (Z = d - tt, T = f[z] < N ? (v = 0, f[z]) : f[z] > N ? (v = ot[et + f[z]], I[q + f[z]]) : (v = 96, 0), w = 1 << d - tt, r = x = 1 << F; m[U + (B >> tt) + (x -= w)] = Z << 24 | v << 16 | T | 0, x !== 0; )
+          for (H = d - nt, B = f[I] < D ? (v = 0, f[I]) : f[I] > D ? (v = ot[tt + f[I]], E[J + f[I]]) : (v = 96, 0), w = 1 << d - nt, r = x = 1 << U; m[M + (T >> nt) + (x -= w)] = H << 24 | v << 16 | B | 0, x !== 0; )
             ;
-          for (w = 1 << d - 1; B & w; )
+          for (w = 1 << d - 1; T & w; )
             w >>= 1;
-          if (w !== 0 ? (B &= w - 1, B += w) : B = 0, z++, --Y[d] == 0) {
+          if (w !== 0 ? (T &= w - 1, T += w) : T = 0, I++, --Y[d] == 0) {
             if (d === P)
               break;
-            d = p[b + f[z]];
+            d = p[b + f[I]];
           }
-          if (V < d && (B & A) !== E) {
-            for (tt === 0 && (tt = V), U += r, L = 1 << (F = d - tt); F + tt < P && !((L -= Y[F + tt]) <= 0); )
-              F++, L <<= 1;
-            if (H += 1 << F, h === 1 && 852 < H || h === 2 && 592 < H)
+          if (q < d && (T & z) !== A) {
+            for (nt === 0 && (nt = q), M += r, F = 1 << (U = d - nt); U + nt < P && !((F -= Y[U + nt]) <= 0); )
+              U++, F <<= 1;
+            if (Z += 1 << U, h === 1 && 852 < Z || h === 2 && 592 < Z)
               return 1;
-            m[E = B & A] = V << 24 | F << 16 | U - i | 0;
+            m[A = T & z] = q << 24 | U << 16 | M - i | 0;
           }
         }
-        return B !== 0 && (m[U + B] = d - tt << 24 | 64 << 16 | 0), c.bits = V, 0;
+        return T !== 0 && (m[M + T] = d - nt << 24 | 64 << 16 | 0), c.bits = q, 0;
       };
     }, { "../utils/common": 41 }], 51: [function(n, k, g) {
       k.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" };
@@ -2642,31 +2642,31 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         for (var C = _.length; 0 <= --C; )
           _[C] = 0;
       }
-      var u = 0, h = 29, p = 256, b = p + 1 + h, o = 30, m = 19, i = 2 * b + 1, f = 15, c = 16, w = 7, x = 256, E = 16, A = 17, U = 18, N = [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], Z = [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], v = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], T = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], D = new Array(2 * (b + 2));
-      s(D);
+      var u = 0, h = 29, p = 256, b = p + 1 + h, o = 30, m = 19, i = 2 * b + 1, f = 15, c = 16, w = 7, x = 256, A = 16, z = 17, M = 18, D = [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], H = [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], v = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], B = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], R = new Array(2 * (b + 2));
+      s(R);
       var d = new Array(2 * o);
       s(d);
-      var z = new Array(512);
-      s(z);
+      var I = new Array(512);
+      s(I);
       var r = new Array(256);
       s(r);
       var P = new Array(h);
       s(P);
-      var V, F, tt, L = new Array(o);
-      function H(_, C, W, $, O) {
+      var q, U, nt, F = new Array(o);
+      function Z(_, C, W, $, O) {
         this.static_tree = _, this.extra_bits = C, this.extra_base = W, this.elems = $, this.max_length = O, this.has_stree = _ && _.length;
       }
-      function B(_, C) {
+      function T(_, C) {
         this.dyn_tree = _, this.max_code = 0, this.stat_desc = C;
       }
-      function I(_) {
-        return _ < 256 ? z[_] : z[256 + (_ >>> 7)];
+      function E(_) {
+        return _ < 256 ? I[_] : I[256 + (_ >>> 7)];
       }
-      function q(_, C) {
+      function J(_, C) {
         _.pending_buf[_.pending++] = 255 & C, _.pending_buf[_.pending++] = C >>> 8 & 255;
       }
       function Y(_, C, W) {
-        _.bi_valid > c - W ? (_.bi_buf |= C << _.bi_valid & 65535, q(_, _.bi_buf), _.bi_buf = C >> c - _.bi_valid, _.bi_valid += W - c) : (_.bi_buf |= C << _.bi_valid & 65535, _.bi_valid += W);
+        _.bi_valid > c - W ? (_.bi_buf |= C << _.bi_valid & 65535, J(_, _.bi_buf), _.bi_buf = C >> c - _.bi_valid, _.bi_valid += W - c) : (_.bi_buf |= C << _.bi_valid & 65535, _.bi_valid += W);
       }
       function K(_, C, W) {
         Y(_, W[2 * C], W[2 * C + 1]);
@@ -2676,10 +2676,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           ;
         return W >>> 1;
       }
-      function et(_, C, W) {
-        var $, O, G = new Array(f + 1), J = 0;
+      function tt(_, C, W) {
+        var $, O, G = new Array(f + 1), V = 0;
         for ($ = 1; $ <= f; $++)
-          G[$] = J = J + W[$ - 1] << 1;
+          G[$] = V = V + W[$ - 1] << 1;
         for (O = 0; O <= C; O++) {
           var X = _[2 * O + 1];
           X !== 0 && (_[2 * O] = ot(G[X]++, X));
@@ -2695,8 +2695,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           _.bl_tree[2 * C] = 0;
         _.dyn_ltree[2 * x] = 1, _.opt_len = _.static_len = 0, _.last_lit = _.matches = 0;
       }
-      function rt(_) {
-        8 < _.bi_valid ? q(_, _.bi_buf) : 0 < _.bi_valid && (_.pending_buf[_.pending++] = _.bi_buf), _.bi_buf = 0, _.bi_valid = 0;
+      function et(_) {
+        8 < _.bi_valid ? J(_, _.bi_buf) : 0 < _.bi_valid && (_.pending_buf[_.pending++] = _.bi_buf), _.bi_buf = 0, _.bi_valid = 0;
       }
       function at(_, C, W, $) {
         var O = 2 * C, G = 2 * W;
@@ -2708,21 +2708,21 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         _.heap[W] = $;
       }
       function mt(_, C, W) {
-        var $, O, G, J, X = 0;
+        var $, O, G, V, X = 0;
         if (_.last_lit !== 0)
-          for (; $ = _.pending_buf[_.d_buf + 2 * X] << 8 | _.pending_buf[_.d_buf + 2 * X + 1], O = _.pending_buf[_.l_buf + X], X++, $ === 0 ? K(_, O, C) : (K(_, (G = r[O]) + p + 1, C), (J = N[G]) !== 0 && Y(_, O -= P[G], J), K(_, G = I(--$), W), (J = Z[G]) !== 0 && Y(_, $ -= L[G], J)), X < _.last_lit; )
+          for (; $ = _.pending_buf[_.d_buf + 2 * X] << 8 | _.pending_buf[_.d_buf + 2 * X + 1], O = _.pending_buf[_.l_buf + X], X++, $ === 0 ? K(_, O, C) : (K(_, (G = r[O]) + p + 1, C), (V = D[G]) !== 0 && Y(_, O -= P[G], V), K(_, G = E(--$), W), (V = H[G]) !== 0 && Y(_, $ -= F[G], V)), X < _.last_lit; )
             ;
         K(_, x, C);
       }
       function ut(_, C) {
-        var W, $, O, G = C.dyn_tree, J = C.stat_desc.static_tree, X = C.stat_desc.has_stree, nt = C.stat_desc.elems, st = -1;
-        for (_.heap_len = 0, _.heap_max = i, W = 0; W < nt; W++)
+        var W, $, O, G = C.dyn_tree, V = C.stat_desc.static_tree, X = C.stat_desc.has_stree, rt = C.stat_desc.elems, st = -1;
+        for (_.heap_len = 0, _.heap_max = i, W = 0; W < rt; W++)
           G[2 * W] !== 0 ? (_.heap[++_.heap_len] = st = W, _.depth[W] = 0) : G[2 * W + 1] = 0;
         for (; _.heap_len < 2; )
-          G[2 * (O = _.heap[++_.heap_len] = st < 2 ? ++st : 0)] = 1, _.depth[O] = 0, _.opt_len--, X && (_.static_len -= J[2 * O + 1]);
+          G[2 * (O = _.heap[++_.heap_len] = st < 2 ? ++st : 0)] = 1, _.depth[O] = 0, _.opt_len--, X && (_.static_len -= V[2 * O + 1]);
         for (C.max_code = st, W = _.heap_len >> 1; 1 <= W; W--)
           lt(_, G, W);
-        for (O = nt; W = _.heap[1], _.heap[1] = _.heap[_.heap_len--], lt(_, G, 1), $ = _.heap[1], _.heap[--_.heap_max] = W, _.heap[--_.heap_max] = $, G[2 * O] = G[2 * W] + G[2 * $], _.depth[O] = (_.depth[W] >= _.depth[$] ? _.depth[W] : _.depth[$]) + 1, G[2 * W + 1] = G[2 * $ + 1] = O, _.heap[1] = O++, lt(_, G, 1), 2 <= _.heap_len; )
+        for (O = rt; W = _.heap[1], _.heap[1] = _.heap[_.heap_len--], lt(_, G, 1), $ = _.heap[1], _.heap[--_.heap_max] = W, _.heap[--_.heap_max] = $, G[2 * O] = G[2 * W] + G[2 * $], _.depth[O] = (_.depth[W] >= _.depth[$] ? _.depth[W] : _.depth[$]) + 1, G[2 * W + 1] = G[2 * $ + 1] = O, _.heap[1] = O++, lt(_, G, 1), 2 <= _.heap_len; )
           ;
         _.heap[--_.heap_max] = _.heap[1], function(it, ft) {
           var bt, gt, yt, ct, Ct, Bt, _t = ft.dyn_tree, jt = ft.max_code, re = ft.stat_desc.static_tree, ne = ft.stat_desc.has_stree, ie = ft.stat_desc.extra_bits, Wt = ft.stat_desc.extra_base, wt = ft.stat_desc.max_length, Et = 0;
@@ -2740,87 +2740,87 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               for (gt = it.bl_count[ct]; gt !== 0; )
                 jt < (yt = it.heap[--bt]) || (_t[2 * yt + 1] !== ct && (it.opt_len += (ct - _t[2 * yt + 1]) * _t[2 * yt], _t[2 * yt + 1] = ct), gt--);
           }
-        }(_, C), et(G, st, _.bl_count);
+        }(_, C), tt(G, st, _.bl_count);
       }
       function t(_, C, W) {
-        var $, O, G = -1, J = C[1], X = 0, nt = 7, st = 4;
-        for (J === 0 && (nt = 138, st = 3), C[2 * (W + 1) + 1] = 65535, $ = 0; $ <= W; $++)
-          O = J, J = C[2 * ($ + 1) + 1], ++X < nt && O === J || (X < st ? _.bl_tree[2 * O] += X : O !== 0 ? (O !== G && _.bl_tree[2 * O]++, _.bl_tree[2 * E]++) : X <= 10 ? _.bl_tree[2 * A]++ : _.bl_tree[2 * U]++, G = O, st = (X = 0) === J ? (nt = 138, 3) : O === J ? (nt = 6, 3) : (nt = 7, 4));
+        var $, O, G = -1, V = C[1], X = 0, rt = 7, st = 4;
+        for (V === 0 && (rt = 138, st = 3), C[2 * (W + 1) + 1] = 65535, $ = 0; $ <= W; $++)
+          O = V, V = C[2 * ($ + 1) + 1], ++X < rt && O === V || (X < st ? _.bl_tree[2 * O] += X : O !== 0 ? (O !== G && _.bl_tree[2 * O]++, _.bl_tree[2 * A]++) : X <= 10 ? _.bl_tree[2 * z]++ : _.bl_tree[2 * M]++, G = O, st = (X = 0) === V ? (rt = 138, 3) : O === V ? (rt = 6, 3) : (rt = 7, 4));
       }
       function j(_, C, W) {
-        var $, O, G = -1, J = C[1], X = 0, nt = 7, st = 4;
-        for (J === 0 && (nt = 138, st = 3), $ = 0; $ <= W; $++)
-          if (O = J, J = C[2 * ($ + 1) + 1], !(++X < nt && O === J)) {
+        var $, O, G = -1, V = C[1], X = 0, rt = 7, st = 4;
+        for (V === 0 && (rt = 138, st = 3), $ = 0; $ <= W; $++)
+          if (O = V, V = C[2 * ($ + 1) + 1], !(++X < rt && O === V)) {
             if (X < st)
               for (; K(_, O, _.bl_tree), --X != 0; )
                 ;
             else
-              O !== 0 ? (O !== G && (K(_, O, _.bl_tree), X--), K(_, E, _.bl_tree), Y(_, X - 3, 2)) : X <= 10 ? (K(_, A, _.bl_tree), Y(_, X - 3, 3)) : (K(_, U, _.bl_tree), Y(_, X - 11, 7));
-            G = O, st = (X = 0) === J ? (nt = 138, 3) : O === J ? (nt = 6, 3) : (nt = 7, 4);
+              O !== 0 ? (O !== G && (K(_, O, _.bl_tree), X--), K(_, A, _.bl_tree), Y(_, X - 3, 2)) : X <= 10 ? (K(_, z, _.bl_tree), Y(_, X - 3, 3)) : (K(_, M, _.bl_tree), Y(_, X - 11, 7));
+            G = O, st = (X = 0) === V ? (rt = 138, 3) : O === V ? (rt = 6, 3) : (rt = 7, 4);
           }
       }
-      s(L);
-      var R = !1;
+      s(F);
+      var N = !1;
       function y(_, C, W, $) {
-        Y(_, (u << 1) + ($ ? 1 : 0), 3), function(O, G, J, X) {
-          rt(O), X && (q(O, J), q(O, ~J)), l.arraySet(O.pending_buf, O.window, G, J, O.pending), O.pending += J;
+        Y(_, (u << 1) + ($ ? 1 : 0), 3), function(O, G, V, X) {
+          et(O), X && (J(O, V), J(O, ~V)), l.arraySet(O.pending_buf, O.window, G, V, O.pending), O.pending += V;
         }(_, C, W, !0);
       }
       g._tr_init = function(_) {
-        R || (function() {
-          var C, W, $, O, G, J = new Array(f + 1);
+        N || (function() {
+          var C, W, $, O, G, V = new Array(f + 1);
           for (O = $ = 0; O < h - 1; O++)
-            for (P[O] = $, C = 0; C < 1 << N[O]; C++)
+            for (P[O] = $, C = 0; C < 1 << D[O]; C++)
               r[$++] = O;
           for (r[$ - 1] = O, O = G = 0; O < 16; O++)
-            for (L[O] = G, C = 0; C < 1 << Z[O]; C++)
-              z[G++] = O;
+            for (F[O] = G, C = 0; C < 1 << H[O]; C++)
+              I[G++] = O;
           for (G >>= 7; O < o; O++)
-            for (L[O] = G << 7, C = 0; C < 1 << Z[O] - 7; C++)
-              z[256 + G++] = O;
+            for (F[O] = G << 7, C = 0; C < 1 << H[O] - 7; C++)
+              I[256 + G++] = O;
           for (W = 0; W <= f; W++)
-            J[W] = 0;
+            V[W] = 0;
           for (C = 0; C <= 143; )
-            D[2 * C + 1] = 8, C++, J[8]++;
+            R[2 * C + 1] = 8, C++, V[8]++;
           for (; C <= 255; )
-            D[2 * C + 1] = 9, C++, J[9]++;
+            R[2 * C + 1] = 9, C++, V[9]++;
           for (; C <= 279; )
-            D[2 * C + 1] = 7, C++, J[7]++;
+            R[2 * C + 1] = 7, C++, V[7]++;
           for (; C <= 287; )
-            D[2 * C + 1] = 8, C++, J[8]++;
-          for (et(D, b + 1, J), C = 0; C < o; C++)
+            R[2 * C + 1] = 8, C++, V[8]++;
+          for (tt(R, b + 1, V), C = 0; C < o; C++)
             d[2 * C + 1] = 5, d[2 * C] = ot(C, 5);
-          V = new H(D, N, p + 1, b, f), F = new H(d, Z, 0, o, f), tt = new H(new Array(0), v, 0, m, w);
-        }(), R = !0), _.l_desc = new B(_.dyn_ltree, V), _.d_desc = new B(_.dyn_dtree, F), _.bl_desc = new B(_.bl_tree, tt), _.bi_buf = 0, _.bi_valid = 0, Q(_);
+          q = new Z(R, D, p + 1, b, f), U = new Z(d, H, 0, o, f), nt = new Z(new Array(0), v, 0, m, w);
+        }(), N = !0), _.l_desc = new T(_.dyn_ltree, q), _.d_desc = new T(_.dyn_dtree, U), _.bl_desc = new T(_.bl_tree, nt), _.bi_buf = 0, _.bi_valid = 0, Q(_);
       }, g._tr_stored_block = y, g._tr_flush_block = function(_, C, W, $) {
-        var O, G, J = 0;
+        var O, G, V = 0;
         0 < _.level ? (_.strm.data_type === 2 && (_.strm.data_type = function(X) {
-          var nt, st = 4093624447;
-          for (nt = 0; nt <= 31; nt++, st >>>= 1)
-            if (1 & st && X.dyn_ltree[2 * nt] !== 0)
+          var rt, st = 4093624447;
+          for (rt = 0; rt <= 31; rt++, st >>>= 1)
+            if (1 & st && X.dyn_ltree[2 * rt] !== 0)
               return a;
           if (X.dyn_ltree[18] !== 0 || X.dyn_ltree[20] !== 0 || X.dyn_ltree[26] !== 0)
             return e;
-          for (nt = 32; nt < p; nt++)
-            if (X.dyn_ltree[2 * nt] !== 0)
+          for (rt = 32; rt < p; rt++)
+            if (X.dyn_ltree[2 * rt] !== 0)
               return e;
           return a;
-        }(_)), ut(_, _.l_desc), ut(_, _.d_desc), J = function(X) {
-          var nt;
-          for (t(X, X.dyn_ltree, X.l_desc.max_code), t(X, X.dyn_dtree, X.d_desc.max_code), ut(X, X.bl_desc), nt = m - 1; 3 <= nt && X.bl_tree[2 * T[nt] + 1] === 0; nt--)
+        }(_)), ut(_, _.l_desc), ut(_, _.d_desc), V = function(X) {
+          var rt;
+          for (t(X, X.dyn_ltree, X.l_desc.max_code), t(X, X.dyn_dtree, X.d_desc.max_code), ut(X, X.bl_desc), rt = m - 1; 3 <= rt && X.bl_tree[2 * B[rt] + 1] === 0; rt--)
             ;
-          return X.opt_len += 3 * (nt + 1) + 5 + 5 + 4, nt;
-        }(_), O = _.opt_len + 3 + 7 >>> 3, (G = _.static_len + 3 + 7 >>> 3) <= O && (O = G)) : O = G = W + 5, W + 4 <= O && C !== -1 ? y(_, C, W, $) : _.strategy === 4 || G === O ? (Y(_, 2 + ($ ? 1 : 0), 3), mt(_, D, d)) : (Y(_, 4 + ($ ? 1 : 0), 3), function(X, nt, st, it) {
+          return X.opt_len += 3 * (rt + 1) + 5 + 5 + 4, rt;
+        }(_), O = _.opt_len + 3 + 7 >>> 3, (G = _.static_len + 3 + 7 >>> 3) <= O && (O = G)) : O = G = W + 5, W + 4 <= O && C !== -1 ? y(_, C, W, $) : _.strategy === 4 || G === O ? (Y(_, 2 + ($ ? 1 : 0), 3), mt(_, R, d)) : (Y(_, 4 + ($ ? 1 : 0), 3), function(X, rt, st, it) {
           var ft;
-          for (Y(X, nt - 257, 5), Y(X, st - 1, 5), Y(X, it - 4, 4), ft = 0; ft < it; ft++)
-            Y(X, X.bl_tree[2 * T[ft] + 1], 3);
-          j(X, X.dyn_ltree, nt - 1), j(X, X.dyn_dtree, st - 1);
-        }(_, _.l_desc.max_code + 1, _.d_desc.max_code + 1, J + 1), mt(_, _.dyn_ltree, _.dyn_dtree)), Q(_), $ && rt(_);
+          for (Y(X, rt - 257, 5), Y(X, st - 1, 5), Y(X, it - 4, 4), ft = 0; ft < it; ft++)
+            Y(X, X.bl_tree[2 * B[ft] + 1], 3);
+          j(X, X.dyn_ltree, rt - 1), j(X, X.dyn_dtree, st - 1);
+        }(_, _.l_desc.max_code + 1, _.d_desc.max_code + 1, V + 1), mt(_, _.dyn_ltree, _.dyn_dtree)), Q(_), $ && et(_);
       }, g._tr_tally = function(_, C, W) {
-        return _.pending_buf[_.d_buf + 2 * _.last_lit] = C >>> 8 & 255, _.pending_buf[_.d_buf + 2 * _.last_lit + 1] = 255 & C, _.pending_buf[_.l_buf + _.last_lit] = 255 & W, _.last_lit++, C === 0 ? _.dyn_ltree[2 * W]++ : (_.matches++, C--, _.dyn_ltree[2 * (r[W] + p + 1)]++, _.dyn_dtree[2 * I(C)]++), _.last_lit === _.lit_bufsize - 1;
+        return _.pending_buf[_.d_buf + 2 * _.last_lit] = C >>> 8 & 255, _.pending_buf[_.d_buf + 2 * _.last_lit + 1] = 255 & C, _.pending_buf[_.l_buf + _.last_lit] = 255 & W, _.last_lit++, C === 0 ? _.dyn_ltree[2 * W]++ : (_.matches++, C--, _.dyn_ltree[2 * (r[W] + p + 1)]++, _.dyn_dtree[2 * E(C)]++), _.last_lit === _.lit_bufsize - 1;
       }, g._tr_align = function(_) {
-        Y(_, 2, 3), K(_, x, D), function(C) {
-          C.bi_valid === 16 ? (q(C, C.bi_buf), C.bi_buf = 0, C.bi_valid = 0) : 8 <= C.bi_valid && (C.pending_buf[C.pending++] = 255 & C.bi_buf, C.bi_buf >>= 8, C.bi_valid -= 8);
+        Y(_, 2, 3), K(_, x, R), function(C) {
+          C.bi_valid === 16 ? (J(C, C.bi_buf), C.bi_buf = 0, C.bi_valid = 0) : 8 <= C.bi_valid && (C.pending_buf[C.pending++] = 255 & C.bi_buf, C.bi_buf >>= 8, C.bi_valid -= 8);
         }(_);
       };
     }, { "../utils/common": 41 }], 53: [function(n, k, g) {
@@ -2832,76 +2832,76 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         (function(a, e) {
           if (!a.setImmediate) {
             var s, u, h, p, b = 1, o = {}, m = !1, i = a.document, f = Object.getPrototypeOf && Object.getPrototypeOf(a);
-            f = f && f.setTimeout ? f : a, s = {}.toString.call(a.process) === "[object process]" ? function(E) {
+            f = f && f.setTimeout ? f : a, s = {}.toString.call(a.process) === "[object process]" ? function(A) {
               process.nextTick(function() {
-                w(E);
+                w(A);
               });
             } : function() {
               if (a.postMessage && !a.importScripts) {
-                var E = !0, A = a.onmessage;
+                var A = !0, z = a.onmessage;
                 return a.onmessage = function() {
-                  E = !1;
-                }, a.postMessage("", "*"), a.onmessage = A, E;
+                  A = !1;
+                }, a.postMessage("", "*"), a.onmessage = z, A;
               }
-            }() ? (p = "setImmediate$" + Math.random() + "$", a.addEventListener ? a.addEventListener("message", x, !1) : a.attachEvent("onmessage", x), function(E) {
-              a.postMessage(p + E, "*");
-            }) : a.MessageChannel ? ((h = new MessageChannel()).port1.onmessage = function(E) {
-              w(E.data);
-            }, function(E) {
-              h.port2.postMessage(E);
-            }) : i && "onreadystatechange" in i.createElement("script") ? (u = i.documentElement, function(E) {
-              var A = i.createElement("script");
-              A.onreadystatechange = function() {
-                w(E), A.onreadystatechange = null, u.removeChild(A), A = null;
-              }, u.appendChild(A);
-            }) : function(E) {
-              setTimeout(w, 0, E);
-            }, f.setImmediate = function(E) {
-              typeof E != "function" && (E = new Function("" + E));
-              for (var A = new Array(arguments.length - 1), U = 0; U < A.length; U++)
-                A[U] = arguments[U + 1];
-              var N = { callback: E, args: A };
-              return o[b] = N, s(b), b++;
+            }() ? (p = "setImmediate$" + Math.random() + "$", a.addEventListener ? a.addEventListener("message", x, !1) : a.attachEvent("onmessage", x), function(A) {
+              a.postMessage(p + A, "*");
+            }) : a.MessageChannel ? ((h = new MessageChannel()).port1.onmessage = function(A) {
+              w(A.data);
+            }, function(A) {
+              h.port2.postMessage(A);
+            }) : i && "onreadystatechange" in i.createElement("script") ? (u = i.documentElement, function(A) {
+              var z = i.createElement("script");
+              z.onreadystatechange = function() {
+                w(A), z.onreadystatechange = null, u.removeChild(z), z = null;
+              }, u.appendChild(z);
+            }) : function(A) {
+              setTimeout(w, 0, A);
+            }, f.setImmediate = function(A) {
+              typeof A != "function" && (A = new Function("" + A));
+              for (var z = new Array(arguments.length - 1), M = 0; M < z.length; M++)
+                z[M] = arguments[M + 1];
+              var D = { callback: A, args: z };
+              return o[b] = D, s(b), b++;
             }, f.clearImmediate = c;
           }
-          function c(E) {
-            delete o[E];
+          function c(A) {
+            delete o[A];
           }
-          function w(E) {
+          function w(A) {
             if (m)
-              setTimeout(w, 0, E);
+              setTimeout(w, 0, A);
             else {
-              var A = o[E];
-              if (A) {
+              var z = o[A];
+              if (z) {
                 m = !0;
                 try {
-                  (function(U) {
-                    var N = U.callback, Z = U.args;
-                    switch (Z.length) {
+                  (function(M) {
+                    var D = M.callback, H = M.args;
+                    switch (H.length) {
                       case 0:
-                        N();
+                        D();
                         break;
                       case 1:
-                        N(Z[0]);
+                        D(H[0]);
                         break;
                       case 2:
-                        N(Z[0], Z[1]);
+                        D(H[0], H[1]);
                         break;
                       case 3:
-                        N(Z[0], Z[1], Z[2]);
+                        D(H[0], H[1], H[2]);
                         break;
                       default:
-                        N.apply(e, Z);
+                        D.apply(e, H);
                     }
-                  })(A);
+                  })(z);
                 } finally {
-                  c(E), m = !1;
+                  c(A), m = !1;
                 }
               }
             }
           }
-          function x(E) {
-            E.source === a && typeof E.data == "string" && E.data.indexOf(p) === 0 && w(+E.data.slice(p.length));
+          function x(A) {
+            A.source === a && typeof A.data == "string" && A.data.indexOf(p) === 0 && w(+A.data.slice(p.length));
           }
         })(typeof self > "u" ? l === void 0 ? this : l : self);
       }).call(this, typeof At < "u" ? At : typeof self < "u" ? self : typeof window < "u" ? window : {});
@@ -2910,13 +2910,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
 })(te);
 var be = te.exports;
 const ye = /* @__PURE__ */ _e(be), Ht = 914400, Tt = "data:image/svg+xml,%3Csvg%20xmlns=%22http://www.w3.org/2000/svg%22%20width=%221%22%20height=%221%22/%3E";
-function ee(S, M, n = 5) {
+function ee(S, L, n = 5) {
   return n < 0 ? [] : Jt.readdirSync(S, { withFileTypes: !0 }).sort((g, l) => g.name.localeCompare(l.name)).flatMap((g) => {
     const l = Mt.join(S, g.name);
-    return g.isFile() ? g.name === M ? [l] : [] : g.isDirectory() ? ee(l, M, n - 1) : [];
+    return g.isFile() ? g.name === L ? [l] : [] : g.isDirectory() ? ee(l, L, n - 1) : [];
   });
 }
-async function Nt(S, M, n) {
+async function Nt(S, L, n) {
   await S.evaluate(({ kind: k, index: g, src: l, replacement: a, placeholder: e }) => {
     var s;
     if (k === "img") {
@@ -2933,9 +2933,9 @@ async function Nt(S, M, n) {
       const u = document.querySelector('[data-html2pptx-background="' + g + '"]');
       u.style.backgroundImage = getComputedStyle(u).backgroundImage.replace(l, a);
     }
-  }, { ...M, replacement: n, placeholder: n === Tt });
+  }, { ...L, replacement: n, placeholder: n === Tt });
 }
-async function we(S, M) {
+async function we(S, L) {
   var a;
   const n = [], k = /* @__PURE__ */ new Map(), g = await S.evaluate(() => {
     const e = [...document.images].map((u, h) => (u.dataset.html2pptxImage = String(h), { kind: "img", index: h, src: u.currentSrc || u.src })), s = [];
@@ -2962,7 +2962,7 @@ async function we(S, M) {
     }
     if (Jt.existsSync(s))
       continue;
-    const u = Mt.basename(s), h = M ? ee(M, u) : [];
+    const u = Mt.basename(s), h = L ? ee(L, u) : [];
     h.length !== 1 && n.push({ src: e.src, reason: h.length ? "ambiguous" : "not_found" });
     const p = h.length === 1 ? Yt(h[0]).href : Tt;
     h.length === 1 && k.set(p, e.src), await Nt(S, e, p);
@@ -2989,9 +2989,9 @@ async function we(S, M) {
 function ve() {
   const S = document.createElement("style");
   S.textContent = "[data-html2pptx-hide-before]::before, [data-html2pptx-hide-after]::after { content: none !important }", document.head.appendChild(S);
-  for (const M of [...document.querySelectorAll("*")])
+  for (const L of [...document.querySelectorAll("*")])
     for (const n of ["before", "after"]) {
-      const k = getComputedStyle(M, "::" + n), g = parseFloat(k.width), l = parseFloat(k.height);
+      const k = getComputedStyle(L, "::" + n), g = parseFloat(k.width), l = parseFloat(k.height);
       if (k.content === "none" || k.content === "normal")
         continue;
       let a = "";
@@ -3009,320 +3009,320 @@ function ve() {
         const p = k[h];
         p.startsWith("animation") || p.startsWith("transition") || u.style.setProperty(p, k.getPropertyValue(p));
       }
-      u.style.content = "normal", u.textContent = a, u.setAttribute("aria-hidden", "true"), M.setAttribute("data-html2pptx-hide-" + n, ""), n === "before" ? M.prepend(u) : M.append(u);
+      u.style.content = "normal", u.textContent = a, u.setAttribute("aria-hidden", "true"), L.setAttribute("data-html2pptx-hide-" + n, ""), n === "before" ? L.prepend(u) : L.append(u);
     }
 }
 function Gt(S) {
-  const M = document.querySelector(S) || document.body, n = M.getBoundingClientRect(), k = M === document.body ? {
+  const L = document.querySelector(S) || document.body, n = L.getBoundingClientRect(), k = L === document.body ? {
     left: n.left,
     top: n.top,
     width: Math.max(n.width, document.body.scrollWidth, window.innerWidth),
     height: Math.max(n.height, document.body.scrollHeight, window.innerHeight)
   } : n, g = [];
   let l = 0;
-  const a = (v) => parseFloat(v) || 0, e = (v, T = 1) => {
-    const D = String(v || "").match(/rgba?\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)(?:\s*,\s*([\d.]+))?/i);
-    return D ? {
-      hex: D.slice(1, 4).map((d) => Number(d).toString(16).padStart(2, "0")).join("").toUpperCase(),
-      alpha: (D[4] === void 0 ? 1 : Number(D[4])) * T
+  const a = (v) => parseFloat(v) || 0, e = (v, B = 1) => {
+    const R = String(v || "").match(/rgba?\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)(?:\s*,\s*([\d.]+))?/i);
+    return R ? {
+      hex: R.slice(1, 4).map((d) => Number(d).toString(16).padStart(2, "0")).join("").toUpperCase(),
+      alpha: (R[4] === void 0 ? 1 : Number(R[4])) * B
     } : null;
-  }, s = (v, T = 1) => {
-    const D = e(v, T);
-    return D && D.alpha > 0 ? D : null;
+  }, s = (v, B = 1) => {
+    const R = e(v, B);
+    return R && R.alpha > 0 ? R : null;
   }, u = (v) => {
-    let T = 1;
-    for (let D = v; D; D = D.parentElement) {
-      const d = Number(getComputedStyle(D).opacity);
-      if (Number.isFinite(d) && (T *= d), D === M)
+    let B = 1;
+    for (let R = v; R; R = R.parentElement) {
+      const d = Number(getComputedStyle(R).opacity);
+      if (Number.isFinite(d) && (B *= d), R === L)
         break;
     }
-    return T;
-  }, h = (v, T, D = 1) => {
+    return B;
+  }, h = (v, B, R = 1) => {
     if (!v.startsWith("linear-gradient(") || !v.endsWith(")"))
       return null;
     const d = [];
-    let z = 0, r = 0;
+    let I = 0, r = 0;
     const P = v.slice(16, -1);
-    for (let H = 0; H < P.length; H++)
-      P[H] === "(" ? z++ : P[H] === ")" ? z-- : P[H] === "," && z === 0 && (d.push(P.slice(r, H).trim()), r = H + 1);
+    for (let Z = 0; Z < P.length; Z++)
+      P[Z] === "(" ? I++ : P[Z] === ")" ? I-- : P[Z] === "," && I === 0 && (d.push(P.slice(r, Z).trim()), r = Z + 1);
     d.push(P.slice(r).trim());
-    let V = 180;
+    let q = 180;
     if (/^-?[\d.]+deg$/.test(d[0]))
-      V = parseFloat(d.shift());
+      q = parseFloat(d.shift());
     else if (/^to (right|bottom|left|top)$/.test(d[0]))
-      V = { right: 90, bottom: 180, left: 270, top: 0 }[d.shift().slice(3)];
+      q = { right: 90, bottom: 180, left: 270, top: 0 }[d.shift().slice(3)];
     else if (d[0].startsWith("to "))
       return null;
-    const F = V * Math.PI / 180, tt = Math.abs(T.w * Math.sin(F)) + Math.abs(T.h * Math.cos(F)), L = d.map((H) => {
-      const B = H.match(/^(rgba?\([^)]+\)|#[0-9a-f]{3,8}|transparent)(?:\s+(-?[\d.]+)(%|px))?$/i);
-      if (!B)
+    const U = q * Math.PI / 180, nt = Math.abs(B.w * Math.sin(U)) + Math.abs(B.h * Math.cos(U)), F = d.map((Z) => {
+      const T = Z.match(/^(rgba?\([^)]+\)|#[0-9a-f]{3,8}|transparent)(?:\s+(-?[\d.]+)(%|px))?$/i);
+      if (!T)
         return null;
-      let I = e(B[1], D);
-      if (B[1].toLowerCase() === "transparent")
-        I = { hex: "000000", alpha: 0 };
-      else if (B[1][0] === "#") {
-        const q = B[1].slice(1);
-        I = {
-          hex: (q.length <= 4 ? [...q.slice(0, 3)].map((Y) => Y + Y).join("") : q.slice(0, 6)).toUpperCase(),
-          alpha: (q.length === 4 ? parseInt(q[3] + q[3], 16) / 255 : q.length === 8 ? parseInt(q.slice(-2), 16) / 255 : 1) * D
+      let E = e(T[1], R);
+      if (T[1].toLowerCase() === "transparent")
+        E = { hex: "000000", alpha: 0 };
+      else if (T[1][0] === "#") {
+        const J = T[1].slice(1);
+        E = {
+          hex: (J.length <= 4 ? [...J.slice(0, 3)].map((Y) => Y + Y).join("") : J.slice(0, 6)).toUpperCase(),
+          alpha: (J.length === 4 ? parseInt(J[3] + J[3], 16) / 255 : J.length === 8 ? parseInt(J.slice(-2), 16) / 255 : 1) * R
         };
       }
-      return I ? { ...I, position: B[2] === void 0 ? null : Number(B[2]) * (B[3] === "%" ? 0.01 : 1 / tt) } : null;
+      return E ? { ...E, position: T[2] === void 0 ? null : Number(T[2]) * (T[3] === "%" ? 0.01 : 1 / nt) } : null;
     });
-    if (L.length < 2 || L.some((H) => !H))
+    if (F.length < 2 || F.some((Z) => !Z))
       return null;
-    L[0].position === null && (L[0].position = 0), L.at(-1).position === null && (L.at(-1).position = 1);
-    for (let H = 1; H < L.length; H++)
-      if (L[H].position !== null)
-        L[H].position = Math.max(L[H].position, L[H - 1].position);
+    F[0].position === null && (F[0].position = 0), F.at(-1).position === null && (F.at(-1).position = 1);
+    for (let Z = 1; Z < F.length; Z++)
+      if (F[Z].position !== null)
+        F[Z].position = Math.max(F[Z].position, F[Z - 1].position);
       else {
-        let B = H + 1;
-        for (; L[B].position === null; )
-          B++;
-        const I = (Math.max(L[B].position, L[H - 1].position) - L[H - 1].position) / (B - H + 1);
-        for (let q = H; q < B; q++)
-          L[q].position = L[H - 1].position + I * (q - H + 1);
-      }
-    return { angle: V, stops: L };
+        let T = Z + 1;
+        for (; F[T].position === null; )
+          T++;
+        const E = (Math.max(F[T].position, F[Z - 1].position) - F[Z - 1].position) / (T - Z + 1);
+        for (let J = Z; J < T; J++)
+          F[J].position = F[Z - 1].position + E * (J - Z + 1);
+      }
+    return { angle: q, stops: F };
   }, p = (v) => {
-    const T = v.getBoundingClientRect();
-    return { x: T.left - k.left, y: T.top - k.top, w: T.width, h: T.height };
-  }, b = (v, T) => ["TopLeft", "TopRight", "BottomRight", "BottomLeft"].map((D, d) => {
-    const z = v[`border${D}Radius`];
-    return z.includes("%") ? Math.min(T.w, T.h) * a(z) / 100 : a(z);
-  }), o = (v, T) => {
-    const D = e(v.webkitTextFillColor || v.color);
-    if ((D == null ? void 0 : D.alpha) === 0 && (v.backgroundClip === "text" || v.webkitBackgroundClip === "text")) {
-      const z = v.backgroundImage.match(/#[0-9a-fA-F]{3,8}|rgba?\([^)]+\)/g);
-      if (z && z.length) {
-        const r = z[Math.floor(z.length / 2)];
+    const B = v.getBoundingClientRect();
+    return { x: B.left - k.left, y: B.top - k.top, w: B.width, h: B.height };
+  }, b = (v, B) => ["TopLeft", "TopRight", "BottomRight", "BottomLeft"].map((R, d) => {
+    const I = v[`border${R}Radius`];
+    return I.includes("%") ? Math.min(B.w, B.h) * a(I) / 100 : a(I);
+  }), o = (v, B) => {
+    const R = e(v.webkitTextFillColor || v.color);
+    if ((R == null ? void 0 : R.alpha) === 0 && (v.backgroundClip === "text" || v.webkitBackgroundClip === "text")) {
+      const I = v.backgroundImage.match(/#[0-9a-fA-F]{3,8}|rgba?\([^)]+\)/g);
+      if (I && I.length) {
+        const r = I[Math.floor(I.length / 2)];
         if (r.startsWith("#")) {
           const P = r.slice(1);
-          return { hex: P.length === 3 ? P.split("").map((V) => V + V).join("").toUpperCase() : P.slice(0, 6).toUpperCase(), alpha: T };
+          return { hex: P.length === 3 ? P.split("").map((q) => q + q).join("").toUpperCase() : P.slice(0, 6).toUpperCase(), alpha: B };
         }
-        return s(r, T);
+        return s(r, B);
       }
     }
-    const d = s(v.color, T);
+    const d = s(v.color, B);
     return d || { hex: "000000", alpha: 1 };
-  }, m = (v, T, D) => {
+  }, m = (v, B, R) => {
     var ot;
-    let d = D, z = 0;
-    const r = (ot = T.transform.match(/^matrix\(([^)]+)\)$/)) == null ? void 0 : ot[1].split(",").map(Number);
-    (r == null ? void 0 : r.length) === 6 && Math.abs(Math.hypot(r[0], r[1]) - 1) < 0.01 && Math.abs(Math.hypot(r[2], r[3]) - 1) < 0.01 && (z = Math.atan2(r[1], r[0]) * 180 / Math.PI, Math.abs(z) > 0.1 && (d = {
-      x: D.x + (D.w - v.offsetWidth) / 2,
-      y: D.y + (D.h - v.offsetHeight) / 2,
+    let d = R, I = 0;
+    const r = (ot = B.transform.match(/^matrix\(([^)]+)\)$/)) == null ? void 0 : ot[1].split(",").map(Number);
+    (r == null ? void 0 : r.length) === 6 && Math.abs(Math.hypot(r[0], r[1]) - 1) < 0.01 && Math.abs(Math.hypot(r[2], r[3]) - 1) < 0.01 && (I = Math.atan2(r[1], r[0]) * 180 / Math.PI, Math.abs(I) > 0.1 && (d = {
+      x: R.x + (R.w - v.offsetWidth) / 2,
+      y: R.y + (R.h - v.offsetHeight) / 2,
       w: v.offsetWidth,
       h: v.offsetHeight
     }));
-    const P = u(v), V = s(T.backgroundColor, P), F = ["Top", "Right", "Bottom", "Left"].map((et) => ({
-      width: a(T[`border${et}Width`]),
-      color: s(T[`border${et}Color`], P),
-      style: T[`border${et}Style`]
-    })), tt = F.some((et) => et.width && et.color), L = b(T, d), H = [...L];
-    for (let et = v.parentElement; et && et !== M; et = et.parentElement) {
-      const Q = getComputedStyle(et);
+    const P = u(v), q = s(B.backgroundColor, P), U = ["Top", "Right", "Bottom", "Left"].map((tt) => ({
+      width: a(B[`border${tt}Width`]),
+      color: s(B[`border${tt}Color`], P),
+      style: B[`border${tt}Style`]
+    })), nt = U.some((tt) => tt.width && tt.color), F = b(B, d), Z = [...F];
+    for (let tt = v.parentElement; tt && tt !== L; tt = tt.parentElement) {
+      const Q = getComputedStyle(tt);
       if (Q.overflow !== "hidden")
         continue;
-      const rt = et.getBoundingClientRect(), at = v.getBoundingClientRect(), lt = b(Q, p(et));
+      const et = tt.getBoundingClientRect(), at = v.getBoundingClientRect(), lt = b(Q, p(tt));
       [
-        Math.abs(at.left - rt.left) < 3 && Math.abs(at.top - rt.top) < 3,
-        Math.abs(at.right - rt.right) < 3 && Math.abs(at.top - rt.top) < 3,
-        Math.abs(at.right - rt.right) < 3 && Math.abs(at.bottom - rt.bottom) < 3,
-        Math.abs(at.left - rt.left) < 3 && Math.abs(at.bottom - rt.bottom) < 3
+        Math.abs(at.left - et.left) < 3 && Math.abs(at.top - et.top) < 3,
+        Math.abs(at.right - et.right) < 3 && Math.abs(at.top - et.top) < 3,
+        Math.abs(at.right - et.right) < 3 && Math.abs(at.bottom - et.bottom) < 3,
+        Math.abs(at.left - et.left) < 3 && Math.abs(at.bottom - et.bottom) < 3
       ].forEach((ut, t) => {
-        ut && (L[t] = Math.max(L[t], lt[t]));
+        ut && (F[t] = Math.max(F[t], lt[t]));
       });
     }
-    const B = T.clipPath.match(/^polygon\((.*)\)$/), I = F.map((et, Q) => ({ ...et, index: Q })).filter((et) => et.width && et.color);
-    if (v.clientWidth === 0 && v.clientHeight === 0 && !v.textContent.trim() && I.length === 1) {
-      const et = I[0], Q = [
+    const T = B.clipPath.match(/^polygon\((.*)\)$/), E = U.map((tt, Q) => ({ ...tt, index: Q })).filter((tt) => tt.width && tt.color);
+    if (v.clientWidth === 0 && v.clientHeight === 0 && !v.textContent.trim() && E.length === 1) {
+      const tt = E[0], Q = [
         [[0, 0], [d.w, 0], [d.w / 2, d.h]],
         [[d.w, 0], [d.w, d.h], [0, d.h / 2]],
         [[d.w / 2, 0], [d.w, d.h], [0, d.h]],
         [[0, 0], [d.w, d.h / 2], [0, d.h]]
-      ][et.index];
-      g.push({ type: "polygon", points: Q, fill: et.color, ...d });
+      ][tt.index];
+      g.push({ type: "polygon", points: Q, fill: tt.color, ...d });
       return;
     }
-    if (T.display === "inline" && !V && T.backgroundImage === "none" && I.length && I.every((et) => et.index === 0 || et.index === 2) && L.every((et) => et === 0)) {
-      const et = [...v.getClientRects()].filter((Q) => Q.width > 0 && Q.height > 0);
-      if (et.length > 1 || I.some((Q) => Q.style === "dashed" || Q.style === "dotted")) {
-        for (const Q of et)
-          for (const rt of I)
+    if (B.display === "inline" && !q && B.backgroundImage === "none" && E.length && E.every((tt) => tt.index === 0 || tt.index === 2) && F.every((tt) => tt === 0)) {
+      const tt = [...v.getClientRects()].filter((Q) => Q.width > 0 && Q.height > 0);
+      if (tt.length > 1 || E.some((Q) => Q.style === "dashed" || Q.style === "dotted")) {
+        for (const Q of tt)
+          for (const et of E)
             g.push({
               type: "line",
               x: Q.left - k.left,
-              y: (rt.index === 0 ? Q.top : Q.bottom - rt.width) - k.top,
+              y: (et.index === 0 ? Q.top : Q.bottom - et.width) - k.top,
               w: Q.width,
-              h: rt.width,
-              color: rt.color,
-              dashType: rt.style === "dashed" ? "dash" : rt.style === "dotted" ? "sysDot" : "solid"
+              h: et.width,
+              color: et.color,
+              dashType: et.style === "dashed" ? "dash" : et.style === "dotted" ? "sysDot" : "solid"
             });
         return;
       }
     }
-    const q = d.w >= 8 && d.h <= 3 || d.h >= 8 && d.w <= 3, Y = q ? h(T.backgroundImage, d, P) : null;
-    if (q && (Y || T.backgroundImage === "none" && V)) {
-      g.push({ type: "line", ...d, color: V, gradient: Y, rotate: z });
+    const J = d.w >= 8 && d.h <= 3 || d.h >= 8 && d.w <= 3, Y = J ? h(B.backgroundImage, d, P) : null;
+    if (J && (Y || B.backgroundImage === "none" && q)) {
+      g.push({ type: "line", ...d, color: q, gradient: Y, rotate: I });
       return;
     }
-    if (T.backgroundImage !== "none" && T.backgroundClip !== "text" && T.webkitBackgroundClip !== "text") {
-      const et = ++l;
-      v.setAttribute("data-html2pptx-capture", String(et)), g.push({
+    if (B.backgroundImage !== "none" && B.backgroundClip !== "text" && B.webkitBackgroundClip !== "text") {
+      const tt = ++l;
+      v.setAttribute("data-html2pptx-capture", String(tt)), g.push({
         type: "capture-background",
-        id: et,
-        rotate: z,
+        id: tt,
+        rotate: I,
         ...d,
-        clipRadii: L.map((Q, rt) => Q > H[rt] ? Q : null)
+        clipRadii: F.map((Q, et) => Q > Z[et] ? Q : null)
       });
       return;
     }
-    if (!V && !tt)
+    if (!q && !nt)
       return;
-    if (B) {
-      const et = B[1].replace(/^(evenodd|nonzero),\s*/, "").split(",").map((Q) => Q.trim().split(/\s+/).map((rt, at) => rt.endsWith("%") ? a(rt) * (at ? d.h : d.w) / 100 : a(rt)));
-      if (et.length >= 3 && et.every((Q) => Q.length === 2 && Q.every(Number.isFinite))) {
-        g.push({ type: "polygon", points: et, fill: V, ...d });
+    if (T) {
+      const tt = T[1].replace(/^(evenodd|nonzero),\s*/, "").split(",").map((Q) => Q.trim().split(/\s+/).map((et, at) => et.endsWith("%") ? a(et) * (at ? d.h : d.w) / 100 : a(et)));
+      if (tt.length >= 3 && tt.every((Q) => Q.length === 2 && Q.every(Number.isFinite))) {
+        g.push({ type: "polygon", points: tt, fill: q, ...d });
         return;
       }
     }
-    const K = F.every((et) => {
-      var Q, rt;
-      return Math.abs(et.width - F[0].width) < 0.1 && (((Q = et.color) == null ? void 0 : Q.hex) || "") === (((rt = F[0].color) == null ? void 0 : rt.hex) || "") && et.style === F[0].style;
+    const K = U.every((tt) => {
+      var Q, et;
+      return Math.abs(tt.width - U[0].width) < 0.1 && (((Q = tt.color) == null ? void 0 : Q.hex) || "") === (((et = U[0].color) == null ? void 0 : et.hex) || "") && tt.style === U[0].style;
     });
     g.push({
       type: "shape",
       ...d,
-      fill: V,
-      border: K ? F[0] : null,
-      radius: Math.max(...L),
-      radii: L,
-      rotate: z,
-      shadow: T.boxShadow
-    }), K || F.forEach((et, Q) => {
-      et.width && et.color && g.push({
+      fill: q,
+      border: K ? U[0] : null,
+      radius: Math.max(...F),
+      radii: F,
+      rotate: I,
+      shadow: B.boxShadow
+    }), K || U.forEach((tt, Q) => {
+      tt.width && tt.color && g.push({
         type: "border-strip",
         ...d,
         side: Q,
-        rotate: z,
-        widths: F.map((rt) => rt.width),
-        color: et.color,
-        radii: L
+        rotate: I,
+        widths: U.map((et) => et.width),
+        color: tt.color,
+        radii: F
       });
     });
-  }, i = /* @__PURE__ */ new Map(), f = (v) => (v.match(/(?:[^,"']+|"[^"]*"|'[^']*')+/g) || []).map((T) => T.trim().replace(/^['"]|['"]$/g, "")).filter(Boolean), c = (v, T) => {
-    const D = `${v}\0${T}`;
-    if (i.has(D))
-      return i.get(D);
+  }, i = /* @__PURE__ */ new Map(), f = (v) => (v.match(/(?:[^,"']+|"[^"]*"|'[^']*')+/g) || []).map((B) => B.trim().replace(/^['"]|['"]$/g, "")).filter(Boolean), c = (v, B) => {
+    const R = `${v}\0${B}`;
+    if (i.has(R))
+      return i.get(R);
     const d = document.createElement("canvas").getContext("2d");
     d.font = "72px monospace";
-    const z = d.measureText(T);
+    const I = d.measureText(B);
     d.font = `72px "${v.replace(/"/g, '\\"')}", monospace`;
-    const r = d.measureText(T), V = [
+    const r = d.measureText(B), q = [
       "width",
       "actualBoundingBoxLeft",
       "actualBoundingBoxRight",
       "actualBoundingBoxAscent",
       "actualBoundingBoxDescent"
-    ].some((F) => Math.abs((r[F] || 0) - (z[F] || 0)) > 0.01);
-    return i.set(D, V), V;
-  }, w = (v, T) => {
-    const D = f(v.fontFamily), d = D[0] || "Arial";
-    if (!D.includes("serif") || c(d, T))
+    ].some((U) => Math.abs((r[U] || 0) - (I[U] || 0)) > 0.01);
+    return i.set(R, q), q;
+  }, w = (v, B) => {
+    const R = f(v.fontFamily), d = R[0] || "Arial";
+    if (!R.includes("serif") || c(d, B))
       return d;
-    for (const z of D.slice(1)) {
-      if (z === "serif")
-        return /[^\u0000-\u024f]/u.test(T) ? /Mac/i.test(navigator.platform) ? "Songti SC" : /Win/i.test(navigator.platform) ? "SimSun" : "Noto Serif CJK SC" : "Times New Roman";
-      if (c(z, T))
-        return z;
+    for (const I of R.slice(1)) {
+      if (I === "serif")
+        return /[^\u0000-\u024f]/u.test(B) ? /Mac/i.test(navigator.platform) ? "Songti SC" : /Win/i.test(navigator.platform) ? "SimSun" : "Noto Serif CJK SC" : "Times New Roman";
+      if (c(I, B))
+        return I;
     }
     return d;
-  }, x = (v, T) => {
-    const D = [];
-    for (const d of T) {
-      const z = /\s/u.test(d) && D.length ? D.at(-1).fontFace : w(v, d), r = D.at(-1);
-      (r == null ? void 0 : r.fontFace) === z ? r.text += d : D.push({ text: d, fontFace: z });
+  }, x = (v, B) => {
+    const R = [];
+    for (const d of B) {
+      const I = /\s/u.test(d) && R.length ? R.at(-1).fontFace : w(v, d), r = R.at(-1);
+      (r == null ? void 0 : r.fontFace) === I ? r.text += d : R.push({ text: d, fontFace: I });
     }
-    return D;
-  }, E = (v, T) => {
+    return R;
+  }, A = (v, B) => {
     if (!v.textContent.trim())
       return;
-    const D = getComputedStyle(T), d = v.textContent, z = document.createRange(), r = [];
+    const R = getComputedStyle(B), d = v.textContent, I = document.createRange(), r = [];
     for (let F = 0; F < d.length; F++) {
-      z.setStart(v, F), z.setEnd(v, F + 1);
-      const tt = z.getBoundingClientRect();
-      if (tt.width < 0.2 || tt.height < 0.2)
+      I.setStart(v, F), I.setEnd(v, F + 1);
+      const Z = I.getBoundingClientRect();
+      if (Z.width < 0.2 || Z.height < 0.2)
         continue;
-      const L = /\s/.test(d[F]) && !D.whiteSpace.startsWith("pre") ? " " : d[F];
-      let H = r[r.length - 1];
-      L === " " && (!H || !H.text) || ((!H || Math.abs(H.y - tt.top) > 3) && (H = { text: "", x: tt.left, y: tt.top, right: tt.right, h: tt.height }, r.push(H)), (L !== " " || H.text && !H.text.endsWith(" ")) && (H.text += L), H.right = tt.right, H.h = Math.max(H.h, tt.height));
+      const T = /\s/.test(d[F]) && !R.whiteSpace.startsWith("pre") ? " " : d[F];
+      let E = r[r.length - 1];
+      T === " " && (!E || !E.text) || ((!E || Math.abs(E.y - Z.top) > 3) && (E = { text: "", x: Z.left, y: Z.top, right: Z.right, h: Z.height }, r.push(E)), (T !== " " || E.text && !E.text.endsWith(" ")) && (E.text += T), E.right = Z.right, E.h = Math.max(E.h, Z.height));
     }
-    const P = o(D, u(T)), V = (() => {
-      for (let F = T; F && F !== M; F = F.parentElement) {
-        const tt = getComputedStyle(F);
-        if (!(!tt.display.includes("flex") || (tt.flexDirection.startsWith("column") ? tt.justifyContent : tt.alignItems) !== "center") && F.innerText.trim() === d.trim())
+    const P = o(R, u(B)), q = p(B), U = r.length === 1 && B.childNodes.length === 1 && s(R.backgroundColor) && a(R.paddingTop) > 0 && Math.abs(a(R.paddingTop) - a(R.paddingBottom)) < 0.1 && Math.abs(r[0].y - k.top + r[0].h / 2 - q.y - q.h / 2) < 2, nt = (() => {
+      for (let F = B; F && F !== L; F = F.parentElement) {
+        const Z = getComputedStyle(F);
+        if (!(!Z.display.includes("flex") || (Z.flexDirection.startsWith("column") ? Z.justifyContent : Z.alignItems) !== "center") && F.innerText.trim() === d.trim())
           return p(F).y + p(F).h / 2;
       }
       return null;
     })();
     for (const F of r) {
-      const tt = F.text.trim();
-      if (!tt)
+      const Z = F.text.trim(), T = R.textTransform === "uppercase" ? Z.toUpperCase() : R.textTransform === "lowercase" ? Z.toLowerCase() : Z;
+      if (!T)
         continue;
-      const L = x(D, tt);
+      const E = x(R, T);
       g.push({
         type: "rendered-text",
-        text: tt,
+        text: T,
         x: F.x - k.left,
-        y: F.y - k.top,
+        y: U ? q.y : F.y - k.top,
         w: F.right - F.x,
-        h: F.h,
-        fontSize: a(D.fontSize),
-        fontFace: L[0].fontFace,
-        runs: L,
+        h: U ? q.h : F.h,
+        fontSize: a(R.fontSize),
+        fontFace: E[0].fontFace,
+        runs: E,
         color: P,
-        bold: parseInt(D.fontWeight, 10) >= 600 || D.fontWeight === "bold",
-        italic: D.fontStyle === "italic",
-        underline: D.textDecorationLine.includes("underline"),
-        strike: D.textDecorationLine.includes("line-through"),
-        letterSpacing: D.letterSpacing === "normal" ? 0 : a(D.letterSpacing),
-        centerY: r.length === 1 ? V : null,
-        align: D.textAlign
+        bold: parseInt(R.fontWeight, 10) >= 600 || R.fontWeight === "bold",
+        italic: R.fontStyle === "italic",
+        underline: R.textDecorationLine.includes("underline"),
+        strike: R.textDecorationLine.includes("line-through"),
+        letterSpacing: R.letterSpacing === "normal" ? 0 : a(R.letterSpacing),
+        centerY: !U && r.length === 1 ? nt : null,
+        align: R.textAlign
       });
     }
-  }, A = (v) => v.childNodes.length !== 1 || v.firstChild.nodeType !== Node.TEXT_NODE ? !1 : ["✓", "✔"].includes(v.textContent.trim()), U = (v) => {
-    const T = getComputedStyle(v);
-    if (T.display === "none" || T.visibility === "hidden" || a(T.opacity) === 0)
+  }, z = (v) => v.childNodes.length !== 1 || v.firstChild.nodeType !== Node.TEXT_NODE ? !1 : ["✓", "✔"].includes(v.textContent.trim()), M = (v) => {
+    const B = getComputedStyle(v);
+    if (B.display === "none" || B.visibility === "hidden" || a(B.opacity) === 0)
       return;
-    const D = p(v), d = v.tagName.toLowerCase();
+    const R = p(v), d = v.tagName.toLowerCase();
     if (d === "img" || d === "svg" || d === "canvas") {
-      if (D.w > 0 && D.h > 0) {
-        const z = ++l;
-        v.setAttribute("data-html2pptx-capture", String(z)), g.push({ type: "capture-element", id: z, ...D });
+      if (R.w > 0 && R.h > 0) {
+        const I = ++l;
+        v.setAttribute("data-html2pptx-capture", String(I)), g.push({ type: "capture-element", id: I, ...R });
       }
       return;
     }
-    if (D.w > 0 && D.h > 0 && A(v)) {
-      const z = ++l;
-      v.setAttribute("data-html2pptx-capture", String(z)), g.push({ type: "capture-element", id: z, ...D });
+    if (R.w > 0 && R.h > 0 && z(v)) {
+      const I = ++l;
+      v.setAttribute("data-html2pptx-capture", String(I)), g.push({ type: "capture-element", id: I, ...R });
       return;
     }
-    D.w > 0 && D.h > 0 && m(v, T, D);
-    for (const z of v.childNodes)
-      z.nodeType === Node.TEXT_NODE ? E(z, v) : z.nodeType === Node.ELEMENT_NODE && U(z);
-  }, N = getComputedStyle(M), Z = s(N.backgroundColor, u(M)) || s(getComputedStyle(document.body).backgroundColor, u(document.body));
-  m(M, N, { x: 0, y: 0, w: k.width, h: k.height });
-  for (const v of M.childNodes)
-    v.nodeType === Node.TEXT_NODE ? E(v, M) : v.nodeType === Node.ELEMENT_NODE && U(v);
-  for (const v of g.filter((T) => T.type === "rendered-text" && /^\d{1,3}$/.test(T.text))) {
-    const T = g.find((D) => D.type === "shape" && D.radius >= Math.min(D.w, D.h) * 0.45 && Math.abs(D.x + D.w / 2 - v.x - v.w / 2) < D.w * 0.12 && Math.abs(D.y + D.h / 2 - v.y - v.h / 2) < D.h * 0.12);
-    T && (v.centerY = T.y + T.h / 2);
+    R.w > 0 && R.h > 0 && m(v, B, R);
+    for (const I of v.childNodes)
+      I.nodeType === Node.TEXT_NODE ? A(I, v) : I.nodeType === Node.ELEMENT_NODE && M(I);
+  }, D = getComputedStyle(L), H = s(D.backgroundColor, u(L)) || s(getComputedStyle(document.body).backgroundColor, u(document.body));
+  m(L, D, { x: 0, y: 0, w: k.width, h: k.height });
+  for (const v of L.childNodes)
+    v.nodeType === Node.TEXT_NODE ? A(v, L) : v.nodeType === Node.ELEMENT_NODE && M(v);
+  for (const v of g.filter((B) => B.type === "rendered-text" && /^\d{1,3}$/.test(B.text))) {
+    const B = g.find((R) => R.type === "shape" && R.radius >= Math.min(R.w, R.h) * 0.45 && Math.abs(R.x + R.w / 2 - v.x - v.w / 2) < R.w * 0.12 && Math.abs(R.y + R.h / 2 - v.y - v.h / 2) < R.h * 0.12);
+    B && (v.centerY = B.y + B.h / 2);
   }
-  return { elements: g, background: Z, width: k.width, height: k.height };
+  return { elements: g, background: H, width: k.width, height: k.height };
 }
-function ke(S, M, n, k, g) {
-  const [l, a, e, s] = n.map((p) => Math.max(0, Math.min(p, S / 2, M / 2))), u = 0.5522847498, h = (p, b, o) => ({
+function ke(S, L, n, k, g) {
+  const [l, a, e, s] = n.map((p) => Math.max(0, Math.min(p, S / 2, L / 2))), u = 0.5522847498, h = (p, b, o) => ({
     x: p * k,
     y: b * g,
     ...o ? { curve: {
@@ -3337,16 +3337,16 @@ function ke(S, M, n, k, g) {
     h(l, 0),
     h(S - a, 0),
     h(S, a, [S - a + a * u, 0, S, a - a * u]),
-    h(S, M - e),
-    h(S - e, M, [S, M - e + e * u, S - e + e * u, M]),
-    h(s, M),
-    h(0, M - s, [s - s * u, M, 0, M - s + s * u]),
+    h(S, L - e),
+    h(S - e, L, [S, L - e + e * u, S - e + e * u, L]),
+    h(s, L),
+    h(0, L - s, [s - s * u, L, 0, L - s + s * u]),
     h(0, l),
     h(l, 0, [0, l - l * u, l - l * u, 0]),
     { close: !0 }
   ];
 }
-function xe(S, M, n) {
+function xe(S, L, n) {
   const [k, g, l, a] = S.radii.map((v) => Math.max(0, Math.min(v, S.w / 2, S.h / 2))), [e, s, u, h] = S.widths, p = [
     {
       w: S.h,
@@ -3356,7 +3356,7 @@ function xe(S, M, n) {
       width: e,
       before: h,
       after: s,
-      transform: (v, T) => [T, v]
+      transform: (v, B) => [B, v]
     },
     {
       w: S.w,
@@ -3366,7 +3366,7 @@ function xe(S, M, n) {
       width: s,
       before: e,
       after: u,
-      transform: (v, T) => [S.w - v, T]
+      transform: (v, B) => [S.w - v, B]
     },
     {
       w: S.h,
@@ -3376,7 +3376,7 @@ function xe(S, M, n) {
       width: u,
       before: h,
       after: s,
-      transform: (v, T) => [T, S.h - v]
+      transform: (v, B) => [B, S.h - v]
     },
     {
       w: S.w,
@@ -3386,45 +3386,45 @@ function xe(S, M, n) {
       width: h,
       before: e,
       after: u,
-      transform: (v, T) => [v, T]
+      transform: (v, B) => [v, B]
     }
-  ], { h: b, top: o, bottom: m, width: i, before: f, after: c, transform: w } = p[S.side], x = 0.5522847498, E = Math.max(0, o - i), A = Math.max(0, o - f), U = Math.max(0, m - i), N = Math.max(0, m - c);
+  ], { h: b, top: o, bottom: m, width: i, before: f, after: c, transform: w } = p[S.side], x = 0.5522847498, A = Math.max(0, o - i), z = Math.max(0, o - f), M = Math.max(0, m - i), D = Math.max(0, m - c);
   return [
     [o, 0],
     [0, o, o - o * x, 0, 0, o - o * x],
     [0, b - m],
     [m, b, 0, b - m + m * x, m - m * x, b],
-    [i + U, b - c],
+    [i + M, b - c],
     [
       i,
-      b - c - N,
-      i + U - U * x,
+      b - c - D,
+      i + M - M * x,
       b - c,
       i,
-      b - c - N + N * x
+      b - c - D + D * x
     ],
-    [i, f + A],
+    [i, f + z],
     [
-      i + E,
+      i + A,
       f,
       i,
-      f + A - A * x,
-      i + E - E * x,
+      f + z - z * x,
+      i + A - A * x,
       f
     ]
-  ].map(([v, T, D, d, z, r]) => {
-    const [P, V] = w(v, T), F = { x: P * M, y: V * n };
-    if (D !== void 0) {
-      const [tt, L] = w(D, d), [H, B] = w(z, r);
-      F.curve = { type: "cubic", x1: tt * M, y1: L * n, x2: H * M, y2: B * n };
+  ].map(([v, B, R, d, I, r]) => {
+    const [P, q] = w(v, B), U = { x: P * L, y: q * n };
+    if (R !== void 0) {
+      const [nt, F] = w(R, d), [Z, T] = w(I, r);
+      U.curve = { type: "cubic", x1: nt * L, y1: F * n, x2: Z * L, y2: T * n };
     }
-    return F;
+    return U;
   });
 }
 function Dt(S) {
   return S ? { color: S.hex, transparency: Math.round((1 - S.alpha) * 100) } : { color: "FFFFFF", transparency: 100 };
 }
-function Se(S, M) {
+function Se(S, L) {
   var l;
   if (!S || S === "none" || S.includes("inset"))
     return null;
@@ -3437,17 +3437,17 @@ function Se(S, M) {
     color: g ? [1, 2, 3].map((a) => Number(g[a]).toString(16).padStart(2, "0")).join("") : "000000",
     opacity: g != null && g[4] ? Number(g[4]) : 0.35,
     angle: (Math.atan2(k[1], k[0]) * 180 / Math.PI + 360) % 360,
-    blur: (k[2] || 0) * M * 72,
-    offset: Math.hypot(k[0], k[1]) * M * 72
+    blur: (k[2] || 0) * L * 72,
+    offset: Math.hypot(k[0], k[1]) * L * 72
   };
 }
-function Ce(S, M, n, k, g, l) {
+function Ce(S, L, n, k, g, l) {
   var e;
   const a = { x: n.x * k, y: n.y * g, w: n.w * k, h: n.h * g };
   if (n.type === "line") {
     if (n.gradient) {
       const u = `html2pptx-gradient-${l.length + 1}`;
-      S.addShape(M.ShapeType.rect, {
+      S.addShape(L.ShapeType.rect, {
         ...a,
         objectName: u,
         fill: Dt(n.gradient.stops[0]),
@@ -3457,7 +3457,7 @@ function Ce(S, M, n, k, g, l) {
       return;
     }
     const s = n.w >= n.h;
-    S.addShape(M.ShapeType.line, {
+    S.addShape(L.ShapeType.line, {
       x: (n.x + (s ? 0 : n.w / 2)) * k,
       y: (n.y + (s ? n.h / 2 : 0)) * g,
       w: s ? a.w : 0,
@@ -3492,8 +3492,10 @@ function Ce(S, M, n, k, g, l) {
       underline: n.underline,
       strike: n.strike,
       charSpacing: n.letterSpacing * k * 72,
+      // Browser rows are already wrapped; Office must not wrap each row again.
       margin: 0,
       breakLine: !1,
+      wrap: !1,
       valign: "middle",
       fit: "shrink",
       align: "left"
@@ -3502,7 +3504,7 @@ function Ce(S, M, n, k, g, l) {
   }
   if (n.type === "polygon" || n.type === "border-strip") {
     const s = n.type === "polygon" ? n.points.map(([u, h]) => ({ x: u * k, y: h * g })) : xe(n, k, g);
-    S.addShape(M.ShapeType.custGeom, {
+    S.addShape(L.ShapeType.custGeom, {
       ...a,
       points: [...s, { close: !0 }],
       fill: Dt(n.type === "polygon" ? n.fill : n.color),
@@ -3512,21 +3514,21 @@ function Ce(S, M, n, k, g, l) {
     return;
   }
   if (n.type === "shape") {
-    const s = n.radii || [n.radius, n.radius, n.radius, n.radius], u = s.some((m) => Math.abs(m - s[0]) > 0.1), h = n.radius >= Math.min(n.w, n.h) * 0.45 && Math.abs(n.w - n.h) < 1, p = u ? M.ShapeType.custGeom : h ? M.ShapeType.ellipse : n.radius >= 1 ? M.ShapeType.roundRect : M.ShapeType.rect, b = { ...a, fill: Dt(n.fill), line: (e = n.border) != null && e.width && n.border.color ? {
+    const s = n.radii || [n.radius, n.radius, n.radius, n.radius], u = s.some((m) => Math.abs(m - s[0]) > 0.1), h = n.radius >= Math.min(n.w, n.h) * 0.45 && Math.abs(n.w - n.h) < 1, p = u ? L.ShapeType.custGeom : h ? L.ShapeType.ellipse : n.radius >= 1 ? L.ShapeType.roundRect : L.ShapeType.rect, b = { ...a, fill: Dt(n.fill), line: (e = n.border) != null && e.width && n.border.color ? {
       color: n.border.color.hex,
       width: n.border.width * k * 72,
       transparency: Math.round((1 - n.border.color.alpha) * 100),
       dashType: n.border.style === "dashed" ? "dash" : n.border.style === "dotted" ? "sysDot" : "solid"
     } : { color: "FFFFFF", transparency: 100 } };
-    n.rotate && (b.rotate = n.rotate), p === M.ShapeType.custGeom && (b.points = ke(n.w, n.h, s, k, g)), p === M.ShapeType.roundRect && (b.rectRadius = n.radius * k);
+    n.rotate && (b.rotate = n.rotate), p === L.ShapeType.custGeom && (b.points = ke(n.w, n.h, s, k, g)), p === L.ShapeType.roundRect && (b.rectRadius = n.radius * k);
     const o = Se(n.shadow, k);
     o && (b.shadow = o), S.addShape(p, b);
   }
 }
-async function Ee(S, M) {
-  const n = S.locator(`[data-html2pptx-capture="${M.id}"]`);
+async function Ee(S, L) {
+  const n = S.locator(`[data-html2pptx-capture="${L.id}"]`);
   let k;
-  if (M.type === "capture-background") {
+  if (L.type === "capture-background") {
     await n.evaluate((g, l) => {
       const a = getComputedStyle(g), e = g.getBoundingClientRect(), s = document.createElement("div");
       s.id = "__html2pptx_background_clone", Object.assign(s.style, {
@@ -3549,7 +3551,7 @@ async function Ee(S, M) {
       }), ["TopLeft", "TopRight", "BottomRight", "BottomLeft"].forEach((u, h) => {
         l[h] !== null && (s.style[`border${u}Radius`] = `${l[h]}px`);
       }), document.body.appendChild(s), document.documentElement.classList.add("__html2pptx_background_isolate");
-    }, M.clipRadii);
+    }, L.clipRadii);
     try {
       k = await S.locator("#__html2pptx_background_clone").screenshot({ omitBackground: !0 });
     } finally {
@@ -3569,9 +3571,9 @@ async function Ee(S, M) {
       });
     }
   }
-  M.data = `data:image/png;base64,${k.toString("base64")}`;
+  L.data = `data:image/png;base64,${k.toString("base64")}`;
 }
-async function Ae(S, M, n) {
+async function Ae(S, L, n) {
   const k = Mt.resolve(S), g = { headless: !0, ...n.browserExecutable ? { executablePath: n.browserExecutable } : process.platform === "darwin" ? { channel: "chrome" } : {} }, { chromium: l } = await import("playwright-core").catch((e) => {
     throw e.code !== "ERR_MODULE_NOT_FOUND" ? e : new Error("HTML PPTX 导出需要显式安装 playwright-core@1.61.1。", { cause: e });
   }), a = await l.launch(g);
@@ -3596,30 +3598,30 @@ async function Ae(S, M, n) {
       html.__html2pptx_isolate .__html2pptx_active * { visibility: visible !important }
       html.__html2pptx_background_isolate,
       html.__html2pptx_background_isolate body { background: transparent !important }
-      html.__html2pptx_background_isolate body > *:not(#__html2pptx_background_clone) { visibility: hidden !important }
+      html.__html2pptx_background_isolate body *:not(#__html2pptx_background_clone) { visibility: hidden !important }
     ` });
     const u = n.selector || "#ppt-canvas, [data-ppt-canvas], .pptd-slide, .slide, .s, section";
     let h = await e.evaluate(Gt, u);
     await e.setViewportSize({ width: Math.max(1, Math.ceil(h.width)), height: Math.max(1, Math.ceil(h.height)) }), h = await e.evaluate(Gt, u);
     for (const i of h.elements)
       (i.type === "capture-element" || i.type === "capture-background") && await Ee(e, i);
-    (!M.presLayout || n.autoLayout) && (M.defineLayout({ name: `HTML_${Math.round(h.width)}x${Math.round(h.height)}`, width: h.width / 96, height: h.height / 96 }), M.layout = `HTML_${Math.round(h.width)}x${Math.round(h.height)}`);
-    const p = M.presLayout.width / Ht / h.width, b = M.presLayout.height / Ht / h.height, o = n.slide || M.addSlide();
+    (!L.presLayout || n.autoLayout) && (L.defineLayout({ name: `HTML_${Math.round(h.width)}x${Math.round(h.height)}`, width: h.width / 96, height: h.height / 96 }), L.layout = `HTML_${Math.round(h.width)}x${Math.round(h.height)}`);
+    const p = L.presLayout.width / Ht / h.width, b = L.presLayout.height / Ht / h.height, o = n.slide || L.addSlide();
     h.background && (o.background = { color: h.background.hex });
     const m = [];
     for (const i of h.elements)
-      Ce(o, M, i, p, b, m);
+      Ce(o, L, i, p, b, m);
     return { slide: o, placeholders: [], warnings: s, gradients: m, stats: h.elements.reduce((i, f) => (i[f.type] = (i[f.type] || 0) + 1, i), {}) };
   } finally {
     await a.close();
   }
 }
 const ze = oe(import.meta.url);
-function Te({ angle: S, stops: M }) {
-  const n = M.map((e, s) => {
+function Te({ angle: S, stops: L }) {
+  const n = L.map((e, s) => {
     if (e.alpha)
       return e;
-    const u = M.slice(s + 1).find((h) => h.alpha) || M.slice(0, s).reverse().find((h) => h.alpha);
+    const u = L.slice(s + 1).find((h) => h.alpha) || L.slice(0, s).reverse().find((h) => h.alpha);
     return { ...e, hex: (u == null ? void 0 : u.hex) || e.hex };
   }), k = (e) => {
     let s = n[0];
@@ -3640,17 +3642,17 @@ function Te({ angle: S, stops: M }) {
   return `<a:gradFill rotWithShape="1"><a:gsLst>${l}</a:gsLst><a:lin ang="${Math.round(a * 6e4)}" scaled="1"/></a:gradFill>`;
 }
 async function Ie(S) {
-  const M = S.file("[Content_Types].xml");
-  if (!M)
+  const L = S.file("[Content_Types].xml");
+  if (!L)
     return !1;
-  const n = await M.async("string"), k = n.replace(/<Override\b[^>]*\/>/g, (g) => {
+  const n = await L.async("string"), k = n.replace(/<Override\b[^>]*\/>/g, (g) => {
     var a;
     const l = (a = g.match(/\bPartName="([^"]+)"/)) == null ? void 0 : a[1];
     return l != null && l.match(/^\/ppt\/slideMasters\/slideMaster\d+\.xml$/) ? S.file(l.slice(1)) ? g : "" : g;
   });
   return k === n ? !1 : (S.file("[Content_Types].xml", k), !0);
 }
-async function Be(S, M, { selector: n, browserExecutable: k, assetsRoot: g } = {}) {
+async function Be(S, L, { selector: n, browserExecutable: k, assetsRoot: g } = {}) {
   const l = pt(S), e = (await Ot(l)).isDirectory() ? (await se(l)).filter((m) => $t(m).toLowerCase() === ".html").sort((m, i) => m.localeCompare(i, "zh-CN", { numeric: !0 })).map((m) => St(l, m)) : [l];
   if (!e.length || e.some((m) => $t(m).toLowerCase() !== ".html"))
     throw new Error(`没有找到 HTML 文件：${l}`);
@@ -3670,8 +3672,8 @@ async function Be(S, M, { selector: n, browserExecutable: k, assetsRoot: g } = {
       p.push({ pageNumber: m + 1, sourceFile: i, ...c });
     f.gradients.length && b.push({ pageNumber: m + 1, gradients: f.gradients });
   }
-  await Pt(It(M), { recursive: !0 });
-  const o = `${M}.${qt()}.pptx`;
+  await Pt(It(L), { recursive: !0 });
+  const o = `${L}.${qt()}.pptx`;
   try {
     await u.writeFile({ fileName: o });
     const m = await ye.loadAsync(await xt(o));
@@ -3679,26 +3681,26 @@ async function Be(S, M, { selector: n, browserExecutable: k, assetsRoot: g } = {
     if (b.length) {
       for (const { pageNumber: c, gradients: w } of b) {
         const x = `ppt/slides/slide${c}.xml`;
-        let E = await m.file(x).async("string");
-        for (const A of w) {
-          let U = 0;
-          if (E = E.replace(/<p:sp>.*?<\/p:sp>/g, (N) => {
-            if (!N.includes(`name="${A.name}"`))
-              return N;
-            if (U++, !N.includes('prst="rect"') || !N.includes("<a:solidFill>"))
-              throw new Error(`无法写入第 ${c} 页渐变形状：${A.name}`);
-            return N.replace(/<a:solidFill>.*?<\/a:solidFill>/, Te(A));
-          }), U !== 1)
-            throw new Error(`第 ${c} 页渐变形状数量异常：${A.name}`);
+        let A = await m.file(x).async("string");
+        for (const z of w) {
+          let M = 0;
+          if (A = A.replace(/<p:sp>.*?<\/p:sp>/g, (D) => {
+            if (!D.includes(`name="${z.name}"`))
+              return D;
+            if (M++, !D.includes('prst="rect"') || !D.includes("<a:solidFill>"))
+              throw new Error(`无法写入第 ${c} 页渐变形状：${z.name}`);
+            return D.replace(/<a:solidFill>.*?<\/a:solidFill>/, Te(z));
+          }), M !== 1)
+            throw new Error(`第 ${c} 页渐变形状数量异常：${z.name}`);
         }
-        m.file(x, E);
+        m.file(x, A);
       }
       i = !0;
     }
     i = await Ie(m) || i, i && await Lt(o, await m.generateAsync({ type: "nodebuffer", compression: "DEFLATE" }));
     const f = (await Ot(o)).size;
-    return await Xt(o, M), {
-      file: M,
+    return await Xt(o, L), {
+      file: L,
       pages: e.map((c, w) => ({ pageNumber: w + 1, sourceFile: c })),
       bytes: f,
       objects: h,