bok-reader 0.3.3 → 0.3.4

package/dist/bok.es.js

@@ -1,5 +1,5 @@
 import { jsxs as pt, jsx as nt, Fragment as Kt } from "react/jsx-runtime";
-import Vt, { forwardRef as qt, createElement as Wt, useState as gt, useRef as At, useCallback as re, useEffect as _t, useImperativeHandle as ne } from "react";
+import Vt, { forwardRef as $t, createElement as Wt, useState as gt, useRef as At, useCallback as re, useEffect as _t, 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(H) {
   return H && H.__esModule && Object.prototype.hasOwnProperty.call(H, "default") ? H.default : H;
@@ -14,10 +14,10 @@ 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 $t;
+var Ht;
 function se() {
-  if ($t) return Ut;
-  $t = 1;
+  if (Ht) return Ut;
+  Ht = 1;
   var H = Vt.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE;
   return Ut.c = function(t) {
     return H.H.useMemoCache(t);
@@ -33,9 +33,9 @@ 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 Ht;
+var qt;
 function ae() {
-  return Ht || (Ht = 1, process.env.NODE_ENV !== "production" && function() {
+  return qt || (qt = 1, process.env.NODE_ENV !== "production" && function() {
     var H = Vt.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE;
     jt.c = function(t) {
       var n = H.H;
@@ -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 = qt(
+const fe = $t(
   ({
     color: H = "currentColor",
     size: t = 24,
@@ -127,7 +127,7 @@ const fe = qt(
  * See the LICENSE file in the root directory of this source tree.
  */
 const Jt = (H, t) => {
-  const n = qt(
+  const n = $t(
     ({ className: I, ...h }, l) => Wt(fe, {
       ref: l,
       iconNode: t,
@@ -298,7 +298,7 @@ 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)), $ = C.comment, Q = s.transformTo("string", m($)), _ = s.transformTo("string", y.utf8encode($)), S = T.length !== C.name.length, r = _.length !== $.length, R = "", V = "", F = "", Y = C.dir, L = C.date, J = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+        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)), q = C.comment, Q = s.transformTo("string", m(q)), _ = s.transformTo("string", y.utf8encode(q)), S = T.length !== C.name.length, r = _.length !== q.length, R = "", V = "", F = "", Y = C.dir, L = C.date, J = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
         p && !i || (J.crc32 = o.crc32, J.compressedSize = o.compressedSize, J.uncompressedSize = o.uncompressedSize);
         var O = 0;
         p && (O |= 8), P || !S && !r || (O |= 2048);
@@ -480,13 +480,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       } };
     }, {}], 15: [function(n, I, h) {
       function l(C, B, P) {
-        var j, T = s.getTypeOf(B), $ = s.extend(P || {}, v);
-        $.date = $.date || /* @__PURE__ */ new Date(), $.compression !== null && ($.compression = $.compression.toUpperCase()), typeof $.unixPermissions == "string" && ($.unixPermissions = parseInt($.unixPermissions, 8)), $.unixPermissions && 16384 & $.unixPermissions && ($.dir = !0), $.dosPermissions && 16 & $.dosPermissions && ($.dir = !0), $.dir && (C = a(C)), $.createFolders && (j = d(C)) && m.call(this, j, !0);
-        var Q = T === "string" && $.binary === !1 && $.base64 === !1;
-        P && P.binary !== void 0 || ($.binary = !Q), (B instanceof w && B.uncompressedSize === 0 || $.dir || !B || B.length === 0) && ($.base64 = !1, $.binary = !0, B = "", $.compression = "STORE", T = "string");
+        var j, T = s.getTypeOf(B), q = s.extend(P || {}, v);
+        q.date = q.date || /* @__PURE__ */ new Date(), q.compression !== null && (q.compression = q.compression.toUpperCase()), typeof q.unixPermissions == "string" && (q.unixPermissions = parseInt(q.unixPermissions, 8)), q.unixPermissions && 16384 & q.unixPermissions && (q.dir = !0), q.dosPermissions && 16 & q.dosPermissions && (q.dir = !0), q.dir && (C = a(C)), q.createFolders && (j = d(C)) && m.call(this, j, !0);
+        var Q = T === "string" && q.binary === !1 && q.base64 === !1;
+        P && P.binary !== void 0 || (q.binary = !Q), (B instanceof w && B.uncompressedSize === 0 || q.dir || !B || B.length === 0) && (q.base64 = !1, q.binary = !0, B = "", q.compression = "STORE", T = "string");
         var _ = null;
-        _ = B instanceof w || B instanceof c ? B : p.isNode && p.isStream(B) ? new i(C, B) : s.prepareContent(C, B, $.binary, $.optimizedBinaryString, $.base64);
-        var S = new b(C, _, $);
+        _ = B instanceof w || B instanceof c ? B : p.isNode && p.isStream(B) ? new i(C, B) : s.prepareContent(C, B, q.binary, q.optimizedBinaryString, q.base64);
+        var S = new b(C, _, q);
         this.files[C] = S;
       }
       var f = n("./utf8"), s = n("./utils"), c = n("./stream/GenericWorker"), y = n("./stream/StreamHelper"), v = n("./defaults"), w = n("./compressedObject"), b = n("./zipObject"), o = n("./generate"), p = n("./nodejsUtils"), i = n("./nodejs/NodejsStreamInputAdapter"), d = function(C) {
@@ -515,16 +515,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (arguments.length !== 1) return C = this.root + C, l.call(this, C, B, P), this;
         if (k(C)) {
           var j = C;
-          return this.filter(function($, Q) {
-            return !Q.dir && j.test($);
+          return this.filter(function(q, Q) {
+            return !Q.dir && j.test(q);
           });
         }
         var T = this.files[this.root + C];
         return T && !T.dir ? T : null;
       }, folder: function(C) {
         if (!C) return this;
-        if (k(C)) return this.filter(function(T, $) {
-          return $.dir && C.test(T);
+        if (k(C)) return this.filter(function(T, q) {
+          return q.dir && C.test(T);
         });
         var B = this.root + C, P = m.call(this, B), j = this.clone();
         return j.root = P.name, j;
@@ -532,8 +532,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         C = this.root + C;
         var B = this.files[C];
         if (B || (C.slice(-1) !== "/" && (C += "/"), B = this.files[C]), B && !B.dir) delete this.files[C];
-        else for (var P = this.filter(function(T, $) {
-          return $.name.slice(0, C.length) === C;
+        else for (var P = this.filter(function(T, q) {
+          return q.name.slice(0, C.length) === C;
         }), j = 0; j < P.length; j++) delete this.files[P[j].name];
         return this;
       }, generate: function() {
@@ -790,7 +790,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     return l.transformTo(P, j);
                 }
               }(E, function(P, j) {
-                var T, $ = 0, Q = null, _ = 0;
+                var T, q = 0, Q = null, _ = 0;
                 for (T = 0; T < j.length; T++) _ += j[T].length;
                 switch (P) {
                   case "string":
@@ -798,7 +798,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   case "array":
                     return Array.prototype.concat.apply([], j);
                   case "uint8array":
-                    for (Q = new Uint8Array(_), T = 0; T < j.length; T++) Q.set(j[T], $), $ += j[T].length;
+                    for (Q = new Uint8Array(_), T = 0; T < j.length; T++) Q.set(j[T], q), q += j[T].length;
                     return Q;
                   case "nodebuffer":
                     return Buffer.concat(j);
@@ -1344,8 +1344,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (!k) return this.resolve([]);
         for (var C = new Array(k), B = 0, P = -1, j = new this(f); ++P < k; ) T(a[P], P);
         return j;
-        function T($, Q) {
-          m.resolve($).then(function(_) {
+        function T(q, Q) {
+          m.resolve(q).then(function(_) {
             C[Q] = _, ++B !== k || E || (E = !0, s.resolve(j, C));
           }, function(_) {
             E || (E = !0, s.reject(j, _));
@@ -1422,12 +1422,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return a.result;
       }
       o.prototype.push = function(i, d) {
-        var a, m, k, E, C, B, P = this.strm, j = this.options.chunkSize, T = this.options.dictionary, $ = !1;
+        var a, m, k, E, C, B, P = this.strm, j = this.options.chunkSize, T = this.options.dictionary, q = !1;
         if (this.ended) return !1;
         m = d === ~~d ? d : d === !0 ? c.Z_FINISH : c.Z_NO_FLUSH, typeof i == "string" ? P.input = s.binstring2buf(i) : b.call(i) === "[object ArrayBuffer]" ? P.input = new Uint8Array(i) : P.input = i, P.next_in = 0, P.avail_in = P.input.length;
         do {
-          if (P.avail_out === 0 && (P.output = new f.Buf8(j), P.next_out = 0, P.avail_out = j), (a = l.inflate(P, c.Z_NO_FLUSH)) === c.Z_NEED_DICT && T && (B = typeof T == "string" ? s.string2buf(T) : b.call(T) === "[object ArrayBuffer]" ? new Uint8Array(T) : T, a = l.inflateSetDictionary(this.strm, B)), a === c.Z_BUF_ERROR && $ === !0 && (a = c.Z_OK, $ = !1), a !== c.Z_STREAM_END && a !== c.Z_OK) return this.onEnd(a), !(this.ended = !0);
-          P.next_out && (P.avail_out !== 0 && a !== c.Z_STREAM_END && (P.avail_in !== 0 || m !== c.Z_FINISH && m !== c.Z_SYNC_FLUSH) || (this.options.to === "string" ? (k = s.utf8border(P.output, P.next_out), E = P.next_out - k, C = s.buf2string(P.output, k), P.next_out = E, P.avail_out = j - E, E && f.arraySet(P.output, P.output, k, E, 0), this.onData(C)) : this.onData(f.shrinkBuf(P.output, P.next_out)))), P.avail_in === 0 && P.avail_out === 0 && ($ = !0);
+          if (P.avail_out === 0 && (P.output = new f.Buf8(j), P.next_out = 0, P.avail_out = j), (a = l.inflate(P, c.Z_NO_FLUSH)) === c.Z_NEED_DICT && T && (B = typeof T == "string" ? s.string2buf(T) : b.call(T) === "[object ArrayBuffer]" ? new Uint8Array(T) : T, a = l.inflateSetDictionary(this.strm, B)), a === c.Z_BUF_ERROR && q === !0 && (a = c.Z_OK, q = !1), a !== c.Z_STREAM_END && a !== c.Z_OK) return this.onEnd(a), !(this.ended = !0);
+          P.next_out && (P.avail_out !== 0 && a !== c.Z_STREAM_END && (P.avail_in !== 0 || m !== c.Z_FINISH && m !== c.Z_SYNC_FLUSH) || (this.options.to === "string" ? (k = s.utf8border(P.output, P.next_out), E = P.next_out - k, C = s.buf2string(P.output, k), P.next_out = E, P.avail_out = j - E, E && f.arraySet(P.output, P.output, k, E, 0), this.onData(C)) : this.onData(f.shrinkBuf(P.output, P.next_out)))), P.avail_in === 0 && P.avail_out === 0 && (q = !0);
         } while ((0 < P.avail_in || P.avail_out === 0) && a !== c.Z_STREAM_END);
         return a === c.Z_STREAM_END && (m = c.Z_FINISH), m === c.Z_FINISH ? (a = l.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === c.Z_OK) : m !== c.Z_SYNC_FLUSH || (this.onEnd(c.Z_OK), !(P.avail_out = 0));
       }, o.prototype.onData = function(i) {
@@ -1535,7 +1535,7 @@ 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, $ = 258, Q = $ + T + 1, _ = 42, S = 113, r = 1, R = 2, V = 3, F = 4;
+      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, q = 258, Q = q + T + 1, _ = 42, S = 113, r = 1, R = 2, V = 3, F = 4;
       function Y(e, U) {
         return e.msg = v[U], U;
       }
@@ -1559,24 +1559,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         e.pending_buf[e.pending++] = U >>> 8 & 255, e.pending_buf[e.pending++] = 255 & U;
       }
       function M(e, U) {
-        var N, g, u = e.max_chain_length, x = e.strstart, D = 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 + $, st = q[x + D - 1], ot = q[x + D];
+        var N, g, u = e.max_chain_length, x = e.strstart, D = e.prev_length, W = e.nice_match, z = e.strstart > e.w_size - Q ? e.strstart - (e.w_size - Q) : 0, $ = e.window, K = e.w_mask, G = e.prev, et = e.strstart + q, st = $[x + D - 1], ot = $[x + D];
         e.prev_length >= e.good_match && (u >>= 2), W > e.lookahead && (W = e.lookahead);
         do
-          if (q[(N = U) + D] === ot && q[N + D - 1] === st && q[N] === q[x] && q[++N] === q[x + 1]) {
+          if ($[(N = U) + D] === ot && $[N + D - 1] === st && $[N] === $[x] && $[++N] === $[x + 1]) {
             x += 2, N++;
             do
               ;
-            while (q[++x] === q[++N] && q[++x] === q[++N] && q[++x] === q[++N] && q[++x] === q[++N] && q[++x] === q[++N] && q[++x] === q[++N] && q[++x] === q[++N] && q[++x] === q[++N] && x < et);
-            if (g = $ - (et - x), x = et - $, D < g) {
+            while ($[++x] === $[++N] && $[++x] === $[++N] && $[++x] === $[++N] && $[++x] === $[++N] && $[++x] === $[++N] && $[++x] === $[++N] && $[++x] === $[++N] && $[++x] === $[++N] && x < et);
+            if (g = q - (et - x), x = et - q, D < g) {
               if (e.match_start = U, W <= (D = g)) break;
-              st = q[x + D - 1], ot = q[x + D];
+              st = $[x + D - 1], ot = $[x + D];
             }
           }
         while ((U = G[U & K]) > z && --u != 0);
         return D <= e.lookahead ? D : e.lookahead;
       }
       function it(e) {
-        var U, N, g, u, x, D, W, z, q, K, G = e.w_size;
+        var U, N, g, u, x, D, W, z, $, K, 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, U = N = e.hash_size; g = e.head[--U], e.head[U] = G <= g ? g - G : 0, --N; ) ;
@@ -1584,7 +1584,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             u += G;
           }
           if (e.strm.avail_in === 0) break;
-          if (D = e.strm, W = e.window, z = e.strstart + e.lookahead, q = u, K = void 0, K = D.avail_in, q < K && (K = q), N = K === 0 ? 0 : (D.avail_in -= K, f.arraySet(W, D.input, D.next_in, K, z), D.state.wrap === 1 ? D.adler = c(D.adler, W, K, z) : D.state.wrap === 2 && (D.adler = y(D.adler, W, K, z)), D.next_in += K, D.total_in += K, K), e.lookahead += N, e.lookahead + e.insert >= T) for (x = e.strstart - e.insert, e.ins_h = e.window[x], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[x + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[x + T - 1]) & e.hash_mask, e.prev[x & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = x, x++, e.insert--, !(e.lookahead + e.insert < T)); ) ;
+          if (D = e.strm, W = e.window, z = e.strstart + e.lookahead, $ = u, K = void 0, K = D.avail_in, $ < K && (K = $), N = K === 0 ? 0 : (D.avail_in -= K, f.arraySet(W, D.input, D.next_in, K, z), D.state.wrap === 1 ? D.adler = c(D.adler, W, K, z) : D.state.wrap === 2 && (D.adler = y(D.adler, W, K, z)), D.next_in += K, D.total_in += K, K), e.lookahead += N, e.lookahead + e.insert >= T) for (x = e.strstart - e.insert, e.ins_h = e.window[x], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[x + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[x + T - 1]) & e.hash_mask, e.prev[x & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = x, x++, e.insert--, !(e.lookahead + e.insert < T)); ) ;
         } while (e.lookahead < Q && e.strm.avail_in !== 0);
       }
       function at(e, U) {
@@ -1697,31 +1697,31 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         } else if (e.avail_in === 0 && L(U) <= L(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 || U !== w && g.status !== 666) {
-          var W = g.strategy === 2 ? function(z, q) {
+          var W = g.strategy === 2 ? function(z, $) {
             for (var K; ; ) {
               if (z.lookahead === 0 && (it(z), z.lookahead === 0)) {
-                if (q === w) return r;
+                if ($ === 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;
             }
-            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, U) : g.strategy === 3 ? function(z, q) {
+            return z.insert = 0, $ === 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, U) : g.strategy === 3 ? function(z, $) {
             for (var K, G, et, st, ot = z.window; ; ) {
-              if (z.lookahead <= $) {
-                if (it(z), z.lookahead <= $ && q === w) return r;
+              if (z.lookahead <= q) {
+                if (it(z), z.lookahead <= q && $ === w) return r;
                 if (z.lookahead === 0) break;
               }
               if (z.match_length = 0, z.lookahead >= T && 0 < z.strstart && (G = ot[et = z.strstart - 1]) === ot[++et] && G === ot[++et] && G === ot[++et]) {
-                st = z.strstart + $;
+                st = z.strstart + q;
                 do
                   ;
                 while (G === ot[++et] && G === ot[++et] && G === ot[++et] && G === ot[++et] && G === ot[++et] && G === ot[++et] && G === ot[++et] && G === ot[++et] && et < st);
-                z.match_length = $ - (st - et), z.match_length > z.lookahead && (z.match_length = z.lookahead);
+                z.match_length = q - (st - et), z.match_length > z.lookahead && (z.match_length = z.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;
             }
-            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;
+            return z.insert = 0, $ === 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, U) : l[g.level].func(g, U);
           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 && (U === 1 ? s._tr_align(g) : U !== 5 && (s._tr_stored_block(g, 0, 0, !1), U === 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;
@@ -1731,9 +1731,9 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         var U;
         return e && e.state ? (U = e.state.status) !== _ && U !== 69 && U !== 73 && U !== 91 && U !== 103 && U !== S && U !== 666 ? Y(e, p) : (e.state = null, U === S ? Y(e, -3) : o) : p;
       }, h.deflateSetDictionary = function(e, U) {
-        var N, g, u, x, D, W, z, q, K = U.length;
+        var N, g, u, x, D, W, z, $, K = U.length;
         if (!e || !e.state || (x = (N = e.state).wrap) === 2 || x === 1 && N.status !== _ || N.lookahead) return p;
-        for (x === 1 && (e.adler = c(e.adler, U, K, 0)), N.wrap = 0, K >= N.w_size && (x === 0 && (J(N.head), N.strstart = 0, N.block_start = 0, N.insert = 0), q = new f.Buf8(N.w_size), f.arraySet(q, U, K - N.w_size, N.w_size, 0), U = q, K = N.w_size), D = e.avail_in, W = e.next_in, z = e.input, e.avail_in = K, e.next_in = 0, e.input = U, it(N); N.lookahead >= T; ) {
+        for (x === 1 && (e.adler = c(e.adler, U, K, 0)), N.wrap = 0, K >= N.w_size && (x === 0 && (J(N.head), N.strstart = 0, N.block_start = 0, N.insert = 0), $ = new f.Buf8(N.w_size), f.arraySet($, U, K - N.w_size, N.w_size, 0), U = $, K = N.w_size), D = e.avail_in, W = e.next_in, z = e.input, e.avail_in = K, 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);
         }
@@ -1745,7 +1745,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       };
     }, {}], 48: [function(n, I, h) {
       I.exports = function(l, f) {
-        var s, c, y, v, w, b, o, p, i, d, a, m, k, E, C, B, P, j, T, $, Q, _, S, r, R;
+        var s, c, y, v, w, b, o, p, i, d, a, m, k, E, C, B, P, j, T, q, Q, _, S, r, R;
         s = l.state, c = l.next_in, r = l.input, y = c + (l.avail_in - 5), v = l.next_out, R = l.output, w = v - (f - l.avail_out), b = v + (l.avail_out - 257), o = s.dmax, p = s.wsize, i = s.whave, d = s.wnext, a = s.window, m = s.hold, k = s.bits, E = s.lencode, C = s.distcode, B = (1 << s.lenbits) - 1, P = (1 << s.distbits) - 1;
         t: do {
           k < 15 && (m += r[c++] << k, k += 8, m += r[c++] << k, k += 8), j = E[m & B];
@@ -1764,7 +1764,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 l.msg = "invalid literal/length code", s.mode = 30;
                 break t;
               }
-              $ = 65535 & j, (T &= 15) && (k < T && (m += r[c++] << k, k += 8), $ += m & (1 << T) - 1, m >>>= T, k -= T), k < 15 && (m += r[c++] << k, k += 8, m += r[c++] << k, k += 8), j = C[m & P];
+              q = 65535 & j, (T &= 15) && (k < T && (m += r[c++] << k, k += 8), q += m & (1 << T) - 1, m >>>= T, k -= T), k < 15 && (m += r[c++] << k, k += 8, m += r[c++] << k, k += 8), j = C[m & P];
               r: for (; ; ) {
                 if (m >>>= T = j >>> 24, k -= T, !(16 & (T = j >>> 16 & 255))) {
                   if (!(64 & T)) {
@@ -1784,27 +1784,27 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     break t;
                   }
                   if (S = a, (_ = 0) === d) {
-                    if (_ += p - T, T < $) {
-                      for ($ -= T; R[v++] = a[_++], --T; ) ;
+                    if (_ += p - T, T < q) {
+                      for (q -= T; R[v++] = a[_++], --T; ) ;
                       _ = v - Q, S = R;
                     }
                   } else if (d < T) {
-                    if (_ += p + d - T, (T -= d) < $) {
-                      for ($ -= T; R[v++] = a[_++], --T; ) ;
-                      if (_ = 0, d < $) {
-                        for ($ -= T = d; R[v++] = a[_++], --T; ) ;
+                    if (_ += p + d - T, (T -= d) < q) {
+                      for (q -= T; R[v++] = a[_++], --T; ) ;
+                      if (_ = 0, d < q) {
+                        for (q -= T = d; R[v++] = a[_++], --T; ) ;
                         _ = v - Q, S = R;
                       }
                     }
-                  } else if (_ += d - T, T < $) {
-                    for ($ -= T; R[v++] = a[_++], --T; ) ;
+                  } else if (_ += d - T, T < q) {
+                    for (q -= T; R[v++] = a[_++], --T; ) ;
                     _ = v - Q, S = R;
                   }
-                  for (; 2 < $; ) R[v++] = S[_++], R[v++] = S[_++], R[v++] = S[_++], $ -= 3;
-                  $ && (R[v++] = S[_++], 1 < $ && (R[v++] = S[_++]));
+                  for (; 2 < q; ) R[v++] = S[_++], R[v++] = S[_++], R[v++] = S[_++], q -= 3;
+                  q && (R[v++] = S[_++], 1 < q && (R[v++] = S[_++]));
                 } else {
-                  for (_ = v - Q; R[v++] = R[_++], R[v++] = R[_++], R[v++] = R[_++], 2 < ($ -= 3); ) ;
-                  $ && (R[v++] = R[_++], 1 < $ && (R[v++] = R[_++]));
+                  for (_ = v - Q; R[v++] = R[_++], R[v++] = R[_++], R[v++] = R[_++], 2 < (q -= 3); ) ;
+                  q && (R[v++] = R[_++], 1 < q && (R[v++] = R[_++]));
                 }
                 break;
               }
@@ -1812,7 +1812,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             break;
           }
         } while (c < y && v < b);
-        c -= $ = k >> 3, m &= (1 << (k -= $ << 3)) - 1, l.next_in = c, l.next_out = v, l.avail_in = c < y ? y - c + 5 : 5 - (c - y), l.avail_out = v < b ? b - v + 257 : 257 - (v - b), s.hold = m, s.bits = k;
+        c -= q = k >> 3, m &= (1 << (k -= q << 3)) - 1, l.next_in = c, l.next_out = v, l.avail_in = c < y ? y - c + 5 : 5 - (c - y), l.avail_out = v < b ? b - v + 257 : 257 - (v - b), s.hold = m, s.bits = k;
       };
     }, {}], 49: [function(n, I, h) {
       var l = n("../utils/common"), f = n("./adler32"), s = n("./crc32"), c = n("./inffast"), y = n("./inftrees"), v = 1, w = 2, b = 0, o = -2, p = 1, i = 852, d = 592;
@@ -1839,7 +1839,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return _ ? (R = new m(), (_.state = R).window = null, (r = C(_, S)) !== b && (_.state = null), r) : o;
       }
       var P, j, T = !0;
-      function $(_) {
+      function q(_) {
         if (T) {
           var S;
           for (P = new l.Buf32(512), j = new l.Buf32(32), S = 0; S < 144; ) _.lens[S++] = 8;
@@ -1981,7 +1981,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 r.mode = 14;
                 break;
               case 1:
-                if ($(r), r.mode = 20, S !== 6) break;
+                if (q(r), r.mode = 20, S !== 6) break;
                 O >>>= 2, A -= 2;
                 break t;
               case 2:
@@ -2227,7 +2227,7 @@ 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, $, Q = a.bits, _ = 0, S = 0, r = 0, R = 0, V = 0, F = 0, Y = 0, L = 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, q, Q = a.bits, _ = 0, S = 0, r = 0, R = 0, V = 0, F = 0, Y = 0, L = 0, J = 0, O = 0, A = null, X = 0, Z = new l.Buf16(16), M = new l.Buf16(16), it = null, at = 0;
         for (_ = 0; _ <= 15; _++) Z[_] = 0;
         for (S = 0; S < o; S++) Z[w[b + S]]++;
         for (V = Q, R = 15; 1 <= R && Z[R] === 0; R--) ;
@@ -2239,7 +2239,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         for (S = 0; S < o; S++) w[b + S] !== 0 && (d[M[w[b + S]]++] = S);
         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 = S = O = 0, E = -1, C = (J = 1 << (F = V)) - 1, v === 1 && 852 < J || v === 2 && 592 < J) return 1;
         for (; ; ) {
-          for (j = _ - Y, $ = d[S] < P ? (T = 0, d[S]) : d[S] > P ? (T = it[at + d[S]], A[X + d[S]]) : (T = 96, 0), m = 1 << _ - Y, r = k = 1 << F; p[B + (O >> Y) + (k -= m)] = j << 24 | T << 16 | $ | 0, k !== 0; ) ;
+          for (j = _ - Y, q = d[S] < P ? (T = 0, d[S]) : d[S] > P ? (T = it[at + d[S]], A[X + d[S]]) : (T = 96, 0), m = 1 << _ - Y, r = k = 1 << F; p[B + (O >> Y) + (k -= m)] = j << 24 | T << 16 | q | 0, k !== 0; ) ;
           for (m = 1 << _ - 1; O & m; ) m >>= 1;
           if (m !== 0 ? (O &= m - 1, O += m) : O = 0, S++, --Z[_] == 0) {
             if (_ === R) break;
@@ -2260,7 +2260,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function c(u) {
         for (var x = u.length; 0 <= --x; ) u[x] = 0;
       }
-      var y = 0, v = 29, w = 256, b = w + 1 + v, o = 30, p = 19, i = 2 * b + 1, d = 15, a = 16, m = 7, k = 256, E = 16, C = 17, B = 18, P = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], j = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], T = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], $ = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Q = new Array(2 * (b + 2));
+      var y = 0, v = 29, w = 256, b = w + 1 + v, o = 30, p = 19, i = 2 * b + 1, d = 15, a = 16, m = 7, k = 256, E = 16, C = 17, B = 18, P = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], j = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], T = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], q = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Q = new Array(2 * (b + 2));
       c(Q);
       var _ = new Array(2 * o);
       c(_);
@@ -2294,11 +2294,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return D >>> 1;
       }
       function at(u, x, D) {
-        var W, z, q = new Array(d + 1), K = 0;
-        for (W = 1; W <= d; W++) q[W] = K = K + D[W - 1] << 1;
+        var W, z, $ = new Array(d + 1), K = 0;
+        for (W = 1; W <= d; W++) $[W] = K = K + D[W - 1] << 1;
         for (z = 0; z <= x; z++) {
           var G = u[2 * z + 1];
-          G !== 0 && (u[2 * z] = it(q[G]++, G));
+          G !== 0 && (u[2 * z] = it($[G]++, G));
         }
       }
       function rt(u) {
@@ -2312,24 +2312,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         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 lt(u, x, D, W) {
-        var z = 2 * x, q = 2 * D;
-        return u[z] < u[q] || u[z] === u[q] && W[x] <= W[D];
+        var z = 2 * x, $ = 2 * D;
+        return u[z] < u[$] || u[z] === u[$] && W[x] <= W[D];
       }
       function ct(u, x, D) {
         for (var W = u.heap[D], z = D << 1; z <= u.heap_len && (z < u.heap_len && lt(x, u.heap[z + 1], u.heap[z], u.depth) && z++, !lt(x, W, u.heap[z], u.depth)); ) u.heap[D] = u.heap[z], D = z, z <<= 1;
         u.heap[D] = W;
       }
       function ut(u, x, D) {
-        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, x) : (M(u, (q = r[z]) + w + 1, x), (K = P[q]) !== 0 && Z(u, z -= R[q], K), M(u, q = A(--W), D), (K = j[q]) !== 0 && Z(u, W -= L[q], K)), G < u.last_lit; ) ;
+        var W, z, $, 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, x) : (M(u, ($ = r[z]) + w + 1, x), (K = P[$]) !== 0 && Z(u, z -= R[$], K), M(u, $ = A(--W), D), (K = j[$]) !== 0 && Z(u, W -= L[$], K)), G < u.last_lit; ) ;
         M(u, k, x);
       }
       function ft(u, x) {
-        var D, W, z, q = x.dyn_tree, K = x.stat_desc.static_tree, G = x.stat_desc.has_stree, et = x.stat_desc.elems, st = -1;
-        for (u.heap_len = 0, u.heap_max = i, D = 0; D < et; D++) q[2 * D] !== 0 ? (u.heap[++u.heap_len] = st = D, u.depth[D] = 0) : q[2 * D + 1] = 0;
-        for (; u.heap_len < 2; ) q[2 * (z = u.heap[++u.heap_len] = st < 2 ? ++st : 0)] = 1, u.depth[z] = 0, u.opt_len--, G && (u.static_len -= K[2 * z + 1]);
-        for (x.max_code = st, D = u.heap_len >> 1; 1 <= D; D--) ct(u, q, D);
-        for (z = et; D = u.heap[1], u.heap[1] = u.heap[u.heap_len--], ct(u, q, 1), W = u.heap[1], u.heap[--u.heap_max] = D, u.heap[--u.heap_max] = W, q[2 * z] = q[2 * D] + q[2 * W], u.depth[z] = (u.depth[D] >= u.depth[W] ? u.depth[D] : u.depth[W]) + 1, q[2 * D + 1] = q[2 * W + 1] = z, u.heap[1] = z++, ct(u, q, 1), 2 <= u.heap_len; ) ;
+        var D, W, z, $ = x.dyn_tree, K = x.stat_desc.static_tree, G = x.stat_desc.has_stree, et = x.stat_desc.elems, st = -1;
+        for (u.heap_len = 0, u.heap_max = i, D = 0; D < et; D++) $[2 * D] !== 0 ? (u.heap[++u.heap_len] = st = D, u.depth[D] = 0) : $[2 * D + 1] = 0;
+        for (; u.heap_len < 2; ) $[2 * (z = u.heap[++u.heap_len] = st < 2 ? ++st : 0)] = 1, u.depth[z] = 0, u.opt_len--, G && (u.static_len -= K[2 * z + 1]);
+        for (x.max_code = st, D = u.heap_len >> 1; 1 <= D; D--) ct(u, $, D);
+        for (z = et; D = u.heap[1], u.heap[1] = u.heap[u.heap_len--], ct(u, $, 1), W = u.heap[1], u.heap[--u.heap_max] = D, u.heap[--u.heap_max] = W, $[2 * z] = $[2 * D] + $[2 * W], u.depth[z] = (u.depth[D] >= u.depth[W] ? u.depth[D] : u.depth[W]) + 1, $[2 * D + 1] = $[2 * W + 1] = z, u.heap[1] = z++, ct(u, $, 1), 2 <= u.heap_len; ) ;
         u.heap[--u.heap_max] = u.heap[1], function(ot, mt) {
           var xt, wt, St, dt, Ct, zt, yt = mt.dyn_tree, Rt = mt.max_code, Ot = mt.stat_desc.static_tree, Nt = mt.stat_desc.has_stree, Bt = mt.stat_desc.extra_bits, kt = mt.stat_desc.extra_base, Et = mt.stat_desc.max_length, Tt = 0;
           for (dt = 0; dt <= d; dt++) ot.bl_count[dt] = 0;
@@ -2341,33 +2341,33 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             } while (0 < Tt);
             for (dt = Et; dt !== 0; dt--) for (wt = ot.bl_count[dt]; wt !== 0; ) Rt < (St = ot.heap[--xt]) || (yt[2 * St + 1] !== dt && (ot.opt_len += (dt - yt[2 * St + 1]) * yt[2 * St], yt[2 * St + 1] = dt), wt--);
           }
-        }(u, x), at(q, st, u.bl_count);
+        }(u, x), at($, st, u.bl_count);
       }
       function e(u, x, D) {
-        var W, z, q = -1, K = x[1], G = 0, et = 7, st = 4;
-        for (K === 0 && (et = 138, st = 3), x[2 * (D + 1) + 1] = 65535, W = 0; W <= D; W++) z = K, K = x[2 * (W + 1) + 1], ++G < et && z === K || (G < st ? 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, st = (G = 0) === K ? (et = 138, 3) : z === K ? (et = 6, 3) : (et = 7, 4));
+        var W, z, $ = -1, K = x[1], G = 0, et = 7, st = 4;
+        for (K === 0 && (et = 138, st = 3), x[2 * (D + 1) + 1] = 65535, W = 0; W <= D; W++) z = K, K = x[2 * (W + 1) + 1], ++G < et && z === K || (G < st ? u.bl_tree[2 * z] += G : z !== 0 ? (z !== $ && u.bl_tree[2 * z]++, u.bl_tree[2 * E]++) : G <= 10 ? u.bl_tree[2 * C]++ : u.bl_tree[2 * B]++, $ = z, st = (G = 0) === K ? (et = 138, 3) : z === K ? (et = 6, 3) : (et = 7, 4));
       }
       function U(u, x, D) {
-        var W, z, q = -1, K = x[1], G = 0, et = 7, st = 4;
+        var W, z, $ = -1, K = x[1], G = 0, et = 7, st = 4;
         for (K === 0 && (et = 138, st = 3), W = 0; W <= D; W++) if (z = K, K = x[2 * (W + 1) + 1], !(++G < et && z === K)) {
           if (G < st) 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, st = (G = 0) === K ? (et = 138, 3) : z === K ? (et = 6, 3) : (et = 7, 4);
+          else z !== 0 ? (z !== $ && (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));
+          $ = z, st = (G = 0) === K ? (et = 138, 3) : z === K ? (et = 6, 3) : (et = 7, 4);
         }
       }
       c(L);
       var N = !1;
       function g(u, x, D, 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;
+        Z(u, (y << 1) + (W ? 1 : 0), 3), function(z, $, K, G) {
+          tt(z), X(z, K), X(z, ~K), l.arraySet(z.pending_buf, z.window, $, K, z.pending), z.pending += K;
         }(u, x, D);
       }
       h._tr_init = function(u) {
         N || (function() {
-          var x, D, W, z, q, K = new Array(d + 1);
+          var x, D, W, z, $, K = new Array(d + 1);
           for (z = W = 0; z < v - 1; z++) for (R[z] = W, x = 0; x < 1 << P[z]; x++) r[W++] = z;
-          for (r[W - 1] = z, z = q = 0; z < 16; z++) for (L[z] = q, x = 0; x < 1 << j[z]; x++) S[q++] = z;
-          for (q >>= 7; z < o; z++) for (L[z] = q << 7, x = 0; x < 1 << j[z] - 7; x++) S[256 + q++] = z;
+          for (r[W - 1] = z, z = $ = 0; z < 16; z++) for (L[z] = $, x = 0; x < 1 << j[z]; x++) S[$++] = z;
+          for ($ >>= 7; z < o; z++) for (L[z] = $ << 7, x = 0; x < 1 << j[z] - 7; x++) S[256 + $++] = z;
           for (D = 0; D <= d; D++) K[D] = 0;
           for (x = 0; x <= 143; ) Q[2 * x + 1] = 8, x++, K[8]++;
           for (; x <= 255; ) Q[2 * x + 1] = 9, x++, K[9]++;
@@ -2377,7 +2377,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           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, rt(u);
       }, h._tr_stored_block = g, h._tr_flush_block = function(u, x, D, W) {
-        var z, q, K = 0;
+        var z, $, K = 0;
         0 < u.level ? (u.strm.data_type === 2 && (u.strm.data_type = function(G) {
           var et, st = 4093624447;
           for (et = 0; et <= 31; et++, st >>>= 1) if (1 & st && G.dyn_ltree[2 * et] !== 0) return f;
@@ -2386,11 +2386,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           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 * $[et] + 1] === 0; 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 * q[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 = D + 5, D + 4 <= z && x !== -1 ? g(u, x, D, 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, st, ot) {
+        }(u), z = u.opt_len + 3 + 7 >>> 3, ($ = u.static_len + 3 + 7 >>> 3) <= z && (z = $)) : z = $ = D + 5, D + 4 <= z && x !== -1 ? g(u, x, D, W) : u.strategy === 4 || $ === z ? (Z(u, 2 + (W ? 1 : 0), 3), ut(u, Q, _)) : (Z(u, 4 + (W ? 1 : 0), 3), function(G, et, st, ot) {
           var mt;
-          for (Z(G, et - 257, 5), Z(G, st - 1, 5), Z(G, ot - 4, 4), mt = 0; mt < ot; mt++) Z(G, G.bl_tree[2 * $[mt] + 1], 3);
+          for (Z(G, et - 257, 5), Z(G, st - 1, 5), Z(G, ot - 4, 4), mt = 0; mt < ot; mt++) Z(G, G.bl_tree[2 * q[mt] + 1], 3);
           U(G, G.dyn_ltree, et - 1), U(G, G.dyn_dtree, st - 1);
         }(u, u.l_desc.max_code + 1, u.d_desc.max_code + 1, K + 1), ut(u, u.dyn_ltree, u.dyn_dtree)), rt(u), W && tt(u);
       }, h._tr_tally = function(u, x, D) {
@@ -2567,7 +2567,7 @@ function ge() {
           const O = b.current.file(J);
           if (O) {
             const A = await O.async("text");
-            w += $(A) + `
+            w += q(A) + `
 `, F.add(J);
           }
         }
@@ -2628,7 +2628,7 @@ function ge() {
   async function C(_, S, r, R, V) {
     let F = [..._.matchAll(/<style[^>]*>([\s\S]*?)<\/style>/gi)].map((L) => L[1]).join(`
 `);
-    F = $(F), w += F;
+    F = q(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, S, r, R, V), Y;
   }
@@ -2689,7 +2689,7 @@ function ge() {
     }
     _.setAttribute(S, p[r]);
   }
-  function $(_) {
+  function q(_) {
     const S = ["background-color", "color", "font-size", "font-family", "font-weight", "line-height", "text-align", "margin", "padding"];
     let r = _.replace(/\/\*[\s\S]*?\*\//g, "");
     r = r.replace(/(^|[^.#\w-])(html|body)(?![\w-])/gi, "butt-sex-masterr");
@@ -2878,7 +2878,7 @@ function Zt(H) {
     return Math.floor(I / n);
   } else throw Error;
 }
-const ke = (H) => 1 + 2.1 * Math.pow(H - 1, 3) + 1.1 * Math.pow(H - 1, 2), xe = qt((H, t) => {
+const ke = (H) => 1 + 2.1 * Math.pow(H - 1, 3) + 1.1 * Math.pow(H - 1, 2), xe = $t((H, t) => {
   const n = It.c(62), {
     content: I,
     title: h,
@@ -2891,7 +2891,7 @@ const ke = (H) => 1 + 2.1 * Math.pow(H - 1, 3) + 1.1 * Math.pow(H - 1, 2), xe =
     showTutorial: w,
     onPageChange: b,
     onPageCountChange: o
-  } = H, p = At(null), [i, d, a] = ee(v), [m, k] = ve(p), [E, C] = gt(1), [B, P] = gt(0), [j, T] = Pt(`bok_progress_${h}`, 0), $ = At(m), Q = At(null);
+  } = H, p = At(null), [i, d, a] = ee(v), [m, k] = ve(p), [E, C] = gt(1), [B, P] = gt(0), [j, T] = Pt(`bok_progress_${h}`, 0), q = At(m), Q = At(null);
   let _, S;
   n[0] !== o || n[1] !== B ? (_ = () => {
     o && o(B);
@@ -2902,7 +2902,7 @@ const ke = (H) => 1 + 2.1 * Math.pow(H - 1, 3) + 1.1 * Math.pow(H - 1, 2), xe =
   }, R = [E, b], n[4] = E, n[5] = b, n[6] = r, n[7] = R) : (r = n[6], R = n[7]), _t(r, R);
   let V, F;
   n[8] !== m ? (V = () => {
-    $.current = m;
+    q.current = m;
   }, F = [m], n[8] = m, n[9] = V, n[10] = F) : (V = n[9], F = n[10]), _t(V, F);
   let Y, L;
   n[11] !== m || n[12] !== T ? (Y = () => {
@@ -2918,8 +2918,8 @@ const ke = (H) => 1 + 2.1 * Math.pow(H - 1, 3) + 1.1 * Math.pow(H - 1, 2), xe =
     if (!x)
       return;
     Q.current && cancelAnimationFrame(Q.current);
-    const D = x.scrollLeft, W = u * i * a, z = W - D, q = performance.now(), K = (G) => {
-      const et = G - q;
+    const D = x.scrollLeft, W = u * i * a, z = W - D, $ = performance.now(), K = (G) => {
+      const et = G - $;
       if (et < 450) {
         const st = ke(et / 450);
         x.scrollLeft = D + z * st, Q.current = requestAnimationFrame(K);
@@ -2963,9 +2963,9 @@ const ke = (H) => 1 + 2.1 * Math.pow(H - 1, 3) + 1.1 * Math.pow(H - 1, 2), xe =
     if (!u)
       return;
     const x = (D) => {
-      var q;
+      var $;
       const z = D.target.closest("a");
-      if (z && ((q = z.getAttribute("href")) != null && q.startsWith("#"))) {
+      if (z && (($ = z.getAttribute("href")) != null && $.startsWith("#"))) {
         D.preventDefault();
         const K = z.getAttribute("href"), G = decodeURIComponent(K.substring(1)), et = document.getElementById(G);
         if (et)
@@ -2991,8 +2991,8 @@ const ke = (H) => 1 + 2.1 * Math.pow(H - 1, 3) + 1.1 * Math.pow(H - 1, 2), xe =
           return;
         const D = u.scrollWidth, W = i > 0 && D > 0 ? Math.round(D / i) : 0, z = a === 1 ? W : Math.round(W / 2);
         if (P(z), z > 0 && u.clientWidth > 0) {
-          const q = $.current;
-          let K = Math.round(z * q);
+          const $ = q.current;
+          let K = Math.round(z * $);
           K = Math.max(0, Math.min(z - 1, K)), C(K), u.scrollLeft = K * i * a;
         } else
           C(1);
@@ -3095,16 +3095,16 @@ function Ne(H) {
   let j;
   t[5] !== p ? (j = [P, ...p], t[5] = p, t[6] = j) : j = t[6];
   const T = j;
-  let $, Q;
-  t[7] === Symbol.for("react.memo_cache_sentinel") ? ($ = {
+  let q, Q;
+  t[7] === Symbol.for("react.memo_cache_sentinel") ? (q = {
     displayName: "Amoled Dark",
     name: "amoled"
   }, Q = {
     displayName: "Da Vinci",
     name: "davinci"
-  }, t[7] = $, t[8] = Q) : ($ = t[7], Q = t[8]);
+  }, t[7] = q, t[8] = Q) : (q = t[7], Q = t[8]);
   let _;
-  t[9] !== d ? (_ = [$, Q, ...d], t[9] = d, t[10] = _) : _ = t[10];
+  t[9] !== d ? (_ = [q, Q, ...d], t[9] = d, t[10] = _) : _ = t[10];
   const S = _;
   let r, R;
   t[11] === Symbol.for("react.memo_cache_sentinel") ? (r = () => {
@@ -3178,18 +3178,18 @@ function Ne(H) {
   ] }), t[43] = l, t[44] = x, t[45] = D, t[46] = W) : W = t[46];
   let z;
   t[47] === Symbol.for("react.memo_cache_sentinel") ? (z = /* @__PURE__ */ nt("div", { className: ht["option-label"], children: "Color Scheme" }), t[47] = z) : z = t[47];
-  let q;
-  t[48] !== S || t[49] !== y ? (q = (kt) => {
+  let $;
+  t[48] !== S || t[49] !== y ? ($ = (kt) => {
     const Et = S.find((Tt) => Tt.name === kt.target.value);
     Et && y(Et.name);
-  }, t[48] = S, t[49] = y, t[50] = q) : q = t[50];
+  }, t[48] = S, t[49] = y, t[50] = $) : $ = t[50];
   let K;
   t[51] !== S ? (K = S.map(Te), t[51] = S, t[52] = K) : K = t[52];
   let G;
-  t[53] !== f || t[54] !== q || t[55] !== K ? (G = /* @__PURE__ */ pt("div", { className: ht["option-row"], children: [
+  t[53] !== f || t[54] !== $ || t[55] !== K ? (G = /* @__PURE__ */ pt("div", { className: ht["option-row"], children: [
     z,
-    /* @__PURE__ */ nt("select", { className: ht.select, value: f, onChange: q, children: K })
-  ] }), t[53] = f, t[54] = q, t[55] = K, t[56] = G) : G = t[56];
+    /* @__PURE__ */ nt("select", { className: ht.select, value: f, onChange: $, children: K })
+  ] }), t[53] = f, t[54] = $, t[55] = K, t[56] = G) : G = t[56];
   let et;
   t[57] === Symbol.for("react.memo_cache_sentinel") ? (et = /* @__PURE__ */ nt("div", { className: ht["option-label"], children: "Side padding" }), t[57] = et) : et = t[57];
   let st;
@@ -3272,24 +3272,24 @@ function Le(H) {
 function Ue(H) {
   H.stopPropagation();
 }
-const je = "_visible_dyqk_66", vt = {
-  "nav-menu-overlay": "_nav-menu-overlay_dyqk_1",
-  "fade-out": "_fade-out_dyqk_25",
-  "nav-menu": "_nav-menu_dyqk_1",
+const je = "_visible_1oftk_66", vt = {
+  "nav-menu-overlay": "_nav-menu-overlay_1oftk_1",
+  "fade-out": "_fade-out_1oftk_25",
+  "nav-menu": "_nav-menu_1oftk_1",
   visible: je,
-  "slide-down": "_slide-down_dyqk_72",
-  "nav-header": "_nav-header_dyqk_81",
-  "close-btn": "_close-btn_dyqk_96",
-  "toc-container": "_toc-container_dyqk_108",
-  "toc-list": "_toc-list_dyqk_116",
-  "toc-item": "_toc-item_dyqk_122",
-  "toc-page-num": "_toc-page-num_dyqk_142",
-  "toc-sublist": "_toc-sublist_dyqk_149",
-  "page-jumper": "_page-jumper_dyqk_159",
-  "jumper-controls": "_jumper-controls_dyqk_168",
-  "jumper-input": "_jumper-input_dyqk_175",
-  "total-pages": "_total-pages_dyqk_193",
-  "go-btn": "_go-btn_dyqk_199"
+  "slide-down": "_slide-down_1oftk_72",
+  "nav-header": "_nav-header_1oftk_81",
+  "close-btn": "_close-btn_1oftk_96",
+  "toc-container": "_toc-container_1oftk_108",
+  "toc-list": "_toc-list_1oftk_116",
+  "toc-item": "_toc-item_1oftk_122",
+  "toc-page-num": "_toc-page-num_1oftk_142",
+  "toc-sublist": "_toc-sublist_1oftk_149",
+  "page-jumper": "_page-jumper_1oftk_159",
+  "jumper-controls": "_jumper-controls_1oftk_168",
+  "jumper-input": "_jumper-input_1oftk_175",
+  "total-pages": "_total-pages_1oftk_198",
+  "go-btn": "_go-btn_1oftk_204"
 }, We = (H) => {
   const t = It.c(61), {
     toc: n,
@@ -3345,7 +3345,7 @@ const je = "_visible_dyqk_66", vt = {
     const tt = Math.max(1, Math.min(h, b));
     f(tt - 1);
   }, t[11] = b, t[12] = f, t[13] = h, t[14] = T) : T = t[14];
-  const $ = T;
+  const q = T;
   let Q;
   t[15] !== j || t[16] !== s ? (Q = (tt) => {
     s(tt), j();
@@ -3387,16 +3387,16 @@ const je = "_visible_dyqk_66", vt = {
   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] !== $ ? (A = (tt) => tt.key === "Enter" && $(), t[38] = $, t[39] = A) : A = t[39];
+  t[38] !== q ? (A = (tt) => tt.key === "Enter" && q(), t[38] = q, t[39] = A) : A = t[39];
   let X;
-  t[40] !== b || t[41] !== A ? (X = /* @__PURE__ */ nt("input", { className: vt["jumper-input"], type: "number", value: b, onChange: O, onKeyDown: A }), t[40] = b, t[41] = A, t[42] = X) : X = t[42];
+  t[40] !== b || t[41] !== A ? (X = /* @__PURE__ */ nt("input", { className: vt["jumper-input"], type: "number", value: b, onChange: O, onKeyDown: A, onClick: Ze }), t[40] = b, t[41] = A, t[42] = X) : X = t[42];
   let Z;
   t[43] !== h ? (Z = /* @__PURE__ */ pt("span", { className: vt["total-pages"], children: [
     "of ",
     h
   ] }), t[43] = h, t[44] = Z) : Z = t[44];
   let M;
-  t[45] !== $ ? (M = /* @__PURE__ */ nt("button", { className: vt["go-btn"], onClick: $, children: "Go" }), t[45] = $, t[46] = M) : M = t[46];
+  t[45] !== q ? (M = /* @__PURE__ */ nt("button", { className: vt["go-btn"], onClick: q, children: "Go" }), t[45] = q, t[46] = M) : M = t[46];
   let it;
   t[47] !== X || t[48] !== Z || t[49] !== M ? (it = /* @__PURE__ */ nt("div", { className: vt["page-jumper"], children: /* @__PURE__ */ pt("div", { className: vt["jumper-controls"], children: [
     X,
@@ -3415,18 +3415,21 @@ const je = "_visible_dyqk_66", vt = {
 function Me(H) {
   return H.stopPropagation();
 }
-const Ze = "_overlay_18kzg_53", qe = "_fadeOut_18kzg_80", $e = "_interactionZone_18kzg_86", He = "_centerZone_18kzg_96", Ge = "_iconWrapper_18kzg_107", Ye = "_label_18kzg_131", Ke = "_bottomIconGroup_18kzg_143", Ve = "_bottomIconWrapper_18kzg_150", Xe = "_bounceArrow_18kzg_173", Je = "_dismissButton_18kzg_183", bt = {
-  overlay: Ze,
-  fadeOut: qe,
-  interactionZone: $e,
-  centerZone: He,
-  iconWrapper: Ge,
-  label: Ye,
-  bottomIconGroup: Ke,
-  bottomIconWrapper: Ve,
-  bounceArrow: Xe,
-  dismissButton: Je
-}, Qe = (H) => {
+function Ze(H) {
+  return H.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", bt = {
+  overlay: $e,
+  fadeOut: He,
+  interactionZone: qe,
+  centerZone: Ge,
+  iconWrapper: Ye,
+  label: Ke,
+  bottomIconGroup: Ve,
+  bottomIconWrapper: Xe,
+  bounceArrow: Je,
+  dismissButton: Qe
+}, tr = (H) => {
   const t = It.c(29), {
     color: n,
     onDismiss: I
@@ -3498,7 +3501,7 @@ const Ze = "_overlay_18kzg_53", qe = "_fadeOut_18kzg_80", $e = "_interactionZone
     o,
     P
   ] }), t[24] = c, t[25] = P, t[26] = y, t[27] = w, t[28] = j) : j = t[28], j;
-}, nr = (H) => {
+}, ir = (H) => {
   const t = It.c(72), {
     epubDataSource: n,
     onTitleChange: I,
@@ -3519,7 +3522,7 @@ const Ze = "_overlay_18kzg_53", qe = "_fadeOut_18kzg_80", $e = "_interactionZone
     error: d,
     loadEpub: a,
     setIsLoading: m
-  } = ge(), [k, E] = gt("none"), [C, B] = Pt("bok_global_side_padding", 30), [P, j] = Pt("bok_global_fontsize", 1.2), [T, $] = Pt("bok_global_font_family", "Inter"), [Q, _] = Pt("bok_global_theme", "Amoled Dark"), S = At(null), r = At(null), [R, V] = gt(0), [F, Y] = gt(0), [L, J] = Pt("bok_tutorial_shown", !1), [O, A] = gt(!L);
+  } = ge(), [k, E] = gt("none"), [C, B] = Pt("bok_global_side_padding", 30), [P, j] = Pt("bok_global_fontsize", 1.2), [T, q] = Pt("bok_global_font_family", "Inter"), [Q, _] = Pt("bok_global_theme", "Amoled Dark"), S = At(null), r = At(null), [R, V] = gt(0), [F, Y] = gt(0), [L, J] = Pt("bok_tutorial_shown", !1), [O, A] = gt(!L);
   let X, Z;
   t[2] !== L ? (X = () => {
     L && A(!1);
@@ -3580,11 +3583,11 @@ const Ze = "_overlay_18kzg_53", qe = "_fadeOut_18kzg_80", $e = "_interactionZone
   const W = D;
   let z;
   t[38] !== c || t[39] !== i ? (z = /* @__PURE__ */ nt(Ee, { isLoading: i, color: c }), t[38] = c, t[39] = i, t[40] = z) : z = t[40];
-  let q;
-  t[41] !== k || t[42] !== c || t[43] !== Q || t[44] !== R || t[45] !== it || t[46] !== T || t[47] !== P || t[48] !== i || t[49] !== o || t[50] !== _ || t[51] !== $ || t[52] !== j || t[53] !== m || t[54] !== B || t[55] !== O || t[56] !== C || t[57] !== w || t[58] !== b || t[59] !== p || t[60] !== F ? (q = o && /* @__PURE__ */ pt(Kt, { children: [
-    O && !i && /* @__PURE__ */ nt(Qe, { color: c, onDismiss: it }),
+  let $;
+  t[41] !== k || t[42] !== c || t[43] !== Q || t[44] !== R || t[45] !== it || t[46] !== T || t[47] !== P || t[48] !== i || t[49] !== o || t[50] !== _ || t[51] !== q || t[52] !== j || t[53] !== m || t[54] !== B || t[55] !== O || t[56] !== C || t[57] !== w || t[58] !== b || t[59] !== p || t[60] !== F ? ($ = o && /* @__PURE__ */ pt(Kt, { children: [
+    O && !i && /* @__PURE__ */ nt(tr, { color: c, onDismiss: it }),
     /* @__PURE__ */ nt(xe, { ref: r, content: o, title: b, setIsLoading: m, fontSize: P, sidePadding: C, fontFamily: T, isOptionMenuVisible: k !== "none", containerElementRef: S, showTutorial: O, onPageChange: V, onPageCountChange: Y }),
-    k === "options" && /* @__PURE__ */ nt(Ne, { onClose: () => E("none"), fontSize: P, padding: C, fontFamily: T, colorScheme: Q, setPadding: B, setFontSize: j, setFontFamily: $, setColorScheme: _, supportedFonts: w, supportedColorschemes: [] }),
+    k === "options" && /* @__PURE__ */ nt(Ne, { onClose: () => E("none"), fontSize: P, padding: C, fontFamily: T, colorScheme: Q, setPadding: B, setFontSize: j, setFontFamily: q, setColorScheme: _, supportedFonts: w, supportedColorschemes: [] }),
     k === "navigation" && !i && /* @__PURE__ */ nt(We, { toc: p, currentPage: R, totalPages: F, onClose: () => E("none"), onGoToPage: (et) => {
       var st;
       return (st = r.current) == null ? void 0 : st.goToPage(et);
@@ -3593,27 +3596,27 @@ const Ze = "_overlay_18kzg_53", qe = "_fadeOut_18kzg_80", $e = "_interactionZone
       return (st = r.current) == null ? void 0 : st.findAndJumpToHref(et);
     } }),
     k === "none" && !O && !i && /* @__PURE__ */ pt("div", { className: "bottom-interaction-layer", children: [
-      /* @__PURE__ */ nt("div", { className: "trigger-zone", onClick: tr }),
+      /* @__PURE__ */ nt("div", { className: "trigger-zone", onClick: er }),
       /* @__PURE__ */ nt("div", { className: "trigger-zone", onClick: () => E("navigation"), "aria-label": "Open Navigation" }),
       /* @__PURE__ */ nt("div", { className: "trigger-zone", onClick: () => E("options"), "aria-label": "Open Settings" }),
       /* @__PURE__ */ nt("div", { className: "settings-icon", onClick: () => E("options"), "aria-label": "Open Settings", children: /* @__PURE__ */ nt(Qt, { size: 16 }) })
     ] })
-  ] }), t[41] = k, t[42] = c, t[43] = Q, t[44] = R, t[45] = it, t[46] = T, t[47] = P, t[48] = i, t[49] = o, t[50] = _, t[51] = $, t[52] = j, t[53] = m, t[54] = B, t[55] = O, t[56] = C, t[57] = w, t[58] = b, t[59] = p, t[60] = F, t[61] = q) : q = t[61];
+  ] }), t[41] = k, t[42] = c, t[43] = Q, t[44] = R, t[45] = it, t[46] = T, t[47] = P, t[48] = i, t[49] = o, t[50] = _, t[51] = q, t[52] = j, t[53] = m, t[54] = B, t[55] = O, t[56] = C, t[57] = w, t[58] = b, t[59] = p, t[60] = F, t[61] = $) : $ = t[61];
   let K;
   t[62] !== n || t[63] !== d || t[64] !== i ? (K = !n && !i && !d && /* @__PURE__ */ nt("div", { style: {
     padding: "20px",
     textAlign: "center"
   }, children: "No EPUB loaded." }), t[62] = n, t[63] = d, t[64] = i, t[65] = K) : K = t[65];
   let G;
-  return t[66] !== x || t[67] !== W || t[68] !== z || t[69] !== q || t[70] !== K ? (G = /* @__PURE__ */ pt("div", { className: x, style: W, ref: S, children: [
+  return t[66] !== x || t[67] !== W || t[68] !== z || t[69] !== $ || t[70] !== K ? (G = /* @__PURE__ */ pt("div", { className: x, style: W, ref: S, children: [
     z,
-    q,
+    $,
     K
-  ] }), t[66] = x, t[67] = W, t[68] = z, t[69] = q, t[70] = K, t[71] = G) : G = t[71], G;
+  ] }), t[66] = x, t[67] = W, t[68] = z, t[69] = $, t[70] = K, t[71] = G) : G = t[71], G;
 };
-function tr() {
+function er() {
   console.log("Left Click - Reserved");
 }
 export {
-  nr as BokReader
+  ir as BokReader
 };