@wp-playground/cli 1.1.5 → 1.2.0

package/{run-cli-bX1Rsm_j.js → run-cli-CbJy_CRO.js}

@@ -1,10 +1,10 @@
-import { logger as xe, errorLogPath as ns } from "@php-wasm/logger";
+import { logger as me, errorLogPath as ns } from "@php-wasm/logger";
 import { ProgressTracker as rs, EmscriptenDownloadMonitor as is } from "@php-wasm/progress";
 import { SupportedPHPVersions as ss, PHPResponse as os, consumeAPI as Yn, exposeAPI as Zn } from "@php-wasm/universal";
 import { resolveRemoteBlueprint as as, isBlueprintBundle as cs, compileBlueprint as ls, runBlueprintSteps as fs } from "@wp-playground/blueprints";
 import { RecommendedPHPVersion as Qr, zipDirectory as Vn, unzipFile as us } from "@wp-playground/common";
 import ye, { existsSync as ei } from "fs";
-import Je, { basename as kt, join as Pn } from "path";
+import Je, { basename as Et, join as Pn } from "path";
 import { Worker as ds } from "worker_threads";
 import { resolveWordPressRelease as ps } from "@wp-playground/wordpress";
 import mt from "fs-extra";
@@ -16,13 +16,13 @@ import { Semaphore as Dn } from "@php-wasm/util";
 function _s(n) {
   const t = process.cwd(), e = [...n.mount || []], r = [...n.mountBeforeInstall || []];
   if (ri(t)) {
-    const c = kt(t);
+    const c = Et(t);
     e.push({
       hostPath: t,
       vfsPath: `/wordpress/wp-content/plugins/${c}`
     });
   } else if (ni(t)) {
-    const c = kt(t);
+    const c = Et(t);
     e.push({
       hostPath: t,
       vfsPath: `/wordpress/wp-content/themes/${c}`
@@ -84,12 +84,12 @@ function ys(n) {
   return ri(n) ? [
     {
       step: "activatePlugin",
-      pluginPath: `/wordpress/wp-content/plugins/${kt(n)}`
+      pluginPath: `/wordpress/wp-content/plugins/${Et(n)}`
     }
   ] : ni(n) ? [
     {
       step: "activateTheme",
-      themeFolderName: kt(n)
+      themeFolderName: Et(n)
     }
   ] : ti(n) || vn(n) ? [
     {
@@ -108,7 +108,7 @@ function ys(n) {
     }
   ] : [];
 }
-const En = Je.join(ms.homedir(), ".wordpress-playground");
+const kn = Je.join(ms.homedir(), ".wordpress-playground");
 async function bs(n) {
   return await ii(
     "https://github.com/WordPress/sqlite-database-integration/archive/refs/heads/develop.zip",
@@ -117,8 +117,8 @@ async function bs(n) {
   );
 }
 async function ii(n, t, e) {
-  const r = Je.join(En, t);
-  return mt.existsSync(r) || (mt.ensureDirSync(En), await vs(n, r, e)), si(r);
+  const r = Je.join(kn, t);
+  return mt.existsSync(r) || (mt.ensureDirSync(kn), await vs(n, r, e)), si(r);
 }
 async function vs(n, t, e) {
   const s = (await e.monitorFetch(fetch(n))).body.getReader(), a = `${t}.partial`, c = mt.createWriteStream(a);
@@ -136,9 +136,9 @@ async function vs(n, t, e) {
   });
 }
 function si(n, t) {
-  return new File([mt.readFileSync(n)], kt(n));
+  return new File([mt.readFileSync(n)], Et(n));
 }
-async function Es(n) {
+async function ks(n) {
   const t = xs(), e = await new Promise((a, c) => {
     const l = t.listen(n.port, () => {
       const f = l.address();
@@ -150,7 +150,7 @@ async function Es(n) {
       url: a.url,
       headers: Ss(a),
       method: a.method,
-      body: await ks(a)
+      body: await Es(a)
     });
     c.statusCode = l.httpStatusCode;
     for (const f in l.headers)
@@ -160,7 +160,7 @@ async function Es(n) {
   const s = e.address().port;
   return await n.onBind(e, s);
 }
-const ks = async (n) => await new Promise((t) => {
+const Es = async (n) => await new Promise((t) => {
   const e = [];
   n.on("data", (r) => {
     e.push(r);
@@ -248,7 +248,7 @@ class oi extends Error {
       if (a instanceof Error) {
         if (a.isReportableInCLI)
           return a;
-        Array.isArray(a.cause) ? s.push(...a.cause) : s.push(a.cause), e++, e >= r && xe.warn(
+        Array.isArray(a.cause) ? s.push(...a.cause) : s.push(a.cause), e++, e >= r && me.warn(
           "Recursion limit exceeded while checking if error is reportable"
         );
       }
@@ -287,36 +287,36 @@ var Is = {};
   })(function(t) {
     t.version = "1.2.2";
     function e() {
-      for (var b = 0, C = new Array(256), v = 0; v != 256; ++v)
-        b = v, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, b = b & 1 ? -306674912 ^ b >>> 1 : b >>> 1, C[v] = b;
-      return typeof Int32Array < "u" ? new Int32Array(C) : C;
+      for (var y = 0, D = new Array(256), b = 0; b != 256; ++b)
+        y = b, y = y & 1 ? -306674912 ^ y >>> 1 : y >>> 1, y = y & 1 ? -306674912 ^ y >>> 1 : y >>> 1, y = y & 1 ? -306674912 ^ y >>> 1 : y >>> 1, y = y & 1 ? -306674912 ^ y >>> 1 : y >>> 1, y = y & 1 ? -306674912 ^ y >>> 1 : y >>> 1, y = y & 1 ? -306674912 ^ y >>> 1 : y >>> 1, y = y & 1 ? -306674912 ^ y >>> 1 : y >>> 1, y = y & 1 ? -306674912 ^ y >>> 1 : y >>> 1, D[b] = y;
+      return typeof Int32Array < "u" ? new Int32Array(D) : D;
     }
     var r = e();
-    function s(b) {
-      var C = 0, v = 0, S = 0, M = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
-      for (S = 0; S != 256; ++S) M[S] = b[S];
-      for (S = 0; S != 256; ++S)
-        for (v = b[S], C = 256 + S; C < 4096; C += 256) v = M[C] = v >>> 8 ^ b[v & 255];
-      var L = [];
-      for (S = 1; S != 16; ++S) L[S - 1] = typeof Int32Array < "u" ? M.subarray(S * 256, S * 256 + 256) : M.slice(S * 256, S * 256 + 256);
-      return L;
+    function s(y) {
+      var D = 0, b = 0, E = 0, M = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
+      for (E = 0; E != 256; ++E) M[E] = y[E];
+      for (E = 0; E != 256; ++E)
+        for (b = y[E], D = 256 + E; D < 4096; D += 256) b = M[D] = b >>> 8 ^ y[b & 255];
+      var O = [];
+      for (E = 1; E != 16; ++E) O[E - 1] = typeof Int32Array < "u" ? M.subarray(E * 256, E * 256 + 256) : M.slice(E * 256, E * 256 + 256);
+      return O;
     }
-    var a = s(r), c = a[0], l = a[1], f = a[2], _ = a[3], x = a[4], w = a[5], g = a[6], k = a[7], P = a[8], m = a[9], d = a[10], h = a[11], y = a[12], T = a[13], D = a[14];
-    function A(b, C) {
-      for (var v = C ^ -1, S = 0, M = b.length; S < M; ) v = v >>> 8 ^ r[(v ^ b.charCodeAt(S++)) & 255];
-      return ~v;
+    var a = s(r), c = a[0], l = a[1], f = a[2], _ = a[3], x = a[4], w = a[5], g = a[6], T = a[7], C = a[8], m = a[9], d = a[10], h = a[11], v = a[12], A = a[13], P = a[14];
+    function S(y, D) {
+      for (var b = D ^ -1, E = 0, M = y.length; E < M; ) b = b >>> 8 ^ r[(b ^ y.charCodeAt(E++)) & 255];
+      return ~b;
     }
-    function R(b, C) {
-      for (var v = C ^ -1, S = b.length - 15, M = 0; M < S; ) v = D[b[M++] ^ v & 255] ^ T[b[M++] ^ v >> 8 & 255] ^ y[b[M++] ^ v >> 16 & 255] ^ h[b[M++] ^ v >>> 24] ^ d[b[M++]] ^ m[b[M++]] ^ P[b[M++]] ^ k[b[M++]] ^ g[b[M++]] ^ w[b[M++]] ^ x[b[M++]] ^ _[b[M++]] ^ f[b[M++]] ^ l[b[M++]] ^ c[b[M++]] ^ r[b[M++]];
-      for (S += 15; M < S; ) v = v >>> 8 ^ r[(v ^ b[M++]) & 255];
-      return ~v;
+    function R(y, D) {
+      for (var b = D ^ -1, E = y.length - 15, M = 0; M < E; ) b = P[y[M++] ^ b & 255] ^ A[y[M++] ^ b >> 8 & 255] ^ v[y[M++] ^ b >> 16 & 255] ^ h[y[M++] ^ b >>> 24] ^ d[y[M++]] ^ m[y[M++]] ^ C[y[M++]] ^ T[y[M++]] ^ g[y[M++]] ^ w[y[M++]] ^ x[y[M++]] ^ _[y[M++]] ^ f[y[M++]] ^ l[y[M++]] ^ c[y[M++]] ^ r[y[M++]];
+      for (E += 15; M < E; ) b = b >>> 8 ^ r[(b ^ y[M++]) & 255];
+      return ~b;
     }
-    function F(b, C) {
-      for (var v = C ^ -1, S = 0, M = b.length, L = 0, Y = 0; S < M; )
-        L = b.charCodeAt(S++), L < 128 ? v = v >>> 8 ^ r[(v ^ L) & 255] : L < 2048 ? (v = v >>> 8 ^ r[(v ^ (192 | L >> 6 & 31)) & 255], v = v >>> 8 ^ r[(v ^ (128 | L & 63)) & 255]) : L >= 55296 && L < 57344 ? (L = (L & 1023) + 64, Y = b.charCodeAt(S++) & 1023, v = v >>> 8 ^ r[(v ^ (240 | L >> 8 & 7)) & 255], v = v >>> 8 ^ r[(v ^ (128 | L >> 2 & 63)) & 255], v = v >>> 8 ^ r[(v ^ (128 | Y >> 6 & 15 | (L & 3) << 4)) & 255], v = v >>> 8 ^ r[(v ^ (128 | Y & 63)) & 255]) : (v = v >>> 8 ^ r[(v ^ (224 | L >> 12 & 15)) & 255], v = v >>> 8 ^ r[(v ^ (128 | L >> 6 & 63)) & 255], v = v >>> 8 ^ r[(v ^ (128 | L & 63)) & 255]);
-      return ~v;
+    function F(y, D) {
+      for (var b = D ^ -1, E = 0, M = y.length, O = 0, $ = 0; E < M; )
+        O = y.charCodeAt(E++), O < 128 ? b = b >>> 8 ^ r[(b ^ O) & 255] : O < 2048 ? (b = b >>> 8 ^ r[(b ^ (192 | O >> 6 & 31)) & 255], b = b >>> 8 ^ r[(b ^ (128 | O & 63)) & 255]) : O >= 55296 && O < 57344 ? (O = (O & 1023) + 64, $ = y.charCodeAt(E++) & 1023, b = b >>> 8 ^ r[(b ^ (240 | O >> 8 & 7)) & 255], b = b >>> 8 ^ r[(b ^ (128 | O >> 2 & 63)) & 255], b = b >>> 8 ^ r[(b ^ (128 | $ >> 6 & 15 | (O & 3) << 4)) & 255], b = b >>> 8 ^ r[(b ^ (128 | $ & 63)) & 255]) : (b = b >>> 8 ^ r[(b ^ (224 | O >> 12 & 15)) & 255], b = b >>> 8 ^ r[(b ^ (128 | O >> 6 & 63)) & 255], b = b >>> 8 ^ r[(b ^ (128 | O & 63)) & 255]);
+      return ~b;
     }
-    t.table = r, t.bstr = A, t.buf = R, t.str = F;
+    t.table = r, t.bstr = S, t.buf = R, t.str = F;
   });
 })(Is);
 var ai = {}, en = {};
@@ -370,8 +370,8 @@ function Ms(n) {
 var Un = {};
 /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
 Un.read = function(n, t, e, r, s) {
-  var a, c, l = s * 8 - r - 1, f = (1 << l) - 1, _ = f >> 1, x = -7, w = e ? s - 1 : 0, g = e ? -1 : 1, k = n[t + w];
-  for (w += g, a = k & (1 << -x) - 1, k >>= -x, x += l; x > 0; a = a * 256 + n[t + w], w += g, x -= 8)
+  var a, c, l = s * 8 - r - 1, f = (1 << l) - 1, _ = f >> 1, x = -7, w = e ? s - 1 : 0, g = e ? -1 : 1, T = n[t + w];
+  for (w += g, a = T & (1 << -x) - 1, T >>= -x, x += l; x > 0; a = a * 256 + n[t + w], w += g, x -= 8)
     ;
   for (c = a & (1 << -x) - 1, a >>= -x, x += r; x > 0; c = c * 256 + n[t + w], w += g, x -= 8)
     ;
@@ -379,18 +379,18 @@ Un.read = function(n, t, e, r, s) {
     a = 1 - _;
   else {
     if (a === f)
-      return c ? NaN : (k ? -1 : 1) * (1 / 0);
+      return c ? NaN : (T ? -1 : 1) * (1 / 0);
     c = c + Math.pow(2, r), a = a - _;
   }
-  return (k ? -1 : 1) * c * Math.pow(2, a - r);
+  return (T ? -1 : 1) * c * Math.pow(2, a - r);
 };
 Un.write = function(n, t, e, r, s, a) {
-  var c, l, f, _ = a * 8 - s - 1, x = (1 << _) - 1, w = x >> 1, g = s === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, k = r ? 0 : a - 1, P = r ? 1 : -1, m = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
-  for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (l = isNaN(t) ? 1 : 0, c = x) : (c = Math.floor(Math.log(t) / Math.LN2), t * (f = Math.pow(2, -c)) < 1 && (c--, f *= 2), c + w >= 1 ? t += g / f : t += g * Math.pow(2, 1 - w), t * f >= 2 && (c++, f /= 2), c + w >= x ? (l = 0, c = x) : c + w >= 1 ? (l = (t * f - 1) * Math.pow(2, s), c = c + w) : (l = t * Math.pow(2, w - 1) * Math.pow(2, s), c = 0)); s >= 8; n[e + k] = l & 255, k += P, l /= 256, s -= 8)
+  var c, l, f, _ = a * 8 - s - 1, x = (1 << _) - 1, w = x >> 1, g = s === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, T = r ? 0 : a - 1, C = r ? 1 : -1, m = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
+  for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (l = isNaN(t) ? 1 : 0, c = x) : (c = Math.floor(Math.log(t) / Math.LN2), t * (f = Math.pow(2, -c)) < 1 && (c--, f *= 2), c + w >= 1 ? t += g / f : t += g * Math.pow(2, 1 - w), t * f >= 2 && (c++, f /= 2), c + w >= x ? (l = 0, c = x) : c + w >= 1 ? (l = (t * f - 1) * Math.pow(2, s), c = c + w) : (l = t * Math.pow(2, w - 1) * Math.pow(2, s), c = 0)); s >= 8; n[e + T] = l & 255, T += C, l /= 256, s -= 8)
     ;
-  for (c = c << s | l, _ += s; _ > 0; n[e + k] = c & 255, k += P, c /= 256, _ -= 8)
+  for (c = c << s | l, _ += s; _ > 0; n[e + T] = c & 255, T += C, c /= 256, _ -= 8)
     ;
-  n[e + k - P] |= m * 128;
+  n[e + T - C] |= m * 128;
 };
 /*!
  * The buffer module from node.js, for the browser.
@@ -400,7 +400,7 @@ Un.write = function(n, t, e, r, s, a) {
  */
 (function(n) {
   var t = en, e = Un, r = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
-  n.Buffer = l, n.SlowBuffer = y, n.INSPECT_MAX_BYTES = 50;
+  n.Buffer = l, n.SlowBuffer = v, n.INSPECT_MAX_BYTES = 50;
   var s = 2147483647;
   n.kMaxLength = s, l.TYPED_ARRAY_SUPPORT = a(), !l.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
     "This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
@@ -449,7 +449,7 @@ Un.write = function(n, t, e, r, s, a) {
     if (typeof u == "string")
       return g(u, i);
     if (ArrayBuffer.isView(u))
-      return P(u);
+      return C(u);
     if (u == null)
       throw new TypeError(
         "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof u
@@ -463,8 +463,8 @@ Un.write = function(n, t, e, r, s, a) {
     var p = u.valueOf && u.valueOf();
     if (p != null && p !== u)
       return l.from(p, i, o);
-    var E = d(u);
-    if (E) return E;
+    var k = d(u);
+    if (k) return k;
     if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof u[Symbol.toPrimitive] == "function")
       return l.from(
         u[Symbol.toPrimitive]("string"),
@@ -501,20 +501,20 @@ Un.write = function(n, t, e, r, s, a) {
   function g(u, i) {
     if ((typeof i != "string" || i === "") && (i = "utf8"), !l.isEncoding(i))
       throw new TypeError("Unknown encoding: " + i);
-    var o = T(u, i) | 0, p = c(o), E = p.write(u, i);
-    return E !== o && (p = p.slice(0, E)), p;
+    var o = A(u, i) | 0, p = c(o), k = p.write(u, i);
+    return k !== o && (p = p.slice(0, k)), p;
   }
-  function k(u) {
+  function T(u) {
     for (var i = u.length < 0 ? 0 : h(u.length) | 0, o = c(i), p = 0; p < i; p += 1)
       o[p] = u[p] & 255;
     return o;
   }
-  function P(u) {
+  function C(u) {
     if (fe(u, Uint8Array)) {
       var i = new Uint8Array(u);
       return m(i.buffer, i.byteOffset, i.byteLength);
     }
-    return k(u);
+    return T(u);
   }
   function m(u, i, o) {
     if (i < 0 || u.byteLength < i)
@@ -530,16 +530,16 @@ Un.write = function(n, t, e, r, s, a) {
       return o.length === 0 || u.copy(o, 0, 0, i), o;
     }
     if (u.length !== void 0)
-      return typeof u.length != "number" || je(u.length) ? c(0) : k(u);
+      return typeof u.length != "number" || je(u.length) ? c(0) : T(u);
     if (u.type === "Buffer" && Array.isArray(u.data))
-      return k(u.data);
+      return T(u.data);
   }
   function h(u) {
     if (u >= s)
       throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + s.toString(16) + " bytes");
     return u | 0;
   }
-  function y(u) {
+  function v(u) {
     return +u != u && (u = 0), l.alloc(+u);
   }
   l.isBuffer = function(i) {
@@ -550,12 +550,12 @@ Un.write = function(n, t, e, r, s, a) {
         'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
       );
     if (i === o) return 0;
-    for (var p = i.length, E = o.length, U = 0, W = Math.min(p, E); U < W; ++U)
-      if (i[U] !== o[U]) {
-        p = i[U], E = o[U];
+    for (var p = i.length, k = o.length, L = 0, W = Math.min(p, k); L < W; ++L)
+      if (i[L] !== o[L]) {
+        p = i[L], k = o[L];
         break;
       }
-    return p < E ? -1 : E < p ? 1 : 0;
+    return p < k ? -1 : k < p ? 1 : 0;
   }, l.isEncoding = function(i) {
     switch (String(i).toLowerCase()) {
       case "hex":
@@ -582,24 +582,24 @@ Un.write = function(n, t, e, r, s, a) {
     if (o === void 0)
       for (o = 0, p = 0; p < i.length; ++p)
         o += i[p].length;
-    var E = l.allocUnsafe(o), U = 0;
+    var k = l.allocUnsafe(o), L = 0;
     for (p = 0; p < i.length; ++p) {
       var W = i[p];
       if (fe(W, Uint8Array))
-        U + W.length > E.length ? l.from(W).copy(E, U) : Uint8Array.prototype.set.call(
-          E,
+        L + W.length > k.length ? l.from(W).copy(k, L) : Uint8Array.prototype.set.call(
+          k,
           W,
-          U
+          L
         );
       else if (l.isBuffer(W))
-        W.copy(E, U);
+        W.copy(k, L);
       else
         throw new TypeError('"list" argument must be an Array of Buffers');
-      U += W.length;
+      L += W.length;
     }
-    return E;
+    return k;
   };
-  function T(u, i) {
+  function A(u, i) {
     if (l.isBuffer(u))
       return u.length;
     if (ArrayBuffer.isView(u) || fe(u, ArrayBuffer))
@@ -610,7 +610,7 @@ Un.write = function(n, t, e, r, s, a) {
       );
     var o = u.length, p = arguments.length > 2 && arguments[2] === !0;
     if (!p && o === 0) return 0;
-    for (var E = !1; ; )
+    for (var k = !1; ; )
       switch (i) {
         case "ascii":
         case "latin1":
@@ -629,30 +629,30 @@ Un.write = function(n, t, e, r, s, a) {
         case "base64":
           return tt(u).length;
         default:
-          if (E)
+          if (k)
             return p ? -1 : qe(u).length;
-          i = ("" + i).toLowerCase(), E = !0;
+          i = ("" + i).toLowerCase(), k = !0;
       }
   }
-  l.byteLength = T;
-  function D(u, i, o) {
+  l.byteLength = A;
+  function P(u, i, o) {
     var p = !1;
     if ((i === void 0 || i < 0) && (i = 0), i > this.length || ((o === void 0 || o > this.length) && (o = this.length), o <= 0) || (o >>>= 0, i >>>= 0, o <= i))
       return "";
     for (u || (u = "utf8"); ; )
       switch (u) {
         case "hex":
-          return oe(this, i, o);
+          return te(this, i, o);
         case "utf8":
         case "utf-8":
-          return Y(this, i, o);
+          return $(this, i, o);
         case "ascii":
-          return K(this, i, o);
+          return G(this, i, o);
         case "latin1":
         case "binary":
-          return V(this, i, o);
+          return K(this, i, o);
         case "base64":
-          return L(this, i, o);
+          return O(this, i, o);
         case "ucs2":
         case "ucs-2":
         case "utf16le":
@@ -664,7 +664,7 @@ Un.write = function(n, t, e, r, s, a) {
       }
   }
   l.prototype._isBuffer = !0;
-  function A(u, i, o) {
+  function S(u, i, o) {
     var p = u[i];
     u[i] = u[o], u[o] = p;
   }
@@ -673,92 +673,92 @@ Un.write = function(n, t, e, r, s, a) {
     if (i % 2 !== 0)
       throw new RangeError("Buffer size must be a multiple of 16-bits");
     for (var o = 0; o < i; o += 2)
-      A(this, o, o + 1);
+      S(this, o, o + 1);
     return this;
   }, l.prototype.swap32 = function() {
     var i = this.length;
     if (i % 4 !== 0)
       throw new RangeError("Buffer size must be a multiple of 32-bits");
     for (var o = 0; o < i; o += 4)
-      A(this, o, o + 3), A(this, o + 1, o + 2);
+      S(this, o, o + 3), S(this, o + 1, o + 2);
     return this;
   }, l.prototype.swap64 = function() {
     var i = this.length;
     if (i % 8 !== 0)
       throw new RangeError("Buffer size must be a multiple of 64-bits");
     for (var o = 0; o < i; o += 8)
-      A(this, o, o + 7), A(this, o + 1, o + 6), A(this, o + 2, o + 5), A(this, o + 3, o + 4);
+      S(this, o, o + 7), S(this, o + 1, o + 6), S(this, o + 2, o + 5), S(this, o + 3, o + 4);
     return this;
   }, l.prototype.toString = function() {
     var i = this.length;
-    return i === 0 ? "" : arguments.length === 0 ? Y(this, 0, i) : D.apply(this, arguments);
+    return i === 0 ? "" : arguments.length === 0 ? $(this, 0, i) : P.apply(this, arguments);
   }, l.prototype.toLocaleString = l.prototype.toString, l.prototype.equals = function(i) {
     if (!l.isBuffer(i)) throw new TypeError("Argument must be a Buffer");
     return this === i ? !0 : l.compare(this, i) === 0;
   }, l.prototype.inspect = function() {
     var i = "", o = n.INSPECT_MAX_BYTES;
     return i = this.toString("hex", 0, o).replace(/(.{2})/g, "$1 ").trim(), this.length > o && (i += " ... "), "<Buffer " + i + ">";
-  }, r && (l.prototype[r] = l.prototype.inspect), l.prototype.compare = function(i, o, p, E, U) {
+  }, r && (l.prototype[r] = l.prototype.inspect), l.prototype.compare = function(i, o, p, k, L) {
     if (fe(i, Uint8Array) && (i = l.from(i, i.offset, i.byteLength)), !l.isBuffer(i))
       throw new TypeError(
         'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof i
       );
-    if (o === void 0 && (o = 0), p === void 0 && (p = i ? i.length : 0), E === void 0 && (E = 0), U === void 0 && (U = this.length), o < 0 || p > i.length || E < 0 || U > this.length)
+    if (o === void 0 && (o = 0), p === void 0 && (p = i ? i.length : 0), k === void 0 && (k = 0), L === void 0 && (L = this.length), o < 0 || p > i.length || k < 0 || L > this.length)
       throw new RangeError("out of range index");
-    if (E >= U && o >= p)
+    if (k >= L && o >= p)
       return 0;
-    if (E >= U)
+    if (k >= L)
       return -1;
     if (o >= p)
       return 1;
-    if (o >>>= 0, p >>>= 0, E >>>= 0, U >>>= 0, this === i) return 0;
-    for (var W = U - E, X = p - o, ne = Math.min(W, X), re = this.slice(E, U), pe = i.slice(o, p), te = 0; te < ne; ++te)
-      if (re[te] !== pe[te]) {
-        W = re[te], X = pe[te];
+    if (o >>>= 0, p >>>= 0, k >>>= 0, L >>>= 0, this === i) return 0;
+    for (var W = L - k, X = p - o, re = Math.min(W, X), ie = this.slice(k, L), pe = i.slice(o, p), ne = 0; ne < re; ++ne)
+      if (ie[ne] !== pe[ne]) {
+        W = ie[ne], X = pe[ne];
         break;
       }
     return W < X ? -1 : X < W ? 1 : 0;
   };
-  function R(u, i, o, p, E) {
+  function R(u, i, o, p, k) {
     if (u.length === 0) return -1;
-    if (typeof o == "string" ? (p = o, o = 0) : o > 2147483647 ? o = 2147483647 : o < -2147483648 && (o = -2147483648), o = +o, je(o) && (o = E ? 0 : u.length - 1), o < 0 && (o = u.length + o), o >= u.length) {
-      if (E) return -1;
+    if (typeof o == "string" ? (p = o, o = 0) : o > 2147483647 ? o = 2147483647 : o < -2147483648 && (o = -2147483648), o = +o, je(o) && (o = k ? 0 : u.length - 1), o < 0 && (o = u.length + o), o >= u.length) {
+      if (k) return -1;
       o = u.length - 1;
     } else if (o < 0)
-      if (E) o = 0;
+      if (k) o = 0;
       else return -1;
     if (typeof i == "string" && (i = l.from(i, p)), l.isBuffer(i))
-      return i.length === 0 ? -1 : F(u, i, o, p, E);
+      return i.length === 0 ? -1 : F(u, i, o, p, k);
     if (typeof i == "number")
-      return i = i & 255, typeof Uint8Array.prototype.indexOf == "function" ? E ? Uint8Array.prototype.indexOf.call(u, i, o) : Uint8Array.prototype.lastIndexOf.call(u, i, o) : F(u, [i], o, p, E);
+      return i = i & 255, typeof Uint8Array.prototype.indexOf == "function" ? k ? Uint8Array.prototype.indexOf.call(u, i, o) : Uint8Array.prototype.lastIndexOf.call(u, i, o) : F(u, [i], o, p, k);
     throw new TypeError("val must be string, number or Buffer");
   }
-  function F(u, i, o, p, E) {
-    var U = 1, W = u.length, X = i.length;
+  function F(u, i, o, p, k) {
+    var L = 1, W = u.length, X = i.length;
     if (p !== void 0 && (p = String(p).toLowerCase(), p === "ucs2" || p === "ucs-2" || p === "utf16le" || p === "utf-16le")) {
       if (u.length < 2 || i.length < 2)
         return -1;
-      U = 2, W /= 2, X /= 2, o /= 2;
+      L = 2, W /= 2, X /= 2, o /= 2;
     }
-    function ne(It, gt) {
-      return U === 1 ? It[gt] : It.readUInt16BE(gt * U);
+    function re(It, gt) {
+      return L === 1 ? It[gt] : It.readUInt16BE(gt * L);
     }
-    var re;
-    if (E) {
+    var ie;
+    if (k) {
       var pe = -1;
-      for (re = o; re < W; re++)
-        if (ne(u, re) === ne(i, pe === -1 ? 0 : re - pe)) {
-          if (pe === -1 && (pe = re), re - pe + 1 === X) return pe * U;
+      for (ie = o; ie < W; ie++)
+        if (re(u, ie) === re(i, pe === -1 ? 0 : ie - pe)) {
+          if (pe === -1 && (pe = ie), ie - pe + 1 === X) return pe * L;
         } else
-          pe !== -1 && (re -= re - pe), pe = -1;
+          pe !== -1 && (ie -= ie - pe), pe = -1;
     } else
-      for (o + X > W && (o = W - X), re = o; re >= 0; re--) {
-        for (var te = !0, Ye = 0; Ye < X; Ye++)
-          if (ne(u, re + Ye) !== ne(i, Ye)) {
-            te = !1;
+      for (o + X > W && (o = W - X), ie = o; ie >= 0; ie--) {
+        for (var ne = !0, Ye = 0; Ye < X; Ye++)
+          if (re(u, ie + Ye) !== re(i, Ye)) {
+            ne = !1;
             break;
           }
-        if (te) return re;
+        if (ne) return ie;
       }
     return -1;
   }
@@ -769,12 +769,12 @@ Un.write = function(n, t, e, r, s, a) {
   }, l.prototype.lastIndexOf = function(i, o, p) {
     return R(this, i, o, p, !1);
   };
-  function b(u, i, o, p) {
+  function y(u, i, o, p) {
     o = Number(o) || 0;
-    var E = u.length - o;
-    p ? (p = Number(p), p > E && (p = E)) : p = E;
-    var U = i.length;
-    p > U / 2 && (p = U / 2);
+    var k = u.length - o;
+    p ? (p = Number(p), p > k && (p = k)) : p = k;
+    var L = i.length;
+    p > L / 2 && (p = L / 2);
     for (var W = 0; W < p; ++W) {
       var X = parseInt(i.substr(W * 2, 2), 16);
       if (je(X)) return W;
@@ -782,54 +782,54 @@ Un.write = function(n, t, e, r, s, a) {
     }
     return W;
   }
-  function C(u, i, o, p) {
+  function D(u, i, o, p) {
     return ge(qe(i, u.length - o), u, o, p);
   }
-  function v(u, i, o, p) {
+  function b(u, i, o, p) {
     return ge(at(i), u, o, p);
   }
-  function S(u, i, o, p) {
+  function E(u, i, o, p) {
     return ge(tt(i), u, o, p);
   }
   function M(u, i, o, p) {
     return ge(et(i, u.length - o), u, o, p);
   }
-  l.prototype.write = function(i, o, p, E) {
+  l.prototype.write = function(i, o, p, k) {
     if (o === void 0)
-      E = "utf8", p = this.length, o = 0;
+      k = "utf8", p = this.length, o = 0;
     else if (p === void 0 && typeof o == "string")
-      E = o, p = this.length, o = 0;
+      k = o, p = this.length, o = 0;
     else if (isFinite(o))
-      o = o >>> 0, isFinite(p) ? (p = p >>> 0, E === void 0 && (E = "utf8")) : (E = p, p = void 0);
+      o = o >>> 0, isFinite(p) ? (p = p >>> 0, k === void 0 && (k = "utf8")) : (k = p, p = void 0);
     else
       throw new Error(
         "Buffer.write(string, encoding, offset[, length]) is no longer supported"
       );
-    var U = this.length - o;
-    if ((p === void 0 || p > U) && (p = U), i.length > 0 && (p < 0 || o < 0) || o > this.length)
+    var L = this.length - o;
+    if ((p === void 0 || p > L) && (p = L), i.length > 0 && (p < 0 || o < 0) || o > this.length)
       throw new RangeError("Attempt to write outside buffer bounds");
-    E || (E = "utf8");
+    k || (k = "utf8");
     for (var W = !1; ; )
-      switch (E) {
+      switch (k) {
         case "hex":
-          return b(this, i, o, p);
+          return y(this, i, o, p);
         case "utf8":
         case "utf-8":
-          return C(this, i, o, p);
+          return D(this, i, o, p);
         case "ascii":
         case "latin1":
         case "binary":
-          return v(this, i, o, p);
+          return b(this, i, o, p);
         case "base64":
-          return S(this, i, o, p);
+          return E(this, i, o, p);
         case "ucs2":
         case "ucs-2":
         case "utf16le":
         case "utf-16le":
           return M(this, i, o, p);
         default:
-          if (W) throw new TypeError("Unknown encoding: " + E);
-          E = ("" + E).toLowerCase(), W = !0;
+          if (W) throw new TypeError("Unknown encoding: " + k);
+          k = ("" + k).toLowerCase(), W = !0;
       }
   }, l.prototype.toJSON = function() {
     return {
@@ -837,30 +837,30 @@ Un.write = function(n, t, e, r, s, a) {
       data: Array.prototype.slice.call(this._arr || this, 0)
     };
   };
-  function L(u, i, o) {
+  function O(u, i, o) {
     return i === 0 && o === u.length ? t.fromByteArray(u) : t.fromByteArray(u.slice(i, o));
   }
-  function Y(u, i, o) {
+  function $(u, i, o) {
     o = Math.min(u.length, o);
-    for (var p = [], E = i; E < o; ) {
-      var U = u[E], W = null, X = U > 239 ? 4 : U > 223 ? 3 : U > 191 ? 2 : 1;
-      if (E + X <= o) {
-        var ne, re, pe, te;
+    for (var p = [], k = i; k < o; ) {
+      var L = u[k], W = null, X = L > 239 ? 4 : L > 223 ? 3 : L > 191 ? 2 : 1;
+      if (k + X <= o) {
+        var re, ie, pe, ne;
         switch (X) {
           case 1:
-            U < 128 && (W = U);
+            L < 128 && (W = L);
             break;
           case 2:
-            ne = u[E + 1], (ne & 192) === 128 && (te = (U & 31) << 6 | ne & 63, te > 127 && (W = te));
+            re = u[k + 1], (re & 192) === 128 && (ne = (L & 31) << 6 | re & 63, ne > 127 && (W = ne));
             break;
           case 3:
-            ne = u[E + 1], re = u[E + 2], (ne & 192) === 128 && (re & 192) === 128 && (te = (U & 15) << 12 | (ne & 63) << 6 | re & 63, te > 2047 && (te < 55296 || te > 57343) && (W = te));
+            re = u[k + 1], ie = u[k + 2], (re & 192) === 128 && (ie & 192) === 128 && (ne = (L & 15) << 12 | (re & 63) << 6 | ie & 63, ne > 2047 && (ne < 55296 || ne > 57343) && (W = ne));
             break;
           case 4:
-            ne = u[E + 1], re = u[E + 2], pe = u[E + 3], (ne & 192) === 128 && (re & 192) === 128 && (pe & 192) === 128 && (te = (U & 15) << 18 | (ne & 63) << 12 | (re & 63) << 6 | pe & 63, te > 65535 && te < 1114112 && (W = te));
+            re = u[k + 1], ie = u[k + 2], pe = u[k + 3], (re & 192) === 128 && (ie & 192) === 128 && (pe & 192) === 128 && (ne = (L & 15) << 18 | (re & 63) << 12 | (ie & 63) << 6 | pe & 63, ne > 65535 && ne < 1114112 && (W = ne));
         }
       }
-      W === null ? (W = 65533, X = 1) : W > 65535 && (W -= 65536, p.push(W >>> 10 & 1023 | 55296), W = 56320 | W & 1023), p.push(W), E += X;
+      W === null ? (W = 65533, X = 1) : W > 65535 && (W -= 65536, p.push(W >>> 10 & 1023 | 55296), W = 56320 | W & 1023), p.push(W), k += X;
     }
     return j(p);
   }
@@ -876,37 +876,37 @@ Un.write = function(n, t, e, r, s, a) {
       );
     return o;
   }
-  function K(u, i, o) {
+  function G(u, i, o) {
     var p = "";
     o = Math.min(u.length, o);
-    for (var E = i; E < o; ++E)
-      p += String.fromCharCode(u[E] & 127);
+    for (var k = i; k < o; ++k)
+      p += String.fromCharCode(u[k] & 127);
     return p;
   }
-  function V(u, i, o) {
+  function K(u, i, o) {
     var p = "";
     o = Math.min(u.length, o);
-    for (var E = i; E < o; ++E)
-      p += String.fromCharCode(u[E]);
+    for (var k = i; k < o; ++k)
+      p += String.fromCharCode(u[k]);
     return p;
   }
-  function oe(u, i, o) {
+  function te(u, i, o) {
     var p = u.length;
     (!i || i < 0) && (i = 0), (!o || o < 0 || o > p) && (o = p);
-    for (var E = "", U = i; U < o; ++U)
-      E += ue[u[U]];
-    return E;
+    for (var k = "", L = i; L < o; ++L)
+      k += ue[u[L]];
+    return k;
   }
   function Z(u, i, o) {
-    for (var p = u.slice(i, o), E = "", U = 0; U < p.length - 1; U += 2)
-      E += String.fromCharCode(p[U] + p[U + 1] * 256);
-    return E;
+    for (var p = u.slice(i, o), k = "", L = 0; L < p.length - 1; L += 2)
+      k += String.fromCharCode(p[L] + p[L + 1] * 256);
+    return k;
   }
   l.prototype.slice = function(i, o) {
     var p = this.length;
     i = ~~i, o = o === void 0 ? p : ~~o, i < 0 ? (i += p, i < 0 && (i = 0)) : i > p && (i = p), o < 0 ? (o += p, o < 0 && (o = 0)) : o > p && (o = p), o < i && (o = i);
-    var E = this.subarray(i, o);
-    return Object.setPrototypeOf(E, l.prototype), E;
+    var k = this.subarray(i, o);
+    return Object.setPrototypeOf(k, l.prototype), k;
   };
   function J(u, i, o) {
     if (u % 1 !== 0 || u < 0) throw new RangeError("offset is not uint");
@@ -914,14 +914,14 @@ Un.write = function(n, t, e, r, s, a) {
   }
   l.prototype.readUintLE = l.prototype.readUIntLE = function(i, o, p) {
     i = i >>> 0, o = o >>> 0, p || J(i, o, this.length);
-    for (var E = this[i], U = 1, W = 0; ++W < o && (U *= 256); )
-      E += this[i + W] * U;
-    return E;
+    for (var k = this[i], L = 1, W = 0; ++W < o && (L *= 256); )
+      k += this[i + W] * L;
+    return k;
   }, l.prototype.readUintBE = l.prototype.readUIntBE = function(i, o, p) {
     i = i >>> 0, o = o >>> 0, p || J(i, o, this.length);
-    for (var E = this[i + --o], U = 1; o > 0 && (U *= 256); )
-      E += this[i + --o] * U;
-    return E;
+    for (var k = this[i + --o], L = 1; o > 0 && (L *= 256); )
+      k += this[i + --o] * L;
+    return k;
   }, l.prototype.readUint8 = l.prototype.readUInt8 = function(i, o) {
     return i = i >>> 0, o || J(i, 1, this.length), this[i];
   }, l.prototype.readUint16LE = l.prototype.readUInt16LE = function(i, o) {
@@ -934,14 +934,14 @@ Un.write = function(n, t, e, r, s, a) {
     return i = i >>> 0, o || J(i, 4, this.length), this[i] * 16777216 + (this[i + 1] << 16 | this[i + 2] << 8 | this[i + 3]);
   }, l.prototype.readIntLE = function(i, o, p) {
     i = i >>> 0, o = o >>> 0, p || J(i, o, this.length);
-    for (var E = this[i], U = 1, W = 0; ++W < o && (U *= 256); )
-      E += this[i + W] * U;
-    return U *= 128, E >= U && (E -= Math.pow(2, 8 * o)), E;
+    for (var k = this[i], L = 1, W = 0; ++W < o && (L *= 256); )
+      k += this[i + W] * L;
+    return L *= 128, k >= L && (k -= Math.pow(2, 8 * o)), k;
   }, l.prototype.readIntBE = function(i, o, p) {
     i = i >>> 0, o = o >>> 0, p || J(i, o, this.length);
-    for (var E = o, U = 1, W = this[i + --E]; E > 0 && (U *= 256); )
-      W += this[i + --E] * U;
-    return U *= 128, W >= U && (W -= Math.pow(2, 8 * o)), W;
+    for (var k = o, L = 1, W = this[i + --k]; k > 0 && (L *= 256); )
+      W += this[i + --k] * L;
+    return L *= 128, W >= L && (W -= Math.pow(2, 8 * o)), W;
   }, l.prototype.readInt8 = function(i, o) {
     return i = i >>> 0, o || J(i, 1, this.length), this[i] & 128 ? (255 - this[i] + 1) * -1 : this[i];
   }, l.prototype.readInt16LE = function(i, o) {
@@ -965,110 +965,110 @@ Un.write = function(n, t, e, r, s, a) {
   }, l.prototype.readDoubleBE = function(i, o) {
     return i = i >>> 0, o || J(i, 8, this.length), e.read(this, i, !1, 52, 8);
   };
-  function $(u, i, o, p, E, U) {
+  function Y(u, i, o, p, k, L) {
     if (!l.isBuffer(u)) throw new TypeError('"buffer" argument must be a Buffer instance');
-    if (i > E || i < U) throw new RangeError('"value" argument is out of bounds');
+    if (i > k || i < L) throw new RangeError('"value" argument is out of bounds');
     if (o + p > u.length) throw new RangeError("Index out of range");
   }
-  l.prototype.writeUintLE = l.prototype.writeUIntLE = function(i, o, p, E) {
-    if (i = +i, o = o >>> 0, p = p >>> 0, !E) {
-      var U = Math.pow(2, 8 * p) - 1;
-      $(this, i, o, p, U, 0);
+  l.prototype.writeUintLE = l.prototype.writeUIntLE = function(i, o, p, k) {
+    if (i = +i, o = o >>> 0, p = p >>> 0, !k) {
+      var L = Math.pow(2, 8 * p) - 1;
+      Y(this, i, o, p, L, 0);
     }
     var W = 1, X = 0;
     for (this[o] = i & 255; ++X < p && (W *= 256); )
       this[o + X] = i / W & 255;
     return o + p;
-  }, l.prototype.writeUintBE = l.prototype.writeUIntBE = function(i, o, p, E) {
-    if (i = +i, o = o >>> 0, p = p >>> 0, !E) {
-      var U = Math.pow(2, 8 * p) - 1;
-      $(this, i, o, p, U, 0);
+  }, l.prototype.writeUintBE = l.prototype.writeUIntBE = function(i, o, p, k) {
+    if (i = +i, o = o >>> 0, p = p >>> 0, !k) {
+      var L = Math.pow(2, 8 * p) - 1;
+      Y(this, i, o, p, L, 0);
     }
     var W = p - 1, X = 1;
     for (this[o + W] = i & 255; --W >= 0 && (X *= 256); )
       this[o + W] = i / X & 255;
     return o + p;
   }, l.prototype.writeUint8 = l.prototype.writeUInt8 = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 1, 255, 0), this[o] = i & 255, o + 1;
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 1, 255, 0), this[o] = i & 255, o + 1;
   }, l.prototype.writeUint16LE = l.prototype.writeUInt16LE = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 2, 65535, 0), this[o] = i & 255, this[o + 1] = i >>> 8, o + 2;
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 2, 65535, 0), this[o] = i & 255, this[o + 1] = i >>> 8, o + 2;
   }, l.prototype.writeUint16BE = l.prototype.writeUInt16BE = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 2, 65535, 0), this[o] = i >>> 8, this[o + 1] = i & 255, o + 2;
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 2, 65535, 0), this[o] = i >>> 8, this[o + 1] = i & 255, o + 2;
   }, l.prototype.writeUint32LE = l.prototype.writeUInt32LE = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 4, 4294967295, 0), this[o + 3] = i >>> 24, this[o + 2] = i >>> 16, this[o + 1] = i >>> 8, this[o] = i & 255, o + 4;
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 4, 4294967295, 0), this[o + 3] = i >>> 24, this[o + 2] = i >>> 16, this[o + 1] = i >>> 8, this[o] = i & 255, o + 4;
   }, l.prototype.writeUint32BE = l.prototype.writeUInt32BE = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 4, 4294967295, 0), this[o] = i >>> 24, this[o + 1] = i >>> 16, this[o + 2] = i >>> 8, this[o + 3] = i & 255, o + 4;
-  }, l.prototype.writeIntLE = function(i, o, p, E) {
-    if (i = +i, o = o >>> 0, !E) {
-      var U = Math.pow(2, 8 * p - 1);
-      $(this, i, o, p, U - 1, -U);
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 4, 4294967295, 0), this[o] = i >>> 24, this[o + 1] = i >>> 16, this[o + 2] = i >>> 8, this[o + 3] = i & 255, o + 4;
+  }, l.prototype.writeIntLE = function(i, o, p, k) {
+    if (i = +i, o = o >>> 0, !k) {
+      var L = Math.pow(2, 8 * p - 1);
+      Y(this, i, o, p, L - 1, -L);
     }
-    var W = 0, X = 1, ne = 0;
+    var W = 0, X = 1, re = 0;
     for (this[o] = i & 255; ++W < p && (X *= 256); )
-      i < 0 && ne === 0 && this[o + W - 1] !== 0 && (ne = 1), this[o + W] = (i / X >> 0) - ne & 255;
+      i < 0 && re === 0 && this[o + W - 1] !== 0 && (re = 1), this[o + W] = (i / X >> 0) - re & 255;
     return o + p;
-  }, l.prototype.writeIntBE = function(i, o, p, E) {
-    if (i = +i, o = o >>> 0, !E) {
-      var U = Math.pow(2, 8 * p - 1);
-      $(this, i, o, p, U - 1, -U);
+  }, l.prototype.writeIntBE = function(i, o, p, k) {
+    if (i = +i, o = o >>> 0, !k) {
+      var L = Math.pow(2, 8 * p - 1);
+      Y(this, i, o, p, L - 1, -L);
     }
-    var W = p - 1, X = 1, ne = 0;
+    var W = p - 1, X = 1, re = 0;
     for (this[o + W] = i & 255; --W >= 0 && (X *= 256); )
-      i < 0 && ne === 0 && this[o + W + 1] !== 0 && (ne = 1), this[o + W] = (i / X >> 0) - ne & 255;
+      i < 0 && re === 0 && this[o + W + 1] !== 0 && (re = 1), this[o + W] = (i / X >> 0) - re & 255;
     return o + p;
   }, l.prototype.writeInt8 = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 1, 127, -128), i < 0 && (i = 255 + i + 1), this[o] = i & 255, o + 1;
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 1, 127, -128), i < 0 && (i = 255 + i + 1), this[o] = i & 255, o + 1;
   }, l.prototype.writeInt16LE = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 2, 32767, -32768), this[o] = i & 255, this[o + 1] = i >>> 8, o + 2;
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 2, 32767, -32768), this[o] = i & 255, this[o + 1] = i >>> 8, o + 2;
   }, l.prototype.writeInt16BE = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 2, 32767, -32768), this[o] = i >>> 8, this[o + 1] = i & 255, o + 2;
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 2, 32767, -32768), this[o] = i >>> 8, this[o + 1] = i & 255, o + 2;
   }, l.prototype.writeInt32LE = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 4, 2147483647, -2147483648), this[o] = i & 255, this[o + 1] = i >>> 8, this[o + 2] = i >>> 16, this[o + 3] = i >>> 24, o + 4;
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 4, 2147483647, -2147483648), this[o] = i & 255, this[o + 1] = i >>> 8, this[o + 2] = i >>> 16, this[o + 3] = i >>> 24, o + 4;
   }, l.prototype.writeInt32BE = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || $(this, i, o, 4, 2147483647, -2147483648), i < 0 && (i = 4294967295 + i + 1), this[o] = i >>> 24, this[o + 1] = i >>> 16, this[o + 2] = i >>> 8, this[o + 3] = i & 255, o + 4;
+    return i = +i, o = o >>> 0, p || Y(this, i, o, 4, 2147483647, -2147483648), i < 0 && (i = 4294967295 + i + 1), this[o] = i >>> 24, this[o + 1] = i >>> 16, this[o + 2] = i >>> 8, this[o + 3] = i & 255, o + 4;
   };
-  function ee(u, i, o, p, E, U) {
+  function ee(u, i, o, p, k, L) {
     if (o + p > u.length) throw new RangeError("Index out of range");
     if (o < 0) throw new RangeError("Index out of range");
   }
-  function Pe(u, i, o, p, E) {
-    return i = +i, o = o >>> 0, E || ee(u, i, o, 4), e.write(u, i, o, p, 23, 4), o + 4;
+  function Pe(u, i, o, p, k) {
+    return i = +i, o = o >>> 0, k || ee(u, i, o, 4), e.write(u, i, o, p, 23, 4), o + 4;
   }
   l.prototype.writeFloatLE = function(i, o, p) {
     return Pe(this, i, o, !0, p);
   }, l.prototype.writeFloatBE = function(i, o, p) {
     return Pe(this, i, o, !1, p);
   };
-  function de(u, i, o, p, E) {
-    return i = +i, o = o >>> 0, E || ee(u, i, o, 8), e.write(u, i, o, p, 52, 8), o + 8;
+  function de(u, i, o, p, k) {
+    return i = +i, o = o >>> 0, k || ee(u, i, o, 8), e.write(u, i, o, p, 52, 8), o + 8;
   }
   l.prototype.writeDoubleLE = function(i, o, p) {
     return de(this, i, o, !0, p);
   }, l.prototype.writeDoubleBE = function(i, o, p) {
     return de(this, i, o, !1, p);
-  }, l.prototype.copy = function(i, o, p, E) {
+  }, l.prototype.copy = function(i, o, p, k) {
     if (!l.isBuffer(i)) throw new TypeError("argument should be a Buffer");
-    if (p || (p = 0), !E && E !== 0 && (E = this.length), o >= i.length && (o = i.length), o || (o = 0), E > 0 && E < p && (E = p), E === p || i.length === 0 || this.length === 0) return 0;
+    if (p || (p = 0), !k && k !== 0 && (k = this.length), o >= i.length && (o = i.length), o || (o = 0), k > 0 && k < p && (k = p), k === p || i.length === 0 || this.length === 0) return 0;
     if (o < 0)
       throw new RangeError("targetStart out of bounds");
     if (p < 0 || p >= this.length) throw new RangeError("Index out of range");
-    if (E < 0) throw new RangeError("sourceEnd out of bounds");
-    E > this.length && (E = this.length), i.length - o < E - p && (E = i.length - o + p);
-    var U = E - p;
-    return this === i && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(o, p, E) : Uint8Array.prototype.set.call(
+    if (k < 0) throw new RangeError("sourceEnd out of bounds");
+    k > this.length && (k = this.length), i.length - o < k - p && (k = i.length - o + p);
+    var L = k - p;
+    return this === i && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(o, p, k) : Uint8Array.prototype.set.call(
       i,
-      this.subarray(p, E),
+      this.subarray(p, k),
       o
-    ), U;
-  }, l.prototype.fill = function(i, o, p, E) {
+    ), L;
+  }, l.prototype.fill = function(i, o, p, k) {
     if (typeof i == "string") {
-      if (typeof o == "string" ? (E = o, o = 0, p = this.length) : typeof p == "string" && (E = p, p = this.length), E !== void 0 && typeof E != "string")
+      if (typeof o == "string" ? (k = o, o = 0, p = this.length) : typeof p == "string" && (k = p, p = this.length), k !== void 0 && typeof k != "string")
         throw new TypeError("encoding must be a string");
-      if (typeof E == "string" && !l.isEncoding(E))
-        throw new TypeError("Unknown encoding: " + E);
+      if (typeof k == "string" && !l.isEncoding(k))
+        throw new TypeError("Unknown encoding: " + k);
       if (i.length === 1) {
-        var U = i.charCodeAt(0);
-        (E === "utf8" && U < 128 || E === "latin1") && (i = U);
+        var L = i.charCodeAt(0);
+        (k === "utf8" && L < 128 || k === "latin1") && (i = L);
       }
     } else typeof i == "number" ? i = i & 255 : typeof i == "boolean" && (i = Number(i));
     if (o < 0 || this.length < o || this.length < p)
@@ -1081,11 +1081,11 @@ Un.write = function(n, t, e, r, s, a) {
       for (W = o; W < p; ++W)
         this[W] = i;
     else {
-      var X = l.isBuffer(i) ? i : l.from(i, E), ne = X.length;
-      if (ne === 0)
+      var X = l.isBuffer(i) ? i : l.from(i, k), re = X.length;
+      if (re === 0)
         throw new TypeError('The value "' + i + '" is invalid for argument "value"');
       for (W = 0; W < p - o; ++W)
-        this[W + o] = X[W % ne];
+        this[W + o] = X[W % re];
     }
     return this;
   };
@@ -1098,44 +1098,44 @@ Un.write = function(n, t, e, r, s, a) {
   }
   function qe(u, i) {
     i = i || 1 / 0;
-    for (var o, p = u.length, E = null, U = [], W = 0; W < p; ++W) {
+    for (var o, p = u.length, k = null, L = [], W = 0; W < p; ++W) {
       if (o = u.charCodeAt(W), o > 55295 && o < 57344) {
-        if (!E) {
+        if (!k) {
           if (o > 56319) {
-            (i -= 3) > -1 && U.push(239, 191, 189);
+            (i -= 3) > -1 && L.push(239, 191, 189);
             continue;
           } else if (W + 1 === p) {
-            (i -= 3) > -1 && U.push(239, 191, 189);
+            (i -= 3) > -1 && L.push(239, 191, 189);
             continue;
           }
-          E = o;
+          k = o;
           continue;
         }
         if (o < 56320) {
-          (i -= 3) > -1 && U.push(239, 191, 189), E = o;
+          (i -= 3) > -1 && L.push(239, 191, 189), k = o;
           continue;
         }
-        o = (E - 55296 << 10 | o - 56320) + 65536;
-      } else E && (i -= 3) > -1 && U.push(239, 191, 189);
-      if (E = null, o < 128) {
+        o = (k - 55296 << 10 | o - 56320) + 65536;
+      } else k && (i -= 3) > -1 && L.push(239, 191, 189);
+      if (k = null, o < 128) {
         if ((i -= 1) < 0) break;
-        U.push(o);
+        L.push(o);
       } else if (o < 2048) {
         if ((i -= 2) < 0) break;
-        U.push(
+        L.push(
           o >> 6 | 192,
           o & 63 | 128
         );
       } else if (o < 65536) {
         if ((i -= 3) < 0) break;
-        U.push(
+        L.push(
           o >> 12 | 224,
           o >> 6 & 63 | 128,
           o & 63 | 128
         );
       } else if (o < 1114112) {
         if ((i -= 4) < 0) break;
-        U.push(
+        L.push(
           o >> 18 | 240,
           o >> 12 & 63 | 128,
           o >> 6 & 63 | 128,
@@ -1144,7 +1144,7 @@ Un.write = function(n, t, e, r, s, a) {
       } else
         throw new Error("Invalid code point");
     }
-    return U;
+    return L;
   }
   function at(u) {
     for (var i = [], o = 0; o < u.length; ++o)
@@ -1152,17 +1152,17 @@ Un.write = function(n, t, e, r, s, a) {
     return i;
   }
   function et(u, i) {
-    for (var o, p, E, U = [], W = 0; W < u.length && !((i -= 2) < 0); ++W)
-      o = u.charCodeAt(W), p = o >> 8, E = o % 256, U.push(E), U.push(p);
-    return U;
+    for (var o, p, k, L = [], W = 0; W < u.length && !((i -= 2) < 0); ++W)
+      o = u.charCodeAt(W), p = o >> 8, k = o % 256, L.push(k), L.push(p);
+    return L;
   }
   function tt(u) {
     return t.toByteArray(wt(u));
   }
   function ge(u, i, o, p) {
-    for (var E = 0; E < p && !(E + o >= i.length || E >= u.length); ++E)
-      i[E + o] = u[E];
-    return E;
+    for (var k = 0; k < p && !(k + o >= i.length || k >= u.length); ++k)
+      i[k + o] = u[k];
+    return k;
   }
   function fe(u, i) {
     return u instanceof i || u != null && u.constructor != null && u.constructor.name != null && u.constructor.name === i.name;
@@ -1172,8 +1172,8 @@ Un.write = function(n, t, e, r, s, a) {
   }
   var ue = function() {
     for (var u = "0123456789abcdef", i = new Array(256), o = 0; o < 16; ++o)
-      for (var p = o * 16, E = 0; E < 16; ++E)
-        i[p + E] = u[o] + u[E];
+      for (var p = o * 16, k = 0; k < 16; ++k)
+        i[p + k] = u[o] + u[k];
     return i;
   }();
 })(ai);
@@ -1344,7 +1344,7 @@ ReadableStream.prototype[Symbol.asyncIterator] || (ReadableStream.prototype[Symb
 }, ReadableStream.prototype.iterate = // @ts-ignore
 ReadableStream.prototype[Symbol.asyncIterator]);
 new Dn({ concurrency: 10 });
-const St = 15, kn = 30, Sn = 19, Hs = 29, Gt = 256, Bn = Gt + 1 + Hs, Xn = 2 * Bn + 1, _t = 256, $s = 7, zn = 16, Jn = 17, Qn = 18, an = 8 * 2, Kt = -1, Ys = 1, Pt = 2, Zs = 0, dt = 0, er = 1, Vs = 3, Se = 4, Ue = 0, fi = 1, Dt = 2, Oe = -2, Gs = -3, lt = -5;
+const St = 15, En = 30, Sn = 19, Hs = 29, Gt = 256, Bn = Gt + 1 + Hs, Xn = 2 * Bn + 1, _t = 256, $s = 7, zn = 16, Jn = 17, Qn = 18, an = 8 * 2, Kt = -1, Ys = 1, Pt = 2, Zs = 0, dt = 0, er = 1, Vs = 3, Se = 4, Ue = 0, fi = 1, Dt = 2, Oe = -2, Gs = -3, lt = -5;
 function tn(n) {
   return nn(n.map(([t, e]) => new Array(t).fill(e, 0, t)));
 }
@@ -1380,24 +1380,24 @@ const tr = [0, 1, 2, 3].concat(...tn([
   [64, 28],
   [64, 29]
 ]));
-function ie() {
+function se() {
   const n = this;
   function t(s) {
     const a = n.dyn_tree, c = n.stat_desc.static_tree, l = n.stat_desc.extra_bits, f = n.stat_desc.extra_base, _ = n.stat_desc.max_length;
-    let x, w, g, k, P, m, d = 0;
-    for (k = 0; k <= St; k++)
-      s.bl_count[k] = 0;
+    let x, w, g, T, C, m, d = 0;
+    for (T = 0; T <= St; T++)
+      s.bl_count[T] = 0;
     for (a[s.heap[s.heap_max] * 2 + 1] = 0, x = s.heap_max + 1; x < Xn; x++)
-      w = s.heap[x], k = a[a[w * 2 + 1] * 2 + 1] + 1, k > _ && (k = _, d++), a[w * 2 + 1] = k, !(w > n.max_code) && (s.bl_count[k]++, P = 0, w >= f && (P = l[w - f]), m = a[w * 2], s.opt_len += m * (k + P), c && (s.static_len += m * (c[w * 2 + 1] + P)));
+      w = s.heap[x], T = a[a[w * 2 + 1] * 2 + 1] + 1, T > _ && (T = _, d++), a[w * 2 + 1] = T, !(w > n.max_code) && (s.bl_count[T]++, C = 0, w >= f && (C = l[w - f]), m = a[w * 2], s.opt_len += m * (T + C), c && (s.static_len += m * (c[w * 2 + 1] + C)));
     if (d !== 0) {
       do {
-        for (k = _ - 1; s.bl_count[k] === 0; )
-          k--;
-        s.bl_count[k]--, s.bl_count[k + 1] += 2, s.bl_count[_]--, d -= 2;
+        for (T = _ - 1; s.bl_count[T] === 0; )
+          T--;
+        s.bl_count[T]--, s.bl_count[T + 1] += 2, s.bl_count[_]--, d -= 2;
       } while (d > 0);
-      for (k = _; k !== 0; k--)
-        for (w = s.bl_count[k]; w !== 0; )
-          g = s.heap[--x], !(g > n.max_code) && (a[g * 2 + 1] != k && (s.opt_len += (k - a[g * 2 + 1]) * a[g * 2], a[g * 2 + 1] = k), w--);
+      for (T = _; T !== 0; T--)
+        for (w = s.bl_count[T]; w !== 0; )
+          g = s.heap[--x], !(g > n.max_code) && (a[g * 2 + 1] != T && (s.opt_len += (T - a[g * 2 + 1]) * a[g * 2], a[g * 2 + 1] = T), w--);
     }
   }
   function e(s, a) {
@@ -1431,7 +1431,7 @@ function ie() {
     s.heap[--s.heap_max] = s.heap[1], t(s), r(a, n.max_code, s.bl_count);
   };
 }
-ie._length_code = [0, 1, 2, 3, 4, 5, 6, 7].concat(...tn([
+se._length_code = [0, 1, 2, 3, 4, 5, 6, 7].concat(...tn([
   [2, 8],
   [2, 9],
   [2, 10],
@@ -1454,8 +1454,8 @@ ie._length_code = [0, 1, 2, 3, 4, 5, 6, 7].concat(...tn([
   [31, 27],
   [1, 28]
 ]));
-ie.base_length = [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 0];
-ie.base_dist = [
+se.base_length = [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 0];
+se.base_dist = [
   0,
   1,
   2,
@@ -1487,13 +1487,13 @@ ie.base_dist = [
   16384,
   24576
 ];
-ie.d_code = function(n) {
+se.d_code = function(n) {
   return n < 256 ? tr[n] : tr[256 + (n >>> 7)];
 };
-ie.extra_lbits = [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];
-ie.extra_dbits = [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];
-ie.extra_blbits = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7];
-ie.bl_order = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+se.extra_lbits = [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];
+se.extra_dbits = [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];
+se.extra_blbits = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7];
+se.bl_order = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
 function we(n, t, e, r, s) {
   const a = this;
   a.static_tree = n, a.extra_bits = t, a.extra_base = e, a.elems = r, a.max_length = s;
@@ -1791,9 +1791,9 @@ const Ks = [
 we.static_ltree = nn(Ks.map((n, t) => [n, Xs[t]]));
 const zs = [0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23], Js = tn([[30, 5]]);
 we.static_dtree = nn(zs.map((n, t) => [n, Js[t]]));
-we.static_l_desc = new we(we.static_ltree, ie.extra_lbits, Gt + 1, Bn, St);
-we.static_d_desc = new we(we.static_dtree, ie.extra_dbits, 0, kn, St);
-we.static_bl_desc = new we(null, ie.extra_blbits, 0, Sn, $s);
+we.static_l_desc = new we(we.static_ltree, se.extra_lbits, Gt + 1, Bn, St);
+we.static_d_desc = new we(we.static_dtree, se.extra_dbits, 0, En, St);
+we.static_bl_desc = new we(null, se.extra_blbits, 0, Sn, $s);
 const Qs = 9, eo = 8;
 function Be(n, t, e, r, s) {
   const a = this;
@@ -1838,46 +1838,46 @@ function nr(n, t, e, r) {
 }
 function io() {
   const n = this;
-  let t, e, r, s, a, c, l, f, _, x, w, g, k, P, m, d, h, y, T, D, A, R, F, b, C, v, S, M, L, Y, H, j, K;
-  const V = new ie(), oe = new ie(), Z = new ie();
+  let t, e, r, s, a, c, l, f, _, x, w, g, T, C, m, d, h, v, A, P, S, R, F, y, D, b, E, M, O, $, H, j, G;
+  const K = new se(), te = new se(), Z = new se();
   n.depth = [];
-  let J, $, ee, Pe, de, le;
-  n.bl_count = [], n.heap = [], H = [], j = [], K = [];
+  let J, Y, ee, Pe, de, le;
+  n.bl_count = [], n.heap = [], H = [], j = [], G = [];
   function wt() {
-    _ = 2 * a, w[k - 1] = 0;
-    for (let I = 0; I < k - 1; I++)
+    _ = 2 * a, w[T - 1] = 0;
+    for (let I = 0; I < T - 1; I++)
       w[I] = 0;
-    v = Le[S].max_lazy, L = Le[S].good_length, Y = Le[S].nice_length, C = Le[S].max_chain, A = 0, h = 0, F = 0, y = b = ae - 1, D = 0, g = 0;
+    b = Le[E].max_lazy, O = Le[E].good_length, $ = Le[E].nice_length, D = Le[E].max_chain, S = 0, h = 0, F = 0, v = y = ae - 1, P = 0, g = 0;
   }
   function qe() {
     let I;
     for (I = 0; I < Bn; I++)
       H[I * 2] = 0;
-    for (I = 0; I < kn; I++)
+    for (I = 0; I < En; I++)
       j[I * 2] = 0;
     for (I = 0; I < Sn; I++)
-      K[I * 2] = 0;
-    H[_t * 2] = 1, n.opt_len = n.static_len = 0, $ = ee = 0;
+      G[I * 2] = 0;
+    H[_t * 2] = 1, n.opt_len = n.static_len = 0, Y = ee = 0;
   }
   function at() {
-    V.dyn_tree = H, V.stat_desc = we.static_l_desc, oe.dyn_tree = j, oe.stat_desc = we.static_d_desc, Z.dyn_tree = K, Z.stat_desc = we.static_bl_desc, de = 0, le = 0, Pe = 8, qe();
+    K.dyn_tree = H, K.stat_desc = we.static_l_desc, te.dyn_tree = j, te.stat_desc = we.static_d_desc, Z.dyn_tree = G, Z.stat_desc = we.static_bl_desc, de = 0, le = 0, Pe = 8, qe();
   }
   n.pqdownheap = function(I, B) {
-    const O = n.heap, N = O[B];
+    const U = n.heap, N = U[B];
     let q = B << 1;
-    for (; q <= n.heap_len && (q < n.heap_len && nr(I, O[q + 1], O[q], n.depth) && q++, !nr(I, N, O[q], n.depth)); )
-      O[B] = O[q], B = q, q <<= 1;
-    O[B] = N;
+    for (; q <= n.heap_len && (q < n.heap_len && nr(I, U[q + 1], U[q], n.depth) && q++, !nr(I, N, U[q], n.depth)); )
+      U[B] = U[q], B = q, q <<= 1;
+    U[B] = N;
   };
   function et(I, B) {
-    let O = -1, N, q = I[0 * 2 + 1], G = 0, z = 7, be = 4;
+    let U = -1, N, q = I[0 * 2 + 1], V = 0, z = 7, be = 4;
     q === 0 && (z = 138, be = 3), I[(B + 1) * 2 + 1] = 65535;
     for (let De = 0; De <= B; De++)
-      N = q, q = I[(De + 1) * 2 + 1], !(++G < z && N == q) && (G < be ? K[N * 2] += G : N !== 0 ? (N != O && K[N * 2]++, K[zn * 2]++) : G <= 10 ? K[Jn * 2]++ : K[Qn * 2]++, G = 0, O = N, q === 0 ? (z = 138, be = 3) : N == q ? (z = 6, be = 3) : (z = 7, be = 4));
+      N = q, q = I[(De + 1) * 2 + 1], !(++V < z && N == q) && (V < be ? G[N * 2] += V : N !== 0 ? (N != U && G[N * 2]++, G[zn * 2]++) : V <= 10 ? G[Jn * 2]++ : G[Qn * 2]++, V = 0, U = N, q === 0 ? (z = 138, be = 3) : N == q ? (z = 6, be = 3) : (z = 7, be = 4));
   }
   function tt() {
     let I;
-    for (et(H, V.max_code), et(j, oe.max_code), Z.build_tree(n), I = Sn - 1; I >= 3 && K[ie.bl_order[I] * 2 + 1] === 0; I--)
+    for (et(H, K.max_code), et(j, te.max_code), Z.build_tree(n), I = Sn - 1; I >= 3 && G[se.bl_order[I] * 2 + 1] === 0; I--)
       ;
     return n.opt_len += 3 * (I + 1) + 5 + 5 + 4, I;
   }
@@ -1891,97 +1891,97 @@ function io() {
     ge(I >> 8 & 255), ge(I & 255 & 255);
   }
   function ue(I, B) {
-    let O;
+    let U;
     const N = B;
-    le > an - N ? (O = I, de |= O << le & 65535, fe(de), de = O >>> an - le, le += N - an) : (de |= I << le & 65535, le += N);
+    le > an - N ? (U = I, de |= U << le & 65535, fe(de), de = U >>> an - le, le += N - an) : (de |= I << le & 65535, le += N);
   }
   function u(I, B) {
-    const O = I * 2;
-    ue(B[O] & 65535, B[O + 1] & 65535);
+    const U = I * 2;
+    ue(B[U] & 65535, B[U + 1] & 65535);
   }
   function i(I, B) {
-    let O, N = -1, q, G = I[0 * 2 + 1], z = 0, be = 7, De = 4;
-    for (G === 0 && (be = 138, De = 3), O = 0; O <= B; O++)
-      if (q = G, G = I[(O + 1) * 2 + 1], !(++z < be && q == G)) {
+    let U, N = -1, q, V = I[0 * 2 + 1], z = 0, be = 7, De = 4;
+    for (V === 0 && (be = 138, De = 3), U = 0; U <= B; U++)
+      if (q = V, V = I[(U + 1) * 2 + 1], !(++z < be && q == V)) {
         if (z < De)
           do
-            u(q, K);
+            u(q, G);
           while (--z !== 0);
-        else q !== 0 ? (q != N && (u(q, K), z--), u(zn, K), ue(z - 3, 2)) : z <= 10 ? (u(Jn, K), ue(z - 3, 3)) : (u(Qn, K), ue(z - 11, 7));
-        z = 0, N = q, G === 0 ? (be = 138, De = 3) : q == G ? (be = 6, De = 3) : (be = 7, De = 4);
+        else q !== 0 ? (q != N && (u(q, G), z--), u(zn, G), ue(z - 3, 2)) : z <= 10 ? (u(Jn, G), ue(z - 3, 3)) : (u(Qn, G), ue(z - 11, 7));
+        z = 0, N = q, V === 0 ? (be = 138, De = 3) : q == V ? (be = 6, De = 3) : (be = 7, De = 4);
       }
   }
-  function o(I, B, O) {
+  function o(I, B, U) {
     let N;
-    for (ue(I - 257, 5), ue(B - 1, 5), ue(O - 4, 4), N = 0; N < O; N++)
-      ue(K[ie.bl_order[N] * 2 + 1], 3);
+    for (ue(I - 257, 5), ue(B - 1, 5), ue(U - 4, 4), N = 0; N < U; N++)
+      ue(G[se.bl_order[N] * 2 + 1], 3);
     i(H, I - 1), i(j, B - 1);
   }
   function p() {
     le == 16 ? (fe(de), de = 0, le = 0) : le >= 8 && (ge(de & 255), de >>>= 8, le -= 8);
   }
-  function E() {
+  function k() {
     ue(fn << 1, 3), u(_t, we.static_ltree), p(), 1 + Pe + 10 - le < 9 && (ue(fn << 1, 3), u(_t, we.static_ltree), p()), Pe = 7;
   }
-  function U(I, B) {
-    let O, N, q;
-    if (n.dist_buf[$] = I, n.lc_buf[$] = B & 255, $++, I === 0 ? H[B * 2]++ : (ee++, I--, H[(ie._length_code[B] + Gt + 1) * 2]++, j[ie.d_code(I) * 2]++), !($ & 8191) && S > 2) {
-      for (O = $ * 8, N = A - h, q = 0; q < kn; q++)
-        O += j[q * 2] * (5 + ie.extra_dbits[q]);
-      if (O >>>= 3, ee < Math.floor($ / 2) && O < Math.floor(N / 2))
+  function L(I, B) {
+    let U, N, q;
+    if (n.dist_buf[Y] = I, n.lc_buf[Y] = B & 255, Y++, I === 0 ? H[B * 2]++ : (ee++, I--, H[(se._length_code[B] + Gt + 1) * 2]++, j[se.d_code(I) * 2]++), !(Y & 8191) && E > 2) {
+      for (U = Y * 8, N = S - h, q = 0; q < En; q++)
+        U += j[q * 2] * (5 + se.extra_dbits[q]);
+      if (U >>>= 3, ee < Math.floor(Y / 2) && U < Math.floor(N / 2))
         return !0;
     }
-    return $ == J - 1;
+    return Y == J - 1;
   }
   function W(I, B) {
-    let O, N, q = 0, G, z;
-    if ($ !== 0)
+    let U, N, q = 0, V, z;
+    if (Y !== 0)
       do
-        O = n.dist_buf[q], N = n.lc_buf[q], q++, O === 0 ? u(N, I) : (G = ie._length_code[N], u(G + Gt + 1, I), z = ie.extra_lbits[G], z !== 0 && (N -= ie.base_length[G], ue(N, z)), O--, G = ie.d_code(O), u(G, B), z = ie.extra_dbits[G], z !== 0 && (O -= ie.base_dist[G], ue(O, z)));
-      while (q < $);
+        U = n.dist_buf[q], N = n.lc_buf[q], q++, U === 0 ? u(N, I) : (V = se._length_code[N], u(V + Gt + 1, I), z = se.extra_lbits[V], z !== 0 && (N -= se.base_length[V], ue(N, z)), U--, V = se.d_code(U), u(V, B), z = se.extra_dbits[V], z !== 0 && (U -= se.base_dist[V], ue(U, z)));
+      while (q < Y);
     u(_t, I), Pe = I[_t * 2 + 1];
   }
   function X() {
     le > 8 ? fe(de) : le > 0 && ge(de & 255), de = 0, le = 0;
   }
-  function ne(I, B, O) {
+  function re(I, B, U) {
     X(), Pe = 8, fe(B), fe(~B), n.pending_buf.set(f.subarray(I, I + B), n.pending), n.pending += B;
   }
-  function re(I, B, O) {
-    ue((no << 1) + (O ? 1 : 0), 3), ne(I, B);
+  function ie(I, B, U) {
+    ue((no << 1) + (U ? 1 : 0), 3), re(I, B);
   }
-  function pe(I, B, O) {
-    let N, q, G = 0;
-    S > 0 ? (V.build_tree(n), oe.build_tree(n), G = tt(), N = n.opt_len + 3 + 7 >>> 3, q = n.static_len + 3 + 7 >>> 3, q <= N && (N = q)) : N = q = B + 5, B + 4 <= N && I != -1 ? re(I, B, O) : q == N ? (ue((fn << 1) + (O ? 1 : 0), 3), W(we.static_ltree, we.static_dtree)) : (ue((ro << 1) + (O ? 1 : 0), 3), o(V.max_code + 1, oe.max_code + 1, G + 1), W(H, j)), qe(), O && X();
+  function pe(I, B, U) {
+    let N, q, V = 0;
+    E > 0 ? (K.build_tree(n), te.build_tree(n), V = tt(), N = n.opt_len + 3 + 7 >>> 3, q = n.static_len + 3 + 7 >>> 3, q <= N && (N = q)) : N = q = B + 5, B + 4 <= N && I != -1 ? ie(I, B, U) : q == N ? (ue((fn << 1) + (U ? 1 : 0), 3), W(we.static_ltree, we.static_dtree)) : (ue((ro << 1) + (U ? 1 : 0), 3), o(K.max_code + 1, te.max_code + 1, V + 1), W(H, j)), qe(), U && X();
   }
-  function te(I) {
-    pe(h >= 0 ? h : -1, A - h, I), h = A, t.flush_pending();
+  function ne(I) {
+    pe(h >= 0 ? h : -1, S - h, I), h = S, t.flush_pending();
   }
   function Ye() {
-    let I, B, O, N;
+    let I, B, U, N;
     do {
-      if (N = _ - F - A, N === 0 && A === 0 && F === 0)
+      if (N = _ - F - S, N === 0 && S === 0 && F === 0)
         N = a;
       else if (N == -1)
         N--;
-      else if (A >= a + a - Te) {
-        f.set(f.subarray(a, a + a), 0), R -= a, A -= a, h -= a, I = k, O = I;
+      else if (S >= a + a - Te) {
+        f.set(f.subarray(a, a + a), 0), R -= a, S -= a, h -= a, I = T, U = I;
         do
-          B = w[--O] & 65535, w[O] = B >= a ? B - a : 0;
+          B = w[--U] & 65535, w[U] = B >= a ? B - a : 0;
         while (--I !== 0);
-        I = a, O = I;
+        I = a, U = I;
         do
-          B = x[--O] & 65535, x[O] = B >= a ? B - a : 0;
+          B = x[--U] & 65535, x[U] = B >= a ? B - a : 0;
         while (--I !== 0);
         N += a;
       }
       if (t.avail_in === 0)
         return;
-      I = t.read_buf(f, A + F, N), F += I, F >= ae && (g = f[A] & 255, g = (g << d ^ f[A + 1] & 255) & m);
+      I = t.read_buf(f, S + F, N), F += I, F >= ae && (g = f[S] & 255, g = (g << d ^ f[S + 1] & 255) & m);
     } while (F < Te && t.avail_in !== 0);
   }
   function It(I) {
-    let B = 65535, O;
+    let B = 65535, U;
     for (B > r - 5 && (B = r - 5); ; ) {
       if (F <= 1) {
         if (Ye(), F === 0 && I == dt)
@@ -1989,35 +1989,35 @@ function io() {
         if (F === 0)
           break;
       }
-      if (A += F, F = 0, O = h + B, (A === 0 || A >= O) && (F = A - O, A = O, te(!1), t.avail_out === 0) || A - h >= a - Te && (te(!1), t.avail_out === 0))
+      if (S += F, F = 0, U = h + B, (S === 0 || S >= U) && (F = S - U, S = U, ne(!1), t.avail_out === 0) || S - h >= a - Te && (ne(!1), t.avail_out === 0))
         return Fe;
     }
-    return te(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
+    return ne(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
   }
   function gt(I) {
-    let B = C, O = A, N, q, G = b;
-    const z = A > a - Te ? A - (a - Te) : 0;
-    let be = Y;
-    const De = l, sn = A + Ht;
-    let Hn = f[O + G - 1], $n = f[O + G];
-    b >= L && (B >>= 2), be > F && (be = F);
+    let B = D, U = S, N, q, V = y;
+    const z = S > a - Te ? S - (a - Te) : 0;
+    let be = $;
+    const De = l, sn = S + Ht;
+    let Hn = f[U + V - 1], $n = f[U + V];
+    y >= O && (B >>= 2), be > F && (be = F);
     do
-      if (N = I, !(f[N + G] != $n || f[N + G - 1] != Hn || f[N] != f[O] || f[++N] != f[O + 1])) {
-        O += 2, N++;
+      if (N = I, !(f[N + V] != $n || f[N + V - 1] != Hn || f[N] != f[U] || f[++N] != f[U + 1])) {
+        U += 2, N++;
         do
           ;
-        while (f[++O] == f[++N] && f[++O] == f[++N] && f[++O] == f[++N] && f[++O] == f[++N] && f[++O] == f[++N] && f[++O] == f[++N] && f[++O] == f[++N] && f[++O] == f[++N] && O < sn);
-        if (q = Ht - (sn - O), O = sn - Ht, q > G) {
-          if (R = I, G = q, q >= be)
+        while (f[++U] == f[++N] && f[++U] == f[++N] && f[++U] == f[++N] && f[++U] == f[++N] && f[++U] == f[++N] && f[++U] == f[++N] && f[++U] == f[++N] && f[++U] == f[++N] && U < sn);
+        if (q = Ht - (sn - U), U = sn - Ht, q > V) {
+          if (R = I, V = q, q >= be)
             break;
-          Hn = f[O + G - 1], $n = f[O + G];
+          Hn = f[U + V - 1], $n = f[U + V];
         }
       }
     while ((I = x[I & De] & 65535) > z && --B !== 0);
-    return G <= F ? G : F;
+    return V <= F ? V : F;
   }
   function Qi(I) {
-    let B = 0, O;
+    let B = 0, U;
     for (; ; ) {
       if (F < Te) {
         if (Ye(), F < Te && I == dt)
@@ -2025,24 +2025,24 @@ function io() {
         if (F === 0)
           break;
       }
-      if (F >= ae && (g = (g << d ^ f[A + (ae - 1)] & 255) & m, B = w[g] & 65535, x[A & l] = w[g], w[g] = A), B !== 0 && (A - B & 65535) <= a - Te && M != Pt && (y = gt(B)), y >= ae)
-        if (O = U(A - R, y - ae), F -= y, y <= v && F >= ae) {
-          y--;
+      if (F >= ae && (g = (g << d ^ f[S + (ae - 1)] & 255) & m, B = w[g] & 65535, x[S & l] = w[g], w[g] = S), B !== 0 && (S - B & 65535) <= a - Te && M != Pt && (v = gt(B)), v >= ae)
+        if (U = L(S - R, v - ae), F -= v, v <= b && F >= ae) {
+          v--;
           do
-            A++, g = (g << d ^ f[A + (ae - 1)] & 255) & m, B = w[g] & 65535, x[A & l] = w[g], w[g] = A;
-          while (--y !== 0);
-          A++;
+            S++, g = (g << d ^ f[S + (ae - 1)] & 255) & m, B = w[g] & 65535, x[S & l] = w[g], w[g] = S;
+          while (--v !== 0);
+          S++;
         } else
-          A += y, y = 0, g = f[A] & 255, g = (g << d ^ f[A + 1] & 255) & m;
+          S += v, v = 0, g = f[S] & 255, g = (g << d ^ f[S + 1] & 255) & m;
       else
-        O = U(0, f[A] & 255), F--, A++;
-      if (O && (te(!1), t.avail_out === 0))
+        U = L(0, f[S] & 255), F--, S++;
+      if (U && (ne(!1), t.avail_out === 0))
         return Fe;
     }
-    return te(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
+    return ne(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
   }
   function es(I) {
-    let B = 0, O, N;
+    let B = 0, U, N;
     for (; ; ) {
       if (F < Te) {
         if (Ye(), F < Te && I == dt)
@@ -2050,57 +2050,57 @@ function io() {
         if (F === 0)
           break;
       }
-      if (F >= ae && (g = (g << d ^ f[A + (ae - 1)] & 255) & m, B = w[g] & 65535, x[A & l] = w[g], w[g] = A), b = y, T = R, y = ae - 1, B !== 0 && b < v && (A - B & 65535) <= a - Te && (M != Pt && (y = gt(B)), y <= 5 && (M == Ys || y == ae && A - R > 4096) && (y = ae - 1)), b >= ae && y <= b) {
-        N = A + F - ae, O = U(A - 1 - T, b - ae), F -= b - 1, b -= 2;
+      if (F >= ae && (g = (g << d ^ f[S + (ae - 1)] & 255) & m, B = w[g] & 65535, x[S & l] = w[g], w[g] = S), y = v, A = R, v = ae - 1, B !== 0 && y < b && (S - B & 65535) <= a - Te && (M != Pt && (v = gt(B)), v <= 5 && (M == Ys || v == ae && S - R > 4096) && (v = ae - 1)), y >= ae && v <= y) {
+        N = S + F - ae, U = L(S - 1 - A, y - ae), F -= y - 1, y -= 2;
         do
-          ++A <= N && (g = (g << d ^ f[A + (ae - 1)] & 255) & m, B = w[g] & 65535, x[A & l] = w[g], w[g] = A);
-        while (--b !== 0);
-        if (D = 0, y = ae - 1, A++, O && (te(!1), t.avail_out === 0))
+          ++S <= N && (g = (g << d ^ f[S + (ae - 1)] & 255) & m, B = w[g] & 65535, x[S & l] = w[g], w[g] = S);
+        while (--y !== 0);
+        if (P = 0, v = ae - 1, S++, U && (ne(!1), t.avail_out === 0))
           return Fe;
-      } else if (D !== 0) {
-        if (O = U(0, f[A - 1] & 255), O && te(!1), A++, F--, t.avail_out === 0)
+      } else if (P !== 0) {
+        if (U = L(0, f[S - 1] & 255), U && ne(!1), S++, F--, t.avail_out === 0)
           return Fe;
       } else
-        D = 1, A++, F--;
+        P = 1, S++, F--;
     }
-    return D !== 0 && (O = U(0, f[A - 1] & 255), D = 0), te(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
+    return P !== 0 && (U = L(0, f[S - 1] & 255), P = 0), ne(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
   }
   function ts(I) {
     return I.total_in = I.total_out = 0, I.msg = null, n.pending = 0, n.pending_out = 0, e = Bt, s = dt, at(), wt(), Ue;
   }
-  n.deflateInit = function(I, B, O, N, q, G) {
-    return N || (N = ln), q || (q = eo), G || (G = Zs), I.msg = null, B == Kt && (B = 6), q < 1 || q > Qs || N != ln || O < 9 || O > 15 || B < 0 || B > 9 || G < 0 || G > Pt ? Oe : (I.dstate = n, c = O, a = 1 << c, l = a - 1, P = q + 7, k = 1 << P, m = k - 1, d = Math.floor((P + ae - 1) / ae), f = new Uint8Array(a * 2), x = [], w = [], J = 1 << q + 6, n.pending_buf = new Uint8Array(J * 4), r = J * 4, n.dist_buf = new Uint16Array(J), n.lc_buf = new Uint8Array(J), S = B, M = G, ts(I));
+  n.deflateInit = function(I, B, U, N, q, V) {
+    return N || (N = ln), q || (q = eo), V || (V = Zs), I.msg = null, B == Kt && (B = 6), q < 1 || q > Qs || N != ln || U < 9 || U > 15 || B < 0 || B > 9 || V < 0 || V > Pt ? Oe : (I.dstate = n, c = U, a = 1 << c, l = a - 1, C = q + 7, T = 1 << C, m = T - 1, d = Math.floor((C + ae - 1) / ae), f = new Uint8Array(a * 2), x = [], w = [], J = 1 << q + 6, n.pending_buf = new Uint8Array(J * 4), r = J * 4, n.dist_buf = new Uint16Array(J), n.lc_buf = new Uint8Array(J), E = B, M = V, ts(I));
   }, n.deflateEnd = function() {
     return e != cn && e != Bt && e != bt ? Oe : (n.lc_buf = null, n.dist_buf = null, n.pending_buf = null, w = null, x = null, f = null, n.dstate = null, e == Bt ? Gs : Ue);
-  }, n.deflateParams = function(I, B, O) {
+  }, n.deflateParams = function(I, B, U) {
     let N = Ue;
-    return B == Kt && (B = 6), B < 0 || B > 9 || O < 0 || O > Pt ? Oe : (Le[S].func != Le[B].func && I.total_in !== 0 && (N = I.deflate(er)), S != B && (S = B, v = Le[S].max_lazy, L = Le[S].good_length, Y = Le[S].nice_length, C = Le[S].max_chain), M = O, N);
-  }, n.deflateSetDictionary = function(I, B, O) {
-    let N = O, q, G = 0;
+    return B == Kt && (B = 6), B < 0 || B > 9 || U < 0 || U > Pt ? Oe : (Le[E].func != Le[B].func && I.total_in !== 0 && (N = I.deflate(er)), E != B && (E = B, b = Le[E].max_lazy, O = Le[E].good_length, $ = Le[E].nice_length, D = Le[E].max_chain), M = U, N);
+  }, n.deflateSetDictionary = function(I, B, U) {
+    let N = U, q, V = 0;
     if (!B || e != cn)
       return Oe;
     if (N < ae)
       return Ue;
-    for (N > a - Te && (N = a - Te, G = O - N), f.set(B.subarray(G, G + N), 0), A = N, h = N, g = f[0] & 255, g = (g << d ^ f[1] & 255) & m, q = 0; q <= N - ae; q++)
+    for (N > a - Te && (N = a - Te, V = U - N), f.set(B.subarray(V, V + N), 0), S = N, h = N, g = f[0] & 255, g = (g << d ^ f[1] & 255) & m, q = 0; q <= N - ae; q++)
       g = (g << d ^ f[q + (ae - 1)] & 255) & m, x[q & l] = w[g], w[g] = q;
     return Ue;
   }, n.deflate = function(I, B) {
-    let O, N, q, G, z;
+    let U, N, q, V, z;
     if (B > Se || B < 0)
       return Oe;
     if (!I.next_out || !I.next_in && I.avail_in !== 0 || e == bt && B != Se)
       return I.msg = Lt[Dt - Oe], Oe;
     if (I.avail_out === 0)
       return I.msg = Lt[Dt - lt], lt;
-    if (t = I, G = s, s = B, e == cn && (N = ln + (c - 8 << 4) << 8, q = (S - 1 & 255) >> 1, q > 3 && (q = 3), N |= q << 6, A !== 0 && (N |= to), N += 31 - N % 31, e = Bt, je(N)), n.pending !== 0) {
+    if (t = I, V = s, s = B, e == cn && (N = ln + (c - 8 << 4) << 8, q = (E - 1 & 255) >> 1, q > 3 && (q = 3), N |= q << 6, S !== 0 && (N |= to), N += 31 - N % 31, e = Bt, je(N)), n.pending !== 0) {
       if (t.flush_pending(), t.avail_out === 0)
         return s = -1, Ue;
-    } else if (t.avail_in === 0 && B <= G && B != Se)
+    } else if (t.avail_in === 0 && B <= V && B != Se)
       return t.msg = Lt[Dt - lt], lt;
     if (e == bt && t.avail_in !== 0)
       return I.msg = Lt[Dt - lt], lt;
     if (t.avail_in !== 0 || F !== 0 || B != dt && e != bt) {
-      switch (z = -1, Le[S].func) {
+      switch (z = -1, Le[E].func) {
         case ui:
           z = It(B);
           break;
@@ -2115,10 +2115,10 @@ function io() {
         return t.avail_out === 0 && (s = -1), Ue;
       if (z == Ut) {
         if (B == er)
-          E();
-        else if (re(0, 0, !1), B == Vs)
-          for (O = 0; O < k; O++)
-            w[O] = 0;
+          k();
+        else if (ie(0, 0, !1), B == Vs)
+          for (U = 0; U < T; U++)
+            w[U] = 0;
         if (t.flush_pending(), t.avail_out === 0)
           return s = -1, Ue;
       }
@@ -2178,18 +2178,18 @@ function so(n) {
   const t = this, e = new di(), r = oo(n && n.chunkSize ? n.chunkSize : 64 * 1024), s = dt, a = new Uint8Array(r);
   let c = n ? n.level : Kt;
   typeof c > "u" && (c = Kt), e.deflateInit(c), e.next_out = a, t.append = function(l, f) {
-    let _, x, w = 0, g = 0, k = 0;
-    const P = [];
+    let _, x, w = 0, g = 0, T = 0;
+    const C = [];
     if (l.length) {
       e.next_in_index = 0, e.next_in = l, e.avail_in = l.length;
       do {
         if (e.next_out_index = 0, e.avail_out = r, _ = e.deflate(s), _ != Ue)
           throw new Error("deflating: " + e.msg);
-        e.next_out_index && (e.next_out_index == r ? P.push(new Uint8Array(a)) : P.push(a.subarray(0, e.next_out_index))), k += e.next_out_index, f && e.next_in_index > 0 && e.next_in_index != w && (f(e.next_in_index), w = e.next_in_index);
+        e.next_out_index && (e.next_out_index == r ? C.push(new Uint8Array(a)) : C.push(a.subarray(0, e.next_out_index))), T += e.next_out_index, f && e.next_in_index > 0 && e.next_in_index != w && (f(e.next_in_index), w = e.next_in_index);
       } while (e.avail_in > 0 || e.avail_out === 0);
-      return P.length > 1 ? (x = new Uint8Array(k), P.forEach(function(m) {
+      return C.length > 1 ? (x = new Uint8Array(T), C.forEach(function(m) {
         x.set(m, g), g += m.length;
-      })) : x = P[0] ? new Uint8Array(P[0]) : new Uint8Array(), x;
+      })) : x = C[0] ? new Uint8Array(C[0]) : new Uint8Array(), x;
     }
   }, t.flush = function() {
     let l, f, _ = 0, x = 0;
@@ -2207,7 +2207,7 @@ function so(n) {
 function oo(n) {
   return n + 5 * (Math.floor(n / 16383) + 1);
 }
-const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, se = -3, rr = -4, $e = -5, Re = [
+const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, oe = -3, rr = -4, $e = -5, Re = [
   0,
   1,
   3,
@@ -3994,54 +3994,54 @@ const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, se = -3, rr = -4, $e = -5, Re = [
 function An() {
   const n = this;
   let t, e, r, s, a, c;
-  function l(_, x, w, g, k, P, m, d, h, y, T) {
-    let D, A, R, F, b, C, v, S, M, L, Y, H, j, K, V;
-    L = 0, b = w;
+  function l(_, x, w, g, T, C, m, d, h, v, A) {
+    let P, S, R, F, y, D, b, E, M, O, $, H, j, G, K;
+    O = 0, y = w;
     do
-      r[_[x + L]]++, L++, b--;
-    while (b !== 0);
+      r[_[x + O]]++, O++, y--;
+    while (y !== 0);
     if (r[0] == w)
       return m[0] = -1, d[0] = 0, Q;
-    for (S = d[0], C = 1; C <= Ze && r[C] === 0; C++)
+    for (E = d[0], D = 1; D <= Ze && r[D] === 0; D++)
       ;
-    for (v = C, S < C && (S = C), b = Ze; b !== 0 && r[b] === 0; b--)
+    for (b = D, E < D && (E = D), y = Ze; y !== 0 && r[y] === 0; y--)
       ;
-    for (R = b, S > b && (S = b), d[0] = S, K = 1 << C; C < b; C++, K <<= 1)
-      if ((K -= r[C]) < 0)
-        return se;
-    if ((K -= r[b]) < 0)
-      return se;
-    for (r[b] += K, c[1] = C = 0, L = 1, j = 2; --b !== 0; )
-      c[j] = C += r[L], j++, L++;
-    b = 0, L = 0;
+    for (R = y, E > y && (E = y), d[0] = E, G = 1 << D; D < y; D++, G <<= 1)
+      if ((G -= r[D]) < 0)
+        return oe;
+    if ((G -= r[y]) < 0)
+      return oe;
+    for (r[y] += G, c[1] = D = 0, O = 1, j = 2; --y !== 0; )
+      c[j] = D += r[O], j++, O++;
+    y = 0, O = 0;
     do
-      (C = _[x + L]) !== 0 && (T[c[C]++] = b), L++;
-    while (++b < w);
-    for (w = c[R], c[0] = b = 0, L = 0, F = -1, H = -S, a[0] = 0, Y = 0, V = 0; v <= R; v++)
-      for (D = r[v]; D-- !== 0; ) {
-        for (; v > H + S; ) {
-          if (F++, H += S, V = R - H, V = V > S ? S : V, (A = 1 << (C = v - H)) > D + 1 && (A -= D + 1, j = v, C < V))
-            for (; ++C < V && !((A <<= 1) <= r[++j]); )
-              A -= r[j];
-          if (V = 1 << C, y[0] + V > pi)
-            return se;
-          a[F] = Y = /* hp+ */
-          y[0], y[0] += V, F !== 0 ? (c[F] = b, s[0] = /* (byte) */
-          C, s[1] = /* (byte) */
-          S, C = b >>> H - S, s[2] = /* (int) */
-          Y - a[F - 1] - C, h.set(s, (a[F - 1] + C) * 3)) : m[0] = Y;
+      (D = _[x + O]) !== 0 && (A[c[D]++] = y), O++;
+    while (++y < w);
+    for (w = c[R], c[0] = y = 0, O = 0, F = -1, H = -E, a[0] = 0, $ = 0, K = 0; b <= R; b++)
+      for (P = r[b]; P-- !== 0; ) {
+        for (; b > H + E; ) {
+          if (F++, H += E, K = R - H, K = K > E ? E : K, (S = 1 << (D = b - H)) > P + 1 && (S -= P + 1, j = b, D < K))
+            for (; ++D < K && !((S <<= 1) <= r[++j]); )
+              S -= r[j];
+          if (K = 1 << D, v[0] + K > pi)
+            return oe;
+          a[F] = $ = /* hp+ */
+          v[0], v[0] += K, F !== 0 ? (c[F] = y, s[0] = /* (byte) */
+          D, s[1] = /* (byte) */
+          E, D = y >>> H - E, s[2] = /* (int) */
+          $ - a[F - 1] - D, h.set(s, (a[F - 1] + D) * 3)) : m[0] = $;
         }
         for (s[1] = /* (byte) */
-        v - H, L >= w ? s[0] = 192 : T[L] < g ? (s[0] = /* (byte) */
-        T[L] < 256 ? 0 : 96, s[2] = T[L++]) : (s[0] = /* (byte) */
-        P[T[L] - g] + 16 + 64, s[2] = k[T[L++] - g]), A = 1 << v - H, C = b >>> H; C < V; C += A)
-          h.set(s, (Y + C) * 3);
-        for (C = 1 << v - 1; b & C; C >>>= 1)
-          b ^= C;
-        for (b ^= C, M = (1 << H) - 1; (b & M) != c[F]; )
-          F--, H -= S, M = (1 << H) - 1;
+        b - H, O >= w ? s[0] = 192 : A[O] < g ? (s[0] = /* (byte) */
+        A[O] < 256 ? 0 : 96, s[2] = A[O++]) : (s[0] = /* (byte) */
+        C[A[O] - g] + 16 + 64, s[2] = T[A[O++] - g]), S = 1 << b - H, D = y >>> H; D < K; D += S)
+          h.set(s, ($ + D) * 3);
+        for (D = 1 << b - 1; y & D; D >>>= 1)
+          y ^= D;
+        for (y ^= D, M = (1 << H) - 1; (y & M) != c[F]; )
+          F--, H -= E, M = (1 << H) - 1;
       }
-    return K !== 0 && R != 1 ? $e : Q;
+    return G !== 0 && R != 1 ? $e : Q;
   }
   function f(_) {
     let x;
@@ -4053,12 +4053,12 @@ function An() {
       s[x] = 0;
     a.set(r.subarray(0, Ze), 0), c.set(r.subarray(0, Ze + 1), 0);
   }
-  n.inflate_trees_bits = function(_, x, w, g, k) {
-    let P;
-    return f(19), t[0] = 0, P = l(_, 0, 19, 19, null, null, w, x, g, t, e), P == se ? k.msg = "oversubscribed dynamic bit lengths tree" : (P == $e || x[0] === 0) && (k.msg = "incomplete dynamic bit lengths tree", P = se), P;
-  }, n.inflate_trees_dynamic = function(_, x, w, g, k, P, m, d, h) {
-    let y;
-    return f(288), t[0] = 0, y = l(w, 0, _, 257, xo, wo, P, g, d, t, e), y != Q || g[0] === 0 ? (y == se ? h.msg = "oversubscribed literal/length tree" : y != rr && (h.msg = "incomplete literal/length tree", y = se), y) : (f(288), y = l(w, _, x, 0, go, _o, m, k, d, t, e), y != Q || k[0] === 0 && _ > 257 ? (y == se ? h.msg = "oversubscribed distance tree" : y == $e ? (h.msg = "incomplete distance tree", y = se) : y != rr && (h.msg = "empty distance tree with lengths", y = se), y) : Q);
+  n.inflate_trees_bits = function(_, x, w, g, T) {
+    let C;
+    return f(19), t[0] = 0, C = l(_, 0, 19, 19, null, null, w, x, g, t, e), C == oe ? T.msg = "oversubscribed dynamic bit lengths tree" : (C == $e || x[0] === 0) && (T.msg = "incomplete dynamic bit lengths tree", C = oe), C;
+  }, n.inflate_trees_dynamic = function(_, x, w, g, T, C, m, d, h) {
+    let v;
+    return f(288), t[0] = 0, v = l(w, 0, _, 257, xo, wo, C, g, d, t, e), v != Q || g[0] === 0 ? (v == oe ? h.msg = "oversubscribed literal/length tree" : v != rr && (h.msg = "incomplete literal/length tree", v = oe), v) : (f(288), v = l(w, _, x, 0, go, _o, m, T, d, t, e), v != Q || T[0] === 0 && _ > 257 ? (v == oe ? h.msg = "oversubscribed distance tree" : v == $e ? (h.msg = "incomplete distance tree", v = oe) : v != rr && (h.msg = "empty distance tree with lengths", v = oe), v) : Q);
   };
 }
 An.inflate_trees_fixed = function(n, t, e, r) {
@@ -4067,170 +4067,170 @@ An.inflate_trees_fixed = function(n, t, e, r) {
 const Wt = 0, ir = 1, sr = 2, or = 3, ar = 4, cr = 5, lr = 6, un = 7, fr = 8, Mt = 9;
 function yo() {
   const n = this;
-  let t, e = 0, r, s = 0, a = 0, c = 0, l = 0, f = 0, _ = 0, x = 0, w, g = 0, k, P = 0;
-  function m(d, h, y, T, D, A, R, F) {
-    let b, C, v, S, M, L, Y, H, j, K, V, oe, Z, J, $, ee;
-    Y = F.next_in_index, H = F.avail_in, M = R.bitb, L = R.bitk, j = R.write, K = j < R.read ? R.read - j - 1 : R.end - j, V = Re[d], oe = Re[h];
+  let t, e = 0, r, s = 0, a = 0, c = 0, l = 0, f = 0, _ = 0, x = 0, w, g = 0, T, C = 0;
+  function m(d, h, v, A, P, S, R, F) {
+    let y, D, b, E, M, O, $, H, j, G, K, te, Z, J, Y, ee;
+    $ = F.next_in_index, H = F.avail_in, M = R.bitb, O = R.bitk, j = R.write, G = j < R.read ? R.read - j - 1 : R.end - j, K = Re[d], te = Re[h];
     do {
-      for (; L < 20; )
-        H--, M |= (F.read_byte(Y++) & 255) << L, L += 8;
-      if (b = M & V, C = y, v = T, ee = (v + b) * 3, (S = C[ee]) === 0) {
-        M >>= C[ee + 1], L -= C[ee + 1], R.win[j++] = /* (byte) */
-        C[ee + 2], K--;
+      for (; O < 20; )
+        H--, M |= (F.read_byte($++) & 255) << O, O += 8;
+      if (y = M & K, D = v, b = A, ee = (b + y) * 3, (E = D[ee]) === 0) {
+        M >>= D[ee + 1], O -= D[ee + 1], R.win[j++] = /* (byte) */
+        D[ee + 2], G--;
         continue;
       }
       do {
-        if (M >>= C[ee + 1], L -= C[ee + 1], S & 16) {
-          for (S &= 15, Z = C[ee + 2] + /* (int) */
-          (M & Re[S]), M >>= S, L -= S; L < 15; )
-            H--, M |= (F.read_byte(Y++) & 255) << L, L += 8;
-          b = M & oe, C = D, v = A, ee = (v + b) * 3, S = C[ee];
+        if (M >>= D[ee + 1], O -= D[ee + 1], E & 16) {
+          for (E &= 15, Z = D[ee + 2] + /* (int) */
+          (M & Re[E]), M >>= E, O -= E; O < 15; )
+            H--, M |= (F.read_byte($++) & 255) << O, O += 8;
+          y = M & te, D = P, b = S, ee = (b + y) * 3, E = D[ee];
           do
-            if (M >>= C[ee + 1], L -= C[ee + 1], S & 16) {
-              for (S &= 15; L < S; )
-                H--, M |= (F.read_byte(Y++) & 255) << L, L += 8;
-              if (J = C[ee + 2] + (M & Re[S]), M >>= S, L -= S, K -= Z, j >= J)
-                $ = j - J, j - $ > 0 && 2 > j - $ ? (R.win[j++] = R.win[$++], R.win[j++] = R.win[$++], Z -= 2) : (R.win.set(R.win.subarray($, $ + 2), j), j += 2, $ += 2, Z -= 2);
+            if (M >>= D[ee + 1], O -= D[ee + 1], E & 16) {
+              for (E &= 15; O < E; )
+                H--, M |= (F.read_byte($++) & 255) << O, O += 8;
+              if (J = D[ee + 2] + (M & Re[E]), M >>= E, O -= E, G -= Z, j >= J)
+                Y = j - J, j - Y > 0 && 2 > j - Y ? (R.win[j++] = R.win[Y++], R.win[j++] = R.win[Y++], Z -= 2) : (R.win.set(R.win.subarray(Y, Y + 2), j), j += 2, Y += 2, Z -= 2);
               else {
-                $ = j - J;
+                Y = j - J;
                 do
-                  $ += R.end;
-                while ($ < 0);
-                if (S = R.end - $, Z > S) {
-                  if (Z -= S, j - $ > 0 && S > j - $)
+                  Y += R.end;
+                while (Y < 0);
+                if (E = R.end - Y, Z > E) {
+                  if (Z -= E, j - Y > 0 && E > j - Y)
                     do
-                      R.win[j++] = R.win[$++];
-                    while (--S !== 0);
+                      R.win[j++] = R.win[Y++];
+                    while (--E !== 0);
                   else
-                    R.win.set(R.win.subarray($, $ + S), j), j += S, $ += S, S = 0;
-                  $ = 0;
+                    R.win.set(R.win.subarray(Y, Y + E), j), j += E, Y += E, E = 0;
+                  Y = 0;
                 }
               }
-              if (j - $ > 0 && Z > j - $)
+              if (j - Y > 0 && Z > j - Y)
                 do
-                  R.win[j++] = R.win[$++];
+                  R.win[j++] = R.win[Y++];
                 while (--Z !== 0);
               else
-                R.win.set(R.win.subarray($, $ + Z), j), j += Z, $ += Z, Z = 0;
+                R.win.set(R.win.subarray(Y, Y + Z), j), j += Z, Y += Z, Z = 0;
               break;
-            } else if (!(S & 64))
-              b += C[ee + 2], b += M & Re[S], ee = (v + b) * 3, S = C[ee];
+            } else if (!(E & 64))
+              y += D[ee + 2], y += M & Re[E], ee = (b + y) * 3, E = D[ee];
             else
-              return F.msg = "invalid distance code", Z = F.avail_in - H, Z = L >> 3 < Z ? L >> 3 : Z, H += Z, Y -= Z, L -= Z << 3, R.bitb = M, R.bitk = L, F.avail_in = H, F.total_in += Y - F.next_in_index, F.next_in_index = Y, R.write = j, se;
+              return F.msg = "invalid distance code", Z = F.avail_in - H, Z = O >> 3 < Z ? O >> 3 : Z, H += Z, $ -= Z, O -= Z << 3, R.bitb = M, R.bitk = O, F.avail_in = H, F.total_in += $ - F.next_in_index, F.next_in_index = $, R.write = j, oe;
           while (!0);
           break;
         }
-        if (S & 64)
-          return S & 32 ? (Z = F.avail_in - H, Z = L >> 3 < Z ? L >> 3 : Z, H += Z, Y -= Z, L -= Z << 3, R.bitb = M, R.bitk = L, F.avail_in = H, F.total_in += Y - F.next_in_index, F.next_in_index = Y, R.write = j, He) : (F.msg = "invalid literal/length code", Z = F.avail_in - H, Z = L >> 3 < Z ? L >> 3 : Z, H += Z, Y -= Z, L -= Z << 3, R.bitb = M, R.bitk = L, F.avail_in = H, F.total_in += Y - F.next_in_index, F.next_in_index = Y, R.write = j, se);
-        if (b += C[ee + 2], b += M & Re[S], ee = (v + b) * 3, (S = C[ee]) === 0) {
-          M >>= C[ee + 1], L -= C[ee + 1], R.win[j++] = /* (byte) */
-          C[ee + 2], K--;
+        if (E & 64)
+          return E & 32 ? (Z = F.avail_in - H, Z = O >> 3 < Z ? O >> 3 : Z, H += Z, $ -= Z, O -= Z << 3, R.bitb = M, R.bitk = O, F.avail_in = H, F.total_in += $ - F.next_in_index, F.next_in_index = $, R.write = j, He) : (F.msg = "invalid literal/length code", Z = F.avail_in - H, Z = O >> 3 < Z ? O >> 3 : Z, H += Z, $ -= Z, O -= Z << 3, R.bitb = M, R.bitk = O, F.avail_in = H, F.total_in += $ - F.next_in_index, F.next_in_index = $, R.write = j, oe);
+        if (y += D[ee + 2], y += M & Re[E], ee = (b + y) * 3, (E = D[ee]) === 0) {
+          M >>= D[ee + 1], O -= D[ee + 1], R.win[j++] = /* (byte) */
+          D[ee + 2], G--;
           break;
         }
       } while (!0);
-    } while (K >= 258 && H >= 10);
-    return Z = F.avail_in - H, Z = L >> 3 < Z ? L >> 3 : Z, H += Z, Y -= Z, L -= Z << 3, R.bitb = M, R.bitk = L, F.avail_in = H, F.total_in += Y - F.next_in_index, F.next_in_index = Y, R.write = j, Q;
+    } while (G >= 258 && H >= 10);
+    return Z = F.avail_in - H, Z = O >> 3 < Z ? O >> 3 : Z, H += Z, $ -= Z, O -= Z << 3, R.bitb = M, R.bitk = O, F.avail_in = H, F.total_in += $ - F.next_in_index, F.next_in_index = $, R.write = j, Q;
   }
-  n.init = function(d, h, y, T, D, A) {
+  n.init = function(d, h, v, A, P, S) {
     t = Wt, _ = /* (byte) */
     d, x = /* (byte) */
-    h, w = y, g = T, k = D, P = A, r = null;
-  }, n.proc = function(d, h, y) {
-    let T, D, A, R = 0, F = 0, b = 0, C, v, S, M;
-    for (b = h.next_in_index, C = h.avail_in, R = d.bitb, F = d.bitk, v = d.write, S = v < d.read ? d.read - v - 1 : d.end - v; ; )
+    h, w = v, g = A, T = P, C = S, r = null;
+  }, n.proc = function(d, h, v) {
+    let A, P, S, R = 0, F = 0, y = 0, D, b, E, M;
+    for (y = h.next_in_index, D = h.avail_in, R = d.bitb, F = d.bitk, b = d.write, E = b < d.read ? d.read - b - 1 : d.end - b; ; )
       switch (t) {
         case Wt:
-          if (S >= 258 && C >= 10 && (d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, y = m(_, x, w, g, k, P, d, h), b = h.next_in_index, C = h.avail_in, R = d.bitb, F = d.bitk, v = d.write, S = v < d.read ? d.read - v - 1 : d.end - v, y != Q)) {
-            t = y == He ? un : Mt;
+          if (E >= 258 && D >= 10 && (d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, v = m(_, x, w, g, T, C, d, h), y = h.next_in_index, D = h.avail_in, R = d.bitb, F = d.bitk, b = d.write, E = b < d.read ? d.read - b - 1 : d.end - b, v != Q)) {
+            t = v == He ? un : Mt;
             break;
           }
           a = _, r = w, s = g, t = ir;
         case ir:
-          for (T = a; F < T; ) {
-            if (C !== 0)
-              y = Q;
+          for (A = a; F < A; ) {
+            if (D !== 0)
+              v = Q;
             else
-              return d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
-            C--, R |= (h.read_byte(b++) & 255) << F, F += 8;
+              return d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
+            D--, R |= (h.read_byte(y++) & 255) << F, F += 8;
           }
-          if (D = (s + (R & Re[T])) * 3, R >>>= r[D + 1], F -= r[D + 1], A = r[D], A === 0) {
-            c = r[D + 2], t = lr;
+          if (P = (s + (R & Re[A])) * 3, R >>>= r[P + 1], F -= r[P + 1], S = r[P], S === 0) {
+            c = r[P + 2], t = lr;
             break;
           }
-          if (A & 16) {
-            l = A & 15, e = r[D + 2], t = sr;
+          if (S & 16) {
+            l = S & 15, e = r[P + 2], t = sr;
             break;
           }
-          if (!(A & 64)) {
-            a = A, s = D / 3 + r[D + 2];
+          if (!(S & 64)) {
+            a = S, s = P / 3 + r[P + 2];
             break;
           }
-          if (A & 32) {
+          if (S & 32) {
             t = un;
             break;
           }
-          return t = Mt, h.msg = "invalid literal/length code", y = se, d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
+          return t = Mt, h.msg = "invalid literal/length code", v = oe, d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
         case sr:
-          for (T = l; F < T; ) {
-            if (C !== 0)
-              y = Q;
+          for (A = l; F < A; ) {
+            if (D !== 0)
+              v = Q;
             else
-              return d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
-            C--, R |= (h.read_byte(b++) & 255) << F, F += 8;
+              return d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
+            D--, R |= (h.read_byte(y++) & 255) << F, F += 8;
           }
-          e += R & Re[T], R >>= T, F -= T, a = x, r = k, s = P, t = or;
+          e += R & Re[A], R >>= A, F -= A, a = x, r = T, s = C, t = or;
         case or:
-          for (T = a; F < T; ) {
-            if (C !== 0)
-              y = Q;
+          for (A = a; F < A; ) {
+            if (D !== 0)
+              v = Q;
             else
-              return d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
-            C--, R |= (h.read_byte(b++) & 255) << F, F += 8;
+              return d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
+            D--, R |= (h.read_byte(y++) & 255) << F, F += 8;
           }
-          if (D = (s + (R & Re[T])) * 3, R >>= r[D + 1], F -= r[D + 1], A = r[D], A & 16) {
-            l = A & 15, f = r[D + 2], t = ar;
+          if (P = (s + (R & Re[A])) * 3, R >>= r[P + 1], F -= r[P + 1], S = r[P], S & 16) {
+            l = S & 15, f = r[P + 2], t = ar;
             break;
           }
-          if (!(A & 64)) {
-            a = A, s = D / 3 + r[D + 2];
+          if (!(S & 64)) {
+            a = S, s = P / 3 + r[P + 2];
             break;
           }
-          return t = Mt, h.msg = "invalid distance code", y = se, d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
+          return t = Mt, h.msg = "invalid distance code", v = oe, d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
         case ar:
-          for (T = l; F < T; ) {
-            if (C !== 0)
-              y = Q;
+          for (A = l; F < A; ) {
+            if (D !== 0)
+              v = Q;
             else
-              return d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
-            C--, R |= (h.read_byte(b++) & 255) << F, F += 8;
+              return d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
+            D--, R |= (h.read_byte(y++) & 255) << F, F += 8;
           }
-          f += R & Re[T], R >>= T, F -= T, t = cr;
+          f += R & Re[A], R >>= A, F -= A, t = cr;
         case cr:
-          for (M = v - f; M < 0; )
+          for (M = b - f; M < 0; )
             M += d.end;
           for (; e !== 0; ) {
-            if (S === 0 && (v == d.end && d.read !== 0 && (v = 0, S = v < d.read ? d.read - v - 1 : d.end - v), S === 0 && (d.write = v, y = d.inflate_flush(h, y), v = d.write, S = v < d.read ? d.read - v - 1 : d.end - v, v == d.end && d.read !== 0 && (v = 0, S = v < d.read ? d.read - v - 1 : d.end - v), S === 0)))
-              return d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
-            d.win[v++] = d.win[M++], S--, M == d.end && (M = 0), e--;
+            if (E === 0 && (b == d.end && d.read !== 0 && (b = 0, E = b < d.read ? d.read - b - 1 : d.end - b), E === 0 && (d.write = b, v = d.inflate_flush(h, v), b = d.write, E = b < d.read ? d.read - b - 1 : d.end - b, b == d.end && d.read !== 0 && (b = 0, E = b < d.read ? d.read - b - 1 : d.end - b), E === 0)))
+              return d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
+            d.win[b++] = d.win[M++], E--, M == d.end && (M = 0), e--;
           }
           t = Wt;
           break;
         case lr:
-          if (S === 0 && (v == d.end && d.read !== 0 && (v = 0, S = v < d.read ? d.read - v - 1 : d.end - v), S === 0 && (d.write = v, y = d.inflate_flush(h, y), v = d.write, S = v < d.read ? d.read - v - 1 : d.end - v, v == d.end && d.read !== 0 && (v = 0, S = v < d.read ? d.read - v - 1 : d.end - v), S === 0)))
-            return d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
-          y = Q, d.win[v++] = /* (byte) */
-          c, S--, t = Wt;
+          if (E === 0 && (b == d.end && d.read !== 0 && (b = 0, E = b < d.read ? d.read - b - 1 : d.end - b), E === 0 && (d.write = b, v = d.inflate_flush(h, v), b = d.write, E = b < d.read ? d.read - b - 1 : d.end - b, b == d.end && d.read !== 0 && (b = 0, E = b < d.read ? d.read - b - 1 : d.end - b), E === 0)))
+            return d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
+          v = Q, d.win[b++] = /* (byte) */
+          c, E--, t = Wt;
           break;
         case un:
-          if (F > 7 && (F -= 8, C++, b--), d.write = v, y = d.inflate_flush(h, y), v = d.write, S = v < d.read ? d.read - v - 1 : d.end - v, d.read != d.write)
-            return d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
+          if (F > 7 && (F -= 8, D++, y--), d.write = b, v = d.inflate_flush(h, v), b = d.write, E = b < d.read ? d.read - b - 1 : d.end - b, d.read != d.write)
+            return d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
           t = fr;
         case fr:
-          return y = He, d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
+          return v = He, d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
         case Mt:
-          return y = se, d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
+          return v = oe, d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
         default:
-          return y = Ae, d.bitb = R, d.bitk = F, h.avail_in = C, h.total_in += b - h.next_in_index, h.next_in_index = b, d.write = v, d.inflate_flush(h, y);
+          return v = Ae, d.bitb = R, d.bitk = F, h.avail_in = D, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = b, d.inflate_flush(h, v);
       }
   }, n.free = function() {
   };
@@ -4262,132 +4262,132 @@ function bo(n, t) {
   let r = ft, s = 0, a = 0, c = 0, l;
   const f = [0], _ = [0], x = new yo();
   let w = 0, g = new Int32Array(pi * 3);
-  const k = 0, P = new An();
+  const T = 0, C = new An();
   e.bitk = 0, e.bitb = 0, e.win = new Uint8Array(t), e.end = t, e.read = 0, e.write = 0, e.reset = function(m, d) {
-    d && (d[0] = k), r == Nt && x.free(m), r = ft, e.bitk = 0, e.bitb = 0, e.read = e.write = 0;
+    d && (d[0] = T), r == Nt && x.free(m), r = ft, e.bitk = 0, e.bitb = 0, e.read = e.write = 0;
   }, e.reset(n, null), e.inflate_flush = function(m, d) {
-    let h, y, T;
-    return y = m.next_out_index, T = e.read, h = /* (int) */
-    (T <= e.write ? e.write : e.end) - T, h > m.avail_out && (h = m.avail_out), h !== 0 && d == $e && (d = Q), m.avail_out -= h, m.total_out += h, m.next_out.set(e.win.subarray(T, T + h), y), y += h, T += h, T == e.end && (T = 0, e.write == e.end && (e.write = 0), h = e.write - T, h > m.avail_out && (h = m.avail_out), h !== 0 && d == $e && (d = Q), m.avail_out -= h, m.total_out += h, m.next_out.set(e.win.subarray(T, T + h), y), y += h, T += h), m.next_out_index = y, e.read = T, d;
+    let h, v, A;
+    return v = m.next_out_index, A = e.read, h = /* (int) */
+    (A <= e.write ? e.write : e.end) - A, h > m.avail_out && (h = m.avail_out), h !== 0 && d == $e && (d = Q), m.avail_out -= h, m.total_out += h, m.next_out.set(e.win.subarray(A, A + h), v), v += h, A += h, A == e.end && (A = 0, e.write == e.end && (e.write = 0), h = e.write - A, h > m.avail_out && (h = m.avail_out), h !== 0 && d == $e && (d = Q), m.avail_out -= h, m.total_out += h, m.next_out.set(e.win.subarray(A, A + h), v), v += h, A += h), m.next_out_index = v, e.read = A, d;
   }, e.proc = function(m, d) {
-    let h, y, T, D, A, R, F, b;
-    for (D = m.next_in_index, A = m.avail_in, y = e.bitb, T = e.bitk, R = e.write, F = /* (int) */
+    let h, v, A, P, S, R, F, y;
+    for (P = m.next_in_index, S = m.avail_in, v = e.bitb, A = e.bitk, R = e.write, F = /* (int) */
     R < e.read ? e.read - R - 1 : e.end - R; ; ) {
-      let C, v, S, M, L, Y, H, j;
+      let D, b, E, M, O, $, H, j;
       switch (r) {
         case ft:
-          for (; T < 3; ) {
-            if (A !== 0)
+          for (; A < 3; ) {
+            if (S !== 0)
               d = Q;
             else
-              return e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-            A--, y |= (m.read_byte(D++) & 255) << T, T += 8;
+              return e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+            S--, v |= (m.read_byte(P++) & 255) << A, A += 8;
           }
           switch (h = /* (int) */
-          y & 7, w = h & 1, h >>> 1) {
+          v & 7, w = h & 1, h >>> 1) {
             case 0:
-              y >>>= 3, T -= 3, h = T & 7, y >>>= h, T -= h, r = dn;
+              v >>>= 3, A -= 3, h = A & 7, v >>>= h, A -= h, r = dn;
               break;
             case 1:
-              C = [], v = [], S = [[]], M = [[]], An.inflate_trees_fixed(C, v, S, M), x.init(C[0], v[0], S[0], 0, M[0], 0), y >>>= 3, T -= 3, r = Nt;
+              D = [], b = [], E = [[]], M = [[]], An.inflate_trees_fixed(D, b, E, M), x.init(D[0], b[0], E[0], 0, M[0], 0), v >>>= 3, A -= 3, r = Nt;
               break;
             case 2:
-              y >>>= 3, T -= 3, r = pr;
+              v >>>= 3, A -= 3, r = pr;
               break;
             case 3:
-              return y >>>= 3, T -= 3, r = nt, m.msg = "invalid block type", d = se, e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
+              return v >>>= 3, A -= 3, r = nt, m.msg = "invalid block type", d = oe, e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
           }
           break;
         case dn:
-          for (; T < 32; ) {
-            if (A !== 0)
+          for (; A < 32; ) {
+            if (S !== 0)
               d = Q;
             else
-              return e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-            A--, y |= (m.read_byte(D++) & 255) << T, T += 8;
+              return e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+            S--, v |= (m.read_byte(P++) & 255) << A, A += 8;
           }
-          if ((~y >>> 16 & 65535) != (y & 65535))
-            return r = nt, m.msg = "invalid stored block lengths", d = se, e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-          s = y & 65535, y = T = 0, r = s !== 0 ? dr : w !== 0 ? qt : ft;
+          if ((~v >>> 16 & 65535) != (v & 65535))
+            return r = nt, m.msg = "invalid stored block lengths", d = oe, e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+          s = v & 65535, v = A = 0, r = s !== 0 ? dr : w !== 0 ? qt : ft;
           break;
         case dr:
-          if (A === 0 || F === 0 && (R == e.end && e.read !== 0 && (R = 0, F = /* (int) */
+          if (S === 0 || F === 0 && (R == e.end && e.read !== 0 && (R = 0, F = /* (int) */
           R < e.read ? e.read - R - 1 : e.end - R), F === 0 && (e.write = R, d = e.inflate_flush(m, d), R = e.write, F = /* (int) */
           R < e.read ? e.read - R - 1 : e.end - R, R == e.end && e.read !== 0 && (R = 0, F = /* (int) */
           R < e.read ? e.read - R - 1 : e.end - R), F === 0)))
-            return e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-          if (d = Q, h = s, h > A && (h = A), h > F && (h = F), e.win.set(m.read_buf(D, h), R), D += h, A -= h, R += h, F -= h, (s -= h) !== 0)
+            return e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+          if (d = Q, h = s, h > S && (h = S), h > F && (h = F), e.win.set(m.read_buf(P, h), R), P += h, S -= h, R += h, F -= h, (s -= h) !== 0)
             break;
           r = w !== 0 ? qt : ft;
           break;
         case pr:
-          for (; T < 14; ) {
-            if (A !== 0)
+          for (; A < 14; ) {
+            if (S !== 0)
               d = Q;
             else
-              return e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-            A--, y |= (m.read_byte(D++) & 255) << T, T += 8;
+              return e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+            S--, v |= (m.read_byte(P++) & 255) << A, A += 8;
           }
-          if (a = h = y & 16383, (h & 31) > 29 || (h >> 5 & 31) > 29)
-            return r = nt, m.msg = "too many length or distance symbols", d = se, e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
+          if (a = h = v & 16383, (h & 31) > 29 || (h >> 5 & 31) > 29)
+            return r = nt, m.msg = "too many length or distance symbols", d = oe, e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
           if (h = 258 + (h & 31) + (h >> 5 & 31), !l || l.length < h)
             l = [];
           else
-            for (b = 0; b < h; b++)
-              l[b] = 0;
-          y >>>= 14, T -= 14, c = 0, r = mr;
+            for (y = 0; y < h; y++)
+              l[y] = 0;
+          v >>>= 14, A -= 14, c = 0, r = mr;
         case mr:
           for (; c < 4 + (a >>> 10); ) {
-            for (; T < 3; ) {
-              if (A !== 0)
+            for (; A < 3; ) {
+              if (S !== 0)
                 d = Q;
               else
-                return e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-              A--, y |= (m.read_byte(D++) & 255) << T, T += 8;
+                return e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+              S--, v |= (m.read_byte(P++) & 255) << A, A += 8;
             }
-            l[ur[c++]] = y & 7, y >>>= 3, T -= 3;
+            l[ur[c++]] = v & 7, v >>>= 3, A -= 3;
           }
           for (; c < 19; )
             l[ur[c++]] = 0;
-          if (f[0] = 7, h = P.inflate_trees_bits(l, f, _, g, m), h != Q)
-            return d = h, d == se && (l = null, r = nt), e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
+          if (f[0] = 7, h = C.inflate_trees_bits(l, f, _, g, m), h != Q)
+            return d = h, d == oe && (l = null, r = nt), e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
           c = 0, r = hr;
         case hr:
           for (; h = a, !(c >= 258 + (h & 31) + (h >> 5 & 31)); ) {
-            let K, V;
-            for (h = f[0]; T < h; ) {
-              if (A !== 0)
+            let G, K;
+            for (h = f[0]; A < h; ) {
+              if (S !== 0)
                 d = Q;
               else
-                return e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-              A--, y |= (m.read_byte(D++) & 255) << T, T += 8;
+                return e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+              S--, v |= (m.read_byte(P++) & 255) << A, A += 8;
             }
-            if (h = g[(_[0] + (y & Re[h])) * 3 + 1], V = g[(_[0] + (y & Re[h])) * 3 + 2], V < 16)
-              y >>>= h, T -= h, l[c++] = V;
+            if (h = g[(_[0] + (v & Re[h])) * 3 + 1], K = g[(_[0] + (v & Re[h])) * 3 + 2], K < 16)
+              v >>>= h, A -= h, l[c++] = K;
             else {
-              for (b = V == 18 ? 7 : V - 14, K = V == 18 ? 11 : 3; T < h + b; ) {
-                if (A !== 0)
+              for (y = K == 18 ? 7 : K - 14, G = K == 18 ? 11 : 3; A < h + y; ) {
+                if (S !== 0)
                   d = Q;
                 else
-                  return e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-                A--, y |= (m.read_byte(D++) & 255) << T, T += 8;
+                  return e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+                S--, v |= (m.read_byte(P++) & 255) << A, A += 8;
               }
-              if (y >>>= h, T -= h, K += y & Re[b], y >>>= b, T -= b, b = c, h = a, b + K > 258 + (h & 31) + (h >> 5 & 31) || V == 16 && b < 1)
-                return l = null, r = nt, m.msg = "invalid bit length repeat", d = se, e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-              V = V == 16 ? l[b - 1] : 0;
+              if (v >>>= h, A -= h, G += v & Re[y], v >>>= y, A -= y, y = c, h = a, y + G > 258 + (h & 31) + (h >> 5 & 31) || K == 16 && y < 1)
+                return l = null, r = nt, m.msg = "invalid bit length repeat", d = oe, e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+              K = K == 16 ? l[y - 1] : 0;
               do
-                l[b++] = V;
-              while (--K !== 0);
-              c = b;
+                l[y++] = K;
+              while (--G !== 0);
+              c = y;
             }
           }
-          if (_[0] = -1, L = [], Y = [], H = [], j = [], L[0] = 9, Y[0] = 6, h = a, h = P.inflate_trees_dynamic(257 + (h & 31), 1 + (h >> 5 & 31), l, L, Y, H, j, g, m), h != Q)
-            return h == se && (l = null, r = nt), d = h, e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
-          x.init(L[0], Y[0], g, H[0], g, j[0]), r = Nt;
+          if (_[0] = -1, O = [], $ = [], H = [], j = [], O[0] = 9, $[0] = 6, h = a, h = C.inflate_trees_dynamic(257 + (h & 31), 1 + (h >> 5 & 31), l, O, $, H, j, g, m), h != Q)
+            return h == oe && (l = null, r = nt), d = h, e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
+          x.init(O[0], $[0], g, H[0], g, j[0]), r = Nt;
         case Nt:
-          if (e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, (d = x.proc(e, m, d)) != He)
+          if (e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, (d = x.proc(e, m, d)) != He)
             return e.inflate_flush(m, d);
-          if (d = Q, x.free(m), D = m.next_in_index, A = m.avail_in, y = e.bitb, T = e.bitk, R = e.write, F = /* (int) */
+          if (d = Q, x.free(m), P = m.next_in_index, S = m.avail_in, v = e.bitb, A = e.bitk, R = e.write, F = /* (int) */
           R < e.read ? e.read - R - 1 : e.end - R, w === 0) {
             r = ft;
             break;
@@ -4396,14 +4396,14 @@ function bo(n, t) {
         case qt:
           if (e.write = R, d = e.inflate_flush(m, d), R = e.write, F = /* (int) */
           R < e.read ? e.read - R - 1 : e.end - R, e.read != e.write)
-            return e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
+            return e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
           r = xr;
         case xr:
-          return d = He, e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
+          return d = He, e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
         case nt:
-          return d = se, e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
+          return d = oe, e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
         default:
-          return d = Ae, e.bitb = y, e.bitk = T, m.avail_in = A, m.total_in += D - m.next_in_index, m.next_in_index = D, e.write = R, e.inflate_flush(m, d);
+          return d = Ae, e.bitb = v, e.bitk = A, m.avail_in = S, m.total_in += P - m.next_in_index, m.next_in_index = P, e.write = R, e.inflate_flush(m, d);
       }
     }
   }, e.free = function(m) {
@@ -4414,7 +4414,7 @@ function bo(n, t) {
     return r == dn ? 1 : 0;
   };
 }
-const vo = 32, Eo = 8, ko = 0, wr = 1, gr = 2, _r = 3, yr = 4, br = 5, pn = 6, vt = 7, vr = 12, Ve = 13, So = [0, 0, 255, 255];
+const vo = 32, ko = 8, Eo = 0, wr = 1, gr = 2, _r = 3, yr = 4, br = 5, pn = 6, vt = 7, vr = 12, Ve = 13, So = [0, 0, 255, 255];
 function Ao() {
   const n = this;
   n.mode = 0, n.method = 0, n.was = [0], n.need = 0, n.marker = 0, n.wbits = 0;
@@ -4432,10 +4432,10 @@ function Ao() {
     const c = e.istate;
     for (r = r == fo ? $e : Q, s = $e; ; )
       switch (c.mode) {
-        case ko:
+        case Eo:
           if (e.avail_in === 0)
             return s;
-          if (s = r, e.avail_in--, e.total_in++, ((c.method = e.read_byte(e.next_in_index++)) & 15) != Eo) {
+          if (s = r, e.avail_in--, e.total_in++, ((c.method = e.read_byte(e.next_in_index++)) & 15) != ko) {
             c.mode = Ve, e.msg = "unknown compression method", c.marker = 5;
             break;
           }
@@ -4473,7 +4473,7 @@ function Ao() {
         case pn:
           return c.mode = Ve, e.msg = "need dictionary", c.marker = 0, Ae;
         case vt:
-          if (s = c.blocks.proc(e, s), s == se) {
+          if (s = c.blocks.proc(e, s), s == oe) {
             c.mode = Ve, c.marker = 0;
             break;
           }
@@ -4483,7 +4483,7 @@ function Ao() {
         case vr:
           return e.avail_in = 0, He;
         case Ve:
-          return se;
+          return oe;
         default:
           return Ae;
       }
@@ -4502,7 +4502,7 @@ function Ao() {
       return $e;
     for (s = e.next_in_index, a = f.marker; r !== 0 && a < 4; )
       e.read_byte(s) == So[a] ? a++ : e.read_byte(s) !== 0 ? a = 0 : a = 4 - a, s++, r--;
-    return e.total_in += s - e.next_in_index, e.next_in_index = s, e.avail_in = r, f.marker = a, a != 4 ? se : (c = e.total_in, l = e.total_out, t(e), e.total_in = c, e.total_out = l, f.mode = vt, Q);
+    return e.total_in += s - e.next_in_index, e.next_in_index = s, e.avail_in = r, f.marker = a, a != 4 ? oe : (c = e.total_in, l = e.total_out, t(e), e.total_in = c, e.total_out = l, f.mode = vt, Q);
   }, n.inflateSyncPoint = function(e) {
     return !e || !e.istate || !e.istate.blocks ? Ae : e.istate.blocks.sync_point();
   };
@@ -4545,7 +4545,7 @@ function To(n) {
   let c = !1;
   e.inflateInit(), e.next_out = a, t.append = function(l, f) {
     const _ = [];
-    let x, w, g = 0, k = 0, P = 0;
+    let x, w, g = 0, T = 0, C = 0;
     if (l.length !== 0) {
       e.next_in_index = 0, e.next_in = l, e.avail_in = l.length;
       do {
@@ -4556,17 +4556,17 @@ function To(n) {
           throw new Error("inflating: " + e.msg);
         if ((c || x === He) && e.avail_in === l.length)
           throw new Error("inflating: bad input");
-        e.next_out_index && (e.next_out_index === r ? _.push(new Uint8Array(a)) : _.push(a.subarray(0, e.next_out_index))), P += e.next_out_index, f && e.next_in_index > 0 && e.next_in_index != g && (f(e.next_in_index), g = e.next_in_index);
+        e.next_out_index && (e.next_out_index === r ? _.push(new Uint8Array(a)) : _.push(a.subarray(0, e.next_out_index))), C += e.next_out_index, f && e.next_in_index > 0 && e.next_in_index != g && (f(e.next_in_index), g = e.next_in_index);
       } while (e.avail_in > 0 || e.avail_out === 0);
-      return _.length > 1 ? (w = new Uint8Array(P), _.forEach(function(m) {
-        w.set(m, k), k += m.length;
+      return _.length > 1 ? (w = new Uint8Array(C), _.forEach(function(m) {
+        w.set(m, T), T += m.length;
       })) : w = _[0] ? new Uint8Array(_[0]) : new Uint8Array(), w;
     }
   }, t.flush = function() {
     e.inflateEnd();
   };
 }
-const st = 4294967295, Xe = 65535, Ro = 8, Fo = 0, Co = 99, Io = 67324752, Po = 134695760, Er = 33639248, Do = 101010256, kr = 101075792, Lo = 117853008, ut = 22, mn = 20, hn = 56, Uo = 1, Oo = 39169, Bo = 10, Wo = 1, Mo = 21589, No = 28789, qo = 25461, jo = 6534, Sr = 1, Ho = 6, Ar = 8, Tr = 2048, Rr = 16, Fr = 16384, Cr = 73, Ir = "/", ke = void 0, Qe = "undefined", Ft = "function";
+const st = 4294967295, Xe = 65535, Ro = 8, Fo = 0, Co = 99, Io = 67324752, Po = 134695760, kr = 33639248, Do = 101010256, Er = 101075792, Lo = 117853008, ut = 22, mn = 20, hn = 56, Uo = 1, Oo = 39169, Bo = 10, Wo = 1, Mo = 21589, No = 28789, qo = 25461, jo = 6534, Sr = 1, Ho = 6, Ar = 8, Tr = 2048, Rr = 16, Fr = 16384, Cr = 73, Ir = "/", Ee = void 0, Qe = "undefined", Ft = "function";
 class Pr {
   constructor(t) {
     return class extends TransformStream {
@@ -4597,7 +4597,7 @@ const Yo = {
   terminateWorkerTimeout: 5e3,
   useWebWorkers: !0,
   useCompressionStream: !0,
-  workerScripts: ke,
+  workerScripts: Ee,
   CompressionStreamNative: typeof CompressionStream != Qe && CompressionStream,
   DecompressionStreamNative: typeof DecompressionStream != Qe && DecompressionStream
 }, ze = Object.assign({}, Yo);
@@ -4621,22 +4621,22 @@ function Wn(n) {
     DecompressionStream: x,
     workerScripts: w
   } = n;
-  if (Ge("baseURL", t), Ge("chunkSize", e), Ge("maxWorkers", r), Ge("terminateWorkerTimeout", s), Ge("useCompressionStream", a), Ge("useWebWorkers", c), l && (ze.CompressionStream = new Pr(l)), f && (ze.DecompressionStream = new Pr(f)), Ge("CompressionStream", _), Ge("DecompressionStream", x), w !== ke) {
-    const { deflate: g, inflate: k } = w;
-    if ((g || k) && (ze.workerScripts || (ze.workerScripts = {})), g) {
+  if (Ge("baseURL", t), Ge("chunkSize", e), Ge("maxWorkers", r), Ge("terminateWorkerTimeout", s), Ge("useCompressionStream", a), Ge("useWebWorkers", c), l && (ze.CompressionStream = new Pr(l)), f && (ze.DecompressionStream = new Pr(f)), Ge("CompressionStream", _), Ge("DecompressionStream", x), w !== Ee) {
+    const { deflate: g, inflate: T } = w;
+    if ((g || T) && (ze.workerScripts || (ze.workerScripts = {})), g) {
       if (!Array.isArray(g))
         throw new Error("workerScripts.deflate must be an array");
       ze.workerScripts.deflate = g;
     }
-    if (k) {
-      if (!Array.isArray(k))
+    if (T) {
+      if (!Array.isArray(T))
         throw new Error("workerScripts.inflate must be an array");
-      ze.workerScripts.inflate = k;
+      ze.workerScripts.inflate = T;
     }
   }
 }
 function Ge(n, t) {
-  t !== ke && (ze[n] = t);
+  t !== Ee && (ze[n] = t);
 }
 const xn = {
   application: {
@@ -6278,7 +6278,7 @@ function Go(n) {
   } else
     return new TextEncoder().encode(n);
 }
-const Ee = {
+const ke = {
   /**
    * Concatenate two bit arrays.
    * @param {bitArray} a1 The first array.
@@ -6288,8 +6288,8 @@ const Ee = {
   concat(n, t) {
     if (n.length === 0 || t.length === 0)
       return n.concat(t);
-    const e = n[n.length - 1], r = Ee.getPartial(e);
-    return r === 32 ? n.concat(t) : Ee._shiftRight(t, r, e | 0, n.slice(0, n.length - 1));
+    const e = n[n.length - 1], r = ke.getPartial(e);
+    return r === 32 ? n.concat(t) : ke._shiftRight(t, r, e | 0, n.slice(0, n.length - 1));
   },
   /**
    * Find the length of an array of bits.
@@ -6301,7 +6301,7 @@ const Ee = {
     if (t === 0)
       return 0;
     const e = n[t - 1];
-    return (t - 1) * 32 + Ee.getPartial(e);
+    return (t - 1) * 32 + ke.getPartial(e);
   },
   /**
    * Truncate an array.
@@ -6314,7 +6314,7 @@ const Ee = {
       return n;
     n = n.slice(0, Math.ceil(t / 32));
     const e = n.length;
-    return t = t & 31, e > 0 && t && (n[e - 1] = Ee.partial(t, n[e - 1] & 2147483648 >> t - 1, 1)), n;
+    return t = t & 31, e > 0 && t && (n[e - 1] = ke.partial(t, n[e - 1] & 2147483648 >> t - 1, 1)), n;
   },
   /**
    * Make a partial word for a bit array.
@@ -6348,14 +6348,14 @@ const Ee = {
       return r.concat(n);
     for (let c = 0; c < n.length; c++)
       r.push(e | n[c] >>> t), e = n[c] << 32 - t;
-    const s = n.length ? n[n.length - 1] : 0, a = Ee.getPartial(s);
-    return r.push(Ee.partial(t + a & 31, t + a > 32 ? e : r.pop(), 1)), r;
+    const s = n.length ? n[n.length - 1] : 0, a = ke.getPartial(s);
+    return r.push(ke.partial(t + a & 31, t + a > 32 ? e : r.pop(), 1)), r;
   }
 }, zt = {
   bytes: {
     /** Convert from a bitArray to an array of bytes. */
     fromBits(n) {
-      const e = Ee.bitLength(n) / 8, r = new Uint8Array(e);
+      const e = ke.bitLength(n) / 8, r = new Uint8Array(e);
       let s;
       for (let a = 0; a < e; a++)
         a & 3 || (s = n[a / 4]), r[a] = s >>> 24, s <<= 8;
@@ -6367,7 +6367,7 @@ const Ee = {
       let e, r = 0;
       for (e = 0; e < n.length; e++)
         r = r << 8 | n[e], (e & 3) === 3 && (t.push(r), r = 0);
-      return e & 3 && t.push(Ee.partial(8 * (e & 3), r)), t;
+      return e & 3 && t.push(ke.partial(8 * (e & 3), r)), t;
     }
   }
 }, gi = {};
@@ -6392,7 +6392,7 @@ gi.sha1 = class {
   update(n) {
     const t = this;
     typeof n == "string" && (n = zt.utf8String.toBits(n));
-    const e = t._buffer = Ee.concat(t._buffer, n), r = t._length, s = t._length = r + Ee.bitLength(n);
+    const e = t._buffer = ke.concat(t._buffer, n), r = t._length, s = t._length = r + ke.bitLength(n);
     if (s > 9007199254740991)
       throw new Error("Cannot hash more than 2^53 - 1 bits");
     const a = new Uint32Array(e);
@@ -6409,7 +6409,7 @@ gi.sha1 = class {
     const n = this;
     let t = n._buffer;
     const e = n._h;
-    t = Ee.concat(t, [Ee.partial(1, 1)]);
+    t = ke.concat(t, [ke.partial(1, 1)]);
     for (let r = t.length + 2; r & 15; r++)
       t.push(0);
     for (t.push(Math.floor(n._length / 4294967296)), t.push(n._length | 0); t.length; )
@@ -6508,9 +6508,9 @@ _i.aes = class {
     for (let x = c = 0; !e[x]; x ^= l || 1, c = a[c] || 1) {
       let w = c ^ c << 1 ^ c << 2 ^ c << 3 ^ c << 4;
       w = w >> 8 ^ w & 255 ^ 99, e[x] = w, r[w] = x, _ = s[f = s[l = s[x]]];
-      let g = _ * 16843009 ^ f * 65537 ^ l * 257 ^ x * 16843008, k = s[w] * 257 ^ w * 16843008;
-      for (let P = 0; P < 4; P++)
-        n[P][x] = k = k << 24 ^ k >>> 8, t[P][w] = g = g << 24 ^ g >>> 8;
+      let g = _ * 16843009 ^ f * 65537 ^ l * 257 ^ x * 16843008, T = s[w] * 257 ^ w * 16843008;
+      for (let C = 0; C < 4; C++)
+        n[C][x] = T = T << 24 ^ T >>> 8, t[C][w] = g = g << 24 ^ g >>> 8;
     }
     for (let x = 0; x < 5; x++)
       n[x] = n[x].slice(0), t[x] = t[x].slice(0);
@@ -6526,11 +6526,11 @@ _i.aes = class {
     if (n.length !== 4)
       throw new Error("invalid aes block size");
     const e = this._key[t], r = e.length / 4 - 2, s = [0, 0, 0, 0], a = this._tables[t], c = a[0], l = a[1], f = a[2], _ = a[3], x = a[4];
-    let w = n[0] ^ e[0], g = n[t ? 3 : 1] ^ e[1], k = n[2] ^ e[2], P = n[t ? 1 : 3] ^ e[3], m = 4, d, h, y;
-    for (let T = 0; T < r; T++)
-      d = c[w >>> 24] ^ l[g >> 16 & 255] ^ f[k >> 8 & 255] ^ _[P & 255] ^ e[m], h = c[g >>> 24] ^ l[k >> 16 & 255] ^ f[P >> 8 & 255] ^ _[w & 255] ^ e[m + 1], y = c[k >>> 24] ^ l[P >> 16 & 255] ^ f[w >> 8 & 255] ^ _[g & 255] ^ e[m + 2], P = c[P >>> 24] ^ l[w >> 16 & 255] ^ f[g >> 8 & 255] ^ _[k & 255] ^ e[m + 3], m += 4, w = d, g = h, k = y;
-    for (let T = 0; T < 4; T++)
-      s[t ? 3 & -T : T] = x[w >>> 24] << 24 ^ x[g >> 16 & 255] << 16 ^ x[k >> 8 & 255] << 8 ^ x[P & 255] ^ e[m++], d = w, w = g, g = k, k = P, P = d;
+    let w = n[0] ^ e[0], g = n[t ? 3 : 1] ^ e[1], T = n[2] ^ e[2], C = n[t ? 1 : 3] ^ e[3], m = 4, d, h, v;
+    for (let A = 0; A < r; A++)
+      d = c[w >>> 24] ^ l[g >> 16 & 255] ^ f[T >> 8 & 255] ^ _[C & 255] ^ e[m], h = c[g >>> 24] ^ l[T >> 16 & 255] ^ f[C >> 8 & 255] ^ _[w & 255] ^ e[m + 1], v = c[T >>> 24] ^ l[C >> 16 & 255] ^ f[w >> 8 & 255] ^ _[g & 255] ^ e[m + 2], C = c[C >>> 24] ^ l[w >> 16 & 255] ^ f[g >> 8 & 255] ^ _[T & 255] ^ e[m + 3], m += 4, w = d, g = h, T = v;
+    for (let A = 0; A < 4; A++)
+      s[t ? 3 & -A : A] = x[w >>> 24] << 24 ^ x[g >> 16 & 255] << 16 ^ x[T >> 8 & 255] << 8 ^ x[C & 255] ^ e[m++], d = w, w = g, g = T, T = C, C = d;
     return s;
   }
 };
@@ -6583,13 +6583,13 @@ yi.ctrGladman = class {
     let r;
     if (!(r = t.length))
       return [];
-    const s = Ee.bitLength(t);
+    const s = ke.bitLength(t);
     for (let a = 0; a < r; a += 4) {
       this.incCounter(e);
       const c = n.encrypt(e);
       t[a] ^= c[0], t[a + 1] ^= c[1], t[a + 2] ^= c[2], t[a + 3] ^= c[3];
     }
-    return Ee.clamp(t, s);
+    return ke.clamp(t, s);
   }
 };
 const ot = {
@@ -6603,9 +6603,9 @@ const ot = {
     let a, c, l, f, _;
     const x = new ArrayBuffer(s), w = new DataView(x);
     let g = 0;
-    const k = Ee;
+    const T = ke;
     for (t = zt.bytes.toBits(t), _ = 1; g < (s || 1); _++) {
-      for (a = c = n.encrypt(k.concat(t, [_])), l = 1; l < e; l++)
+      for (a = c = n.encrypt(T.concat(t, [_])), l = 1; l < e; l++)
         for (c = n.encrypt(c), f = 0; f < c.length; f++)
           a[f] ^= c[f];
       for (l = 0; g < (s || 1) && l < a.length; l++)
@@ -6643,10 +6643,10 @@ ot.hmacSha1 = class {
   }
 };
 const Xo = typeof crypto != Qe && typeof crypto.getRandomValues == Ft, bi = "Invalid password", vi = "Invalid signature", Mn = "zipjs-abort-check-password";
-function Ei(n) {
+function ki(n) {
   return Xo ? crypto.getRandomValues(n) : Ko.getRandomValues(n);
 }
-const pt = 16, zo = "raw", ki = { name: "PBKDF2" }, Jo = { name: "HMAC" }, Qo = "SHA-1", ea = Object.assign({ hash: Jo }, ki), Tn = Object.assign({ iterations: 1e3, hash: { name: Qo } }, ki), ta = ["deriveBits"], At = [8, 12, 16], Et = [16, 24, 32], Ke = 10, na = [0, 0, 0, 0], rn = typeof crypto != Qe, Ct = rn && crypto.subtle, Si = rn && typeof Ct != Qe, Me = zt.bytes, ra = _i.aes, ia = yi.ctrGladman, sa = ot.hmacSha1;
+const pt = 16, zo = "raw", Ei = { name: "PBKDF2" }, Jo = { name: "HMAC" }, Qo = "SHA-1", ea = Object.assign({ hash: Jo }, Ei), Tn = Object.assign({ iterations: 1e3, hash: { name: Qo } }, Ei), ta = ["deriveBits"], At = [8, 12, 16], kt = [16, 24, 32], Ke = 10, na = [0, 0, 0, 0], rn = typeof crypto != Qe, Ct = rn && crypto.subtle, Si = rn && typeof Ct != Qe, Me = zt.bytes, ra = _i.aes, ia = yi.ctrGladman, sa = ot.hmacSha1;
 let Dr = rn && Si && typeof Ct.importKey == Ft, Lr = rn && Si && typeof Ct.deriveBits == Ft;
 class oa extends TransformStream {
   constructor({ password: t, rawPassword: e, signed: r, encryptionStrength: s, checkPasswordOnly: a }) {
@@ -6668,8 +6668,8 @@ class oa extends TransformStream {
           ready: g
         } = f;
         _ ? (await ca(f, x, _, Ie(c, 0, At[x] + 2)), c = Ie(c, At[x] + 2), a ? l.error(new Error(Mn)) : w()) : await g;
-        const k = new Uint8Array(c.length - Ke - (c.length - Ke) % pt);
-        l.enqueue(Ai(f, c, k, 0, Ke, !0));
+        const T = new Uint8Array(c.length - Ke - (c.length - Ke) % pt);
+        l.enqueue(Ai(f, c, T, 0, Ke, !0));
       },
       async flush(c) {
         const {
@@ -6681,21 +6681,21 @@ class oa extends TransformStream {
         } = this;
         if (_ && f) {
           await w;
-          const g = Ie(x, 0, x.length - Ke), k = Ie(x, x.length - Ke);
-          let P = new Uint8Array();
+          const g = Ie(x, 0, x.length - Ke), T = Ie(x, x.length - Ke);
+          let C = new Uint8Array();
           if (g.length) {
             const m = Rt(Me, g);
             _.update(m);
             const d = f.update(m);
-            P = Tt(Me, d);
+            C = Tt(Me, d);
           }
           if (l) {
             const m = Ie(Tt(Me, _.digest()), 0, Ke);
             for (let d = 0; d < Ke; d++)
-              if (m[d] != k[d])
+              if (m[d] != T[d])
                 throw new Error(vi);
           }
-          c.enqueue(P);
+          c.enqueue(C);
         }
       }
     });
@@ -6722,8 +6722,8 @@ class aa extends TransformStream {
         } = l;
         let g = new Uint8Array();
         f ? (g = await la(l, _, f), x()) : await w;
-        const k = new Uint8Array(g.length + a.length - a.length % pt);
-        k.set(g, 0), c.enqueue(Ai(l, a, k, g.length, 0));
+        const T = new Uint8Array(g.length + a.length - a.length % pt);
+        T.set(g, 0), c.enqueue(Ai(l, a, T, g.length, 0));
       },
       async flush(a) {
         const {
@@ -6767,12 +6767,12 @@ async function ca(n, t, e, r) {
     throw new Error(bi);
 }
 async function la(n, t, e) {
-  const r = Ei(new Uint8Array(At[t])), s = await Ti(n, t, e, r);
+  const r = ki(new Uint8Array(At[t])), s = await Ti(n, t, e, r);
   return Nn(r, s);
 }
 async function Ti(n, t, e, r) {
   n.password = null;
-  const s = await fa(zo, e, ea, !1, ta), a = await ua(Object.assign({ salt: r }, Tn), s, 8 * (Et[t] * 2 + 2)), c = new Uint8Array(a), l = Rt(Me, Ie(c, 0, Et[t])), f = Rt(Me, Ie(c, Et[t], Et[t] * 2)), _ = Ie(c, Et[t] * 2);
+  const s = await fa(zo, e, ea, !1, ta), a = await ua(Object.assign({ salt: r }, Tn), s, 8 * (kt[t] * 2 + 2)), c = new Uint8Array(a), l = Rt(Me, Ie(c, 0, kt[t])), f = Rt(Me, Ie(c, kt[t], kt[t] * 2)), _ = Ie(c, kt[t] * 2);
   return Object.assign(n, {
     keys: {
       key: l,
@@ -6804,7 +6804,7 @@ async function ua(n, t, e) {
     return ot.pbkdf2(t, n.salt, Tn.iterations, e);
 }
 function Ri(n, t) {
-  return t === ke ? Go(n) : t;
+  return t === Ee ? Go(n) : t;
 }
 function Nn(n, t) {
   let e = n;
@@ -6863,7 +6863,7 @@ class ma extends TransformStream {
         let c, l;
         if (a.password) {
           a.password = null;
-          const f = Ei(new Uint8Array(ht));
+          const f = ki(new Uint8Array(ht));
           f[ht - 1] = a.passwordVerification, c = new Uint8Array(r.length + f.length), c.set(Or(a, f), 0), l = ht;
         } else
           c = new Uint8Array(r.length), l = 0;
@@ -6913,10 +6913,10 @@ class ha extends TransformStream {
   constructor(t, { chunkSize: e, CompressionStream: r, CompressionStreamNative: s }) {
     super({});
     const { compressed: a, encrypted: c, useCompressionStream: l, zipCrypto: f, signed: _, level: x } = t, w = this;
-    let g, k, P = Pi(super.readable);
-    (!c || f) && _ && (g = new wi(), P = Ne(P, g)), a && (P = Li(P, l, { level: x, chunkSize: e }, s, r)), c && (f ? P = Ne(P, new ma(t)) : (k = new aa(t), P = Ne(P, k))), Di(w, P, () => {
+    let g, T, C = Pi(super.readable);
+    (!c || f) && _ && (g = new wi(), C = Ne(C, g)), a && (C = Li(C, l, { level: x, chunkSize: e }, s, r)), c && (f ? C = Ne(C, new ma(t)) : (T = new aa(t), C = Ne(C, T))), Di(w, C, () => {
       let m;
-      c && !f && (m = k.signature), (!c || f) && _ && (m = new DataView(g.value.buffer).getUint32(0)), w.signature = m;
+      c && !f && (m = T.signature), (!c || f) && _ && (m = new DataView(g.value.buffer).getUint32(0)), w.signature = m;
     });
   }
 }
@@ -6924,11 +6924,11 @@ class xa extends TransformStream {
   constructor(t, { chunkSize: e, DecompressionStream: r, DecompressionStreamNative: s }) {
     super({});
     const { zipCrypto: a, encrypted: c, signed: l, signature: f, compressed: _, useCompressionStream: x } = t;
-    let w, g, k = Pi(super.readable);
-    c && (a ? k = Ne(k, new pa(t)) : (g = new oa(t), k = Ne(k, g))), _ && (k = Li(k, x, { chunkSize: e }, s, r)), (!c || a) && l && (w = new wi(), k = Ne(k, w)), Di(this, k, () => {
+    let w, g, T = Pi(super.readable);
+    c && (a ? T = Ne(T, new pa(t)) : (g = new oa(t), T = Ne(T, g))), _ && (T = Li(T, x, { chunkSize: e }, s, r)), (!c || a) && l && (w = new wi(), T = Ne(T, w)), Di(this, T, () => {
       if ((!c || a) && l) {
-        const P = new DataView(w.value.buffer);
-        if (f != P.getUint32(0, !1))
+        const C = new DataView(w.value.buffer);
+        if (f != C.getUint32(0, !1))
           throw new Error(vi);
       }
     });
@@ -6976,8 +6976,8 @@ class va extends TransformStream {
     s.startsWith(ba) ? a = ha : s.startsWith(Ui) && (a = xa);
     let c = 0, l = 0;
     const f = new a(t, e), _ = super.readable, x = new TransformStream({
-      transform(g, k) {
-        g && g.length && (l += g.length, k.enqueue(g));
+      transform(g, T) {
+        g && g.length && (l += g.length, T.enqueue(g));
       },
       flush() {
         Object.assign(r, {
@@ -6985,8 +6985,8 @@ class va extends TransformStream {
         });
       }
     }), w = new TransformStream({
-      transform(g, k) {
-        g && g.length && (c += g.length, k.enqueue(g));
+      transform(g, T) {
+        g && g.length && (c += g.length, T.enqueue(g));
       },
       flush() {
         const { signature: g } = f;
@@ -7004,7 +7004,7 @@ class va extends TransformStream {
     });
   }
 }
-class Ea extends TransformStream {
+class ka extends TransformStream {
   constructor(t) {
     let e;
     super({
@@ -7028,15 +7028,15 @@ class wn {
     const { signal: w } = c;
     return Object.assign(t, {
       busy: !0,
-      readable: e.pipeThrough(new Ea(a.chunkSize)).pipeThrough(new ka(e, c), { signal: w }),
+      readable: e.pipeThrough(new ka(a.chunkSize)).pipeThrough(new Ea(e, c), { signal: w }),
       writable: r,
       options: Object.assign({}, s),
       scripts: _,
       transferStreams: f,
       terminate() {
         return new Promise((g) => {
-          const { worker: k, busy: P } = t;
-          k ? (P ? t.resolveTerminated = g : (k.terminate(), g()), t.interface = null) : g();
+          const { worker: T, busy: C } = t;
+          T ? (C ? t.resolveTerminated = g : (T.terminate(), g()), t.interface = null) : g();
         });
       },
       onTaskFinished() {
@@ -7046,7 +7046,7 @@ class wn {
     }), (l && Oi ? Sa : Bi)(t, a);
   }
 }
-class ka extends TransformStream {
+class Ea extends TransformStream {
   constructor(t, { onstart: e, onprogress: r, size: s, onend: a }) {
     let c = 0;
     super({
@@ -7111,8 +7111,8 @@ async function Aa({ options: n, readable: t, writable: e, onTaskFinished: r }, s
 }
 async function Ta(n, t) {
   let e, r;
-  const s = new Promise((g, k) => {
-    e = g, r = k;
+  const s = new Promise((g, T) => {
+    e = g, r = T;
   });
   Object.assign(n, {
     reader: null,
@@ -7191,20 +7191,20 @@ async function Ca({ data: n }, t) {
   const { type: e, value: r, messageId: s, result: a, error: c } = n, { reader: l, writer: f, resolveResult: _, rejectResult: x, onTaskFinished: w } = t;
   try {
     if (c) {
-      const { message: k, stack: P, code: m, name: d } = c, h = new Error(k);
-      Object.assign(h, { stack: P, code: m, name: d }), g(h);
+      const { message: T, stack: C, code: m, name: d } = c, h = new Error(T);
+      Object.assign(h, { stack: C, code: m, name: d }), g(h);
     } else {
       if (e == _a) {
-        const { value: k, done: P } = await l.read();
-        $t({ type: Mr, value: k, done: P, messageId: s }, t);
+        const { value: T, done: C } = await l.read();
+        $t({ type: Mr, value: T, done: C, messageId: s }, t);
       }
       e == Mr && (await f.ready, await f.write(new Uint8Array(r)), $t({ type: ya, messageId: s }, t)), e == Nr && g(null, a);
     }
-  } catch (k) {
-    $t({ type: Nr, messageId: s }, t), g(k);
+  } catch (T) {
+    $t({ type: Nr, messageId: s }, t), g(T);
   }
-  function g(k, P) {
-    k ? x(k) : _(P), f && f.releaseLock(), w();
+  function g(T, C) {
+    T ? x(T) : _(C), f && f.releaseLock(), w();
   }
 }
 let it = [];
@@ -7212,10 +7212,10 @@ const _n = [];
 let Hr = 0;
 async function Ia(n, t) {
   const { options: e, config: r } = t, { transferStreams: s, useWebWorkers: a, useCompressionStream: c, codecType: l, compressed: f, signed: _, encrypted: x } = e, { workerScripts: w, maxWorkers: g } = r;
-  t.transferStreams = s || s === ke;
-  const k = !f && !_ && !x && !t.transferStreams;
-  return t.useWebWorkers = !k && (a || a === ke && r.useWebWorkers), t.scripts = t.useWebWorkers && w ? w[l] : [], e.useCompressionStream = c || c === ke && r.useCompressionStream, (await P()).run();
-  async function P() {
+  t.transferStreams = s || s === Ee;
+  const T = !f && !_ && !x && !t.transferStreams;
+  return t.useWebWorkers = !T && (a || a === Ee && r.useWebWorkers), t.scripts = t.useWebWorkers && w ? w[l] : [], e.useCompressionStream = c || c === Ee && r.useCompressionStream, (await C()).run();
+  async function C() {
     const d = it.find((h) => !h.busy);
     if (d)
       return $r(d), new wn(d, n, t, m);
@@ -7227,8 +7227,8 @@ async function Ia(n, t) {
   }
   function m(d) {
     if (_n.length) {
-      const [{ resolve: h, stream: y, workerOptions: T }] = _n.splice(0, 1);
-      h(new wn(d, y, T, m));
+      const [{ resolve: h, stream: v, workerOptions: A }] = _n.splice(0, 1);
+      h(new wn(d, v, A, m));
     } else d.worker ? ($r(d), Pa(d, t)) : it = it.filter((h) => h != d);
   }
 }
@@ -7346,8 +7346,8 @@ class Yr extends jn {
         if (c)
           x.length >= w ? (await f(x.slice(0, w)), await _(), r.diskOffset += s.size, r.diskNumber++, c = null, await this.write(x.slice(w))) : await f(x);
         else {
-          const { value: g, done: k } = await t.next();
-          if (k && !g)
+          const { value: g, done: T } = await t.next();
+          if (T && !g)
             throw new Error(La);
           s = g, s.size = 0, s.maxSize && (r.maxSize = s.maxSize), r.availableSize = r.maxSize, await Jt(s), a = g.writable, c = a.getWriter(), await this.write(x);
         }
@@ -7382,11 +7382,11 @@ function Ma(n) {
   }), n;
 }
 function Na(n) {
-  n.writable === ke && typeof n.next == Ft && (n = new Yr(n)), n instanceof WritableStream && (n = {
+  n.writable === Ee && typeof n.next == Ft && (n = new Yr(n)), n instanceof WritableStream && (n = {
     writable: n
   });
   const { writable: t } = n;
-  return t.size === ke && (t.size = 0), n instanceof Yr || Object.assign(n, {
+  return t.size === Ee && (t.size = 0), n instanceof Yr || Object.assign(n, {
     diskNumber: 0,
     diskOffset: 0,
     availableSize: 1 / 0,
@@ -7481,96 +7481,96 @@ class zr {
     const e = this;
     let { reader: r } = e;
     const { config: s } = e;
-    if (await Jt(r), (r.size === ke || !r.readUint8Array) && (r = new Rn(await new Response(r.readable).blob()), await Jt(r)), r.size < ut)
+    if (await Jt(r), (r.size === Ee || !r.readUint8Array) && (r = new Rn(await new Response(r.readable).blob()), await Jt(r)), r.size < ut)
       throw new Error(yn);
     r.chunkSize = Vo(s);
     const a = await gc(r, Do, r.size, ut, Xe * 16);
     if (!a) {
-      const v = await _e(r, 0, 4), S = he(v);
-      throw ce(S) == Po ? new Error(Gr) : new Error(ic);
+      const b = await _e(r, 0, 4), E = xe(b);
+      throw ce(E) == Po ? new Error(Gr) : new Error(ic);
     }
-    const c = he(a);
+    const c = xe(a);
     let l = ce(c, 12), f = ce(c, 16);
-    const _ = a.offset, x = me(c, 20), w = _ + ut + x;
-    let g = me(c, 4);
-    const k = r.lastDiskNumber || 0;
-    let P = me(c, 6), m = me(c, 8), d = 0, h = 0;
-    if (f == st || l == st || m == Xe || P == Xe) {
-      const v = await _e(r, a.offset - mn, mn), S = he(v);
-      if (ce(S, 0) == Lo) {
-        f = Zt(S, 8);
-        let M = await _e(r, f, hn, -1), L = he(M);
-        const Y = a.offset - mn - hn;
-        if (ce(L, 0) != kr && f != Y) {
+    const _ = a.offset, x = he(c, 20), w = _ + ut + x;
+    let g = he(c, 4);
+    const T = r.lastDiskNumber || 0;
+    let C = he(c, 6), m = he(c, 8), d = 0, h = 0;
+    if (f == st || l == st || m == Xe || C == Xe) {
+      const b = await _e(r, a.offset - mn, mn), E = xe(b);
+      if (ce(E, 0) == Lo) {
+        f = Zt(E, 8);
+        let M = await _e(r, f, hn, -1), O = xe(M);
+        const $ = a.offset - mn - hn;
+        if (ce(O, 0) != Er && f != $) {
           const H = f;
-          f = Y, d = f - H, M = await _e(r, f, hn, -1), L = he(M);
+          f = $, d = f - H, M = await _e(r, f, hn, -1), O = xe(M);
         }
-        if (ce(L, 0) != kr)
+        if (ce(O, 0) != Er)
           throw new Error(sc);
-        g == Xe && (g = ce(L, 16)), P == Xe && (P = ce(L, 20)), m == Xe && (m = Zt(L, 32)), l == st && (l = Zt(L, 40)), f -= l;
+        g == Xe && (g = ce(O, 16)), C == Xe && (C = ce(O, 20)), m == Xe && (m = Zt(O, 32)), l == st && (l = Zt(O, 40)), f -= l;
       }
     }
-    if (f >= r.size && (d = r.size - f - l - ut, f = r.size - l - ut), k != g)
+    if (f >= r.size && (d = r.size - f - l - ut, f = r.size - l - ut), T != g)
       throw new Error(Gr);
     if (f < 0)
       throw new Error(yn);
-    let y = 0, T = await _e(r, f, l, P), D = he(T);
+    let v = 0, A = await _e(r, f, l, C), P = xe(A);
     if (l) {
-      const v = a.offset - l;
-      if (ce(D, y) != Er && f != v) {
-        const S = f;
-        f = v, d += f - S, T = await _e(r, f, l, P), D = he(T);
+      const b = a.offset - l;
+      if (ce(P, v) != kr && f != b) {
+        const E = f;
+        f = b, d += f - E, A = await _e(r, f, l, C), P = xe(A);
       }
     }
-    const A = a.offset - f - (r.lastDiskOffset || 0);
-    if (l != A && A >= 0 && (l = A, T = await _e(r, f, l, P), D = he(T)), f < 0 || f >= r.size)
+    const S = a.offset - f - (r.lastDiskOffset || 0);
+    if (l != S && S >= 0 && (l = S, A = await _e(r, f, l, C), P = xe(A)), f < 0 || f >= r.size)
       throw new Error(yn);
     const R = ve(e, t, "filenameEncoding"), F = ve(e, t, "commentEncoding");
-    for (let v = 0; v < m; v++) {
-      const S = new pc(r, s, e.options);
-      if (ce(D, y) != Er)
+    for (let b = 0; b < m; b++) {
+      const E = new pc(r, s, e.options);
+      if (ce(P, v) != kr)
         throw new Error(oc);
-      Xi(S, D, y + 6);
-      const M = !!S.bitFlag.languageEncodingFlag, L = y + 46, Y = L + S.filenameLength, H = Y + S.extraFieldLength, j = me(D, y + 4), K = j >> 8 == 0, V = j >> 8 == 3, oe = T.subarray(L, Y), Z = me(D, y + 32), J = H + Z, $ = T.subarray(H, J), ee = M, Pe = M, de = ce(D, y + 38), le = K && (xt(D, y + 38) & Rr) == Rr || V && (de >> 16 & Fr) == Fr || oe.length && oe[oe.length - 1] == Ir.charCodeAt(0), wt = V && (de >> 16 & Cr) == Cr, qe = ce(D, y + 42) + d;
-      Object.assign(S, {
+      Xi(E, P, v + 6);
+      const M = !!E.bitFlag.languageEncodingFlag, O = v + 46, $ = O + E.filenameLength, H = $ + E.extraFieldLength, j = he(P, v + 4), G = j >> 8 == 0, K = j >> 8 == 3, te = A.subarray(O, $), Z = he(P, v + 32), J = H + Z, Y = A.subarray(H, J), ee = M, Pe = M, de = ce(P, v + 38), le = G && (xt(P, v + 38) & Rr) == Rr || K && (de >> 16 & Fr) == Fr || te.length && te[te.length - 1] == Ir.charCodeAt(0), wt = K && (de >> 16 & Cr) == Cr, qe = ce(P, v + 42) + d;
+      Object.assign(E, {
         versionMadeBy: j,
-        msDosCompatible: K,
+        msDosCompatible: G,
         compressedSize: 0,
         uncompressedSize: 0,
         commentLength: Z,
         directory: le,
         offset: qe,
-        diskNumberStart: me(D, y + 34),
-        internalFileAttributes: me(D, y + 36),
+        diskNumberStart: he(P, v + 34),
+        internalFileAttributes: he(P, v + 36),
         externalFileAttributes: de,
-        rawFilename: oe,
+        rawFilename: te,
         filenameUTF8: ee,
         commentUTF8: Pe,
-        rawExtraField: T.subarray(Y, H),
+        rawExtraField: A.subarray($, H),
         executable: wt
-      }), S.internalFileAttribute = S.internalFileAttributes, S.externalFileAttribute = S.externalFileAttributes;
+      }), E.internalFileAttribute = E.internalFileAttributes, E.externalFileAttribute = E.externalFileAttributes;
       const at = ve(e, t, "decodeText") || Yt, et = ee ? Kr : R || Xr, tt = Pe ? Kr : F || Xr;
-      let ge = at(oe, et);
-      ge === ke && (ge = Yt(oe, et));
-      let fe = at($, tt);
-      fe === ke && (fe = Yt($, tt)), Object.assign(S, {
-        rawComment: $,
+      let ge = at(te, et);
+      ge === Ee && (ge = Yt(te, et));
+      let fe = at(Y, tt);
+      fe === Ee && (fe = Yt(Y, tt)), Object.assign(E, {
+        rawComment: Y,
         filename: ge,
         comment: fe,
         directory: le || ge.endsWith(Ir)
-      }), h = Math.max(qe, h), zi(S, S, D, y + 6), S.zipCrypto = S.encrypted && !S.extraFieldAES;
-      const je = new Zr(S);
-      je.getData = (u, i) => S.getData(u, je, i), y = J;
+      }), h = Math.max(qe, h), zi(E, E, P, v + 6), E.zipCrypto = E.encrypted && !E.extraFieldAES;
+      const je = new Zr(E);
+      je.getData = (u, i) => E.getData(u, je, i), v = J;
       const { onprogress: ue } = t;
       if (ue)
         try {
-          await ue(v + 1, m, new Zr(S));
+          await ue(b + 1, m, new Zr(E));
         } catch {
         }
       yield je;
     }
-    const b = ve(e, t, "extractPrependedData"), C = ve(e, t, "extractAppendedData");
-    return b && (e.prependedData = h > 0 ? await _e(r, 0, h) : new Uint8Array()), e.comment = x ? await _e(r, _ + ut, x) : new Uint8Array(), C && (e.appendedData = w < r.size ? await _e(r, w, r.size - w) : new Uint8Array()), !0;
+    const y = ve(e, t, "extractPrependedData"), D = ve(e, t, "extractAppendedData");
+    return y && (e.prependedData = h > 0 ? await _e(r, 0, h) : new Uint8Array()), e.comment = x ? await _e(r, _ + ut, x) : new Uint8Array(), D && (e.appendedData = w < r.size ? await _e(r, w, r.size - w) : new Uint8Array()), !0;
   }
   async getEntries(t = {}) {
     const e = [];
@@ -7599,75 +7599,75 @@ class pc {
       config: x,
       bitFlag: w,
       signature: g,
-      rawLastModDate: k,
-      uncompressedSize: P,
+      rawLastModDate: T,
+      uncompressedSize: C,
       compressedSize: m
-    } = s, d = e.localDirectory = {}, h = await _e(a, c, 30, l), y = he(h);
-    let T = ve(s, r, "password"), D = ve(s, r, "rawPassword");
-    const A = ve(s, r, "passThrough");
-    if (T = T && T.length && T, D = D && D.length && D, f && f.originalCompressionMethod != Co)
+    } = s, d = e.localDirectory = {}, h = await _e(a, c, 30, l), v = xe(h);
+    let A = ve(s, r, "password"), P = ve(s, r, "rawPassword");
+    const S = ve(s, r, "passThrough");
+    if (A = A && A.length && A, P = P && P.length && P, f && f.originalCompressionMethod != Co)
       throw new Error(Vr);
-    if (_ != Fo && _ != Ro && !A)
+    if (_ != Fo && _ != Ro && !S)
       throw new Error(Vr);
-    if (ce(y, 0) != Io)
+    if (ce(v, 0) != Io)
       throw new Error(ac);
-    Xi(d, y, 4), d.rawExtraField = d.extraFieldLength ? await _e(a, c + 30 + d.filenameLength, d.extraFieldLength, l) : new Uint8Array(), zi(s, d, y, 4, !0), Object.assign(e, {
+    Xi(d, v, 4), d.rawExtraField = d.extraFieldLength ? await _e(a, c + 30 + d.filenameLength, d.extraFieldLength, l) : new Uint8Array(), zi(s, d, v, 4, !0), Object.assign(e, {
       lastAccessDate: d.lastAccessDate,
       creationDate: d.creationDate
     });
-    const R = s.encrypted && d.encrypted && !A, F = R && !f;
-    if (A || (e.zipCrypto = F), R) {
-      if (!F && f.strength === ke)
+    const R = s.encrypted && d.encrypted && !S, F = R && !f;
+    if (S || (e.zipCrypto = F), R) {
+      if (!F && f.strength === Ee)
         throw new Error(fc);
-      if (!T && !D)
+      if (!A && !P)
         throw new Error(lc);
     }
-    const b = c + 30 + d.filenameLength + d.extraFieldLength, C = m, v = a.readable;
-    Object.assign(v, {
+    const y = c + 30 + d.filenameLength + d.extraFieldLength, D = m, b = a.readable;
+    Object.assign(b, {
       diskNumberStart: l,
-      offset: b,
-      size: C
+      offset: y,
+      size: D
     });
-    const S = ve(s, r, "signal"), M = ve(s, r, "checkPasswordOnly");
-    M && (t = new WritableStream()), t = Na(t), await Jt(t, A ? m : P);
-    const { writable: L } = t, { onstart: Y, onprogress: H, onend: j } = r, K = {
+    const E = ve(s, r, "signal"), M = ve(s, r, "checkPasswordOnly");
+    M && (t = new WritableStream()), t = Na(t), await Jt(t, S ? m : C);
+    const { writable: O } = t, { onstart: $, onprogress: H, onend: j } = r, G = {
       options: {
         codecType: Ui,
-        password: T,
-        rawPassword: D,
+        password: A,
+        rawPassword: P,
         zipCrypto: F,
         encryptionStrength: f && f.strength,
-        signed: ve(s, r, "checkSignature") && !A,
-        passwordVerification: F && (w.dataDescriptor ? k >>> 8 & 255 : g >>> 24 & 255),
+        signed: ve(s, r, "checkSignature") && !S,
+        passwordVerification: F && (w.dataDescriptor ? T >>> 8 & 255 : g >>> 24 & 255),
         signature: g,
-        compressed: _ != 0 && !A,
-        encrypted: s.encrypted && !A,
+        compressed: _ != 0 && !S,
+        encrypted: s.encrypted && !S,
         useWebWorkers: ve(s, r, "useWebWorkers"),
         useCompressionStream: ve(s, r, "useCompressionStream"),
         transferStreams: ve(s, r, "transferStreams"),
         checkPasswordOnly: M
       },
       config: x,
-      streamOptions: { signal: S, size: C, onstart: Y, onprogress: H, onend: j }
+      streamOptions: { signal: E, size: D, onstart: $, onprogress: H, onend: j }
     };
-    let V = 0;
+    let K = 0;
     try {
-      ({ outputSize: V } = await Ia({ readable: v, writable: L }, K));
-    } catch (oe) {
-      if (!M || oe.message != Mn)
-        throw oe;
+      ({ outputSize: K } = await Ia({ readable: b, writable: O }, G));
+    } catch (te) {
+      if (!M || te.message != Mn)
+        throw te;
     } finally {
-      const oe = ve(s, r, "preventClose");
-      L.size += V, !oe && !L.locked && await L.getWriter().close();
+      const te = ve(s, r, "preventClose");
+      O.size += K, !te && !O.locked && await O.getWriter().close();
     }
-    return M ? ke : t.getData ? t.getData() : L;
+    return M ? Ee : t.getData ? t.getData() : O;
   }
 }
 function Xi(n, t, e) {
-  const r = n.rawBitFlag = me(t, e + 2), s = (r & Sr) == Sr, a = ce(t, e + 6);
+  const r = n.rawBitFlag = he(t, e + 2), s = (r & Sr) == Sr, a = ce(t, e + 6);
   Object.assign(n, {
     encrypted: s,
-    version: me(t, e),
+    version: he(t, e),
     bitFlag: {
       level: (r & Ho) >> 1,
       dataDescriptor: (r & Ar) == Ar,
@@ -7675,24 +7675,24 @@ function Xi(n, t, e) {
     },
     rawLastModDate: a,
     lastModDate: _c(a),
-    filenameLength: me(t, e + 22),
-    extraFieldLength: me(t, e + 24)
+    filenameLength: he(t, e + 22),
+    extraFieldLength: he(t, e + 24)
   });
 }
 function zi(n, t, e, r, s) {
-  const { rawExtraField: a } = t, c = t.extraField = /* @__PURE__ */ new Map(), l = he(new Uint8Array(a));
+  const { rawExtraField: a } = t, c = t.extraField = /* @__PURE__ */ new Map(), l = xe(new Uint8Array(a));
   let f = 0;
   try {
     for (; f < a.length; ) {
-      const h = me(l, f), y = me(l, f + 2);
+      const h = he(l, f), v = he(l, f + 2);
       c.set(h, {
         type: h,
-        data: a.slice(f + 4, f + 4 + y)
-      }), f += 4 + y;
+        data: a.slice(f + 4, f + 4 + v)
+      }), f += 4 + v;
     }
   } catch {
   }
-  const _ = me(e, r + 4);
+  const _ = he(e, r + 4);
   Object.assign(t, {
     signature: ce(e, r + 10),
     uncompressedSize: ce(e, r + 18),
@@ -7704,10 +7704,10 @@ function zi(n, t, e, r, s) {
   w && (Jr(w, qi, ji, t, n), t.extraFieldUnicodePath = w);
   const g = c.get(qo);
   g && (Jr(g, Hi, $i, t, n), t.extraFieldUnicodeComment = g);
-  const k = c.get(Oo);
-  k ? (hc(k, t, _), t.extraFieldAES = k) : t.compressionMethod = _;
-  const P = c.get(Bo);
-  P && (xc(P, t), t.extraFieldNTFS = P);
+  const T = c.get(Oo);
+  T ? (hc(T, t, _), t.extraFieldAES = T) : t.compressionMethod = _;
+  const C = c.get(Bo);
+  C && (xc(C, t), t.extraFieldNTFS = C);
   const m = c.get(Mo);
   m && (wc(m, t, s), t.extraFieldExtendedTimestamp = m);
   const d = c.get(jo);
@@ -7715,7 +7715,7 @@ function zi(n, t, e, r, s) {
 }
 function mc(n, t) {
   t.zip64 = !0;
-  const e = he(n.data), r = uc.filter(([s, a]) => t[s] == a);
+  const e = xe(n.data), r = uc.filter(([s, a]) => t[s] == a);
   for (let s = 0, a = 0; s < r.length; s++) {
     const [c, l] = r[s];
     if (t[c] == l) {
@@ -7726,9 +7726,9 @@ function mc(n, t) {
   }
 }
 function Jr(n, t, e, r, s) {
-  const a = he(n.data), c = new Xt();
+  const a = xe(n.data), c = new Xt();
   c.append(s[e]);
-  const l = he(new Uint8Array(4));
+  const l = xe(new Uint8Array(4));
   l.setUint32(0, c.get(), !0);
   const f = ce(a, 1);
   Object.assign(n, {
@@ -7738,28 +7738,28 @@ function Jr(n, t, e, r, s) {
   }), n.valid && (r[t] = n[t], r[t + "UTF8"] = !0);
 }
 function hc(n, t, e) {
-  const r = he(n.data), s = xt(r, 4);
+  const r = xe(n.data), s = xt(r, 4);
   Object.assign(n, {
     vendorVersion: xt(r, 0),
     vendorId: xt(r, 2),
     strength: s,
     originalCompressionMethod: e,
-    compressionMethod: me(r, 5)
+    compressionMethod: he(r, 5)
   }), t.compressionMethod = n.compressionMethod;
 }
 function xc(n, t) {
-  const e = he(n.data);
+  const e = xe(n.data);
   let r = 4, s;
   try {
     for (; r < n.data.length && !s; ) {
-      const a = me(e, r), c = me(e, r + 2);
+      const a = he(e, r), c = he(e, r + 2);
       a == Wo && (s = n.data.slice(r + 4, r + 4 + c)), r += 4 + c;
     }
   } catch {
   }
   try {
     if (s && s.length == 24) {
-      const a = he(s), c = a.getBigUint64(0, !0), l = a.getBigUint64(8, !0), f = a.getBigUint64(16, !0);
+      const a = xe(s), c = a.getBigUint64(0, !0), l = a.getBigUint64(8, !0), f = a.getBigUint64(16, !0);
       Object.assign(n, {
         rawLastModDate: c,
         rawLastAccessDate: l,
@@ -7772,7 +7772,7 @@ function xc(n, t) {
   }
 }
 function wc(n, t, e) {
-  const r = he(n.data), s = xt(r, 0), a = [], c = [];
+  const r = xe(n.data), s = xt(r, 0), a = [], c = [];
   e ? ((s & 1) == 1 && (a.push(Cn), c.push(In)), (s & 2) == 2 && (a.push(Gi), c.push(Ha)), (s & 4) == 4 && (a.push(Ki), c.push($a))) : n.data.length >= 5 && (a.push(Cn), c.push(In));
   let l = 1;
   a.forEach((f, _) => {
@@ -7786,7 +7786,7 @@ function wc(n, t, e) {
   });
 }
 async function gc(n, t, e, r, s) {
-  const a = new Uint8Array(4), c = he(a);
+  const a = new Uint8Array(4), c = xe(a);
   yc(c, 0, t);
   const l = r + s;
   return await f(r) || await f(Math.min(l, e));
@@ -7801,7 +7801,7 @@ async function gc(n, t, e, r, s) {
   }
 }
 function ve(n, t, e) {
-  return t[e] === ke ? n.options[e] : t[e];
+  return t[e] === Ee ? n.options[e] : t[e];
 }
 function _c(n) {
   const t = (n & 4294901760) >> 16, e = n & 65535;
@@ -7816,7 +7816,7 @@ function bn(n) {
 function xt(n, t) {
   return n.getUint8(t);
 }
-function me(n, t) {
+function he(n, t) {
   return n.getUint16(t, !0);
 }
 function ce(n, t) {
@@ -7828,7 +7828,7 @@ function Zt(n, t) {
 function yc(n, t, e) {
   n.setUint32(t, e, !0);
 }
-function he(n) {
+function xe(n) {
   return new DataView(n.buffer);
 }
 let Ji;
@@ -7948,7 +7948,7 @@ class vc {
     );
   }
 }
-class Ec {
+class kc {
   constructor(t) {
     this.root = t;
   }
@@ -7985,7 +7985,7 @@ class Ec {
           )
         ) : e(
           new Vt(
-            kc(a),
+            Ec(a),
             t,
             {
               filesize: l.size
@@ -7996,7 +7996,7 @@ class Ec {
     });
   }
 }
-function kc(n) {
+function Ec(n) {
   return new ReadableStream({
     start(e) {
       n.on("data", (r) => e.enqueue(r)), n.on("end", () => e.close());
@@ -8034,7 +8034,7 @@ async function Sc({
           `Blueprint file at ${e} is not a valid JSON file`
         );
       }
-      const c = Je.dirname(e), l = new Ec(c);
+      const c = Je.dirname(e), l = new kc(c);
       return new vc([
         new bc({
           "blueprint.json": a
@@ -8210,7 +8210,7 @@ async function Ac(n) {
   let t, e;
   const r = [];
   n.autoMount && (n = _s(n));
-  async function s(k) {
+  async function s(C) {
     await e.run({
       code: `<?php
 			$zip = new ZipArchive();
@@ -8231,11 +8231,11 @@ async function Ac(n) {
 
 		`
     });
-    const P = await e.readFileAsBuffer("/tmp/build.zip");
-    ye.writeFileSync(k, P);
+    const m = await e.readFileAsBuffer("/tmp/build.zip");
+    ye.writeFileSync(C, m);
   }
   async function a() {
-    const k = cs(n.blueprint) ? n.blueprint : {
+    const C = cs(n.blueprint) ? n.blueprint : {
       login: n.login,
       ...n.blueprint,
       preferredVersions: {
@@ -8243,136 +8243,140 @@ async function Ac(n) {
         wp: n.wp ?? n?.blueprint?.preferredVersions?.wp ?? "latest",
         ...n.blueprint?.preferredVersions || {}
       }
-    }, P = new rs();
-    let m = "", d = !1;
-    return P.addEventListener("progress", (h) => {
-      if (d)
+    }, m = new rs();
+    let d = "", h = !1;
+    return m.addEventListener("progress", (v) => {
+      if (h)
         return;
-      d = h.detail.progress === 100;
-      const y = Math.floor(h.detail.progress);
-      m = h.detail.caption || m || "Running the Blueprint";
-      const T = `${m.trim()} – ${y}%`;
+      h = v.detail.progress === 100;
+      const A = Math.floor(v.detail.progress);
+      d = v.detail.caption || d || "Running the Blueprint";
+      const P = `${d.trim()} – ${A}%`;
       n.quiet || l(
         process.stdout,
-        T,
-        d
+        P,
+        h
       );
-    }), await ls(k, {
-      progress: P
+    }), await ls(C, {
+      progress: m
     });
   }
   let c = "";
-  function l(k, P, m) {
-    P !== c && (c = P, k.isTTY ? (k.cursorTo(0), k.write(P), k.clearLine(1), m && k.write(`
-`)) : k.write(`${P}
+  function l(C, m, d) {
+    m !== c && (c = m, C.isTTY ? (C.cursorTo(0), C.write(m), C.clearLine(1), d && C.write(`
+`)) : C.write(`${m}
 `));
   }
-  async function f(k) {
-    const P = new ds(k);
-    return new Promise((m, d) => {
-      function h(T) {
-        T === "worker-script-initialized" && (m(P), P.off("message", h));
+  async function f(C) {
+    const m = new ds(C);
+    return new Promise((d, h) => {
+      function v(P) {
+        P === "worker-script-initialized" && (d(m), m.off("message", v));
       }
-      function y(T) {
-        const D = new Error(
-          `Worker failed to load at ${k}. ${T.message ? `Original error: ${T.message}` : ""}`
+      function A(P) {
+        const S = new Error(
+          `Worker failed to load at ${C}. ${P.message ? `Original error: ${P.message}` : ""}`
         );
-        D.filename = k, d(D), P.off("error", y);
+        S.filename = C, h(S), m.off("error", A);
       }
-      P.on("message", h), P.on("error", y);
+      m.on("message", v), m.on("error", A);
     });
   }
-  function _(k) {
-    const P = new URL(
+  function _(C) {
+    const m = new URL(
       As,
       import.meta.url
-    ), m = [];
-    for (let d = 0; d < k; d++)
-      m.push(f(P));
-    return Promise.all(m);
-  }
-  n.quiet && (xe.handlers = []);
-  const x = await a(), w = new ws();
-  let g = !1;
-  return xe.log("Starting a PHP server..."), Es({
+    ), d = [];
+    for (let h = 0; h < C; h++)
+      d.push(f(m));
+    return Promise.all(d);
+  }
+  n.quiet && (me.handlers = []);
+  const x = await a(), w = await import("fs-ext").then((C) => C.flockSync).catch(() => {
+    me.warn(
+      "The fs-ext package is not installed. Internal file locking will not be integrated with host OS file locking."
+    );
+  }), g = new ws(w);
+  let T = !1;
+  return me.log("Starting a PHP server..."), ks({
     port: n.port,
-    onBind: async (k, P) => {
-      const m = `http://127.0.0.1:${P}`, d = n.experimentalMultiWorker ?? 1, h = _(d);
-      xe.log(`Setting up WordPress ${n.wp}`);
-      let y;
-      const T = new is();
+    onBind: async (C, m) => {
+      const d = `http://127.0.0.1:${m}`, h = n.experimentalMultiWorker ?? 1, v = _(h);
+      me.log(`Setting up WordPress ${n.wp}`);
+      let A;
+      const P = new is();
       if (!n.skipWordPressSetup) {
-        let C = !1;
-        T.addEventListener("progress", (v) => {
-          if (C)
+        let b = !1;
+        P.addEventListener("progress", (E) => {
+          if (b)
             return;
-          const { loaded: S, total: M } = v.detail, L = Math.floor(
-            Math.min(100, 100 * S / M)
+          const { loaded: M, total: O } = E.detail, $ = Math.floor(
+            Math.min(100, 100 * M / O)
           );
-          C = L === 100, n.quiet || l(
+          b = $ === 100, n.quiet || l(
             process.stdout,
-            `Downloading WordPress ${L}%...`,
-            C
+            `Downloading WordPress ${$}%...`,
+            b
           );
-        }), y = await ps(n.wp), xe.log(
-          `Resolved WordPress release URL: ${y?.releaseUrl}`
+        }), A = await ps(n.wp), me.log(
+          `Resolved WordPress release URL: ${A?.releaseUrl}`
         );
       }
-      const D = y && Je.join(
-        En,
-        `prebuilt-wp-content-for-wp-${y.version}.zip`
-      ), A = y ? ye.existsSync(D) ? si(D) : await ii(
-        y.releaseUrl,
-        `${y.version}.zip`,
-        T
+      const S = A && Je.join(
+        kn,
+        `prebuilt-wp-content-for-wp-${A.version}.zip`
+      ), R = A ? ye.existsSync(S) ? si(S) : await ii(
+        A.releaseUrl,
+        `${A.version}.zip`,
+        P
       ) : void 0;
-      xe.log("Fetching SQLite integration plugin...");
-      const R = n.skipSqliteSetup ? void 0 : await bs(T), F = n.followSymlinks === !0, b = n.experimentalTrace === !0;
+      me.log("Fetching SQLite integration plugin...");
+      const F = n.skipSqliteSetup ? void 0 : await bs(P), y = n.followSymlinks === !0, D = n.experimentalTrace === !0;
       try {
-        const C = n.mountBeforeInstall || [], v = n.mount || [], [S, ...M] = await h;
-        e = Yn(S), r.push({
+        const b = n.mountBeforeInstall || [], E = n.mount || [], [M, ...O] = await v;
+        e = Yn(M), r.push({
           playground: e,
-          worker: S
-        }), await e.isConnected(), Zn(w, void 0, S), xe.log("Booting WordPress...");
-        const L = Math.floor(
-          Number.MAX_SAFE_INTEGER / d
+          worker: M
+        }), await e.isConnected(), Zn(g, void 0, M), me.log("Booting WordPress...");
+        const $ = Math.floor(
+          Number.MAX_SAFE_INTEGER / h
         );
         if (await e.boot({
           phpVersion: x.versions.php,
           wpVersion: x.versions.wp,
-          absoluteUrl: m,
-          mountsBeforeWpInstall: C,
-          mountsAfterWpInstall: v,
-          wordPressZip: A && await A.arrayBuffer(),
-          sqliteIntegrationPluginZip: await R.arrayBuffer(),
+          absoluteUrl: d,
+          mountsBeforeWpInstall: b,
+          mountsAfterWpInstall: E,
+          wordPressZip: R && await R.arrayBuffer(),
+          sqliteIntegrationPluginZip: await F.arrayBuffer(),
           firstProcessId: 0,
-          processIdSpaceLength: L,
-          followSymlinks: F,
-          trace: b
-        }), y && !n.mountBeforeInstall && !ye.existsSync(D) && (xe.log(
+          processIdSpaceLength: $,
+          followSymlinks: y,
+          trace: D
+        }), A && !n.mountBeforeInstall && !ye.existsSync(S) && (me.log(
           "Caching preinstalled WordPress for the next boot..."
         ), ye.writeFileSync(
-          D,
+          S,
           await Vn(e, "/wordpress")
-        ), xe.log("Cached!")), t = new Ts(e), await e.isReady(), g = !0, xe.log("Booted!"), x && (xe.log("Running the Blueprint..."), await fs(x, e), xe.log("Finished running the blueprint")), n.command === "build-snapshot" ? (await s(n.outfile), xe.log(`WordPress exported to ${n.outfile}`), process.exit(0)) : n.command === "run-blueprint" && (xe.log("Blueprint executed"), process.exit(0)), n.experimentalMultiWorker && n.experimentalMultiWorker > 1) {
-          xe.log("Preparing additional workers...");
-          const Y = await Vn(
+        ), me.log("Cached!")), t = new Ts(e), await e.isReady(), T = !0, me.log("Booted!"), x && (me.log("Running the Blueprint..."), await fs(x, e), me.log("Finished running the blueprint")), n.command === "build-snapshot" ? (await s(n.outfile), me.log(`WordPress exported to ${n.outfile}`), process.exit(0)) : n.command === "run-blueprint" && (me.log("Blueprint executed"), process.exit(0)), n.experimentalMultiWorker && n.experimentalMultiWorker > 1) {
+          me.log("Preparing additional workers...");
+          const H = await Vn(
             e,
             "/internal"
-          ), H = L;
+          ), j = $;
           await Promise.all(
-            M.map(async (j, K) => {
-              const V = Yn(j);
+            O.map(async (G, K) => {
+              const te = Yn(G);
               r.push({
-                playground: V,
-                worker: j
-              }), await V.isConnected(), Zn(w, void 0, j);
-              const oe = H + K * L;
-              await V.boot({
+                playground: te,
+                worker: G
+              }), await te.isConnected(), Zn(g, void 0, G);
+              const Z = j + K * $;
+              await te.boot({
                 phpVersion: x.versions.php,
-                absoluteUrl: m,
-                mountsBeforeWpInstall: C,
-                mountsAfterWpInstall: v,
+                absoluteUrl: d,
+                mountsBeforeWpInstall: b,
+                mountsAfterWpInstall: E,
                 // Skip WordPress zip because we share the /wordpress directory
                 // populated by the initial worker.
                 wordPressZip: void 0,
@@ -8380,45 +8384,45 @@ async function Ac(n) {
                 // will copy it from primary's `/internal` directory.
                 sqliteIntegrationPluginZip: void 0,
                 dataSqlPath: "/wordpress/wp-content/database/.ht.sqlite",
-                firstProcessId: oe,
-                processIdSpaceLength: L,
-                followSymlinks: F,
-                trace: b
-              }), await V.isReady(), await V.writeFile(
+                firstProcessId: Z,
+                processIdSpaceLength: $,
+                followSymlinks: y,
+                trace: D
+              }), await te.isReady(), await te.writeFile(
                 "/tmp/internal.zip",
-                Y
+                H
               ), await us(
-                V,
+                te,
                 "/tmp/internal.zip",
                 "/internal"
-              ), await V.unlink(
+              ), await te.unlink(
                 "/tmp/internal.zip"
-              ), t.addWorker(V);
+              ), t.addWorker(te);
             })
-          ), xe.log("Ready!");
+          ), me.log("Ready!");
         }
-        return xe.log(`WordPress is running on ${m}`), {
+        return me.log(`WordPress is running on ${d}`), {
           playground: e,
-          server: k,
+          server: C,
           [Symbol.asyncDispose]: async function() {
             await Promise.all(
               r.map(
-                async ({ playground: H, worker: j }) => {
-                  await H.dispose(), await j.terminate();
+                async ({ playground: j, worker: G }) => {
+                  await j.dispose(), await G.terminate();
                 }
               )
-            ), await new Promise((H) => k.close(H));
+            ), await new Promise((j) => C.close(j));
           }
         };
-      } catch (C) {
+      } catch (b) {
         if (!n.debug)
-          throw C;
-        const v = await e.readFileAsText(ns);
-        throw new Error(v, { cause: C });
+          throw b;
+        const E = await e.readFileAsText(ns);
+        throw new Error(E, { cause: b });
       }
     },
-    async handleRequest(k) {
-      return g ? await t.handleRequest(k) : os.forHttpCode(
+    async handleRequest(C) {
+      return T ? await t.handleRequest(C) : os.forHttpCode(
         502,
         "WordPress is not ready yet"
       );
@@ -8429,4 +8433,4 @@ export {
   jc as p,
   Ac as r
 };
-//# sourceMappingURL=run-cli-bX1Rsm_j.js.map
+//# sourceMappingURL=run-cli-CbJy_CRO.js.map