bok-reader 0.1.4 → 0.1.6

package/dist/bok.es.js

@@ -1,13 +1,13 @@
-import { jsxs as pt, Fragment as Lt, jsx as et } from "react/jsx-runtime";
-import * as wt from "react";
-import Ht, { useState as ft, useRef as yt, useCallback as Tt, useEffect as ut, useMemo as Gt } from "react";
-import Ut, { createGlobalStyle as $t } from "styled-components";
-var At = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
-function Yt(Z) {
-  return Z && Z.__esModule && Object.prototype.hasOwnProperty.call(Z, "default") ? Z.default : Z;
+import { jsxs as ut, Fragment as Ut, jsx as et } from "react/jsx-runtime";
+import * as kt from "react";
+import { useState as ht, useRef as wt, useCallback as Tt, useEffect as dt, useMemo as Xt } from "react";
+import Gt, { createGlobalStyle as qt } from "styled-components";
+var Ot = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function $t(X) {
+  return X && X.__esModule && Object.prototype.hasOwnProperty.call(X, "default") ? X.default : X;
 }
-function Ot(Z) {
-  throw new Error('Could not dynamically require "' + Z + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+function It(X) {
+  throw new Error('Could not dynamically require "' + X + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
 var jt = { exports: {} };
 /*!
@@ -21,15 +21,15 @@ 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(Z, K) {
+(function(X, K) {
   (function(p) {
-    Z.exports = p();
+    X.exports = p();
   })(function() {
     return function p(A, v, a) {
       function o(g, y) {
         if (!v[g]) {
           if (!A[g]) {
-            var _ = typeof Ot == "function" && Ot;
+            var _ = typeof It == "function" && It;
             if (!y && _) return _(g, !0);
             if (r) return r(g, !0);
             var b = new Error("Cannot find module '" + g + "'");
@@ -43,7 +43,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         }
         return v[g].exports;
       }
-      for (var r = typeof Ot == "function" && Ot, l = 0; l < a.length; l++) o(a[l]);
+      for (var r = typeof It == "function" && It, l = 0; l < a.length; l++) o(a[l]);
       return o;
     }({ 1: [function(p, A, v) {
       var a = p("./utils"), o = p("./support"), r = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
@@ -136,20 +136,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return c;
       }
       function o(i, d, n, c, s, m) {
-        var w, x, S = i.file, F = i.compression, E = m !== g.utf8encode, D = r.transformTo("string", m(S.name)), C = r.transformTo("string", g.utf8encode(S.name)), z = S.comment, X = r.transformTo("string", m(z)), h = r.transformTo("string", g.utf8encode(z)), T = C.length !== S.name.length, e = h.length !== z.length, P = "", V = "", L = "", Q = S.dir, W = S.date, tt = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+        var w, x, S = i.file, D = i.compression, C = m !== g.utf8encode, F = r.transformTo("string", m(S.name)), E = r.transformTo("string", g.utf8encode(S.name)), z = S.comment, Z = r.transformTo("string", m(z)), h = r.transformTo("string", g.utf8encode(z)), B = E.length !== S.name.length, e = h.length !== z.length, P = "", V = "", L = "", Q = S.dir, W = S.date, tt = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
         d && !n || (tt.crc32 = i.crc32, tt.compressedSize = i.compressedSize, tt.uncompressedSize = i.uncompressedSize);
-        var B = 0;
-        d && (B |= 8), E || !T && !e || (B |= 2048);
+        var T = 0;
+        d && (T |= 8), C || !B && !e || (T |= 2048);
         var I = 0, J = 0;
         Q && (I |= 16), s === "UNIX" ? (J = 798, I |= function(G, st) {
-          var ht = G;
-          return G || (ht = st ? 16893 : 33204), (65535 & ht) << 16;
+          var ft = G;
+          return G || (ft = st ? 16893 : 33204), (65535 & ft) << 16;
         }(S.unixPermissions, Q)) : (J = 20, I |= function(G) {
           return 63 & (G || 0);
-        }(S.dosPermissions)), w = W.getUTCHours(), w <<= 6, w |= W.getUTCMinutes(), w <<= 5, w |= W.getUTCSeconds() / 2, x = W.getUTCFullYear() - 1980, x <<= 4, x |= W.getUTCMonth() + 1, x <<= 5, x |= W.getUTCDate(), T && (V = a(1, 1) + a(y(D), 4) + C, P += "up" + a(V.length, 2) + V), e && (L = a(1, 1) + a(y(X), 4) + h, P += "uc" + a(L.length, 2) + L);
-        var $ = "";
-        return $ += `
-\0`, $ += a(B, 2), $ += F.magic, $ += a(w, 2), $ += a(x, 2), $ += a(tt.crc32, 4), $ += a(tt.compressedSize, 4), $ += a(tt.uncompressedSize, 4), $ += a(D.length, 2), $ += a(P.length, 2), { fileRecord: _.LOCAL_FILE_HEADER + $ + D + P, dirRecord: _.CENTRAL_FILE_HEADER + a(J, 2) + $ + a(X.length, 2) + "\0\0\0\0" + a(I, 4) + a(c, 4) + D + P + X };
+        }(S.dosPermissions)), w = W.getUTCHours(), w <<= 6, w |= W.getUTCMinutes(), w <<= 5, w |= W.getUTCSeconds() / 2, x = W.getUTCFullYear() - 1980, x <<= 4, x |= W.getUTCMonth() + 1, x <<= 5, x |= W.getUTCDate(), B && (V = a(1, 1) + a(y(F), 4) + E, P += "up" + a(V.length, 2) + V), e && (L = a(1, 1) + a(y(Z), 4) + h, P += "uc" + a(L.length, 2) + L);
+        var q = "";
+        return q += `
+\0`, q += a(T, 2), q += D.magic, q += a(w, 2), q += a(x, 2), q += a(tt.crc32, 4), q += a(tt.compressedSize, 4), q += a(tt.uncompressedSize, 4), q += a(F.length, 2), q += a(P.length, 2), { fileRecord: _.LOCAL_FILE_HEADER + q + F + P, dirRecord: _.CENTRAL_FILE_HEADER + a(J, 2) + q + a(Z.length, 2) + "\0\0\0\0" + a(I, 4) + a(c, 4) + F + P + Z };
       }
       var r = p("../utils"), l = p("../stream/GenericWorker"), g = p("../utf8"), y = p("../crc32"), _ = p("../signature");
       function b(i, d, n, c) {
@@ -176,8 +176,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }, b.prototype.flush = function() {
         for (var i = this.bytesWritten, d = 0; d < this.dirRecords.length; d++) this.push({ data: this.dirRecords[d], meta: { percent: 100 } });
         var n = this.bytesWritten - i, c = function(s, m, w, x, S) {
-          var F = r.transformTo("string", S(x));
-          return _.CENTRAL_DIRECTORY_END + "\0\0\0\0" + a(s, 2) + a(s, 2) + a(m, 4) + a(w, 4) + a(F.length, 2) + F;
+          var D = r.transformTo("string", S(x));
+          return _.CENTRAL_DIRECTORY_END + "\0\0\0\0" + a(s, 2) + a(s, 2) + a(m, 4) + a(w, 4) + a(D.length, 2) + D;
         }(this.dirRecords.length, n, i, this.zipComment, this.encodeFileName);
         this.push({ data: c, meta: { percent: 100 } });
       }, b.prototype.prepareNextSource = function() {
@@ -317,24 +317,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return a && typeof a.on == "function" && typeof a.pause == "function" && typeof a.resume == "function";
       } };
     }, {}], 15: [function(p, A, v) {
-      function a(S, F, E) {
-        var D, C = r.getTypeOf(F), z = r.extend(E || {}, y);
-        z.date = z.date || /* @__PURE__ */ new Date(), z.compression !== null && (z.compression = z.compression.toUpperCase()), typeof z.unixPermissions == "string" && (z.unixPermissions = parseInt(z.unixPermissions, 8)), z.unixPermissions && 16384 & z.unixPermissions && (z.dir = !0), z.dosPermissions && 16 & z.dosPermissions && (z.dir = !0), z.dir && (S = s(S)), z.createFolders && (D = c(S)) && m.call(this, D, !0);
-        var X = C === "string" && z.binary === !1 && z.base64 === !1;
-        E && E.binary !== void 0 || (z.binary = !X), (F instanceof _ && F.uncompressedSize === 0 || z.dir || !F || F.length === 0) && (z.base64 = !1, z.binary = !0, F = "", z.compression = "STORE", C = "string");
+      function a(S, D, C) {
+        var F, E = r.getTypeOf(D), z = r.extend(C || {}, y);
+        z.date = z.date || /* @__PURE__ */ new Date(), z.compression !== null && (z.compression = z.compression.toUpperCase()), typeof z.unixPermissions == "string" && (z.unixPermissions = parseInt(z.unixPermissions, 8)), z.unixPermissions && 16384 & z.unixPermissions && (z.dir = !0), z.dosPermissions && 16 & z.dosPermissions && (z.dir = !0), z.dir && (S = s(S)), z.createFolders && (F = c(S)) && m.call(this, F, !0);
+        var Z = E === "string" && z.binary === !1 && z.base64 === !1;
+        C && C.binary !== void 0 || (z.binary = !Z), (D instanceof _ && D.uncompressedSize === 0 || z.dir || !D || D.length === 0) && (z.base64 = !1, z.binary = !0, D = "", z.compression = "STORE", E = "string");
         var h = null;
-        h = F instanceof _ || F instanceof l ? F : d.isNode && d.isStream(F) ? new n(S, F) : r.prepareContent(S, F, z.binary, z.optimizedBinaryString, z.base64);
-        var T = new b(S, h, z);
-        this.files[S] = T;
+        h = D instanceof _ || D instanceof l ? D : d.isNode && d.isStream(D) ? new n(S, D) : r.prepareContent(S, D, z.binary, z.optimizedBinaryString, z.base64);
+        var B = new b(S, h, z);
+        this.files[S] = B;
       }
       var o = p("./utf8"), r = p("./utils"), l = p("./stream/GenericWorker"), g = p("./stream/StreamHelper"), y = p("./defaults"), _ = p("./compressedObject"), b = p("./zipObject"), i = p("./generate"), d = p("./nodejsUtils"), n = p("./nodejs/NodejsStreamInputAdapter"), c = function(S) {
         S.slice(-1) === "/" && (S = S.substring(0, S.length - 1));
-        var F = S.lastIndexOf("/");
-        return 0 < F ? S.substring(0, F) : "";
+        var D = S.lastIndexOf("/");
+        return 0 < D ? S.substring(0, D) : "";
       }, s = function(S) {
         return S.slice(-1) !== "/" && (S += "/"), S;
-      }, m = function(S, F) {
-        return F = F !== void 0 ? F : y.createFolders, S = s(S), this.files[S] || a.call(this, S, null, { dir: !0, createFolders: F }), this.files[S];
+      }, m = function(S, D) {
+        return D = D !== void 0 ? D : y.createFolders, S = s(S), this.files[S] || a.call(this, S, null, { dir: !0, createFolders: D }), this.files[S];
       };
       function w(S) {
         return Object.prototype.toString.call(S) === "[object RegExp]";
@@ -342,55 +342,55 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       var x = { load: function() {
         throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
       }, forEach: function(S) {
-        var F, E, D;
-        for (F in this.files) D = this.files[F], (E = F.slice(this.root.length, F.length)) && F.slice(0, this.root.length) === this.root && S(E, D);
+        var D, C, F;
+        for (D in this.files) F = this.files[D], (C = D.slice(this.root.length, D.length)) && D.slice(0, this.root.length) === this.root && S(C, F);
       }, filter: function(S) {
-        var F = [];
-        return this.forEach(function(E, D) {
-          S(E, D) && F.push(D);
-        }), F;
-      }, file: function(S, F, E) {
-        if (arguments.length !== 1) return S = this.root + S, a.call(this, S, F, E), this;
+        var D = [];
+        return this.forEach(function(C, F) {
+          S(C, F) && D.push(F);
+        }), D;
+      }, file: function(S, D, C) {
+        if (arguments.length !== 1) return S = this.root + S, a.call(this, S, D, C), this;
         if (w(S)) {
-          var D = S;
-          return this.filter(function(z, X) {
-            return !X.dir && D.test(z);
+          var F = S;
+          return this.filter(function(z, Z) {
+            return !Z.dir && F.test(z);
           });
         }
-        var C = this.files[this.root + S];
-        return C && !C.dir ? C : null;
+        var E = this.files[this.root + S];
+        return E && !E.dir ? E : null;
       }, folder: function(S) {
         if (!S) return this;
-        if (w(S)) return this.filter(function(C, z) {
-          return z.dir && S.test(C);
+        if (w(S)) return this.filter(function(E, z) {
+          return z.dir && S.test(E);
         });
-        var F = this.root + S, E = m.call(this, F), D = this.clone();
-        return D.root = E.name, D;
+        var D = this.root + S, C = m.call(this, D), F = this.clone();
+        return F.root = C.name, F;
       }, remove: function(S) {
         S = this.root + S;
-        var F = this.files[S];
-        if (F || (S.slice(-1) !== "/" && (S += "/"), F = this.files[S]), F && !F.dir) delete this.files[S];
-        else for (var E = this.filter(function(C, z) {
+        var D = this.files[S];
+        if (D || (S.slice(-1) !== "/" && (S += "/"), D = this.files[S]), D && !D.dir) delete this.files[S];
+        else for (var C = this.filter(function(E, z) {
           return z.name.slice(0, S.length) === S;
-        }), D = 0; D < E.length; D++) delete this.files[E[D].name];
+        }), F = 0; F < C.length; F++) delete this.files[C[F].name];
         return this;
       }, generate: function() {
         throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
       }, generateInternalStream: function(S) {
-        var F, E = {};
+        var D, C = {};
         try {
-          if ((E = r.extend(S || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: o.utf8encode })).type = E.type.toLowerCase(), E.compression = E.compression.toUpperCase(), E.type === "binarystring" && (E.type = "string"), !E.type) throw new Error("No output type specified.");
-          r.checkSupport(E.type), E.platform !== "darwin" && E.platform !== "freebsd" && E.platform !== "linux" && E.platform !== "sunos" || (E.platform = "UNIX"), E.platform === "win32" && (E.platform = "DOS");
-          var D = E.comment || this.comment || "";
-          F = i.generateWorker(this, E, D);
-        } catch (C) {
-          (F = new l("error")).error(C);
+          if ((C = r.extend(S || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: o.utf8encode })).type = C.type.toLowerCase(), C.compression = C.compression.toUpperCase(), C.type === "binarystring" && (C.type = "string"), !C.type) throw new Error("No output type specified.");
+          r.checkSupport(C.type), C.platform !== "darwin" && C.platform !== "freebsd" && C.platform !== "linux" && C.platform !== "sunos" || (C.platform = "UNIX"), C.platform === "win32" && (C.platform = "DOS");
+          var F = C.comment || this.comment || "";
+          D = i.generateWorker(this, C, F);
+        } catch (E) {
+          (D = new l("error")).error(E);
         }
-        return new g(F, E.type || "string", E.mimeType);
-      }, generateAsync: function(S, F) {
-        return this.generateInternalStream(S).accumulate(F);
-      }, generateNodeStream: function(S, F) {
-        return (S = S || {}).type || (S.type = "nodebuffer"), this.generateInternalStream(S).toNodejsStream(F);
+        return new g(D, C.type || "string", C.mimeType);
+      }, generateAsync: function(S, D) {
+        return this.generateInternalStream(S).accumulate(D);
+      }, generateNodeStream: function(S, D) {
+        return (S = S || {}).type || (S.type = "nodebuffer"), this.generateInternalStream(S).toNodejsStream(D);
       } };
       A.exports = x;
     }, { "./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(p, A, v) {
@@ -612,41 +612,41 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function b(d, n) {
         return new y.Promise(function(c, s) {
           var m = [], w = d._internalType, x = d._outputType, S = d._mimeType;
-          d.on("data", function(F, E) {
-            m.push(F), n && n(E);
-          }).on("error", function(F) {
-            m = [], s(F);
+          d.on("data", function(D, C) {
+            m.push(D), n && n(C);
+          }).on("error", function(D) {
+            m = [], s(D);
           }).on("end", function() {
             try {
-              var F = function(E, D, C) {
-                switch (E) {
+              var D = function(C, F, E) {
+                switch (C) {
                   case "blob":
-                    return a.newBlob(a.transformTo("arraybuffer", D), C);
+                    return a.newBlob(a.transformTo("arraybuffer", F), E);
                   case "base64":
-                    return l.encode(D);
+                    return l.encode(F);
                   default:
-                    return a.transformTo(E, D);
+                    return a.transformTo(C, F);
                 }
-              }(x, function(E, D) {
-                var C, z = 0, X = null, h = 0;
-                for (C = 0; C < D.length; C++) h += D[C].length;
-                switch (E) {
+              }(x, function(C, F) {
+                var E, z = 0, Z = null, h = 0;
+                for (E = 0; E < F.length; E++) h += F[E].length;
+                switch (C) {
                   case "string":
-                    return D.join("");
+                    return F.join("");
                   case "array":
-                    return Array.prototype.concat.apply([], D);
+                    return Array.prototype.concat.apply([], F);
                   case "uint8array":
-                    for (X = new Uint8Array(h), C = 0; C < D.length; C++) X.set(D[C], z), z += D[C].length;
-                    return X;
+                    for (Z = new Uint8Array(h), E = 0; E < F.length; E++) Z.set(F[E], z), z += F[E].length;
+                    return Z;
                   case "nodebuffer":
-                    return Buffer.concat(D);
+                    return Buffer.concat(F);
                   default:
-                    throw new Error("concat : unsupported type '" + E + "'");
+                    throw new Error("concat : unsupported type '" + C + "'");
                 }
               }(w, m), S);
-              c(F);
-            } catch (E) {
-              s(E);
+              c(D);
+            } catch (C) {
+              s(C);
             }
             m = [];
           }).resume();
@@ -877,18 +877,18 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return s;
       }, v.prepareContent = function(n, c, s, m, w) {
         return l.Promise.resolve(c).then(function(x) {
-          return a.blob && (x instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(x)) !== -1) && typeof FileReader < "u" ? new l.Promise(function(S, F) {
-            var E = new FileReader();
-            E.onload = function(D) {
-              S(D.target.result);
-            }, E.onerror = function(D) {
-              F(D.target.error);
-            }, E.readAsArrayBuffer(x);
+          return a.blob && (x instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(x)) !== -1) && typeof FileReader < "u" ? new l.Promise(function(S, D) {
+            var C = new FileReader();
+            C.onload = function(F) {
+              S(F.target.result);
+            }, C.onerror = function(F) {
+              D(F.target.error);
+            }, C.readAsArrayBuffer(x);
           }) : x;
         }).then(function(x) {
           var S = v.getTypeOf(x);
-          return S ? (S === "arraybuffer" ? x = v.transformTo("uint8array", x) : S === "string" && (w ? x = o.decode(x) : s && m !== !0 && (x = function(F) {
-            return y(F, a.uint8array ? new Uint8Array(F.length) : new Array(F.length));
+          return S ? (S === "arraybuffer" ? x = v.transformTo("uint8array", x) : S === "string" && (w ? x = o.decode(x) : s && m !== !0 && (x = function(D) {
+            return y(D, a.uint8array ? new Uint8Array(D.length) : new Array(D.length));
           }(x))), x) : l.Promise.reject(new Error("Can't read the data of '" + n + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
         });
       };
@@ -1078,7 +1078,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         A.exports = function(n) {
           i.push(n) !== 1 || r || o();
         };
-      }).call(this, typeof At < "u" ? At : typeof self < "u" ? self : typeof window < "u" ? window : {});
+      }).call(this, typeof Ot < "u" ? Ot : typeof self < "u" ? self : typeof window < "u" ? window : {});
     }, {}], 37: [function(p, A, v) {
       var a = p("immediate");
       function o() {
@@ -1110,16 +1110,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }
       function n(s, m) {
         var w = !1;
-        function x(E) {
-          w || (w = !0, r.reject(s, E));
+        function x(C) {
+          w || (w = !0, r.reject(s, C));
         }
-        function S(E) {
-          w || (w = !0, r.resolve(s, E));
+        function S(C) {
+          w || (w = !0, r.resolve(s, C));
         }
-        var F = c(function() {
+        var D = c(function() {
           m(S, x);
         });
-        F.status === "error" && x(F.value);
+        D.status === "error" && x(D.value);
       }
       function c(s, m) {
         var w = {};
@@ -1163,7 +1163,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (x) n(s, x);
         else {
           s.state = g, s.outcome = m;
-          for (var S = -1, F = s.queue.length; ++S < F; ) s.queue[S].callFulfilled(m);
+          for (var S = -1, D = s.queue.length; ++S < D; ) s.queue[S].callFulfilled(m);
         }
         return s;
       }, r.reject = function(s, m) {
@@ -1180,13 +1180,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (Object.prototype.toString.call(s) !== "[object Array]") return this.reject(new TypeError("must be an array"));
         var w = s.length, x = !1;
         if (!w) return this.resolve([]);
-        for (var S = new Array(w), F = 0, E = -1, D = new this(o); ++E < w; ) C(s[E], E);
-        return D;
-        function C(z, X) {
+        for (var S = new Array(w), D = 0, C = -1, F = new this(o); ++C < w; ) E(s[C], C);
+        return F;
+        function E(z, Z) {
           m.resolve(z).then(function(h) {
-            S[X] = h, ++F !== w || x || (x = !0, r.resolve(D, S));
+            S[Z] = h, ++D !== w || x || (x = !0, r.resolve(F, S));
           }, function(h) {
-            x || (x = !0, r.reject(D, h));
+            x || (x = !0, r.reject(F, h));
           });
         }
       }, _.race = function(s) {
@@ -1194,13 +1194,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (Object.prototype.toString.call(s) !== "[object Array]") return this.reject(new TypeError("must be an array"));
         var w = s.length, x = !1;
         if (!w) return this.resolve([]);
-        for (var S = -1, F = new this(o); ++S < w; ) E = s[S], m.resolve(E).then(function(D) {
-          x || (x = !0, r.resolve(F, D));
-        }, function(D) {
-          x || (x = !0, r.reject(F, D));
+        for (var S = -1, D = new this(o); ++S < w; ) C = s[S], m.resolve(C).then(function(F) {
+          x || (x = !0, r.resolve(D, F));
+        }, function(F) {
+          x || (x = !0, r.reject(D, F));
         });
-        var E;
-        return F;
+        var C;
+        return D;
       };
     }, { immediate: 36 }], 38: [function(p, A, v) {
       var a = {};
@@ -1226,11 +1226,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return w.result;
       }
       n.prototype.push = function(s, m) {
-        var w, x, S = this.strm, F = this.options.chunkSize;
+        var w, x, S = this.strm, D = this.options.chunkSize;
         if (this.ended) return !1;
         x = m === ~~m ? m : m === !0 ? 4 : 0, typeof s == "string" ? S.input = r.string2buf(s) : y.call(s) === "[object ArrayBuffer]" ? S.input = new Uint8Array(s) : S.input = s, S.next_in = 0, S.avail_in = S.input.length;
         do {
-          if (S.avail_out === 0 && (S.output = new o.Buf8(F), S.next_out = 0, S.avail_out = F), (w = a.deflate(S, x)) !== 1 && w !== _) return this.onEnd(w), !(this.ended = !0);
+          if (S.avail_out === 0 && (S.output = new o.Buf8(D), S.next_out = 0, S.avail_out = D), (w = a.deflate(S, x)) !== 1 && w !== _) return this.onEnd(w), !(this.ended = !0);
           S.avail_out !== 0 && (S.avail_in !== 0 || x !== 4 && x !== 2) || (this.options.to === "string" ? this.onData(r.buf2binstring(o.shrinkBuf(S.output, S.next_out))) : this.onData(o.shrinkBuf(S.output, S.next_out)));
         } while ((0 < S.avail_in || S.avail_out === 0) && w !== 1);
         return x === 4 ? (w = a.deflateEnd(this.strm), this.onEnd(w), this.ended = !0, w === _) : x !== 2 || (this.onEnd(_), !(S.avail_out = 0));
@@ -1260,14 +1260,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return s.result;
       }
       i.prototype.push = function(n, c) {
-        var s, m, w, x, S, F, E = this.strm, D = this.options.chunkSize, C = this.options.dictionary, z = !1;
+        var s, m, w, x, S, D, C = this.strm, F = this.options.chunkSize, E = this.options.dictionary, z = !1;
         if (this.ended) return !1;
-        m = c === ~~c ? c : c === !0 ? l.Z_FINISH : l.Z_NO_FLUSH, typeof n == "string" ? E.input = r.binstring2buf(n) : b.call(n) === "[object ArrayBuffer]" ? E.input = new Uint8Array(n) : E.input = n, E.next_in = 0, E.avail_in = E.input.length;
+        m = c === ~~c ? c : c === !0 ? l.Z_FINISH : l.Z_NO_FLUSH, typeof n == "string" ? C.input = r.binstring2buf(n) : b.call(n) === "[object ArrayBuffer]" ? C.input = new Uint8Array(n) : C.input = n, C.next_in = 0, C.avail_in = C.input.length;
         do {
-          if (E.avail_out === 0 && (E.output = new o.Buf8(D), E.next_out = 0, E.avail_out = D), (s = a.inflate(E, l.Z_NO_FLUSH)) === l.Z_NEED_DICT && C && (F = typeof C == "string" ? r.string2buf(C) : b.call(C) === "[object ArrayBuffer]" ? new Uint8Array(C) : C, s = a.inflateSetDictionary(this.strm, F)), s === l.Z_BUF_ERROR && z === !0 && (s = l.Z_OK, z = !1), s !== l.Z_STREAM_END && s !== l.Z_OK) return this.onEnd(s), !(this.ended = !0);
-          E.next_out && (E.avail_out !== 0 && s !== l.Z_STREAM_END && (E.avail_in !== 0 || m !== l.Z_FINISH && m !== l.Z_SYNC_FLUSH) || (this.options.to === "string" ? (w = r.utf8border(E.output, E.next_out), x = E.next_out - w, S = r.buf2string(E.output, w), E.next_out = x, E.avail_out = D - x, x && o.arraySet(E.output, E.output, w, x, 0), this.onData(S)) : this.onData(o.shrinkBuf(E.output, E.next_out)))), E.avail_in === 0 && E.avail_out === 0 && (z = !0);
-        } while ((0 < E.avail_in || E.avail_out === 0) && s !== l.Z_STREAM_END);
-        return s === l.Z_STREAM_END && (m = l.Z_FINISH), m === l.Z_FINISH ? (s = a.inflateEnd(this.strm), this.onEnd(s), this.ended = !0, s === l.Z_OK) : m !== l.Z_SYNC_FLUSH || (this.onEnd(l.Z_OK), !(E.avail_out = 0));
+          if (C.avail_out === 0 && (C.output = new o.Buf8(F), C.next_out = 0, C.avail_out = F), (s = a.inflate(C, l.Z_NO_FLUSH)) === l.Z_NEED_DICT && E && (D = typeof E == "string" ? r.string2buf(E) : b.call(E) === "[object ArrayBuffer]" ? new Uint8Array(E) : E, s = a.inflateSetDictionary(this.strm, D)), s === l.Z_BUF_ERROR && z === !0 && (s = l.Z_OK, z = !1), s !== l.Z_STREAM_END && s !== l.Z_OK) return this.onEnd(s), !(this.ended = !0);
+          C.next_out && (C.avail_out !== 0 && s !== l.Z_STREAM_END && (C.avail_in !== 0 || m !== l.Z_FINISH && m !== l.Z_SYNC_FLUSH) || (this.options.to === "string" ? (w = r.utf8border(C.output, C.next_out), x = C.next_out - w, S = r.buf2string(C.output, w), C.next_out = x, C.avail_out = F - x, x && o.arraySet(C.output, C.output, w, x, 0), this.onData(S)) : this.onData(o.shrinkBuf(C.output, C.next_out)))), C.avail_in === 0 && C.avail_out === 0 && (z = !0);
+        } while ((0 < C.avail_in || C.avail_out === 0) && s !== l.Z_STREAM_END);
+        return s === l.Z_STREAM_END && (m = l.Z_FINISH), m === l.Z_FINISH ? (s = a.inflateEnd(this.strm), this.onEnd(s), this.ended = !0, s === l.Z_OK) : m !== l.Z_SYNC_FLUSH || (this.onEnd(l.Z_OK), !(C.avail_out = 0));
       }, i.prototype.onData = function(n) {
         this.chunks.push(n);
       }, i.prototype.onEnd = function(n) {
@@ -1373,7 +1373,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return -1 ^ o;
       };
     }, {}], 46: [function(p, A, v) {
-      var a, o = p("../utils/common"), r = p("./trees"), l = p("./adler32"), g = p("./crc32"), y = p("./messages"), _ = 0, b = 4, i = 0, d = -2, n = -1, c = 4, s = 2, m = 8, w = 9, x = 286, S = 30, F = 19, E = 2 * x + 1, D = 15, C = 3, z = 258, X = z + C + 1, h = 42, T = 113, e = 1, P = 2, V = 3, L = 4;
+      var a, o = p("../utils/common"), r = p("./trees"), l = p("./adler32"), g = p("./crc32"), y = p("./messages"), _ = 0, b = 4, i = 0, d = -2, n = -1, c = 4, s = 2, m = 8, w = 9, x = 286, S = 30, D = 19, C = 2 * x + 1, F = 15, E = 3, z = 258, Z = z + E + 1, h = 42, B = 113, e = 1, P = 2, V = 3, L = 4;
       function Q(t, N) {
         return t.msg = y[N], N;
       }
@@ -1383,101 +1383,101 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function tt(t) {
         for (var N = t.length; 0 <= --N; ) t[N] = 0;
       }
-      function B(t) {
+      function T(t) {
         var N = t.state, R = N.pending;
         R > t.avail_out && (R = t.avail_out), R !== 0 && (o.arraySet(t.output, N.pending_buf, N.pending_out, R, t.next_out), t.next_out += R, N.pending_out += R, t.total_out += R, t.avail_out -= R, N.pending -= R, N.pending === 0 && (N.pending_out = 0));
       }
       function I(t, N) {
-        r._tr_flush_block(t, 0 <= t.block_start ? t.block_start : -1, t.strstart - t.block_start, N), t.block_start = t.strstart, B(t.strm);
+        r._tr_flush_block(t, 0 <= t.block_start ? t.block_start : -1, t.strstart - t.block_start, N), t.block_start = t.strstart, T(t.strm);
       }
       function J(t, N) {
         t.pending_buf[t.pending++] = N;
       }
-      function $(t, N) {
+      function q(t, N) {
         t.pending_buf[t.pending++] = N >>> 8 & 255, t.pending_buf[t.pending++] = 255 & N;
       }
       function G(t, N) {
-        var R, f, u = t.max_chain_length, k = t.strstart, U = t.prev_length, j = t.nice_match, O = t.strstart > t.w_size - X ? t.strstart - (t.w_size - X) : 0, M = t.window, Y = t.w_mask, H = t.prev, q = t.strstart + z, at = M[k + U - 1], nt = M[k + U];
+        var R, f, u = t.max_chain_length, k = t.strstart, U = t.prev_length, j = t.nice_match, O = t.strstart > t.w_size - Z ? t.strstart - (t.w_size - Z) : 0, M = t.window, $ = t.w_mask, H = t.prev, Y = t.strstart + z, at = M[k + U - 1], nt = M[k + U];
         t.prev_length >= t.good_match && (u >>= 2), j > t.lookahead && (j = t.lookahead);
         do
           if (M[(R = N) + U] === nt && M[R + U - 1] === at && M[R] === M[k] && M[++R] === M[k + 1]) {
             k += 2, R++;
             do
               ;
-            while (M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && k < q);
-            if (f = z - (q - k), k = q - z, U < f) {
+            while (M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && M[++k] === M[++R] && k < Y);
+            if (f = z - (Y - k), k = Y - z, U < f) {
               if (t.match_start = N, j <= (U = f)) break;
               at = M[k + U - 1], nt = M[k + U];
             }
           }
-        while ((N = H[N & Y]) > O && --u != 0);
+        while ((N = H[N & $]) > O && --u != 0);
         return U <= t.lookahead ? U : t.lookahead;
       }
       function st(t) {
-        var N, R, f, u, k, U, j, O, M, Y, H = t.w_size;
+        var N, R, f, u, k, U, j, O, M, $, H = t.w_size;
         do {
-          if (u = t.window_size - t.lookahead - t.strstart, t.strstart >= H + (H - X)) {
+          if (u = t.window_size - t.lookahead - t.strstart, t.strstart >= H + (H - Z)) {
             for (o.arraySet(t.window, t.window, H, H, 0), t.match_start -= H, t.strstart -= H, t.block_start -= H, N = R = t.hash_size; f = t.head[--N], t.head[N] = H <= f ? f - H : 0, --R; ) ;
             for (N = R = H; f = t.prev[--N], t.prev[N] = H <= f ? f - H : 0, --R; ) ;
             u += H;
           }
           if (t.strm.avail_in === 0) break;
-          if (U = t.strm, j = t.window, O = t.strstart + t.lookahead, M = u, Y = void 0, Y = U.avail_in, M < Y && (Y = M), R = Y === 0 ? 0 : (U.avail_in -= Y, o.arraySet(j, U.input, U.next_in, Y, O), U.state.wrap === 1 ? U.adler = l(U.adler, j, Y, O) : U.state.wrap === 2 && (U.adler = g(U.adler, j, Y, O)), U.next_in += Y, U.total_in += Y, Y), t.lookahead += R, t.lookahead + t.insert >= C) for (k = t.strstart - t.insert, t.ins_h = t.window[k], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[k + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[k + C - 1]) & t.hash_mask, t.prev[k & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = k, k++, t.insert--, !(t.lookahead + t.insert < C)); ) ;
-        } while (t.lookahead < X && t.strm.avail_in !== 0);
+          if (U = t.strm, j = t.window, O = t.strstart + t.lookahead, M = u, $ = void 0, $ = U.avail_in, M < $ && ($ = M), R = $ === 0 ? 0 : (U.avail_in -= $, o.arraySet(j, U.input, U.next_in, $, O), U.state.wrap === 1 ? U.adler = l(U.adler, j, $, O) : U.state.wrap === 2 && (U.adler = g(U.adler, j, $, O)), U.next_in += $, U.total_in += $, $), t.lookahead += R, t.lookahead + t.insert >= E) for (k = t.strstart - t.insert, t.ins_h = t.window[k], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[k + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[k + E - 1]) & t.hash_mask, t.prev[k & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = k, k++, t.insert--, !(t.lookahead + t.insert < E)); ) ;
+        } while (t.lookahead < Z && t.strm.avail_in !== 0);
       }
-      function ht(t, N) {
+      function ft(t, N) {
         for (var R, f; ; ) {
-          if (t.lookahead < X) {
-            if (st(t), t.lookahead < X && N === _) return e;
+          if (t.lookahead < Z) {
+            if (st(t), t.lookahead < Z && N === _) return e;
             if (t.lookahead === 0) break;
           }
-          if (R = 0, t.lookahead >= C && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + C - 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 - X && (t.match_length = G(t, R)), t.match_length >= C) if (f = r._tr_tally(t, t.strstart - t.match_start, t.match_length - C), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= C) {
-            for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + C - 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; ) ;
+          if (R = 0, t.lookahead >= E && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + E - 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 - Z && (t.match_length = G(t, R)), t.match_length >= E) if (f = r._tr_tally(t, t.strstart - t.match_start, t.match_length - E), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= E) {
+            for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + E - 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; ) ;
             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 f = r._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
           if (f && (I(t, !1), t.strm.avail_out === 0)) return e;
         }
-        return t.insert = t.strstart < C - 1 ? t.strstart : C - 1, N === b ? (I(t, !0), t.strm.avail_out === 0 ? V : L) : t.last_lit && (I(t, !1), t.strm.avail_out === 0) ? e : P;
+        return t.insert = t.strstart < E - 1 ? t.strstart : E - 1, N === b ? (I(t, !0), t.strm.avail_out === 0 ? V : L) : t.last_lit && (I(t, !1), t.strm.avail_out === 0) ? e : P;
       }
       function rt(t, N) {
         for (var R, f, u; ; ) {
-          if (t.lookahead < X) {
-            if (st(t), t.lookahead < X && N === _) return e;
+          if (t.lookahead < Z) {
+            if (st(t), t.lookahead < Z && N === _) return e;
             if (t.lookahead === 0) break;
           }
-          if (R = 0, t.lookahead >= C && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + C - 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 = C - 1, R !== 0 && t.prev_length < t.max_lazy_match && t.strstart - R <= t.w_size - X && (t.match_length = G(t, R), t.match_length <= 5 && (t.strategy === 1 || t.match_length === C && 4096 < t.strstart - t.match_start) && (t.match_length = C - 1)), t.prev_length >= C && t.match_length <= t.prev_length) {
-            for (u = t.strstart + t.lookahead - C, f = r._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - C), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= u && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + C - 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 (t.match_available = 0, t.match_length = C - 1, t.strstart++, f && (I(t, !1), t.strm.avail_out === 0)) return e;
+          if (R = 0, t.lookahead >= E && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + E - 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 = E - 1, R !== 0 && t.prev_length < t.max_lazy_match && t.strstart - R <= t.w_size - Z && (t.match_length = G(t, R), t.match_length <= 5 && (t.strategy === 1 || t.match_length === E && 4096 < t.strstart - t.match_start) && (t.match_length = E - 1)), t.prev_length >= E && t.match_length <= t.prev_length) {
+            for (u = t.strstart + t.lookahead - E, f = r._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - E), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= u && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + E - 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 (t.match_available = 0, t.match_length = E - 1, t.strstart++, f && (I(t, !1), t.strm.avail_out === 0)) return e;
           } else if (t.match_available) {
             if ((f = r._tr_tally(t, 0, t.window[t.strstart - 1])) && I(t, !1), t.strstart++, t.lookahead--, t.strm.avail_out === 0) return e;
           } else t.match_available = 1, t.strstart++, t.lookahead--;
         }
-        return t.match_available && (f = r._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < C - 1 ? t.strstart : C - 1, N === b ? (I(t, !0), t.strm.avail_out === 0 ? V : L) : t.last_lit && (I(t, !1), t.strm.avail_out === 0) ? e : P;
+        return t.match_available && (f = r._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < E - 1 ? t.strstart : E - 1, N === b ? (I(t, !0), t.strm.avail_out === 0 ? V : L) : t.last_lit && (I(t, !1), t.strm.avail_out === 0) ? e : P;
       }
       function it(t, N, R, f, u) {
         this.good_length = t, this.max_lazy = N, this.nice_length = R, this.max_chain = f, this.func = u;
       }
       function ct() {
-        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 = m, 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 o.Buf16(2 * E), this.dyn_dtree = new o.Buf16(2 * (2 * S + 1)), this.bl_tree = new o.Buf16(2 * (2 * F + 1)), tt(this.dyn_ltree), tt(this.dyn_dtree), tt(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new o.Buf16(D + 1), this.heap = new o.Buf16(2 * x + 1), tt(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new o.Buf16(2 * x + 1), tt(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 = m, 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 o.Buf16(2 * C), this.dyn_dtree = new o.Buf16(2 * (2 * S + 1)), this.bl_tree = new o.Buf16(2 * (2 * D + 1)), tt(this.dyn_ltree), tt(this.dyn_dtree), tt(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new o.Buf16(F + 1), this.heap = new o.Buf16(2 * x + 1), tt(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new o.Buf16(2 * x + 1), tt(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
       }
       function ot(t) {
         var N;
-        return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = s, (N = t.state).pending = 0, N.pending_out = 0, N.wrap < 0 && (N.wrap = -N.wrap), N.status = N.wrap ? h : T, t.adler = N.wrap === 2 ? 0 : 1, N.last_flush = _, r._tr_init(N), i) : Q(t, d);
+        return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = s, (N = t.state).pending = 0, N.pending_out = 0, N.wrap < 0 && (N.wrap = -N.wrap), N.status = N.wrap ? h : B, t.adler = N.wrap === 2 ? 0 : 1, N.last_flush = _, r._tr_init(N), i) : Q(t, d);
       }
-      function _t(t) {
+      function bt(t) {
         var N = ot(t);
         return N === i && function(R) {
-          R.window_size = 2 * R.w_size, tt(R.head), R.max_lazy_match = a[R.level].max_lazy, R.good_match = a[R.level].good_length, R.nice_match = a[R.level].nice_length, R.max_chain_length = a[R.level].max_chain, R.strstart = 0, R.block_start = 0, R.lookahead = 0, R.insert = 0, R.match_length = R.prev_length = C - 1, R.match_available = 0, R.ins_h = 0;
+          R.window_size = 2 * R.w_size, tt(R.head), R.max_lazy_match = a[R.level].max_lazy, R.good_match = a[R.level].good_length, R.nice_match = a[R.level].nice_length, R.max_chain_length = a[R.level].max_chain, R.strstart = 0, R.block_start = 0, R.lookahead = 0, R.insert = 0, R.match_length = R.prev_length = E - 1, R.match_available = 0, R.ins_h = 0;
         }(t.state), N;
       }
-      function gt(t, N, R, f, u, k) {
+      function _t(t, N, R, f, u, k) {
         if (!t) return d;
         var U = 1;
         if (N === n && (N = 6), f < 0 ? (U = 0, f = -f) : 15 < f && (U = 2, f -= 16), u < 1 || w < u || R !== m || f < 8 || 15 < f || N < 0 || 9 < N || k < 0 || c < k) return Q(t, d);
         f === 8 && (f = 9);
         var j = new ct();
-        return (t.state = j).strm = t, j.wrap = U, j.gzhead = null, j.w_bits = f, j.w_size = 1 << j.w_bits, j.w_mask = j.w_size - 1, j.hash_bits = u + 7, j.hash_size = 1 << j.hash_bits, j.hash_mask = j.hash_size - 1, j.hash_shift = ~~((j.hash_bits + C - 1) / C), j.window = new o.Buf8(2 * j.w_size), j.head = new o.Buf16(j.hash_size), j.prev = new o.Buf16(j.w_size), j.lit_bufsize = 1 << u + 6, j.pending_buf_size = 4 * j.lit_bufsize, j.pending_buf = new o.Buf8(j.pending_buf_size), j.d_buf = 1 * j.lit_bufsize, j.l_buf = 3 * j.lit_bufsize, j.level = N, j.strategy = k, j.method = R, _t(t);
+        return (t.state = j).strm = t, j.wrap = U, j.gzhead = null, j.w_bits = f, j.w_size = 1 << j.w_bits, j.w_mask = j.w_size - 1, j.hash_bits = u + 7, j.hash_size = 1 << j.hash_bits, j.hash_mask = j.hash_size - 1, j.hash_shift = ~~((j.hash_bits + E - 1) / E), j.window = new o.Buf8(2 * j.w_size), j.head = new o.Buf16(j.hash_size), j.prev = new o.Buf16(j.w_size), j.lit_bufsize = 1 << u + 6, j.pending_buf_size = 4 * j.lit_bufsize, j.pending_buf = new o.Buf8(j.pending_buf_size), j.d_buf = 1 * j.lit_bufsize, j.l_buf = 3 * j.lit_bufsize, j.level = N, j.strategy = k, j.method = R, bt(t);
       }
       a = [new it(0, 0, 0, 0, function(t, N) {
         var R = 65535;
@@ -1488,30 +1488,30 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           }
           t.strstart += t.lookahead, t.lookahead = 0;
           var f = t.block_start + R;
-          if ((t.strstart === 0 || t.strstart >= f) && (t.lookahead = t.strstart - f, t.strstart = f, I(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - X && (I(t, !1), t.strm.avail_out === 0)) return e;
+          if ((t.strstart === 0 || t.strstart >= f) && (t.lookahead = t.strstart - f, t.strstart = f, I(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - Z && (I(t, !1), t.strm.avail_out === 0)) return e;
         }
         return t.insert = 0, N === b ? (I(t, !0), t.strm.avail_out === 0 ? V : L) : (t.strstart > t.block_start && (I(t, !1), t.strm.avail_out), e);
-      }), new it(4, 4, 8, 4, ht), new it(4, 5, 16, 8, ht), new it(4, 6, 32, 32, ht), new it(4, 4, 16, 16, rt), new it(8, 16, 32, 32, rt), new it(8, 16, 128, 128, rt), new it(8, 32, 128, 256, rt), new it(32, 128, 258, 1024, rt), new it(32, 258, 258, 4096, rt)], v.deflateInit = function(t, N) {
-        return gt(t, N, m, 15, 8, 0);
-      }, v.deflateInit2 = gt, v.deflateReset = _t, v.deflateResetKeep = ot, v.deflateSetHeader = function(t, N) {
+      }), new it(4, 4, 8, 4, ft), new it(4, 5, 16, 8, ft), new it(4, 6, 32, 32, ft), new it(4, 4, 16, 16, rt), new it(8, 16, 32, 32, rt), new it(8, 16, 128, 128, rt), new it(8, 32, 128, 256, rt), new it(32, 128, 258, 1024, rt), new it(32, 258, 258, 4096, rt)], v.deflateInit = function(t, N) {
+        return _t(t, N, m, 15, 8, 0);
+      }, v.deflateInit2 = _t, v.deflateReset = bt, v.deflateResetKeep = ot, v.deflateSetHeader = function(t, N) {
         return t && t.state ? t.state.wrap !== 2 ? d : (t.state.gzhead = N, i) : d;
       }, v.deflate = function(t, N) {
         var R, f, u, k;
         if (!t || !t.state || 5 < N || N < 0) return t ? Q(t, d) : d;
         if (f = t.state, !t.output || !t.input && t.avail_in !== 0 || f.status === 666 && N !== b) return Q(t, t.avail_out === 0 ? -5 : d);
-        if (f.strm = t, R = f.last_flush, f.last_flush = N, f.status === h) if (f.wrap === 2) t.adler = 0, J(f, 31), J(f, 139), J(f, 8), f.gzhead ? (J(f, (f.gzhead.text ? 1 : 0) + (f.gzhead.hcrc ? 2 : 0) + (f.gzhead.extra ? 4 : 0) + (f.gzhead.name ? 8 : 0) + (f.gzhead.comment ? 16 : 0)), J(f, 255 & f.gzhead.time), J(f, f.gzhead.time >> 8 & 255), J(f, f.gzhead.time >> 16 & 255), J(f, f.gzhead.time >> 24 & 255), J(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), J(f, 255 & f.gzhead.os), f.gzhead.extra && f.gzhead.extra.length && (J(f, 255 & f.gzhead.extra.length), J(f, f.gzhead.extra.length >> 8 & 255)), f.gzhead.hcrc && (t.adler = g(t.adler, f.pending_buf, f.pending, 0)), f.gzindex = 0, f.status = 69) : (J(f, 0), J(f, 0), J(f, 0), J(f, 0), J(f, 0), J(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), J(f, 3), f.status = T);
+        if (f.strm = t, R = f.last_flush, f.last_flush = N, f.status === h) if (f.wrap === 2) t.adler = 0, J(f, 31), J(f, 139), J(f, 8), f.gzhead ? (J(f, (f.gzhead.text ? 1 : 0) + (f.gzhead.hcrc ? 2 : 0) + (f.gzhead.extra ? 4 : 0) + (f.gzhead.name ? 8 : 0) + (f.gzhead.comment ? 16 : 0)), J(f, 255 & f.gzhead.time), J(f, f.gzhead.time >> 8 & 255), J(f, f.gzhead.time >> 16 & 255), J(f, f.gzhead.time >> 24 & 255), J(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), J(f, 255 & f.gzhead.os), f.gzhead.extra && f.gzhead.extra.length && (J(f, 255 & f.gzhead.extra.length), J(f, f.gzhead.extra.length >> 8 & 255)), f.gzhead.hcrc && (t.adler = g(t.adler, f.pending_buf, f.pending, 0)), f.gzindex = 0, f.status = 69) : (J(f, 0), J(f, 0), J(f, 0), J(f, 0), J(f, 0), J(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), J(f, 3), f.status = B);
         else {
           var U = m + (f.w_bits - 8 << 4) << 8;
-          U |= (2 <= f.strategy || f.level < 2 ? 0 : f.level < 6 ? 1 : f.level === 6 ? 2 : 3) << 6, f.strstart !== 0 && (U |= 32), U += 31 - U % 31, f.status = T, $(f, U), f.strstart !== 0 && ($(f, t.adler >>> 16), $(f, 65535 & t.adler)), t.adler = 1;
+          U |= (2 <= f.strategy || f.level < 2 ? 0 : f.level < 6 ? 1 : f.level === 6 ? 2 : 3) << 6, f.strstart !== 0 && (U |= 32), U += 31 - U % 31, f.status = B, q(f, U), f.strstart !== 0 && (q(f, t.adler >>> 16), q(f, 65535 & t.adler)), t.adler = 1;
         }
         if (f.status === 69) if (f.gzhead.extra) {
-          for (u = f.pending; f.gzindex < (65535 & f.gzhead.extra.length) && (f.pending !== f.pending_buf_size || (f.gzhead.hcrc && f.pending > u && (t.adler = g(t.adler, f.pending_buf, f.pending - u, u)), B(t), u = f.pending, f.pending !== f.pending_buf_size)); ) J(f, 255 & f.gzhead.extra[f.gzindex]), f.gzindex++;
+          for (u = f.pending; f.gzindex < (65535 & f.gzhead.extra.length) && (f.pending !== f.pending_buf_size || (f.gzhead.hcrc && f.pending > u && (t.adler = g(t.adler, f.pending_buf, f.pending - u, u)), T(t), u = f.pending, f.pending !== f.pending_buf_size)); ) J(f, 255 & f.gzhead.extra[f.gzindex]), f.gzindex++;
           f.gzhead.hcrc && f.pending > u && (t.adler = g(t.adler, f.pending_buf, f.pending - u, u)), f.gzindex === f.gzhead.extra.length && (f.gzindex = 0, f.status = 73);
         } else f.status = 73;
         if (f.status === 73) if (f.gzhead.name) {
           u = f.pending;
           do {
-            if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > u && (t.adler = g(t.adler, f.pending_buf, f.pending - u, u)), B(t), u = f.pending, f.pending === f.pending_buf_size)) {
+            if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > u && (t.adler = g(t.adler, f.pending_buf, f.pending - u, u)), T(t), u = f.pending, f.pending === f.pending_buf_size)) {
               k = 1;
               break;
             }
@@ -1522,7 +1522,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (f.status === 91) if (f.gzhead.comment) {
           u = f.pending;
           do {
-            if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > u && (t.adler = g(t.adler, f.pending_buf, f.pending - u, u)), B(t), u = f.pending, f.pending === f.pending_buf_size)) {
+            if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > u && (t.adler = g(t.adler, f.pending_buf, f.pending - u, u)), T(t), u = f.pending, f.pending === f.pending_buf_size)) {
               k = 1;
               break;
             }
@@ -1530,52 +1530,52 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           } while (k !== 0);
           f.gzhead.hcrc && f.pending > u && (t.adler = g(t.adler, f.pending_buf, f.pending - u, u)), k === 0 && (f.status = 103);
         } else f.status = 103;
-        if (f.status === 103 && (f.gzhead.hcrc ? (f.pending + 2 > f.pending_buf_size && B(t), f.pending + 2 <= f.pending_buf_size && (J(f, 255 & t.adler), J(f, t.adler >> 8 & 255), t.adler = 0, f.status = T)) : f.status = T), f.pending !== 0) {
-          if (B(t), t.avail_out === 0) return f.last_flush = -1, i;
+        if (f.status === 103 && (f.gzhead.hcrc ? (f.pending + 2 > f.pending_buf_size && T(t), f.pending + 2 <= f.pending_buf_size && (J(f, 255 & t.adler), J(f, t.adler >> 8 & 255), t.adler = 0, f.status = B)) : f.status = B), f.pending !== 0) {
+          if (T(t), t.avail_out === 0) return f.last_flush = -1, i;
         } else if (t.avail_in === 0 && W(N) <= W(R) && N !== b) return Q(t, -5);
         if (f.status === 666 && t.avail_in !== 0) return Q(t, -5);
         if (t.avail_in !== 0 || f.lookahead !== 0 || N !== _ && f.status !== 666) {
           var j = f.strategy === 2 ? function(O, M) {
-            for (var Y; ; ) {
+            for (var $; ; ) {
               if (O.lookahead === 0 && (st(O), O.lookahead === 0)) {
                 if (M === _) return e;
                 break;
               }
-              if (O.match_length = 0, Y = r._tr_tally(O, 0, O.window[O.strstart]), O.lookahead--, O.strstart++, Y && (I(O, !1), O.strm.avail_out === 0)) return e;
+              if (O.match_length = 0, $ = r._tr_tally(O, 0, O.window[O.strstart]), O.lookahead--, O.strstart++, $ && (I(O, !1), O.strm.avail_out === 0)) return e;
             }
             return O.insert = 0, M === b ? (I(O, !0), O.strm.avail_out === 0 ? V : L) : O.last_lit && (I(O, !1), O.strm.avail_out === 0) ? e : P;
           }(f, N) : f.strategy === 3 ? function(O, M) {
-            for (var Y, H, q, at, nt = O.window; ; ) {
+            for (var $, H, Y, at, nt = O.window; ; ) {
               if (O.lookahead <= z) {
                 if (st(O), O.lookahead <= z && M === _) return e;
                 if (O.lookahead === 0) break;
               }
-              if (O.match_length = 0, O.lookahead >= C && 0 < O.strstart && (H = nt[q = O.strstart - 1]) === nt[++q] && H === nt[++q] && H === nt[++q]) {
+              if (O.match_length = 0, O.lookahead >= E && 0 < O.strstart && (H = nt[Y = O.strstart - 1]) === nt[++Y] && H === nt[++Y] && H === nt[++Y]) {
                 at = O.strstart + z;
                 do
                   ;
-                while (H === nt[++q] && H === nt[++q] && H === nt[++q] && H === nt[++q] && H === nt[++q] && H === nt[++q] && H === nt[++q] && H === nt[++q] && q < at);
-                O.match_length = z - (at - q), O.match_length > O.lookahead && (O.match_length = O.lookahead);
+                while (H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && Y < at);
+                O.match_length = z - (at - Y), O.match_length > O.lookahead && (O.match_length = O.lookahead);
               }
-              if (O.match_length >= C ? (Y = r._tr_tally(O, 1, O.match_length - C), O.lookahead -= O.match_length, O.strstart += O.match_length, O.match_length = 0) : (Y = r._tr_tally(O, 0, O.window[O.strstart]), O.lookahead--, O.strstart++), Y && (I(O, !1), O.strm.avail_out === 0)) return e;
+              if (O.match_length >= E ? ($ = r._tr_tally(O, 1, O.match_length - E), O.lookahead -= O.match_length, O.strstart += O.match_length, O.match_length = 0) : ($ = r._tr_tally(O, 0, O.window[O.strstart]), O.lookahead--, O.strstart++), $ && (I(O, !1), O.strm.avail_out === 0)) return e;
             }
             return O.insert = 0, M === b ? (I(O, !0), O.strm.avail_out === 0 ? V : L) : O.last_lit && (I(O, !1), O.strm.avail_out === 0) ? e : P;
           }(f, N) : a[f.level].func(f, N);
           if (j !== V && j !== L || (f.status = 666), j === e || j === V) return t.avail_out === 0 && (f.last_flush = -1), i;
-          if (j === P && (N === 1 ? r._tr_align(f) : N !== 5 && (r._tr_stored_block(f, 0, 0, !1), N === 3 && (tt(f.head), f.lookahead === 0 && (f.strstart = 0, f.block_start = 0, f.insert = 0))), B(t), t.avail_out === 0)) return f.last_flush = -1, i;
+          if (j === P && (N === 1 ? r._tr_align(f) : N !== 5 && (r._tr_stored_block(f, 0, 0, !1), N === 3 && (tt(f.head), f.lookahead === 0 && (f.strstart = 0, f.block_start = 0, f.insert = 0))), T(t), t.avail_out === 0)) return f.last_flush = -1, i;
         }
-        return N !== b ? i : f.wrap <= 0 ? 1 : (f.wrap === 2 ? (J(f, 255 & t.adler), J(f, t.adler >> 8 & 255), J(f, t.adler >> 16 & 255), J(f, t.adler >> 24 & 255), J(f, 255 & t.total_in), J(f, t.total_in >> 8 & 255), J(f, t.total_in >> 16 & 255), J(f, t.total_in >> 24 & 255)) : ($(f, t.adler >>> 16), $(f, 65535 & t.adler)), B(t), 0 < f.wrap && (f.wrap = -f.wrap), f.pending !== 0 ? i : 1);
+        return N !== b ? i : f.wrap <= 0 ? 1 : (f.wrap === 2 ? (J(f, 255 & t.adler), J(f, t.adler >> 8 & 255), J(f, t.adler >> 16 & 255), J(f, t.adler >> 24 & 255), J(f, 255 & t.total_in), J(f, t.total_in >> 8 & 255), J(f, t.total_in >> 16 & 255), J(f, t.total_in >> 24 & 255)) : (q(f, t.adler >>> 16), q(f, 65535 & t.adler)), T(t), 0 < f.wrap && (f.wrap = -f.wrap), f.pending !== 0 ? i : 1);
       }, v.deflateEnd = function(t) {
         var N;
-        return t && t.state ? (N = t.state.status) !== h && N !== 69 && N !== 73 && N !== 91 && N !== 103 && N !== T && N !== 666 ? Q(t, d) : (t.state = null, N === T ? Q(t, -3) : i) : d;
+        return t && t.state ? (N = t.state.status) !== h && N !== 69 && N !== 73 && N !== 91 && N !== 103 && N !== B && N !== 666 ? Q(t, d) : (t.state = null, N === B ? Q(t, -3) : i) : d;
       }, v.deflateSetDictionary = function(t, N) {
-        var R, f, u, k, U, j, O, M, Y = N.length;
+        var R, f, u, k, U, j, O, M, $ = N.length;
         if (!t || !t.state || (k = (R = t.state).wrap) === 2 || k === 1 && R.status !== h || R.lookahead) return d;
-        for (k === 1 && (t.adler = l(t.adler, N, Y, 0)), R.wrap = 0, Y >= R.w_size && (k === 0 && (tt(R.head), R.strstart = 0, R.block_start = 0, R.insert = 0), M = new o.Buf8(R.w_size), o.arraySet(M, N, Y - R.w_size, R.w_size, 0), N = M, Y = R.w_size), U = t.avail_in, j = t.next_in, O = t.input, t.avail_in = Y, t.next_in = 0, t.input = N, st(R); R.lookahead >= C; ) {
-          for (f = R.strstart, u = R.lookahead - (C - 1); R.ins_h = (R.ins_h << R.hash_shift ^ R.window[f + C - 1]) & R.hash_mask, R.prev[f & R.w_mask] = R.head[R.ins_h], R.head[R.ins_h] = f, f++, --u; ) ;
-          R.strstart = f, R.lookahead = C - 1, st(R);
+        for (k === 1 && (t.adler = l(t.adler, N, $, 0)), R.wrap = 0, $ >= R.w_size && (k === 0 && (tt(R.head), R.strstart = 0, R.block_start = 0, R.insert = 0), M = new o.Buf8(R.w_size), o.arraySet(M, N, $ - R.w_size, R.w_size, 0), N = M, $ = R.w_size), U = t.avail_in, j = t.next_in, O = t.input, t.avail_in = $, t.next_in = 0, t.input = N, st(R); R.lookahead >= E; ) {
+          for (f = R.strstart, u = R.lookahead - (E - 1); R.ins_h = (R.ins_h << R.hash_shift ^ R.window[f + E - 1]) & R.hash_mask, R.prev[f & R.w_mask] = R.head[R.ins_h], R.head[R.ins_h] = f, f++, --u; ) ;
+          R.strstart = f, R.lookahead = E - 1, st(R);
         }
-        return R.strstart += R.lookahead, R.block_start = R.strstart, R.insert = R.lookahead, R.lookahead = 0, R.match_length = R.prev_length = C - 1, R.match_available = 0, t.next_in = j, t.input = O, t.avail_in = U, R.wrap = k, i;
+        return R.strstart += R.lookahead, R.block_start = R.strstart, R.insert = R.lookahead, R.lookahead = 0, R.match_length = R.prev_length = E - 1, R.match_available = 0, t.next_in = j, t.input = O, t.avail_in = U, R.wrap = k, i;
       }, v.deflateInfo = "pako deflate (from Nodeca project)";
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(p, A, v) {
       A.exports = function() {
@@ -1583,65 +1583,65 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       };
     }, {}], 48: [function(p, A, v) {
       A.exports = function(a, o) {
-        var r, l, g, y, _, b, i, d, n, c, s, m, w, x, S, F, E, D, C, z, X, h, T, e, P;
-        r = a.state, l = a.next_in, e = a.input, g = l + (a.avail_in - 5), y = a.next_out, P = a.output, _ = y - (o - a.avail_out), b = y + (a.avail_out - 257), i = r.dmax, d = r.wsize, n = r.whave, c = r.wnext, s = r.window, m = r.hold, w = r.bits, x = r.lencode, S = r.distcode, F = (1 << r.lenbits) - 1, E = (1 << r.distbits) - 1;
+        var r, l, g, y, _, b, i, d, n, c, s, m, w, x, S, D, C, F, E, z, Z, h, B, e, P;
+        r = a.state, l = a.next_in, e = a.input, g = l + (a.avail_in - 5), y = a.next_out, P = a.output, _ = y - (o - a.avail_out), b = y + (a.avail_out - 257), i = r.dmax, d = r.wsize, n = r.whave, c = r.wnext, s = r.window, m = r.hold, w = r.bits, x = r.lencode, S = r.distcode, D = (1 << r.lenbits) - 1, C = (1 << r.distbits) - 1;
         t: do {
-          w < 15 && (m += e[l++] << w, w += 8, m += e[l++] << w, w += 8), D = x[m & F];
+          w < 15 && (m += e[l++] << w, w += 8, m += e[l++] << w, w += 8), F = x[m & D];
           e: for (; ; ) {
-            if (m >>>= C = D >>> 24, w -= C, (C = D >>> 16 & 255) === 0) P[y++] = 65535 & D;
+            if (m >>>= E = F >>> 24, w -= E, (E = F >>> 16 & 255) === 0) P[y++] = 65535 & F;
             else {
-              if (!(16 & C)) {
-                if (!(64 & C)) {
-                  D = x[(65535 & D) + (m & (1 << C) - 1)];
+              if (!(16 & E)) {
+                if (!(64 & E)) {
+                  F = x[(65535 & F) + (m & (1 << E) - 1)];
                   continue e;
                 }
-                if (32 & C) {
+                if (32 & E) {
                   r.mode = 12;
                   break t;
                 }
                 a.msg = "invalid literal/length code", r.mode = 30;
                 break t;
               }
-              z = 65535 & D, (C &= 15) && (w < C && (m += e[l++] << w, w += 8), z += m & (1 << C) - 1, m >>>= C, w -= C), w < 15 && (m += e[l++] << w, w += 8, m += e[l++] << w, w += 8), D = S[m & E];
+              z = 65535 & F, (E &= 15) && (w < E && (m += e[l++] << w, w += 8), z += m & (1 << E) - 1, m >>>= E, w -= E), w < 15 && (m += e[l++] << w, w += 8, m += e[l++] << w, w += 8), F = S[m & C];
               r: for (; ; ) {
-                if (m >>>= C = D >>> 24, w -= C, !(16 & (C = D >>> 16 & 255))) {
-                  if (!(64 & C)) {
-                    D = S[(65535 & D) + (m & (1 << C) - 1)];
+                if (m >>>= E = F >>> 24, w -= E, !(16 & (E = F >>> 16 & 255))) {
+                  if (!(64 & E)) {
+                    F = S[(65535 & F) + (m & (1 << E) - 1)];
                     continue r;
                   }
                   a.msg = "invalid distance code", r.mode = 30;
                   break t;
                 }
-                if (X = 65535 & D, w < (C &= 15) && (m += e[l++] << w, (w += 8) < C && (m += e[l++] << w, w += 8)), i < (X += m & (1 << C) - 1)) {
+                if (Z = 65535 & F, w < (E &= 15) && (m += e[l++] << w, (w += 8) < E && (m += e[l++] << w, w += 8)), i < (Z += m & (1 << E) - 1)) {
                   a.msg = "invalid distance too far back", r.mode = 30;
                   break t;
                 }
-                if (m >>>= C, w -= C, (C = y - _) < X) {
-                  if (n < (C = X - C) && r.sane) {
+                if (m >>>= E, w -= E, (E = y - _) < Z) {
+                  if (n < (E = Z - E) && r.sane) {
                     a.msg = "invalid distance too far back", r.mode = 30;
                     break t;
                   }
-                  if (T = s, (h = 0) === c) {
-                    if (h += d - C, C < z) {
-                      for (z -= C; P[y++] = s[h++], --C; ) ;
-                      h = y - X, T = P;
+                  if (B = s, (h = 0) === c) {
+                    if (h += d - E, E < z) {
+                      for (z -= E; P[y++] = s[h++], --E; ) ;
+                      h = y - Z, B = P;
                     }
-                  } else if (c < C) {
-                    if (h += d + c - C, (C -= c) < z) {
-                      for (z -= C; P[y++] = s[h++], --C; ) ;
+                  } else if (c < E) {
+                    if (h += d + c - E, (E -= c) < z) {
+                      for (z -= E; P[y++] = s[h++], --E; ) ;
                       if (h = 0, c < z) {
-                        for (z -= C = c; P[y++] = s[h++], --C; ) ;
-                        h = y - X, T = P;
+                        for (z -= E = c; P[y++] = s[h++], --E; ) ;
+                        h = y - Z, B = P;
                       }
                     }
-                  } else if (h += c - C, C < z) {
-                    for (z -= C; P[y++] = s[h++], --C; ) ;
-                    h = y - X, T = P;
+                  } else if (h += c - E, E < z) {
+                    for (z -= E; P[y++] = s[h++], --E; ) ;
+                    h = y - Z, B = P;
                   }
-                  for (; 2 < z; ) P[y++] = T[h++], P[y++] = T[h++], P[y++] = T[h++], z -= 3;
-                  z && (P[y++] = T[h++], 1 < z && (P[y++] = T[h++]));
+                  for (; 2 < z; ) P[y++] = B[h++], P[y++] = B[h++], P[y++] = B[h++], z -= 3;
+                  z && (P[y++] = B[h++], 1 < z && (P[y++] = B[h++]));
                 } else {
-                  for (h = y - X; P[y++] = P[h++], P[y++] = P[h++], P[y++] = P[h++], 2 < (z -= 3); ) ;
+                  for (h = y - Z; P[y++] = P[h++], P[y++] = P[h++], P[y++] = P[h++], 2 < (z -= 3); ) ;
                   z && (P[y++] = P[h++], 1 < z && (P[y++] = P[h++]));
                 }
                 break;
@@ -1661,44 +1661,44 @@ 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 a.Buf16(320), this.work = new a.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
       }
       function w(h) {
-        var T;
-        return h && h.state ? (T = h.state, h.total_in = h.total_out = T.total = 0, h.msg = "", T.wrap && (h.adler = 1 & T.wrap), T.mode = d, T.last = 0, T.havedict = 0, T.dmax = 32768, T.head = null, T.hold = 0, T.bits = 0, T.lencode = T.lendyn = new a.Buf32(n), T.distcode = T.distdyn = new a.Buf32(c), T.sane = 1, T.back = -1, b) : i;
+        var B;
+        return h && h.state ? (B = h.state, h.total_in = h.total_out = B.total = 0, h.msg = "", B.wrap && (h.adler = 1 & B.wrap), B.mode = d, B.last = 0, B.havedict = 0, B.dmax = 32768, B.head = null, B.hold = 0, B.bits = 0, B.lencode = B.lendyn = new a.Buf32(n), B.distcode = B.distdyn = new a.Buf32(c), B.sane = 1, B.back = -1, b) : i;
       }
       function x(h) {
-        var T;
-        return h && h.state ? ((T = h.state).wsize = 0, T.whave = 0, T.wnext = 0, w(h)) : i;
+        var B;
+        return h && h.state ? ((B = h.state).wsize = 0, B.whave = 0, B.wnext = 0, w(h)) : i;
       }
-      function S(h, T) {
+      function S(h, B) {
         var e, P;
-        return h && h.state ? (P = h.state, T < 0 ? (e = 0, T = -T) : (e = 1 + (T >> 4), T < 48 && (T &= 15)), T && (T < 8 || 15 < T) ? i : (P.window !== null && P.wbits !== T && (P.window = null), P.wrap = e, P.wbits = T, x(h))) : i;
+        return h && h.state ? (P = h.state, B < 0 ? (e = 0, B = -B) : (e = 1 + (B >> 4), B < 48 && (B &= 15)), B && (B < 8 || 15 < B) ? i : (P.window !== null && P.wbits !== B && (P.window = null), P.wrap = e, P.wbits = B, x(h))) : i;
       }
-      function F(h, T) {
+      function D(h, B) {
         var e, P;
-        return h ? (P = new m(), (h.state = P).window = null, (e = S(h, T)) !== b && (h.state = null), e) : i;
+        return h ? (P = new m(), (h.state = P).window = null, (e = S(h, B)) !== b && (h.state = null), e) : i;
       }
-      var E, D, C = !0;
+      var C, F, E = !0;
       function z(h) {
-        if (C) {
-          var T;
-          for (E = new a.Buf32(512), D = new a.Buf32(32), T = 0; T < 144; ) h.lens[T++] = 8;
-          for (; T < 256; ) h.lens[T++] = 9;
-          for (; T < 280; ) h.lens[T++] = 7;
-          for (; T < 288; ) h.lens[T++] = 8;
-          for (g(y, h.lens, 0, 288, E, 0, h.work, { bits: 9 }), T = 0; T < 32; ) h.lens[T++] = 5;
-          g(_, h.lens, 0, 32, D, 0, h.work, { bits: 5 }), C = !1;
+        if (E) {
+          var B;
+          for (C = new a.Buf32(512), F = new a.Buf32(32), B = 0; B < 144; ) h.lens[B++] = 8;
+          for (; B < 256; ) h.lens[B++] = 9;
+          for (; B < 280; ) h.lens[B++] = 7;
+          for (; B < 288; ) h.lens[B++] = 8;
+          for (g(y, h.lens, 0, 288, C, 0, h.work, { bits: 9 }), B = 0; B < 32; ) h.lens[B++] = 5;
+          g(_, h.lens, 0, 32, F, 0, h.work, { bits: 5 }), E = !1;
         }
-        h.lencode = E, h.lenbits = 9, h.distcode = D, h.distbits = 5;
+        h.lencode = C, h.lenbits = 9, h.distcode = F, h.distbits = 5;
       }
-      function X(h, T, e, P) {
+      function Z(h, B, e, P) {
         var V, L = h.state;
-        return L.window === null && (L.wsize = 1 << L.wbits, L.wnext = 0, L.whave = 0, L.window = new a.Buf8(L.wsize)), P >= L.wsize ? (a.arraySet(L.window, T, e - L.wsize, L.wsize, 0), L.wnext = 0, L.whave = L.wsize) : (P < (V = L.wsize - L.wnext) && (V = P), a.arraySet(L.window, T, e - P, V, L.wnext), (P -= V) ? (a.arraySet(L.window, T, e - P, P, 0), L.wnext = P, L.whave = L.wsize) : (L.wnext += V, L.wnext === L.wsize && (L.wnext = 0), L.whave < L.wsize && (L.whave += V))), 0;
+        return L.window === null && (L.wsize = 1 << L.wbits, L.wnext = 0, L.whave = 0, L.window = new a.Buf8(L.wsize)), P >= L.wsize ? (a.arraySet(L.window, B, e - L.wsize, L.wsize, 0), L.wnext = 0, L.whave = L.wsize) : (P < (V = L.wsize - L.wnext) && (V = P), a.arraySet(L.window, B, e - P, V, L.wnext), (P -= V) ? (a.arraySet(L.window, B, e - P, P, 0), L.wnext = P, L.whave = L.wsize) : (L.wnext += V, L.wnext === L.wsize && (L.wnext = 0), L.whave < L.wsize && (L.whave += V))), 0;
       }
       v.inflateReset = x, v.inflateReset2 = S, v.inflateResetKeep = w, v.inflateInit = function(h) {
-        return F(h, 15);
-      }, v.inflateInit2 = F, v.inflate = function(h, T) {
-        var e, P, V, L, Q, W, tt, B, I, J, $, G, st, ht, rt, it, ct, ot, _t, gt, t, N, R, f, u = 0, k = new a.Buf8(4), U = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+        return D(h, 15);
+      }, v.inflateInit2 = D, v.inflate = function(h, B) {
+        var e, P, V, L, Q, W, tt, T, I, J, q, G, st, ft, rt, it, ct, ot, bt, _t, t, N, R, f, u = 0, k = new a.Buf8(4), U = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
         if (!h || !h.state || !h.output || !h.input && h.avail_in !== 0) return i;
-        (e = h.state).mode === 12 && (e.mode = 13), Q = h.next_out, V = h.output, tt = h.avail_out, L = h.next_in, P = h.input, W = h.avail_in, B = e.hold, I = e.bits, J = W, $ = tt, N = b;
+        (e = h.state).mode === 12 && (e.mode = 13), Q = h.next_out, V = h.output, tt = h.avail_out, L = h.next_in, P = h.input, W = h.avail_in, T = e.hold, I = e.bits, J = W, q = tt, N = b;
         t: for (; ; ) switch (e.mode) {
           case d:
             if (e.wrap === 0) {
@@ -1707,33 +1707,33 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             }
             for (; I < 16; ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
-            if (2 & e.wrap && B === 35615) {
-              k[e.check = 0] = 255 & B, k[1] = B >>> 8 & 255, e.check = r(e.check, k, 2, 0), I = B = 0, e.mode = 2;
+            if (2 & e.wrap && T === 35615) {
+              k[e.check = 0] = 255 & T, k[1] = T >>> 8 & 255, e.check = r(e.check, k, 2, 0), I = T = 0, e.mode = 2;
               break;
             }
-            if (e.flags = 0, e.head && (e.head.done = !1), !(1 & e.wrap) || (((255 & B) << 8) + (B >> 8)) % 31) {
+            if (e.flags = 0, e.head && (e.head.done = !1), !(1 & e.wrap) || (((255 & T) << 8) + (T >> 8)) % 31) {
               h.msg = "incorrect header check", e.mode = 30;
               break;
             }
-            if ((15 & B) != 8) {
+            if ((15 & T) != 8) {
               h.msg = "unknown compression method", e.mode = 30;
               break;
             }
-            if (I -= 4, t = 8 + (15 & (B >>>= 4)), e.wbits === 0) e.wbits = t;
+            if (I -= 4, t = 8 + (15 & (T >>>= 4)), e.wbits === 0) e.wbits = t;
             else if (t > e.wbits) {
               h.msg = "invalid window size", e.mode = 30;
               break;
             }
-            e.dmax = 1 << t, h.adler = e.check = 1, e.mode = 512 & B ? 10 : 12, I = B = 0;
+            e.dmax = 1 << t, h.adler = e.check = 1, e.mode = 512 & T ? 10 : 12, I = T = 0;
             break;
           case 2:
             for (; I < 16; ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
-            if (e.flags = B, (255 & e.flags) != 8) {
+            if (e.flags = T, (255 & e.flags) != 8) {
               h.msg = "unknown compression method", e.mode = 30;
               break;
             }
@@ -1741,26 +1741,26 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               h.msg = "unknown header flags set", e.mode = 30;
               break;
             }
-            e.head && (e.head.text = B >> 8 & 1), 512 & e.flags && (k[0] = 255 & B, k[1] = B >>> 8 & 255, e.check = r(e.check, k, 2, 0)), I = B = 0, e.mode = 3;
+            e.head && (e.head.text = T >> 8 & 1), 512 & e.flags && (k[0] = 255 & T, k[1] = T >>> 8 & 255, e.check = r(e.check, k, 2, 0)), I = T = 0, e.mode = 3;
           case 3:
             for (; I < 32; ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
-            e.head && (e.head.time = B), 512 & e.flags && (k[0] = 255 & B, k[1] = B >>> 8 & 255, k[2] = B >>> 16 & 255, k[3] = B >>> 24 & 255, e.check = r(e.check, k, 4, 0)), I = B = 0, e.mode = 4;
+            e.head && (e.head.time = T), 512 & e.flags && (k[0] = 255 & T, k[1] = T >>> 8 & 255, k[2] = T >>> 16 & 255, k[3] = T >>> 24 & 255, e.check = r(e.check, k, 4, 0)), I = T = 0, e.mode = 4;
           case 4:
             for (; I < 16; ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
-            e.head && (e.head.xflags = 255 & B, e.head.os = B >> 8), 512 & e.flags && (k[0] = 255 & B, k[1] = B >>> 8 & 255, e.check = r(e.check, k, 2, 0)), I = B = 0, e.mode = 5;
+            e.head && (e.head.xflags = 255 & T, e.head.os = T >> 8), 512 & e.flags && (k[0] = 255 & T, k[1] = T >>> 8 & 255, e.check = r(e.check, k, 2, 0)), I = T = 0, e.mode = 5;
           case 5:
             if (1024 & e.flags) {
               for (; I < 16; ) {
                 if (W === 0) break t;
-                W--, B += P[L++] << I, I += 8;
+                W--, T += P[L++] << I, I += 8;
               }
-              e.length = B, e.head && (e.head.extra_len = B), 512 & e.flags && (k[0] = 255 & B, k[1] = B >>> 8 & 255, e.check = r(e.check, k, 2, 0)), I = B = 0;
+              e.length = T, e.head && (e.head.extra_len = T), 512 & e.flags && (k[0] = 255 & T, k[1] = T >>> 8 & 255, e.check = r(e.check, k, 2, 0)), I = T = 0;
             } else e.head && (e.head.extra = null);
             e.mode = 6;
           case 6:
@@ -1784,43 +1784,43 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             if (512 & e.flags) {
               for (; I < 16; ) {
                 if (W === 0) break t;
-                W--, B += P[L++] << I, I += 8;
+                W--, T += P[L++] << I, I += 8;
               }
-              if (B !== (65535 & e.check)) {
+              if (T !== (65535 & e.check)) {
                 h.msg = "header crc mismatch", e.mode = 30;
                 break;
               }
-              I = B = 0;
+              I = T = 0;
             }
             e.head && (e.head.hcrc = e.flags >> 9 & 1, e.head.done = !0), h.adler = e.check = 0, e.mode = 12;
             break;
           case 10:
             for (; I < 32; ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
-            h.adler = e.check = s(B), I = B = 0, e.mode = 11;
+            h.adler = e.check = s(T), I = T = 0, e.mode = 11;
           case 11:
-            if (e.havedict === 0) return h.next_out = Q, h.avail_out = tt, h.next_in = L, h.avail_in = W, e.hold = B, e.bits = I, 2;
+            if (e.havedict === 0) return h.next_out = Q, h.avail_out = tt, h.next_in = L, h.avail_in = W, e.hold = T, e.bits = I, 2;
             h.adler = e.check = 1, e.mode = 12;
           case 12:
-            if (T === 5 || T === 6) break t;
+            if (B === 5 || B === 6) break t;
           case 13:
             if (e.last) {
-              B >>>= 7 & I, I -= 7 & I, e.mode = 27;
+              T >>>= 7 & I, I -= 7 & I, e.mode = 27;
               break;
             }
             for (; I < 3; ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
-            switch (e.last = 1 & B, I -= 1, 3 & (B >>>= 1)) {
+            switch (e.last = 1 & T, I -= 1, 3 & (T >>>= 1)) {
               case 0:
                 e.mode = 14;
                 break;
               case 1:
-                if (z(e), e.mode = 20, T !== 6) break;
-                B >>>= 2, I -= 2;
+                if (z(e), e.mode = 20, B !== 6) break;
+                T >>>= 2, I -= 2;
                 break t;
               case 2:
                 e.mode = 17;
@@ -1828,18 +1828,18 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               case 3:
                 h.msg = "invalid block type", e.mode = 30;
             }
-            B >>>= 2, I -= 2;
+            T >>>= 2, I -= 2;
             break;
           case 14:
-            for (B >>>= 7 & I, I -= 7 & I; I < 32; ) {
+            for (T >>>= 7 & I, I -= 7 & I; I < 32; ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
-            if ((65535 & B) != (B >>> 16 ^ 65535)) {
+            if ((65535 & T) != (T >>> 16 ^ 65535)) {
               h.msg = "invalid stored block lengths", e.mode = 30;
               break;
             }
-            if (e.length = 65535 & B, I = B = 0, e.mode = 15, T === 6) break t;
+            if (e.length = 65535 & T, I = T = 0, e.mode = 15, B === 6) break t;
           case 15:
             e.mode = 16;
           case 16:
@@ -1853,9 +1853,9 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           case 17:
             for (; I < 14; ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
-            if (e.nlen = 257 + (31 & B), B >>>= 5, I -= 5, e.ndist = 1 + (31 & B), B >>>= 5, I -= 5, e.ncode = 4 + (15 & B), B >>>= 4, I -= 4, 286 < e.nlen || 30 < e.ndist) {
+            if (e.nlen = 257 + (31 & T), T >>>= 5, I -= 5, e.ndist = 1 + (31 & T), T >>>= 5, I -= 5, e.ncode = 4 + (15 & T), T >>>= 4, I -= 4, 286 < e.nlen || 30 < e.ndist) {
               h.msg = "too many length or distance symbols", e.mode = 30;
               break;
             }
@@ -1864,9 +1864,9 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             for (; e.have < e.ncode; ) {
               for (; I < 3; ) {
                 if (W === 0) break t;
-                W--, B += P[L++] << I, I += 8;
+                W--, T += P[L++] << I, I += 8;
               }
-              e.lens[U[e.have++]] = 7 & B, B >>>= 3, I -= 3;
+              e.lens[U[e.have++]] = 7 & T, T >>>= 3, I -= 3;
             }
             for (; e.have < 19; ) e.lens[U[e.have++]] = 0;
             if (e.lencode = e.lendyn, e.lenbits = 7, R = { bits: e.lenbits }, N = g(0, e.lens, 0, 19, e.lencode, 0, e.work, R), e.lenbits = R.bits, N) {
@@ -1876,34 +1876,34 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             e.have = 0, e.mode = 19;
           case 19:
             for (; e.have < e.nlen + e.ndist; ) {
-              for (; it = (u = e.lencode[B & (1 << e.lenbits) - 1]) >>> 16 & 255, ct = 65535 & u, !((rt = u >>> 24) <= I); ) {
+              for (; it = (u = e.lencode[T & (1 << e.lenbits) - 1]) >>> 16 & 255, ct = 65535 & u, !((rt = u >>> 24) <= I); ) {
                 if (W === 0) break t;
-                W--, B += P[L++] << I, I += 8;
+                W--, T += P[L++] << I, I += 8;
               }
-              if (ct < 16) B >>>= rt, I -= rt, e.lens[e.have++] = ct;
+              if (ct < 16) T >>>= rt, I -= rt, e.lens[e.have++] = ct;
               else {
                 if (ct === 16) {
                   for (f = rt + 2; I < f; ) {
                     if (W === 0) break t;
-                    W--, B += P[L++] << I, I += 8;
+                    W--, T += P[L++] << I, I += 8;
                   }
-                  if (B >>>= rt, I -= rt, e.have === 0) {
+                  if (T >>>= rt, I -= rt, e.have === 0) {
                     h.msg = "invalid bit length repeat", e.mode = 30;
                     break;
                   }
-                  t = e.lens[e.have - 1], G = 3 + (3 & B), B >>>= 2, I -= 2;
+                  t = e.lens[e.have - 1], G = 3 + (3 & T), T >>>= 2, I -= 2;
                 } else if (ct === 17) {
                   for (f = rt + 3; I < f; ) {
                     if (W === 0) break t;
-                    W--, B += P[L++] << I, I += 8;
+                    W--, T += P[L++] << I, I += 8;
                   }
-                  I -= rt, t = 0, G = 3 + (7 & (B >>>= rt)), B >>>= 3, I -= 3;
+                  I -= rt, t = 0, G = 3 + (7 & (T >>>= rt)), T >>>= 3, I -= 3;
                 } else {
                   for (f = rt + 7; I < f; ) {
                     if (W === 0) break t;
-                    W--, B += P[L++] << I, I += 8;
+                    W--, T += P[L++] << I, I += 8;
                   }
-                  I -= rt, t = 0, G = 11 + (127 & (B >>>= rt)), B >>>= 7, I -= 7;
+                  I -= rt, t = 0, G = 11 + (127 & (T >>>= rt)), T >>>= 7, I -= 7;
                 }
                 if (e.have + G > e.nlen + e.ndist) {
                   h.msg = "invalid bit length repeat", e.mode = 30;
@@ -1925,26 +1925,26 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               h.msg = "invalid distances set", e.mode = 30;
               break;
             }
-            if (e.mode = 20, T === 6) break t;
+            if (e.mode = 20, B === 6) break t;
           case 20:
             e.mode = 21;
           case 21:
             if (6 <= W && 258 <= tt) {
-              h.next_out = Q, h.avail_out = tt, h.next_in = L, h.avail_in = W, e.hold = B, e.bits = I, l(h, $), Q = h.next_out, V = h.output, tt = h.avail_out, L = h.next_in, P = h.input, W = h.avail_in, B = e.hold, I = e.bits, e.mode === 12 && (e.back = -1);
+              h.next_out = Q, h.avail_out = tt, h.next_in = L, h.avail_in = W, e.hold = T, e.bits = I, l(h, q), Q = h.next_out, V = h.output, tt = h.avail_out, L = h.next_in, P = h.input, W = h.avail_in, T = e.hold, I = e.bits, e.mode === 12 && (e.back = -1);
               break;
             }
-            for (e.back = 0; it = (u = e.lencode[B & (1 << e.lenbits) - 1]) >>> 16 & 255, ct = 65535 & u, !((rt = u >>> 24) <= I); ) {
+            for (e.back = 0; it = (u = e.lencode[T & (1 << e.lenbits) - 1]) >>> 16 & 255, ct = 65535 & u, !((rt = u >>> 24) <= I); ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
             if (it && !(240 & it)) {
-              for (ot = rt, _t = it, gt = ct; it = (u = e.lencode[gt + ((B & (1 << ot + _t) - 1) >> ot)]) >>> 16 & 255, ct = 65535 & u, !(ot + (rt = u >>> 24) <= I); ) {
+              for (ot = rt, bt = it, _t = ct; it = (u = e.lencode[_t + ((T & (1 << ot + bt) - 1) >> ot)]) >>> 16 & 255, ct = 65535 & u, !(ot + (rt = u >>> 24) <= I); ) {
                 if (W === 0) break t;
-                W--, B += P[L++] << I, I += 8;
+                W--, T += P[L++] << I, I += 8;
               }
-              B >>>= ot, I -= ot, e.back += ot;
+              T >>>= ot, I -= ot, e.back += ot;
             }
-            if (B >>>= rt, I -= rt, e.back += rt, e.length = ct, it === 0) {
+            if (T >>>= rt, I -= rt, e.back += rt, e.length = ct, it === 0) {
               e.mode = 26;
               break;
             }
@@ -1961,24 +1961,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             if (e.extra) {
               for (f = e.extra; I < f; ) {
                 if (W === 0) break t;
-                W--, B += P[L++] << I, I += 8;
+                W--, T += P[L++] << I, I += 8;
               }
-              e.length += B & (1 << e.extra) - 1, B >>>= e.extra, I -= e.extra, e.back += e.extra;
+              e.length += T & (1 << e.extra) - 1, T >>>= e.extra, I -= e.extra, e.back += e.extra;
             }
             e.was = e.length, e.mode = 23;
           case 23:
-            for (; it = (u = e.distcode[B & (1 << e.distbits) - 1]) >>> 16 & 255, ct = 65535 & u, !((rt = u >>> 24) <= I); ) {
+            for (; it = (u = e.distcode[T & (1 << e.distbits) - 1]) >>> 16 & 255, ct = 65535 & u, !((rt = u >>> 24) <= I); ) {
               if (W === 0) break t;
-              W--, B += P[L++] << I, I += 8;
+              W--, T += P[L++] << I, I += 8;
             }
             if (!(240 & it)) {
-              for (ot = rt, _t = it, gt = ct; it = (u = e.distcode[gt + ((B & (1 << ot + _t) - 1) >> ot)]) >>> 16 & 255, ct = 65535 & u, !(ot + (rt = u >>> 24) <= I); ) {
+              for (ot = rt, bt = it, _t = ct; it = (u = e.distcode[_t + ((T & (1 << ot + bt) - 1) >> ot)]) >>> 16 & 255, ct = 65535 & u, !(ot + (rt = u >>> 24) <= I); ) {
                 if (W === 0) break t;
-                W--, B += P[L++] << I, I += 8;
+                W--, T += P[L++] << I, I += 8;
               }
-              B >>>= ot, I -= ot, e.back += ot;
+              T >>>= ot, I -= ot, e.back += ot;
             }
-            if (B >>>= rt, I -= rt, e.back += rt, 64 & it) {
+            if (T >>>= rt, I -= rt, e.back += rt, 64 & it) {
               h.msg = "invalid distance code", e.mode = 30;
               break;
             }
@@ -1987,9 +1987,9 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             if (e.extra) {
               for (f = e.extra; I < f; ) {
                 if (W === 0) break t;
-                W--, B += P[L++] << I, I += 8;
+                W--, T += P[L++] << I, I += 8;
               }
-              e.offset += B & (1 << e.extra) - 1, B >>>= e.extra, I -= e.extra, e.back += e.extra;
+              e.offset += T & (1 << e.extra) - 1, T >>>= e.extra, I -= e.extra, e.back += e.extra;
             }
             if (e.offset > e.dmax) {
               h.msg = "invalid distance too far back", e.mode = 30;
@@ -1998,14 +1998,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             e.mode = 25;
           case 25:
             if (tt === 0) break t;
-            if (G = $ - tt, e.offset > G) {
+            if (G = q - tt, e.offset > G) {
               if ((G = e.offset - G) > e.whave && e.sane) {
                 h.msg = "invalid distance too far back", e.mode = 30;
                 break;
               }
-              st = G > e.wnext ? (G -= e.wnext, e.wsize - G) : e.wnext - G, G > e.length && (G = e.length), ht = e.window;
-            } else ht = V, st = Q - e.offset, G = e.length;
-            for (tt < G && (G = tt), tt -= G, e.length -= G; V[Q++] = ht[st++], --G; ) ;
+              st = G > e.wnext ? (G -= e.wnext, e.wsize - G) : e.wnext - G, G > e.length && (G = e.length), ft = e.window;
+            } else ft = V, st = Q - e.offset, G = e.length;
+            for (tt < G && (G = tt), tt -= G, e.length -= G; V[Q++] = ft[st++], --G; ) ;
             e.length === 0 && (e.mode = 21);
             break;
           case 26:
@@ -2016,26 +2016,26 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             if (e.wrap) {
               for (; I < 32; ) {
                 if (W === 0) break t;
-                W--, B |= P[L++] << I, I += 8;
+                W--, T |= P[L++] << I, I += 8;
               }
-              if ($ -= tt, h.total_out += $, e.total += $, $ && (h.adler = e.check = e.flags ? r(e.check, V, $, Q - $) : o(e.check, V, $, Q - $)), $ = tt, (e.flags ? B : s(B)) !== e.check) {
+              if (q -= tt, h.total_out += q, e.total += q, q && (h.adler = e.check = e.flags ? r(e.check, V, q, Q - q) : o(e.check, V, q, Q - q)), q = tt, (e.flags ? T : s(T)) !== e.check) {
                 h.msg = "incorrect data check", e.mode = 30;
                 break;
               }
-              I = B = 0;
+              I = T = 0;
             }
             e.mode = 28;
           case 28:
             if (e.wrap && e.flags) {
               for (; I < 32; ) {
                 if (W === 0) break t;
-                W--, B += P[L++] << I, I += 8;
+                W--, T += P[L++] << I, I += 8;
               }
-              if (B !== (4294967295 & e.total)) {
+              if (T !== (4294967295 & e.total)) {
                 h.msg = "incorrect length check", e.mode = 30;
                 break;
               }
-              I = B = 0;
+              I = T = 0;
             }
             e.mode = 29;
           case 29:
@@ -2050,46 +2050,46 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           default:
             return i;
         }
-        return h.next_out = Q, h.avail_out = tt, h.next_in = L, h.avail_in = W, e.hold = B, e.bits = I, (e.wsize || $ !== h.avail_out && e.mode < 30 && (e.mode < 27 || T !== 4)) && X(h, h.output, h.next_out, $ - h.avail_out) ? (e.mode = 31, -4) : (J -= h.avail_in, $ -= h.avail_out, h.total_in += J, h.total_out += $, e.total += $, e.wrap && $ && (h.adler = e.check = e.flags ? r(e.check, V, $, h.next_out - $) : o(e.check, V, $, h.next_out - $)), h.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (J == 0 && $ === 0 || T === 4) && N === b && (N = -5), N);
+        return h.next_out = Q, h.avail_out = tt, h.next_in = L, h.avail_in = W, e.hold = T, e.bits = I, (e.wsize || q !== h.avail_out && e.mode < 30 && (e.mode < 27 || B !== 4)) && Z(h, h.output, h.next_out, q - h.avail_out) ? (e.mode = 31, -4) : (J -= h.avail_in, q -= h.avail_out, h.total_in += J, h.total_out += q, e.total += q, e.wrap && q && (h.adler = e.check = e.flags ? r(e.check, V, q, h.next_out - q) : o(e.check, V, q, h.next_out - q)), h.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (J == 0 && q === 0 || B === 4) && N === b && (N = -5), N);
       }, v.inflateEnd = function(h) {
         if (!h || !h.state) return i;
-        var T = h.state;
-        return T.window && (T.window = null), h.state = null, b;
-      }, v.inflateGetHeader = function(h, T) {
+        var B = h.state;
+        return B.window && (B.window = null), h.state = null, b;
+      }, v.inflateGetHeader = function(h, B) {
         var e;
-        return h && h.state && 2 & (e = h.state).wrap ? ((e.head = T).done = !1, b) : i;
-      }, v.inflateSetDictionary = function(h, T) {
-        var e, P = T.length;
-        return h && h.state ? (e = h.state).wrap !== 0 && e.mode !== 11 ? i : e.mode === 11 && o(1, T, P, 0) !== e.check ? -3 : X(h, T, P, P) ? (e.mode = 31, -4) : (e.havedict = 1, b) : i;
+        return h && h.state && 2 & (e = h.state).wrap ? ((e.head = B).done = !1, b) : i;
+      }, v.inflateSetDictionary = function(h, B) {
+        var e, P = B.length;
+        return h && h.state ? (e = h.state).wrap !== 0 && e.mode !== 11 ? i : e.mode === 11 && o(1, B, P, 0) !== e.check ? -3 : Z(h, B, P, P) ? (e.mode = 31, -4) : (e.havedict = 1, b) : i;
       }, v.inflateInfo = "pako inflate (from Nodeca project)";
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(p, A, v) {
       var a = p("../utils/common"), o = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0], r = [16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78], l = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0], g = [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];
       A.exports = function(y, _, b, i, d, n, c, s) {
-        var m, w, x, S, F, E, D, C, z, X = s.bits, h = 0, T = 0, e = 0, P = 0, V = 0, L = 0, Q = 0, W = 0, tt = 0, B = 0, I = null, J = 0, $ = new a.Buf16(16), G = new a.Buf16(16), st = null, ht = 0;
-        for (h = 0; h <= 15; h++) $[h] = 0;
-        for (T = 0; T < i; T++) $[_[b + T]]++;
-        for (V = X, P = 15; 1 <= P && $[P] === 0; P--) ;
+        var m, w, x, S, D, C, F, E, z, Z = s.bits, h = 0, B = 0, e = 0, P = 0, V = 0, L = 0, Q = 0, W = 0, tt = 0, T = 0, I = null, J = 0, q = new a.Buf16(16), G = new a.Buf16(16), st = null, ft = 0;
+        for (h = 0; h <= 15; h++) q[h] = 0;
+        for (B = 0; B < i; B++) q[_[b + B]]++;
+        for (V = Z, P = 15; 1 <= P && q[P] === 0; P--) ;
         if (P < V && (V = P), P === 0) return d[n++] = 20971520, d[n++] = 20971520, s.bits = 1, 0;
-        for (e = 1; e < P && $[e] === 0; e++) ;
-        for (V < e && (V = e), h = W = 1; h <= 15; h++) if (W <<= 1, (W -= $[h]) < 0) return -1;
+        for (e = 1; e < P && q[e] === 0; e++) ;
+        for (V < e && (V = e), h = W = 1; h <= 15; h++) if (W <<= 1, (W -= q[h]) < 0) return -1;
         if (0 < W && (y === 0 || P !== 1)) return -1;
-        for (G[1] = 0, h = 1; h < 15; h++) G[h + 1] = G[h] + $[h];
-        for (T = 0; T < i; T++) _[b + T] !== 0 && (c[G[_[b + T]]++] = T);
-        if (E = y === 0 ? (I = st = c, 19) : y === 1 ? (I = o, J -= 257, st = r, ht -= 257, 256) : (I = l, st = g, -1), h = e, F = n, Q = T = B = 0, x = -1, S = (tt = 1 << (L = V)) - 1, y === 1 && 852 < tt || y === 2 && 592 < tt) return 1;
+        for (G[1] = 0, h = 1; h < 15; h++) G[h + 1] = G[h] + q[h];
+        for (B = 0; B < i; B++) _[b + B] !== 0 && (c[G[_[b + B]]++] = B);
+        if (C = y === 0 ? (I = st = c, 19) : y === 1 ? (I = o, J -= 257, st = r, ft -= 257, 256) : (I = l, st = g, -1), h = e, D = n, Q = B = T = 0, x = -1, S = (tt = 1 << (L = V)) - 1, y === 1 && 852 < tt || y === 2 && 592 < tt) return 1;
         for (; ; ) {
-          for (D = h - Q, z = c[T] < E ? (C = 0, c[T]) : c[T] > E ? (C = st[ht + c[T]], I[J + c[T]]) : (C = 96, 0), m = 1 << h - Q, e = w = 1 << L; d[F + (B >> Q) + (w -= m)] = D << 24 | C << 16 | z | 0, w !== 0; ) ;
-          for (m = 1 << h - 1; B & m; ) m >>= 1;
-          if (m !== 0 ? (B &= m - 1, B += m) : B = 0, T++, --$[h] == 0) {
+          for (F = h - Q, z = c[B] < C ? (E = 0, c[B]) : c[B] > C ? (E = st[ft + c[B]], I[J + c[B]]) : (E = 96, 0), m = 1 << h - Q, e = w = 1 << L; d[D + (T >> Q) + (w -= m)] = F << 24 | E << 16 | z | 0, w !== 0; ) ;
+          for (m = 1 << h - 1; T & m; ) m >>= 1;
+          if (m !== 0 ? (T &= m - 1, T += m) : T = 0, B++, --q[h] == 0) {
             if (h === P) break;
-            h = _[b + c[T]];
+            h = _[b + c[B]];
           }
-          if (V < h && (B & S) !== x) {
-            for (Q === 0 && (Q = V), F += e, W = 1 << (L = h - Q); L + Q < P && !((W -= $[L + Q]) <= 0); ) L++, W <<= 1;
+          if (V < h && (T & S) !== x) {
+            for (Q === 0 && (Q = V), D += e, W = 1 << (L = h - Q); L + Q < P && !((W -= q[L + Q]) <= 0); ) L++, W <<= 1;
             if (tt += 1 << L, y === 1 && 852 < tt || y === 2 && 592 < tt) return 1;
-            d[x = B & S] = V << 24 | L << 16 | F - n | 0;
+            d[x = T & S] = V << 24 | L << 16 | D - n | 0;
           }
         }
-        return B !== 0 && (d[F + B] = h - Q << 24 | 64 << 16 | 0), s.bits = V, 0;
+        return T !== 0 && (d[D + T] = h - Q << 24 | 64 << 16 | 0), s.bits = V, 0;
       };
     }, { "../utils/common": 41 }], 51: [function(p, A, v) {
       A.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" };
@@ -2098,12 +2098,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function l(u) {
         for (var k = u.length; 0 <= --k; ) u[k] = 0;
       }
-      var g = 0, y = 29, _ = 256, b = _ + 1 + y, i = 30, d = 19, n = 2 * b + 1, c = 15, s = 16, m = 7, w = 256, x = 16, S = 17, F = 18, E = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], D = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], C = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], z = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], X = new Array(2 * (b + 2));
-      l(X);
+      var g = 0, y = 29, _ = 256, b = _ + 1 + y, i = 30, d = 19, n = 2 * b + 1, c = 15, s = 16, m = 7, w = 256, x = 16, S = 17, D = 18, C = [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], F = [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], E = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], z = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Z = new Array(2 * (b + 2));
+      l(Z);
       var h = new Array(2 * i);
       l(h);
-      var T = new Array(512);
-      l(T);
+      var B = new Array(512);
+      l(B);
       var e = new Array(256);
       l(e);
       var P = new Array(y);
@@ -2112,28 +2112,28 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function tt(u, k, U, j, O) {
         this.static_tree = u, this.extra_bits = k, this.extra_base = U, this.elems = j, this.max_length = O, this.has_stree = u && u.length;
       }
-      function B(u, k) {
+      function T(u, k) {
         this.dyn_tree = u, this.max_code = 0, this.stat_desc = k;
       }
       function I(u) {
-        return u < 256 ? T[u] : T[256 + (u >>> 7)];
+        return u < 256 ? B[u] : B[256 + (u >>> 7)];
       }
       function J(u, k) {
         u.pending_buf[u.pending++] = 255 & k, u.pending_buf[u.pending++] = k >>> 8 & 255;
       }
-      function $(u, k, U) {
+      function q(u, k, U) {
         u.bi_valid > s - U ? (u.bi_buf |= k << u.bi_valid & 65535, J(u, u.bi_buf), u.bi_buf = k >> s - u.bi_valid, u.bi_valid += U - s) : (u.bi_buf |= k << u.bi_valid & 65535, u.bi_valid += U);
       }
       function G(u, k, U) {
-        $(u, U[2 * k], U[2 * k + 1]);
+        q(u, U[2 * k], U[2 * k + 1]);
       }
       function st(u, k) {
         for (var U = 0; U |= 1 & u, u >>>= 1, U <<= 1, 0 < --k; ) ;
         return U >>> 1;
       }
-      function ht(u, k, U) {
-        var j, O, M = new Array(c + 1), Y = 0;
-        for (j = 1; j <= c; j++) M[j] = Y = Y + U[j - 1] << 1;
+      function ft(u, k, U) {
+        var j, O, M = new Array(c + 1), $ = 0;
+        for (j = 1; j <= c; j++) M[j] = $ = $ + U[j - 1] << 1;
         for (O = 0; O <= k; O++) {
           var H = u[2 * O + 1];
           H !== 0 && (u[2 * O] = st(M[H]++, H));
@@ -2157,84 +2157,84 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         for (var j = u.heap[U], O = U << 1; O <= u.heap_len && (O < u.heap_len && ct(k, u.heap[O + 1], u.heap[O], u.depth) && O++, !ct(k, j, u.heap[O], u.depth)); ) u.heap[U] = u.heap[O], U = O, O <<= 1;
         u.heap[U] = j;
       }
-      function _t(u, k, U) {
-        var j, O, M, Y, H = 0;
-        if (u.last_lit !== 0) for (; j = u.pending_buf[u.d_buf + 2 * H] << 8 | u.pending_buf[u.d_buf + 2 * H + 1], O = u.pending_buf[u.l_buf + H], H++, j === 0 ? G(u, O, k) : (G(u, (M = e[O]) + _ + 1, k), (Y = E[M]) !== 0 && $(u, O -= P[M], Y), G(u, M = I(--j), U), (Y = D[M]) !== 0 && $(u, j -= W[M], Y)), H < u.last_lit; ) ;
+      function bt(u, k, U) {
+        var j, O, M, $, H = 0;
+        if (u.last_lit !== 0) for (; j = u.pending_buf[u.d_buf + 2 * H] << 8 | u.pending_buf[u.d_buf + 2 * H + 1], O = u.pending_buf[u.l_buf + H], H++, j === 0 ? G(u, O, k) : (G(u, (M = e[O]) + _ + 1, k), ($ = C[M]) !== 0 && q(u, O -= P[M], $), G(u, M = I(--j), U), ($ = F[M]) !== 0 && q(u, j -= W[M], $)), H < u.last_lit; ) ;
         G(u, w, k);
       }
-      function gt(u, k) {
-        var U, j, O, M = k.dyn_tree, Y = k.stat_desc.static_tree, H = k.stat_desc.has_stree, q = k.stat_desc.elems, at = -1;
-        for (u.heap_len = 0, u.heap_max = n, U = 0; U < q; U++) M[2 * U] !== 0 ? (u.heap[++u.heap_len] = at = U, u.depth[U] = 0) : M[2 * U + 1] = 0;
-        for (; u.heap_len < 2; ) M[2 * (O = u.heap[++u.heap_len] = at < 2 ? ++at : 0)] = 1, u.depth[O] = 0, u.opt_len--, H && (u.static_len -= Y[2 * O + 1]);
+      function _t(u, k) {
+        var U, j, O, M = k.dyn_tree, $ = k.stat_desc.static_tree, H = k.stat_desc.has_stree, Y = k.stat_desc.elems, at = -1;
+        for (u.heap_len = 0, u.heap_max = n, U = 0; U < Y; U++) M[2 * U] !== 0 ? (u.heap[++u.heap_len] = at = U, u.depth[U] = 0) : M[2 * U + 1] = 0;
+        for (; u.heap_len < 2; ) M[2 * (O = u.heap[++u.heap_len] = at < 2 ? ++at : 0)] = 1, u.depth[O] = 0, u.opt_len--, H && (u.static_len -= $[2 * O + 1]);
         for (k.max_code = at, U = u.heap_len >> 1; 1 <= U; U--) ot(u, M, U);
-        for (O = q; U = u.heap[1], u.heap[1] = u.heap[u.heap_len--], ot(u, M, 1), j = u.heap[1], u.heap[--u.heap_max] = U, u.heap[--u.heap_max] = j, M[2 * O] = M[2 * U] + M[2 * j], u.depth[O] = (u.depth[U] >= u.depth[j] ? u.depth[U] : u.depth[j]) + 1, M[2 * U + 1] = M[2 * j + 1] = O, u.heap[1] = O++, ot(u, M, 1), 2 <= u.heap_len; ) ;
-        u.heap[--u.heap_max] = u.heap[1], function(nt, mt) {
-          var xt, bt, St, lt, Ct, Bt, vt = mt.dyn_tree, Rt = mt.max_code, Mt = mt.stat_desc.static_tree, Zt = mt.stat_desc.has_stree, Xt = mt.stat_desc.extra_bits, Pt = mt.stat_desc.extra_base, Et = mt.stat_desc.max_length, zt = 0;
+        for (O = Y; U = u.heap[1], u.heap[1] = u.heap[u.heap_len--], ot(u, M, 1), j = u.heap[1], u.heap[--u.heap_max] = U, u.heap[--u.heap_max] = j, M[2 * O] = M[2 * U] + M[2 * j], u.depth[O] = (u.depth[U] >= u.depth[j] ? u.depth[U] : u.depth[j]) + 1, M[2 * U + 1] = M[2 * j + 1] = O, u.heap[1] = O++, ot(u, M, 1), 2 <= u.heap_len; ) ;
+        u.heap[--u.heap_max] = u.heap[1], function(nt, gt) {
+          var St, vt, Et, lt, zt, Rt, yt = gt.dyn_tree, Pt = gt.max_code, Mt = gt.stat_desc.static_tree, Zt = gt.stat_desc.has_stree, Ht = gt.stat_desc.extra_bits, Ft = gt.stat_desc.extra_base, Ct = gt.stat_desc.max_length, At = 0;
           for (lt = 0; lt <= c; lt++) nt.bl_count[lt] = 0;
-          for (vt[2 * nt.heap[nt.heap_max] + 1] = 0, xt = nt.heap_max + 1; xt < n; xt++) Et < (lt = vt[2 * vt[2 * (bt = nt.heap[xt]) + 1] + 1] + 1) && (lt = Et, zt++), vt[2 * bt + 1] = lt, Rt < bt || (nt.bl_count[lt]++, Ct = 0, Pt <= bt && (Ct = Xt[bt - Pt]), Bt = vt[2 * bt], nt.opt_len += Bt * (lt + Ct), Zt && (nt.static_len += Bt * (Mt[2 * bt + 1] + Ct)));
-          if (zt !== 0) {
+          for (yt[2 * nt.heap[nt.heap_max] + 1] = 0, St = nt.heap_max + 1; St < n; St++) Ct < (lt = yt[2 * yt[2 * (vt = nt.heap[St]) + 1] + 1] + 1) && (lt = Ct, At++), yt[2 * vt + 1] = lt, Pt < vt || (nt.bl_count[lt]++, zt = 0, Ft <= vt && (zt = Ht[vt - Ft]), Rt = yt[2 * vt], nt.opt_len += Rt * (lt + zt), Zt && (nt.static_len += Rt * (Mt[2 * vt + 1] + zt)));
+          if (At !== 0) {
             do {
-              for (lt = Et - 1; nt.bl_count[lt] === 0; ) lt--;
-              nt.bl_count[lt]--, nt.bl_count[lt + 1] += 2, nt.bl_count[Et]--, zt -= 2;
-            } while (0 < zt);
-            for (lt = Et; lt !== 0; lt--) for (bt = nt.bl_count[lt]; bt !== 0; ) Rt < (St = nt.heap[--xt]) || (vt[2 * St + 1] !== lt && (nt.opt_len += (lt - vt[2 * St + 1]) * vt[2 * St], vt[2 * St + 1] = lt), bt--);
+              for (lt = Ct - 1; nt.bl_count[lt] === 0; ) lt--;
+              nt.bl_count[lt]--, nt.bl_count[lt + 1] += 2, nt.bl_count[Ct]--, At -= 2;
+            } while (0 < At);
+            for (lt = Ct; lt !== 0; lt--) for (vt = nt.bl_count[lt]; vt !== 0; ) Pt < (Et = nt.heap[--St]) || (yt[2 * Et + 1] !== lt && (nt.opt_len += (lt - yt[2 * Et + 1]) * yt[2 * Et], yt[2 * Et + 1] = lt), vt--);
           }
-        }(u, k), ht(M, at, u.bl_count);
+        }(u, k), ft(M, at, u.bl_count);
       }
       function t(u, k, U) {
-        var j, O, M = -1, Y = k[1], H = 0, q = 7, at = 4;
-        for (Y === 0 && (q = 138, at = 3), k[2 * (U + 1) + 1] = 65535, j = 0; j <= U; j++) O = Y, Y = k[2 * (j + 1) + 1], ++H < q && O === Y || (H < at ? u.bl_tree[2 * O] += H : O !== 0 ? (O !== M && u.bl_tree[2 * O]++, u.bl_tree[2 * x]++) : H <= 10 ? u.bl_tree[2 * S]++ : u.bl_tree[2 * F]++, M = O, at = (H = 0) === Y ? (q = 138, 3) : O === Y ? (q = 6, 3) : (q = 7, 4));
+        var j, O, M = -1, $ = k[1], H = 0, Y = 7, at = 4;
+        for ($ === 0 && (Y = 138, at = 3), k[2 * (U + 1) + 1] = 65535, j = 0; j <= U; j++) O = $, $ = k[2 * (j + 1) + 1], ++H < Y && O === $ || (H < at ? u.bl_tree[2 * O] += H : O !== 0 ? (O !== M && u.bl_tree[2 * O]++, u.bl_tree[2 * x]++) : H <= 10 ? u.bl_tree[2 * S]++ : u.bl_tree[2 * D]++, M = O, at = (H = 0) === $ ? (Y = 138, 3) : O === $ ? (Y = 6, 3) : (Y = 7, 4));
       }
       function N(u, k, U) {
-        var j, O, M = -1, Y = k[1], H = 0, q = 7, at = 4;
-        for (Y === 0 && (q = 138, at = 3), j = 0; j <= U; j++) if (O = Y, Y = k[2 * (j + 1) + 1], !(++H < q && O === Y)) {
+        var j, O, M = -1, $ = k[1], H = 0, Y = 7, at = 4;
+        for ($ === 0 && (Y = 138, at = 3), j = 0; j <= U; j++) if (O = $, $ = k[2 * (j + 1) + 1], !(++H < Y && O === $)) {
           if (H < at) for (; G(u, O, u.bl_tree), --H != 0; ) ;
-          else O !== 0 ? (O !== M && (G(u, O, u.bl_tree), H--), G(u, x, u.bl_tree), $(u, H - 3, 2)) : H <= 10 ? (G(u, S, u.bl_tree), $(u, H - 3, 3)) : (G(u, F, u.bl_tree), $(u, H - 11, 7));
-          M = O, at = (H = 0) === Y ? (q = 138, 3) : O === Y ? (q = 6, 3) : (q = 7, 4);
+          else O !== 0 ? (O !== M && (G(u, O, u.bl_tree), H--), G(u, x, u.bl_tree), q(u, H - 3, 2)) : H <= 10 ? (G(u, S, u.bl_tree), q(u, H - 3, 3)) : (G(u, D, u.bl_tree), q(u, H - 11, 7));
+          M = O, at = (H = 0) === $ ? (Y = 138, 3) : O === $ ? (Y = 6, 3) : (Y = 7, 4);
         }
       }
       l(W);
       var R = !1;
       function f(u, k, U, j) {
-        $(u, (g << 1) + (j ? 1 : 0), 3), function(O, M, Y, H) {
-          it(O), J(O, Y), J(O, ~Y), a.arraySet(O.pending_buf, O.window, M, Y, O.pending), O.pending += Y;
+        q(u, (g << 1) + (j ? 1 : 0), 3), function(O, M, $, H) {
+          it(O), J(O, $), J(O, ~$), a.arraySet(O.pending_buf, O.window, M, $, O.pending), O.pending += $;
         }(u, k, U);
       }
       v._tr_init = function(u) {
         R || (function() {
-          var k, U, j, O, M, Y = new Array(c + 1);
-          for (O = j = 0; O < y - 1; O++) for (P[O] = j, k = 0; k < 1 << E[O]; k++) e[j++] = O;
-          for (e[j - 1] = O, O = M = 0; O < 16; O++) for (W[O] = M, k = 0; k < 1 << D[O]; k++) T[M++] = O;
-          for (M >>= 7; O < i; O++) for (W[O] = M << 7, k = 0; k < 1 << D[O] - 7; k++) T[256 + M++] = O;
-          for (U = 0; U <= c; U++) Y[U] = 0;
-          for (k = 0; k <= 143; ) X[2 * k + 1] = 8, k++, Y[8]++;
-          for (; k <= 255; ) X[2 * k + 1] = 9, k++, Y[9]++;
-          for (; k <= 279; ) X[2 * k + 1] = 7, k++, Y[7]++;
-          for (; k <= 287; ) X[2 * k + 1] = 8, k++, Y[8]++;
-          for (ht(X, b + 1, Y), k = 0; k < i; k++) h[2 * k + 1] = 5, h[2 * k] = st(k, 5);
-          V = new tt(X, E, _ + 1, b, c), L = new tt(h, D, 0, i, c), Q = new tt(new Array(0), C, 0, d, m);
-        }(), R = !0), u.l_desc = new B(u.dyn_ltree, V), u.d_desc = new B(u.dyn_dtree, L), u.bl_desc = new B(u.bl_tree, Q), u.bi_buf = 0, u.bi_valid = 0, rt(u);
+          var k, U, j, O, M, $ = new Array(c + 1);
+          for (O = j = 0; O < y - 1; O++) for (P[O] = j, k = 0; k < 1 << C[O]; k++) e[j++] = O;
+          for (e[j - 1] = O, O = M = 0; O < 16; O++) for (W[O] = M, k = 0; k < 1 << F[O]; k++) B[M++] = O;
+          for (M >>= 7; O < i; O++) for (W[O] = M << 7, k = 0; k < 1 << F[O] - 7; k++) B[256 + M++] = O;
+          for (U = 0; U <= c; U++) $[U] = 0;
+          for (k = 0; k <= 143; ) Z[2 * k + 1] = 8, k++, $[8]++;
+          for (; k <= 255; ) Z[2 * k + 1] = 9, k++, $[9]++;
+          for (; k <= 279; ) Z[2 * k + 1] = 7, k++, $[7]++;
+          for (; k <= 287; ) Z[2 * k + 1] = 8, k++, $[8]++;
+          for (ft(Z, b + 1, $), k = 0; k < i; k++) h[2 * k + 1] = 5, h[2 * k] = st(k, 5);
+          V = new tt(Z, C, _ + 1, b, c), L = new tt(h, F, 0, i, c), Q = new tt(new Array(0), E, 0, d, m);
+        }(), R = !0), u.l_desc = new T(u.dyn_ltree, V), u.d_desc = new T(u.dyn_dtree, L), u.bl_desc = new T(u.bl_tree, Q), u.bi_buf = 0, u.bi_valid = 0, rt(u);
       }, v._tr_stored_block = f, v._tr_flush_block = function(u, k, U, j) {
-        var O, M, Y = 0;
+        var O, M, $ = 0;
         0 < u.level ? (u.strm.data_type === 2 && (u.strm.data_type = function(H) {
-          var q, at = 4093624447;
-          for (q = 0; q <= 31; q++, at >>>= 1) if (1 & at && H.dyn_ltree[2 * q] !== 0) return o;
+          var Y, at = 4093624447;
+          for (Y = 0; Y <= 31; Y++, at >>>= 1) if (1 & at && H.dyn_ltree[2 * Y] !== 0) return o;
           if (H.dyn_ltree[18] !== 0 || H.dyn_ltree[20] !== 0 || H.dyn_ltree[26] !== 0) return r;
-          for (q = 32; q < _; q++) if (H.dyn_ltree[2 * q] !== 0) return r;
+          for (Y = 32; Y < _; Y++) if (H.dyn_ltree[2 * Y] !== 0) return r;
           return o;
-        }(u)), gt(u, u.l_desc), gt(u, u.d_desc), Y = function(H) {
-          var q;
-          for (t(H, H.dyn_ltree, H.l_desc.max_code), t(H, H.dyn_dtree, H.d_desc.max_code), gt(H, H.bl_desc), q = d - 1; 3 <= q && H.bl_tree[2 * z[q] + 1] === 0; q--) ;
-          return H.opt_len += 3 * (q + 1) + 5 + 5 + 4, q;
-        }(u), O = u.opt_len + 3 + 7 >>> 3, (M = u.static_len + 3 + 7 >>> 3) <= O && (O = M)) : O = M = U + 5, U + 4 <= O && k !== -1 ? f(u, k, U, j) : u.strategy === 4 || M === O ? ($(u, 2 + (j ? 1 : 0), 3), _t(u, X, h)) : ($(u, 4 + (j ? 1 : 0), 3), function(H, q, at, nt) {
-          var mt;
-          for ($(H, q - 257, 5), $(H, at - 1, 5), $(H, nt - 4, 4), mt = 0; mt < nt; mt++) $(H, H.bl_tree[2 * z[mt] + 1], 3);
-          N(H, H.dyn_ltree, q - 1), N(H, H.dyn_dtree, at - 1);
-        }(u, u.l_desc.max_code + 1, u.d_desc.max_code + 1, Y + 1), _t(u, u.dyn_ltree, u.dyn_dtree)), rt(u), j && it(u);
+        }(u)), _t(u, u.l_desc), _t(u, u.d_desc), $ = function(H) {
+          var Y;
+          for (t(H, H.dyn_ltree, H.l_desc.max_code), t(H, H.dyn_dtree, H.d_desc.max_code), _t(H, H.bl_desc), Y = d - 1; 3 <= Y && H.bl_tree[2 * z[Y] + 1] === 0; Y--) ;
+          return H.opt_len += 3 * (Y + 1) + 5 + 5 + 4, Y;
+        }(u), O = u.opt_len + 3 + 7 >>> 3, (M = u.static_len + 3 + 7 >>> 3) <= O && (O = M)) : O = M = U + 5, U + 4 <= O && k !== -1 ? f(u, k, U, j) : u.strategy === 4 || M === O ? (q(u, 2 + (j ? 1 : 0), 3), bt(u, Z, h)) : (q(u, 4 + (j ? 1 : 0), 3), function(H, Y, at, nt) {
+          var gt;
+          for (q(H, Y - 257, 5), q(H, at - 1, 5), q(H, nt - 4, 4), gt = 0; gt < nt; gt++) q(H, H.bl_tree[2 * z[gt] + 1], 3);
+          N(H, H.dyn_ltree, Y - 1), N(H, H.dyn_dtree, at - 1);
+        }(u, u.l_desc.max_code + 1, u.d_desc.max_code + 1, $ + 1), bt(u, u.dyn_ltree, u.dyn_dtree)), rt(u), j && it(u);
       }, v._tr_tally = function(u, k, U) {
         return u.pending_buf[u.d_buf + 2 * u.last_lit] = k >>> 8 & 255, u.pending_buf[u.d_buf + 2 * u.last_lit + 1] = 255 & k, u.pending_buf[u.l_buf + u.last_lit] = 255 & U, u.last_lit++, k === 0 ? u.dyn_ltree[2 * U]++ : (u.matches++, k--, u.dyn_ltree[2 * (e[U] + _ + 1)]++, u.dyn_dtree[2 * I(k)]++), u.last_lit === u.lit_bufsize - 1;
       }, v._tr_align = function(u) {
-        $(u, 2, 3), G(u, w, X), function(k) {
+        q(u, 2, 3), G(u, w, Z), function(k) {
           k.bi_valid === 16 ? (J(k, k.bi_buf), k.bi_buf = 0, k.bi_valid = 0) : 8 <= k.bi_valid && (k.pending_buf[k.pending++] = 255 & k.bi_buf, k.bi_buf >>= 8, k.bi_valid -= 8);
         }(u);
       };
@@ -2273,9 +2273,9 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               setTimeout(m, 0, x);
             }, c.setImmediate = function(x) {
               typeof x != "function" && (x = new Function("" + x));
-              for (var S = new Array(arguments.length - 1), F = 0; F < S.length; F++) S[F] = arguments[F + 1];
-              var E = { callback: x, args: S };
-              return i[b] = E, l(b), b++;
+              for (var S = new Array(arguments.length - 1), D = 0; D < S.length; D++) S[D] = arguments[D + 1];
+              var C = { callback: x, args: S };
+              return i[b] = C, l(b), b++;
             }, c.clearImmediate = s;
           }
           function s(x) {
@@ -2288,23 +2288,23 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               if (S) {
                 d = !0;
                 try {
-                  (function(F) {
-                    var E = F.callback, D = F.args;
-                    switch (D.length) {
+                  (function(D) {
+                    var C = D.callback, F = D.args;
+                    switch (F.length) {
                       case 0:
-                        E();
+                        C();
                         break;
                       case 1:
-                        E(D[0]);
+                        C(F[0]);
                         break;
                       case 2:
-                        E(D[0], D[1]);
+                        C(F[0], F[1]);
                         break;
                       case 3:
-                        E(D[0], D[1], D[2]);
+                        C(F[0], F[1], F[2]);
                         break;
                       default:
-                        E.apply(r, D);
+                        C.apply(r, F);
                     }
                   })(S);
                 } finally {
@@ -2317,42 +2317,42 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             x.source === o && typeof x.data == "string" && x.data.indexOf(_) === 0 && m(+x.data.slice(_.length));
           }
         })(typeof self > "u" ? a === void 0 ? this : a : self);
-      }).call(this, typeof At < "u" ? At : typeof self < "u" ? self : typeof window < "u" ? window : {});
+      }).call(this, typeof Ot < "u" ? Ot : typeof self < "u" ? self : typeof window < "u" ? window : {});
     }, {}] }, {}, [10])(10);
   });
 })(jt);
 var Vt = jt.exports;
-const Kt = /* @__PURE__ */ Yt(Vt);
-function qt() {
-  const [Z, K] = ft(""), [p, A] = ft(!1), [v, a] = ft(""), [o, r] = ft(null);
+const Kt = /* @__PURE__ */ $t(Vt);
+function Yt() {
+  const [X, K] = ht(""), [p, A] = ht(!1), [v, a] = ht(""), [o, r] = ht(null);
   let l = "", g = "";
-  const y = yt(null), _ = yt(null), b = {}, i = [
+  const y = wt(null), _ = wt(null), b = {}, i = [
     "text/html",
     "text/xml",
     "application/xml",
     "application/xhtml+xml",
     "image/svg+xml"
   ], d = Tt(
-    async (C) => {
+    async (E) => {
       A(!0), K(""), a("Loading..."), r(null), _.current && (document.head.removeChild(_.current), URL.revokeObjectURL(_.current.href), _.current = null);
       try {
         let z;
-        if (typeof C == "string") {
-          const X = await fetch(C);
-          if (!X.ok)
+        if (typeof E == "string") {
+          const Z = await fetch(E);
+          if (!Z.ok)
             throw new Error(
-              `HTTP error! status: ${X.status} ${X.statusText}`
+              `HTTP error! status: ${Z.status} ${Z.statusText}`
             );
-          z = await X.arrayBuffer();
-        } else C instanceof File ? z = await C.arrayBuffer() : z = C;
+          z = await Z.arrayBuffer();
+        } else E instanceof File ? z = await E.arrayBuffer() : z = E;
         if (!z || z.byteLength === 0)
           throw new Error(
             "EPUB source is empty or could not be read."
           );
         y.current = await Kt.loadAsync(z), await n();
       } catch (z) {
-        const X = z instanceof Error ? z.message : "An unknown error occurred while fetching or loading the EPUB.";
-        console.error("Error processing EPUB source:", z), r(X), K(""), a(""), A(!1);
+        const Z = z instanceof Error ? z.message : "An unknown error occurred while fetching or loading the EPUB.";
+        console.error("Error processing EPUB source:", z), r(Z), K(""), a(""), A(!1);
       }
     },
     // eslint-disable-next-line
@@ -2363,45 +2363,45 @@ function qt() {
     const z = y.current.file("META-INF/container.xml");
     if (!z)
       throw new Error("META-INF/container.xml not found.");
-    const X = await z.async("text"), h = c(X);
+    const Z = await z.async("text"), h = c(Z);
     if (!h)
       throw new Error("OPF file path not found in container.xml.");
     l = h.substring(0, h.lastIndexOf("/") + 1);
-    const T = y.current.file(h);
-    if (!T) throw new Error(`OPF file not found at path: ${h}`);
-    const e = await T.async("text"), V = new DOMParser().parseFromString(e, "application/xml"), L = V.querySelector("parsererror");
+    const B = y.current.file(h);
+    if (!B) throw new Error(`OPF file not found at path: ${h}`);
+    const e = await B.async("text"), V = new DOMParser().parseFromString(e, "application/xml"), L = V.querySelector("parsererror");
     if (L)
       throw new Error(
         `Error parsing OPF file: ${L.textContent || "Unknown XML parse error"}`
       );
     s(V), await m(V);
   }
-  function c(C) {
+  function c(E) {
     const h = new DOMParser().parseFromString(
-      C,
+      E,
       "application/xml"
     ).querySelector(
       'rootfile[media-type="application/oebps-package+xml"]'
     );
     return (h == null ? void 0 : h.getAttribute("full-path")) ?? null;
   }
-  function s(C) {
-    const z = C.querySelector("metadata > dc\\:title") || C.querySelector("metadata > title");
+  function s(E) {
+    const z = E.querySelector("metadata > dc\\:title") || E.querySelector("metadata > title");
     a((z == null ? void 0 : z.textContent) || "Untitled Book");
   }
-  async function m(C) {
+  async function m(E) {
     if (!y.current) return;
     const z = {};
-    C.querySelectorAll("manifest > item").forEach((e) => {
+    E.querySelectorAll("manifest > item").forEach((e) => {
       const P = e.getAttribute("id"), V = e.getAttribute("href"), L = e.getAttribute("media-type");
       P && V && L && (z[P] = { href: decodeURIComponent(V), type: L });
     });
-    const X = Array.from(
-      C.querySelectorAll("spine > itemref")
+    const Z = Array.from(
+      E.querySelectorAll("spine > itemref")
     ).map((e) => e.getAttribute("idref"));
     let h = "";
-    const T = /* @__PURE__ */ new Set();
-    for (const e of X) {
+    const B = /* @__PURE__ */ new Set();
+    for (const e of Z) {
       if (!e) continue;
       const P = z[e];
       if (P) {
@@ -2425,28 +2425,28 @@ function qt() {
       const P = z[e];
       if (P.type.includes("css")) {
         const V = l + P.href;
-        if (!T.has(V)) {
+        if (!B.has(V)) {
           const L = y.current.file(V);
           if (L)
             try {
               g += await L.async("text") + `
-`, T.add(V);
+`, B.add(V);
             } catch (Q) {
               console.warn(`Failed to load CSS ${V}:`, Q);
             }
         }
       }
     }
-    D(), K(h);
+    F(), K(h);
   }
-  async function w(C, z) {
-    let X = [...C.matchAll(/<style[^>]*>([\s\S]*?)<\/style>/gi)].map((T) => T[1]).join(`
+  async function w(E, z) {
+    let Z = [...E.matchAll(/<style[^>]*>([\s\S]*?)<\/style>/gi)].map((B) => B[1]).join(`
 `);
-    X = x(X), g += X;
-    let h = C.replace(/<style[^>]*>[\s\S]*?<\/style>/gi, "");
+    Z = x(Z), g += Z;
+    let h = E.replace(/<style[^>]*>[\s\S]*?<\/style>/gi, "");
     return h = h.replace(/<link[^>]*?>/gi, ""), h = h.replace(/<title[^>]*>[\s\S]*?<\/title>/gi, ""), h = await S(h, z), h;
   }
-  function x(C) {
+  function x(E) {
     const z = [
       "background-color",
       "color",
@@ -2456,35 +2456,35 @@ function qt() {
       "line-height",
       "text-align"
     ];
-    return C.split(/}/).map((X) => {
-      const h = X.split(/{/), T = h[0], e = h[1];
+    return E.split(/}/).map((Z) => {
+      const h = Z.split(/{/), B = h[0], e = h[1];
       if (!e) return "";
       const P = e.split(/;/).map((V) => V.trim()).filter((V) => V ? !z.some(
         (L) => new RegExp(`^${L}s*:`, "i").test(V)
       ) : !1).join("; ");
-      return P ? `${T.trim()} { ${P}; }` : "";
-    }).filter((X) => !!X).join(`
+      return P ? `${B.trim()} { ${P}; }` : "";
+    }).filter((Z) => !!Z).join(`
 `);
   }
-  async function S(C, z) {
-    const X = new DOMParser();
+  async function S(E, z) {
+    const Z = new DOMParser();
     if (i.includes(z))
       try {
-        const h = X.parseFromString(
-          C,
+        const h = Z.parseFromString(
+          E,
           z
-        ), T = h.querySelector("parsererror");
-        if (T)
+        ), B = h.querySelector("parsererror");
+        if (B)
           return console.warn(
             "Parser error in content item during cleanImages, skipping.",
-            T.textContent
-          ), C;
+            B.textContent
+          ), E;
         const e = h.querySelectorAll("img");
         for (const Q of e)
-          await F(Q);
+          await D(Q);
         const P = h.querySelectorAll("image");
         for (const Q of P)
-          await E(Q);
+          await C(Q);
         return new XMLSerializer().serializeToString(
           h.documentElement || h
         );
@@ -2492,48 +2492,48 @@ function qt() {
         return console.error(
           "Error during cleanImages DOM processing:",
           h
-        ), C;
+        ), E;
       }
-    else return C;
+    else return E;
   }
-  async function F(C) {
-    var X;
-    let z = C.getAttribute("src");
+  async function D(E) {
+    var Z;
+    let z = E.getAttribute("src");
     if (z) {
       for (; z.startsWith(".") || z.startsWith("/"); ) z = z.slice(1);
       if (z = l + z, b[z] === void 0) {
-        const h = (X = y.current) == null ? void 0 : X.file(z);
+        const h = (Z = y.current) == null ? void 0 : Z.file(z);
         if (h)
           try {
-            const T = await h.async("blob"), e = URL.createObjectURL(T);
+            const B = await h.async("blob"), e = URL.createObjectURL(B);
             b[z] = e;
-          } catch (T) {
+          } catch (B) {
             console.warn(
               `Could not load image blob (formatImg) ${z}:`,
-              T
+              B
             ), b[z] = "";
           }
         else
           console.warn(`Image file not found in zip (formatImg): ${z}`), b[z] = "";
       }
-      C.setAttribute("src", b[z]);
+      E.setAttribute("src", b[z]);
     }
   }
-  async function E(C) {
-    var X;
-    let z = C.getAttribute("xlink:href");
+  async function C(E) {
+    var Z;
+    let z = E.getAttribute("xlink:href");
     if (z) {
       for (; z.startsWith(".") || z.startsWith("/"); ) z = z.slice(1);
       if (z = l + z, b[z] === void 0) {
-        const h = (X = y.current) == null ? void 0 : X.file(z);
+        const h = (Z = y.current) == null ? void 0 : Z.file(z);
         if (h)
           try {
-            const T = await h.async("blob"), e = URL.createObjectURL(T);
+            const B = await h.async("blob"), e = URL.createObjectURL(B);
             b[z] = e;
-          } catch (T) {
+          } catch (B) {
             console.warn(
               `Could not load image blob (formatXMLImage) ${z}:`,
-              T
+              B
             ), b[z] = "";
           }
         else
@@ -2541,31 +2541,31 @@ function qt() {
             `Image file not found in zip (formatXMLImage): ${z}`
           ), b[z] = "";
       }
-      C.setAttribute("xlink:href", b[z]);
+      E.setAttribute("xlink:href", b[z]);
     }
   }
-  function D() {
+  function F() {
     if (!g.trim()) return;
-    const C = new Blob([g], { type: "text/css" }), z = URL.createObjectURL(C);
+    const E = new Blob([g], { type: "text/css" }), z = URL.createObjectURL(E);
     _.current = document.createElement("link"), _.current.href = z, _.current.rel = "stylesheet", _.current.setAttribute("data-bok-reader-style", "true"), document.head.appendChild(_.current);
   }
   return {
     title: v,
-    rawContent: Z,
+    rawContent: X,
     isLoading: p,
     error: o,
     loadEpub: d,
     setIsLoading: A
   };
 }
-function Wt(Z) {
-  const [K, p] = ft({
+function Wt(X) {
+  const [K, p] = ht({
     width: 0,
     height: 0,
     noOfPages: 1
   });
-  return ut(() => {
-    const A = Z == null ? void 0 : Z.current, v = () => {
+  return dt(() => {
+    const A = X == null ? void 0 : X.current, v = () => {
       if (A) {
         const a = A.getBoundingClientRect(), o = a.height < a.width;
         p((r) => {
@@ -2586,17 +2586,17 @@ function Wt(Z) {
         a.unobserve(A);
       };
     }
-  }, [Z]), [K.width, K.height, K.noOfPages];
+  }, [X]), [K.width, K.height, K.noOfPages];
 }
-function Jt(Z) {
-  const [K, p] = ft(0), A = Tt(() => {
-    if (Z.current) {
-      const v = Z.current.scrollWidth, a = Z.current.scrollLeft, o = v > 0 ? a / v : 0;
+function Jt(X) {
+  const [K, p] = ht(0), A = Tt(() => {
+    if (X.current) {
+      const v = X.current.scrollWidth, a = X.current.scrollLeft, o = v > 0 ? a / v : 0;
       p(o);
     }
-  }, [Z]);
-  return ut(() => {
-    const v = Z.current;
+  }, [X]);
+  return dt(() => {
+    const v = X.current;
     if (!v) return;
     let a = null;
     const o = 100, r = () => {
@@ -2607,27 +2607,27 @@ function Jt(Z) {
     return v.addEventListener("scroll", r), A(), () => {
       a && clearTimeout(a), v.removeEventListener("scroll", r);
     };
-  }, [A, Z]), [K, p];
+  }, [A, X]), [K, p];
 }
-function Qt(Z, K, p, A, v) {
+function Qt(X, K, p, A, v) {
   let a = "";
-  ut(() => {
+  dt(() => {
     K > 1e-7 && (a = JSON.stringify({
       percentRead: K,
       padding: p,
       fontSize: A,
       fontFamily: v
-    }), localStorage.setItem(Z, a));
-  }, [Z, K, p, A, v]);
+    }), localStorage.setItem(X, a));
+  }, [X, K, p, A, v]);
 }
-const te = (Z, K, p, A) => {
-  const [v, a] = Wt(p), o = yt(null), r = yt(""), l = Tt(
+const te = (X, K, p, A) => {
+  const [v, a] = Wt(p), o = wt(null), r = wt(""), l = Tt(
     (g, y) => {
-      !K && !A && (g / v <= 0.4 && y / a < 0.8 && Z(-1), g / v > 0.4 && y / a < 0.8 && Z(1));
+      !K && !A && (g / v <= 0.4 && y / a < 0.8 && X(-1), g / v > 0.4 && y / a < 0.8 && X(1));
     },
-    [Z, K, v, a]
+    [X, K, v, a, A]
   );
-  ut(() => {
+  dt(() => {
     const g = () => {
       var _;
       const y = (_ = window.getSelection()) == null ? void 0 : _.toString();
@@ -2636,7 +2636,7 @@ const te = (Z, K, p, A) => {
     return document.addEventListener("selectionchange", g), () => {
       document.removeEventListener("selectionchange", g);
     };
-  }, []), ut(() => {
+  }, []), dt(() => {
     const g = () => {
       o.current = window.setTimeout(() => {
         o.current = null;
@@ -2651,7 +2651,7 @@ const te = (Z, K, p, A) => {
     return window.addEventListener("touchstart", g), window.addEventListener("touchend", y), () => {
       window.removeEventListener("touchstart", g), window.removeEventListener("touchend", y);
     };
-  }, [v, l]), ut(() => {
+  }, [v, l]), dt(() => {
     const g = p.current, y = () => {
       o.current = window.setTimeout(() => {
       }, 200);
@@ -2663,15 +2663,15 @@ const te = (Z, K, p, A) => {
     };
   }, [v, K, l, p]);
 };
-function ee({ currentPage: Z, pages: K }) {
-  return /* @__PURE__ */ pt("div", { className: "page-number", children: [
-    Z + 1,
+function ee({ currentPage: X, pages: K }) {
+  return /* @__PURE__ */ ut("div", { className: "page-number", children: [
+    X + 1,
     "/",
     K
   ] });
 }
 function re({
-  content: Z,
+  content: X,
   title: K,
   setIsLoading: p,
   fontSize: A,
@@ -2684,64 +2684,64 @@ function re({
   containerElementRef: y,
   showTutorial: _
 }) {
-  const b = yt(null), [i, d, n] = Wt(y), [c, s] = Jt(b), [m, w] = ft(1), [x, S] = ft(0);
+  const b = wt(null), [i, d, n] = Wt(y), [c, s] = Jt(b), [m, w] = ht(1), [x, S] = ht(0);
   Qt(K, c, v, A, a);
-  const F = Tt(
-    (E) => {
-      w((D) => {
-        const C = b.current;
-        if (C && x > 0 && n > 0 && C.clientWidth > 0) {
-          let z = D + E;
-          return z < 0 && (z = 0), z >= x && (z = x - 1), C.scroll({
+  const D = Tt(
+    (C) => {
+      w((F) => {
+        const E = b.current;
+        if (E && x > 0 && n > 0 && E.clientWidth > 0) {
+          let z = F + C;
+          return z < 0 && (z = 0), z >= x && (z = x - 1), E.scroll({
             left: z * i * n,
             behavior: "smooth"
           }), z;
         }
-        return D;
+        return F;
       });
     },
     [i, x, n]
   );
   return te(
-    F,
+    D,
     o,
     y,
     _
-  ), ut(() => {
+  ), dt(() => {
     if (!K) return;
-    const E = localStorage.getItem(K);
-    if (E)
+    const C = localStorage.getItem(K);
+    if (C)
       try {
-        const D = JSON.parse(E);
-        D && (s(D.percentRead || 0), D.fontSize !== void 0 && r(D.fontSize), D.padding !== void 0 && l(D.padding), D.fontFamily !== void 0 && g(D.fontFamily));
-      } catch (D) {
-        console.error("Failed to parse local storage for", K, D), s(0);
+        const F = JSON.parse(C);
+        F && (s(F.percentRead || 0), F.fontSize !== void 0 && r(F.fontSize), F.padding !== void 0 && l(F.padding), F.fontFamily !== void 0 && g(F.fontFamily));
+      } catch (F) {
+        console.error("Failed to parse local storage for", K, F), s(0);
       }
     else
       s(0);
     w(1);
-  }, [K, s, r, l, g]), ut(() => {
-    const E = b.current;
-    if (!E || i <= 0 || d <= 0) return;
+  }, [K, s, r, l, g]), dt(() => {
+    const C = b.current;
+    if (!C || i <= 0 || d <= 0) return;
     p(!0);
-    const D = setTimeout(() => {
-      E.style.setProperty(
+    const F = setTimeout(() => {
+      C.style.setProperty(
         "--side-padding",
         `${v}px`
-      ), E.style.setProperty("--font-size", `${A}em`), E.style.setProperty("--font-family", a), E.style.maxHeight = `${d}px`;
-      const C = E.scrollWidth, z = i > 0 && C > 0 ? Math.round(C / i) : 0, X = n === 1 ? z : Math.round(z / 2);
-      if (S(X), X > 0 && E.clientWidth > 0) {
-        let h = Math.round(X * c);
+      ), C.style.setProperty("--font-size", `${A}em`), C.style.setProperty("--font-family", a), C.style.maxHeight = `${d}px`;
+      const E = C.scrollWidth, z = i > 0 && E > 0 ? Math.round(E / i) : 0, Z = n === 1 ? z : Math.round(z / 2);
+      if (S(Z), Z > 0 && C.clientWidth > 0) {
+        let h = Math.round(Z * c);
         h = Math.max(
           0,
-          Math.min(X - 1, h)
-        ), m !== h && (w(h), E.scrollLeft = h * i * n);
+          Math.min(Z - 1, h)
+        ), m !== h && (w(h), C.scrollLeft = h * i * n);
       } else
         p(!1), w(1);
       p(!1);
     }, 400);
     return () => {
-      clearTimeout(D);
+      clearTimeout(F);
     };
   }, [
     i,
@@ -2750,22 +2750,22 @@ function re({
     A,
     a,
     n,
-    Z,
+    X,
     K,
     p
-  ]), ut(() => {
-    const E = (D) => {
-      D.key === "ArrowLeft" ? (D.preventDefault(), F(-1)) : D.key === "ArrowRight" && (D.preventDefault(), F(1));
+  ]), dt(() => {
+    const C = (F) => {
+      F.key === "ArrowLeft" ? (F.preventDefault(), D(-1)) : F.key === "ArrowRight" && (F.preventDefault(), D(1));
     };
-    return document.addEventListener("keydown", E), () => {
-      document.removeEventListener("keydown", E);
+    return document.addEventListener("keydown", C), () => {
+      document.removeEventListener("keydown", C);
     };
-  }, [F, i, c]), /* @__PURE__ */ pt(Lt, { children: [
+  }, [D, i, c]), /* @__PURE__ */ ut(Ut, { children: [
     /* @__PURE__ */ et(
       "div",
       {
         ref: b,
-        dangerouslySetInnerHTML: { __html: Z },
+        dangerouslySetInnerHTML: { __html: X },
         className: "book-page"
       }
     ),
@@ -2789,25 +2789,25 @@ var ne = {
   vmax: !0,
   "%": !0
 };
-function ie(Z) {
-  if (typeof Z == "number")
+function ie(X) {
+  if (typeof X == "number")
     return {
-      value: Z,
+      value: X,
       unit: "px"
     };
-  var K, p = (Z.match(/^[0-9.]*/) || "").toString();
+  var K, p = (X.match(/^[0-9.]*/) || "").toString();
   p.includes(".") ? K = parseFloat(p) : K = parseInt(p, 10);
-  var A = (Z.match(/[^0-9]*$/) || "").toString();
+  var A = (X.match(/[^0-9]*$/) || "").toString();
   return ne[A] ? {
     value: K,
     unit: A
-  } : (console.warn("React Spinners: ".concat(Z, " is not a valid css value. Defaulting to ").concat(K, "px.")), {
+  } : (console.warn("React Spinners: ".concat(X, " is not a valid css value. Defaulting to ").concat(K, "px.")), {
     value: K,
     unit: "px"
   });
 }
-var kt = function(Z, K, p) {
-  var A = "react-spinners-".concat(Z, "-").concat(p);
+var xt = function(X, K, p) {
+  var A = "react-spinners-".concat(X, "-").concat(p);
   if (typeof window > "u" || !window.document)
     return A;
   var v = document.createElement("style");
@@ -2818,47 +2818,47 @@ var kt = function(Z, K, p) {
     }
   `);
   return a && a.insertRule(o, 0), A;
-}, It = function() {
-  return It = Object.assign || function(Z) {
+}, Bt = function() {
+  return Bt = Object.assign || function(X) {
     for (var K, p = 1, A = arguments.length; p < A; p++) {
       K = arguments[p];
-      for (var v in K) Object.prototype.hasOwnProperty.call(K, v) && (Z[v] = K[v]);
+      for (var v in K) Object.prototype.hasOwnProperty.call(K, v) && (X[v] = K[v]);
     }
-    return Z;
-  }, It.apply(this, arguments);
-}, ae = function(Z, K) {
+    return X;
+  }, Bt.apply(this, arguments);
+}, ae = function(X, K) {
   var p = {};
-  for (var A in Z) Object.prototype.hasOwnProperty.call(Z, A) && K.indexOf(A) < 0 && (p[A] = Z[A]);
-  if (Z != null && typeof Object.getOwnPropertySymbols == "function")
-    for (var v = 0, A = Object.getOwnPropertySymbols(Z); v < A.length; v++)
-      K.indexOf(A[v]) < 0 && Object.prototype.propertyIsEnumerable.call(Z, A[v]) && (p[A[v]] = Z[A[v]]);
+  for (var A in X) Object.prototype.hasOwnProperty.call(X, A) && K.indexOf(A) < 0 && (p[A] = X[A]);
+  if (X != null && typeof Object.getOwnPropertySymbols == "function")
+    for (var v = 0, A = Object.getOwnPropertySymbols(X); v < A.length; v++)
+      K.indexOf(A[v]) < 0 && Object.prototype.propertyIsEnumerable.call(X, A[v]) && (p[A[v]] = X[A[v]]);
   return p;
-}, dt = [1, 3, 5], se = [
-  kt("PropagateLoader", "25% {transform: translateX(-".concat(dt[0], `rem) scale(0.75)}
-    50% {transform: translateX(-`).concat(dt[1], `rem) scale(0.6)}
-    75% {transform: translateX(-`).concat(dt[2], `rem) scale(0.5)}
+}, pt = [1, 3, 5], se = [
+  xt("PropagateLoader", "25% {transform: translateX(-".concat(pt[0], `rem) scale(0.75)}
+    50% {transform: translateX(-`).concat(pt[1], `rem) scale(0.6)}
+    75% {transform: translateX(-`).concat(pt[2], `rem) scale(0.5)}
     95% {transform: translateX(0rem) scale(1)}`), "propogate-0"),
-  kt("PropagateLoader", "25% {transform: translateX(-".concat(dt[0], `rem) scale(0.75)}
-    50% {transform: translateX(-`).concat(dt[1], `rem) scale(0.6)}
-    75% {transform: translateX(-`).concat(dt[1], `rem) scale(0.6)}
+  xt("PropagateLoader", "25% {transform: translateX(-".concat(pt[0], `rem) scale(0.75)}
+    50% {transform: translateX(-`).concat(pt[1], `rem) scale(0.6)}
+    75% {transform: translateX(-`).concat(pt[1], `rem) scale(0.6)}
     95% {transform: translateX(0rem) scale(1)}`), "propogate-1"),
-  kt("PropagateLoader", "25% {transform: translateX(-".concat(dt[0], `rem) scale(0.75)}
-    75% {transform: translateX(-`).concat(dt[0], `rem) scale(0.75)}
+  xt("PropagateLoader", "25% {transform: translateX(-".concat(pt[0], `rem) scale(0.75)}
+    75% {transform: translateX(-`).concat(pt[0], `rem) scale(0.75)}
     95% {transform: translateX(0rem) scale(1)}`), "propogate-2"),
-  kt("PropagateLoader", "25% {transform: translateX(".concat(dt[0], `rem) scale(0.75)}
-    75% {transform: translateX(`).concat(dt[0], `rem) scale(0.75)}
+  xt("PropagateLoader", "25% {transform: translateX(".concat(pt[0], `rem) scale(0.75)}
+    75% {transform: translateX(`).concat(pt[0], `rem) scale(0.75)}
     95% {transform: translateX(0rem) scale(1)}`), "propogate-3"),
-  kt("PropagateLoader", "25% {transform: translateX(".concat(dt[0], `rem) scale(0.75)}
-    50% {transform: translateX(`).concat(dt[1], `rem) scale(0.6)}
-    75% {transform: translateX(`).concat(dt[1], `rem) scale(0.6)}
+  xt("PropagateLoader", "25% {transform: translateX(".concat(pt[0], `rem) scale(0.75)}
+    50% {transform: translateX(`).concat(pt[1], `rem) scale(0.6)}
+    75% {transform: translateX(`).concat(pt[1], `rem) scale(0.6)}
     95% {transform: translateX(0rem) scale(1)}`), "propogate-4"),
-  kt("PropagateLoader", "25% {transform: translateX(".concat(dt[0], `rem) scale(0.75)}
-    50% {transform: translateX(`).concat(dt[1], `rem) scale(0.6)}
-    75% {transform: translateX(`).concat(dt[2], `rem) scale(0.5)}
+  xt("PropagateLoader", "25% {transform: translateX(".concat(pt[0], `rem) scale(0.75)}
+    50% {transform: translateX(`).concat(pt[1], `rem) scale(0.6)}
+    75% {transform: translateX(`).concat(pt[2], `rem) scale(0.5)}
     95% {transform: translateX(0rem) scale(1)}`), "propogate-5")
 ];
-function oe(Z) {
-  var K = Z.loading, p = K === void 0 ? !0 : K, A = Z.color, v = A === void 0 ? "#000000" : A, a = Z.speedMultiplier, o = a === void 0 ? 1 : a, r = Z.cssOverride, l = r === void 0 ? {} : r, g = Z.size, y = g === void 0 ? 15 : g, _ = ae(Z, ["loading", "color", "speedMultiplier", "cssOverride", "size"]), b = ie(y), i = b.value, d = b.unit, n = It({ display: "inherit", position: "relative" }, l), c = function(s) {
+function oe(X) {
+  var K = X.loading, p = K === void 0 ? !0 : K, A = X.color, v = A === void 0 ? "#000000" : A, a = X.speedMultiplier, o = a === void 0 ? 1 : a, r = X.cssOverride, l = r === void 0 ? {} : r, g = X.size, y = g === void 0 ? 15 : g, _ = ae(X, ["loading", "color", "speedMultiplier", "cssOverride", "size"]), b = ie(y), i = b.value, d = b.unit, n = Bt({ display: "inherit", position: "relative" }, l), c = function(s) {
     return {
       position: "absolute",
       fontSize: "".concat(i / 3).concat(d),
@@ -2870,29 +2870,29 @@ function oe(Z) {
       animationFillMode: "forwards"
     };
   };
-  return p ? wt.createElement(
+  return p ? kt.createElement(
     "span",
-    It({ style: n }, _),
-    wt.createElement("span", { style: c(0) }),
-    wt.createElement("span", { style: c(1) }),
-    wt.createElement("span", { style: c(2) }),
-    wt.createElement("span", { style: c(3) }),
-    wt.createElement("span", { style: c(4) }),
-    wt.createElement("span", { style: c(5) })
+    Bt({ style: n }, _),
+    kt.createElement("span", { style: c(0) }),
+    kt.createElement("span", { style: c(1) }),
+    kt.createElement("span", { style: c(2) }),
+    kt.createElement("span", { style: c(3) }),
+    kt.createElement("span", { style: c(4) }),
+    kt.createElement("span", { style: c(5) })
   ) : null;
 }
-const Ft = {
-  "loading-screen": "_loading-screen_42072_1",
-  "loading-screen-gon": "_loading-screen-gon_42072_18"
+const Dt = {
+  "loading-screen": "_loading-screen_ywqzh_1",
+  "loading-screen-gon": "_loading-screen-gon_ywqzh_17"
 };
 function le({
-  isLoading: Z,
+  isLoading: X,
   color: K
 }) {
   return /* @__PURE__ */ et(
     "div",
     {
-      className: Z ? Ft["loading-screen"] : Ft["loading-screen-gon"],
+      className: X ? Dt["loading-screen"] : Dt["loading-screen-gon"],
       children: /* @__PURE__ */ et("div", { children: /* @__PURE__ */ et(
         oe,
         {
@@ -2906,7 +2906,7 @@ function ce() {
   document.fullscreenElement ? document.exitFullscreen && document.exitFullscreen() : document.documentElement.requestFullscreen();
 }
 function ue({
-  onClose: Z,
+  onClose: X,
   fontSize: K,
   padding: p,
   fontFamily: A,
@@ -2915,84 +2915,76 @@ function ue({
   setFontFamily: o,
   supportedFonts: r
 }) {
-  const [l, g] = ft(!1), [y, _] = ft(!1), b = yt(null), i = yt(null), d = [
+  const [l, g] = ht(!1), [y, _] = ht(!1), b = wt(null), i = wt(null), d = [
     { displayName: "System Default", name: "system-ui" },
     ...r
   ];
-  ut(() => {
-    const E = setTimeout(() => {
+  dt(() => {
+    const C = setTimeout(() => {
       _(!0);
     }, 0);
-    return () => clearTimeout(E);
+    return () => clearTimeout(C);
   }, []);
   const n = () => {
     _(!1), g(!0);
   };
-  ut(() => {
+  dt(() => {
     if (l) {
-      const E = setTimeout(() => {
-        Z();
+      const C = setTimeout(() => {
+        X();
       }, 300);
-      return () => clearTimeout(E);
+      return () => clearTimeout(C);
     }
-  }, [l, Z]);
+  }, [l, X]);
   const c = () => {
     n();
-  }, s = (E) => {
-    E.stopPropagation();
-  }, m = (E) => {
-    E.current && (E.current.classList.add("value-changed"), setTimeout(() => {
-      E.current && E.current.classList.remove("value-changed");
+  }, s = (C) => {
+    C.stopPropagation();
+  }, m = (C) => {
+    C.current && (C.current.classList.add("value-changed"), setTimeout(() => {
+      C.current && C.current.classList.remove("value-changed");
     }, 300));
   }, w = () => {
-    p <= 70 && (a((E) => E + 5), m(i));
+    p <= 70 && (a((C) => C + 5), m(i));
   }, x = () => {
-    p - 5 > 0 && (a((E) => E - 5), m(i));
+    p - 5 > 0 && (a((C) => C - 5), m(i));
   }, S = () => {
-    K < 3 && (v((E) => E + 0.2), m(b));
-  }, F = () => {
-    K - 0.2 > 0.6 && (v((E) => E - 0.2), m(b));
+    K < 3 && (v((C) => C + 0.2), m(b));
+  }, D = () => {
+    K - 0.2 > 0.6 && (v((C) => C - 0.2), m(b));
   };
   return /* @__PURE__ */ et(
     "div",
     {
       className: `options-menu-overlay ${l ? "fade-out" : ""}`,
       onClick: c,
-      children: /* @__PURE__ */ pt(
+      children: /* @__PURE__ */ ut(
         "div",
         {
           className: `options-menu ${y ? "visible" : ""} ${l ? "slide-down" : ""}`,
           onClick: s,
           children: [
-            /* @__PURE__ */ et("button", { onClick: n, className: "close-button", children: "✕" }),
+            /* @__PURE__ */ et("button", { onClick: n, className: "close-button", "aria-label": "Close menu", children: "✕" }),
             /* @__PURE__ */ et("h2", { children: "Reader Options" }),
-            /* @__PURE__ */ pt("div", { className: "options-buttons", children: [
-              /* @__PURE__ */ pt("div", { className: "font-family-buttons", children: [
+            /* @__PURE__ */ ut("div", { className: "options-buttons", children: [
+              /* @__PURE__ */ ut("div", { className: "font-family-buttons", children: [
+                /* @__PURE__ */ et("div", { className: "option-label", children: "Font family" }),
                 /* @__PURE__ */ et(
                   "select",
                   {
                     value: A,
-                    onChange: (E) => {
-                      for (const D of d)
-                        D.name === E.target.value && o(E.target.value);
+                    onChange: (C) => {
+                      const F = d.find((E) => E.name === C.target.value);
+                      F && o(F.name);
                     },
-                    children: d.map((E) => /* @__PURE__ */ et(
-                      "option",
-                      {
-                        value: E.name,
-                        children: E.displayName
-                      },
-                      E.displayName
-                    ))
+                    children: d.map((C) => /* @__PURE__ */ et("option", { value: C.name, children: C.displayName }, C.displayName))
                   }
-                ),
-                /* @__PURE__ */ et("div", { className: "option-label", children: "Font family" })
+                )
               ] }),
-              /* @__PURE__ */ pt("div", { className: "padding-buttons", children: [
-                /* @__PURE__ */ et("button", { onClick: w, children: "+" }),
-                /* @__PURE__ */ et("button", { onClick: x, children: "-" }),
-                /* @__PURE__ */ pt("div", { children: [
-                  /* @__PURE__ */ et("span", { className: "option-label", children: "Side padding: " }),
+              /* @__PURE__ */ ut("div", { className: "padding-buttons", children: [
+                /* @__PURE__ */ et("div", { className: "option-label", children: "Side padding" }),
+                /* @__PURE__ */ ut("div", { style: { display: "flex", alignItems: "center", gap: "8px" }, children: [
+                  /* @__PURE__ */ et("button", { onClick: x, children: "-" }),
                   /* @__PURE__ */ et(
                     "span",
                     {
@@ -3000,15 +2992,16 @@ function ue({
                       className: "option-value",
                       children: p
                     }
-                  )
+                  ),
+                  /* @__PURE__ */ et("button", { onClick: w, children: "+" })
                 ] })
               ] }),
-              /* @__PURE__ */ pt("div", { className: "font-buttons", children: [
-                /* @__PURE__ */ et("button", { onClick: S, children: "+" }),
-                /* @__PURE__ */ et("button", { onClick: F, children: "-" }),
-                /* @__PURE__ */ pt("div", { style: { marginLeft: "auto" }, children: [
-                  /* @__PURE__ */ et("span", { className: "option-label", children: "Font size: " }),
-                  /* @__PURE__ */ et("span", { ref: b, className: "option-value", children: Math.round(K * 10) })
+              /* @__PURE__ */ ut("div", { className: "font-buttons", children: [
+                /* @__PURE__ */ et("div", { className: "option-label", children: "Font size" }),
+                /* @__PURE__ */ ut("div", { style: { display: "flex", alignItems: "center", gap: "8px" }, children: [
+                  /* @__PURE__ */ et("button", { onClick: D, children: "-" }),
+                  /* @__PURE__ */ et("span", { ref: b, className: "option-value", children: Math.round(K * 10) }),
+                  /* @__PURE__ */ et("button", { onClick: S, children: "+" })
                 ] })
               ] }),
               /* @__PURE__ */ et("button", { onClick: ce, children: "Toggle fullscreen" })
@@ -3019,142 +3012,67 @@ function ue({
     }
   );
 }
-const he = Ut.div`
-    position: absolute;
-    top: 0;
-    left: 0;
-    width: 100%;
-    height: 100%;
-    background: rgba(0, 0, 0, 0.55);
-    z-index: 2000;
-    pointer-events: auto;
-    overflow: hidden;
-    opacity: 1;
-    transition: opacity 0.35s ease;
-    &.fade-out {
-        opacity: 0;
-        pointer-events: none;
-    }
-
-    .tap-circle {
-        position: absolute;
-        width: 54px;
-        height: 54px;
-        border-radius: 50%;
-        border: 3px solid ${({ color: Z }) => Z || "#4fc3f7"};
-        background: ${({ color: Z }) => Z || "#4fc3f7"};
-        box-shadow: 0 0 16px 0 ${({ color: Z }) => Z || "#4fc3f7"}55;
-        display: flex;
-        align-items: center;
-        justify-content: center;
-        z-index: 2;
-        pointer-events: none;
-        opacity: 0.95;
-    }
-    .tap-circle.right {
-        right: 18px;
-        top: 50%;
-        transform: translateY(-50%);
-    }
-    .tap-circle.left {
-        left: 18px;
-        top: 50%;
-        transform: translateY(-50%);
-    }
-    .tap-circle.bottom {
-        left: 50%;
-        bottom: 32px;
-        transform: translateX(-50%);
-    }
-    .tutorial-label {
-        position: absolute;
-        color: ${({ color: Z }) => Z || "#4fc3f7"};
-        font-size: 1.1em;
-        font-weight: 500;
-        background: rgba(0, 0, 0, 0.7);
-        padding: 0.5em 1.1em;
-        border-radius: 1.2em;
-        z-index: 3;
-        pointer-events: none;
-        white-space: nowrap;
-    }
-    .tutorial-label.right {
-        right: 90px;
-        top: 47%;
-        transform: none;
-    }
-    .tutorial-label.left {
-        left: 90px;
-        top: 47%;
-        transform: none;
-    }
-    .tutorial-label.bottom {
-        left: 50%;
-        bottom: 110px;
-        transform: translateX(-50%);
-    }
-    .tutorial-svg {
-        position: absolute;
-        top: 0;
-        left: 0;
-        width: 100%;
-        height: 100%;
-        pointer-events: none;
-        z-index: 1;
-    }
-    .dismiss {
-        position: absolute;
-        left: 50%;
-        top: 16%;
-        text-align: center;
-        padding: 0.5em 1.1em;
-        transform: translateX(-50%);
-        font-size: 1em;
-        color: #fff;
-        opacity: 0.8;
-        background: rgba(0, 0, 0, 0.7);
-        z-index: 10;
-        pointer-events: none;
-    }
-    @media (max-width: 600px) {
-        .tap-circle.right {
-            top: 44%;
-        }
-        .tutorial-label.right {
-            top: 41%;
-        }
-        .tap-circle.left {
-            top: 56%;
-        }
-        .tutorial-label.left {
-            top: 53%;
-        }
-    }
-`, de = ({
-  color: Z,
+const he = "_overlay_1cqa3_53", de = "_fadeOut_1cqa3_80", fe = "_interactionZone_1cqa3_86", pe = "_centerZone_1cqa3_96", me = "_iconWrapper_1cqa3_107", ge = "_label_1cqa3_131", _e = "_bottomIconGroup_1cqa3_143", be = "_bottomIconWrapper_1cqa3_150", ve = "_bounceArrow_1cqa3_169", ye = "_dismissButton_1cqa3_179", mt = {
+  overlay: he,
+  fadeOut: de,
+  interactionZone: fe,
+  centerZone: pe,
+  iconWrapper: me,
+  label: ge,
+  bottomIconGroup: _e,
+  bottomIconWrapper: be,
+  bounceArrow: ve,
+  dismissButton: ye
+}, we = ({
+  color: X = "#4fc3f7",
   onDismiss: K
 }) => {
-  const [p, A] = Ht.useState(!1);
-  return /* @__PURE__ */ pt(
-    he,
+  const [p, A] = ht(!1), v = () => {
+    A(!0), setTimeout(K, 400);
+  };
+  return /* @__PURE__ */ ut(
+    "div",
     {
-      color: Z,
-      onClick: () => {
-        A(!0), setTimeout(K, 350);
-      },
-      className: p ? "fade-out" : "",
+      className: `${mt.overlay} ${p ? mt.fadeOut : ""}`,
+      onClick: v,
+      style: { "--accent-color": X },
       children: [
-        /* @__PURE__ */ et("div", { className: "tap-circle right" }),
-        /* @__PURE__ */ et("div", { className: "tap-circle left" }),
-        /* @__PURE__ */ et("div", { className: "tap-circle bottom" }),
-        /* @__PURE__ */ et("div", { className: "tutorial-label right", children: "scroll right" }),
-        /* @__PURE__ */ et("div", { className: "tutorial-label left", children: "scroll left" }),
-        /* @__PURE__ */ et("div", { className: "tutorial-label bottom", children: "open settings" }),
-        /* @__PURE__ */ et("div", { className: "dismiss", children: "Tap anywhere to continue" })
+        /* @__PURE__ */ ut("div", { className: mt.interactionZone, children: [
+          /* @__PURE__ */ et("div", { className: mt.iconWrapper, children: /* @__PURE__ */ et("svg", { viewBox: "0 0 24 24", children: /* @__PURE__ */ et("path", { d: "M15.41 7.41L14 6l-6 6 6 6 1.41-1.41L10.83 12z" }) }) }),
+          /* @__PURE__ */ et("div", { className: mt.label, children: "Previous" })
+        ] }),
+        /* @__PURE__ */ ut("div", { className: mt.interactionZone, children: [
+          /* @__PURE__ */ et("div", { className: mt.iconWrapper, children: /* @__PURE__ */ et("svg", { viewBox: "0 0 24 24", children: /* @__PURE__ */ et("path", { d: "M10 6L8.59 7.41 13.17 12l-4.58 4.59L10 18l6-6z" }) }) }),
+          /* @__PURE__ */ et("div", { className: mt.label, children: "Next" })
+        ] }),
+        /* @__PURE__ */ ut("div", { className: mt.centerZone, children: [
+          /* @__PURE__ */ ut("div", { className: mt.bottomIconGroup, children: [
+            /* @__PURE__ */ et("div", { className: mt.bottomIconWrapper, children: /* @__PURE__ */ et("svg", { viewBox: "0 0 24 24", children: /* @__PURE__ */ et("path", { d: "M3 18h18v-2H3v2zm0-5h18v-2H3v2zm0-7v2h18V6H3z" }) }) }),
+            /* @__PURE__ */ et(
+              "div",
+              {
+                className: mt.label,
+                style: { fontSize: "0.9rem" },
+                children: "Options"
+              }
+            ),
+            /* @__PURE__ */ et("div", { className: mt.bounceArrow, children: /* @__PURE__ */ et("svg", { width: "24", height: "24", viewBox: "0 0 24 24", children: /* @__PURE__ */ et("path", { d: "M7.41 8.59L12 13.17l4.59-4.58L18 10l-6 6-6-6 1.41-1.41z" }) }) })
+          ] }),
+          /* @__PURE__ */ et(
+            "button",
+            {
+              className: mt.dismissButton,
+              onClick: (a) => {
+                a.stopPropagation(), v();
+              },
+              children: "Start Reading"
+            }
+          )
+        ] })
       ]
     }
   );
-}, Dt = $t`
+}, Nt = qt`
   .bok-reader-container {
     font-family: system-ui, Avenir, Helvetica, Arial, sans-serif;
     line-height: 1.5;
@@ -3180,7 +3098,7 @@ const he = Ut.div`
         font-family: var(--font-family);
         padding: var(--top-padding) var(--side-padding) var(--bottom-padding);
         height: 100%;
-        text-shadow: 2px 2px 5px rgba(0, 0, 0); 
+        text-shadow: 0 1px 2px rgba(0, 0, 0, 0.6);
         font-size: var(--font-size);
 
         column-gap: calc(2 * var(--side-padding));
@@ -3209,7 +3127,7 @@ const he = Ut.div`
               -webkit-column-break-inside: avoid;
          }
         p {
-            color: 
+            color:
         }
     }
 
@@ -3272,13 +3190,20 @@ const he = Ut.div`
 
     .page-number {
         position: absolute;
-        bottom: 15px; // Position relative to the reader container
+        bottom: 20px;
         left: 50%;
         transform: translateX(-50%);
-        font-size: 13px;
-        color: gray;
-        z-index: 10; // Above book content
-        pointer-events: none; // Non-interactive
+        font-size: 12px;
+        font-weight: 500;
+        letter-spacing: 0.5px;
+        color: rgba(255, 255, 255, 0.4);
+        z-index: 10;
+        pointer-events: none;
+        font-variant-numeric: tabular-nums;
+        background: rgba(0, 0, 0, 0.3);
+        padding: 4px 10px;
+        border-radius: 12px;
+        backdrop-filter: blur(2px);
     }
 
     .bottom-click-area {
@@ -3292,24 +3217,24 @@ const he = Ut.div`
         cursor: pointer;
     }
   }
-`, Nt = Ut.div`
+`, Lt = Gt.div`
     width: 100%;
     height: 100%;
     position: relative;d
     overflow: hidden;d
     overflow-y: hidden;
 `;
-function fe(Z, K) {
-  const [p, A] = ft(() => {
-    const v = localStorage.getItem(Z);
+function ke(X, K) {
+  const [p, A] = ht(() => {
+    const v = localStorage.getItem(X);
     return v === null ? K : v === "true";
   });
-  return ut(() => {
-    localStorage.setItem(Z, p ? "true" : "false");
-  }, [Z, p]), [p, A];
+  return dt(() => {
+    localStorage.setItem(X, p ? "true" : "false");
+  }, [X, p]), [p, A];
 }
-const _e = ({
-  epubDataSource: Z,
+const Ce = ({
+  epubDataSource: X,
   onTitleChange: K,
   onLoadingChange: p,
   onError: A,
@@ -3318,66 +3243,64 @@ const _e = ({
   color: o,
   supportedFonts: r = []
 }) => {
-  const { title: l, rawContent: g, isLoading: y, error: _, loadEpub: b, setIsLoading: i } = qt(), [d, n] = ft(!1), [c, s] = ft(1.2), [m, w] = ft(30), [x, S] = ft("Inter"), F = yt(null), [E, D] = fe(
+  const { title: l, rawContent: g, isLoading: y, error: _, loadEpub: b, setIsLoading: i } = Yt(), [d, n] = ht(!1), [c, s] = ht(1.2), [m, w] = ht(30), [x, S] = ht("Inter"), D = wt(null), [C, F] = ke(
     "bokreader_tutorial_shown",
     !1
-  ), [C, z] = ft(!E);
-  ut(() => {
-    E && z(!1);
-  }, [E]);
-  const X = () => {
-    z(!1), D(!0);
+  ), [E, z] = ht(!C);
+  dt(() => {
+    C && z(!1);
+  }, [C]);
+  const Z = () => {
+    z(!1), F(!0);
   };
-  ut(() => {
-    Z && b(Z);
-  }, [Z, b]), ut(() => {
+  dt(() => {
+    X && b(X);
+  }, [X, b]), dt(() => {
     K && K(l);
-  }, [l, K]), ut(() => {
+  }, [l, K]), dt(() => {
     p && p(y);
-  }, [y, p]), ut(() => {
+  }, [y, p]), dt(() => {
     _ && A && A(_);
   }, [_, A]);
-  const h = Gt(
+  const h = Xt(
     () => ({
       "--color-tint": o,
       "--side-padding": `${m}px`,
       "--top-padding": "30px",
-      // Example: make these configurable too if needed
       "--bottom-padding": "70px",
-      // Example
       "--font-size": `${c}em`,
       "--font-family": x
     }),
-    [m, c, x]
+    [m, c, x, o]
   );
-  return _ && !y && !g ? /* @__PURE__ */ pt(
-    Nt,
+  return _ && !y && !g ? /* @__PURE__ */ ut(
+    Lt,
     {
       className: `bok-reader-container ${v || ""}`,
       style: a,
       children: [
-        /* @__PURE__ */ et(Dt, {}),
-        /* @__PURE__ */ pt("div", { style: { padding: "20px", color: "red" }, children: [
+        /* @__PURE__ */ et(Nt, {}),
+        /* @__PURE__ */ ut("div", { style: { padding: "20px", color: "red" }, children: [
           "Error loading EPUB: ",
           _
         ] })
       ]
     }
-  ) : /* @__PURE__ */ pt(
-    Nt,
+  ) : /* @__PURE__ */ ut(
+    Lt,
     {
       className: `bok-reader-container ${v || ""}`,
       style: { ...a, ...h },
-      ref: F,
+      ref: D,
       children: [
-        /* @__PURE__ */ et(Dt, {}),
+        /* @__PURE__ */ et(Nt, {}),
         /* @__PURE__ */ et(le, { isLoading: y, color: o }),
-        g && /* @__PURE__ */ pt(Lt, { children: [
-          C && !y && /* @__PURE__ */ et(
-            de,
+        g && /* @__PURE__ */ ut(Ut, { children: [
+          E && !y && /* @__PURE__ */ et(
+            we,
             {
               color: o,
-              onDismiss: X
+              onDismiss: Z
             }
           ),
           /* @__PURE__ */ et(
@@ -3393,8 +3316,8 @@ const _e = ({
               setFontSize: s,
               setFontFamily: S,
               isOptionMenuVisible: d,
-              containerElementRef: F,
-              showTutorial: C
+              containerElementRef: D,
+              showTutorial: E
             }
           ),
           d && /* @__PURE__ */ et(
@@ -3415,17 +3338,17 @@ const _e = ({
             {
               className: "bottom-click-area",
               onClick: () => {
-                C || n(!0);
+                E || n(!0);
               },
               "aria-label": "Open reader options"
             }
           )
         ] }),
-        !Z && !y && !_ && /* @__PURE__ */ et("div", { style: { padding: "20px", textAlign: "center" }, children: "No EPUB loaded." })
+        !X && !y && !_ && /* @__PURE__ */ et("div", { style: { padding: "20px", textAlign: "center" }, children: "No EPUB loaded." })
       ]
     }
   );
 };
 export {
-  _e as BokReader
+  Ce as BokReader
 };