bok-reader 0.3.5 → 0.4.0

package/dist/bok.es.js

@@ -1,10 +1,10 @@
-import { jsxs as _t, jsx as rt, Fragment as Kt } from "react/jsx-runtime";
-import Vt, { forwardRef as $t, createElement as Wt, useState as bt, useRef as At, useCallback as re, useEffect as gt, useImperativeHandle as ne } from "react";
-import './main.css';var Ft = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
-function ie($) {
+import { jsxs as _t, jsx as rt, Fragment as qt } from "react/jsx-runtime";
+import Jt, { forwardRef as Gt, createElement as Zt, useState as bt, useRef as Et, useCallback as ie, useEffect as gt, useImperativeHandle as se } from "react";
+import './main.css';var Dt = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function ae($) {
   return $ && $.__esModule && Object.prototype.hasOwnProperty.call($, "default") ? $.default : $;
 }
-var Mt = { exports: {} }, Ut = {};
+var $t = { exports: {} }, Wt = {};
 /**
  * @license React
  * react-compiler-runtime.production.js
@@ -14,16 +14,16 @@ var Mt = { exports: {} }, Ut = {};
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  */
-var Ht;
-function se() {
-  if (Ht) return Ut;
-  Ht = 1;
-  var $ = Vt.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE;
-  return Ut.c = function(t) {
+var Yt;
+function oe() {
+  if (Yt) return Wt;
+  Yt = 1;
+  var $ = Jt.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE;
+  return Wt.c = function(t) {
     return $.H.useMemoCache(t);
-  }, Ut;
+  }, Wt;
 }
-var jt = {};
+var Mt = {};
 /**
  * @license React
  * react-compiler-runtime.development.js
@@ -33,11 +33,11 @@ var jt = {};
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  */
-var qt;
-function ae() {
-  return qt || (qt = 1, process.env.NODE_ENV !== "production" && function() {
-    var $ = Vt.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE;
-    jt.c = function(t) {
+var Kt;
+function le() {
+  return Kt || (Kt = 1, process.env.NODE_ENV !== "production" && function() {
+    var $ = Jt.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE;
+    Mt.c = function(t) {
       var n = $.H;
       return n === null && console.error(
         `Invalid hook call. Hooks can only be called inside of the body of a function component. This could happen for one of the following reasons:
@@ -47,23 +47,23 @@ function ae() {
 See https://react.dev/link/invalid-hook-call for tips about how to debug and fix this problem.`
       ), n.useMemoCache(t);
     };
-  }()), jt;
+  }()), Mt;
 }
-process.env.NODE_ENV === "production" ? Mt.exports = se() : Mt.exports = ae();
-var It = Mt.exports;
+process.env.NODE_ENV === "production" ? $t.exports = oe() : $t.exports = le();
+var It = $t.exports;
 /**
  * @license lucide-react v0.555.0 - ISC
  *
  * This source code is licensed under the ISC license.
  * See the LICENSE file in the root directory of this source tree.
  */
-const oe = ($) => $.replace(/([a-z0-9])([A-Z])/g, "$1-$2").toLowerCase(), le = ($) => $.replace(
+const ce = ($) => $.replace(/([a-z0-9])([A-Z])/g, "$1-$2").toLowerCase(), ue = ($) => $.replace(
   /^([A-Z])|[\s-_]+(\w)/g,
   (t, n, I) => I ? I.toUpperCase() : n.toLowerCase()
-), Gt = ($) => {
-  const t = le($);
+), Vt = ($) => {
+  const t = ue($);
   return t.charAt(0).toUpperCase() + t.slice(1);
-}, Xt = (...$) => $.filter((t, n, I) => !!t && t.trim() !== "" && I.indexOf(t) === n).join(" ").trim(), ce = ($) => {
+}, Qt = (...$) => $.filter((t, n, I) => !!t && t.trim() !== "" && I.indexOf(t) === n).join(" ").trim(), fe = ($) => {
   for (const t in $)
     if (t.startsWith("aria-") || t === "role" || t === "title")
       return !0;
@@ -74,7 +74,7 @@ const oe = ($) => $.replace(/([a-z0-9])([A-Z])/g, "$1-$2").toLowerCase(), le = (
  * This source code is licensed under the ISC license.
  * See the LICENSE file in the root directory of this source tree.
  */
-var ue = {
+var he = {
   xmlns: "http://www.w3.org/2000/svg",
   width: 24,
   height: 24,
@@ -91,7 +91,7 @@ var ue = {
  * This source code is licensed under the ISC license.
  * See the LICENSE file in the root directory of this source tree.
  */
-const fe = $t(
+const de = Gt(
   ({
     color: $ = "currentColor",
     size: t = 24,
@@ -101,21 +101,21 @@ const fe = $t(
     children: l,
     iconNode: f,
     ...s
-  }, c) => Wt(
+  }, c) => Zt(
     "svg",
     {
       ref: c,
-      ...ue,
+      ...he,
       width: t,
       height: t,
       stroke: $,
       strokeWidth: I ? Number(n) * 24 / Number(t) : n,
-      className: Xt("lucide", h),
-      ...!l && !ce(s) && { "aria-hidden": "true" },
+      className: Qt("lucide", h),
+      ...!l && !fe(s) && { "aria-hidden": "true" },
       ...s
     },
     [
-      ...f.map(([y, v]) => Wt(y, v)),
+      ...f.map(([y, v]) => Zt(y, v)),
       ...Array.isArray(l) ? l : [l]
     ]
   )
@@ -126,20 +126,20 @@ const fe = $t(
  * This source code is licensed under the ISC license.
  * See the LICENSE file in the root directory of this source tree.
  */
-const Jt = ($, t) => {
-  const n = $t(
-    ({ className: I, ...h }, l) => Wt(fe, {
+const te = ($, t) => {
+  const n = Gt(
+    ({ className: I, ...h }, l) => Zt(de, {
       ref: l,
       iconNode: t,
-      className: Xt(
-        `lucide-${oe(Gt($))}`,
+      className: Qt(
+        `lucide-${ce(Vt($))}`,
         `lucide-${$}`,
         I
       ),
       ...h
     })
   );
-  return n.displayName = Gt($), n;
+  return n.displayName = Vt($), n;
 };
 /**
  * @license lucide-react v0.555.0 - ISC
@@ -147,18 +147,18 @@ const Jt = ($, t) => {
  * This source code is licensed under the ISC license.
  * See the LICENSE file in the root directory of this source tree.
  */
-const he = [
+const pe = [
   ["path", { d: "M4 5h16", key: "1tepv9" }],
   ["path", { d: "M4 12h16", key: "1lakjw" }],
   ["path", { d: "M4 19h16", key: "1djgab" }]
-], de = Jt("menu", he);
+], me = te("menu", pe);
 /**
  * @license lucide-react v0.555.0 - ISC
  *
  * This source code is licensed under the ISC license.
  * See the LICENSE file in the root directory of this source tree.
  */
-const pe = [
+const _e = [
   [
     "path",
     {
@@ -167,11 +167,11 @@ const pe = [
     }
   ],
   ["circle", { cx: "12", cy: "12", r: "3", key: "1v7zrd" }]
-], Qt = Jt("settings", pe);
-function Dt($) {
+], ee = te("settings", _e);
+function Lt($) {
   throw new Error('Could not dynamically require "' + $ + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
-var te = { exports: {} };
+var re = { exports: {} };
 /*!
 
 JSZip v3.10.1 - A JavaScript class for generating and reading zip files
@@ -191,7 +191,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function f(y, v) {
         if (!h[y]) {
           if (!I[y]) {
-            var w = typeof Dt == "function" && Dt;
+            var w = typeof Lt == "function" && Lt;
             if (!v && w) return w(y, !0);
             if (s) return s(y, !0);
             var b = new Error("Cannot find module '" + y + "'");
@@ -205,7 +205,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         }
         return h[y].exports;
       }
-      for (var s = typeof Dt == "function" && Dt, c = 0; c < l.length; c++) f(l[c]);
+      for (var s = typeof Lt == "function" && Lt, c = 0; c < l.length; c++) f(l[c]);
       return f;
     }({ 1: [function(n, I, h) {
       var l = n("./utils"), f = n("./support"), s = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
@@ -298,20 +298,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return d;
       }
       function f(o, p, i, d, a, m) {
-        var k, E, C = o.file, B = o.compression, P = m !== y.utf8encode, j = s.transformTo("string", m(C.name)), T = s.transformTo("string", y.utf8encode(C.name)), H = C.comment, Q = s.transformTo("string", m(H)), _ = s.transformTo("string", y.utf8encode(H)), x = T.length !== C.name.length, r = _.length !== H.length, R = "", V = "", F = "", Y = C.dir, D = C.date, J = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
-        p && !i || (J.crc32 = o.crc32, J.compressedSize = o.compressedSize, J.uncompressedSize = o.uncompressedSize);
+        var k, E, C = o.file, B = o.compression, P = m !== y.utf8encode, j = s.transformTo("string", m(C.name)), T = s.transformTo("string", y.utf8encode(C.name)), H = C.comment, Q = s.transformTo("string", m(H)), _ = s.transformTo("string", y.utf8encode(H)), x = T.length !== C.name.length, r = _.length !== H.length, R = "", K = "", F = "", Y = C.dir, D = C.date, X = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+        p && !i || (X.crc32 = o.crc32, X.compressedSize = o.compressedSize, X.uncompressedSize = o.uncompressedSize);
         var O = 0;
         p && (O |= 8), P || !x && !r || (O |= 2048);
-        var A = 0, X = 0;
-        Y && (A |= 16), a === "UNIX" ? (X = 798, A |= function(M, it) {
+        var z = 0, J = 0;
+        Y && (z |= 16), a === "UNIX" ? (J = 798, z |= function(M, it) {
           var at = M;
           return M || (at = it ? 16893 : 33204), (65535 & at) << 16;
-        }(C.unixPermissions, Y)) : (X = 20, A |= function(M) {
+        }(C.unixPermissions, Y)) : (J = 20, z |= function(M) {
           return 63 & (M || 0);
-        }(C.dosPermissions)), k = D.getUTCHours(), k <<= 6, k |= D.getUTCMinutes(), k <<= 5, k |= D.getUTCSeconds() / 2, E = D.getUTCFullYear() - 1980, E <<= 4, E |= D.getUTCMonth() + 1, E <<= 5, E |= D.getUTCDate(), x && (V = l(1, 1) + l(v(j), 4) + T, R += "up" + l(V.length, 2) + V), r && (F = l(1, 1) + l(v(Q), 4) + _, R += "uc" + l(F.length, 2) + F);
+        }(C.dosPermissions)), k = D.getUTCHours(), k <<= 6, k |= D.getUTCMinutes(), k <<= 5, k |= D.getUTCSeconds() / 2, E = D.getUTCFullYear() - 1980, E <<= 4, E |= D.getUTCMonth() + 1, E <<= 5, E |= D.getUTCDate(), x && (K = l(1, 1) + l(v(j), 4) + T, R += "up" + l(K.length, 2) + K), r && (F = l(1, 1) + l(v(Q), 4) + _, R += "uc" + l(F.length, 2) + F);
         var Z = "";
         return Z += `
-\0`, Z += l(O, 2), Z += B.magic, Z += l(k, 2), Z += l(E, 2), Z += l(J.crc32, 4), Z += l(J.compressedSize, 4), Z += l(J.uncompressedSize, 4), Z += l(j.length, 2), Z += l(R.length, 2), { fileRecord: w.LOCAL_FILE_HEADER + Z + j + R, dirRecord: w.CENTRAL_FILE_HEADER + l(X, 2) + Z + l(Q.length, 2) + "\0\0\0\0" + l(A, 4) + l(d, 4) + j + R + Q };
+\0`, Z += l(O, 2), Z += B.magic, Z += l(k, 2), Z += l(E, 2), Z += l(X.crc32, 4), Z += l(X.compressedSize, 4), Z += l(X.uncompressedSize, 4), Z += l(j.length, 2), Z += l(R.length, 2), { fileRecord: w.LOCAL_FILE_HEADER + Z + j + R, dirRecord: w.CENTRAL_FILE_HEADER + l(J, 2) + Z + l(Q.length, 2) + "\0\0\0\0" + l(z, 4) + l(d, 4) + j + R + Q };
       }
       var s = n("../utils"), c = n("../stream/GenericWorker"), y = n("../utf8"), v = n("../crc32"), w = n("../signature");
       function b(o, p, i, d) {
@@ -1240,7 +1240,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         I.exports = function(i) {
           o.push(i) !== 1 || s || f();
         };
-      }).call(this, typeof Ft < "u" ? Ft : typeof self < "u" ? self : typeof window < "u" ? window : {});
+      }).call(this, typeof Dt < "u" ? Dt : typeof self < "u" ? self : typeof window < "u" ? window : {});
     }, {}], 37: [function(n, I, h) {
       var l = n("immediate");
       function f() {
@@ -1535,62 +1535,62 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return -1 ^ f;
       };
     }, {}], 46: [function(n, I, h) {
-      var l, f = n("../utils/common"), s = n("./trees"), c = n("./adler32"), y = n("./crc32"), v = n("./messages"), w = 0, b = 4, o = 0, p = -2, i = -1, d = 4, a = 2, m = 8, k = 9, E = 286, C = 30, B = 19, P = 2 * E + 1, j = 15, T = 3, H = 258, Q = H + T + 1, _ = 42, x = 113, r = 1, R = 2, V = 3, F = 4;
-      function Y(e, L) {
-        return e.msg = v[L], L;
+      var l, f = n("../utils/common"), s = n("./trees"), c = n("./adler32"), y = n("./crc32"), v = n("./messages"), w = 0, b = 4, o = 0, p = -2, i = -1, d = 4, a = 2, m = 8, k = 9, E = 286, C = 30, B = 19, P = 2 * E + 1, j = 15, T = 3, H = 258, Q = H + T + 1, _ = 42, x = 113, r = 1, R = 2, K = 3, F = 4;
+      function Y(e, U) {
+        return e.msg = v[U], U;
       }
       function D(e) {
         return (e << 1) - (4 < e ? 9 : 0);
       }
-      function J(e) {
-        for (var L = e.length; 0 <= --L; ) e[L] = 0;
+      function X(e) {
+        for (var U = e.length; 0 <= --U; ) e[U] = 0;
       }
       function O(e) {
-        var L = e.state, N = L.pending;
-        N > e.avail_out && (N = e.avail_out), N !== 0 && (f.arraySet(e.output, L.pending_buf, L.pending_out, N, e.next_out), e.next_out += N, L.pending_out += N, e.total_out += N, e.avail_out -= N, L.pending -= N, L.pending === 0 && (L.pending_out = 0));
+        var U = e.state, N = U.pending;
+        N > e.avail_out && (N = e.avail_out), N !== 0 && (f.arraySet(e.output, U.pending_buf, U.pending_out, N, e.next_out), e.next_out += N, U.pending_out += N, e.total_out += N, e.avail_out -= N, U.pending -= N, U.pending === 0 && (U.pending_out = 0));
       }
-      function A(e, L) {
-        s._tr_flush_block(e, 0 <= e.block_start ? e.block_start : -1, e.strstart - e.block_start, L), e.block_start = e.strstart, O(e.strm);
+      function z(e, U) {
+        s._tr_flush_block(e, 0 <= e.block_start ? e.block_start : -1, e.strstart - e.block_start, U), e.block_start = e.strstart, O(e.strm);
       }
-      function X(e, L) {
-        e.pending_buf[e.pending++] = L;
+      function J(e, U) {
+        e.pending_buf[e.pending++] = U;
       }
-      function Z(e, L) {
-        e.pending_buf[e.pending++] = L >>> 8 & 255, e.pending_buf[e.pending++] = 255 & L;
+      function Z(e, U) {
+        e.pending_buf[e.pending++] = U >>> 8 & 255, e.pending_buf[e.pending++] = 255 & U;
       }
-      function M(e, L) {
-        var N, g, u = e.max_chain_length, S = e.strstart, U = e.prev_length, W = e.nice_match, z = e.strstart > e.w_size - Q ? e.strstart - (e.w_size - Q) : 0, q = e.window, K = e.w_mask, G = e.prev, et = e.strstart + H, lt = q[S + U - 1], st = q[S + U];
+      function M(e, U) {
+        var N, g, u = e.max_chain_length, S = e.strstart, L = e.prev_length, W = e.nice_match, A = e.strstart > e.w_size - Q ? e.strstart - (e.w_size - Q) : 0, q = e.window, V = e.w_mask, G = e.prev, tt = e.strstart + H, ct = q[S + L - 1], st = q[S + L];
         e.prev_length >= e.good_match && (u >>= 2), W > e.lookahead && (W = e.lookahead);
         do
-          if (q[(N = L) + U] === st && q[N + U - 1] === lt && q[N] === q[S] && q[++N] === q[S + 1]) {
+          if (q[(N = U) + L] === st && q[N + L - 1] === ct && q[N] === q[S] && q[++N] === q[S + 1]) {
             S += 2, N++;
             do
               ;
-            while (q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && S < et);
-            if (g = H - (et - S), S = et - H, U < g) {
-              if (e.match_start = L, W <= (U = g)) break;
-              lt = q[S + U - 1], st = q[S + U];
+            while (q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && q[++S] === q[++N] && S < tt);
+            if (g = H - (tt - S), S = tt - H, L < g) {
+              if (e.match_start = U, W <= (L = g)) break;
+              ct = q[S + L - 1], st = q[S + L];
             }
           }
-        while ((L = G[L & K]) > z && --u != 0);
-        return U <= e.lookahead ? U : e.lookahead;
+        while ((U = G[U & V]) > A && --u != 0);
+        return L <= e.lookahead ? L : e.lookahead;
       }
       function it(e) {
-        var L, N, g, u, S, U, W, z, q, K, G = e.w_size;
+        var U, N, g, u, S, L, W, A, q, V, G = e.w_size;
         do {
           if (u = e.window_size - e.lookahead - e.strstart, e.strstart >= G + (G - Q)) {
-            for (f.arraySet(e.window, e.window, G, G, 0), e.match_start -= G, e.strstart -= G, e.block_start -= G, L = N = e.hash_size; g = e.head[--L], e.head[L] = G <= g ? g - G : 0, --N; ) ;
-            for (L = N = G; g = e.prev[--L], e.prev[L] = G <= g ? g - G : 0, --N; ) ;
+            for (f.arraySet(e.window, e.window, G, G, 0), e.match_start -= G, e.strstart -= G, e.block_start -= G, U = N = e.hash_size; g = e.head[--U], e.head[U] = G <= g ? g - G : 0, --N; ) ;
+            for (U = N = G; g = e.prev[--U], e.prev[U] = G <= g ? g - G : 0, --N; ) ;
             u += G;
           }
           if (e.strm.avail_in === 0) break;
-          if (U = e.strm, W = e.window, z = e.strstart + e.lookahead, q = u, K = void 0, K = U.avail_in, q < K && (K = q), N = K === 0 ? 0 : (U.avail_in -= K, f.arraySet(W, U.input, U.next_in, K, z), U.state.wrap === 1 ? U.adler = c(U.adler, W, K, z) : U.state.wrap === 2 && (U.adler = y(U.adler, W, K, z)), U.next_in += K, U.total_in += K, K), e.lookahead += N, e.lookahead + e.insert >= T) for (S = e.strstart - e.insert, e.ins_h = e.window[S], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[S + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[S + T - 1]) & e.hash_mask, e.prev[S & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = S, S++, e.insert--, !(e.lookahead + e.insert < T)); ) ;
+          if (L = e.strm, W = e.window, A = e.strstart + e.lookahead, q = u, V = void 0, V = L.avail_in, q < V && (V = q), N = V === 0 ? 0 : (L.avail_in -= V, f.arraySet(W, L.input, L.next_in, V, A), L.state.wrap === 1 ? L.adler = c(L.adler, W, V, A) : L.state.wrap === 2 && (L.adler = y(L.adler, W, V, A)), L.next_in += V, L.total_in += V, V), e.lookahead += N, e.lookahead + e.insert >= T) for (S = e.strstart - e.insert, e.ins_h = e.window[S], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[S + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[S + T - 1]) & e.hash_mask, e.prev[S & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = S, S++, e.insert--, !(e.lookahead + e.insert < T)); ) ;
         } while (e.lookahead < Q && e.strm.avail_in !== 0);
       }
-      function at(e, L) {
+      function at(e, U) {
         for (var N, g; ; ) {
           if (e.lookahead < Q) {
-            if (it(e), e.lookahead < Q && L === w) return r;
+            if (it(e), e.lookahead < Q && U === w) return r;
             if (e.lookahead === 0) break;
           }
           if (N = 0, e.lookahead >= T && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + T - 1]) & e.hash_mask, N = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), N !== 0 && e.strstart - N <= e.w_size - Q && (e.match_length = M(e, N)), e.match_length >= T) if (g = s._tr_tally(e, e.strstart - e.match_start, e.match_length - T), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= T) {
@@ -1598,76 +1598,76 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             e.strstart++;
           } else e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + 1]) & e.hash_mask;
           else g = s._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
-          if (g && (A(e, !1), e.strm.avail_out === 0)) return r;
+          if (g && (z(e, !1), e.strm.avail_out === 0)) return r;
         }
-        return e.insert = e.strstart < T - 1 ? e.strstart : T - 1, L === b ? (A(e, !0), e.strm.avail_out === 0 ? V : F) : e.last_lit && (A(e, !1), e.strm.avail_out === 0) ? r : R;
+        return e.insert = e.strstart < T - 1 ? e.strstart : T - 1, U === b ? (z(e, !0), e.strm.avail_out === 0 ? K : F) : e.last_lit && (z(e, !1), e.strm.avail_out === 0) ? r : R;
       }
-      function nt(e, L) {
+      function nt(e, U) {
         for (var N, g, u; ; ) {
           if (e.lookahead < Q) {
-            if (it(e), e.lookahead < Q && L === w) return r;
+            if (it(e), e.lookahead < Q && U === w) return r;
             if (e.lookahead === 0) break;
           }
           if (N = 0, e.lookahead >= T && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + T - 1]) & e.hash_mask, N = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = T - 1, N !== 0 && e.prev_length < e.max_lazy_match && e.strstart - N <= e.w_size - Q && (e.match_length = M(e, N), e.match_length <= 5 && (e.strategy === 1 || e.match_length === T && 4096 < e.strstart - e.match_start) && (e.match_length = T - 1)), e.prev_length >= T && e.match_length <= e.prev_length) {
             for (u = e.strstart + e.lookahead - T, g = s._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - T), e.lookahead -= e.prev_length - 1, e.prev_length -= 2; ++e.strstart <= u && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + T - 1]) & e.hash_mask, N = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), --e.prev_length != 0; ) ;
-            if (e.match_available = 0, e.match_length = T - 1, e.strstart++, g && (A(e, !1), e.strm.avail_out === 0)) return r;
+            if (e.match_available = 0, e.match_length = T - 1, e.strstart++, g && (z(e, !1), e.strm.avail_out === 0)) return r;
           } else if (e.match_available) {
-            if ((g = s._tr_tally(e, 0, e.window[e.strstart - 1])) && A(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return r;
+            if ((g = s._tr_tally(e, 0, e.window[e.strstart - 1])) && z(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return r;
           } else e.match_available = 1, e.strstart++, e.lookahead--;
         }
-        return e.match_available && (g = s._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < T - 1 ? e.strstart : T - 1, L === b ? (A(e, !0), e.strm.avail_out === 0 ? V : F) : e.last_lit && (A(e, !1), e.strm.avail_out === 0) ? r : R;
+        return e.match_available && (g = s._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < T - 1 ? e.strstart : T - 1, U === b ? (z(e, !0), e.strm.avail_out === 0 ? K : F) : e.last_lit && (z(e, !1), e.strm.avail_out === 0) ? r : R;
       }
-      function tt(e, L, N, g, u) {
-        this.good_length = e, this.max_lazy = L, this.nice_length = N, this.max_chain = g, this.func = u;
+      function et(e, U, N, g, u) {
+        this.good_length = e, this.max_lazy = U, this.nice_length = N, this.max_chain = g, this.func = u;
       }
       function ot() {
-        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 f.Buf16(2 * P), this.dyn_dtree = new f.Buf16(2 * (2 * C + 1)), this.bl_tree = new f.Buf16(2 * (2 * B + 1)), J(this.dyn_ltree), J(this.dyn_dtree), J(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new f.Buf16(j + 1), this.heap = new f.Buf16(2 * E + 1), J(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new f.Buf16(2 * E + 1), J(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 f.Buf16(2 * P), this.dyn_dtree = new f.Buf16(2 * (2 * C + 1)), this.bl_tree = new f.Buf16(2 * (2 * B + 1)), X(this.dyn_ltree), X(this.dyn_dtree), X(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new f.Buf16(j + 1), this.heap = new f.Buf16(2 * E + 1), X(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new f.Buf16(2 * E + 1), X(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 ct(e) {
-        var L;
-        return e && e.state ? (e.total_in = e.total_out = 0, e.data_type = a, (L = e.state).pending = 0, L.pending_out = 0, L.wrap < 0 && (L.wrap = -L.wrap), L.status = L.wrap ? _ : x, e.adler = L.wrap === 2 ? 0 : 1, L.last_flush = w, s._tr_init(L), o) : Y(e, p);
+      function lt(e) {
+        var U;
+        return e && e.state ? (e.total_in = e.total_out = 0, e.data_type = a, (U = e.state).pending = 0, U.pending_out = 0, U.wrap < 0 && (U.wrap = -U.wrap), U.status = U.wrap ? _ : x, e.adler = U.wrap === 2 ? 0 : 1, U.last_flush = w, s._tr_init(U), o) : Y(e, p);
       }
-      function ut(e) {
-        var L = ct(e);
-        return L === o && function(N) {
-          N.window_size = 2 * N.w_size, J(N.head), N.max_lazy_match = l[N.level].max_lazy, N.good_match = l[N.level].good_length, N.nice_match = l[N.level].nice_length, N.max_chain_length = l[N.level].max_chain, N.strstart = 0, N.block_start = 0, N.lookahead = 0, N.insert = 0, N.match_length = N.prev_length = T - 1, N.match_available = 0, N.ins_h = 0;
-        }(e.state), L;
+      function ft(e) {
+        var U = lt(e);
+        return U === o && function(N) {
+          N.window_size = 2 * N.w_size, X(N.head), N.max_lazy_match = l[N.level].max_lazy, N.good_match = l[N.level].good_length, N.nice_match = l[N.level].nice_length, N.max_chain_length = l[N.level].max_chain, N.strstart = 0, N.block_start = 0, N.lookahead = 0, N.insert = 0, N.match_length = N.prev_length = T - 1, N.match_available = 0, N.ins_h = 0;
+        }(e.state), U;
       }
-      function ft(e, L, N, g, u, S) {
+      function ut(e, U, N, g, u, S) {
         if (!e) return p;
-        var U = 1;
-        if (L === i && (L = 6), g < 0 ? (U = 0, g = -g) : 15 < g && (U = 2, g -= 16), u < 1 || k < u || N !== m || g < 8 || 15 < g || L < 0 || 9 < L || S < 0 || d < S) return Y(e, p);
+        var L = 1;
+        if (U === i && (U = 6), g < 0 ? (L = 0, g = -g) : 15 < g && (L = 2, g -= 16), u < 1 || k < u || N !== m || g < 8 || 15 < g || U < 0 || 9 < U || S < 0 || d < S) return Y(e, p);
         g === 8 && (g = 9);
         var W = new ot();
-        return (e.state = W).strm = e, W.wrap = U, W.gzhead = null, W.w_bits = g, W.w_size = 1 << W.w_bits, W.w_mask = W.w_size - 1, W.hash_bits = u + 7, W.hash_size = 1 << W.hash_bits, W.hash_mask = W.hash_size - 1, W.hash_shift = ~~((W.hash_bits + T - 1) / T), W.window = new f.Buf8(2 * W.w_size), W.head = new f.Buf16(W.hash_size), W.prev = new f.Buf16(W.w_size), W.lit_bufsize = 1 << u + 6, W.pending_buf_size = 4 * W.lit_bufsize, W.pending_buf = new f.Buf8(W.pending_buf_size), W.d_buf = 1 * W.lit_bufsize, W.l_buf = 3 * W.lit_bufsize, W.level = L, W.strategy = S, W.method = N, ut(e);
+        return (e.state = W).strm = e, W.wrap = L, W.gzhead = null, W.w_bits = g, W.w_size = 1 << W.w_bits, W.w_mask = W.w_size - 1, W.hash_bits = u + 7, W.hash_size = 1 << W.hash_bits, W.hash_mask = W.hash_size - 1, W.hash_shift = ~~((W.hash_bits + T - 1) / T), W.window = new f.Buf8(2 * W.w_size), W.head = new f.Buf16(W.hash_size), W.prev = new f.Buf16(W.w_size), W.lit_bufsize = 1 << u + 6, W.pending_buf_size = 4 * W.lit_bufsize, W.pending_buf = new f.Buf8(W.pending_buf_size), W.d_buf = 1 * W.lit_bufsize, W.l_buf = 3 * W.lit_bufsize, W.level = U, W.strategy = S, W.method = N, ft(e);
       }
-      l = [new tt(0, 0, 0, 0, function(e, L) {
+      l = [new et(0, 0, 0, 0, function(e, U) {
         var N = 65535;
         for (N > e.pending_buf_size - 5 && (N = e.pending_buf_size - 5); ; ) {
           if (e.lookahead <= 1) {
-            if (it(e), e.lookahead === 0 && L === w) return r;
+            if (it(e), e.lookahead === 0 && U === w) return r;
             if (e.lookahead === 0) break;
           }
           e.strstart += e.lookahead, e.lookahead = 0;
           var g = e.block_start + N;
-          if ((e.strstart === 0 || e.strstart >= g) && (e.lookahead = e.strstart - g, e.strstart = g, A(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - Q && (A(e, !1), e.strm.avail_out === 0)) return r;
+          if ((e.strstart === 0 || e.strstart >= g) && (e.lookahead = e.strstart - g, e.strstart = g, z(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - Q && (z(e, !1), e.strm.avail_out === 0)) return r;
         }
-        return e.insert = 0, L === b ? (A(e, !0), e.strm.avail_out === 0 ? V : F) : (e.strstart > e.block_start && (A(e, !1), e.strm.avail_out), r);
-      }), new tt(4, 4, 8, 4, at), new tt(4, 5, 16, 8, at), new tt(4, 6, 32, 32, at), new tt(4, 4, 16, 16, nt), new tt(8, 16, 32, 32, nt), new tt(8, 16, 128, 128, nt), new tt(8, 32, 128, 256, nt), new tt(32, 128, 258, 1024, nt), new tt(32, 258, 258, 4096, nt)], h.deflateInit = function(e, L) {
-        return ft(e, L, m, 15, 8, 0);
-      }, h.deflateInit2 = ft, h.deflateReset = ut, h.deflateResetKeep = ct, h.deflateSetHeader = function(e, L) {
-        return e && e.state ? e.state.wrap !== 2 ? p : (e.state.gzhead = L, o) : p;
-      }, h.deflate = function(e, L) {
+        return e.insert = 0, U === b ? (z(e, !0), e.strm.avail_out === 0 ? K : F) : (e.strstart > e.block_start && (z(e, !1), e.strm.avail_out), r);
+      }), new et(4, 4, 8, 4, at), new et(4, 5, 16, 8, at), new et(4, 6, 32, 32, at), new et(4, 4, 16, 16, nt), new et(8, 16, 32, 32, nt), new et(8, 16, 128, 128, nt), new et(8, 32, 128, 256, nt), new et(32, 128, 258, 1024, nt), new et(32, 258, 258, 4096, nt)], h.deflateInit = function(e, U) {
+        return ut(e, U, m, 15, 8, 0);
+      }, h.deflateInit2 = ut, h.deflateReset = ft, h.deflateResetKeep = lt, h.deflateSetHeader = function(e, U) {
+        return e && e.state ? e.state.wrap !== 2 ? p : (e.state.gzhead = U, o) : p;
+      }, h.deflate = function(e, U) {
         var N, g, u, S;
-        if (!e || !e.state || 5 < L || L < 0) return e ? Y(e, p) : p;
-        if (g = e.state, !e.output || !e.input && e.avail_in !== 0 || g.status === 666 && L !== b) return Y(e, e.avail_out === 0 ? -5 : p);
-        if (g.strm = e, N = g.last_flush, g.last_flush = L, g.status === _) if (g.wrap === 2) e.adler = 0, X(g, 31), X(g, 139), X(g, 8), g.gzhead ? (X(g, (g.gzhead.text ? 1 : 0) + (g.gzhead.hcrc ? 2 : 0) + (g.gzhead.extra ? 4 : 0) + (g.gzhead.name ? 8 : 0) + (g.gzhead.comment ? 16 : 0)), X(g, 255 & g.gzhead.time), X(g, g.gzhead.time >> 8 & 255), X(g, g.gzhead.time >> 16 & 255), X(g, g.gzhead.time >> 24 & 255), X(g, g.level === 9 ? 2 : 2 <= g.strategy || g.level < 2 ? 4 : 0), X(g, 255 & g.gzhead.os), g.gzhead.extra && g.gzhead.extra.length && (X(g, 255 & g.gzhead.extra.length), X(g, g.gzhead.extra.length >> 8 & 255)), g.gzhead.hcrc && (e.adler = y(e.adler, g.pending_buf, g.pending, 0)), g.gzindex = 0, g.status = 69) : (X(g, 0), X(g, 0), X(g, 0), X(g, 0), X(g, 0), X(g, g.level === 9 ? 2 : 2 <= g.strategy || g.level < 2 ? 4 : 0), X(g, 3), g.status = x);
+        if (!e || !e.state || 5 < U || U < 0) return e ? Y(e, p) : p;
+        if (g = e.state, !e.output || !e.input && e.avail_in !== 0 || g.status === 666 && U !== b) return Y(e, e.avail_out === 0 ? -5 : p);
+        if (g.strm = e, N = g.last_flush, g.last_flush = U, g.status === _) if (g.wrap === 2) e.adler = 0, J(g, 31), J(g, 139), J(g, 8), g.gzhead ? (J(g, (g.gzhead.text ? 1 : 0) + (g.gzhead.hcrc ? 2 : 0) + (g.gzhead.extra ? 4 : 0) + (g.gzhead.name ? 8 : 0) + (g.gzhead.comment ? 16 : 0)), J(g, 255 & g.gzhead.time), J(g, g.gzhead.time >> 8 & 255), J(g, g.gzhead.time >> 16 & 255), J(g, g.gzhead.time >> 24 & 255), J(g, g.level === 9 ? 2 : 2 <= g.strategy || g.level < 2 ? 4 : 0), J(g, 255 & g.gzhead.os), g.gzhead.extra && g.gzhead.extra.length && (J(g, 255 & g.gzhead.extra.length), J(g, g.gzhead.extra.length >> 8 & 255)), g.gzhead.hcrc && (e.adler = y(e.adler, g.pending_buf, g.pending, 0)), g.gzindex = 0, g.status = 69) : (J(g, 0), J(g, 0), J(g, 0), J(g, 0), J(g, 0), J(g, g.level === 9 ? 2 : 2 <= g.strategy || g.level < 2 ? 4 : 0), J(g, 3), g.status = x);
         else {
-          var U = m + (g.w_bits - 8 << 4) << 8;
-          U |= (2 <= g.strategy || g.level < 2 ? 0 : g.level < 6 ? 1 : g.level === 6 ? 2 : 3) << 6, g.strstart !== 0 && (U |= 32), U += 31 - U % 31, g.status = x, Z(g, U), g.strstart !== 0 && (Z(g, e.adler >>> 16), Z(g, 65535 & e.adler)), e.adler = 1;
+          var L = m + (g.w_bits - 8 << 4) << 8;
+          L |= (2 <= g.strategy || g.level < 2 ? 0 : g.level < 6 ? 1 : g.level === 6 ? 2 : 3) << 6, g.strstart !== 0 && (L |= 32), L += 31 - L % 31, g.status = x, Z(g, L), g.strstart !== 0 && (Z(g, e.adler >>> 16), Z(g, 65535 & e.adler)), e.adler = 1;
         }
         if (g.status === 69) if (g.gzhead.extra) {
-          for (u = g.pending; g.gzindex < (65535 & g.gzhead.extra.length) && (g.pending !== g.pending_buf_size || (g.gzhead.hcrc && g.pending > u && (e.adler = y(e.adler, g.pending_buf, g.pending - u, u)), O(e), u = g.pending, g.pending !== g.pending_buf_size)); ) X(g, 255 & g.gzhead.extra[g.gzindex]), g.gzindex++;
+          for (u = g.pending; g.gzindex < (65535 & g.gzhead.extra.length) && (g.pending !== g.pending_buf_size || (g.gzhead.hcrc && g.pending > u && (e.adler = y(e.adler, g.pending_buf, g.pending - u, u)), O(e), u = g.pending, g.pending !== g.pending_buf_size)); ) J(g, 255 & g.gzhead.extra[g.gzindex]), g.gzindex++;
           g.gzhead.hcrc && g.pending > u && (e.adler = y(e.adler, g.pending_buf, g.pending - u, u)), g.gzindex === g.gzhead.extra.length && (g.gzindex = 0, g.status = 73);
         } else g.status = 73;
         if (g.status === 73) if (g.gzhead.name) {
@@ -1677,7 +1677,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               S = 1;
               break;
             }
-            S = g.gzindex < g.gzhead.name.length ? 255 & g.gzhead.name.charCodeAt(g.gzindex++) : 0, X(g, S);
+            S = g.gzindex < g.gzhead.name.length ? 255 & g.gzhead.name.charCodeAt(g.gzindex++) : 0, J(g, S);
           } while (S !== 0);
           g.gzhead.hcrc && g.pending > u && (e.adler = y(e.adler, g.pending_buf, g.pending - u, u)), S === 0 && (g.gzindex = 0, g.status = 91);
         } else g.status = 91;
@@ -1688,56 +1688,56 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               S = 1;
               break;
             }
-            S = g.gzindex < g.gzhead.comment.length ? 255 & g.gzhead.comment.charCodeAt(g.gzindex++) : 0, X(g, S);
+            S = g.gzindex < g.gzhead.comment.length ? 255 & g.gzhead.comment.charCodeAt(g.gzindex++) : 0, J(g, S);
           } while (S !== 0);
           g.gzhead.hcrc && g.pending > u && (e.adler = y(e.adler, g.pending_buf, g.pending - u, u)), S === 0 && (g.status = 103);
         } else g.status = 103;
-        if (g.status === 103 && (g.gzhead.hcrc ? (g.pending + 2 > g.pending_buf_size && O(e), g.pending + 2 <= g.pending_buf_size && (X(g, 255 & e.adler), X(g, e.adler >> 8 & 255), e.adler = 0, g.status = x)) : g.status = x), g.pending !== 0) {
+        if (g.status === 103 && (g.gzhead.hcrc ? (g.pending + 2 > g.pending_buf_size && O(e), g.pending + 2 <= g.pending_buf_size && (J(g, 255 & e.adler), J(g, e.adler >> 8 & 255), e.adler = 0, g.status = x)) : g.status = x), g.pending !== 0) {
           if (O(e), e.avail_out === 0) return g.last_flush = -1, o;
-        } else if (e.avail_in === 0 && D(L) <= D(N) && L !== b) return Y(e, -5);
+        } else if (e.avail_in === 0 && D(U) <= D(N) && U !== b) return Y(e, -5);
         if (g.status === 666 && e.avail_in !== 0) return Y(e, -5);
-        if (e.avail_in !== 0 || g.lookahead !== 0 || L !== w && g.status !== 666) {
-          var W = g.strategy === 2 ? function(z, q) {
-            for (var K; ; ) {
-              if (z.lookahead === 0 && (it(z), z.lookahead === 0)) {
+        if (e.avail_in !== 0 || g.lookahead !== 0 || U !== w && g.status !== 666) {
+          var W = g.strategy === 2 ? function(A, q) {
+            for (var V; ; ) {
+              if (A.lookahead === 0 && (it(A), A.lookahead === 0)) {
                 if (q === w) return r;
                 break;
               }
-              if (z.match_length = 0, K = s._tr_tally(z, 0, z.window[z.strstart]), z.lookahead--, z.strstart++, K && (A(z, !1), z.strm.avail_out === 0)) return r;
+              if (A.match_length = 0, V = s._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++, V && (z(A, !1), A.strm.avail_out === 0)) return r;
             }
-            return z.insert = 0, q === b ? (A(z, !0), z.strm.avail_out === 0 ? V : F) : z.last_lit && (A(z, !1), z.strm.avail_out === 0) ? r : R;
-          }(g, L) : g.strategy === 3 ? function(z, q) {
-            for (var K, G, et, lt, st = z.window; ; ) {
-              if (z.lookahead <= H) {
-                if (it(z), z.lookahead <= H && q === w) return r;
-                if (z.lookahead === 0) break;
+            return A.insert = 0, q === b ? (z(A, !0), A.strm.avail_out === 0 ? K : F) : A.last_lit && (z(A, !1), A.strm.avail_out === 0) ? r : R;
+          }(g, U) : g.strategy === 3 ? function(A, q) {
+            for (var V, G, tt, ct, st = A.window; ; ) {
+              if (A.lookahead <= H) {
+                if (it(A), A.lookahead <= H && q === w) return r;
+                if (A.lookahead === 0) break;
               }
-              if (z.match_length = 0, z.lookahead >= T && 0 < z.strstart && (G = st[et = z.strstart - 1]) === st[++et] && G === st[++et] && G === st[++et]) {
-                lt = z.strstart + H;
+              if (A.match_length = 0, A.lookahead >= T && 0 < A.strstart && (G = st[tt = A.strstart - 1]) === st[++tt] && G === st[++tt] && G === st[++tt]) {
+                ct = A.strstart + H;
                 do
                   ;
-                while (G === st[++et] && G === st[++et] && G === st[++et] && G === st[++et] && G === st[++et] && G === st[++et] && G === st[++et] && G === st[++et] && et < lt);
-                z.match_length = H - (lt - et), z.match_length > z.lookahead && (z.match_length = z.lookahead);
+                while (G === st[++tt] && G === st[++tt] && G === st[++tt] && G === st[++tt] && G === st[++tt] && G === st[++tt] && G === st[++tt] && G === st[++tt] && tt < ct);
+                A.match_length = H - (ct - tt), A.match_length > A.lookahead && (A.match_length = A.lookahead);
               }
-              if (z.match_length >= T ? (K = s._tr_tally(z, 1, z.match_length - T), z.lookahead -= z.match_length, z.strstart += z.match_length, z.match_length = 0) : (K = s._tr_tally(z, 0, z.window[z.strstart]), z.lookahead--, z.strstart++), K && (A(z, !1), z.strm.avail_out === 0)) return r;
+              if (A.match_length >= T ? (V = s._tr_tally(A, 1, A.match_length - T), A.lookahead -= A.match_length, A.strstart += A.match_length, A.match_length = 0) : (V = s._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++), V && (z(A, !1), A.strm.avail_out === 0)) return r;
             }
-            return z.insert = 0, q === b ? (A(z, !0), z.strm.avail_out === 0 ? V : F) : z.last_lit && (A(z, !1), z.strm.avail_out === 0) ? r : R;
-          }(g, L) : l[g.level].func(g, L);
-          if (W !== V && W !== F || (g.status = 666), W === r || W === V) return e.avail_out === 0 && (g.last_flush = -1), o;
-          if (W === R && (L === 1 ? s._tr_align(g) : L !== 5 && (s._tr_stored_block(g, 0, 0, !1), L === 3 && (J(g.head), g.lookahead === 0 && (g.strstart = 0, g.block_start = 0, g.insert = 0))), O(e), e.avail_out === 0)) return g.last_flush = -1, o;
+            return A.insert = 0, q === b ? (z(A, !0), A.strm.avail_out === 0 ? K : F) : A.last_lit && (z(A, !1), A.strm.avail_out === 0) ? r : R;
+          }(g, U) : l[g.level].func(g, U);
+          if (W !== K && W !== F || (g.status = 666), W === r || W === K) return e.avail_out === 0 && (g.last_flush = -1), o;
+          if (W === R && (U === 1 ? s._tr_align(g) : U !== 5 && (s._tr_stored_block(g, 0, 0, !1), U === 3 && (X(g.head), g.lookahead === 0 && (g.strstart = 0, g.block_start = 0, g.insert = 0))), O(e), e.avail_out === 0)) return g.last_flush = -1, o;
         }
-        return L !== b ? o : g.wrap <= 0 ? 1 : (g.wrap === 2 ? (X(g, 255 & e.adler), X(g, e.adler >> 8 & 255), X(g, e.adler >> 16 & 255), X(g, e.adler >> 24 & 255), X(g, 255 & e.total_in), X(g, e.total_in >> 8 & 255), X(g, e.total_in >> 16 & 255), X(g, e.total_in >> 24 & 255)) : (Z(g, e.adler >>> 16), Z(g, 65535 & e.adler)), O(e), 0 < g.wrap && (g.wrap = -g.wrap), g.pending !== 0 ? o : 1);
+        return U !== b ? o : g.wrap <= 0 ? 1 : (g.wrap === 2 ? (J(g, 255 & e.adler), J(g, e.adler >> 8 & 255), J(g, e.adler >> 16 & 255), J(g, e.adler >> 24 & 255), J(g, 255 & e.total_in), J(g, e.total_in >> 8 & 255), J(g, e.total_in >> 16 & 255), J(g, e.total_in >> 24 & 255)) : (Z(g, e.adler >>> 16), Z(g, 65535 & e.adler)), O(e), 0 < g.wrap && (g.wrap = -g.wrap), g.pending !== 0 ? o : 1);
       }, h.deflateEnd = function(e) {
-        var L;
-        return e && e.state ? (L = e.state.status) !== _ && L !== 69 && L !== 73 && L !== 91 && L !== 103 && L !== x && L !== 666 ? Y(e, p) : (e.state = null, L === x ? Y(e, -3) : o) : p;
-      }, h.deflateSetDictionary = function(e, L) {
-        var N, g, u, S, U, W, z, q, K = L.length;
+        var U;
+        return e && e.state ? (U = e.state.status) !== _ && U !== 69 && U !== 73 && U !== 91 && U !== 103 && U !== x && U !== 666 ? Y(e, p) : (e.state = null, U === x ? Y(e, -3) : o) : p;
+      }, h.deflateSetDictionary = function(e, U) {
+        var N, g, u, S, L, W, A, q, V = U.length;
         if (!e || !e.state || (S = (N = e.state).wrap) === 2 || S === 1 && N.status !== _ || N.lookahead) return p;
-        for (S === 1 && (e.adler = c(e.adler, L, K, 0)), N.wrap = 0, K >= N.w_size && (S === 0 && (J(N.head), N.strstart = 0, N.block_start = 0, N.insert = 0), q = new f.Buf8(N.w_size), f.arraySet(q, L, K - N.w_size, N.w_size, 0), L = q, K = N.w_size), U = e.avail_in, W = e.next_in, z = e.input, e.avail_in = K, e.next_in = 0, e.input = L, it(N); N.lookahead >= T; ) {
+        for (S === 1 && (e.adler = c(e.adler, U, V, 0)), N.wrap = 0, V >= N.w_size && (S === 0 && (X(N.head), N.strstart = 0, N.block_start = 0, N.insert = 0), q = new f.Buf8(N.w_size), f.arraySet(q, U, V - N.w_size, N.w_size, 0), U = q, V = N.w_size), L = e.avail_in, W = e.next_in, A = e.input, e.avail_in = V, e.next_in = 0, e.input = U, it(N); N.lookahead >= T; ) {
           for (g = N.strstart, u = N.lookahead - (T - 1); N.ins_h = (N.ins_h << N.hash_shift ^ N.window[g + T - 1]) & N.hash_mask, N.prev[g & N.w_mask] = N.head[N.ins_h], N.head[N.ins_h] = g, g++, --u; ) ;
           N.strstart = g, N.lookahead = T - 1, it(N);
         }
-        return N.strstart += N.lookahead, N.block_start = N.strstart, N.insert = N.lookahead, N.lookahead = 0, N.match_length = N.prev_length = T - 1, N.match_available = 0, e.next_in = W, e.input = z, e.avail_in = U, N.wrap = S, o;
+        return N.strstart += N.lookahead, N.block_start = N.strstart, N.insert = N.lookahead, N.lookahead = 0, N.match_length = N.prev_length = T - 1, N.match_available = 0, e.next_in = W, e.input = A, e.avail_in = L, N.wrap = S, o;
       }, h.deflateInfo = "pako deflate (from Nodeca project)";
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(n, I, h) {
       I.exports = function() {
@@ -1852,27 +1852,27 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         _.lencode = P, _.lenbits = 9, _.distcode = j, _.distbits = 5;
       }
       function Q(_, x, r, R) {
-        var V, F = _.state;
-        return F.window === null && (F.wsize = 1 << F.wbits, F.wnext = 0, F.whave = 0, F.window = new l.Buf8(F.wsize)), R >= F.wsize ? (l.arraySet(F.window, x, r - F.wsize, F.wsize, 0), F.wnext = 0, F.whave = F.wsize) : (R < (V = F.wsize - F.wnext) && (V = R), l.arraySet(F.window, x, r - R, V, F.wnext), (R -= V) ? (l.arraySet(F.window, x, r - R, R, 0), F.wnext = R, F.whave = F.wsize) : (F.wnext += V, F.wnext === F.wsize && (F.wnext = 0), F.whave < F.wsize && (F.whave += V))), 0;
+        var K, F = _.state;
+        return F.window === null && (F.wsize = 1 << F.wbits, F.wnext = 0, F.whave = 0, F.window = new l.Buf8(F.wsize)), R >= F.wsize ? (l.arraySet(F.window, x, r - F.wsize, F.wsize, 0), F.wnext = 0, F.whave = F.wsize) : (R < (K = F.wsize - F.wnext) && (K = R), l.arraySet(F.window, x, r - R, K, F.wnext), (R -= K) ? (l.arraySet(F.window, x, r - R, R, 0), F.wnext = R, F.whave = F.wsize) : (F.wnext += K, F.wnext === F.wsize && (F.wnext = 0), F.whave < F.wsize && (F.whave += K))), 0;
       }
       h.inflateReset = E, h.inflateReset2 = C, h.inflateResetKeep = k, h.inflateInit = function(_) {
         return B(_, 15);
       }, h.inflateInit2 = B, h.inflate = function(_, x) {
-        var r, R, V, F, Y, D, J, O, A, X, Z, M, it, at, nt, tt, ot, ct, ut, ft, e, L, N, g, u = 0, S = new l.Buf8(4), U = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+        var r, R, K, F, Y, D, X, O, z, J, Z, M, it, at, nt, et, ot, lt, ft, ut, e, U, N, g, u = 0, S = new l.Buf8(4), L = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
         if (!_ || !_.state || !_.output || !_.input && _.avail_in !== 0) return o;
-        (r = _.state).mode === 12 && (r.mode = 13), Y = _.next_out, V = _.output, J = _.avail_out, F = _.next_in, R = _.input, D = _.avail_in, O = r.hold, A = r.bits, X = D, Z = J, L = b;
+        (r = _.state).mode === 12 && (r.mode = 13), Y = _.next_out, K = _.output, X = _.avail_out, F = _.next_in, R = _.input, D = _.avail_in, O = r.hold, z = r.bits, J = D, Z = X, U = b;
         t: for (; ; ) switch (r.mode) {
           case p:
             if (r.wrap === 0) {
               r.mode = 13;
               break;
             }
-            for (; A < 16; ) {
+            for (; z < 16; ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
             if (2 & r.wrap && O === 35615) {
-              S[r.check = 0] = 255 & O, S[1] = O >>> 8 & 255, r.check = s(r.check, S, 2, 0), A = O = 0, r.mode = 2;
+              S[r.check = 0] = 255 & O, S[1] = O >>> 8 & 255, r.check = s(r.check, S, 2, 0), z = O = 0, r.mode = 2;
               break;
             }
             if (r.flags = 0, r.head && (r.head.done = !1), !(1 & r.wrap) || (((255 & O) << 8) + (O >> 8)) % 31) {
@@ -1883,17 +1883,17 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               _.msg = "unknown compression method", r.mode = 30;
               break;
             }
-            if (A -= 4, e = 8 + (15 & (O >>>= 4)), r.wbits === 0) r.wbits = e;
+            if (z -= 4, e = 8 + (15 & (O >>>= 4)), r.wbits === 0) r.wbits = e;
             else if (e > r.wbits) {
               _.msg = "invalid window size", r.mode = 30;
               break;
             }
-            r.dmax = 1 << e, _.adler = r.check = 1, r.mode = 512 & O ? 10 : 12, A = O = 0;
+            r.dmax = 1 << e, _.adler = r.check = 1, r.mode = 512 & O ? 10 : 12, z = O = 0;
             break;
           case 2:
-            for (; A < 16; ) {
+            for (; z < 16; ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
             if (r.flags = O, (255 & r.flags) != 8) {
               _.msg = "unknown compression method", r.mode = 30;
@@ -1903,26 +1903,26 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               _.msg = "unknown header flags set", r.mode = 30;
               break;
             }
-            r.head && (r.head.text = O >> 8 & 1), 512 & r.flags && (S[0] = 255 & O, S[1] = O >>> 8 & 255, r.check = s(r.check, S, 2, 0)), A = O = 0, r.mode = 3;
+            r.head && (r.head.text = O >> 8 & 1), 512 & r.flags && (S[0] = 255 & O, S[1] = O >>> 8 & 255, r.check = s(r.check, S, 2, 0)), z = O = 0, r.mode = 3;
           case 3:
-            for (; A < 32; ) {
+            for (; z < 32; ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
-            r.head && (r.head.time = O), 512 & r.flags && (S[0] = 255 & O, S[1] = O >>> 8 & 255, S[2] = O >>> 16 & 255, S[3] = O >>> 24 & 255, r.check = s(r.check, S, 4, 0)), A = O = 0, r.mode = 4;
+            r.head && (r.head.time = O), 512 & r.flags && (S[0] = 255 & O, S[1] = O >>> 8 & 255, S[2] = O >>> 16 & 255, S[3] = O >>> 24 & 255, r.check = s(r.check, S, 4, 0)), z = O = 0, r.mode = 4;
           case 4:
-            for (; A < 16; ) {
+            for (; z < 16; ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
-            r.head && (r.head.xflags = 255 & O, r.head.os = O >> 8), 512 & r.flags && (S[0] = 255 & O, S[1] = O >>> 8 & 255, r.check = s(r.check, S, 2, 0)), A = O = 0, r.mode = 5;
+            r.head && (r.head.xflags = 255 & O, r.head.os = O >> 8), 512 & r.flags && (S[0] = 255 & O, S[1] = O >>> 8 & 255, r.check = s(r.check, S, 2, 0)), z = O = 0, r.mode = 5;
           case 5:
             if (1024 & r.flags) {
-              for (; A < 16; ) {
+              for (; z < 16; ) {
                 if (D === 0) break t;
-                D--, O += R[F++] << A, A += 8;
+                D--, O += R[F++] << z, z += 8;
               }
-              r.length = O, r.head && (r.head.extra_len = O), 512 & r.flags && (S[0] = 255 & O, S[1] = O >>> 8 & 255, r.check = s(r.check, S, 2, 0)), A = O = 0;
+              r.length = O, r.head && (r.head.extra_len = O), 512 & r.flags && (S[0] = 255 & O, S[1] = O >>> 8 & 255, r.check = s(r.check, S, 2, 0)), z = O = 0;
             } else r.head && (r.head.extra = null);
             r.mode = 6;
           case 6:
@@ -1944,45 +1944,45 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             r.mode = 9;
           case 9:
             if (512 & r.flags) {
-              for (; A < 16; ) {
+              for (; z < 16; ) {
                 if (D === 0) break t;
-                D--, O += R[F++] << A, A += 8;
+                D--, O += R[F++] << z, z += 8;
               }
               if (O !== (65535 & r.check)) {
                 _.msg = "header crc mismatch", r.mode = 30;
                 break;
               }
-              A = O = 0;
+              z = O = 0;
             }
             r.head && (r.head.hcrc = r.flags >> 9 & 1, r.head.done = !0), _.adler = r.check = 0, r.mode = 12;
             break;
           case 10:
-            for (; A < 32; ) {
+            for (; z < 32; ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
-            _.adler = r.check = a(O), A = O = 0, r.mode = 11;
+            _.adler = r.check = a(O), z = O = 0, r.mode = 11;
           case 11:
-            if (r.havedict === 0) return _.next_out = Y, _.avail_out = J, _.next_in = F, _.avail_in = D, r.hold = O, r.bits = A, 2;
+            if (r.havedict === 0) return _.next_out = Y, _.avail_out = X, _.next_in = F, _.avail_in = D, r.hold = O, r.bits = z, 2;
             _.adler = r.check = 1, r.mode = 12;
           case 12:
             if (x === 5 || x === 6) break t;
           case 13:
             if (r.last) {
-              O >>>= 7 & A, A -= 7 & A, r.mode = 27;
+              O >>>= 7 & z, z -= 7 & z, r.mode = 27;
               break;
             }
-            for (; A < 3; ) {
+            for (; z < 3; ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
-            switch (r.last = 1 & O, A -= 1, 3 & (O >>>= 1)) {
+            switch (r.last = 1 & O, z -= 1, 3 & (O >>>= 1)) {
               case 0:
                 r.mode = 14;
                 break;
               case 1:
                 if (H(r), r.mode = 20, x !== 6) break;
-                O >>>= 2, A -= 2;
+                O >>>= 2, z -= 2;
                 break t;
               case 2:
                 r.mode = 17;
@@ -1990,82 +1990,82 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               case 3:
                 _.msg = "invalid block type", r.mode = 30;
             }
-            O >>>= 2, A -= 2;
+            O >>>= 2, z -= 2;
             break;
           case 14:
-            for (O >>>= 7 & A, A -= 7 & A; A < 32; ) {
+            for (O >>>= 7 & z, z -= 7 & z; z < 32; ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
             if ((65535 & O) != (O >>> 16 ^ 65535)) {
               _.msg = "invalid stored block lengths", r.mode = 30;
               break;
             }
-            if (r.length = 65535 & O, A = O = 0, r.mode = 15, x === 6) break t;
+            if (r.length = 65535 & O, z = O = 0, r.mode = 15, x === 6) break t;
           case 15:
             r.mode = 16;
           case 16:
             if (M = r.length) {
-              if (D < M && (M = D), J < M && (M = J), M === 0) break t;
-              l.arraySet(V, R, F, M, Y), D -= M, F += M, J -= M, Y += M, r.length -= M;
+              if (D < M && (M = D), X < M && (M = X), M === 0) break t;
+              l.arraySet(K, R, F, M, Y), D -= M, F += M, X -= M, Y += M, r.length -= M;
               break;
             }
             r.mode = 12;
             break;
           case 17:
-            for (; A < 14; ) {
+            for (; z < 14; ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
-            if (r.nlen = 257 + (31 & O), O >>>= 5, A -= 5, r.ndist = 1 + (31 & O), O >>>= 5, A -= 5, r.ncode = 4 + (15 & O), O >>>= 4, A -= 4, 286 < r.nlen || 30 < r.ndist) {
+            if (r.nlen = 257 + (31 & O), O >>>= 5, z -= 5, r.ndist = 1 + (31 & O), O >>>= 5, z -= 5, r.ncode = 4 + (15 & O), O >>>= 4, z -= 4, 286 < r.nlen || 30 < r.ndist) {
               _.msg = "too many length or distance symbols", r.mode = 30;
               break;
             }
             r.have = 0, r.mode = 18;
           case 18:
             for (; r.have < r.ncode; ) {
-              for (; A < 3; ) {
+              for (; z < 3; ) {
                 if (D === 0) break t;
-                D--, O += R[F++] << A, A += 8;
+                D--, O += R[F++] << z, z += 8;
               }
-              r.lens[U[r.have++]] = 7 & O, O >>>= 3, A -= 3;
+              r.lens[L[r.have++]] = 7 & O, O >>>= 3, z -= 3;
             }
-            for (; r.have < 19; ) r.lens[U[r.have++]] = 0;
-            if (r.lencode = r.lendyn, r.lenbits = 7, N = { bits: r.lenbits }, L = y(0, r.lens, 0, 19, r.lencode, 0, r.work, N), r.lenbits = N.bits, L) {
+            for (; r.have < 19; ) r.lens[L[r.have++]] = 0;
+            if (r.lencode = r.lendyn, r.lenbits = 7, N = { bits: r.lenbits }, U = y(0, r.lens, 0, 19, r.lencode, 0, r.work, N), r.lenbits = N.bits, U) {
               _.msg = "invalid code lengths set", r.mode = 30;
               break;
             }
             r.have = 0, r.mode = 19;
           case 19:
             for (; r.have < r.nlen + r.ndist; ) {
-              for (; tt = (u = r.lencode[O & (1 << r.lenbits) - 1]) >>> 16 & 255, ot = 65535 & u, !((nt = u >>> 24) <= A); ) {
+              for (; et = (u = r.lencode[O & (1 << r.lenbits) - 1]) >>> 16 & 255, ot = 65535 & u, !((nt = u >>> 24) <= z); ) {
                 if (D === 0) break t;
-                D--, O += R[F++] << A, A += 8;
+                D--, O += R[F++] << z, z += 8;
               }
-              if (ot < 16) O >>>= nt, A -= nt, r.lens[r.have++] = ot;
+              if (ot < 16) O >>>= nt, z -= nt, r.lens[r.have++] = ot;
               else {
                 if (ot === 16) {
-                  for (g = nt + 2; A < g; ) {
+                  for (g = nt + 2; z < g; ) {
                     if (D === 0) break t;
-                    D--, O += R[F++] << A, A += 8;
+                    D--, O += R[F++] << z, z += 8;
                   }
-                  if (O >>>= nt, A -= nt, r.have === 0) {
+                  if (O >>>= nt, z -= nt, r.have === 0) {
                     _.msg = "invalid bit length repeat", r.mode = 30;
                     break;
                   }
-                  e = r.lens[r.have - 1], M = 3 + (3 & O), O >>>= 2, A -= 2;
+                  e = r.lens[r.have - 1], M = 3 + (3 & O), O >>>= 2, z -= 2;
                 } else if (ot === 17) {
-                  for (g = nt + 3; A < g; ) {
+                  for (g = nt + 3; z < g; ) {
                     if (D === 0) break t;
-                    D--, O += R[F++] << A, A += 8;
+                    D--, O += R[F++] << z, z += 8;
                   }
-                  A -= nt, e = 0, M = 3 + (7 & (O >>>= nt)), O >>>= 3, A -= 3;
+                  z -= nt, e = 0, M = 3 + (7 & (O >>>= nt)), O >>>= 3, z -= 3;
                 } else {
-                  for (g = nt + 7; A < g; ) {
+                  for (g = nt + 7; z < g; ) {
                     if (D === 0) break t;
-                    D--, O += R[F++] << A, A += 8;
+                    D--, O += R[F++] << z, z += 8;
                   }
-                  A -= nt, e = 0, M = 11 + (127 & (O >>>= nt)), O >>>= 7, A -= 7;
+                  z -= nt, e = 0, M = 11 + (127 & (O >>>= nt)), O >>>= 7, z -= 7;
                 }
                 if (r.have + M > r.nlen + r.ndist) {
                   _.msg = "invalid bit length repeat", r.mode = 30;
@@ -2079,11 +2079,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               _.msg = "invalid code -- missing end-of-block", r.mode = 30;
               break;
             }
-            if (r.lenbits = 9, N = { bits: r.lenbits }, L = y(v, r.lens, 0, r.nlen, r.lencode, 0, r.work, N), r.lenbits = N.bits, L) {
+            if (r.lenbits = 9, N = { bits: r.lenbits }, U = y(v, r.lens, 0, r.nlen, r.lencode, 0, r.work, N), r.lenbits = N.bits, U) {
               _.msg = "invalid literal/lengths set", r.mode = 30;
               break;
             }
-            if (r.distbits = 6, r.distcode = r.distdyn, N = { bits: r.distbits }, L = y(w, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, N), r.distbits = N.bits, L) {
+            if (r.distbits = 6, r.distcode = r.distdyn, N = { bits: r.distbits }, U = y(w, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, N), r.distbits = N.bits, U) {
               _.msg = "invalid distances set", r.mode = 30;
               break;
             }
@@ -2091,67 +2091,67 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           case 20:
             r.mode = 21;
           case 21:
-            if (6 <= D && 258 <= J) {
-              _.next_out = Y, _.avail_out = J, _.next_in = F, _.avail_in = D, r.hold = O, r.bits = A, c(_, Z), Y = _.next_out, V = _.output, J = _.avail_out, F = _.next_in, R = _.input, D = _.avail_in, O = r.hold, A = r.bits, r.mode === 12 && (r.back = -1);
+            if (6 <= D && 258 <= X) {
+              _.next_out = Y, _.avail_out = X, _.next_in = F, _.avail_in = D, r.hold = O, r.bits = z, c(_, Z), Y = _.next_out, K = _.output, X = _.avail_out, F = _.next_in, R = _.input, D = _.avail_in, O = r.hold, z = r.bits, r.mode === 12 && (r.back = -1);
               break;
             }
-            for (r.back = 0; tt = (u = r.lencode[O & (1 << r.lenbits) - 1]) >>> 16 & 255, ot = 65535 & u, !((nt = u >>> 24) <= A); ) {
+            for (r.back = 0; et = (u = r.lencode[O & (1 << r.lenbits) - 1]) >>> 16 & 255, ot = 65535 & u, !((nt = u >>> 24) <= z); ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
-            if (tt && !(240 & tt)) {
-              for (ct = nt, ut = tt, ft = ot; tt = (u = r.lencode[ft + ((O & (1 << ct + ut) - 1) >> ct)]) >>> 16 & 255, ot = 65535 & u, !(ct + (nt = u >>> 24) <= A); ) {
+            if (et && !(240 & et)) {
+              for (lt = nt, ft = et, ut = ot; et = (u = r.lencode[ut + ((O & (1 << lt + ft) - 1) >> lt)]) >>> 16 & 255, ot = 65535 & u, !(lt + (nt = u >>> 24) <= z); ) {
                 if (D === 0) break t;
-                D--, O += R[F++] << A, A += 8;
+                D--, O += R[F++] << z, z += 8;
               }
-              O >>>= ct, A -= ct, r.back += ct;
+              O >>>= lt, z -= lt, r.back += lt;
             }
-            if (O >>>= nt, A -= nt, r.back += nt, r.length = ot, tt === 0) {
+            if (O >>>= nt, z -= nt, r.back += nt, r.length = ot, et === 0) {
               r.mode = 26;
               break;
             }
-            if (32 & tt) {
+            if (32 & et) {
               r.back = -1, r.mode = 12;
               break;
             }
-            if (64 & tt) {
+            if (64 & et) {
               _.msg = "invalid literal/length code", r.mode = 30;
               break;
             }
-            r.extra = 15 & tt, r.mode = 22;
+            r.extra = 15 & et, r.mode = 22;
           case 22:
             if (r.extra) {
-              for (g = r.extra; A < g; ) {
+              for (g = r.extra; z < g; ) {
                 if (D === 0) break t;
-                D--, O += R[F++] << A, A += 8;
+                D--, O += R[F++] << z, z += 8;
               }
-              r.length += O & (1 << r.extra) - 1, O >>>= r.extra, A -= r.extra, r.back += r.extra;
+              r.length += O & (1 << r.extra) - 1, O >>>= r.extra, z -= r.extra, r.back += r.extra;
             }
             r.was = r.length, r.mode = 23;
           case 23:
-            for (; tt = (u = r.distcode[O & (1 << r.distbits) - 1]) >>> 16 & 255, ot = 65535 & u, !((nt = u >>> 24) <= A); ) {
+            for (; et = (u = r.distcode[O & (1 << r.distbits) - 1]) >>> 16 & 255, ot = 65535 & u, !((nt = u >>> 24) <= z); ) {
               if (D === 0) break t;
-              D--, O += R[F++] << A, A += 8;
+              D--, O += R[F++] << z, z += 8;
             }
-            if (!(240 & tt)) {
-              for (ct = nt, ut = tt, ft = ot; tt = (u = r.distcode[ft + ((O & (1 << ct + ut) - 1) >> ct)]) >>> 16 & 255, ot = 65535 & u, !(ct + (nt = u >>> 24) <= A); ) {
+            if (!(240 & et)) {
+              for (lt = nt, ft = et, ut = ot; et = (u = r.distcode[ut + ((O & (1 << lt + ft) - 1) >> lt)]) >>> 16 & 255, ot = 65535 & u, !(lt + (nt = u >>> 24) <= z); ) {
                 if (D === 0) break t;
-                D--, O += R[F++] << A, A += 8;
+                D--, O += R[F++] << z, z += 8;
               }
-              O >>>= ct, A -= ct, r.back += ct;
+              O >>>= lt, z -= lt, r.back += lt;
             }
-            if (O >>>= nt, A -= nt, r.back += nt, 64 & tt) {
+            if (O >>>= nt, z -= nt, r.back += nt, 64 & et) {
               _.msg = "invalid distance code", r.mode = 30;
               break;
             }
-            r.offset = ot, r.extra = 15 & tt, r.mode = 24;
+            r.offset = ot, r.extra = 15 & et, r.mode = 24;
           case 24:
             if (r.extra) {
-              for (g = r.extra; A < g; ) {
+              for (g = r.extra; z < g; ) {
                 if (D === 0) break t;
-                D--, O += R[F++] << A, A += 8;
+                D--, O += R[F++] << z, z += 8;
               }
-              r.offset += O & (1 << r.extra) - 1, O >>>= r.extra, A -= r.extra, r.back += r.extra;
+              r.offset += O & (1 << r.extra) - 1, O >>>= r.extra, z -= r.extra, r.back += r.extra;
             }
             if (r.offset > r.dmax) {
               _.msg = "invalid distance too far back", r.mode = 30;
@@ -2159,52 +2159,52 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             }
             r.mode = 25;
           case 25:
-            if (J === 0) break t;
-            if (M = Z - J, r.offset > M) {
+            if (X === 0) break t;
+            if (M = Z - X, r.offset > M) {
               if ((M = r.offset - M) > r.whave && r.sane) {
                 _.msg = "invalid distance too far back", r.mode = 30;
                 break;
               }
               it = M > r.wnext ? (M -= r.wnext, r.wsize - M) : r.wnext - M, M > r.length && (M = r.length), at = r.window;
-            } else at = V, it = Y - r.offset, M = r.length;
-            for (J < M && (M = J), J -= M, r.length -= M; V[Y++] = at[it++], --M; ) ;
+            } else at = K, it = Y - r.offset, M = r.length;
+            for (X < M && (M = X), X -= M, r.length -= M; K[Y++] = at[it++], --M; ) ;
             r.length === 0 && (r.mode = 21);
             break;
           case 26:
-            if (J === 0) break t;
-            V[Y++] = r.length, J--, r.mode = 21;
+            if (X === 0) break t;
+            K[Y++] = r.length, X--, r.mode = 21;
             break;
           case 27:
             if (r.wrap) {
-              for (; A < 32; ) {
+              for (; z < 32; ) {
                 if (D === 0) break t;
-                D--, O |= R[F++] << A, A += 8;
+                D--, O |= R[F++] << z, z += 8;
               }
-              if (Z -= J, _.total_out += Z, r.total += Z, Z && (_.adler = r.check = r.flags ? s(r.check, V, Z, Y - Z) : f(r.check, V, Z, Y - Z)), Z = J, (r.flags ? O : a(O)) !== r.check) {
+              if (Z -= X, _.total_out += Z, r.total += Z, Z && (_.adler = r.check = r.flags ? s(r.check, K, Z, Y - Z) : f(r.check, K, Z, Y - Z)), Z = X, (r.flags ? O : a(O)) !== r.check) {
                 _.msg = "incorrect data check", r.mode = 30;
                 break;
               }
-              A = O = 0;
+              z = O = 0;
             }
             r.mode = 28;
           case 28:
             if (r.wrap && r.flags) {
-              for (; A < 32; ) {
+              for (; z < 32; ) {
                 if (D === 0) break t;
-                D--, O += R[F++] << A, A += 8;
+                D--, O += R[F++] << z, z += 8;
               }
               if (O !== (4294967295 & r.total)) {
                 _.msg = "incorrect length check", r.mode = 30;
                 break;
               }
-              A = O = 0;
+              z = O = 0;
             }
             r.mode = 29;
           case 29:
-            L = 1;
+            U = 1;
             break t;
           case 30:
-            L = -3;
+            U = -3;
             break t;
           case 31:
             return -4;
@@ -2212,7 +2212,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           default:
             return o;
         }
-        return _.next_out = Y, _.avail_out = J, _.next_in = F, _.avail_in = D, r.hold = O, r.bits = A, (r.wsize || Z !== _.avail_out && r.mode < 30 && (r.mode < 27 || x !== 4)) && Q(_, _.output, _.next_out, Z - _.avail_out) ? (r.mode = 31, -4) : (X -= _.avail_in, Z -= _.avail_out, _.total_in += X, _.total_out += Z, r.total += Z, r.wrap && Z && (_.adler = r.check = r.flags ? s(r.check, V, Z, _.next_out - Z) : f(r.check, V, Z, _.next_out - Z)), _.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === 12 ? 128 : 0) + (r.mode === 20 || r.mode === 15 ? 256 : 0), (X == 0 && Z === 0 || x === 4) && L === b && (L = -5), L);
+        return _.next_out = Y, _.avail_out = X, _.next_in = F, _.avail_in = D, r.hold = O, r.bits = z, (r.wsize || Z !== _.avail_out && r.mode < 30 && (r.mode < 27 || x !== 4)) && Q(_, _.output, _.next_out, Z - _.avail_out) ? (r.mode = 31, -4) : (J -= _.avail_in, Z -= _.avail_out, _.total_in += J, _.total_out += Z, r.total += Z, r.wrap && Z && (_.adler = r.check = r.flags ? s(r.check, K, Z, _.next_out - Z) : f(r.check, K, Z, _.next_out - Z)), _.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === 12 ? 128 : 0) + (r.mode === 20 || r.mode === 15 ? 256 : 0), (J == 0 && Z === 0 || x === 4) && U === b && (U = -5), U);
       }, h.inflateEnd = function(_) {
         if (!_ || !_.state) return o;
         var x = _.state;
@@ -2227,31 +2227,31 @@ https://github.com/nodeca/pako/blob/main/LICENSE
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(n, I, h) {
       var l = n("../utils/common"), f = [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], s = [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], c = [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], y = [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];
       I.exports = function(v, w, b, o, p, i, d, a) {
-        var m, k, E, C, B, P, j, T, H, Q = a.bits, _ = 0, x = 0, r = 0, R = 0, V = 0, F = 0, Y = 0, D = 0, J = 0, O = 0, A = null, X = 0, Z = new l.Buf16(16), M = new l.Buf16(16), it = null, at = 0;
+        var m, k, E, C, B, P, j, T, H, Q = a.bits, _ = 0, x = 0, r = 0, R = 0, K = 0, F = 0, Y = 0, D = 0, X = 0, O = 0, z = null, J = 0, Z = new l.Buf16(16), M = new l.Buf16(16), it = null, at = 0;
         for (_ = 0; _ <= 15; _++) Z[_] = 0;
         for (x = 0; x < o; x++) Z[w[b + x]]++;
-        for (V = Q, R = 15; 1 <= R && Z[R] === 0; R--) ;
-        if (R < V && (V = R), R === 0) return p[i++] = 20971520, p[i++] = 20971520, a.bits = 1, 0;
+        for (K = Q, R = 15; 1 <= R && Z[R] === 0; R--) ;
+        if (R < K && (K = R), R === 0) return p[i++] = 20971520, p[i++] = 20971520, a.bits = 1, 0;
         for (r = 1; r < R && Z[r] === 0; r++) ;
-        for (V < r && (V = r), _ = D = 1; _ <= 15; _++) if (D <<= 1, (D -= Z[_]) < 0) return -1;
+        for (K < r && (K = r), _ = D = 1; _ <= 15; _++) if (D <<= 1, (D -= Z[_]) < 0) return -1;
         if (0 < D && (v === 0 || R !== 1)) return -1;
         for (M[1] = 0, _ = 1; _ < 15; _++) M[_ + 1] = M[_] + Z[_];
         for (x = 0; x < o; x++) w[b + x] !== 0 && (d[M[w[b + x]]++] = x);
-        if (P = v === 0 ? (A = it = d, 19) : v === 1 ? (A = f, X -= 257, it = s, at -= 257, 256) : (A = c, it = y, -1), _ = r, B = i, Y = x = O = 0, E = -1, C = (J = 1 << (F = V)) - 1, v === 1 && 852 < J || v === 2 && 592 < J) return 1;
+        if (P = v === 0 ? (z = it = d, 19) : v === 1 ? (z = f, J -= 257, it = s, at -= 257, 256) : (z = c, it = y, -1), _ = r, B = i, Y = x = O = 0, E = -1, C = (X = 1 << (F = K)) - 1, v === 1 && 852 < X || v === 2 && 592 < X) return 1;
         for (; ; ) {
-          for (j = _ - Y, H = d[x] < P ? (T = 0, d[x]) : d[x] > P ? (T = it[at + d[x]], A[X + d[x]]) : (T = 96, 0), m = 1 << _ - Y, r = k = 1 << F; p[B + (O >> Y) + (k -= m)] = j << 24 | T << 16 | H | 0, k !== 0; ) ;
+          for (j = _ - Y, H = d[x] < P ? (T = 0, d[x]) : d[x] > P ? (T = it[at + d[x]], z[J + d[x]]) : (T = 96, 0), m = 1 << _ - Y, r = k = 1 << F; p[B + (O >> Y) + (k -= m)] = j << 24 | T << 16 | H | 0, k !== 0; ) ;
           for (m = 1 << _ - 1; O & m; ) m >>= 1;
           if (m !== 0 ? (O &= m - 1, O += m) : O = 0, x++, --Z[_] == 0) {
             if (_ === R) break;
             _ = w[b + d[x]];
           }
-          if (V < _ && (O & C) !== E) {
-            for (Y === 0 && (Y = V), B += r, D = 1 << (F = _ - Y); F + Y < R && !((D -= Z[F + Y]) <= 0); ) F++, D <<= 1;
-            if (J += 1 << F, v === 1 && 852 < J || v === 2 && 592 < J) return 1;
-            p[E = O & C] = V << 24 | F << 16 | B - i | 0;
+          if (K < _ && (O & C) !== E) {
+            for (Y === 0 && (Y = K), B += r, D = 1 << (F = _ - Y); F + Y < R && !((D -= Z[F + Y]) <= 0); ) F++, D <<= 1;
+            if (X += 1 << F, v === 1 && 852 < X || v === 2 && 592 < X) return 1;
+            p[E = O & C] = K << 24 | F << 16 | B - i | 0;
           }
         }
-        return O !== 0 && (p[B + O] = _ - Y << 24 | 64 << 16 | 0), a.bits = V, 0;
+        return O !== 0 && (p[B + O] = _ - Y << 24 | 64 << 16 | 0), a.bits = K, 0;
       };
     }, { "../utils/common": 41 }], 51: [function(n, I, h) {
       I.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" };
@@ -2270,35 +2270,35 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       c(r);
       var R = new Array(v);
       c(R);
-      var V, F, Y, D = new Array(o);
-      function J(u, S, U, W, z) {
-        this.static_tree = u, this.extra_bits = S, this.extra_base = U, this.elems = W, this.max_length = z, this.has_stree = u && u.length;
+      var K, F, Y, D = new Array(o);
+      function X(u, S, L, W, A) {
+        this.static_tree = u, this.extra_bits = S, this.extra_base = L, this.elems = W, this.max_length = A, this.has_stree = u && u.length;
       }
       function O(u, S) {
         this.dyn_tree = u, this.max_code = 0, this.stat_desc = S;
       }
-      function A(u) {
+      function z(u) {
         return u < 256 ? x[u] : x[256 + (u >>> 7)];
       }
-      function X(u, S) {
+      function J(u, S) {
         u.pending_buf[u.pending++] = 255 & S, u.pending_buf[u.pending++] = S >>> 8 & 255;
       }
-      function Z(u, S, U) {
-        u.bi_valid > a - U ? (u.bi_buf |= S << u.bi_valid & 65535, X(u, u.bi_buf), u.bi_buf = S >> a - u.bi_valid, u.bi_valid += U - a) : (u.bi_buf |= S << u.bi_valid & 65535, u.bi_valid += U);
+      function Z(u, S, L) {
+        u.bi_valid > a - L ? (u.bi_buf |= S << u.bi_valid & 65535, J(u, u.bi_buf), u.bi_buf = S >> a - u.bi_valid, u.bi_valid += L - a) : (u.bi_buf |= S << u.bi_valid & 65535, u.bi_valid += L);
       }
-      function M(u, S, U) {
-        Z(u, U[2 * S], U[2 * S + 1]);
+      function M(u, S, L) {
+        Z(u, L[2 * S], L[2 * S + 1]);
       }
       function it(u, S) {
-        for (var U = 0; U |= 1 & u, u >>>= 1, U <<= 1, 0 < --S; ) ;
-        return U >>> 1;
-      }
-      function at(u, S, U) {
-        var W, z, q = new Array(d + 1), K = 0;
-        for (W = 1; W <= d; W++) q[W] = K = K + U[W - 1] << 1;
-        for (z = 0; z <= S; z++) {
-          var G = u[2 * z + 1];
-          G !== 0 && (u[2 * z] = it(q[G]++, G));
+        for (var L = 0; L |= 1 & u, u >>>= 1, L <<= 1, 0 < --S; ) ;
+        return L >>> 1;
+      }
+      function at(u, S, L) {
+        var W, A, q = new Array(d + 1), V = 0;
+        for (W = 1; W <= d; W++) q[W] = V = V + L[W - 1] << 1;
+        for (A = 0; A <= S; A++) {
+          var G = u[2 * A + 1];
+          G !== 0 && (u[2 * A] = it(q[G]++, G));
         }
       }
       function nt(u) {
@@ -2308,96 +2308,96 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         for (S = 0; S < p; S++) u.bl_tree[2 * S] = 0;
         u.dyn_ltree[2 * k] = 1, u.opt_len = u.static_len = 0, u.last_lit = u.matches = 0;
       }
-      function tt(u) {
-        8 < u.bi_valid ? X(u, u.bi_buf) : 0 < u.bi_valid && (u.pending_buf[u.pending++] = u.bi_buf), u.bi_buf = 0, u.bi_valid = 0;
+      function et(u) {
+        8 < u.bi_valid ? J(u, u.bi_buf) : 0 < u.bi_valid && (u.pending_buf[u.pending++] = u.bi_buf), u.bi_buf = 0, u.bi_valid = 0;
       }
-      function ot(u, S, U, W) {
-        var z = 2 * S, q = 2 * U;
-        return u[z] < u[q] || u[z] === u[q] && W[S] <= W[U];
+      function ot(u, S, L, W) {
+        var A = 2 * S, q = 2 * L;
+        return u[A] < u[q] || u[A] === u[q] && W[S] <= W[L];
       }
-      function ct(u, S, U) {
-        for (var W = u.heap[U], z = U << 1; z <= u.heap_len && (z < u.heap_len && ot(S, u.heap[z + 1], u.heap[z], u.depth) && z++, !ot(S, W, u.heap[z], u.depth)); ) u.heap[U] = u.heap[z], U = z, z <<= 1;
-        u.heap[U] = W;
+      function lt(u, S, L) {
+        for (var W = u.heap[L], A = L << 1; A <= u.heap_len && (A < u.heap_len && ot(S, u.heap[A + 1], u.heap[A], u.depth) && A++, !ot(S, W, u.heap[A], u.depth)); ) u.heap[L] = u.heap[A], L = A, A <<= 1;
+        u.heap[L] = W;
       }
-      function ut(u, S, U) {
-        var W, z, q, K, G = 0;
-        if (u.last_lit !== 0) for (; W = u.pending_buf[u.d_buf + 2 * G] << 8 | u.pending_buf[u.d_buf + 2 * G + 1], z = u.pending_buf[u.l_buf + G], G++, W === 0 ? M(u, z, S) : (M(u, (q = r[z]) + w + 1, S), (K = P[q]) !== 0 && Z(u, z -= R[q], K), M(u, q = A(--W), U), (K = j[q]) !== 0 && Z(u, W -= D[q], K)), G < u.last_lit; ) ;
+      function ft(u, S, L) {
+        var W, A, q, V, G = 0;
+        if (u.last_lit !== 0) for (; W = u.pending_buf[u.d_buf + 2 * G] << 8 | u.pending_buf[u.d_buf + 2 * G + 1], A = u.pending_buf[u.l_buf + G], G++, W === 0 ? M(u, A, S) : (M(u, (q = r[A]) + w + 1, S), (V = P[q]) !== 0 && Z(u, A -= R[q], V), M(u, q = z(--W), L), (V = j[q]) !== 0 && Z(u, W -= D[q], V)), G < u.last_lit; ) ;
         M(u, k, S);
       }
-      function ft(u, S) {
-        var U, W, z, q = S.dyn_tree, K = S.stat_desc.static_tree, G = S.stat_desc.has_stree, et = S.stat_desc.elems, lt = -1;
-        for (u.heap_len = 0, u.heap_max = i, U = 0; U < et; U++) q[2 * U] !== 0 ? (u.heap[++u.heap_len] = lt = U, u.depth[U] = 0) : q[2 * U + 1] = 0;
-        for (; u.heap_len < 2; ) q[2 * (z = u.heap[++u.heap_len] = lt < 2 ? ++lt : 0)] = 1, u.depth[z] = 0, u.opt_len--, G && (u.static_len -= K[2 * z + 1]);
-        for (S.max_code = lt, U = u.heap_len >> 1; 1 <= U; U--) ct(u, q, U);
-        for (z = et; U = u.heap[1], u.heap[1] = u.heap[u.heap_len--], ct(u, q, 1), W = u.heap[1], u.heap[--u.heap_max] = U, u.heap[--u.heap_max] = W, q[2 * z] = q[2 * U] + q[2 * W], u.depth[z] = (u.depth[U] >= u.depth[W] ? u.depth[U] : u.depth[W]) + 1, q[2 * U + 1] = q[2 * W + 1] = z, u.heap[1] = z++, ct(u, q, 1), 2 <= u.heap_len; ) ;
+      function ut(u, S) {
+        var L, W, A, q = S.dyn_tree, V = S.stat_desc.static_tree, G = S.stat_desc.has_stree, tt = S.stat_desc.elems, ct = -1;
+        for (u.heap_len = 0, u.heap_max = i, L = 0; L < tt; L++) q[2 * L] !== 0 ? (u.heap[++u.heap_len] = ct = L, u.depth[L] = 0) : q[2 * L + 1] = 0;
+        for (; u.heap_len < 2; ) q[2 * (A = u.heap[++u.heap_len] = ct < 2 ? ++ct : 0)] = 1, u.depth[A] = 0, u.opt_len--, G && (u.static_len -= V[2 * A + 1]);
+        for (S.max_code = ct, L = u.heap_len >> 1; 1 <= L; L--) lt(u, q, L);
+        for (A = tt; L = u.heap[1], u.heap[1] = u.heap[u.heap_len--], lt(u, q, 1), W = u.heap[1], u.heap[--u.heap_max] = L, u.heap[--u.heap_max] = W, q[2 * A] = q[2 * L] + q[2 * W], u.depth[A] = (u.depth[L] >= u.depth[W] ? u.depth[L] : u.depth[W]) + 1, q[2 * L + 1] = q[2 * W + 1] = A, u.heap[1] = A++, lt(u, q, 1), 2 <= u.heap_len; ) ;
         u.heap[--u.heap_max] = u.heap[1], function(st, ht) {
-          var vt, mt, xt, pt, Ct, zt, kt = ht.dyn_tree, Rt = ht.max_code, Ot = ht.stat_desc.static_tree, Nt = ht.stat_desc.has_stree, Bt = ht.stat_desc.extra_bits, St = ht.stat_desc.extra_base, Et = ht.stat_desc.max_length, Tt = 0;
-          for (pt = 0; pt <= d; pt++) st.bl_count[pt] = 0;
-          for (kt[2 * st.heap[st.heap_max] + 1] = 0, vt = st.heap_max + 1; vt < i; vt++) Et < (pt = kt[2 * kt[2 * (mt = st.heap[vt]) + 1] + 1] + 1) && (pt = Et, Tt++), kt[2 * mt + 1] = pt, Rt < mt || (st.bl_count[pt]++, Ct = 0, St <= mt && (Ct = Bt[mt - St]), zt = kt[2 * mt], st.opt_len += zt * (pt + Ct), Nt && (st.static_len += zt * (Ot[2 * mt + 1] + Ct)));
-          if (Tt !== 0) {
+          var vt, pt, xt, mt, Ct, At, kt = ht.dyn_tree, Ot = ht.max_code, Tt = ht.stat_desc.static_tree, Bt = ht.stat_desc.has_stree, Rt = ht.stat_desc.extra_bits, Nt = ht.stat_desc.extra_base, zt = ht.stat_desc.max_length, St = 0;
+          for (mt = 0; mt <= d; mt++) st.bl_count[mt] = 0;
+          for (kt[2 * st.heap[st.heap_max] + 1] = 0, vt = st.heap_max + 1; vt < i; vt++) zt < (mt = kt[2 * kt[2 * (pt = st.heap[vt]) + 1] + 1] + 1) && (mt = zt, St++), kt[2 * pt + 1] = mt, Ot < pt || (st.bl_count[mt]++, Ct = 0, Nt <= pt && (Ct = Rt[pt - Nt]), At = kt[2 * pt], st.opt_len += At * (mt + Ct), Bt && (st.static_len += At * (Tt[2 * pt + 1] + Ct)));
+          if (St !== 0) {
             do {
-              for (pt = Et - 1; st.bl_count[pt] === 0; ) pt--;
-              st.bl_count[pt]--, st.bl_count[pt + 1] += 2, st.bl_count[Et]--, Tt -= 2;
-            } while (0 < Tt);
-            for (pt = Et; pt !== 0; pt--) for (mt = st.bl_count[pt]; mt !== 0; ) Rt < (xt = st.heap[--vt]) || (kt[2 * xt + 1] !== pt && (st.opt_len += (pt - kt[2 * xt + 1]) * kt[2 * xt], kt[2 * xt + 1] = pt), mt--);
+              for (mt = zt - 1; st.bl_count[mt] === 0; ) mt--;
+              st.bl_count[mt]--, st.bl_count[mt + 1] += 2, st.bl_count[zt]--, St -= 2;
+            } while (0 < St);
+            for (mt = zt; mt !== 0; mt--) for (pt = st.bl_count[mt]; pt !== 0; ) Ot < (xt = st.heap[--vt]) || (kt[2 * xt + 1] !== mt && (st.opt_len += (mt - kt[2 * xt + 1]) * kt[2 * xt], kt[2 * xt + 1] = mt), pt--);
           }
-        }(u, S), at(q, lt, u.bl_count);
-      }
-      function e(u, S, U) {
-        var W, z, q = -1, K = S[1], G = 0, et = 7, lt = 4;
-        for (K === 0 && (et = 138, lt = 3), S[2 * (U + 1) + 1] = 65535, W = 0; W <= U; W++) z = K, K = S[2 * (W + 1) + 1], ++G < et && z === K || (G < lt ? u.bl_tree[2 * z] += G : z !== 0 ? (z !== q && u.bl_tree[2 * z]++, u.bl_tree[2 * E]++) : G <= 10 ? u.bl_tree[2 * C]++ : u.bl_tree[2 * B]++, q = z, lt = (G = 0) === K ? (et = 138, 3) : z === K ? (et = 6, 3) : (et = 7, 4));
-      }
-      function L(u, S, U) {
-        var W, z, q = -1, K = S[1], G = 0, et = 7, lt = 4;
-        for (K === 0 && (et = 138, lt = 3), W = 0; W <= U; W++) if (z = K, K = S[2 * (W + 1) + 1], !(++G < et && z === K)) {
-          if (G < lt) for (; M(u, z, u.bl_tree), --G != 0; ) ;
-          else z !== 0 ? (z !== q && (M(u, z, u.bl_tree), G--), M(u, E, u.bl_tree), Z(u, G - 3, 2)) : G <= 10 ? (M(u, C, u.bl_tree), Z(u, G - 3, 3)) : (M(u, B, u.bl_tree), Z(u, G - 11, 7));
-          q = z, lt = (G = 0) === K ? (et = 138, 3) : z === K ? (et = 6, 3) : (et = 7, 4);
+        }(u, S), at(q, ct, u.bl_count);
+      }
+      function e(u, S, L) {
+        var W, A, q = -1, V = S[1], G = 0, tt = 7, ct = 4;
+        for (V === 0 && (tt = 138, ct = 3), S[2 * (L + 1) + 1] = 65535, W = 0; W <= L; W++) A = V, V = S[2 * (W + 1) + 1], ++G < tt && A === V || (G < ct ? u.bl_tree[2 * A] += G : A !== 0 ? (A !== q && u.bl_tree[2 * A]++, u.bl_tree[2 * E]++) : G <= 10 ? u.bl_tree[2 * C]++ : u.bl_tree[2 * B]++, q = A, ct = (G = 0) === V ? (tt = 138, 3) : A === V ? (tt = 6, 3) : (tt = 7, 4));
+      }
+      function U(u, S, L) {
+        var W, A, q = -1, V = S[1], G = 0, tt = 7, ct = 4;
+        for (V === 0 && (tt = 138, ct = 3), W = 0; W <= L; W++) if (A = V, V = S[2 * (W + 1) + 1], !(++G < tt && A === V)) {
+          if (G < ct) for (; M(u, A, u.bl_tree), --G != 0; ) ;
+          else A !== 0 ? (A !== q && (M(u, A, u.bl_tree), G--), M(u, E, u.bl_tree), Z(u, G - 3, 2)) : G <= 10 ? (M(u, C, u.bl_tree), Z(u, G - 3, 3)) : (M(u, B, u.bl_tree), Z(u, G - 11, 7));
+          q = A, ct = (G = 0) === V ? (tt = 138, 3) : A === V ? (tt = 6, 3) : (tt = 7, 4);
         }
       }
       c(D);
       var N = !1;
-      function g(u, S, U, W) {
-        Z(u, (y << 1) + (W ? 1 : 0), 3), function(z, q, K, G) {
-          tt(z), X(z, K), X(z, ~K), l.arraySet(z.pending_buf, z.window, q, K, z.pending), z.pending += K;
-        }(u, S, U);
+      function g(u, S, L, W) {
+        Z(u, (y << 1) + (W ? 1 : 0), 3), function(A, q, V, G) {
+          et(A), J(A, V), J(A, ~V), l.arraySet(A.pending_buf, A.window, q, V, A.pending), A.pending += V;
+        }(u, S, L);
       }
       h._tr_init = function(u) {
         N || (function() {
-          var S, U, W, z, q, K = new Array(d + 1);
-          for (z = W = 0; z < v - 1; z++) for (R[z] = W, S = 0; S < 1 << P[z]; S++) r[W++] = z;
-          for (r[W - 1] = z, z = q = 0; z < 16; z++) for (D[z] = q, S = 0; S < 1 << j[z]; S++) x[q++] = z;
-          for (q >>= 7; z < o; z++) for (D[z] = q << 7, S = 0; S < 1 << j[z] - 7; S++) x[256 + q++] = z;
-          for (U = 0; U <= d; U++) K[U] = 0;
-          for (S = 0; S <= 143; ) Q[2 * S + 1] = 8, S++, K[8]++;
-          for (; S <= 255; ) Q[2 * S + 1] = 9, S++, K[9]++;
-          for (; S <= 279; ) Q[2 * S + 1] = 7, S++, K[7]++;
-          for (; S <= 287; ) Q[2 * S + 1] = 8, S++, K[8]++;
-          for (at(Q, b + 1, K), S = 0; S < o; S++) _[2 * S + 1] = 5, _[2 * S] = it(S, 5);
-          V = new J(Q, P, w + 1, b, d), F = new J(_, j, 0, o, d), Y = new J(new Array(0), T, 0, p, m);
-        }(), N = !0), u.l_desc = new O(u.dyn_ltree, V), u.d_desc = new O(u.dyn_dtree, F), u.bl_desc = new O(u.bl_tree, Y), u.bi_buf = 0, u.bi_valid = 0, nt(u);
-      }, h._tr_stored_block = g, h._tr_flush_block = function(u, S, U, W) {
-        var z, q, K = 0;
+          var S, L, W, A, q, V = new Array(d + 1);
+          for (A = W = 0; A < v - 1; A++) for (R[A] = W, S = 0; S < 1 << P[A]; S++) r[W++] = A;
+          for (r[W - 1] = A, A = q = 0; A < 16; A++) for (D[A] = q, S = 0; S < 1 << j[A]; S++) x[q++] = A;
+          for (q >>= 7; A < o; A++) for (D[A] = q << 7, S = 0; S < 1 << j[A] - 7; S++) x[256 + q++] = A;
+          for (L = 0; L <= d; L++) V[L] = 0;
+          for (S = 0; S <= 143; ) Q[2 * S + 1] = 8, S++, V[8]++;
+          for (; S <= 255; ) Q[2 * S + 1] = 9, S++, V[9]++;
+          for (; S <= 279; ) Q[2 * S + 1] = 7, S++, V[7]++;
+          for (; S <= 287; ) Q[2 * S + 1] = 8, S++, V[8]++;
+          for (at(Q, b + 1, V), S = 0; S < o; S++) _[2 * S + 1] = 5, _[2 * S] = it(S, 5);
+          K = new X(Q, P, w + 1, b, d), F = new X(_, j, 0, o, d), Y = new X(new Array(0), T, 0, p, m);
+        }(), N = !0), u.l_desc = new O(u.dyn_ltree, K), u.d_desc = new O(u.dyn_dtree, F), u.bl_desc = new O(u.bl_tree, Y), u.bi_buf = 0, u.bi_valid = 0, nt(u);
+      }, h._tr_stored_block = g, h._tr_flush_block = function(u, S, L, W) {
+        var A, q, V = 0;
         0 < u.level ? (u.strm.data_type === 2 && (u.strm.data_type = function(G) {
-          var et, lt = 4093624447;
-          for (et = 0; et <= 31; et++, lt >>>= 1) if (1 & lt && G.dyn_ltree[2 * et] !== 0) return f;
+          var tt, ct = 4093624447;
+          for (tt = 0; tt <= 31; tt++, ct >>>= 1) if (1 & ct && G.dyn_ltree[2 * tt] !== 0) return f;
           if (G.dyn_ltree[18] !== 0 || G.dyn_ltree[20] !== 0 || G.dyn_ltree[26] !== 0) return s;
-          for (et = 32; et < w; et++) if (G.dyn_ltree[2 * et] !== 0) return s;
+          for (tt = 32; tt < w; tt++) if (G.dyn_ltree[2 * tt] !== 0) return s;
           return f;
-        }(u)), ft(u, u.l_desc), ft(u, u.d_desc), K = function(G) {
-          var et;
-          for (e(G, G.dyn_ltree, G.l_desc.max_code), e(G, G.dyn_dtree, G.d_desc.max_code), ft(G, G.bl_desc), et = p - 1; 3 <= et && G.bl_tree[2 * H[et] + 1] === 0; et--) ;
-          return G.opt_len += 3 * (et + 1) + 5 + 5 + 4, et;
-        }(u), z = u.opt_len + 3 + 7 >>> 3, (q = u.static_len + 3 + 7 >>> 3) <= z && (z = q)) : z = q = U + 5, U + 4 <= z && S !== -1 ? g(u, S, U, W) : u.strategy === 4 || q === z ? (Z(u, 2 + (W ? 1 : 0), 3), ut(u, Q, _)) : (Z(u, 4 + (W ? 1 : 0), 3), function(G, et, lt, st) {
+        }(u)), ut(u, u.l_desc), ut(u, u.d_desc), V = function(G) {
+          var tt;
+          for (e(G, G.dyn_ltree, G.l_desc.max_code), e(G, G.dyn_dtree, G.d_desc.max_code), ut(G, G.bl_desc), tt = p - 1; 3 <= tt && G.bl_tree[2 * H[tt] + 1] === 0; tt--) ;
+          return G.opt_len += 3 * (tt + 1) + 5 + 5 + 4, tt;
+        }(u), A = u.opt_len + 3 + 7 >>> 3, (q = u.static_len + 3 + 7 >>> 3) <= A && (A = q)) : A = q = L + 5, L + 4 <= A && S !== -1 ? g(u, S, L, W) : u.strategy === 4 || q === A ? (Z(u, 2 + (W ? 1 : 0), 3), ft(u, Q, _)) : (Z(u, 4 + (W ? 1 : 0), 3), function(G, tt, ct, st) {
           var ht;
-          for (Z(G, et - 257, 5), Z(G, lt - 1, 5), Z(G, st - 4, 4), ht = 0; ht < st; ht++) Z(G, G.bl_tree[2 * H[ht] + 1], 3);
-          L(G, G.dyn_ltree, et - 1), L(G, G.dyn_dtree, lt - 1);
-        }(u, u.l_desc.max_code + 1, u.d_desc.max_code + 1, K + 1), ut(u, u.dyn_ltree, u.dyn_dtree)), nt(u), W && tt(u);
-      }, h._tr_tally = function(u, S, U) {
-        return u.pending_buf[u.d_buf + 2 * u.last_lit] = S >>> 8 & 255, u.pending_buf[u.d_buf + 2 * u.last_lit + 1] = 255 & S, u.pending_buf[u.l_buf + u.last_lit] = 255 & U, u.last_lit++, S === 0 ? u.dyn_ltree[2 * U]++ : (u.matches++, S--, u.dyn_ltree[2 * (r[U] + w + 1)]++, u.dyn_dtree[2 * A(S)]++), u.last_lit === u.lit_bufsize - 1;
+          for (Z(G, tt - 257, 5), Z(G, ct - 1, 5), Z(G, st - 4, 4), ht = 0; ht < st; ht++) Z(G, G.bl_tree[2 * H[ht] + 1], 3);
+          U(G, G.dyn_ltree, tt - 1), U(G, G.dyn_dtree, ct - 1);
+        }(u, u.l_desc.max_code + 1, u.d_desc.max_code + 1, V + 1), ft(u, u.dyn_ltree, u.dyn_dtree)), nt(u), W && et(u);
+      }, h._tr_tally = function(u, S, L) {
+        return u.pending_buf[u.d_buf + 2 * u.last_lit] = S >>> 8 & 255, u.pending_buf[u.d_buf + 2 * u.last_lit + 1] = 255 & S, u.pending_buf[u.l_buf + u.last_lit] = 255 & L, u.last_lit++, S === 0 ? u.dyn_ltree[2 * L]++ : (u.matches++, S--, u.dyn_ltree[2 * (r[L] + w + 1)]++, u.dyn_dtree[2 * z(S)]++), u.last_lit === u.lit_bufsize - 1;
       }, h._tr_align = function(u) {
         Z(u, 2, 3), M(u, k, Q), function(S) {
-          S.bi_valid === 16 ? (X(S, S.bi_buf), S.bi_buf = 0, S.bi_valid = 0) : 8 <= S.bi_valid && (S.pending_buf[S.pending++] = 255 & S.bi_buf, S.bi_buf >>= 8, S.bi_valid -= 8);
+          S.bi_valid === 16 ? (J(S, S.bi_buf), S.bi_buf = 0, S.bi_valid = 0) : 8 <= S.bi_valid && (S.pending_buf[S.pending++] = 255 & S.bi_buf, S.bi_buf >>= 8, S.bi_valid -= 8);
         }(u);
       };
     }, { "../utils/common": 41 }], 53: [function(n, I, h) {
@@ -2479,13 +2479,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             E.source === f && typeof E.data == "string" && E.data.indexOf(w) === 0 && m(+E.data.slice(w.length));
           }
         })(typeof self > "u" ? l === void 0 ? this : l : self);
-      }).call(this, typeof Ft < "u" ? Ft : typeof self < "u" ? self : typeof window < "u" ? window : {});
+      }).call(this, typeof Dt < "u" ? Dt : typeof self < "u" ? self : typeof window < "u" ? window : {});
     }, {}] }, {}, [10])(10);
   });
-})(te);
-var me = te.exports;
-const _e = /* @__PURE__ */ ie(me);
-function Yt($, t) {
+})(re);
+var ge = re.exports;
+const ve = /* @__PURE__ */ ae(ge);
+function Xt($, t) {
   const n = $.split("/");
   n.pop();
   const I = t.split("/");
@@ -2493,10 +2493,10 @@ function Yt($, t) {
     h !== "." && (h === ".." ? n.pop() : n.push(h));
   return n.join("/");
 }
-function ge() {
+function be() {
   const [$, t] = bt(""), [n, I] = bt(!1), [h, l] = bt(""), [f, s] = bt([]), [c, y] = bt(null);
   let v = "", w = "";
-  const b = At(null), o = At(null), p = {}, i = re(async (_) => {
+  const b = Et(null), o = Et(null), p = {}, i = ie(async (_) => {
     I(!0), t(""), s([]), l("Loading..."), y(null), o.current && (document.head.removeChild(o.current), URL.revokeObjectURL(o.current.href), o.current = null);
     try {
       let x;
@@ -2506,7 +2506,7 @@ function ge() {
         x = await r.arrayBuffer();
       } else _ instanceof File ? x = await _.arrayBuffer() : x = _;
       if (!x || x.byteLength === 0) throw new Error("EPUB source is empty.");
-      b.current = await _e.loadAsync(x), await d();
+      b.current = await ve.loadAsync(x), await d();
     } catch (x) {
       console.error("Error processing EPUB source:", x), y(x instanceof Error ? x.message : "Unknown error"), I(!1);
     }
@@ -2515,14 +2515,14 @@ function ge() {
     if (!b.current) throw new Error("Zip not loaded");
     const _ = b.current.file("META-INF/container.xml");
     if (!_) throw new Error("META-INF/container.xml not found.");
-    const x = await _.async("text"), r = new DOMParser(), V = r.parseFromString(x, "application/xml").querySelector('rootfile[media-type="application/oebps-package+xml"]'), F = V == null ? void 0 : V.getAttribute("full-path");
+    const x = await _.async("text"), r = new DOMParser(), K = r.parseFromString(x, "application/xml").querySelector('rootfile[media-type="application/oebps-package+xml"]'), F = K == null ? void 0 : K.getAttribute("full-path");
     if (!F) throw new Error("OPF file path not found.");
     v = F.substring(0, F.lastIndexOf("/") + 1);
     const Y = b.current.file(F);
     if (!Y) throw new Error(`OPF file not found at path: ${F}`);
-    const D = await Y.async("text"), J = r.parseFromString(D, "application/xml");
-    if (J.querySelector("parsererror")) throw new Error("Error parsing OPF file.");
-    a(J), await m(J);
+    const D = await Y.async("text"), X = r.parseFromString(D, "application/xml");
+    if (X.querySelector("parsererror")) throw new Error("Error parsing OPF file.");
+    a(X), await m(X);
   }
   function a(_) {
     const x = _.querySelector("metadata > dc\\:title") || _.querySelector("metadata > title");
@@ -2532,107 +2532,107 @@ function ge() {
     if (!b.current) return;
     const x = {}, r = {};
     _.querySelectorAll("manifest > item").forEach((Y) => {
-      const D = Y.getAttribute("id"), J = Y.getAttribute("href"), O = Y.getAttribute("media-type"), A = Y.getAttribute("properties");
-      if (D && J && O) {
-        const X = decodeURIComponent(J);
+      const D = Y.getAttribute("id"), X = Y.getAttribute("href"), O = Y.getAttribute("media-type"), z = Y.getAttribute("properties");
+      if (D && X && O) {
+        const J = decodeURIComponent(X);
         x[D] = {
-          href: X,
+          href: J,
           type: O,
-          properties: A
-        }, r[X] = D;
+          properties: z
+        }, r[J] = D;
       }
     }), await k(_, x, r);
     const R = Array.from(_.querySelectorAll("spine > itemref")).map((Y) => Y.getAttribute("idref"));
-    let V = "";
+    let K = "";
     const F = /* @__PURE__ */ new Set();
     for (const Y of R) {
       if (!Y) continue;
       const D = x[Y];
       if (D && (D.type.includes("html") || D.type.includes("xml")))
         try {
-          const J = v + D.href, O = b.current.file(J);
+          const X = v + D.href, O = b.current.file(X);
           if (O) {
-            const A = await O.async("text"), X = await C(A, D.type, Y, D.href, r);
-            V += `<div class="bok-chapter" id="${Y}">${X}</div>`;
+            const z = await O.async("text"), J = await C(z, D.type, Y, D.href, r);
+            K += `<div class="bok-chapter" id="${Y}">${J}</div>`;
           }
-        } catch (J) {
-          console.warn(`Failed to process spine item ${D.href}:`, J);
+        } catch (X) {
+          console.warn(`Failed to process spine item ${D.href}:`, X);
         }
     }
     for (const Y in x) {
       const D = x[Y];
       if (D.type.includes("css")) {
-        const J = v + D.href;
-        if (!F.has(J)) {
-          const O = b.current.file(J);
+        const X = v + D.href;
+        if (!F.has(X)) {
+          const O = b.current.file(X);
           if (O) {
-            const A = await O.async("text");
-            w += H(A) + `
-`, F.add(J);
+            const z = await O.async("text");
+            w += H(z) + `
+`, F.add(X);
           }
         }
       }
     }
-    Q(), t(V), I(!1);
+    Q(), t(K), I(!1);
   }
   async function k(_, x, r) {
-    let R = null, V = null;
+    let R = null, K = null;
     const F = Object.keys(x).find((Z) => {
       var M;
       return x[Z].properties && ((M = x[Z].properties) == null ? void 0 : M.includes("nav"));
     });
     if (F)
-      V = x[F];
+      K = x[F];
     else {
       const Z = _.querySelector("spine");
-      R = Z == null ? void 0 : Z.getAttribute("toc"), R && x[R] && (V = x[R]);
+      R = Z == null ? void 0 : Z.getAttribute("toc"), R && x[R] && (K = x[R]);
     }
-    if (!V || !b.current) {
+    if (!K || !b.current) {
       console.log("No TOC found.");
       return;
     }
-    const Y = v + V.href, D = b.current.file(Y);
+    const Y = v + K.href, D = b.current.file(Y);
     if (!D) return;
-    const J = await D.async("text"), A = new DOMParser().parseFromString(J, "application/xml");
-    let X = [];
-    if (V.type.includes("ncx")) {
-      const Z = Array.from(A.querySelectorAll("navMap > navPoint")), M = (it) => it.map((at) => {
-        var ct, ut;
-        const nt = ((ct = at.querySelector("navLabel > text")) == null ? void 0 : ct.textContent) || "Unnamed", tt = ((ut = at.querySelector("content")) == null ? void 0 : ut.getAttribute("src")) || "", ot = Array.from(at.children).filter((ft) => ft.tagName.toLowerCase() === "navpoint");
+    const X = await D.async("text"), z = new DOMParser().parseFromString(X, "application/xml");
+    let J = [];
+    if (K.type.includes("ncx")) {
+      const Z = Array.from(z.querySelectorAll("navMap > navPoint")), M = (it) => it.map((at) => {
+        var lt, ft;
+        const nt = ((lt = at.querySelector("navLabel > text")) == null ? void 0 : lt.textContent) || "Unnamed", et = ((ft = at.querySelector("content")) == null ? void 0 : ft.getAttribute("src")) || "", ot = Array.from(at.children).filter((ut) => ut.tagName.toLowerCase() === "navpoint");
         return {
           label: nt,
-          href: E(tt, V.href, r),
+          href: E(et, K.href, r),
           subitems: M(ot)
         };
       });
-      X = M(Z);
+      J = M(Z);
     } else {
-      const Z = A.querySelector("nav[epub\\:type='toc']") || A.querySelector("nav"), M = Z == null ? void 0 : Z.querySelector("ol"), it = (at) => at ? Array.from(at.children).filter((nt) => nt.tagName.toLowerCase() === "li").map((nt) => {
-        var ft;
-        const tt = nt.querySelector(":scope > a") || nt.querySelector(":scope > span"), ot = ((ft = tt == null ? void 0 : tt.textContent) == null ? void 0 : ft.trim()) || "Unnamed", ct = (tt == null ? void 0 : tt.getAttribute("href")) || "", ut = nt.querySelector(":scope > ol");
+      const Z = z.querySelector("nav[epub\\:type='toc']") || z.querySelector("nav"), M = Z == null ? void 0 : Z.querySelector("ol"), it = (at) => at ? Array.from(at.children).filter((nt) => nt.tagName.toLowerCase() === "li").map((nt) => {
+        var ut;
+        const et = nt.querySelector(":scope > a") || nt.querySelector(":scope > span"), ot = ((ut = et == null ? void 0 : et.textContent) == null ? void 0 : ut.trim()) || "Unnamed", lt = (et == null ? void 0 : et.getAttribute("href")) || "", ft = nt.querySelector(":scope > ol");
         return {
           label: ot,
-          href: E(ct, V.href, r),
-          subitems: it(ut)
+          href: E(lt, K.href, r),
+          subitems: it(ft)
         };
       }) : [];
-      M && (X = it(M));
+      M && (J = it(M));
     }
-    console.log("Parsed TOC:", X), s(X);
+    console.log("Parsed TOC:", J), s(J);
   }
   function E(_, x, r) {
     if (!_) return "";
-    const [R, V] = _.split("#"), F = Yt(x, R), Y = r[F];
-    return Y ? V ? `#${Y}_${V}` : `#${Y}` : "";
+    const [R, K] = _.split("#"), F = Xt(x, R), Y = r[F];
+    return Y ? K ? `#${Y}_${K}` : `#${Y}` : "";
   }
-  async function C(_, x, r, R, V) {
+  async function C(_, x, r, R, K) {
     let F = [..._.matchAll(/<style[^>]*>([\s\S]*?)<\/style>/gi)].map((D) => D[1]).join(`
 `);
     F = H(F), w += F;
     let Y = _.replace(/<style[^>]*>[\s\S]*?<\/style>/gi, "");
-    return Y = Y.replace(/<link[^>]*?>/gi, ""), Y = Y.replace(/<title[^>]*>[\s\S]*?<\/title>/gi, ""), Y = await B(Y, x, r, R, V), Y;
+    return Y = Y.replace(/<link[^>]*?>/gi, ""), Y = Y.replace(/<title[^>]*>[\s\S]*?<\/title>/gi, ""), Y = await B(Y, x, r, R, K), Y;
   }
-  async function B(_, x, r, R, V) {
+  async function B(_, x, r, R, K) {
     const Y = new DOMParser().parseFromString(_, x);
     if (Y.querySelector("parsererror"))
       return console.warn("Parser error in manipulateDom"), _;
@@ -2641,22 +2641,22 @@ function ge() {
       const M = Z.getAttribute("id");
       Z.setAttribute("id", `${r}_${M}`);
     }
-    const J = Y.querySelectorAll("a[href]");
-    for (const Z of J) {
+    const X = Y.querySelectorAll("a[href]");
+    for (const Z of X) {
       const M = Z.getAttribute("href");
       if (!(!M || M.startsWith("http") || M.startsWith("mailto")))
         if (M.startsWith("#")) {
           const it = M.substring(1);
           Z.setAttribute("href", `#${r}_${it}`);
         } else {
-          const [it, at] = M.split("#"), nt = Yt(R, it), tt = V[nt];
-          tt && (at ? Z.setAttribute("href", `#${tt}_${at}`) : Z.setAttribute("href", `#${tt}`));
+          const [it, at] = M.split("#"), nt = Xt(R, it), et = K[nt];
+          et && (at ? Z.setAttribute("href", `#${et}_${at}`) : Z.setAttribute("href", `#${et}`));
         }
     }
     const O = Y.querySelectorAll("img");
     for (const Z of O) await P(Z);
-    const A = Y.querySelectorAll("image");
-    for (const Z of A) await j(Z);
+    const z = Y.querySelectorAll("image");
+    for (const Z of z) await j(Z);
     return new XMLSerializer().serializeToString(Y.documentElement || Y);
   }
   async function P(_) {
@@ -2676,10 +2676,10 @@ function ge() {
   async function T(_, x, r) {
     var R;
     if (p[r] === void 0) {
-      const V = (R = b.current) == null ? void 0 : R.file(r);
-      if (V)
+      const K = (R = b.current) == null ? void 0 : R.file(r);
+      if (K)
         try {
-          const F = await V.async("blob");
+          const F = await K.async("blob");
           p[r] = URL.createObjectURL(F);
         } catch {
           p[r] = "";
@@ -2694,7 +2694,7 @@ function ge() {
     let r = _.replace(/\/\*[\s\S]*?\*\//g, "");
     r = r.replace(/(^|[^.#\w-])(html|body)(?![\w-])/gi, "butt-sex-masterr");
     for (const R of x) {
-      const V = R.replace(/[.*+?^${}()|[\]\\-]/g, "\\$&"), F = new RegExp(`${V}(?:-[\\w-]+)?\\s*:[^;{}]*;?`, "gi");
+      const K = R.replace(/[.*+?^${}()|[\]\\-]/g, "\\$&"), F = new RegExp(`${K}(?:-[\\w-]+)?\\s*:[^;{}]*;?`, "gi");
       r = r.replace(F, "");
     }
     return r = r.replace(/[^{}@]+\{\s*\}/g, ""), r = r.replace(/@media[^{]*\{\s*\}/g, ""), r = r.replace(/\n\s*\n/g, `
@@ -2735,7 +2735,7 @@ function Pt($, t) {
     }
   }, [$, n]), [n, I];
 }
-function ee($) {
+function ne($) {
   const t = It.c(8);
   let n;
   t[0] === Symbol.for("react.memo_cache_sentinel") ? (n = {
@@ -2775,7 +2775,7 @@ function ee($) {
   let s;
   return t[4] !== I.height || t[5] !== I.noOfPages || t[6] !== I.width ? (s = [I.width, I.height, I.noOfPages], t[4] = I.height, t[5] = I.noOfPages, t[6] = I.width, t[7] = s) : s = t[7], s;
 }
-function ve($) {
+function ye($) {
   const t = It.c(8), [n, I] = bt(0);
   let h;
   t[0] !== $ ? (h = () => {
@@ -2803,8 +2803,8 @@ function ve($) {
   let c;
   return t[6] !== n ? (c = [n, I], t[6] = n, t[7] = c) : c = t[7], c;
 }
-const be = ($, t, n, I) => {
-  const h = It.c(21), [l, f] = ee(n), s = At(null), c = At("");
+const we = ($, t, n, I) => {
+  const h = It.c(21), [l, f] = ne(n), s = Et(null), c = Et("");
   let y;
   h[0] !== $ || h[1] !== t || h[2] !== f || h[3] !== l || h[4] !== I ? (y = (a, m) => {
     !t && !I && (a / l <= 0.4 && m / f < 0.8 && $(-1), a / l > 0.4 && m / f < 0.8 && $(1));
@@ -2846,7 +2846,7 @@ const be = ($, t, n, I) => {
   let i;
   h[13] !== n || h[14] !== v ? (i = () => {
     const a = n.current, m = () => {
-      s.current = window.setTimeout(ye, 200);
+      s.current = window.setTimeout(ke, 200);
     }, k = (E) => {
       E.target.closest("a") || s.current && !c.current && (clearTimeout(s.current), s.current = null, v(E.clientX, E.clientY));
     };
@@ -2857,9 +2857,9 @@ const be = ($, t, n, I) => {
   let d;
   h[16] !== n || h[17] !== v || h[18] !== t || h[19] !== l ? (d = [l, t, v, n], h[16] = n, h[17] = v, h[18] = t, h[19] = l, h[20] = d) : d = h[20], gt(i, d);
 };
-function ye() {
+function ke() {
 }
-function we($) {
+function Se($) {
   const t = It.c(3), {
     currentPage: n,
     pages: I
@@ -2871,14 +2871,14 @@ function we($) {
     I
   ] }), t[0] = I, t[1] = h, t[2] = l) : l = t[2], l;
 }
-function Zt($) {
+function Ht($) {
   const t = document.getElementById("bok-main-element");
   if (t !== null) {
     const n = t.getBoundingClientRect().width, I = $.offsetLeft;
     return Math.floor(I / n);
   } else throw Error;
 }
-const ke = ($) => 1 + 2.1 * Math.pow($ - 1, 3) + 1.1 * Math.pow($ - 1, 2), Se = $t(($, t) => {
+const xe = ($) => 1 + 2.1 * Math.pow($ - 1, 3) + 1.1 * Math.pow($ - 1, 2), Ce = Gt(($, t) => {
   const n = It.c(62), {
     content: I,
     title: h,
@@ -2891,7 +2891,7 @@ const ke = ($) => 1 + 2.1 * Math.pow($ - 1, 3) + 1.1 * Math.pow($ - 1, 2), Se =
     showTutorial: w,
     onPageChange: b,
     onPageCountChange: o
-  } = $, p = At(null), [i, d, a] = ee(v), [m, k] = ve(p), [E, C] = bt(1), [B, P] = bt(0), [j, T] = Pt(`bok_progress_${h}`, 0), H = At(m), Q = At(null);
+  } = $, p = Et(null), [i, d, a] = ne(v), [m, k] = ye(p), [E, C] = bt(1), [B, P] = bt(0), [j, T] = Pt(`bok_progress_${h}`, 0), H = Et(m), Q = Et(null);
   let _, x;
   n[0] !== o || n[1] !== B ? (_ = () => {
     o && o(B);
@@ -2900,87 +2900,87 @@ const ke = ($) => 1 + 2.1 * Math.pow($ - 1, 3) + 1.1 * Math.pow($ - 1, 2), Se =
   n[4] !== E || n[5] !== b ? (r = () => {
     b && b(E);
   }, R = [E, b], n[4] = E, n[5] = b, n[6] = r, n[7] = R) : (r = n[6], R = n[7]), gt(r, R);
-  let V, F;
-  n[8] !== m ? (V = () => {
+  let K, F;
+  n[8] !== m ? (K = () => {
     H.current = m;
-  }, F = [m], n[8] = m, n[9] = V, n[10] = F) : (V = n[9], F = n[10]), gt(V, F);
+  }, F = [m], n[8] = m, n[9] = K, n[10] = F) : (K = n[9], F = n[10]), gt(K, F);
   let Y, D;
   n[11] !== m || n[12] !== T ? (Y = () => {
     m > 0 && T(m);
   }, D = [m, T], n[11] = m, n[12] = T, n[13] = Y, n[14] = D) : (Y = n[13], D = n[14]), gt(Y, D);
-  let J, O;
+  let X, O;
   n[15] !== j || n[16] !== k ? (O = () => {
     j > 0 && k(j);
-  }, J = [j, k], n[15] = j, n[16] = k, n[17] = J, n[18] = O) : (J = n[17], O = n[18]), gt(O, J);
-  let A;
-  n[19] !== a || n[20] !== i ? (A = (u) => {
+  }, X = [j, k], n[15] = j, n[16] = k, n[17] = X, n[18] = O) : (X = n[17], O = n[18]), gt(O, X);
+  let z;
+  n[19] !== a || n[20] !== i ? (z = (u) => {
     const S = p.current;
     if (!S)
       return;
     Q.current && cancelAnimationFrame(Q.current);
-    const U = S.scrollLeft, W = u * i * a, z = W - U, q = performance.now(), K = (G) => {
-      const et = G - q;
-      if (et < 450) {
-        const lt = ke(et / 450);
-        S.scrollLeft = U + z * lt, Q.current = requestAnimationFrame(K);
+    const L = S.scrollLeft, W = u * i * a, A = W - L, q = performance.now(), V = (G) => {
+      const tt = G - q;
+      if (tt < 450) {
+        const ct = xe(tt / 450);
+        S.scrollLeft = L + A * ct, Q.current = requestAnimationFrame(V);
       } else
         S.scrollLeft = W, Q.current = null;
     };
-    Q.current = requestAnimationFrame(K);
-  }, n[19] = a, n[20] = i, n[21] = A) : A = n[21];
-  const X = A;
+    Q.current = requestAnimationFrame(V);
+  }, n[19] = a, n[20] = i, n[21] = z) : z = n[21];
+  const J = z;
   let Z;
-  n[22] !== B || n[23] !== X ? (Z = (u) => {
+  n[22] !== B || n[23] !== J ? (Z = (u) => {
     let S = u;
-    S < 0 && (S = 0), S >= B && (S = B - 1), C(S), X(S);
-  }, n[22] = B, n[23] = X, n[24] = Z) : Z = n[24];
+    S < 0 && (S = 0), S >= B && (S = B - 1), C(S), J(S);
+  }, n[22] = B, n[23] = J, n[24] = Z) : Z = n[24];
   const M = Z;
   let it;
-  n[25] !== B || n[26] !== X ? (it = (u) => {
+  n[25] !== B || n[26] !== J ? (it = (u) => {
     C((S) => {
-      let U = S + u;
-      return U < 0 && (U = 0), U >= B && (U = B - 1), X(U), U;
+      let L = S + u;
+      return L < 0 && (L = 0), L >= B && (L = B - 1), J(L), L;
     });
-  }, n[25] = B, n[26] = X, n[27] = it) : it = n[27];
+  }, n[25] = B, n[26] = J, n[27] = it) : it = n[27];
   const at = it;
   let nt;
   n[28] !== M ? (nt = () => ({
     goToPage: M,
     findAndJumpToHref: (u) => {
-      const S = u.startsWith("#") ? u.substring(1) : u, U = document.getElementById(S);
-      if (U)
+      const S = u.startsWith("#") ? u.substring(1) : u, L = document.getElementById(S);
+      if (L)
         try {
-          const W = Zt(U);
+          const W = Ht(L);
           M(W);
         } catch (W) {
           console.warn("Could not calculate page for link", W);
         }
     }
-  }), n[28] = M, n[29] = nt) : nt = n[29], ne(t, nt), be(at, y, v, w);
-  let tt, ot;
-  n[30] !== M ? (tt = () => {
+  }), n[28] = M, n[29] = nt) : nt = n[29], se(t, nt), we(at, y, v, w);
+  let et, ot;
+  n[30] !== M ? (et = () => {
     const u = p.current;
     if (!u)
       return;
-    const S = (U) => {
+    const S = (L) => {
       var q;
-      const z = U.target.closest("a");
-      if (z && ((q = z.getAttribute("href")) != null && q.startsWith("#"))) {
-        U.preventDefault();
-        const K = z.getAttribute("href"), G = decodeURIComponent(K.substring(1)), et = document.getElementById(G);
-        if (et)
+      const A = L.target.closest("a");
+      if (A && ((q = A.getAttribute("href")) != null && q.startsWith("#"))) {
+        L.preventDefault();
+        const V = A.getAttribute("href"), G = decodeURIComponent(V.substring(1)), tt = document.getElementById(G);
+        if (tt)
           try {
-            const lt = Zt(et);
-            M(lt);
-          } catch (lt) {
-            console.warn("Could not calculate page for link", lt);
+            const ct = Ht(tt);
+            M(ct);
+          } catch (ct) {
+            console.warn("Could not calculate page for link", ct);
           }
       }
     };
     return u.addEventListener("click", S), () => u.removeEventListener("click", S);
-  }, ot = [M], n[30] = M, n[31] = tt, n[32] = ot) : (tt = n[31], ot = n[32]), gt(tt, ot);
-  let ct;
-  n[33] !== c || n[34] !== f || n[35] !== a || n[36] !== d || n[37] !== i || n[38] !== l || n[39] !== s ? (ct = () => {
+  }, ot = [M], n[30] = M, n[31] = et, n[32] = ot) : (et = n[31], ot = n[32]), gt(et, ot);
+  let lt;
+  n[33] !== c || n[34] !== f || n[35] !== a || n[36] !== d || n[37] !== i || n[38] !== l || n[39] !== s ? (lt = () => {
     const u = p.current;
     if (!u || i <= 0 || d <= 0)
       return;
@@ -2989,11 +2989,11 @@ const ke = ($) => 1 + 2.1 * Math.pow($ - 1, 3) + 1.1 * Math.pow($ - 1, 2), Se =
       u.style.setProperty("--side-padding", `${s}px`), u.style.setProperty("--font-size", `${f}em`), u.style.setProperty("--font-family", c), u.style.setProperty("--computed-width", `${i}px`), u.style.maxHeight = `${d}px`, requestAnimationFrame(() => {
         if (!u)
           return;
-        const U = u.scrollWidth, W = i > 0 && U > 0 ? Math.round(U / i) : 0, z = a === 1 ? W : Math.round(W / 2);
-        if (P(z), z > 0 && u.clientWidth > 0) {
+        const L = u.scrollWidth, W = i > 0 && L > 0 ? Math.round(L / i) : 0, A = a === 1 ? W : Math.round(W / 2);
+        if (P(A), A > 0 && u.clientWidth > 0) {
           const q = H.current;
-          let K = Math.round(z * q);
-          K = Math.max(0, Math.min(z - 1, K)), C(K), u.scrollLeft = K * i * a;
+          let V = Math.round(A * q);
+          V = Math.max(0, Math.min(A - 1, V)), C(V), u.scrollLeft = V * i * a;
         } else
           C(1);
         l(!1);
@@ -3002,34 +3002,34 @@ const ke = ($) => 1 + 2.1 * Math.pow($ - 1, 3) + 1.1 * Math.pow($ - 1, 2), Se =
     return () => {
       clearTimeout(S), Q.current && cancelAnimationFrame(Q.current);
     };
-  }, n[33] = c, n[34] = f, n[35] = a, n[36] = d, n[37] = i, n[38] = l, n[39] = s, n[40] = ct) : ct = n[40];
-  let ut;
-  n[41] !== I || n[42] !== c || n[43] !== f || n[44] !== a || n[45] !== d || n[46] !== i || n[47] !== l || n[48] !== s || n[49] !== h ? (ut = [i, d, s, f, c, a, I, h, l], n[41] = I, n[42] = c, n[43] = f, n[44] = a, n[45] = d, n[46] = i, n[47] = l, n[48] = s, n[49] = h, n[50] = ut) : ut = n[50], gt(ct, ut);
-  let ft, e;
-  n[51] !== at ? (ft = () => {
+  }, n[33] = c, n[34] = f, n[35] = a, n[36] = d, n[37] = i, n[38] = l, n[39] = s, n[40] = lt) : lt = n[40];
+  let ft;
+  n[41] !== I || n[42] !== c || n[43] !== f || n[44] !== a || n[45] !== d || n[46] !== i || n[47] !== l || n[48] !== s || n[49] !== h ? (ft = [i, d, s, f, c, a, I, h, l], n[41] = I, n[42] = c, n[43] = f, n[44] = a, n[45] = d, n[46] = i, n[47] = l, n[48] = s, n[49] = h, n[50] = ft) : ft = n[50], gt(lt, ft);
+  let ut, e;
+  n[51] !== at ? (ut = () => {
     const u = (S) => {
       S.key === "ArrowLeft" ? (S.preventDefault(), at(-1)) : S.key === "ArrowRight" && (S.preventDefault(), at(1));
     };
     return document.addEventListener("keydown", u), () => document.removeEventListener("keydown", u);
-  }, e = [at], n[51] = at, n[52] = ft, n[53] = e) : (ft = n[52], e = n[53]), gt(ft, e);
-  let L;
-  n[54] !== I ? (L = /* @__PURE__ */ rt("div", { ref: p, dangerouslySetInnerHTML: {
+  }, e = [at], n[51] = at, n[52] = ut, n[53] = e) : (ut = n[52], e = n[53]), gt(ut, e);
+  let U;
+  n[54] !== I ? (U = /* @__PURE__ */ rt("div", { ref: p, dangerouslySetInnerHTML: {
     __html: I
-  }, className: "book-page", id: "bok-main-element" }), n[54] = I, n[55] = L) : L = n[55];
+  }, className: "book-page", id: "bok-main-element" }), n[54] = I, n[55] = U) : U = n[55];
   let N;
-  n[56] !== E || n[57] !== B ? (N = /* @__PURE__ */ rt(we, { pages: B, currentPage: E }), n[56] = E, n[57] = B, n[58] = N) : N = n[58];
+  n[56] !== E || n[57] !== B ? (N = /* @__PURE__ */ rt(Se, { pages: B, currentPage: E }), n[56] = E, n[57] = B, n[58] = N) : N = n[58];
   let g;
-  return n[59] !== L || n[60] !== N ? (g = /* @__PURE__ */ _t(Kt, { children: [
-    L,
+  return n[59] !== U || n[60] !== N ? (g = /* @__PURE__ */ _t(qt, { children: [
+    U,
     N
-  ] }), n[59] = L, n[60] = N, n[61] = g) : g = n[61], g;
-}), xe = "_spinner_13vxc_32", Ce = "_core_13vxc_82", Lt = {
+  ] }), n[59] = U, n[60] = N, n[61] = g) : g = n[61], g;
+}), Ee = "_spinner_13vxc_32", Ae = "_core_13vxc_82", Ut = {
   "loading-screen": "_loading-screen_13vxc_1",
   "loading-screen-gon": "_loading-screen-gon_13vxc_2",
-  spinner: xe,
-  core: Ce
+  spinner: Ee,
+  core: Ae
 };
-function Ee($) {
+function ze($) {
   const t = It.c(8), {
     isLoading: n,
     color: I
@@ -3038,24 +3038,24 @@ function Ee($) {
   t[0] !== h ? (l = {
     "--loader-color": h
   }, t[0] = h, t[1] = l) : l = t[1];
-  const f = l, s = n ? Lt["loading-screen"] : Lt["loading-screen-gon"];
+  const f = l, s = n ? Ut["loading-screen"] : Ut["loading-screen-gon"];
   let c;
-  t[2] === Symbol.for("react.memo_cache_sentinel") ? (c = /* @__PURE__ */ rt("div", { className: Lt.core }), t[2] = c) : c = t[2];
+  t[2] === Symbol.for("react.memo_cache_sentinel") ? (c = /* @__PURE__ */ rt("div", { className: Ut.core }), t[2] = c) : c = t[2];
   let y;
-  t[3] !== f ? (y = /* @__PURE__ */ rt("div", { className: Lt.spinner, style: f, children: c }), t[3] = f, t[4] = y) : y = t[4];
+  t[3] !== f ? (y = /* @__PURE__ */ rt("div", { className: Ut.spinner, style: f, children: c }), t[3] = f, t[4] = y) : y = t[4];
   let v;
   return t[5] !== s || t[6] !== y ? (v = /* @__PURE__ */ rt("div", { className: s, children: y }), t[5] = s, t[6] = y, t[7] = v) : v = t[7], v;
 }
-function Ae() {
-  document.fullscreenElement ? document.exitFullscreen && document.exitFullscreen() : document.documentElement.requestFullscreen();
+function Ie() {
+  document.documentElement.requestFullscreen && (document.fullscreenElement ? document.exitFullscreen && document.exitFullscreen() : document.documentElement.requestFullscreen());
 }
-const ze = "_visible_1guvy_63", Ie = "_title_1guvy_94", Oe = "_select_1guvy_214", dt = {
+const Oe = "_visible_1guvy_63", Ne = "_title_1guvy_94", Te = "_select_1guvy_214", dt = {
   "options-menu-overlay": "_options-menu-overlay_1guvy_1",
   "fade-out": "_fade-out_1guvy_27",
   "options-menu": "_options-menu_1guvy_1",
-  visible: ze,
+  visible: Oe,
   "slide-down": "_slide-down_1guvy_69",
-  title: Ie,
+  title: Ne,
   "close-button": "_close-button_1guvy_103",
   "options-buttons": "_options-buttons_1guvy_132",
   "option-row": "_option-row_1guvy_138",
@@ -3064,11 +3064,11 @@ const ze = "_visible_1guvy_63", Ie = "_title_1guvy_94", Oe = "_select_1guvy_214"
   "stepper-button": "_stepper-button_1guvy_164",
   "option-value": "_option-value_1guvy_192",
   "value-changed": "_value-changed_1guvy_209",
-  select: Oe,
+  select: Te,
   "fullscreen-button": "_fullscreen-button_1guvy_243"
 };
-function Ne($) {
-  const t = It.c(95), {
+function Re($) {
+  const t = It.c(97), {
     onClose: n,
     fontSize: I,
     padding: h,
@@ -3086,197 +3086,205 @@ function Ne($) {
   const p = o;
   let i;
   t[2] !== b ? (i = b === void 0 ? [] : b, t[2] = b, t[3] = i) : i = t[3];
-  const d = i, [a, m] = bt(!1), [k, E] = bt(!1), C = At(null), B = At(null);
-  let P;
+  const d = i, [a, m] = bt(!1), [k, E] = bt(!1), C = Et(null), B = Et(null);
+  let P, j;
   t[4] === Symbol.for("react.memo_cache_sentinel") ? (P = {
+    displayName: "Literata",
+    name: "Literata"
+  }, j = {
+    displayName: "Cormorant",
+    name: "Cormorant Garamond"
+  }, t[4] = P, t[5] = j) : (P = t[4], j = t[5]);
+  let T;
+  t[6] === Symbol.for("react.memo_cache_sentinel") ? (T = {
     displayName: "System Default",
     name: "system-ui"
-  }, t[4] = P) : P = t[4];
-  let j;
-  t[5] !== p ? (j = [P, ...p], t[5] = p, t[6] = j) : j = t[6];
-  const T = j;
-  let H, Q;
-  t[7] === Symbol.for("react.memo_cache_sentinel") ? (H = {
+  }, t[6] = T) : T = t[6];
+  let H;
+  t[7] !== p ? (H = [P, j, ...p, T], t[7] = p, t[8] = H) : H = t[8];
+  const Q = H;
+  let _, x;
+  t[9] === Symbol.for("react.memo_cache_sentinel") ? (x = {
     displayName: "Amoled Dark",
     name: "amoled"
-  }, Q = {
+  }, _ = {
     displayName: "Da Vinci",
     name: "davinci"
-  }, t[7] = H, t[8] = Q) : (H = t[7], Q = t[8]);
-  let _;
-  t[9] !== d ? (_ = [H, Q, ...d], t[9] = d, t[10] = _) : _ = t[10];
-  const x = _;
-  let r, R;
-  t[11] === Symbol.for("react.memo_cache_sentinel") ? (r = () => {
+  }, t[9] = _, t[10] = x) : (_ = t[9], x = t[10]);
+  let r;
+  t[11] !== d ? (r = [x, _, ...d], t[11] = d, t[12] = r) : r = t[12];
+  const R = r;
+  let K, F;
+  t[13] === Symbol.for("react.memo_cache_sentinel") ? (K = () => {
     requestAnimationFrame(() => {
       requestAnimationFrame(() => {
         E(!0);
       });
     });
-  }, R = [], t[11] = r, t[12] = R) : (r = t[11], R = t[12]), gt(r, R);
-  let V;
-  t[13] !== n ? (V = () => {
+  }, F = [], t[13] = K, t[14] = F) : (K = t[13], F = t[14]), gt(K, F);
+  let Y;
+  t[15] !== n ? (Y = () => {
     requestAnimationFrame(() => {
       E(!1), m(!0);
     }), setTimeout(n, 350);
-  }, t[13] = n, t[14] = V) : V = t[14];
-  const F = V;
-  let Y;
-  t[15] !== F ? (Y = () => {
-    F();
-  }, t[15] = F, t[16] = Y) : Y = t[16];
-  const D = Y, J = Ue, O = Le;
-  let A;
-  t[17] !== h || t[18] !== c ? (A = () => {
-    h <= 70 && (c(De), O(B));
-  }, t[17] = h, t[18] = c, t[19] = A) : A = t[19];
-  const X = A;
+  }, t[15] = n, t[16] = Y) : Y = t[16];
+  const D = Y;
+  let X;
+  t[17] !== D ? (X = () => {
+    D();
+  }, t[17] = D, t[18] = X) : X = t[18];
+  const O = X, z = We, J = je;
   let Z;
-  t[20] !== h || t[21] !== c ? (Z = () => {
-    h - 5 > 0 && (c(Fe), O(B));
-  }, t[20] = h, t[21] = c, t[22] = Z) : Z = t[22];
+  t[19] !== h || t[20] !== c ? (Z = () => {
+    h <= 70 && (c(Ue), J(B));
+  }, t[19] = h, t[20] = c, t[21] = Z) : Z = t[21];
   const M = Z;
   let it;
-  t[23] !== I || t[24] !== s ? (it = () => {
-    I < 3 && (s(Pe), O(C));
-  }, t[23] = I, t[24] = s, t[25] = it) : it = t[25];
+  t[22] !== h || t[23] !== c ? (it = () => {
+    h - 5 > 0 && (c(Le), J(B));
+  }, t[22] = h, t[23] = c, t[24] = it) : it = t[24];
   const at = it;
   let nt;
-  t[26] !== I || t[27] !== s ? (nt = () => {
-    I - 0.2 > 0.6 && (s(Be), O(C));
-  }, t[26] = I, t[27] = s, t[28] = nt) : nt = t[28];
-  const tt = nt;
+  t[25] !== I || t[26] !== s ? (nt = () => {
+    I < 3 && (s(De), J(C));
+  }, t[25] = I, t[26] = s, t[27] = nt) : nt = t[27];
+  const et = nt;
   let ot;
-  t[29] !== a || t[30] !== k ? (ot = () => {
+  t[28] !== I || t[29] !== s ? (ot = () => {
+    I - 0.2 > 0.6 && (s(Fe), J(C));
+  }, t[28] = I, t[29] = s, t[30] = ot) : ot = t[30];
+  const lt = ot;
+  let ft;
+  t[31] !== a || t[32] !== k ? (ft = () => {
     const St = [dt["options-menu"]];
     return k && St.push(dt.visible), a && St.push(dt["slide-down"]), St.join(" ");
-  }, t[29] = a, t[30] = k, t[31] = ot) : ot = t[31];
-  const ct = ot;
-  let ut;
-  t[32] !== a ? (ut = () => {
+  }, t[31] = a, t[32] = k, t[33] = ft) : ft = t[33];
+  const ut = ft;
+  let e;
+  t[34] !== a ? (e = () => {
     const St = [dt["options-menu-overlay"]];
     return a && St.push(dt["fade-out"]), St.join(" ");
-  }, t[32] = a, t[33] = ut) : ut = t[33];
-  const e = ut(), L = ct();
-  let N;
-  t[34] !== F ? (N = /* @__PURE__ */ rt("button", { onClick: F, className: dt["close-button"], "aria-label": "Close menu", children: "✕" }), t[34] = F, t[35] = N) : N = t[35];
-  let g;
-  t[36] === Symbol.for("react.memo_cache_sentinel") ? (g = /* @__PURE__ */ rt("h2", { className: dt.title, children: "Reader Options" }), t[36] = g) : g = t[36];
+  }, t[34] = a, t[35] = e) : e = t[35];
+  const N = e(), g = ut();
   let u;
-  t[37] === Symbol.for("react.memo_cache_sentinel") ? (u = /* @__PURE__ */ rt("div", { className: dt["option-label"], children: "Font family" }), t[37] = u) : u = t[37];
+  t[36] !== D ? (u = /* @__PURE__ */ rt("button", { onClick: D, className: dt["close-button"], "aria-label": "Close menu", children: "✕" }), t[36] = D, t[37] = u) : u = t[37];
   let S;
-  t[38] !== T || t[39] !== v ? (S = (St) => {
-    const Et = T.find((Tt) => Tt.name === St.target.value);
-    Et && v(Et.name);
-  }, t[38] = T, t[39] = v, t[40] = S) : S = t[40];
-  let U;
-  t[41] !== T ? (U = T.map(Re), t[41] = T, t[42] = U) : U = t[42];
+  t[38] === Symbol.for("react.memo_cache_sentinel") ? (S = /* @__PURE__ */ rt("h2", { className: dt.title, children: "Reader Options" }), t[38] = S) : S = t[38];
+  let L;
+  t[39] === Symbol.for("react.memo_cache_sentinel") ? (L = /* @__PURE__ */ rt("div", { className: dt["option-label"], children: "Font family" }), t[39] = L) : L = t[39];
   let W;
-  t[43] !== l || t[44] !== S || t[45] !== U ? (W = /* @__PURE__ */ _t("div", { className: dt["option-row"], children: [
-    u,
-    /* @__PURE__ */ rt("select", { className: dt.select, value: l, onChange: S, children: U })
-  ] }), t[43] = l, t[44] = S, t[45] = U, t[46] = W) : W = t[46];
-  let z;
-  t[47] === Symbol.for("react.memo_cache_sentinel") ? (z = /* @__PURE__ */ rt("div", { className: dt["option-label"], children: "Color Scheme" }), t[47] = z) : z = t[47];
+  t[40] !== Q || t[41] !== v ? (W = (St) => {
+    const Ft = Q.find((jt) => jt.name === St.target.value);
+    Ft && v(Ft.name);
+  }, t[40] = Q, t[41] = v, t[42] = W) : W = t[42];
+  let A;
+  t[43] !== Q ? (A = Q.map(Pe), t[43] = Q, t[44] = A) : A = t[44];
   let q;
-  t[48] !== x || t[49] !== y ? (q = (St) => {
-    const Et = x.find((Tt) => Tt.name === St.target.value);
-    Et && y(Et.name);
-  }, t[48] = x, t[49] = y, t[50] = q) : q = t[50];
-  let K;
-  t[51] !== x ? (K = x.map(Te), t[51] = x, t[52] = K) : K = t[52];
+  t[45] !== l || t[46] !== W || t[47] !== A ? (q = /* @__PURE__ */ _t("div", { className: dt["option-row"], children: [
+    L,
+    /* @__PURE__ */ rt("select", { className: dt.select, value: l, onChange: W, children: A })
+  ] }), t[45] = l, t[46] = W, t[47] = A, t[48] = q) : q = t[48];
+  let V;
+  t[49] === Symbol.for("react.memo_cache_sentinel") ? (V = /* @__PURE__ */ rt("div", { className: dt["option-label"], children: "Color Scheme" }), t[49] = V) : V = t[49];
   let G;
-  t[53] !== f || t[54] !== q || t[55] !== K ? (G = /* @__PURE__ */ _t("div", { className: dt["option-row"], children: [
-    z,
-    /* @__PURE__ */ rt("select", { className: dt.select, value: f, onChange: q, children: K })
-  ] }), t[53] = f, t[54] = q, t[55] = K, t[56] = G) : G = t[56];
-  let et;
-  t[57] === Symbol.for("react.memo_cache_sentinel") ? (et = /* @__PURE__ */ rt("div", { className: dt["option-label"], children: "Side padding" }), t[57] = et) : et = t[57];
-  let lt;
-  t[58] !== M ? (lt = /* @__PURE__ */ rt("button", { className: dt["stepper-button"], onClick: M, children: "-" }), t[58] = M, t[59] = lt) : lt = t[59];
+  t[50] !== R || t[51] !== y ? (G = (St) => {
+    const Ft = R.find((jt) => jt.name === St.target.value);
+    Ft && y(Ft.name);
+  }, t[50] = R, t[51] = y, t[52] = G) : G = t[52];
+  let tt;
+  t[53] !== R ? (tt = R.map(Be), t[53] = R, t[54] = tt) : tt = t[54];
+  let ct;
+  t[55] !== f || t[56] !== G || t[57] !== tt ? (ct = /* @__PURE__ */ _t("div", { className: dt["option-row"], children: [
+    V,
+    /* @__PURE__ */ rt("select", { className: dt.select, value: f, onChange: G, children: tt })
+  ] }), t[55] = f, t[56] = G, t[57] = tt, t[58] = ct) : ct = t[58];
   let st;
-  t[60] !== h ? (st = /* @__PURE__ */ rt("span", { ref: B, className: dt["option-value"], children: h }), t[60] = h, t[61] = st) : st = t[61];
+  t[59] === Symbol.for("react.memo_cache_sentinel") ? (st = /* @__PURE__ */ rt("div", { className: dt["option-label"], children: "Side padding" }), t[59] = st) : st = t[59];
   let ht;
-  t[62] !== X ? (ht = /* @__PURE__ */ rt("button", { className: dt["stepper-button"], onClick: X, children: "+" }), t[62] = X, t[63] = ht) : ht = t[63];
+  t[60] !== at ? (ht = /* @__PURE__ */ rt("button", { className: dt["stepper-button"], onClick: at, children: "-" }), t[60] = at, t[61] = ht) : ht = t[61];
   let vt;
-  t[64] !== lt || t[65] !== st || t[66] !== ht ? (vt = /* @__PURE__ */ _t("div", { className: dt["option-row"], children: [
-    et,
+  t[62] !== h ? (vt = /* @__PURE__ */ rt("span", { ref: B, className: dt["option-value"], children: h }), t[62] = h, t[63] = vt) : vt = t[63];
+  let pt;
+  t[64] !== M ? (pt = /* @__PURE__ */ rt("button", { className: dt["stepper-button"], onClick: M, children: "+" }), t[64] = M, t[65] = pt) : pt = t[65];
+  let xt;
+  t[66] !== ht || t[67] !== vt || t[68] !== pt ? (xt = /* @__PURE__ */ _t("div", { className: dt["option-row"], children: [
+    st,
     /* @__PURE__ */ _t("div", { className: dt["option-controls"], children: [
-      lt,
-      st,
-      ht
+      ht,
+      vt,
+      pt
     ] })
-  ] }), t[64] = lt, t[65] = st, t[66] = ht, t[67] = vt) : vt = t[67];
+  ] }), t[66] = ht, t[67] = vt, t[68] = pt, t[69] = xt) : xt = t[69];
   let mt;
-  t[68] === Symbol.for("react.memo_cache_sentinel") ? (mt = /* @__PURE__ */ rt("div", { className: dt["option-label"], children: "Font size" }), t[68] = mt) : mt = t[68];
-  let xt;
-  t[69] !== tt ? (xt = /* @__PURE__ */ rt("button", { className: dt["stepper-button"], onClick: tt, children: "-" }), t[69] = tt, t[70] = xt) : xt = t[70];
-  let pt;
-  t[71] !== I ? (pt = Math.round(I * 10), t[71] = I, t[72] = pt) : pt = t[72];
+  t[70] === Symbol.for("react.memo_cache_sentinel") ? (mt = /* @__PURE__ */ rt("div", { className: dt["option-label"], children: "Font size" }), t[70] = mt) : mt = t[70];
   let Ct;
-  t[73] !== pt ? (Ct = /* @__PURE__ */ rt("span", { ref: C, className: dt["option-value"], children: pt }), t[73] = pt, t[74] = Ct) : Ct = t[74];
-  let zt;
-  t[75] !== at ? (zt = /* @__PURE__ */ rt("button", { className: dt["stepper-button"], onClick: at, children: "+" }), t[75] = at, t[76] = zt) : zt = t[76];
+  t[71] !== lt ? (Ct = /* @__PURE__ */ rt("button", { className: dt["stepper-button"], onClick: lt, children: "-" }), t[71] = lt, t[72] = Ct) : Ct = t[72];
+  let At;
+  t[73] !== I ? (At = Math.round(I * 10), t[73] = I, t[74] = At) : At = t[74];
   let kt;
-  t[77] !== xt || t[78] !== Ct || t[79] !== zt ? (kt = /* @__PURE__ */ _t("div", { className: dt["option-row"], children: [
+  t[75] !== At ? (kt = /* @__PURE__ */ rt("span", { ref: C, className: dt["option-value"], children: At }), t[75] = At, t[76] = kt) : kt = t[76];
+  let Ot;
+  t[77] !== et ? (Ot = /* @__PURE__ */ rt("button", { className: dt["stepper-button"], onClick: et, children: "+" }), t[77] = et, t[78] = Ot) : Ot = t[78];
+  let Tt;
+  t[79] !== Ct || t[80] !== kt || t[81] !== Ot ? (Tt = /* @__PURE__ */ _t("div", { className: dt["option-row"], children: [
     mt,
     /* @__PURE__ */ _t("div", { className: dt["option-controls"], children: [
-      xt,
       Ct,
-      zt
+      kt,
+      Ot
     ] })
-  ] }), t[77] = xt, t[78] = Ct, t[79] = zt, t[80] = kt) : kt = t[80];
+  ] }), t[79] = Ct, t[80] = kt, t[81] = Ot, t[82] = Tt) : Tt = t[82];
+  let Bt;
+  t[83] === Symbol.for("react.memo_cache_sentinel") ? (Bt = "requestFullscreen" in document.documentElement ? /* @__PURE__ */ rt("button", { className: dt["fullscreen-button"], onClick: Ie, children: "Toggle fullscreen" }) : /* @__PURE__ */ rt(qt, {}), t[83] = Bt) : Bt = t[83];
   let Rt;
-  t[81] === Symbol.for("react.memo_cache_sentinel") ? (Rt = /* @__PURE__ */ rt("button", { className: dt["fullscreen-button"], onClick: Ae, children: "Toggle fullscreen" }), t[81] = Rt) : Rt = t[81];
-  let Ot;
-  t[82] !== W || t[83] !== G || t[84] !== vt || t[85] !== kt ? (Ot = /* @__PURE__ */ _t("div", { className: dt["options-buttons"], children: [
-    W,
-    G,
-    vt,
-    kt,
-    Rt
-  ] }), t[82] = W, t[83] = G, t[84] = vt, t[85] = kt, t[86] = Ot) : Ot = t[86];
+  t[84] !== q || t[85] !== ct || t[86] !== xt || t[87] !== Tt ? (Rt = /* @__PURE__ */ _t("div", { className: dt["options-buttons"], children: [
+    q,
+    ct,
+    xt,
+    Tt,
+    Bt
+  ] }), t[84] = q, t[85] = ct, t[86] = xt, t[87] = Tt, t[88] = Rt) : Rt = t[88];
   let Nt;
-  t[87] !== L || t[88] !== N || t[89] !== Ot ? (Nt = /* @__PURE__ */ _t("div", { className: L, onClick: J, children: [
-    N,
-    g,
-    Ot
-  ] }), t[87] = L, t[88] = N, t[89] = Ot, t[90] = Nt) : Nt = t[90];
-  let Bt;
-  return t[91] !== D || t[92] !== e || t[93] !== Nt ? (Bt = /* @__PURE__ */ rt("div", { className: e, onClick: D, children: Nt }), t[91] = D, t[92] = e, t[93] = Nt, t[94] = Bt) : Bt = t[94], Bt;
+  t[89] !== g || t[90] !== u || t[91] !== Rt ? (Nt = /* @__PURE__ */ _t("div", { className: g, onClick: z, children: [
+    u,
+    S,
+    Rt
+  ] }), t[89] = g, t[90] = u, t[91] = Rt, t[92] = Nt) : Nt = t[92];
+  let zt;
+  return t[93] !== O || t[94] !== N || t[95] !== Nt ? (zt = /* @__PURE__ */ rt("div", { className: N, onClick: O, children: Nt }), t[93] = O, t[94] = N, t[95] = Nt, t[96] = zt) : zt = t[96], zt;
 }
-function Te($) {
+function Be($) {
   return /* @__PURE__ */ rt("option", { value: $.name, children: $.displayName }, $.displayName);
 }
-function Re($) {
+function Pe($) {
   return /* @__PURE__ */ rt("option", { value: $.name, children: $.displayName }, $.displayName);
 }
-function Be($) {
+function Fe($) {
   return $ - 0.2;
 }
-function Pe($) {
+function De($) {
   return $ + 0.2;
 }
-function Fe($) {
+function Le($) {
   return $ - 5;
 }
-function De($) {
+function Ue($) {
   return $ + 5;
 }
-function Le($) {
+function je($) {
   $.current && ($.current.classList.add(dt["value-changed"]), setTimeout(() => {
     var t;
     (t = $.current) == null || t.classList.remove(dt["value-changed"]);
   }, 200));
 }
-function Ue($) {
+function We($) {
   $.stopPropagation();
 }
-const je = "_visible_1oftk_66", yt = {
+const Me = "_visible_1oftk_66", yt = {
   "nav-menu-overlay": "_nav-menu-overlay_1oftk_1",
   "fade-out": "_fade-out_1oftk_25",
   "nav-menu": "_nav-menu_1oftk_1",
-  visible: je,
+  visible: Me,
   "slide-down": "_slide-down_1oftk_72",
   "nav-header": "_nav-header_1oftk_81",
   "close-btn": "_close-btn_1oftk_96",
@@ -3290,7 +3298,7 @@ const je = "_visible_1oftk_66", yt = {
   "jumper-input": "_jumper-input_1oftk_175",
   "total-pages": "_total-pages_1oftk_198",
   "go-btn": "_go-btn_1oftk_204"
-}, We = ($) => {
+}, Ze = ($) => {
   const t = It.c(61), {
     toc: n,
     currentPage: I,
@@ -3312,22 +3320,22 @@ const je = "_visible_1oftk_66", yt = {
   }, m = [], t[1] = a, t[2] = m) : (a = t[1], m = t[2]), gt(a, m);
   let k, E;
   t[3] !== n ? (k = () => {
-    const tt = {}, ot = (ut) => {
-      ut.forEach((ft) => {
+    const et = {}, ot = (ft) => {
+      ft.forEach((ut) => {
         try {
-          const e = ft.href.replace("#", ""), L = document.getElementById(e);
-          if (L) {
-            const N = Zt(L) + 1;
-            tt[ft.href] = N;
+          const e = ut.href.replace("#", ""), U = document.getElementById(e);
+          if (U) {
+            const N = Ht(U) + 1;
+            et[ut.href] = N;
           }
         } catch {
         }
-        ft.subitems && ot(ft.subitems);
+        ut.subitems && ot(ut.subitems);
       });
-    }, ct = setTimeout(() => {
-      ot(n), d(tt);
+    }, lt = setTimeout(() => {
+      ot(n), d(et);
     }, 100);
-    return () => clearTimeout(ct);
+    return () => clearTimeout(lt);
   }, E = [n], t[3] = n, t[4] = k, t[5] = E) : (k = t[4], E = t[5]), gt(k, E);
   let C, B;
   t[6] !== I ? (C = () => {
@@ -3342,54 +3350,54 @@ const je = "_visible_1oftk_66", yt = {
   const j = P;
   let T;
   t[11] !== b || t[12] !== f || t[13] !== h ? (T = () => {
-    const tt = Math.max(1, Math.min(h, b));
-    f(tt - 1);
+    const et = Math.max(1, Math.min(h, b));
+    f(et - 1);
   }, t[11] = b, t[12] = f, t[13] = h, t[14] = T) : T = t[14];
   const H = T;
   let Q;
-  t[15] !== j || t[16] !== s ? (Q = (tt) => {
-    s(tt), j();
+  t[15] !== j || t[16] !== s ? (Q = (et) => {
+    s(et), j();
   }, t[15] = j, t[16] = s, t[17] = Q) : Q = t[17];
   const _ = Q;
-  let x, r, R, V, F, Y, D;
+  let x, r, R, K, F, Y, D;
   if (t[18] !== _ || t[19] !== j || t[20] !== v || t[21] !== c || t[22] !== i || t[23] !== n) {
-    const tt = (ct, ut) => {
-      const ft = ut === void 0 ? 0 : ut;
-      return /* @__PURE__ */ rt("ul", { className: ft === 0 ? yt["toc-list"] : yt["toc-sublist"], children: ct.map((e, L) => {
+    const et = (lt, ft) => {
+      const ut = ft === void 0 ? 0 : ft;
+      return /* @__PURE__ */ rt("ul", { className: ut === 0 ? yt["toc-list"] : yt["toc-sublist"], children: lt.map((e, U) => {
         const N = i[e.href];
         return /* @__PURE__ */ _t("li", { children: [
           /* @__PURE__ */ _t("div", { className: yt["toc-item"], onClick: () => _(e.href), children: [
             /* @__PURE__ */ rt("span", { className: yt["toc-label"], children: e.label }),
             N !== void 0 && /* @__PURE__ */ rt("span", { className: yt["toc-page-num"], children: N })
           ] }),
-          e.subitems && e.subitems.length > 0 && tt(e.subitems, ft + 1)
-        ] }, L);
+          e.subitems && e.subitems.length > 0 && et(e.subitems, ut + 1)
+        ] }, U);
       }) });
     };
     Y = `${yt["nav-menu-overlay"]} ${v ? yt["fade-out"] : ""}`, D = j, R = `
                     ${yt["nav-menu"]} 
                     ${c ? yt.visible : ""} 
                     ${v ? yt["slide-down"] : ""}
-                `, V = Me;
+                `, K = $e;
     let ot;
     t[31] === Symbol.for("react.memo_cache_sentinel") ? (ot = /* @__PURE__ */ rt("h2", { children: "Table of Contents" }), t[31] = ot) : ot = t[31], t[32] !== j ? (F = /* @__PURE__ */ _t("div", { className: yt["nav-header"], children: [
       ot,
       /* @__PURE__ */ rt("button", { className: yt["close-btn"], onClick: j, children: "×" })
-    ] }), t[32] = j, t[33] = F) : F = t[33], x = yt["toc-container"], r = n.length > 0 ? tt(n) : /* @__PURE__ */ rt("div", { style: {
+    ] }), t[32] = j, t[33] = F) : F = t[33], x = yt["toc-container"], r = n.length > 0 ? et(n) : /* @__PURE__ */ rt("div", { style: {
       padding: "20px",
       textAlign: "center",
       opacity: 0.5
-    }, children: "No chapters found" }), t[18] = _, t[19] = j, t[20] = v, t[21] = c, t[22] = i, t[23] = n, t[24] = x, t[25] = r, t[26] = R, t[27] = V, t[28] = F, t[29] = Y, t[30] = D;
+    }, children: "No chapters found" }), t[18] = _, t[19] = j, t[20] = v, t[21] = c, t[22] = i, t[23] = n, t[24] = x, t[25] = r, t[26] = R, t[27] = K, t[28] = F, t[29] = Y, t[30] = D;
   } else
-    x = t[24], r = t[25], R = t[26], V = t[27], F = t[28], Y = t[29], D = t[30];
-  let J;
-  t[34] !== x || t[35] !== r ? (J = /* @__PURE__ */ rt("div", { className: x, children: r }), t[34] = x, t[35] = r, t[36] = J) : J = t[36];
-  let O;
-  t[37] === Symbol.for("react.memo_cache_sentinel") ? (O = (tt) => o(parseInt(tt.target.value) || 1), t[37] = O) : O = t[37];
-  let A;
-  t[38] !== H ? (A = (tt) => tt.key === "Enter" && H(), t[38] = H, t[39] = A) : A = t[39];
+    x = t[24], r = t[25], R = t[26], K = t[27], F = t[28], Y = t[29], D = t[30];
   let X;
-  t[40] !== b || t[41] !== A ? (X = /* @__PURE__ */ rt("input", { className: yt["jumper-input"], type: "number", value: b, onChange: O, onKeyDown: A, onClick: Ze }), t[40] = b, t[41] = A, t[42] = X) : X = t[42];
+  t[34] !== x || t[35] !== r ? (X = /* @__PURE__ */ rt("div", { className: x, children: r }), t[34] = x, t[35] = r, t[36] = X) : X = t[36];
+  let O;
+  t[37] === Symbol.for("react.memo_cache_sentinel") ? (O = (et) => o(parseInt(et.target.value) || 1), t[37] = O) : O = t[37];
+  let z;
+  t[38] !== H ? (z = (et) => et.key === "Enter" && H(), t[38] = H, t[39] = z) : z = t[39];
+  let J;
+  t[40] !== b || t[41] !== z ? (J = /* @__PURE__ */ rt("input", { className: yt["jumper-input"], type: "number", value: b, onChange: O, onKeyDown: z, onClick: He }), t[40] = b, t[41] = z, t[42] = J) : J = t[42];
   let Z;
   t[43] !== h ? (Z = /* @__PURE__ */ _t("span", { className: yt["total-pages"], children: [
     "of ",
@@ -3398,38 +3406,38 @@ const je = "_visible_1oftk_66", yt = {
   let M;
   t[45] !== H ? (M = /* @__PURE__ */ rt("button", { className: yt["go-btn"], onClick: H, children: "Go" }), t[45] = H, t[46] = M) : M = t[46];
   let it;
-  t[47] !== X || t[48] !== Z || t[49] !== M ? (it = /* @__PURE__ */ rt("div", { className: yt["page-jumper"], children: /* @__PURE__ */ _t("div", { className: yt["jumper-controls"], children: [
-    X,
+  t[47] !== J || t[48] !== Z || t[49] !== M ? (it = /* @__PURE__ */ rt("div", { className: yt["page-jumper"], children: /* @__PURE__ */ _t("div", { className: yt["jumper-controls"], children: [
+    J,
     Z,
     M
-  ] }) }), t[47] = X, t[48] = Z, t[49] = M, t[50] = it) : it = t[50];
+  ] }) }), t[47] = J, t[48] = Z, t[49] = M, t[50] = it) : it = t[50];
   let at;
-  t[51] !== R || t[52] !== V || t[53] !== F || t[54] !== J || t[55] !== it ? (at = /* @__PURE__ */ _t("div", { className: R, onClick: V, children: [
+  t[51] !== R || t[52] !== K || t[53] !== F || t[54] !== X || t[55] !== it ? (at = /* @__PURE__ */ _t("div", { className: R, onClick: K, children: [
     F,
-    J,
+    X,
     it
-  ] }), t[51] = R, t[52] = V, t[53] = F, t[54] = J, t[55] = it, t[56] = at) : at = t[56];
+  ] }), t[51] = R, t[52] = K, t[53] = F, t[54] = X, t[55] = it, t[56] = at) : at = t[56];
   let nt;
   return t[57] !== Y || t[58] !== D || t[59] !== at ? (nt = /* @__PURE__ */ rt("div", { className: Y, onClick: D, children: at }), t[57] = Y, t[58] = D, t[59] = at, t[60] = nt) : nt = t[60], nt;
 };
-function Me($) {
+function $e($) {
   return $.stopPropagation();
 }
-function Ze($) {
+function He($) {
   return $.currentTarget.select();
 }
-const $e = "_overlay_18kzg_53", He = "_fadeOut_18kzg_80", qe = "_interactionZone_18kzg_86", Ge = "_centerZone_18kzg_96", Ye = "_iconWrapper_18kzg_107", Ke = "_label_18kzg_131", Ve = "_bottomIconGroup_18kzg_143", Xe = "_bottomIconWrapper_18kzg_150", Je = "_bounceArrow_18kzg_173", Qe = "_dismissButton_18kzg_183", wt = {
-  overlay: $e,
-  fadeOut: He,
-  interactionZone: qe,
-  centerZone: Ge,
-  iconWrapper: Ye,
-  label: Ke,
-  bottomIconGroup: Ve,
-  bottomIconWrapper: Xe,
-  bounceArrow: Je,
-  dismissButton: Qe
-}, tr = ($) => {
+const qe = "_overlay_18kzg_53", Ge = "_fadeOut_18kzg_80", Ye = "_interactionZone_18kzg_86", Ke = "_centerZone_18kzg_96", Ve = "_iconWrapper_18kzg_107", Xe = "_label_18kzg_131", Je = "_bottomIconGroup_18kzg_143", Qe = "_bottomIconWrapper_18kzg_150", tr = "_bounceArrow_18kzg_173", er = "_dismissButton_18kzg_183", wt = {
+  overlay: qe,
+  fadeOut: Ge,
+  interactionZone: Ye,
+  centerZone: Ke,
+  iconWrapper: Ve,
+  label: Xe,
+  bottomIconGroup: Je,
+  bottomIconWrapper: Qe,
+  bounceArrow: tr,
+  dismissButton: er
+}, rr = ($) => {
   const t = It.c(29), {
     color: n,
     onDismiss: I
@@ -3455,7 +3463,7 @@ const $e = "_overlay_18kzg_53", He = "_fadeOut_18kzg_80", qe = "_interactionZone
     /* @__PURE__ */ rt("div", { className: wt.label, children: "Next" })
   ] }), t[5] = o) : o = t[5];
   let p;
-  t[6] !== h ? (p = /* @__PURE__ */ rt("div", { className: wt.bottomIconWrapper, children: /* @__PURE__ */ rt(de, { size: 24, color: h }) }), t[6] = h, t[7] = p) : p = t[7];
+  t[6] !== h ? (p = /* @__PURE__ */ rt("div", { className: wt.bottomIconWrapper, children: /* @__PURE__ */ rt(me, { size: 24, color: h }) }), t[6] = h, t[7] = p) : p = t[7];
   let i;
   t[8] === Symbol.for("react.memo_cache_sentinel") ? (i = /* @__PURE__ */ rt("div", { className: wt.label, style: {
     fontSize: "0.9rem"
@@ -3475,7 +3483,7 @@ const $e = "_overlay_18kzg_53", He = "_fadeOut_18kzg_80", qe = "_interactionZone
     bottom: "80px"
   }, t[12] = m) : m = t[12];
   let k;
-  t[13] !== h ? (k = /* @__PURE__ */ rt("div", { className: wt.bottomIconWrapper, children: /* @__PURE__ */ rt(Qt, { size: 20, color: h }) }), t[13] = h, t[14] = k) : k = t[14];
+  t[13] !== h ? (k = /* @__PURE__ */ rt("div", { className: wt.bottomIconWrapper, children: /* @__PURE__ */ rt(ee, { size: 20, color: h }) }), t[13] = h, t[14] = k) : k = t[14];
   let E;
   t[15] === Symbol.for("react.memo_cache_sentinel") ? (E = /* @__PURE__ */ rt("div", { className: wt.label, style: {
     fontSize: "0.8rem"
@@ -3501,7 +3509,7 @@ const $e = "_overlay_18kzg_53", He = "_fadeOut_18kzg_80", qe = "_interactionZone
     o,
     P
   ] }), t[24] = c, t[25] = P, t[26] = y, t[27] = w, t[28] = j) : j = t[28], j;
-}, ir = ($) => {
+}, ar = ($) => {
   const t = It.c(75), {
     epubDataSource: n,
     onTitleChange: I,
@@ -3522,18 +3530,18 @@ const $e = "_overlay_18kzg_53", He = "_fadeOut_18kzg_80", qe = "_interactionZone
     error: d,
     loadEpub: a,
     setIsLoading: m
-  } = ge(), [k, E] = bt("none"), [C, B] = Pt("bok_global_side_padding", 30), [P, j] = Pt("bok_global_fontsize", 1.2), [T, H] = Pt("bok_global_font_family", "Inter"), [Q, _] = Pt("bok_global_theme", "Amoled Dark"), x = At(null), r = At(null), [R, V] = bt(0), [F, Y] = bt(0), [D, J] = Pt("bok_tutorial_shown", !1), [O, A] = bt(!D);
-  let X, Z;
-  t[2] !== D ? (X = () => {
-    D && A(!1);
-  }, Z = [D], t[2] = D, t[3] = X, t[4] = Z) : (X = t[3], Z = t[4]), gt(X, Z);
+  } = be(), [k, E] = bt("none"), [C, B] = Pt("bok_global_side_padding", 20), [P, j] = Pt("bok_global_fontsize", 1.4), [T, H] = Pt("bok_global_font_family", "Cormorant Garamond"), [Q, _] = Pt("bok_global_theme", "Amoled Dark"), x = Et(null), r = Et(null), [R, K] = bt(0), [F, Y] = bt(0), [D, X] = Pt("bok_tutorial_shown", !1), [O, z] = bt(!D);
+  let J, Z;
+  t[2] !== D ? (J = () => {
+    D && z(!1);
+  }, Z = [D], t[2] = D, t[3] = J, t[4] = Z) : (J = t[3], Z = t[4]), gt(J, Z);
   let M;
   t[5] === Symbol.for("react.memo_cache_sentinel") ? (M = () => {
     const st = setTimeout(() => {
       if (x.current) {
         const vt = getComputedStyle(x.current).getPropertyValue("--bg-color").trim();
-        let mt = document.querySelector("meta[name='theme-color']");
-        mt || (mt = document.createElement("meta"), mt.setAttribute("name", "theme-color"), document.head.appendChild(mt)), vt && (mt.setAttribute("content", vt), document.body.style.backgroundColor = vt);
+        let pt = document.querySelector("meta[name='theme-color']");
+        pt || (pt = document.createElement("meta"), pt.setAttribute("name", "theme-color"), document.head.appendChild(pt)), vt && (pt.setAttribute("content", vt), document.body.style.backgroundColor = vt);
       }
     }, 50);
     return () => clearTimeout(st);
@@ -3541,26 +3549,26 @@ const $e = "_overlay_18kzg_53", He = "_fadeOut_18kzg_80", qe = "_interactionZone
   let it;
   t[6] !== Q ? (it = [Q], t[6] = Q, t[7] = it) : it = t[7], gt(M, it);
   let at;
-  t[8] !== J ? (at = () => {
-    A(!1), J(!0);
-  }, t[8] = J, t[9] = at) : at = t[9];
+  t[8] !== X ? (at = () => {
+    z(!1), X(!0);
+  }, t[8] = X, t[9] = at) : at = t[9];
   const nt = at;
-  let tt, ot;
-  t[10] !== n || t[11] !== a ? (tt = () => {
+  let et, ot;
+  t[10] !== n || t[11] !== a ? (et = () => {
     n && a(n);
-  }, ot = [n, a], t[10] = n, t[11] = a, t[12] = tt, t[13] = ot) : (tt = t[12], ot = t[13]), gt(tt, ot);
-  let ct, ut;
-  t[14] !== I || t[15] !== b ? (ct = () => {
+  }, ot = [n, a], t[10] = n, t[11] = a, t[12] = et, t[13] = ot) : (et = t[12], ot = t[13]), gt(et, ot);
+  let lt, ft;
+  t[14] !== I || t[15] !== b ? (lt = () => {
     I && I(b);
-  }, ut = [b, I], t[14] = I, t[15] = b, t[16] = ct, t[17] = ut) : (ct = t[16], ut = t[17]), gt(ct, ut);
-  let ft, e;
-  t[18] !== i || t[19] !== h ? (ft = () => {
+  }, ft = [b, I], t[14] = I, t[15] = b, t[16] = lt, t[17] = ft) : (lt = t[16], ft = t[17]), gt(lt, ft);
+  let ut, e;
+  t[18] !== i || t[19] !== h ? (ut = () => {
     h && h(i);
-  }, e = [i, h], t[18] = i, t[19] = h, t[20] = ft, t[21] = e) : (ft = t[20], e = t[21]), gt(ft, e);
-  let L, N;
-  t[22] !== d || t[23] !== l ? (L = () => {
+  }, e = [i, h], t[18] = i, t[19] = h, t[20] = ut, t[21] = e) : (ut = t[20], e = t[21]), gt(ut, e);
+  let U, N;
+  t[22] !== d || t[23] !== l ? (U = () => {
     d && l && l(d);
-  }, N = [d, l], t[22] = d, t[23] = l, t[24] = L, t[25] = N) : (L = t[24], N = t[25]), gt(L, N);
+  }, N = [d, l], t[22] = d, t[23] = l, t[24] = U, t[25] = N) : (U = t[24], N = t[25]), gt(U, N);
   const g = `${C}px`, u = `${P}em`;
   let S;
   t[26] !== c || t[27] !== T || t[28] !== g || t[29] !== u ? (S = {
@@ -3571,7 +3579,7 @@ const $e = "_overlay_18kzg_53", He = "_fadeOut_18kzg_80", qe = "_interactionZone
     "--font-size": u,
     "--font-family": T
   }, t[26] = c, t[27] = T, t[28] = g, t[29] = u, t[30] = S) : S = t[30];
-  const U = S;
+  const L = S;
   if (d && !i && !o) {
     const st = `bok-reader-container ${f || ""}`;
     let ht;
@@ -3584,24 +3592,24 @@ const $e = "_overlay_18kzg_53", He = "_fadeOut_18kzg_80", qe = "_interactionZone
       "Error loading EPUB: ",
       d
     ] }), t[32] = d, t[33] = vt) : vt = t[33];
-    let mt;
-    return t[34] !== s || t[35] !== st || t[36] !== vt ? (mt = /* @__PURE__ */ rt("div", { className: st, style: s, children: vt }), t[34] = s, t[35] = st, t[36] = vt, t[37] = mt) : mt = t[37], mt;
+    let pt;
+    return t[34] !== s || t[35] !== st || t[36] !== vt ? (pt = /* @__PURE__ */ rt("div", { className: st, style: s, children: vt }), t[34] = s, t[35] = st, t[36] = vt, t[37] = pt) : pt = t[37], pt;
   }
   const W = `bok-reader-container ${Q === "davinci" ? "davinci" : ""}`;
-  let z;
-  t[38] !== U || t[39] !== s ? (z = {
+  let A;
+  t[38] !== L || t[39] !== s ? (A = {
     ...s,
-    ...U
-  }, t[38] = U, t[39] = s, t[40] = z) : z = t[40];
-  const q = z;
-  let K;
-  t[41] !== c || t[42] !== i ? (K = /* @__PURE__ */ rt(Ee, { isLoading: i, color: c }), t[41] = c, t[42] = i, t[43] = K) : K = t[43];
+    ...L
+  }, t[38] = L, t[39] = s, t[40] = A) : A = t[40];
+  const q = A;
+  let V;
+  t[41] !== c || t[42] !== i ? (V = /* @__PURE__ */ rt(ze, { isLoading: i, color: c }), t[41] = c, t[42] = i, t[43] = V) : V = t[43];
   let G;
-  t[44] !== k || t[45] !== c || t[46] !== Q || t[47] !== R || t[48] !== nt || t[49] !== T || t[50] !== P || t[51] !== i || t[52] !== o || t[53] !== _ || t[54] !== H || t[55] !== j || t[56] !== m || t[57] !== B || t[58] !== O || t[59] !== C || t[60] !== w || t[61] !== b || t[62] !== p || t[63] !== F ? (G = o && /* @__PURE__ */ _t(Kt, { children: [
-    O && !i && /* @__PURE__ */ rt(tr, { color: c, onDismiss: nt }),
-    /* @__PURE__ */ rt(Se, { ref: r, content: o, title: b, setIsLoading: m, fontSize: P, sidePadding: C, fontFamily: T, isOptionMenuVisible: k !== "none", containerElementRef: x, showTutorial: O, onPageChange: V, onPageCountChange: Y }),
-    k === "options" && /* @__PURE__ */ rt(Ne, { onClose: () => E("none"), fontSize: P, padding: C, fontFamily: T, colorScheme: Q, setPadding: B, setFontSize: j, setFontFamily: H, setColorScheme: _, supportedFonts: w, supportedColorschemes: [] }),
-    k === "navigation" && !i && /* @__PURE__ */ rt(We, { toc: p, currentPage: R, totalPages: F, onClose: () => E("none"), onGoToPage: (st) => {
+  t[44] !== k || t[45] !== c || t[46] !== Q || t[47] !== R || t[48] !== nt || t[49] !== T || t[50] !== P || t[51] !== i || t[52] !== o || t[53] !== _ || t[54] !== H || t[55] !== j || t[56] !== m || t[57] !== B || t[58] !== O || t[59] !== C || t[60] !== w || t[61] !== b || t[62] !== p || t[63] !== F ? (G = o && /* @__PURE__ */ _t(qt, { children: [
+    O && !i && /* @__PURE__ */ rt(rr, { color: c, onDismiss: nt }),
+    /* @__PURE__ */ rt(Ce, { ref: r, content: o, title: b, setIsLoading: m, fontSize: P, sidePadding: C, fontFamily: T, isOptionMenuVisible: k !== "none", containerElementRef: x, showTutorial: O, onPageChange: K, onPageCountChange: Y }),
+    k === "options" && /* @__PURE__ */ rt(Re, { onClose: () => E("none"), fontSize: P, padding: C, fontFamily: T, colorScheme: Q, setPadding: B, setFontSize: j, setFontFamily: H, setColorScheme: _, supportedFonts: w, supportedColorschemes: [] }),
+    k === "navigation" && !i && /* @__PURE__ */ rt(Ze, { toc: p, currentPage: R, totalPages: F, onClose: () => E("none"), onGoToPage: (st) => {
       var ht;
       return (ht = r.current) == null ? void 0 : ht.goToPage(st);
     }, onChapterClick: (st) => {
@@ -3609,27 +3617,27 @@ const $e = "_overlay_18kzg_53", He = "_fadeOut_18kzg_80", qe = "_interactionZone
       return (ht = r.current) == null ? void 0 : ht.findAndJumpToHref(st);
     } }),
     k === "none" && !O && !i && /* @__PURE__ */ _t("div", { className: "bottom-interaction-layer", children: [
-      /* @__PURE__ */ rt("div", { className: "trigger-zone", onClick: er }),
+      /* @__PURE__ */ rt("div", { className: "trigger-zone", onClick: nr }),
       /* @__PURE__ */ rt("div", { className: "trigger-zone", onClick: () => E("navigation"), "aria-label": "Open Navigation" }),
       /* @__PURE__ */ rt("div", { className: "trigger-zone", onClick: () => E("options"), "aria-label": "Open Settings" }),
-      /* @__PURE__ */ rt("div", { className: "settings-icon", onClick: () => E("options"), "aria-label": "Open Settings", children: /* @__PURE__ */ rt(Qt, { size: 16 }) })
+      /* @__PURE__ */ rt("div", { className: "settings-icon", onClick: () => E("options"), "aria-label": "Open Settings", children: /* @__PURE__ */ rt(ee, { size: 16 }) })
     ] })
   ] }), t[44] = k, t[45] = c, t[46] = Q, t[47] = R, t[48] = nt, t[49] = T, t[50] = P, t[51] = i, t[52] = o, t[53] = _, t[54] = H, t[55] = j, t[56] = m, t[57] = B, t[58] = O, t[59] = C, t[60] = w, t[61] = b, t[62] = p, t[63] = F, t[64] = G) : G = t[64];
-  let et;
-  t[65] !== n || t[66] !== d || t[67] !== i ? (et = !n && !i && !d && /* @__PURE__ */ rt("div", { style: {
+  let tt;
+  t[65] !== n || t[66] !== d || t[67] !== i ? (tt = !n && !i && !d && /* @__PURE__ */ rt("div", { style: {
     padding: "20px",
     textAlign: "center"
-  }, children: "No EPUB loaded." }), t[65] = n, t[66] = d, t[67] = i, t[68] = et) : et = t[68];
-  let lt;
-  return t[69] !== W || t[70] !== q || t[71] !== K || t[72] !== G || t[73] !== et ? (lt = /* @__PURE__ */ _t("div", { className: W, style: q, ref: x, children: [
-    K,
+  }, children: "No EPUB loaded." }), t[65] = n, t[66] = d, t[67] = i, t[68] = tt) : tt = t[68];
+  let ct;
+  return t[69] !== W || t[70] !== q || t[71] !== V || t[72] !== G || t[73] !== tt ? (ct = /* @__PURE__ */ _t("div", { className: W, style: q, ref: x, children: [
+    V,
     G,
-    et
-  ] }), t[69] = W, t[70] = q, t[71] = K, t[72] = G, t[73] = et, t[74] = lt) : lt = t[74], lt;
+    tt
+  ] }), t[69] = W, t[70] = q, t[71] = V, t[72] = G, t[73] = tt, t[74] = ct) : ct = t[74], ct;
 };
-function er() {
+function nr() {
   console.log("Left Click - Reserved");
 }
 export {
-  ir as BokReader
+  ar as BokReader
 };