@wp-playground/cli 1.2.1 → 1.2.2

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

@@ -1,34 +1,35 @@
-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 { logger as me, errorLogPath as ts } from "@php-wasm/logger";
+import { ProgressTracker as ns, EmscriptenDownloadMonitor as rs } from "@php-wasm/progress";
+import { SupportedPHPVersions as is, PHPResponse as ss, consumeAPI as Yn, exposeAPI as os, exposeSyncAPI as as } from "@php-wasm/universal";
+import { resolveRemoteBlueprint as cs, isBlueprintBundle as ls, compileBlueprint as fs, runBlueprintSteps as us } from "@wp-playground/blueprints";
+import { RecommendedPHPVersion as Jr, zipDirectory as Zn, unzipFile as ds } from "@wp-playground/common";
+import ye, { existsSync as Qr } from "fs";
 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 { MessageChannel as ps, Worker as ms } from "worker_threads";
+import { resolveWordPressRelease as hs } from "@wp-playground/wordpress";
 import mt from "fs-extra";
-import ms, { cpus as hs } from "os";
-import xs from "express";
-import { FileLockManagerForNode as ws } from "@php-wasm/node";
-import gs from "yargs";
+import xs, { cpus as ws } from "os";
+import gs from "express";
+import { FileLockManagerForNode as _s } from "@php-wasm/node";
+import { j as ys } from "./index-CddYZc1x.js";
+import bs from "yargs";
 import { Semaphore as Dn } from "@php-wasm/util";
-function _s(n) {
+function vs(n) {
   const t = process.cwd(), e = [...n.mount || []], r = [...n.mountBeforeInstall || []];
-  if (ri(t)) {
+  if (ni(t)) {
     const c = Et(t);
     e.push({
       hostPath: t,
       vfsPath: `/wordpress/wp-content/plugins/${c}`
     });
-  } else if (ni(t)) {
+  } else if (ti(t)) {
     const c = Et(t);
     e.push({
       hostPath: t,
       vfsPath: `/wordpress/wp-content/themes/${c}`
     });
-  } else if (ti(t))
-    e.push(...Gn(t));
+  } else if (ei(t))
+    e.push(...Vn(t));
   else if (vn(t)) {
     const c = ye.readdirSync(t), l = [];
     for (const f of c)
@@ -38,12 +39,12 @@ function _s(n) {
       });
     r.push(
       ...l,
-      ...Gn(Pn(t, "wp-content"))
+      ...Vn(Pn(t, "wp-content"))
     );
   } else
     e.push({ hostPath: t, vfsPath: "/wordpress" });
   const s = n.blueprint || {};
-  s.steps = [...s.steps || [], ...ys(t)];
+  s.steps = [...s.steps || [], ...ks(t)];
   const a = n.skipWordPressSetup || vn(t);
   return {
     ...n,
@@ -57,41 +58,41 @@ function vn(n) {
   const t = ye.readdirSync(n);
   return t.includes("wp-admin") && t.includes("wp-includes") && t.includes("wp-content");
 }
-function ti(n) {
+function ei(n) {
   const t = ye.readdirSync(n);
   return t.includes("themes") || t.includes("plugins") || t.includes("mu-plugins") || t.includes("uploads");
 }
-function ni(n) {
+function ti(n) {
   if (!ye.readdirSync(n).includes("style.css"))
     return !1;
   const e = ye.readFileSync(Pn(n, "style.css"), "utf8");
   return !!/^(?:[ \t]*<\?php)?[ \t/*#@]*Theme Name:(.*)$/im.exec(e);
 }
-function ri(n) {
+function ni(n) {
   const t = ye.readdirSync(n), e = /^(?:[ \t]*<\?php)?[ \t/*#@]*Plugin Name:(.*)$/im;
   return !!t.filter((s) => s.endsWith(".php")).find((s) => {
     const a = ye.readFileSync(Pn(n, s), "utf8");
     return !!e.exec(a);
   });
 }
-function Gn(n) {
+function Vn(n) {
   return ye.readdirSync(n).filter((e) => !e.startsWith("index.php")).map((e) => ({
     hostPath: `${n}/${e}`,
     vfsPath: `/wordpress/wp-content/${e}`
   }));
 }
-function ys(n) {
-  return ri(n) ? [
+function ks(n) {
+  return ni(n) ? [
     {
       step: "activatePlugin",
       pluginPath: `/wordpress/wp-content/plugins/${Et(n)}`
     }
-  ] : ni(n) ? [
+  ] : ti(n) ? [
     {
       step: "activateTheme",
       themeFolderName: Et(n)
     }
-  ] : ti(n) || vn(n) ? [
+  ] : ei(n) || vn(n) ? [
     {
       step: "runPHP",
       code: `<?php
@@ -108,19 +109,19 @@ function ys(n) {
     }
   ] : [];
 }
-const kn = Je.join(ms.homedir(), ".wordpress-playground");
-async function bs(n) {
-  return await ii(
+const kn = Je.join(xs.homedir(), ".wordpress-playground");
+async function Es(n) {
+  return await ri(
     "https://github.com/WordPress/sqlite-database-integration/archive/refs/heads/develop.zip",
     "sqlite.zip",
     n
   );
 }
-async function ii(n, t, e) {
+async function ri(n, t, e) {
   const r = Je.join(kn, t);
-  return mt.existsSync(r) || (mt.ensureDirSync(kn), await vs(n, r, e)), si(r);
+  return mt.existsSync(r) || (mt.ensureDirSync(kn), await Ss(n, r, e)), ii(r);
 }
-async function vs(n, t, e) {
+async function Ss(n, t, e) {
   const s = (await e.monitorFetch(fetch(n))).body.getReader(), a = `${t}.partial`, c = mt.createWriteStream(a);
   for (; ; ) {
     const { done: l, value: f } = await s.read();
@@ -135,11 +136,11 @@ async function vs(n, t, e) {
     });
   });
 }
-function si(n, t) {
+function ii(n, t) {
   return new File([mt.readFileSync(n)], Et(n));
 }
-async function ks(n) {
-  const t = xs(), e = await new Promise((a, c) => {
+async function As(n) {
+  const t = gs(), e = await new Promise((a, c) => {
     const l = t.listen(n.port, () => {
       const f = l.address();
       f === null || typeof f == "string" ? c(new Error("Server address is not available")) : a(l);
@@ -148,9 +149,9 @@ async function ks(n) {
   t.use("/", async (a, c) => {
     const l = await n.handleRequest({
       url: a.url,
-      headers: Ss(a),
+      headers: Rs(a),
       method: a.method,
-      body: await Es(a)
+      body: await Ts(a)
     });
     c.statusCode = l.httpStatusCode;
     for (const f in l.headers)
@@ -160,21 +161,21 @@ async function ks(n) {
   const s = e.address().port;
   return await n.onBind(e, s);
 }
-const Es = async (n) => await new Promise((t) => {
+const Ts = async (n) => await new Promise((t) => {
   const e = [];
   n.on("data", (r) => {
     e.push(r);
   }), n.on("end", () => {
     t(new Uint8Array(Buffer.concat(e)));
   });
-}), Ss = (n) => {
+}), Rs = (n) => {
   const t = {};
   if (n.rawHeaders && n.rawHeaders.length)
     for (let e = 0; e < n.rawHeaders.length; e += 2)
       t[n.rawHeaders[e].toLowerCase()] = n.rawHeaders[e + 1];
   return t;
-}, As = "" + new URL("worker-thread-BQ8BezvJ.js", import.meta.url).href;
-class Ts {
+}, Fs = "" + new URL("worker-thread-CQBM_bGk.js", import.meta.url).href;
+class Cs {
   constructor(t) {
     this.workerLoads = [], this.addWorker(t);
   }
@@ -196,11 +197,10 @@ class Ts {
     });
   }
 }
-const Rs = () => (async () => "Suspending" in WebAssembly)();
-function Fs(n) {
+function Is(n) {
   return /^latest$|^trunk$|^nightly$|^(?:(\d+)\.(\d+)(?:\.(\d+))?)((?:-beta(?:\d+)?)|(?:-RC(?:\d+)?))?$/.test(n);
 }
-function Kn(n) {
+function Gn(n) {
   const t = [];
   for (const e of n) {
     const r = e.split(":");
@@ -210,19 +210,19 @@ function Kn(n) {
 				If your path contains a colon, e.g. C:\\myplugin, use the --mount-dir option instead.
 				Example: --mount-dir C:\\my-plugin /wordpress/wp-content/plugins/my-plugin`);
     const [s, a] = r;
-    if (!ei(s))
+    if (!Qr(s))
       throw new Error(`Host path does not exist: ${s}`);
     t.push({ hostPath: s, vfsPath: a });
   }
   return t;
 }
-function Cs(n) {
+function Ps(n) {
   if (n.length % 2 !== 0)
     throw new Error("Invalid mount format. Expected: /host/path /vfs/path");
   const t = [];
   for (let e = 0; e < n.length; e += 2) {
     const r = n[e], s = n[e + 1];
-    if (!ei(r))
+    if (!Qr(r))
       throw new Error(`Host path does not exist: ${r}`);
     t.push({
       hostPath: Je.resolve(process.cwd(), r),
@@ -231,7 +231,7 @@ function Cs(n) {
   }
   return t;
 }
-class oi extends Error {
+class si extends Error {
   constructor(t, e) {
     super(t, {
       ...e,
@@ -279,7 +279,7 @@ class Ln extends Error {
     return !0;
   }
 }
-var Is = {};
+var Ds = {};
 /*! crc32.js (C) 2014-present SheetJS -- http://sheetjs.com */
 (function(n) {
   (function(t) {
@@ -287,48 +287,48 @@ var Is = {};
   })(function(t) {
     t.version = "1.2.2";
     function e() {
-      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;
+      for (var y = 0, P = new Array(256), k = 0; k != 256; ++k)
+        y = k, 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, P[k] = y;
+      return typeof Int32Array < "u" ? new Int32Array(P) : P;
     }
     var r = e();
     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];
+      var P = 0, k = 0, E = 0, B = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
+      for (E = 0; E != 256; ++E) B[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;
+        for (k = y[E], P = 256 + E; P < 4096; P += 256) k = B[P] = k >>> 8 ^ y[k & 255];
+      var L = [];
+      for (E = 1; E != 16; ++E) L[E - 1] = typeof Int32Array < "u" ? B.subarray(E * 256, E * 256 + 256) : B.slice(E * 256, E * 256 + 256);
+      return L;
     }
-    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;
+    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], O = a[8], m = a[9], d = a[10], h = a[11], b = a[12], R = a[13], C = a[14];
+    function S(y, P) {
+      for (var k = P ^ -1, E = 0, B = y.length; E < B; ) k = k >>> 8 ^ r[(k ^ y.charCodeAt(E++)) & 255];
+      return ~k;
     }
-    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 A(y, P) {
+      for (var k = P ^ -1, E = y.length - 15, B = 0; B < E; ) k = C[y[B++] ^ k & 255] ^ R[y[B++] ^ k >> 8 & 255] ^ b[y[B++] ^ k >> 16 & 255] ^ h[y[B++] ^ k >>> 24] ^ d[y[B++]] ^ m[y[B++]] ^ O[y[B++]] ^ T[y[B++]] ^ g[y[B++]] ^ w[y[B++]] ^ x[y[B++]] ^ _[y[B++]] ^ f[y[B++]] ^ l[y[B++]] ^ c[y[B++]] ^ r[y[B++]];
+      for (E += 15; B < E; ) k = k >>> 8 ^ r[(k ^ y[B++]) & 255];
+      return ~k;
     }
-    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;
+    function F(y, P) {
+      for (var k = P ^ -1, E = 0, B = y.length, L = 0, Y = 0; E < B; )
+        L = y.charCodeAt(E++), L < 128 ? k = k >>> 8 ^ r[(k ^ L) & 255] : L < 2048 ? (k = k >>> 8 ^ r[(k ^ (192 | L >> 6 & 31)) & 255], k = k >>> 8 ^ r[(k ^ (128 | L & 63)) & 255]) : L >= 55296 && L < 57344 ? (L = (L & 1023) + 64, Y = y.charCodeAt(E++) & 1023, k = k >>> 8 ^ r[(k ^ (240 | L >> 8 & 7)) & 255], k = k >>> 8 ^ r[(k ^ (128 | L >> 2 & 63)) & 255], k = k >>> 8 ^ r[(k ^ (128 | Y >> 6 & 15 | (L & 3) << 4)) & 255], k = k >>> 8 ^ r[(k ^ (128 | Y & 63)) & 255]) : (k = k >>> 8 ^ r[(k ^ (224 | L >> 12 & 15)) & 255], k = k >>> 8 ^ r[(k ^ (128 | L >> 6 & 63)) & 255], k = k >>> 8 ^ r[(k ^ (128 | L & 63)) & 255]);
+      return ~k;
     }
-    t.table = r, t.bstr = S, t.buf = R, t.str = F;
+    t.table = r, t.bstr = S, t.buf = A, t.str = F;
   });
-})(Is);
-var ai = {}, en = {};
-en.byteLength = Ls;
-en.toByteArray = Os;
-en.fromByteArray = Ms;
-var We = [], Ce = [], Ps = typeof Uint8Array < "u" ? Uint8Array : Array, on = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-for (var ct = 0, Ds = on.length; ct < Ds; ++ct)
-  We[ct] = on[ct], Ce[on.charCodeAt(ct)] = ct;
+})(Ds);
+var oi = {}, en = {};
+en.byteLength = Os;
+en.toByteArray = Bs;
+en.fromByteArray = qs;
+var Be = [], Ce = [], Ls = typeof Uint8Array < "u" ? Uint8Array : Array, on = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+for (var ct = 0, Us = on.length; ct < Us; ++ct)
+  Be[ct] = on[ct], Ce[on.charCodeAt(ct)] = ct;
 Ce[45] = 62;
 Ce[95] = 63;
-function ci(n) {
+function ai(n) {
   var t = n.length;
   if (t % 4 > 0)
     throw new Error("Invalid string. Length must be a multiple of 4");
@@ -337,34 +337,34 @@ function ci(n) {
   var r = e === t ? 0 : 4 - e % 4;
   return [e, r];
 }
-function Ls(n) {
-  var t = ci(n), e = t[0], r = t[1];
+function Os(n) {
+  var t = ai(n), e = t[0], r = t[1];
   return (e + r) * 3 / 4 - r;
 }
-function Us(n, t, e) {
+function Ws(n, t, e) {
   return (t + e) * 3 / 4 - e;
 }
-function Os(n) {
-  var t, e = ci(n), r = e[0], s = e[1], a = new Ps(Us(n, r, s)), c = 0, l = s > 0 ? r - 4 : r, f;
+function Bs(n) {
+  var t, e = ai(n), r = e[0], s = e[1], a = new Ls(Ws(n, r, s)), c = 0, l = s > 0 ? r - 4 : r, f;
   for (f = 0; f < l; f += 4)
     t = Ce[n.charCodeAt(f)] << 18 | Ce[n.charCodeAt(f + 1)] << 12 | Ce[n.charCodeAt(f + 2)] << 6 | Ce[n.charCodeAt(f + 3)], a[c++] = t >> 16 & 255, a[c++] = t >> 8 & 255, a[c++] = t & 255;
   return s === 2 && (t = Ce[n.charCodeAt(f)] << 2 | Ce[n.charCodeAt(f + 1)] >> 4, a[c++] = t & 255), s === 1 && (t = Ce[n.charCodeAt(f)] << 10 | Ce[n.charCodeAt(f + 1)] << 4 | Ce[n.charCodeAt(f + 2)] >> 2, a[c++] = t >> 8 & 255, a[c++] = t & 255), a;
 }
-function Bs(n) {
-  return We[n >> 18 & 63] + We[n >> 12 & 63] + We[n >> 6 & 63] + We[n & 63];
+function Ms(n) {
+  return Be[n >> 18 & 63] + Be[n >> 12 & 63] + Be[n >> 6 & 63] + Be[n & 63];
 }
-function Ws(n, t, e) {
+function Ns(n, t, e) {
   for (var r, s = [], a = t; a < e; a += 3)
-    r = (n[a] << 16 & 16711680) + (n[a + 1] << 8 & 65280) + (n[a + 2] & 255), s.push(Bs(r));
+    r = (n[a] << 16 & 16711680) + (n[a + 1] << 8 & 65280) + (n[a + 2] & 255), s.push(Ms(r));
   return s.join("");
 }
-function Ms(n) {
+function qs(n) {
   for (var t, e = n.length, r = e % 3, s = [], a = 16383, c = 0, l = e - r; c < l; c += a)
-    s.push(Ws(n, c, c + a > l ? l : c + a));
+    s.push(Ns(n, c, c + a > l ? l : c + a));
   return r === 1 ? (t = n[e - 1], s.push(
-    We[t >> 2] + We[t << 4 & 63] + "=="
+    Be[t >> 2] + Be[t << 4 & 63] + "=="
   )) : r === 2 && (t = (n[e - 2] << 8) + n[e - 1], s.push(
-    We[t >> 10] + We[t >> 4 & 63] + We[t << 2 & 63] + "="
+    Be[t >> 10] + Be[t >> 4 & 63] + Be[t << 2 & 63] + "="
   )), s.join("");
 }
 var Un = {};
@@ -385,12 +385,12 @@ Un.read = function(n, t, e, r, s) {
   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, 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)
+  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, O = 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 += O, l /= 256, s -= 8)
     ;
-  for (c = c << s | l, _ += s; _ > 0; n[e + T] = c & 255, T += C, c /= 256, _ -= 8)
+  for (c = c << s | l, _ += s; _ > 0; n[e + T] = c & 255, T += O, c /= 256, _ -= 8)
     ;
-  n[e + T - C] |= m * 128;
+  n[e + T - O] |= 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 = v, n.INSPECT_MAX_BYTES = 50;
+  n.Buffer = l, n.SlowBuffer = b, 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 C(u);
+      return O(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 k = d(u);
-    if (k) return k;
+    var v = d(u);
+    if (v) return v;
     if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof u[Symbol.toPrimitive] == "function")
       return l.from(
         u[Symbol.toPrimitive]("string"),
@@ -501,15 +501,15 @@ 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 = A(u, i) | 0, p = c(o), k = p.write(u, i);
-    return k !== o && (p = p.slice(0, k)), p;
+    var o = R(u, i) | 0, p = c(o), v = p.write(u, i);
+    return v !== o && (p = p.slice(0, v)), p;
   }
   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 C(u) {
+  function O(u) {
     if (fe(u, Uint8Array)) {
       var i = new Uint8Array(u);
       return m(i.buffer, i.byteOffset, i.byteLength);
@@ -539,7 +539,7 @@ Un.write = function(n, t, e, r, s, a) {
       throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + s.toString(16) + " bytes");
     return u | 0;
   }
-  function v(u) {
+  function b(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, k = o.length, L = 0, W = Math.min(p, k); L < W; ++L)
-      if (i[L] !== o[L]) {
-        p = i[L], k = o[L];
+    for (var p = i.length, v = o.length, D = 0, M = Math.min(p, v); D < M; ++D)
+      if (i[D] !== o[D]) {
+        p = i[D], v = o[D];
         break;
       }
-    return p < k ? -1 : k < p ? 1 : 0;
+    return p < v ? -1 : v < 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 k = l.allocUnsafe(o), L = 0;
+    var v = l.allocUnsafe(o), D = 0;
     for (p = 0; p < i.length; ++p) {
-      var W = i[p];
-      if (fe(W, Uint8Array))
-        L + W.length > k.length ? l.from(W).copy(k, L) : Uint8Array.prototype.set.call(
-          k,
-          W,
-          L
+      var M = i[p];
+      if (fe(M, Uint8Array))
+        D + M.length > v.length ? l.from(M).copy(v, D) : Uint8Array.prototype.set.call(
+          v,
+          M,
+          D
         );
-      else if (l.isBuffer(W))
-        W.copy(k, L);
+      else if (l.isBuffer(M))
+        M.copy(v, D);
       else
         throw new TypeError('"list" argument must be an Array of Buffers');
-      L += W.length;
+      D += M.length;
     }
-    return k;
+    return v;
   };
-  function A(u, i) {
+  function R(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 k = !1; ; )
+    for (var v = !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 (k)
+          if (v)
             return p ? -1 : qe(u).length;
-          i = ("" + i).toLowerCase(), k = !0;
+          i = ("" + i).toLowerCase(), v = !0;
       }
   }
-  l.byteLength = A;
-  function P(u, i, o) {
+  l.byteLength = R;
+  function C(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 te(this, i, o);
+          return re(this, i, o);
         case "utf8":
         case "utf-8":
-          return $(this, i, o);
+          return Y(this, i, o);
         case "ascii":
-          return G(this, i, o);
+          return K(this, i, o);
         case "latin1":
         case "binary":
-          return K(this, i, o);
+          return G(this, i, o);
         case "base64":
-          return O(this, i, o);
+          return L(this, i, o);
         case "ucs2":
         case "ucs-2":
         case "utf16le":
@@ -691,145 +691,145 @@ Un.write = function(n, t, e, r, s, a) {
     return this;
   }, l.prototype.toString = function() {
     var i = this.length;
-    return i === 0 ? "" : arguments.length === 0 ? $(this, 0, i) : P.apply(this, arguments);
+    return i === 0 ? "" : arguments.length === 0 ? Y(this, 0, i) : C.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, k, L) {
+  }, r && (l.prototype[r] = l.prototype.inspect), l.prototype.compare = function(i, o, p, v, D) {
     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), k === void 0 && (k = 0), L === void 0 && (L = this.length), o < 0 || p > i.length || k < 0 || L > this.length)
+    if (o === void 0 && (o = 0), p === void 0 && (p = i ? i.length : 0), v === void 0 && (v = 0), D === void 0 && (D = this.length), o < 0 || p > i.length || v < 0 || D > this.length)
       throw new RangeError("out of range index");
-    if (k >= L && o >= p)
+    if (v >= D && o >= p)
       return 0;
-    if (k >= L)
+    if (v >= D)
       return -1;
     if (o >= p)
       return 1;
-    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];
+    if (o >>>= 0, p >>>= 0, v >>>= 0, D >>>= 0, this === i) return 0;
+    for (var M = D - v, z = p - o, ne = Math.min(M, z), ie = this.slice(v, D), pe = i.slice(o, p), te = 0; te < ne; ++te)
+      if (ie[te] !== pe[te]) {
+        M = ie[te], z = pe[te];
         break;
       }
-    return W < X ? -1 : X < W ? 1 : 0;
+    return M < z ? -1 : z < M ? 1 : 0;
   };
-  function R(u, i, o, p, k) {
+  function A(u, i, o, p, v) {
     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 = k ? 0 : u.length - 1), o < 0 && (o = u.length + o), o >= u.length) {
-      if (k) return -1;
+    if (typeof o == "string" ? (p = o, o = 0) : o > 2147483647 ? o = 2147483647 : o < -2147483648 && (o = -2147483648), o = +o, je(o) && (o = v ? 0 : u.length - 1), o < 0 && (o = u.length + o), o >= u.length) {
+      if (v) return -1;
       o = u.length - 1;
     } else if (o < 0)
-      if (k) o = 0;
+      if (v) 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, k);
+      return i.length === 0 ? -1 : F(u, i, o, p, v);
     if (typeof i == "number")
-      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);
+      return i = i & 255, typeof Uint8Array.prototype.indexOf == "function" ? v ? Uint8Array.prototype.indexOf.call(u, i, o) : Uint8Array.prototype.lastIndexOf.call(u, i, o) : F(u, [i], o, p, v);
     throw new TypeError("val must be string, number or Buffer");
   }
-  function F(u, i, o, p, k) {
-    var L = 1, W = u.length, X = i.length;
+  function F(u, i, o, p, v) {
+    var D = 1, M = u.length, z = 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;
-      L = 2, W /= 2, X /= 2, o /= 2;
+      D = 2, M /= 2, z /= 2, o /= 2;
     }
-    function re(It, gt) {
-      return L === 1 ? It[gt] : It.readUInt16BE(gt * L);
+    function ne(It, gt) {
+      return D === 1 ? It[gt] : It.readUInt16BE(gt * D);
     }
     var ie;
-    if (k) {
+    if (v) {
       var pe = -1;
-      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;
+      for (ie = o; ie < M; ie++)
+        if (ne(u, ie) === ne(i, pe === -1 ? 0 : ie - pe)) {
+          if (pe === -1 && (pe = ie), ie - pe + 1 === z) return pe * D;
         } else
           pe !== -1 && (ie -= ie - pe), pe = -1;
     } else
-      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;
+      for (o + z > M && (o = M - z), ie = o; ie >= 0; ie--) {
+        for (var te = !0, Ye = 0; Ye < z; Ye++)
+          if (ne(u, ie + Ye) !== ne(i, Ye)) {
+            te = !1;
             break;
           }
-        if (ne) return ie;
+        if (te) return ie;
       }
     return -1;
   }
   l.prototype.includes = function(i, o, p) {
     return this.indexOf(i, o, p) !== -1;
   }, l.prototype.indexOf = function(i, o, p) {
-    return R(this, i, o, p, !0);
+    return A(this, i, o, p, !0);
   }, l.prototype.lastIndexOf = function(i, o, p) {
-    return R(this, i, o, p, !1);
+    return A(this, i, o, p, !1);
   };
   function y(u, i, o, p) {
     o = Number(o) || 0;
-    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;
-      u[o + W] = X;
+    var v = u.length - o;
+    p ? (p = Number(p), p > v && (p = v)) : p = v;
+    var D = i.length;
+    p > D / 2 && (p = D / 2);
+    for (var M = 0; M < p; ++M) {
+      var z = parseInt(i.substr(M * 2, 2), 16);
+      if (je(z)) return M;
+      u[o + M] = z;
     }
-    return W;
+    return M;
   }
-  function D(u, i, o, p) {
+  function P(u, i, o, p) {
     return ge(qe(i, u.length - o), u, o, p);
   }
-  function b(u, i, o, p) {
+  function k(u, i, o, p) {
     return ge(at(i), u, o, p);
   }
   function E(u, i, o, p) {
     return ge(tt(i), u, o, p);
   }
-  function M(u, i, o, p) {
+  function B(u, i, o, p) {
     return ge(et(i, u.length - o), u, o, p);
   }
-  l.prototype.write = function(i, o, p, k) {
+  l.prototype.write = function(i, o, p, v) {
     if (o === void 0)
-      k = "utf8", p = this.length, o = 0;
+      v = "utf8", p = this.length, o = 0;
     else if (p === void 0 && typeof o == "string")
-      k = o, p = this.length, o = 0;
+      v = o, p = this.length, o = 0;
     else if (isFinite(o))
-      o = o >>> 0, isFinite(p) ? (p = p >>> 0, k === void 0 && (k = "utf8")) : (k = p, p = void 0);
+      o = o >>> 0, isFinite(p) ? (p = p >>> 0, v === void 0 && (v = "utf8")) : (v = p, p = void 0);
     else
       throw new Error(
         "Buffer.write(string, encoding, offset[, length]) is no longer supported"
       );
-    var L = this.length - o;
-    if ((p === void 0 || p > L) && (p = L), i.length > 0 && (p < 0 || o < 0) || o > this.length)
+    var D = this.length - o;
+    if ((p === void 0 || p > D) && (p = D), i.length > 0 && (p < 0 || o < 0) || o > this.length)
       throw new RangeError("Attempt to write outside buffer bounds");
-    k || (k = "utf8");
-    for (var W = !1; ; )
-      switch (k) {
+    v || (v = "utf8");
+    for (var M = !1; ; )
+      switch (v) {
         case "hex":
           return y(this, i, o, p);
         case "utf8":
         case "utf-8":
-          return D(this, i, o, p);
+          return P(this, i, o, p);
         case "ascii":
         case "latin1":
         case "binary":
-          return b(this, i, o, p);
+          return k(this, i, o, p);
         case "base64":
           return E(this, i, o, p);
         case "ucs2":
         case "ucs-2":
         case "utf16le":
         case "utf-16le":
-          return M(this, i, o, p);
+          return B(this, i, o, p);
         default:
-          if (W) throw new TypeError("Unknown encoding: " + k);
-          k = ("" + k).toLowerCase(), W = !0;
+          if (M) throw new TypeError("Unknown encoding: " + v);
+          v = ("" + v).toLowerCase(), M = !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 O(u, i, o) {
+  function L(u, i, o) {
     return i === 0 && o === u.length ? t.fromByteArray(u) : t.fromByteArray(u.slice(i, o));
   }
-  function $(u, i, o) {
+  function Y(u, i, o) {
     o = Math.min(u.length, o);
-    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) {
+    for (var p = [], v = i; v < o; ) {
+      var D = u[v], M = null, z = D > 239 ? 4 : D > 223 ? 3 : D > 191 ? 2 : 1;
+      if (v + z <= o) {
+        var ne, ie, pe, te;
+        switch (z) {
           case 1:
-            L < 128 && (W = L);
+            D < 128 && (M = D);
             break;
           case 2:
-            re = u[k + 1], (re & 192) === 128 && (ne = (L & 31) << 6 | re & 63, ne > 127 && (W = ne));
+            ne = u[v + 1], (ne & 192) === 128 && (te = (D & 31) << 6 | ne & 63, te > 127 && (M = te));
             break;
           case 3:
-            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));
+            ne = u[v + 1], ie = u[v + 2], (ne & 192) === 128 && (ie & 192) === 128 && (te = (D & 15) << 12 | (ne & 63) << 6 | ie & 63, te > 2047 && (te < 55296 || te > 57343) && (M = te));
             break;
           case 4:
-            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));
+            ne = u[v + 1], ie = u[v + 2], pe = u[v + 3], (ne & 192) === 128 && (ie & 192) === 128 && (pe & 192) === 128 && (te = (D & 15) << 18 | (ne & 63) << 12 | (ie & 63) << 6 | pe & 63, te > 65535 && te < 1114112 && (M = te));
         }
       }
-      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;
+      M === null ? (M = 65533, z = 1) : M > 65535 && (M -= 65536, p.push(M >>> 10 & 1023 | 55296), M = 56320 | M & 1023), p.push(M), v += z;
     }
     return j(p);
   }
@@ -876,199 +876,199 @@ Un.write = function(n, t, e, r, s, a) {
       );
     return o;
   }
-  function G(u, i, o) {
+  function K(u, i, o) {
     var p = "";
     o = Math.min(u.length, o);
-    for (var k = i; k < o; ++k)
-      p += String.fromCharCode(u[k] & 127);
+    for (var v = i; v < o; ++v)
+      p += String.fromCharCode(u[v] & 127);
     return p;
   }
-  function K(u, i, o) {
+  function G(u, i, o) {
     var p = "";
     o = Math.min(u.length, o);
-    for (var k = i; k < o; ++k)
-      p += String.fromCharCode(u[k]);
+    for (var v = i; v < o; ++v)
+      p += String.fromCharCode(u[v]);
     return p;
   }
-  function te(u, i, o) {
+  function re(u, i, o) {
     var p = u.length;
     (!i || i < 0) && (i = 0), (!o || o < 0 || o > p) && (o = p);
-    for (var k = "", L = i; L < o; ++L)
-      k += ue[u[L]];
-    return k;
+    for (var v = "", D = i; D < o; ++D)
+      v += ue[u[D]];
+    return v;
   }
   function Z(u, i, o) {
-    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;
+    for (var p = u.slice(i, o), v = "", D = 0; D < p.length - 1; D += 2)
+      v += String.fromCharCode(p[D] + p[D + 1] * 256);
+    return v;
   }
   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 k = this.subarray(i, o);
-    return Object.setPrototypeOf(k, l.prototype), k;
+    var v = this.subarray(i, o);
+    return Object.setPrototypeOf(v, l.prototype), v;
   };
-  function J(u, i, o) {
+  function X(u, i, o) {
     if (u % 1 !== 0 || u < 0) throw new RangeError("offset is not uint");
     if (u + i > o) throw new RangeError("Trying to access beyond buffer length");
   }
   l.prototype.readUintLE = l.prototype.readUIntLE = function(i, o, p) {
-    i = i >>> 0, o = o >>> 0, p || J(i, o, this.length);
-    for (var k = this[i], L = 1, W = 0; ++W < o && (L *= 256); )
-      k += this[i + W] * L;
-    return k;
+    i = i >>> 0, o = o >>> 0, p || X(i, o, this.length);
+    for (var v = this[i], D = 1, M = 0; ++M < o && (D *= 256); )
+      v += this[i + M] * D;
+    return v;
   }, l.prototype.readUintBE = l.prototype.readUIntBE = function(i, o, p) {
-    i = i >>> 0, o = o >>> 0, p || J(i, o, this.length);
-    for (var k = this[i + --o], L = 1; o > 0 && (L *= 256); )
-      k += this[i + --o] * L;
-    return k;
+    i = i >>> 0, o = o >>> 0, p || X(i, o, this.length);
+    for (var v = this[i + --o], D = 1; o > 0 && (D *= 256); )
+      v += this[i + --o] * D;
+    return v;
   }, l.prototype.readUint8 = l.prototype.readUInt8 = function(i, o) {
-    return i = i >>> 0, o || J(i, 1, this.length), this[i];
+    return i = i >>> 0, o || X(i, 1, this.length), this[i];
   }, l.prototype.readUint16LE = l.prototype.readUInt16LE = function(i, o) {
-    return i = i >>> 0, o || J(i, 2, this.length), this[i] | this[i + 1] << 8;
+    return i = i >>> 0, o || X(i, 2, this.length), this[i] | this[i + 1] << 8;
   }, l.prototype.readUint16BE = l.prototype.readUInt16BE = function(i, o) {
-    return i = i >>> 0, o || J(i, 2, this.length), this[i] << 8 | this[i + 1];
+    return i = i >>> 0, o || X(i, 2, this.length), this[i] << 8 | this[i + 1];
   }, l.prototype.readUint32LE = l.prototype.readUInt32LE = function(i, o) {
-    return i = i >>> 0, o || J(i, 4, this.length), (this[i] | this[i + 1] << 8 | this[i + 2] << 16) + this[i + 3] * 16777216;
+    return i = i >>> 0, o || X(i, 4, this.length), (this[i] | this[i + 1] << 8 | this[i + 2] << 16) + this[i + 3] * 16777216;
   }, l.prototype.readUint32BE = l.prototype.readUInt32BE = function(i, o) {
-    return i = i >>> 0, o || J(i, 4, this.length), this[i] * 16777216 + (this[i + 1] << 16 | this[i + 2] << 8 | this[i + 3]);
+    return i = i >>> 0, o || X(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 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;
+    i = i >>> 0, o = o >>> 0, p || X(i, o, this.length);
+    for (var v = this[i], D = 1, M = 0; ++M < o && (D *= 256); )
+      v += this[i + M] * D;
+    return D *= 128, v >= D && (v -= Math.pow(2, 8 * o)), v;
   }, l.prototype.readIntBE = function(i, o, p) {
-    i = i >>> 0, o = o >>> 0, p || J(i, o, this.length);
-    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;
+    i = i >>> 0, o = o >>> 0, p || X(i, o, this.length);
+    for (var v = o, D = 1, M = this[i + --v]; v > 0 && (D *= 256); )
+      M += this[i + --v] * D;
+    return D *= 128, M >= D && (M -= Math.pow(2, 8 * o)), M;
   }, 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];
+    return i = i >>> 0, o || X(i, 1, this.length), this[i] & 128 ? (255 - this[i] + 1) * -1 : this[i];
   }, l.prototype.readInt16LE = function(i, o) {
-    i = i >>> 0, o || J(i, 2, this.length);
+    i = i >>> 0, o || X(i, 2, this.length);
     var p = this[i] | this[i + 1] << 8;
     return p & 32768 ? p | 4294901760 : p;
   }, l.prototype.readInt16BE = function(i, o) {
-    i = i >>> 0, o || J(i, 2, this.length);
+    i = i >>> 0, o || X(i, 2, this.length);
     var p = this[i + 1] | this[i] << 8;
     return p & 32768 ? p | 4294901760 : p;
   }, l.prototype.readInt32LE = function(i, o) {
-    return i = i >>> 0, o || J(i, 4, this.length), this[i] | this[i + 1] << 8 | this[i + 2] << 16 | this[i + 3] << 24;
+    return i = i >>> 0, o || X(i, 4, this.length), this[i] | this[i + 1] << 8 | this[i + 2] << 16 | this[i + 3] << 24;
   }, l.prototype.readInt32BE = function(i, o) {
-    return i = i >>> 0, o || J(i, 4, this.length), this[i] << 24 | this[i + 1] << 16 | this[i + 2] << 8 | this[i + 3];
+    return i = i >>> 0, o || X(i, 4, this.length), this[i] << 24 | this[i + 1] << 16 | this[i + 2] << 8 | this[i + 3];
   }, l.prototype.readFloatLE = function(i, o) {
-    return i = i >>> 0, o || J(i, 4, this.length), e.read(this, i, !0, 23, 4);
+    return i = i >>> 0, o || X(i, 4, this.length), e.read(this, i, !0, 23, 4);
   }, l.prototype.readFloatBE = function(i, o) {
-    return i = i >>> 0, o || J(i, 4, this.length), e.read(this, i, !1, 23, 4);
+    return i = i >>> 0, o || X(i, 4, this.length), e.read(this, i, !1, 23, 4);
   }, l.prototype.readDoubleLE = function(i, o) {
-    return i = i >>> 0, o || J(i, 8, this.length), e.read(this, i, !0, 52, 8);
+    return i = i >>> 0, o || X(i, 8, this.length), e.read(this, i, !0, 52, 8);
   }, l.prototype.readDoubleBE = function(i, o) {
-    return i = i >>> 0, o || J(i, 8, this.length), e.read(this, i, !1, 52, 8);
+    return i = i >>> 0, o || X(i, 8, this.length), e.read(this, i, !1, 52, 8);
   };
-  function Y(u, i, o, p, k, L) {
+  function $(u, i, o, p, v, D) {
     if (!l.isBuffer(u)) throw new TypeError('"buffer" argument must be a Buffer instance');
-    if (i > k || i < L) throw new RangeError('"value" argument is out of bounds');
+    if (i > v || i < D) 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, 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);
+  l.prototype.writeUintLE = l.prototype.writeUIntLE = function(i, o, p, v) {
+    if (i = +i, o = o >>> 0, p = p >>> 0, !v) {
+      var D = Math.pow(2, 8 * p) - 1;
+      $(this, i, o, p, D, 0);
     }
-    var W = 1, X = 0;
-    for (this[o] = i & 255; ++X < p && (W *= 256); )
-      this[o + X] = i / W & 255;
+    var M = 1, z = 0;
+    for (this[o] = i & 255; ++z < p && (M *= 256); )
+      this[o + z] = i / M & 255;
     return o + p;
-  }, 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);
+  }, l.prototype.writeUintBE = l.prototype.writeUIntBE = function(i, o, p, v) {
+    if (i = +i, o = o >>> 0, p = p >>> 0, !v) {
+      var D = Math.pow(2, 8 * p) - 1;
+      $(this, i, o, p, D, 0);
     }
-    var W = p - 1, X = 1;
-    for (this[o + W] = i & 255; --W >= 0 && (X *= 256); )
-      this[o + W] = i / X & 255;
+    var M = p - 1, z = 1;
+    for (this[o + M] = i & 255; --M >= 0 && (z *= 256); )
+      this[o + M] = i / z & 255;
     return o + p;
   }, l.prototype.writeUint8 = l.prototype.writeUInt8 = function(i, o, p) {
-    return i = +i, o = o >>> 0, p || Y(this, i, o, 1, 255, 0), this[o] = i & 255, o + 1;
+    return i = +i, o = o >>> 0, p || $(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 || Y(this, i, o, 2, 65535, 0), this[o] = i & 255, this[o + 1] = i >>> 8, o + 2;
+    return i = +i, o = o >>> 0, p || $(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 || Y(this, i, o, 2, 65535, 0), this[o] = i >>> 8, this[o + 1] = i & 255, o + 2;
+    return i = +i, o = o >>> 0, p || $(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 || 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;
+    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;
   }, l.prototype.writeUint32BE = l.prototype.writeUInt32BE = function(i, o, p) {
-    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);
+    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, v) {
+    if (i = +i, o = o >>> 0, !v) {
+      var D = Math.pow(2, 8 * p - 1);
+      $(this, i, o, p, D - 1, -D);
     }
-    var W = 0, X = 1, re = 0;
-    for (this[o] = i & 255; ++W < p && (X *= 256); )
-      i < 0 && re === 0 && this[o + W - 1] !== 0 && (re = 1), this[o + W] = (i / X >> 0) - re & 255;
+    var M = 0, z = 1, ne = 0;
+    for (this[o] = i & 255; ++M < p && (z *= 256); )
+      i < 0 && ne === 0 && this[o + M - 1] !== 0 && (ne = 1), this[o + M] = (i / z >> 0) - ne & 255;
     return o + p;
-  }, 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);
+  }, l.prototype.writeIntBE = function(i, o, p, v) {
+    if (i = +i, o = o >>> 0, !v) {
+      var D = Math.pow(2, 8 * p - 1);
+      $(this, i, o, p, D - 1, -D);
     }
-    var W = p - 1, X = 1, re = 0;
-    for (this[o + W] = i & 255; --W >= 0 && (X *= 256); )
-      i < 0 && re === 0 && this[o + W + 1] !== 0 && (re = 1), this[o + W] = (i / X >> 0) - re & 255;
+    var M = p - 1, z = 1, ne = 0;
+    for (this[o + M] = i & 255; --M >= 0 && (z *= 256); )
+      i < 0 && ne === 0 && this[o + M + 1] !== 0 && (ne = 1), this[o + M] = (i / z >> 0) - ne & 255;
     return o + p;
   }, l.prototype.writeInt8 = function(i, o, p) {
-    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;
+    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;
   }, l.prototype.writeInt16LE = function(i, o, p) {
-    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;
+    return i = +i, o = o >>> 0, p || $(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 || Y(this, i, o, 2, 32767, -32768), this[o] = i >>> 8, this[o + 1] = i & 255, o + 2;
+    return i = +i, o = o >>> 0, p || $(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 || 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;
+    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;
   }, l.prototype.writeInt32BE = function(i, o, p) {
-    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;
+    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;
   };
-  function ee(u, i, o, p, k, L) {
+  function J(u, i, o, p, v, D) {
     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, k) {
-    return i = +i, o = o >>> 0, k || ee(u, i, o, 4), e.write(u, i, o, p, 23, 4), o + 4;
+  function Pe(u, i, o, p, v) {
+    return i = +i, o = o >>> 0, v || J(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, k) {
-    return i = +i, o = o >>> 0, k || ee(u, i, o, 8), e.write(u, i, o, p, 52, 8), o + 8;
+  function de(u, i, o, p, v) {
+    return i = +i, o = o >>> 0, v || J(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, k) {
+  }, l.prototype.copy = function(i, o, p, v) {
     if (!l.isBuffer(i)) throw new TypeError("argument should be a Buffer");
-    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 (p || (p = 0), !v && v !== 0 && (v = this.length), o >= i.length && (o = i.length), o || (o = 0), v > 0 && v < p && (v = p), v === 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 (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(
+    if (v < 0) throw new RangeError("sourceEnd out of bounds");
+    v > this.length && (v = this.length), i.length - o < v - p && (v = i.length - o + p);
+    var D = v - p;
+    return this === i && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(o, p, v) : Uint8Array.prototype.set.call(
       i,
-      this.subarray(p, k),
+      this.subarray(p, v),
       o
-    ), L;
-  }, l.prototype.fill = function(i, o, p, k) {
+    ), D;
+  }, l.prototype.fill = function(i, o, p, v) {
     if (typeof i == "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")
+      if (typeof o == "string" ? (v = o, o = 0, p = this.length) : typeof p == "string" && (v = p, p = this.length), v !== void 0 && typeof v != "string")
         throw new TypeError("encoding must be a string");
-      if (typeof k == "string" && !l.isEncoding(k))
-        throw new TypeError("Unknown encoding: " + k);
+      if (typeof v == "string" && !l.isEncoding(v))
+        throw new TypeError("Unknown encoding: " + v);
       if (i.length === 1) {
-        var L = i.charCodeAt(0);
-        (k === "utf8" && L < 128 || k === "latin1") && (i = L);
+        var D = i.charCodeAt(0);
+        (v === "utf8" && D < 128 || v === "latin1") && (i = D);
       }
     } else typeof i == "number" ? i = i & 255 : typeof i == "boolean" && (i = Number(i));
     if (o < 0 || this.length < o || this.length < p)
@@ -1076,16 +1076,16 @@ Un.write = function(n, t, e, r, s, a) {
     if (p <= o)
       return this;
     o = o >>> 0, p = p === void 0 ? this.length : p >>> 0, i || (i = 0);
-    var W;
+    var M;
     if (typeof i == "number")
-      for (W = o; W < p; ++W)
-        this[W] = i;
+      for (M = o; M < p; ++M)
+        this[M] = i;
     else {
-      var X = l.isBuffer(i) ? i : l.from(i, k), re = X.length;
-      if (re === 0)
+      var z = l.isBuffer(i) ? i : l.from(i, v), ne = z.length;
+      if (ne === 0)
         throw new TypeError('The value "' + i + '" is invalid for argument "value"');
-      for (W = 0; W < p - o; ++W)
-        this[W + o] = X[W % re];
+      for (M = 0; M < p - o; ++M)
+        this[M + o] = z[M % ne];
     }
     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, k = null, L = [], W = 0; W < p; ++W) {
-      if (o = u.charCodeAt(W), o > 55295 && o < 57344) {
-        if (!k) {
+    for (var o, p = u.length, v = null, D = [], M = 0; M < p; ++M) {
+      if (o = u.charCodeAt(M), o > 55295 && o < 57344) {
+        if (!v) {
           if (o > 56319) {
-            (i -= 3) > -1 && L.push(239, 191, 189);
+            (i -= 3) > -1 && D.push(239, 191, 189);
             continue;
-          } else if (W + 1 === p) {
-            (i -= 3) > -1 && L.push(239, 191, 189);
+          } else if (M + 1 === p) {
+            (i -= 3) > -1 && D.push(239, 191, 189);
             continue;
           }
-          k = o;
+          v = o;
           continue;
         }
         if (o < 56320) {
-          (i -= 3) > -1 && L.push(239, 191, 189), k = o;
+          (i -= 3) > -1 && D.push(239, 191, 189), v = o;
           continue;
         }
-        o = (k - 55296 << 10 | o - 56320) + 65536;
-      } else k && (i -= 3) > -1 && L.push(239, 191, 189);
-      if (k = null, o < 128) {
+        o = (v - 55296 << 10 | o - 56320) + 65536;
+      } else v && (i -= 3) > -1 && D.push(239, 191, 189);
+      if (v = null, o < 128) {
         if ((i -= 1) < 0) break;
-        L.push(o);
+        D.push(o);
       } else if (o < 2048) {
         if ((i -= 2) < 0) break;
-        L.push(
+        D.push(
           o >> 6 | 192,
           o & 63 | 128
         );
       } else if (o < 65536) {
         if ((i -= 3) < 0) break;
-        L.push(
+        D.push(
           o >> 12 | 224,
           o >> 6 & 63 | 128,
           o & 63 | 128
         );
       } else if (o < 1114112) {
         if ((i -= 4) < 0) break;
-        L.push(
+        D.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 L;
+    return D;
   }
   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, 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;
+    for (var o, p, v, D = [], M = 0; M < u.length && !((i -= 2) < 0); ++M)
+      o = u.charCodeAt(M), p = o >> 8, v = o % 256, D.push(v), D.push(p);
+    return D;
   }
   function tt(u) {
     return t.toByteArray(wt(u));
   }
   function ge(u, i, o, p) {
-    for (var k = 0; k < p && !(k + o >= i.length || k >= u.length); ++k)
-      i[k + o] = u[k];
-    return k;
+    for (var v = 0; v < p && !(v + o >= i.length || v >= u.length); ++v)
+      i[v + o] = u[v];
+    return v;
   }
   function fe(u, i) {
     return u instanceof i || u != null && u.constructor != null && u.constructor.name != null && u.constructor.name === i.name;
@@ -1172,11 +1172,11 @@ 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, k = 0; k < 16; ++k)
-        i[p + k] = u[o] + u[k];
+      for (var p = o * 16, v = 0; v < 16; ++v)
+        i[p + v] = u[o] + u[v];
     return i;
   }();
-})(ai);
+})(oi);
 class On extends Ln {
   /**
    * @param {string} oid
@@ -1191,15 +1191,15 @@ class On extends Ln {
   }
 }
 On.code = "ObjectTypeError";
-typeof window < "u" && (window.Buffer = ai.Buffer);
-const li = function() {
+typeof window < "u" && (window.Buffer = oi.Buffer);
+const ci = function() {
   return typeof process < "u" && process.release?.name === "node" ? "NODE" : typeof window < "u" ? "WEB" : (
     // @ts-ignore
     typeof WorkerGlobalScope < "u" && // @ts-ignore
     self instanceof WorkerGlobalScope ? "WORKER" : "NODE"
   );
 }();
-if (li === "NODE") {
+if (ci === "NODE") {
   let n = function(e) {
     return new Promise(function(r, s) {
       e.onload = e.onerror = function(a) {
@@ -1250,7 +1250,7 @@ if (li === "NODE") {
     });
   });
 }
-if (li === "NODE" && typeof CustomEvent > "u") {
+if (ci === "NODE" && typeof CustomEvent > "u") {
   class n extends Event {
     constructor(e, r = {}) {
       super(e, r), this.detail = r.detail;
@@ -1260,7 +1260,7 @@ if (li === "NODE" && typeof CustomEvent > "u") {
   }
   globalThis.CustomEvent = n;
 }
-function Ns(...n) {
+function js(...n) {
   const t = new Uint8Array(
     n.reduce((r, s) => r + s.length, 0)
   );
@@ -1269,12 +1269,12 @@ function Ns(...n) {
     t.set(r, e), e += r.length;
   return t;
 }
-function qs(n) {
+function Hs(n) {
   {
     let t = new Uint8Array();
     return new TransformStream({
       transform(e) {
-        t = Ns(t, e);
+        t = js(t, e);
       },
       flush(e) {
         e.enqueue(t);
@@ -1282,8 +1282,8 @@ function qs(n) {
     });
   }
 }
-async function js(n, t) {
-  return await n.pipeThrough(qs()).getReader().read().then(({ value: e }) => e);
+async function $s(n, t) {
+  return await n.pipeThrough(Hs()).getReader().read().then(({ value: e }) => e);
 }
 class Vt extends File {
   /**
@@ -1326,7 +1326,7 @@ class Vt extends File {
    * @returns File data as an ArrayBuffer.
    */
   async arrayBuffer() {
-    return await js(this.stream());
+    return await $s(this.stream());
   }
 }
 ReadableStream.prototype[Symbol.asyncIterator] || (ReadableStream.prototype[Symbol.asyncIterator] = async function* () {
@@ -1344,14 +1344,14 @@ ReadableStream.prototype[Symbol.asyncIterator] || (ReadableStream.prototype[Symb
 }, ReadableStream.prototype.iterate = // @ts-ignore
 ReadableStream.prototype[Symbol.asyncIterator]);
 new Dn({ concurrency: 10 });
-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;
+const St = 15, En = 30, Sn = 19, Ys = 29, Gt = 256, Wn = Gt + 1 + Ys, Kn = 2 * Wn + 1, _t = 256, Zs = 7, Xn = 16, zn = 17, Jn = 18, an = 8 * 2, Kt = -1, Vs = 1, Pt = 2, Gs = 0, dt = 0, Qn = 1, Ks = 3, Se = 4, Ue = 0, li = 1, Dt = 2, Oe = -2, Xs = -3, lt = -5;
 function tn(n) {
   return nn(n.map(([t, e]) => new Array(t).fill(e, 0, t)));
 }
 function nn(n) {
   return n.reduce((t, e) => t.concat(Array.isArray(e) ? nn(e) : e), []);
 }
-const tr = [0, 1, 2, 3].concat(...tn([
+const er = [0, 1, 2, 3].concat(...tn([
   [2, 4],
   [2, 5],
   [4, 6],
@@ -1384,11 +1384,11 @@ 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, T, C, m, d = 0;
+    let x, w, g, T, O, 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], 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)));
+    for (a[s.heap[s.heap_max] * 2 + 1] = 0, x = s.heap_max + 1; x < Kn; x++)
+      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]++, O = 0, w >= f && (O = l[w - f]), m = a[w * 2], s.opt_len += m * (T + O), c && (s.static_len += m * (c[w * 2 + 1] + O)));
     if (d !== 0) {
       do {
         for (T = _ - 1; s.bl_count[T] === 0; )
@@ -1418,7 +1418,7 @@ function se() {
   n.build_tree = function(s) {
     const a = n.dyn_tree, c = n.stat_desc.static_tree, l = n.stat_desc.elems;
     let f, _, x = -1, w;
-    for (s.heap_len = 0, s.heap_max = Xn, f = 0; f < l; f++)
+    for (s.heap_len = 0, s.heap_max = Kn, f = 0; f < l; f++)
       a[f * 2] !== 0 ? (s.heap[++s.heap_len] = x = f, s.depth[f] = 0) : a[f * 2 + 1] = 0;
     for (; s.heap_len < 2; )
       w = s.heap[++s.heap_len] = x < 2 ? ++x : 0, a[w * 2] = 1, s.depth[w] = 0, s.opt_len--, c && (s.static_len -= c[w * 2 + 1]);
@@ -1488,7 +1488,7 @@ se.base_dist = [
   24576
 ];
 se.d_code = function(n) {
-  return n < 256 ? tr[n] : tr[256 + (n >>> 7)];
+  return n < 256 ? er[n] : er[256 + (n >>> 7)];
 };
 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];
@@ -1498,7 +1498,7 @@ 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;
 }
-const Ks = [
+const zs = [
   12,
   140,
   76,
@@ -1787,29 +1787,29 @@ const Ks = [
   163,
   99,
   227
-], Xs = tn([[144, 8], [112, 9], [24, 7], [8, 8]]);
-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, se.extra_lbits, Gt + 1, Bn, St);
+], Js = tn([[144, 8], [112, 9], [24, 7], [8, 8]]);
+we.static_ltree = nn(zs.map((n, t) => [n, Js[t]]));
+const Qs = [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], eo = tn([[30, 5]]);
+we.static_dtree = nn(Qs.map((n, t) => [n, eo[t]]));
+we.static_l_desc = new we(we.static_ltree, se.extra_lbits, Gt + 1, Wn, 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) {
+we.static_bl_desc = new we(null, se.extra_blbits, 0, Sn, Zs);
+const to = 9, no = 8;
+function We(n, t, e, r, s) {
   const a = this;
   a.good_length = n, a.max_lazy = t, a.nice_length = e, a.max_chain = r, a.func = s;
 }
-const ui = 0, jt = 1, rt = 2, Le = [
-  new Be(0, 0, 0, 0, ui),
-  new Be(4, 4, 8, 4, jt),
-  new Be(4, 5, 16, 8, jt),
-  new Be(4, 6, 32, 32, jt),
-  new Be(4, 4, 16, 16, rt),
-  new Be(8, 16, 32, 32, rt),
-  new Be(8, 16, 128, 128, rt),
-  new Be(8, 32, 128, 256, rt),
-  new Be(32, 128, 258, 1024, rt),
-  new Be(32, 258, 258, 4096, rt)
+const fi = 0, jt = 1, rt = 2, Le = [
+  new We(0, 0, 0, 0, fi),
+  new We(4, 4, 8, 4, jt),
+  new We(4, 5, 16, 8, jt),
+  new We(4, 6, 32, 32, jt),
+  new We(4, 4, 16, 16, rt),
+  new We(8, 16, 32, 32, rt),
+  new We(8, 16, 128, 128, rt),
+  new We(8, 32, 128, 256, rt),
+  new We(32, 128, 258, 1024, rt),
+  new We(32, 258, 258, 4096, rt)
 ], Lt = [
   "need dictionary",
   // Z_NEED_DICT
@@ -1831,53 +1831,53 @@ const ui = 0, jt = 1, rt = 2, Le = [
   "",
   // Z_VERSION_ERROR (-6)
   ""
-], Fe = 0, Ut = 1, yt = 2, Ot = 3, to = 32, cn = 42, Bt = 113, bt = 666, ln = 8, no = 0, fn = 1, ro = 2, ae = 3, Ht = 258, Te = Ht + ae + 1;
-function nr(n, t, e, r) {
+], Fe = 0, Ut = 1, yt = 2, Ot = 3, ro = 32, cn = 42, Wt = 113, bt = 666, ln = 8, io = 0, fn = 1, so = 2, ae = 3, Ht = 258, Te = Ht + ae + 1;
+function tr(n, t, e, r) {
   const s = n[t * 2], a = n[e * 2];
   return s < a || s == a && r[t] <= r[e];
 }
-function io() {
+function oo() {
   const n = this;
-  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();
+  let t, e, r, s, a, c, l, f, _, x, w, g, T, O, m, d, h, b, R, C, S, A, F, y, P, k, E, B, L, Y, H, j, K;
+  const G = new se(), re = new se(), Z = new se();
   n.depth = [];
-  let J, Y, ee, Pe, de, le;
-  n.bl_count = [], n.heap = [], H = [], j = [], G = [];
+  let X, $, J, Pe, de, le;
+  n.bl_count = [], n.heap = [], H = [], j = [], K = [];
   function wt() {
     _ = 2 * a, w[T - 1] = 0;
     for (let I = 0; I < T - 1; I++)
       w[I] = 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;
+    k = Le[E].max_lazy, L = Le[E].good_length, Y = Le[E].nice_length, P = Le[E].max_chain, S = 0, h = 0, F = 0, b = y = ae - 1, C = 0, g = 0;
   }
   function qe() {
     let I;
-    for (I = 0; I < Bn; I++)
+    for (I = 0; I < Wn; I++)
       H[I * 2] = 0;
     for (I = 0; I < En; I++)
       j[I * 2] = 0;
     for (I = 0; I < Sn; I++)
-      G[I * 2] = 0;
-    H[_t * 2] = 1, n.opt_len = n.static_len = 0, Y = ee = 0;
+      K[I * 2] = 0;
+    H[_t * 2] = 1, n.opt_len = n.static_len = 0, $ = J = 0;
   }
   function at() {
-    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 U = n.heap, N = U[B];
-    let q = B << 1;
-    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;
+    G.dyn_tree = H, G.stat_desc = we.static_l_desc, re.dyn_tree = j, re.stat_desc = we.static_d_desc, Z.dyn_tree = K, Z.stat_desc = we.static_bl_desc, de = 0, le = 0, Pe = 8, qe();
+  }
+  n.pqdownheap = function(I, W) {
+    const U = n.heap, N = U[W];
+    let q = W << 1;
+    for (; q <= n.heap_len && (q < n.heap_len && tr(I, U[q + 1], U[q], n.depth) && q++, !tr(I, N, U[q], n.depth)); )
+      U[W] = U[q], W = q, q <<= 1;
+    U[W] = N;
   };
-  function et(I, B) {
-    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], !(++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 et(I, W) {
+    let U = -1, N, q = I[0 * 2 + 1], V = 0, Q = 7, be = 4;
+    q === 0 && (Q = 138, be = 3), I[(W + 1) * 2 + 1] = 65535;
+    for (let De = 0; De <= W; De++)
+      N = q, q = I[(De + 1) * 2 + 1], !(++V < Q && N == q) && (V < be ? K[N * 2] += V : N !== 0 ? (N != U && K[N * 2]++, K[Xn * 2]++) : V <= 10 ? K[zn * 2]++ : K[Jn * 2]++, V = 0, U = N, q === 0 ? (Q = 138, be = 3) : N == q ? (Q = 6, be = 3) : (Q = 7, be = 4));
   }
   function tt() {
     let 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--)
+    for (et(H, G.max_code), et(j, re.max_code), Z.build_tree(n), I = Sn - 1; I >= 3 && K[se.bl_order[I] * 2 + 1] === 0; I--)
       ;
     return n.opt_len += 3 * (I + 1) + 5 + 5 + 4, I;
   }
@@ -1890,88 +1890,88 @@ function io() {
   function je(I) {
     ge(I >> 8 & 255), ge(I & 255 & 255);
   }
-  function ue(I, B) {
+  function ue(I, W) {
     let U;
-    const N = B;
+    const N = W;
     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) {
+  function u(I, W) {
     const U = I * 2;
-    ue(B[U] & 65535, B[U + 1] & 65535);
+    ue(W[U] & 65535, W[U + 1] & 65535);
   }
-  function i(I, B) {
-    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)
+  function i(I, W) {
+    let U, N = -1, q, V = I[0 * 2 + 1], Q = 0, be = 7, De = 4;
+    for (V === 0 && (be = 138, De = 3), U = 0; U <= W; U++)
+      if (q = V, V = I[(U + 1) * 2 + 1], !(++Q < be && q == V)) {
+        if (Q < De)
           do
-            u(q, G);
-          while (--z !== 0);
-        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);
+            u(q, K);
+          while (--Q !== 0);
+        else q !== 0 ? (q != N && (u(q, K), Q--), u(Xn, K), ue(Q - 3, 2)) : Q <= 10 ? (u(zn, K), ue(Q - 3, 3)) : (u(Jn, K), ue(Q - 11, 7));
+        Q = 0, N = q, V === 0 ? (be = 138, De = 3) : q == V ? (be = 6, De = 3) : (be = 7, De = 4);
       }
   }
-  function o(I, B, U) {
+  function o(I, W, U) {
     let N;
-    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);
+    for (ue(I - 257, 5), ue(W - 1, 5), ue(U - 4, 4), N = 0; N < U; N++)
+      ue(K[se.bl_order[N] * 2 + 1], 3);
+    i(H, I - 1), i(j, W - 1);
   }
   function p() {
     le == 16 ? (fe(de), de = 0, le = 0) : le >= 8 && (ge(de & 255), de >>>= 8, le -= 8);
   }
-  function k() {
+  function v() {
     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 L(I, B) {
+  function D(I, W) {
     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++)
+    if (n.dist_buf[$] = I, n.lc_buf[$] = W & 255, $++, I === 0 ? H[W * 2]++ : (J++, I--, H[(se._length_code[W] + Gt + 1) * 2]++, j[se.d_code(I) * 2]++), !($ & 8191) && E > 2) {
+      for (U = $ * 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))
+      if (U >>>= 3, J < Math.floor($ / 2) && U < Math.floor(N / 2))
         return !0;
     }
-    return Y == J - 1;
+    return $ == X - 1;
   }
-  function W(I, B) {
-    let U, N, q = 0, V, z;
-    if (Y !== 0)
+  function M(I, W) {
+    let U, N, q = 0, V, Q;
+    if ($ !== 0)
       do
-        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 = 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), Q = se.extra_lbits[V], Q !== 0 && (N -= se.base_length[V], ue(N, Q)), U--, V = se.d_code(U), u(V, W), Q = se.extra_dbits[V], Q !== 0 && (U -= se.base_dist[V], ue(U, Q)));
+      while (q < $);
     u(_t, I), Pe = I[_t * 2 + 1];
   }
-  function X() {
+  function z() {
     le > 8 ? fe(de) : le > 0 && ge(de & 255), de = 0, le = 0;
   }
-  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 ne(I, W, U) {
+    z(), Pe = 8, fe(W), fe(~W), n.pending_buf.set(f.subarray(I, I + W), n.pending), n.pending += W;
   }
-  function ie(I, B, U) {
-    ue((no << 1) + (U ? 1 : 0), 3), re(I, B);
+  function ie(I, W, U) {
+    ue((io << 1) + (U ? 1 : 0), 3), ne(I, W);
   }
-  function pe(I, B, U) {
+  function pe(I, W, 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();
+    E > 0 ? (G.build_tree(n), re.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 = W + 5, W + 4 <= N && I != -1 ? ie(I, W, U) : q == N ? (ue((fn << 1) + (U ? 1 : 0), 3), M(we.static_ltree, we.static_dtree)) : (ue((so << 1) + (U ? 1 : 0), 3), o(G.max_code + 1, re.max_code + 1, V + 1), M(H, j)), qe(), U && z();
   }
-  function ne(I) {
+  function te(I) {
     pe(h >= 0 ? h : -1, S - h, I), h = S, t.flush_pending();
   }
   function Ye() {
-    let I, B, U, N;
+    let I, W, U, N;
     do {
       if (N = _ - F - S, N === 0 && S === 0 && F === 0)
         N = a;
       else if (N == -1)
         N--;
       else if (S >= a + a - Te) {
-        f.set(f.subarray(a, a + a), 0), R -= a, S -= a, h -= a, I = T, U = I;
+        f.set(f.subarray(a, a + a), 0), A -= a, S -= a, h -= a, I = T, U = I;
         do
-          B = w[--U] & 65535, w[U] = B >= a ? B - a : 0;
+          W = w[--U] & 65535, w[U] = W >= a ? W - a : 0;
         while (--I !== 0);
         I = a, U = I;
         do
-          B = x[--U] & 65535, x[U] = B >= a ? B - a : 0;
+          W = x[--U] & 65535, x[U] = W >= a ? W - a : 0;
         while (--I !== 0);
         N += a;
       }
@@ -1981,26 +1981,26 @@ function io() {
     } while (F < Te && t.avail_in !== 0);
   }
   function It(I) {
-    let B = 65535, U;
-    for (B > r - 5 && (B = r - 5); ; ) {
+    let W = 65535, U;
+    for (W > r - 5 && (W = r - 5); ; ) {
       if (F <= 1) {
         if (Ye(), F === 0 && I == dt)
           return Fe;
         if (F === 0)
           break;
       }
-      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))
+      if (S += F, F = 0, U = h + W, (S === 0 || S >= U) && (F = S - U, S = U, te(!1), t.avail_out === 0) || S - h >= a - Te && (te(!1), t.avail_out === 0))
         return Fe;
     }
-    return ne(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
+    return te(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
   }
   function gt(I) {
-    let B = D, U = S, N, q, V = y;
-    const z = S > a - Te ? S - (a - Te) : 0;
-    let be = $;
+    let W = P, U = S, N, q, V = y;
+    const Q = S > a - Te ? S - (a - Te) : 0;
+    let be = Y;
     const De = l, sn = S + Ht;
     let Hn = f[U + V - 1], $n = f[U + V];
-    y >= O && (B >>= 2), be > F && (be = F);
+    y >= L && (W >>= 2), be > F && (be = F);
     do
       if (N = I, !(f[N + V] != $n || f[N + V - 1] != Hn || f[N] != f[U] || f[++N] != f[U + 1])) {
         U += 2, N++;
@@ -2008,16 +2008,16 @@ function io() {
           ;
         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)
+          if (A = I, V = q, q >= be)
             break;
           Hn = f[U + V - 1], $n = f[U + V];
         }
       }
-    while ((I = x[I & De] & 65535) > z && --B !== 0);
+    while ((I = x[I & De] & 65535) > Q && --W !== 0);
     return V <= F ? V : F;
   }
-  function Qi(I) {
-    let B = 0, U;
+  function Ji(I) {
+    let W = 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[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--;
+      if (F >= ae && (g = (g << d ^ f[S + (ae - 1)] & 255) & m, W = w[g] & 65535, x[S & l] = w[g], w[g] = S), W !== 0 && (S - W & 65535) <= a - Te && B != Pt && (b = gt(W)), b >= ae)
+        if (U = D(S - A, b - ae), F -= b, b <= k && F >= ae) {
+          b--;
           do
-            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++, g = (g << d ^ f[S + (ae - 1)] & 255) & m, W = w[g] & 65535, x[S & l] = w[g], w[g] = S;
+          while (--b !== 0);
           S++;
         } else
-          S += v, v = 0, g = f[S] & 255, g = (g << d ^ f[S + 1] & 255) & m;
+          S += b, b = 0, g = f[S] & 255, g = (g << d ^ f[S + 1] & 255) & m;
       else
-        U = L(0, f[S] & 255), F--, S++;
-      if (U && (ne(!1), t.avail_out === 0))
+        U = D(0, f[S] & 255), F--, S++;
+      if (U && (te(!1), t.avail_out === 0))
         return Fe;
     }
-    return ne(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
+    return te(I == Se), t.avail_out === 0 ? I == Se ? yt : Fe : I == Se ? Ot : Ut;
   }
-  function es(I) {
-    let B = 0, U, N;
+  function Qi(I) {
+    let W = 0, U, N;
     for (; ; ) {
       if (F < Te) {
         if (Ye(), F < Te && I == dt)
@@ -2050,90 +2050,90 @@ function io() {
         if (F === 0)
           break;
       }
-      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;
+      if (F >= ae && (g = (g << d ^ f[S + (ae - 1)] & 255) & m, W = w[g] & 65535, x[S & l] = w[g], w[g] = S), y = b, R = A, b = ae - 1, W !== 0 && y < k && (S - W & 65535) <= a - Te && (B != Pt && (b = gt(W)), b <= 5 && (B == Vs || b == ae && S - A > 4096) && (b = ae - 1)), y >= ae && b <= y) {
+        N = S + F - ae, U = D(S - 1 - R, y - ae), F -= y - 1, y -= 2;
         do
-          ++S <= N && (g = (g << d ^ f[S + (ae - 1)] & 255) & m, B = w[g] & 65535, x[S & l] = w[g], w[g] = S);
+          ++S <= N && (g = (g << d ^ f[S + (ae - 1)] & 255) & m, W = 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))
+        if (C = 0, b = ae - 1, S++, U && (te(!1), t.avail_out === 0))
           return Fe;
-      } else if (P !== 0) {
-        if (U = L(0, f[S - 1] & 255), U && ne(!1), S++, F--, t.avail_out === 0)
+      } else if (C !== 0) {
+        if (U = D(0, f[S - 1] & 255), U && te(!1), S++, F--, t.avail_out === 0)
           return Fe;
       } else
-        P = 1, S++, F--;
+        C = 1, S++, F--;
     }
-    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;
+    return C !== 0 && (U = D(0, f[S - 1] & 255), C = 0), te(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;
+  function es(I) {
+    return I.total_in = I.total_out = 0, I.msg = null, n.pending = 0, n.pending_out = 0, e = Wt, s = dt, at(), wt(), Ue;
   }
-  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.deflateInit = function(I, W, U, N, q, V) {
+    return N || (N = ln), q || (q = no), V || (V = Gs), I.msg = null, W == Kt && (W = 6), q < 1 || q > to || N != ln || U < 9 || U > 15 || W < 0 || W > 9 || V < 0 || V > Pt ? Oe : (I.dstate = n, c = U, a = 1 << c, l = a - 1, O = q + 7, T = 1 << O, m = T - 1, d = Math.floor((O + ae - 1) / ae), f = new Uint8Array(a * 2), x = [], w = [], X = 1 << q + 6, n.pending_buf = new Uint8Array(X * 4), r = X * 4, n.dist_buf = new Uint16Array(X), n.lc_buf = new Uint8Array(X), E = W, B = V, es(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, U) {
+    return e != cn && e != Wt && 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 == Wt ? Xs : Ue);
+  }, n.deflateParams = function(I, W, U) {
     let N = Ue;
-    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) {
+    return W == Kt && (W = 6), W < 0 || W > 9 || U < 0 || U > Pt ? Oe : (Le[E].func != Le[W].func && I.total_in !== 0 && (N = I.deflate(Qn)), E != W && (E = W, k = Le[E].max_lazy, L = Le[E].good_length, Y = Le[E].nice_length, P = Le[E].max_chain), B = U, N);
+  }, n.deflateSetDictionary = function(I, W, U) {
     let N = U, q, V = 0;
-    if (!B || e != cn)
+    if (!W || e != cn)
       return Oe;
     if (N < ae)
       return Ue;
-    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++)
+    for (N > a - Te && (N = a - Te, V = U - N), f.set(W.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 U, N, q, V, z;
-    if (B > Se || B < 0)
+  }, n.deflate = function(I, W) {
+    let U, N, q, V, Q;
+    if (W > Se || W < 0)
       return Oe;
-    if (!I.next_out || !I.next_in && I.avail_in !== 0 || e == bt && B != Se)
+    if (!I.next_out || !I.next_in && I.avail_in !== 0 || e == bt && W != Se)
       return I.msg = Lt[Dt - Oe], Oe;
     if (I.avail_out === 0)
       return I.msg = Lt[Dt - lt], lt;
-    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 = I, V = s, s = W, e == cn && (N = ln + (c - 8 << 4) << 8, q = (E - 1 & 255) >> 1, q > 3 && (q = 3), N |= q << 6, S !== 0 && (N |= ro), N += 31 - N % 31, e = Wt, je(N)), n.pending !== 0) {
       if (t.flush_pending(), t.avail_out === 0)
         return s = -1, Ue;
-    } else if (t.avail_in === 0 && B <= V && B != Se)
+    } else if (t.avail_in === 0 && W <= V && W != 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[E].func) {
-        case ui:
-          z = It(B);
+    if (t.avail_in !== 0 || F !== 0 || W != dt && e != bt) {
+      switch (Q = -1, Le[E].func) {
+        case fi:
+          Q = It(W);
           break;
         case jt:
-          z = Qi(B);
+          Q = Ji(W);
           break;
         case rt:
-          z = es(B);
+          Q = Qi(W);
           break;
       }
-      if ((z == yt || z == Ot) && (e = bt), z == Fe || z == yt)
+      if ((Q == yt || Q == Ot) && (e = bt), Q == Fe || Q == yt)
         return t.avail_out === 0 && (s = -1), Ue;
-      if (z == Ut) {
-        if (B == er)
-          k();
-        else if (ie(0, 0, !1), B == Vs)
+      if (Q == Ut) {
+        if (W == Qn)
+          v();
+        else if (ie(0, 0, !1), W == Ks)
           for (U = 0; U < T; U++)
             w[U] = 0;
         if (t.flush_pending(), t.avail_out === 0)
           return s = -1, Ue;
       }
     }
-    return B != Se ? Ue : fi;
+    return W != Se ? Ue : li;
   };
 }
-function di() {
+function ui() {
   const n = this;
   n.next_in_index = 0, n.next_out_index = 0, n.avail_in = 0, n.total_in = 0, n.avail_out = 0, n.total_out = 0;
 }
-di.prototype = {
+ui.prototype = {
   deflateInit(n, t) {
     const e = this;
-    return e.dstate = new io(), t || (t = St), e.dstate.deflateInit(e, n, t);
+    return e.dstate = new oo(), t || (t = St), e.dstate.deflateInit(e, n, t);
   },
   deflate(n) {
     const t = this;
@@ -2174,28 +2174,28 @@ di.prototype = {
     t > n.avail_out && (t = n.avail_out), t !== 0 && (n.next_out.set(n.dstate.pending_buf.subarray(n.dstate.pending_out, n.dstate.pending_out + t), n.next_out_index), n.next_out_index += t, n.dstate.pending_out += t, n.total_out += t, n.avail_out -= t, n.dstate.pending -= t, n.dstate.pending === 0 && (n.dstate.pending_out = 0));
   }
 };
-function so(n) {
-  const t = this, e = new di(), r = oo(n && n.chunkSize ? n.chunkSize : 64 * 1024), s = dt, a = new Uint8Array(r);
+function ao(n) {
+  const t = this, e = new ui(), r = co(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, T = 0;
-    const C = [];
+    const O = [];
     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 ? 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);
+        e.next_out_index && (e.next_out_index == r ? O.push(new Uint8Array(a)) : O.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 C.length > 1 ? (x = new Uint8Array(T), C.forEach(function(m) {
+      return O.length > 1 ? (x = new Uint8Array(T), O.forEach(function(m) {
         x.set(m, g), g += m.length;
-      })) : x = C[0] ? new Uint8Array(C[0]) : new Uint8Array(), x;
+      })) : x = O[0] ? new Uint8Array(O[0]) : new Uint8Array(), x;
     }
   }, t.flush = function() {
     let l, f, _ = 0, x = 0;
     const w = [];
     do {
-      if (e.next_out_index = 0, e.avail_out = r, l = e.deflate(Se), l != fi && l != Ue)
+      if (e.next_out_index = 0, e.avail_out = r, l = e.deflate(Se), l != li && l != Ue)
         throw new Error("deflating: " + e.msg);
       r - e.avail_out > 0 && w.push(a.slice(0, e.next_out_index)), x += e.next_out_index;
     } while (e.avail_in > 0 || e.avail_out === 0);
@@ -2204,10 +2204,10 @@ function so(n) {
     }), f;
   };
 }
-function oo(n) {
+function co(n) {
   return n + 5 * (Math.floor(n / 16383) + 1);
 }
-const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, oe = -3, rr = -4, $e = -5, Re = [
+const lo = 15, ee = 0, He = 1, fo = 2, Ae = -2, oe = -3, nr = -4, $e = -5, Re = [
   0,
   1,
   3,
@@ -2225,7 +2225,7 @@ const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, oe = -3, rr = -4, $e = -5, Re = [
   16383,
   32767,
   65535
-], pi = 1440, lo = 0, fo = 4, uo = 9, po = 5, mo = [
+], di = 1440, uo = 0, po = 4, mo = 9, ho = 5, xo = [
   96,
   7,
   256,
@@ -3762,7 +3762,7 @@ const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, oe = -3, rr = -4, $e = -5, Re = [
   0,
   9,
   255
-], ho = [
+], wo = [
   80,
   5,
   1,
@@ -3859,7 +3859,7 @@ const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, oe = -3, rr = -4, $e = -5, Re = [
   192,
   5,
   24577
-], xo = [
+], go = [
   // Copy lengths for literal codes 257..285
   3,
   4,
@@ -3892,7 +3892,7 @@ const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, oe = -3, rr = -4, $e = -5, Re = [
   258,
   0,
   0
-], wo = [
+], _o = [
   // Extra bits for literal codes 257..285
   0,
   0,
@@ -3926,7 +3926,7 @@ const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, oe = -3, rr = -4, $e = -5, Re = [
   112,
   112
   // 112==invalid
-], go = [
+], yo = [
   // Copy offsets for distance codes 0..29
   1,
   2,
@@ -3958,7 +3958,7 @@ const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, oe = -3, rr = -4, $e = -5, Re = [
   12289,
   16385,
   24577
-], _o = [
+], bo = [
   // Extra bits for distance codes
   0,
   0,
@@ -3994,54 +3994,54 @@ const ao = 15, Q = 0, He = 1, co = 2, Ae = -2, oe = -3, rr = -4, $e = -5, Re = [
 function An() {
   const n = this;
   let t, e, r, s, a, c;
-  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;
+  function l(_, x, w, g, T, O, m, d, h, b, R) {
+    let C, S, A, F, y, P, k, E, B, L, Y, H, j, K, G;
+    L = 0, y = w;
     do
-      r[_[x + O]]++, O++, y--;
+      r[_[x + L]]++, L++, y--;
     while (y !== 0);
     if (r[0] == w)
-      return m[0] = -1, d[0] = 0, Q;
-    for (E = d[0], D = 1; D <= Ze && r[D] === 0; D++)
+      return m[0] = -1, d[0] = 0, ee;
+    for (E = d[0], P = 1; P <= Ze && r[P] === 0; P++)
       ;
-    for (b = D, E < D && (E = D), y = Ze; y !== 0 && r[y] === 0; y--)
+    for (k = P, E < P && (E = P), y = Ze; y !== 0 && r[y] === 0; y--)
       ;
-    for (R = y, E > y && (E = y), d[0] = E, G = 1 << D; D < y; D++, G <<= 1)
-      if ((G -= r[D]) < 0)
+    for (A = y, E > y && (E = y), d[0] = E, K = 1 << P; P < y; P++, K <<= 1)
+      if ((K -= r[P]) < 0)
         return oe;
-    if ((G -= r[y]) < 0)
+    if ((K -= 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;
+    for (r[y] += K, c[1] = P = 0, L = 1, j = 2; --y !== 0; )
+      c[j] = P += r[L], j++, L++;
+    y = 0, L = 0;
     do
-      (D = _[x + O]) !== 0 && (A[c[D]++] = y), O++;
+      (P = _[x + L]) !== 0 && (R[c[P]++] = y), L++;
     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]); )
+    for (w = c[A], c[0] = y = 0, L = 0, F = -1, H = -E, a[0] = 0, Y = 0, G = 0; k <= A; k++)
+      for (C = r[k]; C-- !== 0; ) {
+        for (; k > H + E; ) {
+          if (F++, H += E, G = A - H, G = G > E ? E : G, (S = 1 << (P = k - H)) > C + 1 && (S -= C + 1, j = k, P < G))
+            for (; ++P < G && !((S <<= 1) <= r[++j]); )
               S -= r[j];
-          if (K = 1 << D, v[0] + K > pi)
+          if (G = 1 << P, b[0] + G > di)
             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] = $;
+          a[F] = Y = /* hp+ */
+          b[0], b[0] += G, F !== 0 ? (c[F] = y, s[0] = /* (byte) */
+          P, s[1] = /* (byte) */
+          E, P = y >>> H - E, s[2] = /* (int) */
+          Y - a[F - 1] - P, h.set(s, (a[F - 1] + P) * 3)) : m[0] = Y;
         }
         for (s[1] = /* (byte) */
-        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;
+        k - H, L >= w ? s[0] = 192 : R[L] < g ? (s[0] = /* (byte) */
+        R[L] < 256 ? 0 : 96, s[2] = R[L++]) : (s[0] = /* (byte) */
+        O[R[L] - g] + 16 + 64, s[2] = T[R[L++] - g]), S = 1 << k - H, P = y >>> H; P < G; P += S)
+          h.set(s, (Y + P) * 3);
+        for (P = 1 << k - 1; y & P; P >>>= 1)
+          y ^= P;
+        for (y ^= P, B = (1 << H) - 1; (y & B) != c[F]; )
+          F--, H -= E, B = (1 << H) - 1;
       }
-    return G !== 0 && R != 1 ? $e : Q;
+    return K !== 0 && A != 1 ? $e : ee;
   }
   function f(_) {
     let x;
@@ -4054,188 +4054,188 @@ function An() {
     a.set(r.subarray(0, Ze), 0), c.set(r.subarray(0, Ze + 1), 0);
   }
   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);
+    let O;
+    return f(19), t[0] = 0, O = l(_, 0, 19, 19, null, null, w, x, g, t, e), O == oe ? T.msg = "oversubscribed dynamic bit lengths tree" : (O == $e || x[0] === 0) && (T.msg = "incomplete dynamic bit lengths tree", O = oe), O;
+  }, n.inflate_trees_dynamic = function(_, x, w, g, T, O, m, d, h) {
+    let b;
+    return f(288), t[0] = 0, b = l(w, 0, _, 257, go, _o, O, g, d, t, e), b != ee || g[0] === 0 ? (b == oe ? h.msg = "oversubscribed literal/length tree" : b != nr && (h.msg = "incomplete literal/length tree", b = oe), b) : (f(288), b = l(w, _, x, 0, yo, bo, m, T, d, t, e), b != ee || T[0] === 0 && _ > 257 ? (b == oe ? h.msg = "oversubscribed distance tree" : b == $e ? (h.msg = "incomplete distance tree", b = oe) : b != nr && (h.msg = "empty distance tree with lengths", b = oe), b) : ee);
   };
 }
 An.inflate_trees_fixed = function(n, t, e, r) {
-  return n[0] = uo, t[0] = po, e[0] = mo, r[0] = ho, Q;
+  return n[0] = mo, t[0] = ho, e[0] = xo, r[0] = wo, ee;
 };
-const Wt = 0, ir = 1, sr = 2, or = 3, ar = 4, cr = 5, lr = 6, un = 7, fr = 8, Mt = 9;
-function yo() {
+const Bt = 0, rr = 1, ir = 2, sr = 3, or = 4, ar = 5, cr = 6, un = 7, lr = 8, Mt = 9;
+function vo() {
   const n = this;
-  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];
+  let t, e = 0, r, s = 0, a = 0, c = 0, l = 0, f = 0, _ = 0, x = 0, w, g = 0, T, O = 0;
+  function m(d, h, b, R, C, S, A, F) {
+    let y, P, k, E, B, L, Y, H, j, K, G, re, Z, X, $, J;
+    Y = F.next_in_index, H = F.avail_in, B = A.bitb, L = A.bitk, j = A.write, K = j < A.read ? A.read - j - 1 : A.end - j, G = Re[d], re = Re[h];
     do {
-      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--;
+      for (; L < 20; )
+        H--, B |= (F.read_byte(Y++) & 255) << L, L += 8;
+      if (y = B & G, P = b, k = R, J = (k + y) * 3, (E = P[J]) === 0) {
+        B >>= P[J + 1], L -= P[J + 1], A.win[j++] = /* (byte) */
+        P[J + 2], K--;
         continue;
       }
       do {
-        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];
+        if (B >>= P[J + 1], L -= P[J + 1], E & 16) {
+          for (E &= 15, Z = P[J + 2] + /* (int) */
+          (B & Re[E]), B >>= E, L -= E; L < 15; )
+            H--, B |= (F.read_byte(Y++) & 255) << L, L += 8;
+          y = B & re, P = C, k = S, J = (k + y) * 3, E = P[J];
           do
-            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);
+            if (B >>= P[J + 1], L -= P[J + 1], E & 16) {
+              for (E &= 15; L < E; )
+                H--, B |= (F.read_byte(Y++) & 255) << L, L += 8;
+              if (X = P[J + 2] + (B & Re[E]), B >>= E, L -= E, K -= Z, j >= X)
+                $ = j - X, j - $ > 0 && 2 > j - $ ? (A.win[j++] = A.win[$++], A.win[j++] = A.win[$++], Z -= 2) : (A.win.set(A.win.subarray($, $ + 2), j), j += 2, $ += 2, Z -= 2);
               else {
-                Y = j - J;
+                $ = j - X;
                 do
-                  Y += R.end;
-                while (Y < 0);
-                if (E = R.end - Y, Z > E) {
-                  if (Z -= E, j - Y > 0 && E > j - Y)
+                  $ += A.end;
+                while ($ < 0);
+                if (E = A.end - $, Z > E) {
+                  if (Z -= E, j - $ > 0 && E > j - $)
                     do
-                      R.win[j++] = R.win[Y++];
+                      A.win[j++] = A.win[$++];
                     while (--E !== 0);
                   else
-                    R.win.set(R.win.subarray(Y, Y + E), j), j += E, Y += E, E = 0;
-                  Y = 0;
+                    A.win.set(A.win.subarray($, $ + E), j), j += E, $ += E, E = 0;
+                  $ = 0;
                 }
               }
-              if (j - Y > 0 && Z > j - Y)
+              if (j - $ > 0 && Z > j - $)
                 do
-                  R.win[j++] = R.win[Y++];
+                  A.win[j++] = A.win[$++];
                 while (--Z !== 0);
               else
-                R.win.set(R.win.subarray(Y, Y + Z), j), j += Z, Y += Z, Z = 0;
+                A.win.set(A.win.subarray($, $ + Z), j), j += Z, $ += Z, Z = 0;
               break;
             } else if (!(E & 64))
-              y += D[ee + 2], y += M & Re[E], ee = (b + y) * 3, E = D[ee];
+              y += P[J + 2], y += B & Re[E], J = (k + y) * 3, E = P[J];
             else
-              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;
+              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, A.bitb = B, A.bitk = L, F.avail_in = H, F.total_in += Y - F.next_in_index, F.next_in_index = Y, A.write = j, oe;
           while (!0);
           break;
         }
         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--;
+          return E & 32 ? (Z = F.avail_in - H, Z = L >> 3 < Z ? L >> 3 : Z, H += Z, Y -= Z, L -= Z << 3, A.bitb = B, A.bitk = L, F.avail_in = H, F.total_in += Y - F.next_in_index, F.next_in_index = Y, A.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, A.bitb = B, A.bitk = L, F.avail_in = H, F.total_in += Y - F.next_in_index, F.next_in_index = Y, A.write = j, oe);
+        if (y += P[J + 2], y += B & Re[E], J = (k + y) * 3, (E = P[J]) === 0) {
+          B >>= P[J + 1], L -= P[J + 1], A.win[j++] = /* (byte) */
+          P[J + 2], K--;
           break;
         }
       } while (!0);
-    } 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;
+    } 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, A.bitb = B, A.bitk = L, F.avail_in = H, F.total_in += Y - F.next_in_index, F.next_in_index = Y, A.write = j, ee;
   }
-  n.init = function(d, h, v, A, P, S) {
-    t = Wt, _ = /* (byte) */
+  n.init = function(d, h, b, R, C, S) {
+    t = Bt, _ = /* (byte) */
     d, x = /* (byte) */
-    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; ; )
+    h, w = b, g = R, T = C, O = S, r = null;
+  }, n.proc = function(d, h, b) {
+    let R, C, S, A = 0, F = 0, y = 0, P, k, E, B;
+    for (y = h.next_in_index, P = h.avail_in, A = d.bitb, F = d.bitk, k = d.write, E = k < d.read ? d.read - k - 1 : d.end - k; ; )
       switch (t) {
-        case Wt:
-          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;
+        case Bt:
+          if (E >= 258 && P >= 10 && (d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, b = m(_, x, w, g, T, O, d, h), y = h.next_in_index, P = h.avail_in, A = d.bitb, F = d.bitk, k = d.write, E = k < d.read ? d.read - k - 1 : d.end - k, b != ee)) {
+            t = b == He ? un : Mt;
             break;
           }
-          a = _, r = w, s = g, t = ir;
-        case ir:
-          for (A = a; F < A; ) {
-            if (D !== 0)
-              v = Q;
+          a = _, r = w, s = g, t = rr;
+        case rr:
+          for (R = a; F < R; ) {
+            if (P !== 0)
+              b = ee;
             else
-              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;
+              return d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
+            P--, A |= (h.read_byte(y++) & 255) << F, F += 8;
           }
-          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;
+          if (C = (s + (A & Re[R])) * 3, A >>>= r[C + 1], F -= r[C + 1], S = r[C], S === 0) {
+            c = r[C + 2], t = cr;
             break;
           }
           if (S & 16) {
-            l = S & 15, e = r[P + 2], t = sr;
+            l = S & 15, e = r[C + 2], t = ir;
             break;
           }
           if (!(S & 64)) {
-            a = S, s = P / 3 + r[P + 2];
+            a = S, s = C / 3 + r[C + 2];
             break;
           }
           if (S & 32) {
             t = un;
             break;
           }
-          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 (A = l; F < A; ) {
-            if (D !== 0)
-              v = Q;
+          return t = Mt, h.msg = "invalid literal/length code", b = oe, d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
+        case ir:
+          for (R = l; F < R; ) {
+            if (P !== 0)
+              b = ee;
             else
-              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;
+              return d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
+            P--, A |= (h.read_byte(y++) & 255) << F, F += 8;
           }
-          e += R & Re[A], R >>= A, F -= A, a = x, r = T, s = C, t = or;
-        case or:
-          for (A = a; F < A; ) {
-            if (D !== 0)
-              v = Q;
+          e += A & Re[R], A >>= R, F -= R, a = x, r = T, s = O, t = sr;
+        case sr:
+          for (R = a; F < R; ) {
+            if (P !== 0)
+              b = ee;
             else
-              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;
+              return d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
+            P--, A |= (h.read_byte(y++) & 255) << F, F += 8;
           }
-          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;
+          if (C = (s + (A & Re[R])) * 3, A >>= r[C + 1], F -= r[C + 1], S = r[C], S & 16) {
+            l = S & 15, f = r[C + 2], t = or;
             break;
           }
           if (!(S & 64)) {
-            a = S, s = P / 3 + r[P + 2];
+            a = S, s = C / 3 + r[C + 2];
             break;
           }
-          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 (A = l; F < A; ) {
-            if (D !== 0)
-              v = Q;
+          return t = Mt, h.msg = "invalid distance code", b = oe, d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
+        case or:
+          for (R = l; F < R; ) {
+            if (P !== 0)
+              b = ee;
             else
-              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;
+              return d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
+            P--, A |= (h.read_byte(y++) & 255) << F, F += 8;
           }
-          f += R & Re[A], R >>= A, F -= A, t = cr;
-        case cr:
-          for (M = b - f; M < 0; )
-            M += d.end;
+          f += A & Re[R], A >>= R, F -= R, t = ar;
+        case ar:
+          for (B = k - f; B < 0; )
+            B += d.end;
           for (; e !== 0; ) {
-            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--;
+            if (E === 0 && (k == d.end && d.read !== 0 && (k = 0, E = k < d.read ? d.read - k - 1 : d.end - k), E === 0 && (d.write = k, b = d.inflate_flush(h, b), k = d.write, E = k < d.read ? d.read - k - 1 : d.end - k, k == d.end && d.read !== 0 && (k = 0, E = k < d.read ? d.read - k - 1 : d.end - k), E === 0)))
+              return d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
+            d.win[k++] = d.win[B++], E--, B == d.end && (B = 0), e--;
           }
-          t = Wt;
+          t = Bt;
           break;
-        case lr:
-          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;
+        case cr:
+          if (E === 0 && (k == d.end && d.read !== 0 && (k = 0, E = k < d.read ? d.read - k - 1 : d.end - k), E === 0 && (d.write = k, b = d.inflate_flush(h, b), k = d.write, E = k < d.read ? d.read - k - 1 : d.end - k, k == d.end && d.read !== 0 && (k = 0, E = k < d.read ? d.read - k - 1 : d.end - k), E === 0)))
+            return d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
+          b = ee, d.win[k++] = /* (byte) */
+          c, E--, t = Bt;
           break;
         case un:
-          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 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);
+          if (F > 7 && (F -= 8, P++, y--), d.write = k, b = d.inflate_flush(h, b), k = d.write, E = k < d.read ? d.read - k - 1 : d.end - k, d.read != d.write)
+            return d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
+          t = lr;
+        case lr:
+          return b = He, d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
         case Mt:
-          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);
+          return b = oe, d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
         default:
-          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);
+          return b = Ae, d.bitb = A, d.bitk = F, h.avail_in = P, h.total_in += y - h.next_in_index, h.next_in_index = y, d.write = k, d.inflate_flush(h, b);
       }
   }, n.free = function() {
   };
 }
-const ur = [
+const fr = [
   // Order of the bit length code lengths
   16,
   17,
@@ -4256,154 +4256,154 @@ const ur = [
   14,
   1,
   15
-], ft = 0, dn = 1, dr = 2, pr = 3, mr = 4, hr = 5, Nt = 6, qt = 7, xr = 8, nt = 9;
-function bo(n, t) {
+], ft = 0, dn = 1, ur = 2, dr = 3, pr = 4, mr = 5, Nt = 6, qt = 7, hr = 8, nt = 9;
+function ko(n, t) {
   const e = this;
   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 T = 0, C = new An();
+  const f = [0], _ = [0], x = new vo();
+  let w = 0, g = new Int32Array(di * 3);
+  const T = 0, O = 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] = 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, 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;
+    let h, b, R;
+    return b = m.next_out_index, R = e.read, h = /* (int) */
+    (R <= e.write ? e.write : e.end) - R, h > m.avail_out && (h = m.avail_out), h !== 0 && d == $e && (d = ee), m.avail_out -= h, m.total_out += h, m.next_out.set(e.win.subarray(R, R + h), b), b += h, R += h, R == e.end && (R = 0, e.write == e.end && (e.write = 0), h = e.write - R, h > m.avail_out && (h = m.avail_out), h !== 0 && d == $e && (d = ee), m.avail_out -= h, m.total_out += h, m.next_out.set(e.win.subarray(R, R + h), b), b += h, R += h), m.next_out_index = b, e.read = R, d;
   }, e.proc = function(m, d) {
-    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 D, b, E, M, O, $, H, j;
+    let h, b, R, C, S, A, F, y;
+    for (C = m.next_in_index, S = m.avail_in, b = e.bitb, R = e.bitk, A = e.write, F = /* (int) */
+    A < e.read ? e.read - A - 1 : e.end - A; ; ) {
+      let P, k, E, B, L, Y, H, j;
       switch (r) {
         case ft:
-          for (; A < 3; ) {
+          for (; R < 3; ) {
             if (S !== 0)
-              d = Q;
+              d = ee;
             else
-              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;
+              return e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+            S--, b |= (m.read_byte(C++) & 255) << R, R += 8;
           }
           switch (h = /* (int) */
-          v & 7, w = h & 1, h >>> 1) {
+          b & 7, w = h & 1, h >>> 1) {
             case 0:
-              v >>>= 3, A -= 3, h = A & 7, v >>>= h, A -= h, r = dn;
+              b >>>= 3, R -= 3, h = R & 7, b >>>= h, R -= h, r = dn;
               break;
             case 1:
-              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;
+              P = [], k = [], E = [[]], B = [[]], An.inflate_trees_fixed(P, k, E, B), x.init(P[0], k[0], E[0], 0, B[0], 0), b >>>= 3, R -= 3, r = Nt;
               break;
             case 2:
-              v >>>= 3, A -= 3, r = pr;
+              b >>>= 3, R -= 3, r = dr;
               break;
             case 3:
-              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);
+              return b >>>= 3, R -= 3, r = nt, m.msg = "invalid block type", d = oe, e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
           }
           break;
         case dn:
-          for (; A < 32; ) {
+          for (; R < 32; ) {
             if (S !== 0)
-              d = Q;
+              d = ee;
             else
-              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;
+              return e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+            S--, b |= (m.read_byte(C++) & 255) << R, R += 8;
           }
-          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;
+          if ((~b >>> 16 & 65535) != (b & 65535))
+            return r = nt, m.msg = "invalid stored block lengths", d = oe, e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+          s = b & 65535, b = R = 0, r = s !== 0 ? ur : w !== 0 ? qt : ft;
           break;
-        case dr:
-          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 = 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)
+        case ur:
+          if (S === 0 || F === 0 && (A == e.end && e.read !== 0 && (A = 0, F = /* (int) */
+          A < e.read ? e.read - A - 1 : e.end - A), F === 0 && (e.write = A, d = e.inflate_flush(m, d), A = e.write, F = /* (int) */
+          A < e.read ? e.read - A - 1 : e.end - A, A == e.end && e.read !== 0 && (A = 0, F = /* (int) */
+          A < e.read ? e.read - A - 1 : e.end - A), F === 0)))
+            return e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+          if (d = ee, h = s, h > S && (h = S), h > F && (h = F), e.win.set(m.read_buf(C, h), A), C += h, S -= h, A += h, F -= h, (s -= h) !== 0)
             break;
           r = w !== 0 ? qt : ft;
           break;
-        case pr:
-          for (; A < 14; ) {
+        case dr:
+          for (; R < 14; ) {
             if (S !== 0)
-              d = Q;
+              d = ee;
             else
-              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;
+              return e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+            S--, b |= (m.read_byte(C++) & 255) << R, R += 8;
           }
-          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 (a = h = b & 16383, (h & 31) > 29 || (h >> 5 & 31) > 29)
+            return r = nt, m.msg = "too many length or distance symbols", d = oe, e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
           if (h = 258 + (h & 31) + (h >> 5 & 31), !l || l.length < h)
             l = [];
           else
             for (y = 0; y < h; y++)
               l[y] = 0;
-          v >>>= 14, A -= 14, c = 0, r = mr;
-        case mr:
+          b >>>= 14, R -= 14, c = 0, r = pr;
+        case pr:
           for (; c < 4 + (a >>> 10); ) {
-            for (; A < 3; ) {
+            for (; R < 3; ) {
               if (S !== 0)
-                d = Q;
+                d = ee;
               else
-                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;
+                return e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+              S--, b |= (m.read_byte(C++) & 255) << R, R += 8;
             }
-            l[ur[c++]] = v & 7, v >>>= 3, A -= 3;
+            l[fr[c++]] = b & 7, b >>>= 3, R -= 3;
           }
           for (; c < 19; )
-            l[ur[c++]] = 0;
-          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:
+            l[fr[c++]] = 0;
+          if (f[0] = 7, h = O.inflate_trees_bits(l, f, _, g, m), h != ee)
+            return d = h, d == oe && (l = null, r = nt), e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+          c = 0, r = mr;
+        case mr:
           for (; h = a, !(c >= 258 + (h & 31) + (h >> 5 & 31)); ) {
-            let G, K;
-            for (h = f[0]; A < h; ) {
+            let K, G;
+            for (h = f[0]; R < h; ) {
               if (S !== 0)
-                d = Q;
+                d = ee;
               else
-                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;
+                return e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+              S--, b |= (m.read_byte(C++) & 255) << R, R += 8;
             }
-            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;
+            if (h = g[(_[0] + (b & Re[h])) * 3 + 1], G = g[(_[0] + (b & Re[h])) * 3 + 2], G < 16)
+              b >>>= h, R -= h, l[c++] = G;
             else {
-              for (y = K == 18 ? 7 : K - 14, G = K == 18 ? 11 : 3; A < h + y; ) {
+              for (y = G == 18 ? 7 : G - 14, K = G == 18 ? 11 : 3; R < h + y; ) {
                 if (S !== 0)
-                  d = Q;
+                  d = ee;
                 else
-                  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;
+                  return e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+                S--, b |= (m.read_byte(C++) & 255) << R, R += 8;
               }
-              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;
+              if (b >>>= h, R -= h, K += b & Re[y], b >>>= y, R -= y, y = c, h = a, y + K > 258 + (h & 31) + (h >> 5 & 31) || G == 16 && y < 1)
+                return l = null, r = nt, m.msg = "invalid bit length repeat", d = oe, e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+              G = G == 16 ? l[y - 1] : 0;
               do
-                l[y++] = K;
-              while (--G !== 0);
+                l[y++] = G;
+              while (--K !== 0);
               c = y;
             }
           }
-          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;
+          if (_[0] = -1, L = [], Y = [], H = [], j = [], L[0] = 9, Y[0] = 6, h = a, h = O.inflate_trees_dynamic(257 + (h & 31), 1 + (h >> 5 & 31), l, L, Y, H, j, g, m), h != ee)
+            return h == oe && (l = null, r = nt), d = h, e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+          x.init(L[0], Y[0], g, H[0], g, j[0]), r = Nt;
         case Nt:
-          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)
+          if (e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, (d = x.proc(e, m, d)) != He)
             return e.inflate_flush(m, d);
-          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) {
+          if (d = ee, x.free(m), C = m.next_in_index, S = m.avail_in, b = e.bitb, R = e.bitk, A = e.write, F = /* (int) */
+          A < e.read ? e.read - A - 1 : e.end - A, w === 0) {
             r = ft;
             break;
           }
           r = qt;
         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 = 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 = 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 (e.write = A, d = e.inflate_flush(m, d), A = e.write, F = /* (int) */
+          A < e.read ? e.read - A - 1 : e.end - A, e.read != e.write)
+            return e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
+          r = hr;
+        case hr:
+          return d = He, e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
         case nt:
-          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);
+          return d = oe, e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
         default:
-          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);
+          return d = Ae, e.bitb = b, e.bitk = R, m.avail_in = S, m.total_in += C - m.next_in_index, m.next_in_index = C, e.write = A, e.inflate_flush(m, d);
       }
     }
   }, e.free = function(m) {
@@ -4414,28 +4414,28 @@ function bo(n, t) {
     return r == dn ? 1 : 0;
   };
 }
-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 Eo = 32, So = 8, Ao = 0, xr = 1, wr = 2, gr = 3, _r = 4, yr = 5, pn = 6, vt = 7, br = 12, Ve = 13, To = [0, 0, 255, 255];
+function Ro() {
   const n = this;
   n.mode = 0, n.method = 0, n.was = [0], n.need = 0, n.marker = 0, n.wbits = 0;
   function t(e) {
-    return !e || !e.istate ? Ae : (e.total_in = e.total_out = 0, e.msg = null, e.istate.mode = vt, e.istate.blocks.reset(e, null), Q);
+    return !e || !e.istate ? Ae : (e.total_in = e.total_out = 0, e.msg = null, e.istate.mode = vt, e.istate.blocks.reset(e, null), ee);
   }
   n.inflateEnd = function(e) {
-    return n.blocks && n.blocks.free(e), n.blocks = null, Q;
+    return n.blocks && n.blocks.free(e), n.blocks = null, ee;
   }, n.inflateInit = function(e, r) {
-    return e.msg = null, n.blocks = null, r < 8 || r > 15 ? (n.inflateEnd(e), Ae) : (n.wbits = r, e.istate.blocks = new bo(e, 1 << r), t(e), Q);
+    return e.msg = null, n.blocks = null, r < 8 || r > 15 ? (n.inflateEnd(e), Ae) : (n.wbits = r, e.istate.blocks = new ko(e, 1 << r), t(e), ee);
   }, n.inflate = function(e, r) {
     let s, a;
     if (!e || !e.istate || !e.next_in)
       return Ae;
     const c = e.istate;
-    for (r = r == fo ? $e : Q, s = $e; ; )
+    for (r = r == po ? $e : ee, s = $e; ; )
       switch (c.mode) {
-        case Eo:
+        case Ao:
           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) != ko) {
+          if (s = r, e.avail_in--, e.total_in++, ((c.method = e.read_byte(e.next_in_index++)) & 15) != So) {
             c.mode = Ve, e.msg = "unknown compression method", c.marker = 5;
             break;
           }
@@ -4443,33 +4443,33 @@ function Ao() {
             c.mode = Ve, e.msg = "invalid win size", c.marker = 5;
             break;
           }
-          c.mode = wr;
-        case wr:
+          c.mode = xr;
+        case xr:
           if (e.avail_in === 0)
             return s;
           if (s = r, e.avail_in--, e.total_in++, a = e.read_byte(e.next_in_index++) & 255, ((c.method << 8) + a) % 31 !== 0) {
             c.mode = Ve, e.msg = "incorrect header check", c.marker = 5;
             break;
           }
-          if (!(a & vo)) {
+          if (!(a & Eo)) {
             c.mode = vt;
             break;
           }
-          c.mode = gr;
+          c.mode = wr;
+        case wr:
+          if (e.avail_in === 0)
+            return s;
+          s = r, e.avail_in--, e.total_in++, c.need = (e.read_byte(e.next_in_index++) & 255) << 24 & 4278190080, c.mode = gr;
         case gr:
           if (e.avail_in === 0)
             return s;
-          s = r, e.avail_in--, e.total_in++, c.need = (e.read_byte(e.next_in_index++) & 255) << 24 & 4278190080, c.mode = _r;
+          s = r, e.avail_in--, e.total_in++, c.need += (e.read_byte(e.next_in_index++) & 255) << 16 & 16711680, c.mode = _r;
         case _r:
           if (e.avail_in === 0)
             return s;
-          s = r, e.avail_in--, e.total_in++, c.need += (e.read_byte(e.next_in_index++) & 255) << 16 & 16711680, c.mode = yr;
+          s = r, e.avail_in--, e.total_in++, c.need += (e.read_byte(e.next_in_index++) & 255) << 8 & 65280, c.mode = yr;
         case yr:
-          if (e.avail_in === 0)
-            return s;
-          s = r, e.avail_in--, e.total_in++, c.need += (e.read_byte(e.next_in_index++) & 255) << 8 & 65280, c.mode = br;
-        case br:
-          return e.avail_in === 0 ? s : (s = r, e.avail_in--, e.total_in++, c.need += e.read_byte(e.next_in_index++) & 255, c.mode = pn, co);
+          return e.avail_in === 0 ? s : (s = r, e.avail_in--, e.total_in++, c.need += e.read_byte(e.next_in_index++) & 255, c.mode = pn, fo);
         case pn:
           return c.mode = Ve, e.msg = "need dictionary", c.marker = 0, Ae;
         case vt:
@@ -4477,10 +4477,10 @@ function Ao() {
             c.mode = Ve, c.marker = 0;
             break;
           }
-          if (s == Q && (s = r), s != He)
+          if (s == ee && (s = r), s != He)
             return s;
-          s = r, c.blocks.reset(e, c.was), c.mode = vr;
-        case vr:
+          s = r, c.blocks.reset(e, c.was), c.mode = br;
+        case br:
           return e.avail_in = 0, He;
         case Ve:
           return oe;
@@ -4492,7 +4492,7 @@ function Ao() {
     if (!e || !e.istate || e.istate.mode != pn)
       return Ae;
     const l = e.istate;
-    return c >= 1 << l.wbits && (c = (1 << l.wbits) - 1, a = s - c), l.blocks.set_dictionary(r, a, c), l.mode = vt, Q;
+    return c >= 1 << l.wbits && (c = (1 << l.wbits) - 1, a = s - c), l.blocks.set_dictionary(r, a, c), l.mode = vt, ee;
   }, n.inflateSync = function(e) {
     let r, s, a, c, l;
     if (!e || !e.istate)
@@ -4501,18 +4501,18 @@ function Ao() {
     if (f.mode != Ve && (f.mode = Ve, f.marker = 0), (r = e.avail_in) === 0)
       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 ? oe : (c = e.total_in, l = e.total_out, t(e), e.total_in = c, e.total_out = l, f.mode = vt, Q);
+      e.read_byte(s) == To[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 ? oe : (c = e.total_in, l = e.total_out, t(e), e.total_in = c, e.total_out = l, f.mode = vt, ee);
   }, n.inflateSyncPoint = function(e) {
     return !e || !e.istate || !e.istate.blocks ? Ae : e.istate.blocks.sync_point();
   };
 }
-function mi() {
+function pi() {
 }
-mi.prototype = {
+pi.prototype = {
   inflateInit(n) {
     const t = this;
-    return t.istate = new Ao(), n || (n = ao), t.istate.inflateInit(t, n);
+    return t.istate = new Ro(), n || (n = lo), t.istate.inflateInit(t, n);
   },
   inflate(n) {
     const t = this;
@@ -4540,25 +4540,25 @@ mi.prototype = {
     return this.next_in.subarray(n, n + t);
   }
 };
-function To(n) {
-  const t = this, e = new mi(), r = n && n.chunkSize ? Math.floor(n.chunkSize * 2) : 128 * 1024, s = lo, a = new Uint8Array(r);
+function Fo(n) {
+  const t = this, e = new pi(), r = n && n.chunkSize ? Math.floor(n.chunkSize * 2) : 128 * 1024, s = uo, a = new Uint8Array(r);
   let c = !1;
   e.inflateInit(), e.next_out = a, t.append = function(l, f) {
     const _ = [];
-    let x, w, g = 0, T = 0, C = 0;
+    let x, w, g = 0, T = 0, O = 0;
     if (l.length !== 0) {
       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.avail_in === 0 && !c && (e.next_in_index = 0, c = !0), x = e.inflate(s), c && x === $e) {
           if (e.avail_in !== 0)
             throw new Error("inflating: bad input");
-        } else if (x !== Q && x !== He)
+        } else if (x !== ee && x !== He)
           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))), 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);
+        e.next_out_index && (e.next_out_index === r ? _.push(new Uint8Array(a)) : _.push(a.subarray(0, e.next_out_index))), O += 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(C), _.forEach(function(m) {
+      return _.length > 1 ? (w = new Uint8Array(O), _.forEach(function(m) {
         w.set(m, T), T += m.length;
       })) : w = _[0] ? new Uint8Array(_[0]) : new Uint8Array(), w;
     }
@@ -4566,8 +4566,8 @@ function To(n) {
     e.inflateEnd();
   };
 }
-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 {
+const st = 4294967295, Xe = 65535, Co = 8, Io = 0, Po = 99, Do = 67324752, Lo = 134695760, vr = 33639248, Uo = 101010256, kr = 101075792, Oo = 117853008, ut = 22, mn = 20, hn = 56, Wo = 1, Bo = 39169, Mo = 10, No = 1, qo = 21589, jo = 28789, Ho = 25461, $o = 6534, Er = 1, Yo = 6, Sr = 8, Ar = 2048, Tr = 16, Rr = 16384, Fr = 73, Cr = "/", Ee = void 0, Qe = "undefined", Ft = "function";
+class Ir {
   constructor(t) {
     return class extends TransformStream {
       constructor(e, r) {
@@ -4585,29 +4585,29 @@ class Pr {
     };
   }
 }
-const $o = 64;
-let hi = 2;
+const Zo = 64;
+let mi = 2;
 try {
-  typeof navigator != Qe && navigator.hardwareConcurrency && (hi = navigator.hardwareConcurrency);
+  typeof navigator != Qe && navigator.hardwareConcurrency && (mi = navigator.hardwareConcurrency);
 } catch {
 }
-const Yo = {
+const Vo = {
   chunkSize: 512 * 1024,
-  maxWorkers: hi,
+  maxWorkers: mi,
   terminateWorkerTimeout: 5e3,
   useWebWorkers: !0,
   useCompressionStream: !0,
   workerScripts: Ee,
   CompressionStreamNative: typeof CompressionStream != Qe && CompressionStream,
   DecompressionStreamNative: typeof DecompressionStream != Qe && DecompressionStream
-}, ze = Object.assign({}, Yo);
-function Zo() {
+}, ze = Object.assign({}, Vo);
+function Go() {
   return ze;
 }
-function Vo(n) {
-  return Math.max(n.chunkSize, $o);
+function Ko(n) {
+  return Math.max(n.chunkSize, Zo);
 }
-function Wn(n) {
+function Bn(n) {
   const {
     baseURL: t,
     chunkSize: e,
@@ -4621,7 +4621,7 @@ 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 !== Ee) {
+  if (Ge("baseURL", t), Ge("chunkSize", e), Ge("maxWorkers", r), Ge("terminateWorkerTimeout", s), Ge("useCompressionStream", a), Ge("useWebWorkers", c), l && (ze.CompressionStream = new Ir(l)), f && (ze.DecompressionStream = new Ir(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))
@@ -6232,12 +6232,12 @@ const xn = {
     }
   return n;
 })();
-const xi = [];
+const hi = [];
 for (let n = 0; n < 256; n++) {
   let t = n;
   for (let e = 0; e < 8; e++)
     t & 1 ? t = t >>> 1 ^ 3988292384 : t = t >>> 1;
-  xi[n] = t;
+  hi[n] = t;
 }
 class Xt {
   constructor(t) {
@@ -6246,14 +6246,14 @@ class Xt {
   append(t) {
     let e = this.crc | 0;
     for (let r = 0, s = t.length | 0; r < s; r++)
-      e = e >>> 8 ^ xi[(e ^ t[r]) & 255];
+      e = e >>> 8 ^ hi[(e ^ t[r]) & 255];
     this.crc = e;
   }
   get() {
     return ~this.crc;
   }
 }
-class wi extends TransformStream {
+class xi extends TransformStream {
   constructor() {
     let t;
     const e = new Xt();
@@ -6268,7 +6268,7 @@ class wi extends TransformStream {
     }), t = this;
   }
 }
-function Go(n) {
+function Xo(n) {
   if (typeof TextEncoder == Qe) {
     n = unescape(encodeURIComponent(n));
     const t = new Uint8Array(n.length);
@@ -6370,8 +6370,8 @@ const ke = {
       return e & 3 && t.push(ke.partial(8 * (e & 3), r)), t;
     }
   }
-}, gi = {};
-gi.sha1 = class {
+}, wi = {};
+wi.sha1 = class {
   constructor(n) {
     const t = this;
     t.blockSize = 512, t._init = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], t._key = [1518500249, 1859775393, 2400959708, 3395469782], n ? (t._h = n._h.slice(0), t._buffer = n._buffer.slice(0), t._length = n._length) : t.reset();
@@ -6455,8 +6455,8 @@ gi.sha1 = class {
     e[0] = e[0] + s | 0, e[1] = e[1] + a | 0, e[2] = e[2] + c | 0, e[3] = e[3] + l | 0, e[4] = e[4] + f | 0;
   }
 };
-const _i = {};
-_i.aes = class {
+const gi = {};
+gi.aes = class {
   constructor(n) {
     const t = this;
     t._tables = [[[], [], [], [], []], [[], [], [], [], []]], t._tables[0][0][0] || t._precompute();
@@ -6509,8 +6509,8 @@ _i.aes = class {
       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, 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 O = 0; O < 4; O++)
+        n[O][x] = T = T << 24 ^ T >>> 8, t[O][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,15 +6526,15 @@ _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], 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;
+    let w = n[0] ^ e[0], g = n[t ? 3 : 1] ^ e[1], T = n[2] ^ e[2], O = n[t ? 1 : 3] ^ e[3], m = 4, d, h, b;
+    for (let R = 0; R < r; R++)
+      d = c[w >>> 24] ^ l[g >> 16 & 255] ^ f[T >> 8 & 255] ^ _[O & 255] ^ e[m], h = c[g >>> 24] ^ l[T >> 16 & 255] ^ f[O >> 8 & 255] ^ _[w & 255] ^ e[m + 1], b = c[T >>> 24] ^ l[O >> 16 & 255] ^ f[w >> 8 & 255] ^ _[g & 255] ^ e[m + 2], O = c[O >>> 24] ^ l[w >> 16 & 255] ^ f[g >> 8 & 255] ^ _[T & 255] ^ e[m + 3], m += 4, w = d, g = h, T = b;
+    for (let R = 0; R < 4; R++)
+      s[t ? 3 & -R : R] = x[w >>> 24] << 24 ^ x[g >> 16 & 255] << 16 ^ x[T >> 8 & 255] << 8 ^ x[O & 255] ^ e[m++], d = w, w = g, g = T, T = O, O = d;
     return s;
   }
 };
-const Ko = {
+const zo = {
   /** 
    * Generate random words with pure js, cryptographically not as strong & safe as native implementation.
    * @param {TypedArray} typedArray The array to fill.
@@ -6554,8 +6554,8 @@ const Ko = {
     }
     return n;
   }
-}, yi = {};
-yi.ctrGladman = class {
+}, _i = {};
+_i.ctrGladman = class {
   constructor(n, t) {
     this._prf = n, this._initIv = t, this._iv = t;
   }
@@ -6616,7 +6616,7 @@ const ot = {
 };
 ot.hmacSha1 = class {
   constructor(n) {
-    const t = this, e = t._hash = gi.sha1, r = [[], []];
+    const t = this, e = t._hash = wi.sha1, r = [[], []];
     t._baseHash = [new e(), new e()];
     const s = t._baseHash[0].blockSize / 32;
     n.length > s && (n = new e().update(n).finalize());
@@ -6642,19 +6642,19 @@ ot.hmacSha1 = class {
     return this.update(n), this.digest(n);
   }
 };
-const Xo = typeof crypto != Qe && typeof crypto.getRandomValues == Ft, bi = "Invalid password", vi = "Invalid signature", Mn = "zipjs-abort-check-password";
-function ki(n) {
-  return Xo ? crypto.getRandomValues(n) : Ko.getRandomValues(n);
+const Jo = typeof crypto != Qe && typeof crypto.getRandomValues == Ft, yi = "Invalid password", bi = "Invalid signature", Mn = "zipjs-abort-check-password";
+function vi(n) {
+  return Jo ? crypto.getRandomValues(n) : zo.getRandomValues(n);
 }
-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 {
+const pt = 16, Qo = "raw", ki = { name: "PBKDF2" }, ea = { name: "HMAC" }, ta = "SHA-1", na = Object.assign({ hash: ea }, ki), Tn = Object.assign({ iterations: 1e3, hash: { name: ta } }, ki), ra = ["deriveBits"], At = [8, 12, 16], kt = [16, 24, 32], Ke = 10, ia = [0, 0, 0, 0], rn = typeof crypto != Qe, Ct = rn && crypto.subtle, Ei = rn && typeof Ct != Qe, Me = zt.bytes, sa = gi.aes, oa = _i.ctrGladman, aa = ot.hmacSha1;
+let Pr = rn && Ei && typeof Ct.importKey == Ft, Dr = rn && Ei && typeof Ct.deriveBits == Ft;
+class ca extends TransformStream {
   constructor({ password: t, rawPassword: e, signed: r, encryptionStrength: s, checkPasswordOnly: a }) {
     super({
       start() {
         Object.assign(this, {
           ready: new Promise((c) => this.resolveReady = c),
-          password: Ri(t, e),
+          password: Ti(t, e),
           signed: r,
           strength: s - 1,
           pending: new Uint8Array()
@@ -6667,9 +6667,9 @@ class oa extends TransformStream {
           resolveReady: w,
           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;
+        _ ? (await fa(f, x, _, Ie(c, 0, At[x] + 2)), c = Ie(c, At[x] + 2), a ? l.error(new Error(Mn)) : w()) : await g;
         const T = new Uint8Array(c.length - Ke - (c.length - Ke) % pt);
-        l.enqueue(Ai(f, c, T, 0, Ke, !0));
+        l.enqueue(Si(f, c, T, 0, Ke, !0));
       },
       async flush(c) {
         const {
@@ -6682,33 +6682,33 @@ class oa extends TransformStream {
         if (_ && f) {
           await w;
           const g = Ie(x, 0, x.length - Ke), T = Ie(x, x.length - Ke);
-          let C = new Uint8Array();
+          let O = new Uint8Array();
           if (g.length) {
             const m = Rt(Me, g);
             _.update(m);
             const d = f.update(m);
-            C = Tt(Me, d);
+            O = Tt(Me, d);
           }
           if (l) {
             const m = Ie(Tt(Me, _.digest()), 0, Ke);
             for (let d = 0; d < Ke; d++)
               if (m[d] != T[d])
-                throw new Error(vi);
+                throw new Error(bi);
           }
-          c.enqueue(C);
+          c.enqueue(O);
         }
       }
     });
   }
 }
-class aa extends TransformStream {
+class la extends TransformStream {
   constructor({ password: t, rawPassword: e, encryptionStrength: r }) {
     let s;
     super({
       start() {
         Object.assign(this, {
           ready: new Promise((a) => this.resolveReady = a),
-          password: Ri(t, e),
+          password: Ti(t, e),
           strength: r - 1,
           pending: new Uint8Array()
         });
@@ -6721,9 +6721,9 @@ class aa extends TransformStream {
           ready: w
         } = l;
         let g = new Uint8Array();
-        f ? (g = await la(l, _, f), x()) : await w;
+        f ? (g = await ua(l, _, f), x()) : await w;
         const T = new Uint8Array(g.length + a.length - a.length % pt);
-        T.set(g, 0), c.enqueue(Ai(l, a, T, g.length, 0));
+        T.set(g, 0), c.enqueue(Si(l, a, T, g.length, 0));
       },
       async flush(a) {
         const {
@@ -6745,13 +6745,13 @@ class aa extends TransformStream {
     }), s = this;
   }
 }
-function Ai(n, t, e, r, s, a) {
+function Si(n, t, e, r, s, a) {
   const {
     ctr: c,
     hmac: l,
     pending: f
   } = n, _ = t.length - s;
-  f.length && (t = Nn(f, t), e = da(e, _ - _ % pt));
+  f.length && (t = Nn(f, t), e = ma(e, _ - _ % pt));
   let x;
   for (x = 0; x <= _ - pt; x += pt) {
     const w = Rt(Me, Ie(t, x, x + pt));
@@ -6761,56 +6761,56 @@ function Ai(n, t, e, r, s, a) {
   }
   return n.pending = Ie(t, x), e;
 }
-async function ca(n, t, e, r) {
-  const s = await Ti(n, t, e, Ie(r, 0, At[t])), a = Ie(r, At[t]);
+async function fa(n, t, e, r) {
+  const s = await Ai(n, t, e, Ie(r, 0, At[t])), a = Ie(r, At[t]);
   if (s[0] != a[0] || s[1] != a[1])
-    throw new Error(bi);
+    throw new Error(yi);
 }
-async function la(n, t, e) {
-  const r = ki(new Uint8Array(At[t])), s = await Ti(n, t, e, r);
+async function ua(n, t, e) {
+  const r = vi(new Uint8Array(At[t])), s = await Ai(n, t, e, r);
   return Nn(r, s);
 }
-async function Ti(n, t, e, r) {
+async function Ai(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 * (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);
+  const s = await da(Qo, e, na, !1, ra), a = await pa(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,
       authentication: f,
       passwordVerification: _
     },
-    ctr: new ia(new ra(l), Array.from(na)),
-    hmac: new sa(f)
+    ctr: new oa(new sa(l), Array.from(ia)),
+    hmac: new aa(f)
   }), _;
 }
-async function fa(n, t, e, r, s) {
-  if (Dr)
+async function da(n, t, e, r, s) {
+  if (Pr)
     try {
       return await Ct.importKey(n, t, e, r, s);
     } catch {
-      return Dr = !1, ot.importKey(t);
+      return Pr = !1, ot.importKey(t);
     }
   else
     return ot.importKey(t);
 }
-async function ua(n, t, e) {
-  if (Lr)
+async function pa(n, t, e) {
+  if (Dr)
     try {
       return await Ct.deriveBits(n, t, e);
     } catch {
-      return Lr = !1, ot.pbkdf2(t, n.salt, Tn.iterations, e);
+      return Dr = !1, ot.pbkdf2(t, n.salt, Tn.iterations, e);
     }
   else
     return ot.pbkdf2(t, n.salt, Tn.iterations, e);
 }
-function Ri(n, t) {
-  return t === Ee ? Go(n) : t;
+function Ti(n, t) {
+  return t === Ee ? Xo(n) : t;
 }
 function Nn(n, t) {
   let e = n;
   return n.length + t.length && (e = new Uint8Array(n.length + t.length), e.set(n, 0), e.set(t, n.length)), e;
 }
-function da(n, t) {
+function ma(n, t) {
   if (t && t > n.length) {
     const e = n;
     n = new Uint8Array(t), n.set(e, 0);
@@ -6827,64 +6827,64 @@ function Rt(n, t) {
   return n.toBits(t);
 }
 const ht = 12;
-class pa extends TransformStream {
+class ha extends TransformStream {
   constructor({ password: t, passwordVerification: e, checkPasswordOnly: r }) {
     super({
       start() {
         Object.assign(this, {
           password: t,
           passwordVerification: e
-        }), Fi(this, t);
+        }), Ri(this, t);
       },
       transform(s, a) {
         const c = this;
         if (c.password) {
-          const l = Ur(c, s.subarray(0, ht));
+          const l = Lr(c, s.subarray(0, ht));
           if (c.password = null, l[ht - 1] != c.passwordVerification)
-            throw new Error(bi);
+            throw new Error(yi);
           s = s.subarray(ht);
         }
-        r ? a.error(new Error(Mn)) : a.enqueue(Ur(c, s));
+        r ? a.error(new Error(Mn)) : a.enqueue(Lr(c, s));
       }
     });
   }
 }
-class ma extends TransformStream {
+class xa extends TransformStream {
   constructor({ password: t, passwordVerification: e }) {
     super({
       start() {
         Object.assign(this, {
           password: t,
           passwordVerification: e
-        }), Fi(this, t);
+        }), Ri(this, t);
       },
       transform(r, s) {
         const a = this;
         let c, l;
         if (a.password) {
           a.password = null;
-          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;
+          const f = vi(new Uint8Array(ht));
+          f[ht - 1] = a.passwordVerification, c = new Uint8Array(r.length + f.length), c.set(Ur(a, f), 0), l = ht;
         } else
           c = new Uint8Array(r.length), l = 0;
-        c.set(Or(a, r), l), s.enqueue(c);
+        c.set(Ur(a, r), l), s.enqueue(c);
       }
     });
   }
 }
-function Ur(n, t) {
+function Lr(n, t) {
   const e = new Uint8Array(t.length);
   for (let r = 0; r < t.length; r++)
-    e[r] = Ci(n) ^ t[r], qn(n, e[r]);
+    e[r] = Fi(n) ^ t[r], qn(n, e[r]);
   return e;
 }
-function Or(n, t) {
+function Ur(n, t) {
   const e = new Uint8Array(t.length);
   for (let r = 0; r < t.length; r++)
-    e[r] = Ci(n) ^ t[r], qn(n, t[r]);
+    e[r] = Fi(n) ^ t[r], qn(n, t[r]);
   return e;
 }
-function Fi(n, t) {
+function Ri(n, t) {
   const e = [305419896, 591751049, 878082192];
   Object.assign(n, {
     keys: e,
@@ -6896,59 +6896,59 @@ function Fi(n, t) {
 }
 function qn(n, t) {
   let [e, r, s] = n.keys;
-  n.crcKey0.append([t]), e = ~n.crcKey0.get(), r = Br(Math.imul(Br(r + Ii(e)), 134775813) + 1), n.crcKey2.append([r >>> 24]), s = ~n.crcKey2.get(), n.keys = [e, r, s];
+  n.crcKey0.append([t]), e = ~n.crcKey0.get(), r = Or(Math.imul(Or(r + Ci(e)), 134775813) + 1), n.crcKey2.append([r >>> 24]), s = ~n.crcKey2.get(), n.keys = [e, r, s];
 }
-function Ci(n) {
+function Fi(n) {
   const t = n.keys[2] | 2;
-  return Ii(Math.imul(t, t ^ 1) >>> 8);
+  return Ci(Math.imul(t, t ^ 1) >>> 8);
 }
-function Ii(n) {
+function Ci(n) {
   return n & 255;
 }
-function Br(n) {
+function Or(n) {
   return n & 4294967295;
 }
 const Wr = "deflate-raw";
-class ha extends TransformStream {
+class wa 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, 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 g, T, O = Ii(super.readable);
+    (!c || f) && _ && (g = new xi(), O = Ne(O, g)), a && (O = Di(O, l, { level: x, chunkSize: e }, s, r)), c && (f ? O = Ne(O, new xa(t)) : (T = new la(t), O = Ne(O, T))), Pi(w, O, () => {
       let m;
       c && !f && (m = T.signature), (!c || f) && _ && (m = new DataView(g.value.buffer).getUint32(0)), w.signature = m;
     });
   }
 }
-class xa extends TransformStream {
+class ga 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, 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, () => {
+    let w, g, T = Ii(super.readable);
+    c && (a ? T = Ne(T, new ha(t)) : (g = new ca(t), T = Ne(T, g))), _ && (T = Di(T, x, { chunkSize: e }, s, r)), (!c || a) && l && (w = new xi(), T = Ne(T, w)), Pi(this, T, () => {
       if ((!c || a) && l) {
-        const C = new DataView(w.value.buffer);
-        if (f != C.getUint32(0, !1))
-          throw new Error(vi);
+        const O = new DataView(w.value.buffer);
+        if (f != O.getUint32(0, !1))
+          throw new Error(bi);
       }
     });
   }
 }
-function Pi(n) {
+function Ii(n) {
   return Ne(n, new TransformStream({
     transform(t, e) {
       t && t.length && e.enqueue(t);
     }
   }));
 }
-function Di(n, t, e) {
+function Pi(n, t, e) {
   t = Ne(t, new TransformStream({ flush: e })), Object.defineProperty(n, "readable", {
     get() {
       return t;
     }
   });
 }
-function Li(n, t, e, r, s) {
+function Di(n, t, e, r, s) {
   try {
     const a = t && r ? r : s;
     n = Ne(n, new a(Wr, e));
@@ -6967,13 +6967,13 @@ function Li(n, t, e, r, s) {
 function Ne(n, t) {
   return n.pipeThrough(t);
 }
-const wa = "message", ga = "start", _a = "pull", Mr = "data", ya = "ack", Nr = "close", ba = "deflate", Ui = "inflate";
-class va extends TransformStream {
+const _a = "message", ya = "start", ba = "pull", Br = "data", va = "ack", Mr = "close", ka = "deflate", Li = "inflate";
+class Ea extends TransformStream {
   constructor(t, e) {
     super({});
     const r = this, { codecType: s } = t;
     let a;
-    s.startsWith(ba) ? a = ha : s.startsWith(Ui) && (a = xa);
+    s.startsWith(ka) ? a = wa : s.startsWith(Li) && (a = ga);
     let c = 0, l = 0;
     const f = new a(t, e), _ = super.readable, x = new TransformStream({
       transform(g, T) {
@@ -7004,7 +7004,7 @@ class va extends TransformStream {
     });
   }
 }
-class ka extends TransformStream {
+class Sa extends TransformStream {
   constructor(t) {
     let e;
     super({
@@ -7022,31 +7022,31 @@ class ka extends TransformStream {
     }
   }
 }
-let Oi = typeof Worker != Qe;
+let Ui = typeof Worker != Qe;
 class wn {
   constructor(t, { readable: e, writable: r }, { options: s, config: a, streamOptions: c, useWebWorkers: l, transferStreams: f, scripts: _ }, x) {
     const { signal: w } = c;
     return Object.assign(t, {
       busy: !0,
-      readable: e.pipeThrough(new ka(a.chunkSize)).pipeThrough(new Ea(e, c), { signal: w }),
+      readable: e.pipeThrough(new Sa(a.chunkSize)).pipeThrough(new Aa(e, c), { signal: w }),
       writable: r,
       options: Object.assign({}, s),
       scripts: _,
       transferStreams: f,
       terminate() {
         return new Promise((g) => {
-          const { worker: T, busy: C } = t;
-          T ? (C ? t.resolveTerminated = g : (T.terminate(), g()), t.interface = null) : g();
+          const { worker: T, busy: O } = t;
+          T ? (O ? t.resolveTerminated = g : (T.terminate(), g()), t.interface = null) : g();
         });
       },
       onTaskFinished() {
         const { resolveTerminated: g } = t;
         g && (t.resolveTerminated = null, t.terminated = !0, t.worker.terminate(), g()), t.busy = !1, x(t);
       }
-    }), (l && Oi ? Sa : Bi)(t, a);
+    }), (l && Ui ? Ta : Oi)(t, a);
   }
 }
-class Ea extends TransformStream {
+class Aa extends TransformStream {
   constructor(t, { onstart: e, onprogress: r, size: s, onend: a }) {
     let c = 0;
     super({
@@ -7068,32 +7068,32 @@ async function gn(n, ...t) {
   } catch {
   }
 }
-function Bi(n, t) {
+function Oi(n, t) {
   return {
-    run: () => Aa(n, t)
+    run: () => Ra(n, t)
   };
 }
-function Sa(n, t) {
+function Ta(n, t) {
   const { baseURL: e, chunkSize: r } = t;
   if (!n.interface) {
     let s;
     try {
-      s = Fa(n.scripts[0], e, n);
+      s = Ia(n.scripts[0], e, n);
     } catch {
-      return Oi = !1, Bi(n, t);
+      return Ui = !1, Oi(n, t);
     }
     Object.assign(n, {
       worker: s,
       interface: {
-        run: () => Ta(n, { chunkSize: r })
+        run: () => Fa(n, { chunkSize: r })
       }
     });
   }
   return n.interface;
 }
-async function Aa({ options: n, readable: t, writable: e, onTaskFinished: r }, s) {
+async function Ra({ options: n, readable: t, writable: e, onTaskFinished: r }, s) {
   try {
-    const a = new va(n, s);
+    const a = new Ea(n, s);
     await t.pipeThrough(a).pipeTo(e, { preventClose: !0, preventAbort: !0 });
     const {
       signature: c,
@@ -7109,7 +7109,7 @@ async function Aa({ options: n, readable: t, writable: e, onTaskFinished: r }, s
     r();
   }
 }
-async function Ta(n, t) {
+async function Fa(n, t) {
   let e, r;
   const s = new Promise((g, T) => {
     e = g, r = T;
@@ -7121,8 +7121,8 @@ async function Ta(n, t) {
     rejectResult: r,
     result: s
   });
-  const { readable: a, options: c, scripts: l } = n, { writable: f, closed: _ } = Ra(n.writable), x = $t({
-    type: ga,
+  const { readable: a, options: c, scripts: l } = n, { writable: f, closed: _ } = Ca(n.writable), x = $t({
+    type: ya,
     scripts: l.slice(1),
     options: c,
     config: t,
@@ -7136,7 +7136,7 @@ async function Ta(n, t) {
   const w = await s;
   return x || await f.getWriter().close(), await _, w;
 }
-function Ra(n) {
+function Ca(n) {
   let t;
   const e = new Promise((s) => t = s);
   return { writable: new WritableStream({
@@ -7152,8 +7152,8 @@ function Ra(n) {
     }
   }), closed: e };
 }
-let qr = !0, jr = !0;
-function Fa(n, t, e) {
+let Nr = !0, qr = !0;
+function Ia(n, t, e) {
   const r = { type: "module" };
   let s, a;
   typeof n == Ft && (n = n());
@@ -7162,24 +7162,24 @@ function Fa(n, t, e) {
   } catch {
     s = n;
   }
-  if (qr)
+  if (Nr)
     try {
       a = new Worker(s);
     } catch {
-      qr = !1, a = new Worker(s, r);
+      Nr = !1, a = new Worker(s, r);
     }
   else
     a = new Worker(s, r);
-  return a.addEventListener(wa, (c) => Ca(c, e)), a;
+  return a.addEventListener(_a, (c) => Pa(c, e)), a;
 }
 function $t(n, { worker: t, writer: e, onTaskFinished: r, transferStreams: s }) {
   try {
     const { value: a, readable: c, writable: l } = n, f = [];
-    if (a && (a.byteLength < a.buffer.byteLength ? n.value = a.buffer.slice(0, a.byteLength) : n.value = a.buffer, f.push(n.value)), s && jr ? (c && f.push(c), l && f.push(l)) : n.readable = n.writable = null, f.length)
+    if (a && (a.byteLength < a.buffer.byteLength ? n.value = a.buffer.slice(0, a.byteLength) : n.value = a.buffer, f.push(n.value)), s && qr ? (c && f.push(c), l && f.push(l)) : n.readable = n.writable = null, f.length)
       try {
         return t.postMessage(n, f), !0;
       } catch {
-        jr = !1, n.readable = n.writable = null, t.postMessage(n);
+        qr = !1, n.readable = n.writable = null, t.postMessage(n);
       }
     else
       t.postMessage(n);
@@ -7187,52 +7187,52 @@ function $t(n, { worker: t, writer: e, onTaskFinished: r, transferStreams: s })
     throw e && e.releaseLock(), r(), a;
   }
 }
-async function Ca({ data: n }, t) {
+async function Pa({ 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: T, stack: C, code: m, name: d } = c, h = new Error(T);
-      Object.assign(h, { stack: C, code: m, name: d }), g(h);
+      const { message: T, stack: O, code: m, name: d } = c, h = new Error(T);
+      Object.assign(h, { stack: O, code: m, name: d }), g(h);
     } else {
-      if (e == _a) {
-        const { value: T, done: C } = await l.read();
-        $t({ type: Mr, value: T, done: C, messageId: s }, t);
+      if (e == ba) {
+        const { value: T, done: O } = await l.read();
+        $t({ type: Br, value: T, done: O, 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);
+      e == Br && (await f.ready, await f.write(new Uint8Array(r)), $t({ type: va, messageId: s }, t)), e == Mr && g(null, a);
     }
   } catch (T) {
-    $t({ type: Nr, messageId: s }, t), g(T);
+    $t({ type: Mr, messageId: s }, t), g(T);
   }
-  function g(T, C) {
-    T ? x(T) : _(C), f && f.releaseLock(), w();
+  function g(T, O) {
+    T ? x(T) : _(O), f && f.releaseLock(), w();
   }
 }
 let it = [];
 const _n = [];
-let Hr = 0;
-async function Ia(n, t) {
+let jr = 0;
+async function Da(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 === 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() {
+  return t.useWebWorkers = !T && (a || a === Ee && r.useWebWorkers), t.scripts = t.useWebWorkers && w ? w[l] : [], e.useCompressionStream = c || c === Ee && r.useCompressionStream, (await O()).run();
+  async function O() {
     const d = it.find((h) => !h.busy);
     if (d)
-      return $r(d), new wn(d, n, t, m);
+      return Hr(d), new wn(d, n, t, m);
     if (it.length < g) {
-      const h = { indexWorker: Hr };
-      return Hr++, it.push(h), new wn(h, n, t, m);
+      const h = { indexWorker: jr };
+      return jr++, it.push(h), new wn(h, n, t, m);
     } else
       return new Promise((h) => _n.push({ resolve: h, stream: n, workerOptions: t }));
   }
   function m(d) {
     if (_n.length) {
-      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);
+      const [{ resolve: h, stream: b, workerOptions: R }] = _n.splice(0, 1);
+      h(new wn(d, b, R, m));
+    } else d.worker ? (Hr(d), La(d, t)) : it = it.filter((h) => h != d);
   }
 }
-function Pa(n, t) {
+function La(n, t) {
   const { config: e } = t, { terminateWorkerTimeout: r } = e;
   Number.isFinite(r) && r >= 0 && (n.terminated ? n.terminated = !1 : n.terminateTimeout = setTimeout(async () => {
     it = it.filter((s) => s != n);
@@ -7242,16 +7242,16 @@ function Pa(n, t) {
     }
   }, r));
 }
-function $r(n) {
+function Hr(n) {
   const { terminateTimeout: t } = n;
   t && (clearTimeout(t), n.terminateTimeout = null);
 }
-function Da(n, t = {}) {
+function Ua(n, t = {}) {
   const e = `const{Array:e,Object:t,Number:n,Math:r,Error:s,Uint8Array:i,Uint16Array:o,Uint32Array:c,Int32Array:f,Map:a,DataView:l,Promise:u,TextEncoder:w,crypto:h,postMessage:d,TransformStream:p,ReadableStream:y,WritableStream:m,CompressionStream:b,DecompressionStream:g}=self,k=void 0,v="undefined",S="function";class z{constructor(e){return class extends p{constructor(t,n){const r=new e(n);super({transform(e,t){t.enqueue(r.append(e))},flush(e){const t=r.flush();t&&e.enqueue(t)}})}}}}const C=[];for(let e=0;256>e;e++){let t=e;for(let e=0;8>e;e++)1&t?t=t>>>1^3988292384:t>>>=1;C[e]=t}class x{constructor(e){this.t=e||-1}append(e){let t=0|this.t;for(let n=0,r=0|e.length;r>n;n++)t=t>>>8^C[255&(t^e[n])];this.t=t}get(){return~this.t}}class A extends p{constructor(){let e;const t=new x;super({transform(e,n){t.append(e),n.enqueue(e)},flush(){const n=new i(4);new l(n.buffer).setUint32(0,t.get()),e.value=n}}),e=this}}const _={concat(e,t){if(0===e.length||0===t.length)return e.concat(t);const n=e[e.length-1],r=_.i(n);return 32===r?e.concat(t):_.o(t,r,0|n,e.slice(0,e.length-1))},l(e){const t=e.length;if(0===t)return 0;const n=e[t-1];return 32*(t-1)+_.i(n)},u(e,t){if(32*e.length<t)return e;const n=(e=e.slice(0,r.ceil(t/32))).length;return t&=31,n>0&&t&&(e[n-1]=_.h(t,e[n-1]&2147483648>>t-1,1)),e},h:(e,t,n)=>32===e?t:(n?0|t:t<<32-e)+1099511627776*e,i:e=>r.round(e/1099511627776)||32,o(e,t,n,r){for(void 0===r&&(r=[]);t>=32;t-=32)r.push(n),n=0;if(0===t)return r.concat(e);for(let s=0;s<e.length;s++)r.push(n|e[s]>>>t),n=e[s]<<32-t;const s=e.length?e[e.length-1]:0,i=_.i(s);return r.push(_.h(t+i&31,t+i>32?n:r.pop(),1)),r}},I={bytes:{p(e){const t=_.l(e)/8,n=new i(t);let r;for(let s=0;t>s;s++)3&s||(r=e[s/4]),n[s]=r>>>24,r<<=8;return n},m(e){const t=[];let n,r=0;for(n=0;n<e.length;n++)r=r<<8|e[n],3&~n||(t.push(r),r=0);return 3&n&&t.push(_.h(8*(3&n),r)),t}}},P=class{constructor(e){const t=this;t.blockSize=512,t.k=[1732584193,4023233417,2562383102,271733878,3285377520],t.v=[1518500249,1859775393,2400959708,3395469782],e?(t.S=e.S.slice(0),t.C=e.C.slice(0),t.A=e.A):t.reset()}reset(){const e=this;return e.S=e.k.slice(0),e.C=[],e.A=0,e}update(e){const t=this;"string"==typeof e&&(e=I._.m(e));const n=t.C=_.concat(t.C,e),r=t.A,i=t.A=r+_.l(e);if(i>9007199254740991)throw new s("Cannot hash more than 2^53 - 1 bits");const o=new c(n);let f=0;for(let e=t.blockSize+r-(t.blockSize+r&t.blockSize-1);i>=e;e+=t.blockSize)t.I(o.subarray(16*f,16*(f+1))),f+=1;return n.splice(0,16*f),t}P(){const e=this;let t=e.C;const n=e.S;t=_.concat(t,[_.h(1,1)]);for(let e=t.length+2;15&e;e++)t.push(0);for(t.push(r.floor(e.A/4294967296)),t.push(0|e.A);t.length;)e.I(t.splice(0,16));return e.reset(),n}D(e,t,n,r){return e>19?e>39?e>59?e>79?void 0:t^n^r:t&n|t&r|n&r:t^n^r:t&n|~t&r}V(e,t){return t<<e|t>>>32-e}I(t){const n=this,s=n.S,i=e(80);for(let e=0;16>e;e++)i[e]=t[e];let o=s[0],c=s[1],f=s[2],a=s[3],l=s[4];for(let e=0;79>=e;e++){16>e||(i[e]=n.V(1,i[e-3]^i[e-8]^i[e-14]^i[e-16]));const t=n.V(5,o)+n.D(e,c,f,a)+l+i[e]+n.v[r.floor(e/20)]|0;l=a,a=f,f=n.V(30,c),c=o,o=t}s[0]=s[0]+o|0,s[1]=s[1]+c|0,s[2]=s[2]+f|0,s[3]=s[3]+a|0,s[4]=s[4]+l|0}},D={getRandomValues(e){const t=new c(e.buffer),n=e=>{let t=987654321;const n=4294967295;return()=>(t=36969*(65535&t)+(t>>16)&n,(((t<<16)+(e=18e3*(65535&e)+(e>>16)&n)&n)/4294967296+.5)*(r.random()>.5?1:-1))};for(let s,i=0;i<e.length;i+=4){const e=n(4294967296*(s||r.random()));s=987654071*e(),t[i/4]=4294967296*e()|0}return e}},V={importKey:e=>new V.R(I.bytes.m(e)),B(e,t,n,r){if(n=n||1e4,0>r||0>n)throw new s("invalid params to pbkdf2");const i=1+(r>>5)<<2;let o,c,f,a,u;const w=new ArrayBuffer(i),h=new l(w);let d=0;const p=_;for(t=I.bytes.m(t),u=1;(i||1)>d;u++){for(o=c=e.encrypt(p.concat(t,[u])),f=1;n>f;f++)for(c=e.encrypt(c),a=0;a<c.length;a++)o[a]^=c[a];for(f=0;(i||1)>d&&f<o.length;f++)h.setInt32(d,o[f]),d+=4}return w.slice(0,r/8)},R:class{constructor(e){const t=this,n=t.M=P,r=[[],[]];t.U=[new n,new n];const s=t.U[0].blockSize/32;e.length>s&&(e=(new n).update(e).P());for(let t=0;s>t;t++)r[0][t]=909522486^e[t],r[1][t]=1549556828^e[t];t.U[0].update(r[0]),t.U[1].update(r[1]),t.K=new n(t.U[0])}reset(){const e=this;e.K=new e.M(e.U[0]),e.N=!1}update(e){this.N=!0,this.K.update(e)}digest(){const e=this,t=e.K.P(),n=new e.M(e.U[1]).update(t).P();return e.reset(),n}encrypt(e){if(this.N)throw new s("encrypt on already updated hmac called!");return this.update(e),this.digest(e)}}},R=typeof h!=v&&typeof h.getRandomValues==S,B="Invalid password",E="Invalid signature",M="zipjs-abort-check-password";function U(e){return R?h.getRandomValues(e):D.getRandomValues(e)}const K=16,N={name:"PBKDF2"},O=t.assign({hash:{name:"HMAC"}},N),T=t.assign({iterations:1e3,hash:{name:"SHA-1"}},N),W=["deriveBits"],j=[8,12,16],H=[16,24,32],L=10,F=[0,0,0,0],q=typeof h!=v,G=q&&h.subtle,J=q&&typeof G!=v,Q=I.bytes,X=class{constructor(e){const t=this;t.O=[[[],[],[],[],[]],[[],[],[],[],[]]],t.O[0][0][0]||t.T();const n=t.O[0][4],r=t.O[1],i=e.length;let o,c,f,a=1;if(4!==i&&6!==i&&8!==i)throw new s("invalid aes key size");for(t.v=[c=e.slice(0),f=[]],o=i;4*i+28>o;o++){let e=c[o-1];(o%i==0||8===i&&o%i==4)&&(e=n[e>>>24]<<24^n[e>>16&255]<<16^n[e>>8&255]<<8^n[255&e],o%i==0&&(e=e<<8^e>>>24^a<<24,a=a<<1^283*(a>>7))),c[o]=c[o-i]^e}for(let e=0;o;e++,o--){const t=c[3&e?o:o-4];f[e]=4>=o||4>e?t:r[0][n[t>>>24]]^r[1][n[t>>16&255]]^r[2][n[t>>8&255]]^r[3][n[255&t]]}}encrypt(e){return this.W(e,0)}decrypt(e){return this.W(e,1)}T(){const e=this.O[0],t=this.O[1],n=e[4],r=t[4],s=[],i=[];let o,c,f,a;for(let e=0;256>e;e++)i[(s[e]=e<<1^283*(e>>7))^e]=e;for(let l=o=0;!n[l];l^=c||1,o=i[o]||1){let i=o^o<<1^o<<2^o<<3^o<<4;i=i>>8^255&i^99,n[l]=i,r[i]=l,a=s[f=s[c=s[l]]];let u=16843009*a^65537*f^257*c^16843008*l,w=257*s[i]^16843008*i;for(let n=0;4>n;n++)e[n][l]=w=w<<24^w>>>8,t[n][i]=u=u<<24^u>>>8}for(let n=0;5>n;n++)e[n]=e[n].slice(0),t[n]=t[n].slice(0)}W(e,t){if(4!==e.length)throw new s("invalid aes block size");const n=this.v[t],r=n.length/4-2,i=[0,0,0,0],o=this.O[t],c=o[0],f=o[1],a=o[2],l=o[3],u=o[4];let w,h,d,p=e[0]^n[0],y=e[t?3:1]^n[1],m=e[2]^n[2],b=e[t?1:3]^n[3],g=4;for(let e=0;r>e;e++)w=c[p>>>24]^f[y>>16&255]^a[m>>8&255]^l[255&b]^n[g],h=c[y>>>24]^f[m>>16&255]^a[b>>8&255]^l[255&p]^n[g+1],d=c[m>>>24]^f[b>>16&255]^a[p>>8&255]^l[255&y]^n[g+2],b=c[b>>>24]^f[p>>16&255]^a[y>>8&255]^l[255&m]^n[g+3],g+=4,p=w,y=h,m=d;for(let e=0;4>e;e++)i[t?3&-e:e]=u[p>>>24]<<24^u[y>>16&255]<<16^u[m>>8&255]<<8^u[255&b]^n[g++],w=p,p=y,y=m,m=b,b=w;return i}},Y=class{constructor(e,t){this.j=e,this.H=t,this.L=t}reset(){this.L=this.H}update(e){return this.F(this.j,e,this.L)}q(e){if(255&~(e>>24))e+=1<<24;else{let t=e>>16&255,n=e>>8&255,r=255&e;255===t?(t=0,255===n?(n=0,255===r?r=0:++r):++n):++t,e=0,e+=t<<16,e+=n<<8,e+=r}return e}G(e){0===(e[0]=this.q(e[0]))&&(e[1]=this.q(e[1]))}F(e,t,n){let r;if(!(r=t.length))return[];const s=_.l(t);for(let s=0;r>s;s+=4){this.G(n);const r=e.encrypt(n);t[s]^=r[0],t[s+1]^=r[1],t[s+2]^=r[2],t[s+3]^=r[3]}return _.u(t,s)}},Z=V.R;let $=q&&J&&typeof G.importKey==S,ee=q&&J&&typeof G.deriveBits==S;class te extends p{constructor({password:e,rawPassword:n,signed:r,encryptionStrength:o,checkPasswordOnly:c}){super({start(){t.assign(this,{ready:new u((e=>this.J=e)),password:ie(e,n),signed:r,X:o-1,pending:new i})},async transform(e,t){const n=this,{password:r,X:o,J:f,ready:a}=n;r?(await(async(e,t,n,r)=>{const i=await se(e,t,n,ce(r,0,j[t])),o=ce(r,j[t]);if(i[0]!=o[0]||i[1]!=o[1])throw new s(B)})(n,o,r,ce(e,0,j[o]+2)),e=ce(e,j[o]+2),c?t.error(new s(M)):f()):await a;const l=new i(e.length-L-(e.length-L)%K);t.enqueue(re(n,e,l,0,L,!0))},async flush(e){const{signed:t,Y:n,Z:r,pending:o,ready:c}=this;if(r&&n){await c;const f=ce(o,0,o.length-L),a=ce(o,o.length-L);let l=new i;if(f.length){const e=ae(Q,f);r.update(e);const t=n.update(e);l=fe(Q,t)}if(t){const e=ce(fe(Q,r.digest()),0,L);for(let t=0;L>t;t++)if(e[t]!=a[t])throw new s(E)}e.enqueue(l)}}})}}class ne extends p{constructor({password:e,rawPassword:n,encryptionStrength:r}){let s;super({start(){t.assign(this,{ready:new u((e=>this.J=e)),password:ie(e,n),X:r-1,pending:new i})},async transform(e,t){const n=this,{password:r,X:s,J:o,ready:c}=n;let f=new i;r?(f=await(async(e,t,n)=>{const r=U(new i(j[t]));return oe(r,await se(e,t,n,r))})(n,s,r),o()):await c;const a=new i(f.length+e.length-e.length%K);a.set(f,0),t.enqueue(re(n,e,a,f.length,0))},async flush(e){const{Y:t,Z:n,pending:r,ready:o}=this;if(n&&t){await o;let c=new i;if(r.length){const e=t.update(ae(Q,r));n.update(e),c=fe(Q,e)}s.signature=fe(Q,n.digest()).slice(0,L),e.enqueue(oe(c,s.signature))}}}),s=this}}function re(e,t,n,r,s,o){const{Y:c,Z:f,pending:a}=e,l=t.length-s;let u;for(a.length&&(t=oe(a,t),n=((e,t)=>{if(t&&t>e.length){const n=e;(e=new i(t)).set(n,0)}return e})(n,l-l%K)),u=0;l-K>=u;u+=K){const e=ae(Q,ce(t,u,u+K));o&&f.update(e);const s=c.update(e);o||f.update(s),n.set(fe(Q,s),u+r)}return e.pending=ce(t,u),n}async function se(n,r,s,o){n.password=null;const c=await(async(e,t,n,r,s)=>{if(!$)return V.importKey(t);try{return await G.importKey("raw",t,n,!1,s)}catch(e){return $=!1,V.importKey(t)}})(0,s,O,0,W),f=await(async(e,t,n)=>{if(!ee)return V.B(t,e.salt,T.iterations,n);try{return await G.deriveBits(e,t,n)}catch(r){return ee=!1,V.B(t,e.salt,T.iterations,n)}})(t.assign({salt:o},T),c,8*(2*H[r]+2)),a=new i(f),l=ae(Q,ce(a,0,H[r])),u=ae(Q,ce(a,H[r],2*H[r])),w=ce(a,2*H[r]);return t.assign(n,{keys:{key:l,$:u,passwordVerification:w},Y:new Y(new X(l),e.from(F)),Z:new Z(u)}),w}function ie(e,t){return t===k?(e=>{if(typeof w==v){const t=new i((e=unescape(encodeURIComponent(e))).length);for(let n=0;n<t.length;n++)t[n]=e.charCodeAt(n);return t}return(new w).encode(e)})(e):t}function oe(e,t){let n=e;return e.length+t.length&&(n=new i(e.length+t.length),n.set(e,0),n.set(t,e.length)),n}function ce(e,t,n){return e.subarray(t,n)}function fe(e,t){return e.p(t)}function ae(e,t){return e.m(t)}class le extends p{constructor({password:e,passwordVerification:n,checkPasswordOnly:r}){super({start(){t.assign(this,{password:e,passwordVerification:n}),de(this,e)},transform(e,t){const n=this;if(n.password){const t=we(n,e.subarray(0,12));if(n.password=null,t[11]!=n.passwordVerification)throw new s(B);e=e.subarray(12)}r?t.error(new s(M)):t.enqueue(we(n,e))}})}}class ue extends p{constructor({password:e,passwordVerification:n}){super({start(){t.assign(this,{password:e,passwordVerification:n}),de(this,e)},transform(e,t){const n=this;let r,s;if(n.password){n.password=null;const t=U(new i(12));t[11]=n.passwordVerification,r=new i(e.length+t.length),r.set(he(n,t),0),s=12}else r=new i(e.length),s=0;r.set(he(n,e),s),t.enqueue(r)}})}}function we(e,t){const n=new i(t.length);for(let r=0;r<t.length;r++)n[r]=ye(e)^t[r],pe(e,n[r]);return n}function he(e,t){const n=new i(t.length);for(let r=0;r<t.length;r++)n[r]=ye(e)^t[r],pe(e,t[r]);return n}function de(e,n){const r=[305419896,591751049,878082192];t.assign(e,{keys:r,ee:new x(r[0]),te:new x(r[2])});for(let t=0;t<n.length;t++)pe(e,n.charCodeAt(t))}function pe(e,t){let[n,s,i]=e.keys;e.ee.append([t]),n=~e.ee.get(),s=be(r.imul(be(s+me(n)),134775813)+1),e.te.append([s>>>24]),i=~e.te.get(),e.keys=[n,s,i]}function ye(e){const t=2|e.keys[2];return me(r.imul(t,1^t)>>>8)}function me(e){return 255&e}function be(e){return 4294967295&e}const ge="deflate-raw";class ke extends p{constructor(e,{chunkSize:t,CompressionStream:n,CompressionStreamNative:r}){super({});const{compressed:s,encrypted:i,useCompressionStream:o,zipCrypto:c,signed:f,level:a}=e,u=this;let w,h,d=Se(super.readable);i&&!c||!f||(w=new A,d=xe(d,w)),s&&(d=Ce(d,o,{level:a,chunkSize:t},r,n)),i&&(c?d=xe(d,new ue(e)):(h=new ne(e),d=xe(d,h))),ze(u,d,(()=>{let e;i&&!c&&(e=h.signature),i&&!c||!f||(e=new l(w.value.buffer).getUint32(0)),u.signature=e}))}}class ve extends p{constructor(e,{chunkSize:t,DecompressionStream:n,DecompressionStreamNative:r}){super({});const{zipCrypto:i,encrypted:o,signed:c,signature:f,compressed:a,useCompressionStream:u}=e;let w,h,d=Se(super.readable);o&&(i?d=xe(d,new le(e)):(h=new te(e),d=xe(d,h))),a&&(d=Ce(d,u,{chunkSize:t},r,n)),o&&!i||!c||(w=new A,d=xe(d,w)),ze(this,d,(()=>{if((!o||i)&&c){const e=new l(w.value.buffer);if(f!=e.getUint32(0,!1))throw new s(E)}}))}}function Se(e){return xe(e,new p({transform(e,t){e&&e.length&&t.enqueue(e)}}))}function ze(e,n,r){n=xe(n,new p({flush:r})),t.defineProperty(e,"readable",{get:()=>n})}function Ce(e,t,n,r,s){try{e=xe(e,new(t&&r?r:s)(ge,n))}catch(r){if(!t)return e;try{e=xe(e,new s(ge,n))}catch(t){return e}}return e}function xe(e,t){return e.pipeThrough(t)}const Ae="data",_e="close";class Ie extends p{constructor(e,n){super({});const r=this,{codecType:s}=e;let i;s.startsWith("deflate")?i=ke:s.startsWith("inflate")&&(i=ve);let o=0,c=0;const f=new i(e,n),a=super.readable,l=new p({transform(e,t){e&&e.length&&(c+=e.length,t.enqueue(e))},flush(){t.assign(r,{inputSize:c})}}),u=new p({transform(e,t){e&&e.length&&(o+=e.length,t.enqueue(e))},flush(){const{signature:e}=f;t.assign(r,{signature:e,outputSize:o,inputSize:c})}});t.defineProperty(r,"readable",{get:()=>a.pipeThrough(l).pipeThrough(f).pipeThrough(u)})}}class Pe extends p{constructor(e){let t;super({transform:function n(r,s){if(t){const e=new i(t.length+r.length);e.set(t),e.set(r,t.length),r=e,t=null}r.length>e?(s.enqueue(r.slice(0,e)),n(r.slice(e),s)):t=r},flush(e){t&&t.length&&e.enqueue(t)}})}}const De=new a,Ve=new a;let Re,Be=0,Ee=!0;async function Me(e){try{const{options:t,scripts:r,config:s}=e;if(r&&r.length)try{Ee?importScripts.apply(k,r):await Ue(r)}catch(e){Ee=!1,await Ue(r)}self.initCodec&&self.initCodec(),s.CompressionStreamNative=self.CompressionStream,s.DecompressionStreamNative=self.DecompressionStream,self.Deflate&&(s.CompressionStream=new z(self.Deflate)),self.Inflate&&(s.DecompressionStream=new z(self.Inflate));const i={highWaterMark:1},o=e.readable||new y({async pull(e){const t=new u((e=>De.set(Be,e)));Ke({type:"pull",messageId:Be}),Be=(Be+1)%n.MAX_SAFE_INTEGER;const{value:r,done:s}=await t;e.enqueue(r),s&&e.close()}},i),c=e.writable||new m({async write(e){let t;const r=new u((e=>t=e));Ve.set(Be,t),Ke({type:Ae,value:e,messageId:Be}),Be=(Be+1)%n.MAX_SAFE_INTEGER,await r}},i),f=new Ie(t,s);Re=new AbortController;const{signal:a}=Re;await o.pipeThrough(f).pipeThrough(new Pe(s.chunkSize)).pipeTo(c,{signal:a,preventClose:!0,preventAbort:!0}),await c.getWriter().close();const{signature:l,inputSize:w,outputSize:h}=f;Ke({type:_e,result:{signature:l,inputSize:w,outputSize:h}})}catch(e){Ne(e)}}async function Ue(e){for(const t of e)await import(t)}function Ke(e){let{value:t}=e;if(t)if(t.length)try{t=new i(t),e.value=t.buffer,d(e,[e.value])}catch(t){d(e)}else d(e);else d(e)}function Ne(e=new s("Unknown error")){const{message:t,stack:n,code:r,name:i}=e;d({error:{message:t,stack:n,code:r,name:i}})}addEventListener("message",(({data:e})=>{const{type:t,messageId:n,value:r,done:s}=e;try{if("start"==t&&Me(e),t==Ae){const e=De.get(n);De.delete(n),e({value:new i(r),done:s})}if("ack"==t){const e=Ve.get(n);Ve.delete(n),e()}t==_e&&Re.abort()}catch(e){Ne(e)}}));const Oe=-2;function Te(t){return We(t.map((([t,n])=>new e(t).fill(n,0,t))))}function We(t){return t.reduce(((t,n)=>t.concat(e.isArray(n)?We(n):n)),[])}const je=[0,1,2,3].concat(...Te([[2,4],[2,5],[4,6],[4,7],[8,8],[8,9],[16,10],[16,11],[32,12],[32,13],[64,14],[64,15],[2,0],[1,16],[1,17],[2,18],[2,19],[4,20],[4,21],[8,22],[8,23],[16,24],[16,25],[32,26],[32,27],[64,28],[64,29]]));function He(){const e=this;function t(e,t){let n=0;do{n|=1&e,e>>>=1,n<<=1}while(--t>0);return n>>>1}e.ne=n=>{const s=e.re,i=e.ie.se,o=e.ie.oe;let c,f,a,l=-1;for(n.ce=0,n.fe=573,c=0;o>c;c++)0!==s[2*c]?(n.ae[++n.ce]=l=c,n.le[c]=0):s[2*c+1]=0;for(;2>n.ce;)a=n.ae[++n.ce]=2>l?++l:0,s[2*a]=1,n.le[a]=0,n.ue--,i&&(n.we-=i[2*a+1]);for(e.he=l,c=r.floor(n.ce/2);c>=1;c--)n.de(s,c);a=o;do{c=n.ae[1],n.ae[1]=n.ae[n.ce--],n.de(s,1),f=n.ae[1],n.ae[--n.fe]=c,n.ae[--n.fe]=f,s[2*a]=s[2*c]+s[2*f],n.le[a]=r.max(n.le[c],n.le[f])+1,s[2*c+1]=s[2*f+1]=a,n.ae[1]=a++,n.de(s,1)}while(n.ce>=2);n.ae[--n.fe]=n.ae[1],(t=>{const n=e.re,r=e.ie.se,s=e.ie.pe,i=e.ie.ye,o=e.ie.me;let c,f,a,l,u,w,h=0;for(l=0;15>=l;l++)t.be[l]=0;for(n[2*t.ae[t.fe]+1]=0,c=t.fe+1;573>c;c++)f=t.ae[c],l=n[2*n[2*f+1]+1]+1,l>o&&(l=o,h++),n[2*f+1]=l,f>e.he||(t.be[l]++,u=0,i>f||(u=s[f-i]),w=n[2*f],t.ue+=w*(l+u),r&&(t.we+=w*(r[2*f+1]+u)));if(0!==h){do{for(l=o-1;0===t.be[l];)l--;t.be[l]--,t.be[l+1]+=2,t.be[o]--,h-=2}while(h>0);for(l=o;0!==l;l--)for(f=t.be[l];0!==f;)a=t.ae[--c],a>e.he||(n[2*a+1]!=l&&(t.ue+=(l-n[2*a+1])*n[2*a],n[2*a+1]=l),f--)}})(n),((e,n,r)=>{const s=[];let i,o,c,f=0;for(i=1;15>=i;i++)s[i]=f=f+r[i-1]<<1;for(o=0;n>=o;o++)c=e[2*o+1],0!==c&&(e[2*o]=t(s[c]++,c))})(s,e.he,n.be)}}function Le(e,t,n,r,s){const i=this;i.se=e,i.pe=t,i.ye=n,i.oe=r,i.me=s}He.ge=[0,1,2,3,4,5,6,7].concat(...Te([[2,8],[2,9],[2,10],[2,11],[4,12],[4,13],[4,14],[4,15],[8,16],[8,17],[8,18],[8,19],[16,20],[16,21],[16,22],[16,23],[32,24],[32,25],[32,26],[31,27],[1,28]])),He.ke=[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],He.ve=[0,1,2,3,4,6,8,12,16,24,32,48,64,96,128,192,256,384,512,768,1024,1536,2048,3072,4096,6144,8192,12288,16384,24576],He.Se=e=>256>e?je[e]:je[256+(e>>>7)],He.ze=[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],He.Ce=[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],He.xe=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7],He.Ae=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];const Fe=Te([[144,8],[112,9],[24,7],[8,8]]);Le._e=We([12,140,76,204,44,172,108,236,28,156,92,220,60,188,124,252,2,130,66,194,34,162,98,226,18,146,82,210,50,178,114,242,10,138,74,202,42,170,106,234,26,154,90,218,58,186,122,250,6,134,70,198,38,166,102,230,22,150,86,214,54,182,118,246,14,142,78,206,46,174,110,238,30,158,94,222,62,190,126,254,1,129,65,193,33,161,97,225,17,145,81,209,49,177,113,241,9,137,73,201,41,169,105,233,25,153,89,217,57,185,121,249,5,133,69,197,37,165,101,229,21,149,85,213,53,181,117,245,13,141,77,205,45,173,109,237,29,157,93,221,61,189,125,253,19,275,147,403,83,339,211,467,51,307,179,435,115,371,243,499,11,267,139,395,75,331,203,459,43,299,171,427,107,363,235,491,27,283,155,411,91,347,219,475,59,315,187,443,123,379,251,507,7,263,135,391,71,327,199,455,39,295,167,423,103,359,231,487,23,279,151,407,87,343,215,471,55,311,183,439,119,375,247,503,15,271,143,399,79,335,207,463,47,303,175,431,111,367,239,495,31,287,159,415,95,351,223,479,63,319,191,447,127,383,255,511,0,64,32,96,16,80,48,112,8,72,40,104,24,88,56,120,4,68,36,100,20,84,52,116,3,131,67,195,35,163,99,227].map(((e,t)=>[e,Fe[t]])));const qe=Te([[30,5]]);function Ge(e,t,n,r,s){const i=this;i.Ie=e,i.Pe=t,i.De=n,i.Ve=r,i.Re=s}Le.Be=We([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].map(((e,t)=>[e,qe[t]]))),Le.Ee=new Le(Le._e,He.ze,257,286,15),Le.Me=new Le(Le.Be,He.Ce,0,30,15),Le.Ue=new Le(null,He.xe,0,19,7);const Je=[new Ge(0,0,0,0,0),new Ge(4,4,8,4,1),new Ge(4,5,16,8,1),new Ge(4,6,32,32,1),new Ge(4,4,16,16,2),new Ge(8,16,32,32,2),new Ge(8,16,128,128,2),new Ge(8,32,128,256,2),new Ge(32,128,258,1024,2),new Ge(32,258,258,4096,2)],Qe=["need dictionary","stream end","","","stream error","data error","","buffer error","",""],Xe=113,Ye=666,Ze=262;function $e(e,t,n,r){const s=e[2*t],i=e[2*n];return i>s||s==i&&r[t]<=r[n]}function et(){const e=this;let t,n,s,c,f,a,l,u,w,h,d,p,y,m,b,g,k,v,S,z,C,x,A,_,I,P,D,V,R,B,E,M,U;const K=new He,N=new He,O=new He;let T,W,j,H,L,F;function q(){let t;for(t=0;286>t;t++)E[2*t]=0;for(t=0;30>t;t++)M[2*t]=0;for(t=0;19>t;t++)U[2*t]=0;E[512]=1,e.ue=e.we=0,W=j=0}function G(e,t){let n,r=-1,s=e[1],i=0,o=7,c=4;0===s&&(o=138,c=3),e[2*(t+1)+1]=65535;for(let f=0;t>=f;f++)n=s,s=e[2*(f+1)+1],++i<o&&n==s||(c>i?U[2*n]+=i:0!==n?(n!=r&&U[2*n]++,U[32]++):i>10?U[36]++:U[34]++,i=0,r=n,0===s?(o=138,c=3):n==s?(o=6,c=3):(o=7,c=4))}function J(t){e.Ke[e.pending++]=t}function Q(e){J(255&e),J(e>>>8&255)}function X(e,t){let n;const r=t;F>16-r?(n=e,L|=n<<F&65535,Q(L),L=n>>>16-F,F+=r-16):(L|=e<<F&65535,F+=r)}function Y(e,t){const n=2*e;X(65535&t[n],65535&t[n+1])}function Z(e,t){let n,r,s=-1,i=e[1],o=0,c=7,f=4;for(0===i&&(c=138,f=3),n=0;t>=n;n++)if(r=i,i=e[2*(n+1)+1],++o>=c||r!=i){if(f>o)do{Y(r,U)}while(0!=--o);else 0!==r?(r!=s&&(Y(r,U),o--),Y(16,U),X(o-3,2)):o>10?(Y(18,U),X(o-11,7)):(Y(17,U),X(o-3,3));o=0,s=r,0===i?(c=138,f=3):r==i?(c=6,f=3):(c=7,f=4)}}function $(){16==F?(Q(L),L=0,F=0):8>F||(J(255&L),L>>>=8,F-=8)}function ee(t,n){let s,i,o;if(e.Ne[W]=t,e.Oe[W]=255&n,W++,0===t?E[2*n]++:(j++,t--,E[2*(He.ge[n]+256+1)]++,M[2*He.Se(t)]++),!(8191&W)&&D>2){for(s=8*W,i=C-k,o=0;30>o;o++)s+=M[2*o]*(5+He.Ce[o]);if(s>>>=3,j<r.floor(W/2)&&s<r.floor(i/2))return!0}return W==T-1}function te(t,n){let r,s,i,o,c=0;if(0!==W)do{r=e.Ne[c],s=e.Oe[c],c++,0===r?Y(s,t):(i=He.ge[s],Y(i+256+1,t),o=He.ze[i],0!==o&&(s-=He.ke[i],X(s,o)),r--,i=He.Se(r),Y(i,n),o=He.Ce[i],0!==o&&(r-=He.ve[i],X(r,o)))}while(W>c);Y(256,t),H=t[513]}function ne(){F>8?Q(L):F>0&&J(255&L),L=0,F=0}function re(t,n,r){X(0+(r?1:0),3),((t,n)=>{ne(),H=8,Q(n),Q(~n),e.Ke.set(u.subarray(t,t+n),e.pending),e.pending+=n})(t,n)}function se(n){((t,n,r)=>{let s,i,o=0;D>0?(K.ne(e),N.ne(e),o=(()=>{let t;for(G(E,K.he),G(M,N.he),O.ne(e),t=18;t>=3&&0===U[2*He.Ae[t]+1];t--);return e.ue+=14+3*(t+1),t})(),s=e.ue+3+7>>>3,i=e.we+3+7>>>3,i>s||(s=i)):s=i=n+5,n+4>s||-1==t?i==s?(X(2+(r?1:0),3),te(Le._e,Le.Be)):(X(4+(r?1:0),3),((e,t,n)=>{let r;for(X(e-257,5),X(t-1,5),X(n-4,4),r=0;n>r;r++)X(U[2*He.Ae[r]+1],3);Z(E,e-1),Z(M,t-1)})(K.he+1,N.he+1,o+1),te(E,M)):re(t,n,r),q(),r&&ne()})(0>k?-1:k,C-k,n),k=C,t.Te()}function ie(){let e,n,r,s;do{if(s=w-A-C,0===s&&0===C&&0===A)s=f;else if(-1==s)s--;else if(C>=f+f-Ze){u.set(u.subarray(f,f+f),0),x-=f,C-=f,k-=f,e=y,r=e;do{n=65535&d[--r],d[r]=f>n?0:n-f}while(0!=--e);e=f,r=e;do{n=65535&h[--r],h[r]=f>n?0:n-f}while(0!=--e);s+=f}if(0===t.We)return;e=t.je(u,C+A,s),A+=e,3>A||(p=255&u[C],p=(p<<g^255&u[C+1])&b)}while(Ze>A&&0!==t.We)}function oe(e){let t,n,r=I,s=C,i=_;const o=C>f-Ze?C-(f-Ze):0;let c=B;const a=l,w=C+258;let d=u[s+i-1],p=u[s+i];R>_||(r>>=2),c>A&&(c=A);do{if(t=e,u[t+i]==p&&u[t+i-1]==d&&u[t]==u[s]&&u[++t]==u[s+1]){s+=2,t++;do{}while(u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&w>s);if(n=258-(w-s),s=w-258,n>i){if(x=e,i=n,n>=c)break;d=u[s+i-1],p=u[s+i]}}}while((e=65535&h[e&a])>o&&0!=--r);return i>A?A:i}e.le=[],e.be=[],e.ae=[],E=[],M=[],U=[],e.de=(t,n)=>{const r=e.ae,s=r[n];let i=n<<1;for(;i<=e.ce&&(i<e.ce&&$e(t,r[i+1],r[i],e.le)&&i++,!$e(t,s,r[i],e.le));)r[n]=r[i],n=i,i<<=1;r[n]=s},e.He=(t,S,x,W,j,G)=>(W||(W=8),j||(j=8),G||(G=0),t.Le=null,-1==S&&(S=6),1>j||j>9||8!=W||9>x||x>15||0>S||S>9||0>G||G>2?Oe:(t.Fe=e,a=x,f=1<<a,l=f-1,m=j+7,y=1<<m,b=y-1,g=r.floor((m+3-1)/3),u=new i(2*f),h=[],d=[],T=1<<j+6,e.Ke=new i(4*T),s=4*T,e.Ne=new o(T),e.Oe=new i(T),D=S,V=G,(t=>(t.qe=t.Ge=0,t.Le=null,e.pending=0,e.Je=0,n=Xe,c=0,K.re=E,K.ie=Le.Ee,N.re=M,N.ie=Le.Me,O.re=U,O.ie=Le.Ue,L=0,F=0,H=8,q(),(()=>{w=2*f,d[y-1]=0;for(let e=0;y-1>e;e++)d[e]=0;P=Je[D].Pe,R=Je[D].Ie,B=Je[D].De,I=Je[D].Ve,C=0,k=0,A=0,v=_=2,z=0,p=0})(),0))(t))),e.Qe=()=>42!=n&&n!=Xe&&n!=Ye?Oe:(e.Oe=null,e.Ne=null,e.Ke=null,d=null,h=null,u=null,e.Fe=null,n==Xe?-3:0),e.Xe=(e,t,n)=>{let r=0;return-1==t&&(t=6),0>t||t>9||0>n||n>2?Oe:(Je[D].Re!=Je[t].Re&&0!==e.qe&&(r=e.Ye(1)),D!=t&&(D=t,P=Je[D].Pe,R=Je[D].Ie,B=Je[D].De,I=Je[D].Ve),V=n,r)},e.Ze=(e,t,r)=>{let s,i=r,o=0;if(!t||42!=n)return Oe;if(3>i)return 0;for(i>f-Ze&&(i=f-Ze,o=r-i),u.set(t.subarray(o,o+i),0),C=i,k=i,p=255&u[0],p=(p<<g^255&u[1])&b,s=0;i-3>=s;s++)p=(p<<g^255&u[s+2])&b,h[s&l]=d[p],d[p]=s;return 0},e.Ye=(r,i)=>{let o,w,m,I,R;if(i>4||0>i)return Oe;if(!r.$e||!r.et&&0!==r.We||n==Ye&&4!=i)return r.Le=Qe[4],Oe;if(0===r.tt)return r.Le=Qe[7],-5;var B;if(t=r,I=c,c=i,42==n&&(w=8+(a-8<<4)<<8,m=(D-1&255)>>1,m>3&&(m=3),w|=m<<6,0!==C&&(w|=32),w+=31-w%31,n=Xe,J((B=w)>>8&255),J(255&B)),0!==e.pending){if(t.Te(),0===t.tt)return c=-1,0}else if(0===t.We&&I>=i&&4!=i)return t.Le=Qe[7],-5;if(n==Ye&&0!==t.We)return r.Le=Qe[7],-5;if(0!==t.We||0!==A||0!=i&&n!=Ye){switch(R=-1,Je[D].Re){case 0:R=(e=>{let n,r=65535;for(r>s-5&&(r=s-5);;){if(1>=A){if(ie(),0===A&&0==e)return 0;if(0===A)break}if(C+=A,A=0,n=k+r,(0===C||C>=n)&&(A=C-n,C=n,se(!1),0===t.tt))return 0;if(C-k>=f-Ze&&(se(!1),0===t.tt))return 0}return se(4==e),0===t.tt?4==e?2:0:4==e?3:1})(i);break;case 1:R=(e=>{let n,r=0;for(;;){if(Ze>A){if(ie(),Ze>A&&0==e)return 0;if(0===A)break}if(3>A||(p=(p<<g^255&u[C+2])&b,r=65535&d[p],h[C&l]=d[p],d[p]=C),0===r||(C-r&65535)>f-Ze||2!=V&&(v=oe(r)),3>v)n=ee(0,255&u[C]),A--,C++;else if(n=ee(C-x,v-3),A-=v,v>P||3>A)C+=v,v=0,p=255&u[C],p=(p<<g^255&u[C+1])&b;else{v--;do{C++,p=(p<<g^255&u[C+2])&b,r=65535&d[p],h[C&l]=d[p],d[p]=C}while(0!=--v);C++}if(n&&(se(!1),0===t.tt))return 0}return se(4==e),0===t.tt?4==e?2:0:4==e?3:1})(i);break;case 2:R=(e=>{let n,r,s=0;for(;;){if(Ze>A){if(ie(),Ze>A&&0==e)return 0;if(0===A)break}if(3>A||(p=(p<<g^255&u[C+2])&b,s=65535&d[p],h[C&l]=d[p],d[p]=C),_=v,S=x,v=2,0!==s&&P>_&&f-Ze>=(C-s&65535)&&(2!=V&&(v=oe(s)),5>=v&&(1==V||3==v&&C-x>4096)&&(v=2)),3>_||v>_)if(0!==z){if(n=ee(0,255&u[C-1]),n&&se(!1),C++,A--,0===t.tt)return 0}else z=1,C++,A--;else{r=C+A-3,n=ee(C-1-S,_-3),A-=_-1,_-=2;do{++C>r||(p=(p<<g^255&u[C+2])&b,s=65535&d[p],h[C&l]=d[p],d[p]=C)}while(0!=--_);if(z=0,v=2,C++,n&&(se(!1),0===t.tt))return 0}}return 0!==z&&(n=ee(0,255&u[C-1]),z=0),se(4==e),0===t.tt?4==e?2:0:4==e?3:1})(i)}if(2!=R&&3!=R||(n=Ye),0==R||2==R)return 0===t.tt&&(c=-1),0;if(1==R){if(1==i)X(2,3),Y(256,Le._e),$(),9>1+H+10-F&&(X(2,3),Y(256,Le._e),$()),H=7;else if(re(0,0,!1),3==i)for(o=0;y>o;o++)d[o]=0;if(t.Te(),0===t.tt)return c=-1,0}}return 4!=i?0:1}}function tt(){const e=this;e.nt=0,e.rt=0,e.We=0,e.qe=0,e.tt=0,e.Ge=0}function nt(e){const t=new tt,n=(o=e&&e.chunkSize?e.chunkSize:65536)+5*(r.floor(o/16383)+1);var o;const c=new i(n);let f=e?e.level:-1;void 0===f&&(f=-1),t.He(f),t.$e=c,this.append=(e,r)=>{let o,f,a=0,l=0,u=0;const w=[];if(e.length){t.nt=0,t.et=e,t.We=e.length;do{if(t.rt=0,t.tt=n,o=t.Ye(0),0!=o)throw new s("deflating: "+t.Le);t.rt&&(t.rt==n?w.push(new i(c)):w.push(c.subarray(0,t.rt))),u+=t.rt,r&&t.nt>0&&t.nt!=a&&(r(t.nt),a=t.nt)}while(t.We>0||0===t.tt);return w.length>1?(f=new i(u),w.forEach((e=>{f.set(e,l),l+=e.length}))):f=w[0]?new i(w[0]):new i,f}},this.flush=()=>{let e,r,o=0,f=0;const a=[];do{if(t.rt=0,t.tt=n,e=t.Ye(4),1!=e&&0!=e)throw new s("deflating: "+t.Le);n-t.tt>0&&a.push(c.slice(0,t.rt)),f+=t.rt}while(t.We>0||0===t.tt);return t.Qe(),r=new i(f),a.forEach((e=>{r.set(e,o),o+=e.length})),r}}tt.prototype={He(e,t){const n=this;return n.Fe=new et,t||(t=15),n.Fe.He(n,e,t)},Ye(e){const t=this;return t.Fe?t.Fe.Ye(t,e):Oe},Qe(){const e=this;if(!e.Fe)return Oe;const t=e.Fe.Qe();return e.Fe=null,t},Xe(e,t){const n=this;return n.Fe?n.Fe.Xe(n,e,t):Oe},Ze(e,t){const n=this;return n.Fe?n.Fe.Ze(n,e,t):Oe},je(e,t,n){const r=this;let s=r.We;return s>n&&(s=n),0===s?0:(r.We-=s,e.set(r.et.subarray(r.nt,r.nt+s),t),r.nt+=s,r.qe+=s,s)},Te(){const e=this;let t=e.Fe.pending;t>e.tt&&(t=e.tt),0!==t&&(e.$e.set(e.Fe.Ke.subarray(e.Fe.Je,e.Fe.Je+t),e.rt),e.rt+=t,e.Fe.Je+=t,e.Ge+=t,e.tt-=t,e.Fe.pending-=t,0===e.Fe.pending&&(e.Fe.Je=0))}};const rt=-2,st=-3,it=-5,ot=[0,1,3,7,15,31,63,127,255,511,1023,2047,4095,8191,16383,32767,65535],ct=[96,7,256,0,8,80,0,8,16,84,8,115,82,7,31,0,8,112,0,8,48,0,9,192,80,7,10,0,8,96,0,8,32,0,9,160,0,8,0,0,8,128,0,8,64,0,9,224,80,7,6,0,8,88,0,8,24,0,9,144,83,7,59,0,8,120,0,8,56,0,9,208,81,7,17,0,8,104,0,8,40,0,9,176,0,8,8,0,8,136,0,8,72,0,9,240,80,7,4,0,8,84,0,8,20,85,8,227,83,7,43,0,8,116,0,8,52,0,9,200,81,7,13,0,8,100,0,8,36,0,9,168,0,8,4,0,8,132,0,8,68,0,9,232,80,7,8,0,8,92,0,8,28,0,9,152,84,7,83,0,8,124,0,8,60,0,9,216,82,7,23,0,8,108,0,8,44,0,9,184,0,8,12,0,8,140,0,8,76,0,9,248,80,7,3,0,8,82,0,8,18,85,8,163,83,7,35,0,8,114,0,8,50,0,9,196,81,7,11,0,8,98,0,8,34,0,9,164,0,8,2,0,8,130,0,8,66,0,9,228,80,7,7,0,8,90,0,8,26,0,9,148,84,7,67,0,8,122,0,8,58,0,9,212,82,7,19,0,8,106,0,8,42,0,9,180,0,8,10,0,8,138,0,8,74,0,9,244,80,7,5,0,8,86,0,8,22,192,8,0,83,7,51,0,8,118,0,8,54,0,9,204,81,7,15,0,8,102,0,8,38,0,9,172,0,8,6,0,8,134,0,8,70,0,9,236,80,7,9,0,8,94,0,8,30,0,9,156,84,7,99,0,8,126,0,8,62,0,9,220,82,7,27,0,8,110,0,8,46,0,9,188,0,8,14,0,8,142,0,8,78,0,9,252,96,7,256,0,8,81,0,8,17,85,8,131,82,7,31,0,8,113,0,8,49,0,9,194,80,7,10,0,8,97,0,8,33,0,9,162,0,8,1,0,8,129,0,8,65,0,9,226,80,7,6,0,8,89,0,8,25,0,9,146,83,7,59,0,8,121,0,8,57,0,9,210,81,7,17,0,8,105,0,8,41,0,9,178,0,8,9,0,8,137,0,8,73,0,9,242,80,7,4,0,8,85,0,8,21,80,8,258,83,7,43,0,8,117,0,8,53,0,9,202,81,7,13,0,8,101,0,8,37,0,9,170,0,8,5,0,8,133,0,8,69,0,9,234,80,7,8,0,8,93,0,8,29,0,9,154,84,7,83,0,8,125,0,8,61,0,9,218,82,7,23,0,8,109,0,8,45,0,9,186,0,8,13,0,8,141,0,8,77,0,9,250,80,7,3,0,8,83,0,8,19,85,8,195,83,7,35,0,8,115,0,8,51,0,9,198,81,7,11,0,8,99,0,8,35,0,9,166,0,8,3,0,8,131,0,8,67,0,9,230,80,7,7,0,8,91,0,8,27,0,9,150,84,7,67,0,8,123,0,8,59,0,9,214,82,7,19,0,8,107,0,8,43,0,9,182,0,8,11,0,8,139,0,8,75,0,9,246,80,7,5,0,8,87,0,8,23,192,8,0,83,7,51,0,8,119,0,8,55,0,9,206,81,7,15,0,8,103,0,8,39,0,9,174,0,8,7,0,8,135,0,8,71,0,9,238,80,7,9,0,8,95,0,8,31,0,9,158,84,7,99,0,8,127,0,8,63,0,9,222,82,7,27,0,8,111,0,8,47,0,9,190,0,8,15,0,8,143,0,8,79,0,9,254,96,7,256,0,8,80,0,8,16,84,8,115,82,7,31,0,8,112,0,8,48,0,9,193,80,7,10,0,8,96,0,8,32,0,9,161,0,8,0,0,8,128,0,8,64,0,9,225,80,7,6,0,8,88,0,8,24,0,9,145,83,7,59,0,8,120,0,8,56,0,9,209,81,7,17,0,8,104,0,8,40,0,9,177,0,8,8,0,8,136,0,8,72,0,9,241,80,7,4,0,8,84,0,8,20,85,8,227,83,7,43,0,8,116,0,8,52,0,9,201,81,7,13,0,8,100,0,8,36,0,9,169,0,8,4,0,8,132,0,8,68,0,9,233,80,7,8,0,8,92,0,8,28,0,9,153,84,7,83,0,8,124,0,8,60,0,9,217,82,7,23,0,8,108,0,8,44,0,9,185,0,8,12,0,8,140,0,8,76,0,9,249,80,7,3,0,8,82,0,8,18,85,8,163,83,7,35,0,8,114,0,8,50,0,9,197,81,7,11,0,8,98,0,8,34,0,9,165,0,8,2,0,8,130,0,8,66,0,9,229,80,7,7,0,8,90,0,8,26,0,9,149,84,7,67,0,8,122,0,8,58,0,9,213,82,7,19,0,8,106,0,8,42,0,9,181,0,8,10,0,8,138,0,8,74,0,9,245,80,7,5,0,8,86,0,8,22,192,8,0,83,7,51,0,8,118,0,8,54,0,9,205,81,7,15,0,8,102,0,8,38,0,9,173,0,8,6,0,8,134,0,8,70,0,9,237,80,7,9,0,8,94,0,8,30,0,9,157,84,7,99,0,8,126,0,8,62,0,9,221,82,7,27,0,8,110,0,8,46,0,9,189,0,8,14,0,8,142,0,8,78,0,9,253,96,7,256,0,8,81,0,8,17,85,8,131,82,7,31,0,8,113,0,8,49,0,9,195,80,7,10,0,8,97,0,8,33,0,9,163,0,8,1,0,8,129,0,8,65,0,9,227,80,7,6,0,8,89,0,8,25,0,9,147,83,7,59,0,8,121,0,8,57,0,9,211,81,7,17,0,8,105,0,8,41,0,9,179,0,8,9,0,8,137,0,8,73,0,9,243,80,7,4,0,8,85,0,8,21,80,8,258,83,7,43,0,8,117,0,8,53,0,9,203,81,7,13,0,8,101,0,8,37,0,9,171,0,8,5,0,8,133,0,8,69,0,9,235,80,7,8,0,8,93,0,8,29,0,9,155,84,7,83,0,8,125,0,8,61,0,9,219,82,7,23,0,8,109,0,8,45,0,9,187,0,8,13,0,8,141,0,8,77,0,9,251,80,7,3,0,8,83,0,8,19,85,8,195,83,7,35,0,8,115,0,8,51,0,9,199,81,7,11,0,8,99,0,8,35,0,9,167,0,8,3,0,8,131,0,8,67,0,9,231,80,7,7,0,8,91,0,8,27,0,9,151,84,7,67,0,8,123,0,8,59,0,9,215,82,7,19,0,8,107,0,8,43,0,9,183,0,8,11,0,8,139,0,8,75,0,9,247,80,7,5,0,8,87,0,8,23,192,8,0,83,7,51,0,8,119,0,8,55,0,9,207,81,7,15,0,8,103,0,8,39,0,9,175,0,8,7,0,8,135,0,8,71,0,9,239,80,7,9,0,8,95,0,8,31,0,9,159,84,7,99,0,8,127,0,8,63,0,9,223,82,7,27,0,8,111,0,8,47,0,9,191,0,8,15,0,8,143,0,8,79,0,9,255],ft=[80,5,1,87,5,257,83,5,17,91,5,4097,81,5,5,89,5,1025,85,5,65,93,5,16385,80,5,3,88,5,513,84,5,33,92,5,8193,82,5,9,90,5,2049,86,5,129,192,5,24577,80,5,2,87,5,385,83,5,25,91,5,6145,81,5,7,89,5,1537,85,5,97,93,5,24577,80,5,4,88,5,769,84,5,49,92,5,12289,82,5,13,90,5,3073,86,5,193,192,5,24577],at=[3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258,0,0],lt=[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,112,112],ut=[1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577],wt=[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];function ht(){let e,t,n,r,s,i;function o(e,t,o,c,f,a,l,u,w,h,d){let p,y,m,b,g,k,v,S,z,C,x,A,_,I,P;C=0,g=o;do{n[e[t+C]]++,C++,g--}while(0!==g);if(n[0]==o)return l[0]=-1,u[0]=0,0;for(S=u[0],k=1;15>=k&&0===n[k];k++);for(v=k,k>S&&(S=k),g=15;0!==g&&0===n[g];g--);for(m=g,S>g&&(S=g),u[0]=S,I=1<<k;g>k;k++,I<<=1)if(0>(I-=n[k]))return st;if(0>(I-=n[g]))return st;for(n[g]+=I,i[1]=k=0,C=1,_=2;0!=--g;)i[_]=k+=n[C],_++,C++;g=0,C=0;do{0!==(k=e[t+C])&&(d[i[k]++]=g),C++}while(++g<o);for(o=i[m],i[0]=g=0,C=0,b=-1,A=-S,s[0]=0,x=0,P=0;m>=v;v++)for(p=n[v];0!=p--;){for(;v>A+S;){if(b++,A+=S,P=m-A,P=P>S?S:P,(y=1<<(k=v-A))>p+1&&(y-=p+1,_=v,P>k))for(;++k<P&&(y<<=1)>n[++_];)y-=n[_];if(P=1<<k,h[0]+P>1440)return st;s[b]=x=h[0],h[0]+=P,0!==b?(i[b]=g,r[0]=k,r[1]=S,k=g>>>A-S,r[2]=x-s[b-1]-k,w.set(r,3*(s[b-1]+k))):l[0]=x}for(r[1]=v-A,o>C?d[C]<c?(r[0]=256>d[C]?0:96,r[2]=d[C++]):(r[0]=a[d[C]-c]+16+64,r[2]=f[d[C++]-c]):r[0]=192,y=1<<v-A,k=g>>>A;P>k;k+=y)w.set(r,3*(x+k));for(k=1<<v-1;g&k;k>>>=1)g^=k;for(g^=k,z=(1<<A)-1;(g&z)!=i[b];)b--,A-=S,z=(1<<A)-1}return 0!==I&&1!=m?it:0}function c(o){let c;for(e||(e=[],t=[],n=new f(16),r=[],s=new f(15),i=new f(16)),t.length<o&&(t=[]),c=0;o>c;c++)t[c]=0;for(c=0;16>c;c++)n[c]=0;for(c=0;3>c;c++)r[c]=0;s.set(n.subarray(0,15),0),i.set(n.subarray(0,16),0)}this.st=(n,r,s,i,f)=>{let a;return c(19),e[0]=0,a=o(n,0,19,19,null,null,s,r,i,e,t),a==st?f.Le="oversubscribed dynamic bit lengths tree":a!=it&&0!==r[0]||(f.Le="incomplete dynamic bit lengths tree",a=st),a},this.it=(n,r,s,i,f,a,l,u,w)=>{let h;return c(288),e[0]=0,h=o(s,0,n,257,at,lt,a,i,u,e,t),0!=h||0===i[0]?(h==st?w.Le="oversubscribed literal/length tree":-4!=h&&(w.Le="incomplete literal/length tree",h=st),h):(c(288),h=o(s,n,r,0,ut,wt,l,f,u,e,t),0!=h||0===f[0]&&n>257?(h==st?w.Le="oversubscribed distance tree":h==it?(w.Le="incomplete distance tree",h=st):-4!=h&&(w.Le="empty distance tree with lengths",h=st),h):0)}}function dt(){const e=this;let t,n,r,s,i=0,o=0,c=0,f=0,a=0,l=0,u=0,w=0,h=0,d=0;function p(e,t,n,r,s,i,o,c){let f,a,l,u,w,h,d,p,y,m,b,g,k,v,S,z;d=c.nt,p=c.We,w=o.ot,h=o.ct,y=o.write,m=y<o.read?o.read-y-1:o.end-y,b=ot[e],g=ot[t];do{for(;20>h;)p--,w|=(255&c.ft(d++))<<h,h+=8;if(f=w&b,a=n,l=r,z=3*(l+f),0!==(u=a[z]))for(;;){if(w>>=a[z+1],h-=a[z+1],16&u){for(u&=15,k=a[z+2]+(w&ot[u]),w>>=u,h-=u;15>h;)p--,w|=(255&c.ft(d++))<<h,h+=8;for(f=w&g,a=s,l=i,z=3*(l+f),u=a[z];;){if(w>>=a[z+1],h-=a[z+1],16&u){for(u&=15;u>h;)p--,w|=(255&c.ft(d++))<<h,h+=8;if(v=a[z+2]+(w&ot[u]),w>>=u,h-=u,m-=k,v>y){S=y-v;do{S+=o.end}while(0>S);if(u=o.end-S,k>u){if(k-=u,y-S>0&&u>y-S)do{o.lt[y++]=o.lt[S++]}while(0!=--u);else o.lt.set(o.lt.subarray(S,S+u),y),y+=u,S+=u,u=0;S=0}}else S=y-v,y-S>0&&2>y-S?(o.lt[y++]=o.lt[S++],o.lt[y++]=o.lt[S++],k-=2):(o.lt.set(o.lt.subarray(S,S+2),y),y+=2,S+=2,k-=2);if(y-S>0&&k>y-S)do{o.lt[y++]=o.lt[S++]}while(0!=--k);else o.lt.set(o.lt.subarray(S,S+k),y),y+=k,S+=k,k=0;break}if(64&u)return c.Le="invalid distance code",k=c.We-p,k=k>h>>3?h>>3:k,p+=k,d-=k,h-=k<<3,o.ot=w,o.ct=h,c.We=p,c.qe+=d-c.nt,c.nt=d,o.write=y,st;f+=a[z+2],f+=w&ot[u],z=3*(l+f),u=a[z]}break}if(64&u)return 32&u?(k=c.We-p,k=k>h>>3?h>>3:k,p+=k,d-=k,h-=k<<3,o.ot=w,o.ct=h,c.We=p,c.qe+=d-c.nt,c.nt=d,o.write=y,1):(c.Le="invalid literal/length code",k=c.We-p,k=k>h>>3?h>>3:k,p+=k,d-=k,h-=k<<3,o.ot=w,o.ct=h,c.We=p,c.qe+=d-c.nt,c.nt=d,o.write=y,st);if(f+=a[z+2],f+=w&ot[u],z=3*(l+f),0===(u=a[z])){w>>=a[z+1],h-=a[z+1],o.lt[y++]=a[z+2],m--;break}}else w>>=a[z+1],h-=a[z+1],o.lt[y++]=a[z+2],m--}while(m>=258&&p>=10);return k=c.We-p,k=k>h>>3?h>>3:k,p+=k,d-=k,h-=k<<3,o.ot=w,o.ct=h,c.We=p,c.qe+=d-c.nt,c.nt=d,o.write=y,0}e.init=(e,i,o,c,f,a)=>{t=0,u=e,w=i,r=o,h=c,s=f,d=a,n=null},e.ut=(e,y,m)=>{let b,g,k,v,S,z,C,x=0,A=0,_=0;for(_=y.nt,v=y.We,x=e.ot,A=e.ct,S=e.write,z=S<e.read?e.read-S-1:e.end-S;;)switch(t){case 0:if(z>=258&&v>=10&&(e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,m=p(u,w,r,h,s,d,e,y),_=y.nt,v=y.We,x=e.ot,A=e.ct,S=e.write,z=S<e.read?e.read-S-1:e.end-S,0!=m)){t=1==m?7:9;break}c=u,n=r,o=h,t=1;case 1:for(b=c;b>A;){if(0===v)return e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);m=0,v--,x|=(255&y.ft(_++))<<A,A+=8}if(g=3*(o+(x&ot[b])),x>>>=n[g+1],A-=n[g+1],k=n[g],0===k){f=n[g+2],t=6;break}if(16&k){a=15&k,i=n[g+2],t=2;break}if(!(64&k)){c=k,o=g/3+n[g+2];break}if(32&k){t=7;break}return t=9,y.Le="invalid literal/length code",m=st,e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);case 2:for(b=a;b>A;){if(0===v)return e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);m=0,v--,x|=(255&y.ft(_++))<<A,A+=8}i+=x&ot[b],x>>=b,A-=b,c=w,n=s,o=d,t=3;case 3:for(b=c;b>A;){if(0===v)return e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);m=0,v--,x|=(255&y.ft(_++))<<A,A+=8}if(g=3*(o+(x&ot[b])),x>>=n[g+1],A-=n[g+1],k=n[g],16&k){a=15&k,l=n[g+2],t=4;break}if(!(64&k)){c=k,o=g/3+n[g+2];break}return t=9,y.Le="invalid distance code",m=st,e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);case 4:for(b=a;b>A;){if(0===v)return e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);m=0,v--,x|=(255&y.ft(_++))<<A,A+=8}l+=x&ot[b],x>>=b,A-=b,t=5;case 5:for(C=S-l;0>C;)C+=e.end;for(;0!==i;){if(0===z&&(S==e.end&&0!==e.read&&(S=0,z=S<e.read?e.read-S-1:e.end-S),0===z&&(e.write=S,m=e.wt(y,m),S=e.write,z=S<e.read?e.read-S-1:e.end-S,S==e.end&&0!==e.read&&(S=0,z=S<e.read?e.read-S-1:e.end-S),0===z)))return e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);e.lt[S++]=e.lt[C++],z--,C==e.end&&(C=0),i--}t=0;break;case 6:if(0===z&&(S==e.end&&0!==e.read&&(S=0,z=S<e.read?e.read-S-1:e.end-S),0===z&&(e.write=S,m=e.wt(y,m),S=e.write,z=S<e.read?e.read-S-1:e.end-S,S==e.end&&0!==e.read&&(S=0,z=S<e.read?e.read-S-1:e.end-S),0===z)))return e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);m=0,e.lt[S++]=f,z--,t=0;break;case 7:if(A>7&&(A-=8,v++,_--),e.write=S,m=e.wt(y,m),S=e.write,z=S<e.read?e.read-S-1:e.end-S,e.read!=e.write)return e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);t=8;case 8:return m=1,e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);case 9:return m=st,e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m);default:return m=rt,e.ot=x,e.ct=A,y.We=v,y.qe+=_-y.nt,y.nt=_,e.write=S,e.wt(y,m)}},e.ht=()=>{}}ht.dt=(e,t,n,r)=>(e[0]=9,t[0]=5,n[0]=ct,r[0]=ft,0);const pt=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];function yt(e,t){const n=this;let r,s=0,o=0,c=0,a=0;const l=[0],u=[0],w=new dt;let h=0,d=new f(4320);const p=new ht;n.ct=0,n.ot=0,n.lt=new i(t),n.end=t,n.read=0,n.write=0,n.reset=(e,t)=>{t&&(t[0]=0),6==s&&w.ht(e),s=0,n.ct=0,n.ot=0,n.read=n.write=0},n.reset(e,null),n.wt=(e,t)=>{let r,s,i;return s=e.rt,i=n.read,r=(i>n.write?n.end:n.write)-i,r>e.tt&&(r=e.tt),0!==r&&t==it&&(t=0),e.tt-=r,e.Ge+=r,e.$e.set(n.lt.subarray(i,i+r),s),s+=r,i+=r,i==n.end&&(i=0,n.write==n.end&&(n.write=0),r=n.write-i,r>e.tt&&(r=e.tt),0!==r&&t==it&&(t=0),e.tt-=r,e.Ge+=r,e.$e.set(n.lt.subarray(i,i+r),s),s+=r,i+=r),e.rt=s,n.read=i,t},n.ut=(e,t)=>{let i,f,y,m,b,g,k,v;for(m=e.nt,b=e.We,f=n.ot,y=n.ct,g=n.write,k=g<n.read?n.read-g-1:n.end-g;;){let S,z,C,x,A,_,I,P;switch(s){case 0:for(;3>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<<y,y+=8}switch(i=7&f,h=1&i,i>>>1){case 0:f>>>=3,y-=3,i=7&y,f>>>=i,y-=i,s=1;break;case 1:S=[],z=[],C=[[]],x=[[]],ht.dt(S,z,C,x),w.init(S[0],z[0],C[0],0,x[0],0),f>>>=3,y-=3,s=6;break;case 2:f>>>=3,y-=3,s=3;break;case 3:return f>>>=3,y-=3,s=9,e.Le="invalid block type",t=st,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t)}break;case 1:for(;32>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<<y,y+=8}if((~f>>>16&65535)!=(65535&f))return s=9,e.Le="invalid stored block lengths",t=st,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);o=65535&f,f=y=0,s=0!==o?2:0!==h?7:0;break;case 2:if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);if(0===k&&(g==n.end&&0!==n.read&&(g=0,k=g<n.read?n.read-g-1:n.end-g),0===k&&(n.write=g,t=n.wt(e,t),g=n.write,k=g<n.read?n.read-g-1:n.end-g,g==n.end&&0!==n.read&&(g=0,k=g<n.read?n.read-g-1:n.end-g),0===k)))return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);if(t=0,i=o,i>b&&(i=b),i>k&&(i=k),n.lt.set(e.je(m,i),g),m+=i,b-=i,g+=i,k-=i,0!=(o-=i))break;s=0!==h?7:0;break;case 3:for(;14>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<<y,y+=8}if(c=i=16383&f,(31&i)>29||(i>>5&31)>29)return s=9,e.Le="too many length or distance symbols",t=st,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);if(i=258+(31&i)+(i>>5&31),!r||r.length<i)r=[];else for(v=0;i>v;v++)r[v]=0;f>>>=14,y-=14,a=0,s=4;case 4:for(;4+(c>>>10)>a;){for(;3>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<<y,y+=8}r[pt[a++]]=7&f,f>>>=3,y-=3}for(;19>a;)r[pt[a++]]=0;if(l[0]=7,i=p.st(r,l,u,d,e),0!=i)return(t=i)==st&&(r=null,s=9),n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);a=0,s=5;case 5:for(;i=c,258+(31&i)+(i>>5&31)>a;){let o,w;for(i=l[0];i>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<<y,y+=8}if(i=d[3*(u[0]+(f&ot[i]))+1],w=d[3*(u[0]+(f&ot[i]))+2],16>w)f>>>=i,y-=i,r[a++]=w;else{for(v=18==w?7:w-14,o=18==w?11:3;i+v>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<<y,y+=8}if(f>>>=i,y-=i,o+=f&ot[v],f>>>=v,y-=v,v=a,i=c,v+o>258+(31&i)+(i>>5&31)||16==w&&1>v)return r=null,s=9,e.Le="invalid bit length repeat",t=st,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);w=16==w?r[v-1]:0;do{r[v++]=w}while(0!=--o);a=v}}if(u[0]=-1,A=[],_=[],I=[],P=[],A[0]=9,_[0]=6,i=c,i=p.it(257+(31&i),1+(i>>5&31),r,A,_,I,P,d,e),0!=i)return i==st&&(r=null,s=9),t=i,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);w.init(A[0],_[0],d,I[0],d,P[0]),s=6;case 6:if(n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,1!=(t=w.ut(n,e,t)))return n.wt(e,t);if(t=0,w.ht(e),m=e.nt,b=e.We,f=n.ot,y=n.ct,g=n.write,k=g<n.read?n.read-g-1:n.end-g,0===h){s=0;break}s=7;case 7:if(n.write=g,t=n.wt(e,t),g=n.write,k=g<n.read?n.read-g-1:n.end-g,n.read!=n.write)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);s=8;case 8:return t=1,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);case 9:return t=st,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);default:return t=rt,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t)}}},n.ht=e=>{n.reset(e,null),n.lt=null,d=null},n.yt=(e,t,r)=>{n.lt.set(e.subarray(t,t+r),0),n.read=n.write=r},n.bt=()=>1==s?1:0}const mt=13,bt=[0,0,255,255];function gt(){const e=this;function t(e){return e&&e.gt?(e.qe=e.Ge=0,e.Le=null,e.gt.mode=7,e.gt.kt.reset(e,null),0):rt}e.mode=0,e.method=0,e.vt=[0],e.St=0,e.marker=0,e.zt=0,e.Ct=t=>(e.kt&&e.kt.ht(t),e.kt=null,0),e.xt=(n,r)=>(n.Le=null,e.kt=null,8>r||r>15?(e.Ct(n),rt):(e.zt=r,n.gt.kt=new yt(n,1<<r),t(n),0)),e.At=(e,t)=>{let n,r;if(!e||!e.gt||!e.et)return rt;const s=e.gt;for(t=4==t?it:0,n=it;;)switch(s.mode){case 0:if(0===e.We)return n;if(n=t,e.We--,e.qe++,8!=(15&(s.method=e.ft(e.nt++)))){s.mode=mt,e.Le="unknown compression method",s.marker=5;break}if(8+(s.method>>4)>s.zt){s.mode=mt,e.Le="invalid win size",s.marker=5;break}s.mode=1;case 1:if(0===e.We)return n;if(n=t,e.We--,e.qe++,r=255&e.ft(e.nt++),((s.method<<8)+r)%31!=0){s.mode=mt,e.Le="incorrect header check",s.marker=5;break}if(!(32&r)){s.mode=7;break}s.mode=2;case 2:if(0===e.We)return n;n=t,e.We--,e.qe++,s.St=(255&e.ft(e.nt++))<<24&4278190080,s.mode=3;case 3:if(0===e.We)return n;n=t,e.We--,e.qe++,s.St+=(255&e.ft(e.nt++))<<16&16711680,s.mode=4;case 4:if(0===e.We)return n;n=t,e.We--,e.qe++,s.St+=(255&e.ft(e.nt++))<<8&65280,s.mode=5;case 5:return 0===e.We?n:(n=t,e.We--,e.qe++,s.St+=255&e.ft(e.nt++),s.mode=6,2);case 6:return s.mode=mt,e.Le="need dictionary",s.marker=0,rt;case 7:if(n=s.kt.ut(e,n),n==st){s.mode=mt,s.marker=0;break}if(0==n&&(n=t),1!=n)return n;n=t,s.kt.reset(e,s.vt),s.mode=12;case 12:return e.We=0,1;case mt:return st;default:return rt}},e._t=(e,t,n)=>{let r=0,s=n;if(!e||!e.gt||6!=e.gt.mode)return rt;const i=e.gt;return s<1<<i.zt||(s=(1<<i.zt)-1,r=n-s),i.kt.yt(t,r,s),i.mode=7,0},e.It=e=>{let n,r,s,i,o;if(!e||!e.gt)return rt;const c=e.gt;if(c.mode!=mt&&(c.mode=mt,c.marker=0),0===(n=e.We))return it;for(r=e.nt,s=c.marker;0!==n&&4>s;)e.ft(r)==bt[s]?s++:s=0!==e.ft(r)?0:4-s,r++,n--;return e.qe+=r-e.nt,e.nt=r,e.We=n,c.marker=s,4!=s?st:(i=e.qe,o=e.Ge,t(e),e.qe=i,e.Ge=o,c.mode=7,0)},e.Pt=e=>e&&e.gt&&e.gt.kt?e.gt.kt.bt():rt}function kt(){}function vt(e){const t=new kt,n=e&&e.chunkSize?r.floor(2*e.chunkSize):131072,o=new i(n);let c=!1;t.xt(),t.$e=o,this.append=(e,r)=>{const f=[];let a,l,u=0,w=0,h=0;if(0!==e.length){t.nt=0,t.et=e,t.We=e.length;do{if(t.rt=0,t.tt=n,0!==t.We||c||(t.nt=0,c=!0),a=t.At(0),c&&a===it){if(0!==t.We)throw new s("inflating: bad input")}else if(0!==a&&1!==a)throw new s("inflating: "+t.Le);if((c||1===a)&&t.We===e.length)throw new s("inflating: bad input");t.rt&&(t.rt===n?f.push(new i(o)):f.push(o.subarray(0,t.rt))),h+=t.rt,r&&t.nt>0&&t.nt!=u&&(r(t.nt),u=t.nt)}while(t.We>0||0===t.tt);return f.length>1?(l=new i(h),f.forEach((e=>{l.set(e,w),w+=e.length}))):l=f[0]?new i(f[0]):new i,l}},this.flush=()=>{t.Ct()}}kt.prototype={xt(e){const t=this;return t.gt=new gt,e||(e=15),t.gt.xt(t,e)},At(e){const t=this;return t.gt?t.gt.At(t,e):rt},Ct(){const e=this;if(!e.gt)return rt;const t=e.gt.Ct(e);return e.gt=null,t},It(){const e=this;return e.gt?e.gt.It(e):rt},_t(e,t){const n=this;return n.gt?n.gt._t(n,e,t):rt},ft(e){return this.et[e]},je(e,t){return this.et.subarray(e,e+t)}},self.initCodec=()=>{self.Deflate=nt,self.Inflate=vt};
 `, r = () => t.useDataURI ? "data:text/javascript," + encodeURIComponent(e) : URL.createObjectURL(new Blob([e], { type: "text/javascript" }));
   n({ workerScripts: { inflate: [r], deflate: [r] } });
 }
-const La = "Writer iterator completed too soon", Ua = "Content-Type", Oa = 64 * 1024, Wi = "writable";
+const Oa = "Writer iterator completed too soon", Wa = "Content-Type", Ba = 64 * 1024, Wi = "writable";
 class jn {
   constructor() {
     this.size = 0;
@@ -7260,9 +7260,9 @@ class jn {
     this.initialized = !0;
   }
 }
-class Mi extends jn {
+class Bi extends jn {
   get readable() {
-    const t = this, { chunkSize: e = Oa } = t, r = new ReadableStream({
+    const t = this, { chunkSize: e = Ba } = t, r = new ReadableStream({
       start() {
         this.chunkOffset = 0;
       },
@@ -7274,7 +7274,7 @@ class Mi extends jn {
     return r;
   }
 }
-class Rn extends Mi {
+class Rn extends Bi {
   constructor(t) {
     super(), Object.assign(this, {
       blob: t,
@@ -7287,11 +7287,11 @@ class Rn extends Mi {
     return c.byteLength > e && (c = c.slice(t, s)), new Uint8Array(c);
   }
 }
-class Ba extends jn {
+class Ma extends jn {
   constructor(t) {
     super();
     const e = this, r = new TransformStream(), s = [];
-    t && s.push([Ua, t]), Object.defineProperty(e, Wi, {
+    t && s.push([Wa, t]), Object.defineProperty(e, Wi, {
       get() {
         return r.writable;
       }
@@ -7301,7 +7301,7 @@ class Ba extends jn {
     return this.blob;
   }
 }
-class Wa extends Mi {
+class Na extends Bi {
   constructor(t) {
     super(), this.readers = t;
   }
@@ -7328,7 +7328,7 @@ class Wa extends Mi {
     return s.lastDiskNumber = Math.max(l, s.lastDiskNumber), c;
   }
 }
-class Yr extends jn {
+class $r extends jn {
   constructor(t, e = 4294967295) {
     super();
     const r = this;
@@ -7348,7 +7348,7 @@ class Yr extends jn {
         else {
           const { value: g, done: T } = await t.next();
           if (T && !g)
-            throw new Error(La);
+            throw new Error(Oa);
           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);
         }
       },
@@ -7376,17 +7376,17 @@ async function Jt(n, t) {
   else
     return Promise.resolve();
 }
-function Ma(n) {
-  return Array.isArray(n) && (n = new Wa(n)), n instanceof ReadableStream && (n = {
+function qa(n) {
+  return Array.isArray(n) && (n = new Na(n)), n instanceof ReadableStream && (n = {
     readable: n
   }), n;
 }
-function Na(n) {
-  n.writable === Ee && typeof n.next == Ft && (n = new Yr(n)), n instanceof WritableStream && (n = {
+function ja(n) {
+  n.writable === Ee && typeof n.next == Ft && (n = new $r(n)), n instanceof WritableStream && (n = {
     writable: n
   });
   const { writable: t } = n;
-  return t.size === Ee && (t.size = 0), n instanceof Yr || Object.assign(n, {
+  return t.size === Ee && (t.size = 0), n instanceof $r || Object.assign(n, {
     diskNumber: 0,
     diskOffset: 0,
     availableSize: 1 / 0,
@@ -7396,35 +7396,33 @@ function Na(n) {
 function _e(n, t, e, r) {
   return n.readUint8Array(t, e, r);
 }
-const Ni = "\0☺☻♥♦♣♠•◘○◙♂♀♪♫☼►◄↕‼¶§▬↨↑↓→←∟↔▲▼ !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~⌂ÇüéâäàåçêëèïîìÄÅÉæÆôöòûùÿÖÜ¢£¥₧ƒáíóúñѪº¿⌐¬½¼¡«»░▒▓│┤╡╢╖╕╣║╗╝╜╛┐└┴┬├─┼╞╟╚╔╩╦╠═╬╧╨╤╥╙╘╒╓╫╪┘┌█▄▌▐▀αßΓπΣσµτΦΘΩδ∞φε∩≡±≥≤⌠⌡÷≈°∙·√ⁿ²■ ".split(""), qa = Ni.length == 256;
-function ja(n) {
-  if (qa) {
+const Mi = "\0☺☻♥♦♣♠•◘○◙♂♀♪♫☼►◄↕‼¶§▬↨↑↓→←∟↔▲▼ !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~⌂ÇüéâäàåçêëèïîìÄÅÉæÆôöòûùÿÖÜ¢£¥₧ƒáíóúñѪº¿⌐¬½¼¡«»░▒▓│┤╡╢╖╕╣║╗╝╜╛┐└┴┬├─┼╞╟╚╔╩╦╠═╬╧╨╤╥╙╘╒╓╫╪┘┌█▄▌▐▀αßΓπΣσµτΦΘΩδ∞φε∩≡±≥≤⌠⌡÷≈°∙·√ⁿ²■ ".split(""), Ha = Mi.length == 256;
+function $a(n) {
+  if (Ha) {
     let t = "";
     for (let e = 0; e < n.length; e++)
-      t += Ni[n[e]];
+      t += Mi[n[e]];
     return t;
   } else
     return new TextDecoder().decode(n);
 }
 function Yt(n, t) {
-  return t && t.trim().toLowerCase() == "cp437" ? ja(n) : new TextDecoder(t).decode(n);
+  return t && t.trim().toLowerCase() == "cp437" ? $a(n) : new TextDecoder(t).decode(n);
 }
-const qi = "filename", ji = "rawFilename", Hi = "comment", $i = "rawComment", Yi = "uncompressedSize", Zi = "compressedSize", Vi = "offset", Fn = "diskNumberStart", Cn = "lastModDate", In = "rawLastModDate", Gi = "lastAccessDate", Ha = "rawLastAccessDate", Ki = "creationDate", $a = "rawCreationDate", Ya = "internalFileAttribute", Za = "internalFileAttributes", Va = "externalFileAttribute", Ga = "externalFileAttributes", Ka = "msDosCompatible", Xa = "zip64", za = "encrypted", Ja = "version", Qa = "versionMadeBy", ec = "zipCrypto", tc = "directory", nc = "executable", rc = [
+const Ni = "filename", qi = "rawFilename", ji = "comment", Hi = "rawComment", $i = "uncompressedSize", Yi = "compressedSize", Zi = "offset", Fn = "diskNumberStart", Cn = "lastModDate", In = "rawLastModDate", Vi = "lastAccessDate", Ya = "rawLastAccessDate", Gi = "creationDate", Za = "rawCreationDate", Va = "internalFileAttribute", Ga = "internalFileAttributes", Ka = "externalFileAttribute", Xa = "externalFileAttributes", za = "msDosCompatible", Ja = "zip64", Qa = "encrypted", ec = "version", tc = "versionMadeBy", nc = "zipCrypto", rc = "directory", ic = "executable", sc = [
+  Ni,
   qi,
-  ji,
-  Zi,
   Yi,
+  $i,
   Cn,
   In,
+  ji,
   Hi,
-  $i,
-  Gi,
-  Ki,
   Vi,
+  Gi,
+  Zi,
   Fn,
   Fn,
-  Ya,
-  Za,
   Va,
   Ga,
   Ka,
@@ -7435,6 +7433,8 @@ const qi = "filename", ji = "rawFilename", Hi = "comment", $i = "rawComment", Yi
   ec,
   tc,
   nc,
+  rc,
+  ic,
   "bitFlag",
   "signature",
   "filenameUTF8",
@@ -7449,17 +7449,17 @@ const qi = "filename", ji = "rawFilename", Hi = "comment", $i = "rawComment", Yi
   "extraFieldNTFS",
   "extraFieldExtendedTimestamp"
 ];
-class Zr {
+class Yr {
   constructor(t) {
-    rc.forEach((e) => this[e] = t[e]);
+    sc.forEach((e) => this[e] = t[e]);
   }
 }
-const yn = "File format is not recognized", ic = "End of central directory not found", sc = "End of Zip64 central directory locator not found", oc = "Central directory header not found", ac = "Local file header not found", cc = "Zip64 extra field not found", lc = "File contains encrypted entry", fc = "Encryption method not supported", Vr = "Compression method not supported", Gr = "Split zip file", Kr = "utf-8", Xr = "cp437", uc = [
+const yn = "File format is not recognized", oc = "End of central directory not found", ac = "End of Zip64 central directory locator not found", cc = "Central directory header not found", lc = "Local file header not found", fc = "Zip64 extra field not found", uc = "File contains encrypted entry", dc = "Encryption method not supported", Zr = "Compression method not supported", Vr = "Split zip file", Gr = "utf-8", Kr = "cp437", pc = [
+  [$i, st],
   [Yi, st],
   [Zi, st],
-  [Vi, st],
   [Fn, Xe]
-], dc = {
+], mc = {
   [Xe]: {
     getValue: ce,
     bytes: 4
@@ -7469,12 +7469,12 @@ const yn = "File format is not recognized", ic = "End of central directory not f
     bytes: 8
   }
 };
-class zr {
+class Xr {
   constructor(t, e = {}) {
     Object.assign(this, {
-      reader: Ma(t),
+      reader: qa(t),
       options: e,
-      config: Zo()
+      config: Go()
     });
   }
   async *getEntriesGenerator(t = {}) {
@@ -7483,94 +7483,94 @@ class zr {
     const { config: s } = e;
     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);
+    r.chunkSize = Ko(s);
+    const a = await yc(r, Uo, r.size, ut, Xe * 16);
     if (!a) {
-      const b = await _e(r, 0, 4), E = xe(b);
-      throw ce(E) == Po ? new Error(Gr) : new Error(ic);
+      const k = await _e(r, 0, 4), E = xe(k);
+      throw ce(E) == Lo ? new Error(Vr) : new Error(oc);
     }
     const c = xe(a);
     let l = ce(c, 12), f = ce(c, 16);
     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) {
+    let O = he(c, 6), m = he(c, 8), d = 0, h = 0;
+    if (f == st || l == st || m == Xe || O == Xe) {
+      const k = await _e(r, a.offset - mn, mn), E = xe(k);
+      if (ce(E, 0) == Oo) {
         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 != $) {
+        let B = await _e(r, f, hn, -1), L = xe(B);
+        const Y = a.offset - mn - hn;
+        if (ce(L, 0) != kr && f != Y) {
           const H = f;
-          f = $, d = f - H, M = await _e(r, f, hn, -1), O = xe(M);
+          f = Y, d = f - H, B = await _e(r, f, hn, -1), L = xe(B);
         }
-        if (ce(O, 0) != Er)
-          throw new Error(sc);
-        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 (ce(L, 0) != kr)
+          throw new Error(ac);
+        g == Xe && (g = ce(L, 16)), O == Xe && (O = ce(L, 20)), m == Xe && (m = Zt(L, 32)), l == st && (l = Zt(L, 40)), f -= l;
       }
     }
     if (f >= r.size && (d = r.size - f - l - ut, f = r.size - l - ut), T != g)
-      throw new Error(Gr);
+      throw new Error(Vr);
     if (f < 0)
       throw new Error(yn);
-    let v = 0, A = await _e(r, f, l, C), P = xe(A);
+    let b = 0, R = await _e(r, f, l, O), C = xe(R);
     if (l) {
-      const b = a.offset - l;
-      if (ce(P, v) != kr && f != b) {
+      const k = a.offset - l;
+      if (ce(C, b) != vr && f != k) {
         const E = f;
-        f = b, d += f - E, A = await _e(r, f, l, C), P = xe(A);
+        f = k, d += f - E, R = await _e(r, f, l, O), C = xe(R);
       }
     }
     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)
+    if (l != S && S >= 0 && (l = S, R = await _e(r, f, l, O), C = xe(R)), f < 0 || f >= r.size)
       throw new Error(yn);
-    const R = ve(e, t, "filenameEncoding"), F = ve(e, t, "commentEncoding");
-    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(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;
+    const A = ve(e, t, "filenameEncoding"), F = ve(e, t, "commentEncoding");
+    for (let k = 0; k < m; k++) {
+      const E = new hc(r, s, e.options);
+      if (ce(C, b) != vr)
+        throw new Error(cc);
+      Ki(E, C, b + 6);
+      const B = !!E.bitFlag.languageEncodingFlag, L = b + 46, Y = L + E.filenameLength, H = Y + E.extraFieldLength, j = he(C, b + 4), K = j >> 8 == 0, G = j >> 8 == 3, re = R.subarray(L, Y), Z = he(C, b + 32), X = H + Z, $ = R.subarray(H, X), J = B, Pe = B, de = ce(C, b + 38), le = K && (xt(C, b + 38) & Tr) == Tr || G && (de >> 16 & Rr) == Rr || re.length && re[re.length - 1] == Cr.charCodeAt(0), wt = G && (de >> 16 & Fr) == Fr, qe = ce(C, b + 42) + d;
       Object.assign(E, {
         versionMadeBy: j,
-        msDosCompatible: G,
+        msDosCompatible: K,
         compressedSize: 0,
         uncompressedSize: 0,
         commentLength: Z,
         directory: le,
         offset: qe,
-        diskNumberStart: he(P, v + 34),
-        internalFileAttributes: he(P, v + 36),
+        diskNumberStart: he(C, b + 34),
+        internalFileAttributes: he(C, b + 36),
         externalFileAttributes: de,
-        rawFilename: te,
-        filenameUTF8: ee,
+        rawFilename: re,
+        filenameUTF8: J,
         commentUTF8: Pe,
-        rawExtraField: A.subarray($, H),
+        rawExtraField: R.subarray(Y, H),
         executable: wt
       }), 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(te, et);
-      ge === Ee && (ge = Yt(te, et));
-      let fe = at(Y, tt);
-      fe === Ee && (fe = Yt(Y, tt)), Object.assign(E, {
-        rawComment: Y,
+      const at = ve(e, t, "decodeText") || Yt, et = J ? Gr : A || Kr, tt = Pe ? Gr : F || Kr;
+      let ge = at(re, et);
+      ge === Ee && (ge = Yt(re, et));
+      let fe = at($, tt);
+      fe === Ee && (fe = Yt($, tt)), Object.assign(E, {
+        rawComment: $,
         filename: ge,
         comment: fe,
-        directory: le || ge.endsWith(Ir)
-      }), 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;
+        directory: le || ge.endsWith(Cr)
+      }), h = Math.max(qe, h), Xi(E, E, C, b + 6), E.zipCrypto = E.encrypted && !E.extraFieldAES;
+      const je = new Yr(E);
+      je.getData = (u, i) => E.getData(u, je, i), b = X;
       const { onprogress: ue } = t;
       if (ue)
         try {
-          await ue(b + 1, m, new Zr(E));
+          await ue(k + 1, m, new Yr(E));
         } catch {
         }
       yield je;
     }
-    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;
+    const y = ve(e, t, "extractPrependedData"), P = 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(), P && (e.appendedData = w < r.size ? await _e(r, w, r.size - w) : new Uint8Array()), !0;
   }
   async getEntries(t = {}) {
     const e = [];
@@ -7581,7 +7581,7 @@ class zr {
   async close() {
   }
 }
-class pc {
+class hc {
   constructor(t, e, r) {
     Object.assign(this, {
       reader: t,
@@ -7600,41 +7600,41 @@ class pc {
       bitFlag: w,
       signature: g,
       rawLastModDate: T,
-      uncompressedSize: C,
+      uncompressedSize: O,
       compressedSize: m
-    } = 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");
+    } = s, d = e.localDirectory = {}, h = await _e(a, c, 30, l), b = xe(h);
+    let R = ve(s, r, "password"), C = 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 && !S)
-      throw new Error(Vr);
-    if (ce(v, 0) != Io)
-      throw new Error(ac);
-    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, {
+    if (R = R && R.length && R, C = C && C.length && C, f && f.originalCompressionMethod != Po)
+      throw new Error(Zr);
+    if (_ != Io && _ != Co && !S)
+      throw new Error(Zr);
+    if (ce(b, 0) != Do)
+      throw new Error(lc);
+    Ki(d, b, 4), d.rawExtraField = d.extraFieldLength ? await _e(a, c + 30 + d.filenameLength, d.extraFieldLength, l) : new Uint8Array(), Xi(s, d, b, 4, !0), Object.assign(e, {
       lastAccessDate: d.lastAccessDate,
       creationDate: d.creationDate
     });
-    const R = s.encrypted && d.encrypted && !S, F = R && !f;
-    if (S || (e.zipCrypto = F), R) {
+    const A = s.encrypted && d.encrypted && !S, F = A && !f;
+    if (S || (e.zipCrypto = F), A) {
       if (!F && f.strength === Ee)
-        throw new Error(fc);
-      if (!A && !P)
-        throw new Error(lc);
+        throw new Error(dc);
+      if (!R && !C)
+        throw new Error(uc);
     }
-    const y = c + 30 + d.filenameLength + d.extraFieldLength, D = m, b = a.readable;
-    Object.assign(b, {
+    const y = c + 30 + d.filenameLength + d.extraFieldLength, P = m, k = a.readable;
+    Object.assign(k, {
       diskNumberStart: l,
       offset: y,
-      size: D
+      size: P
     });
-    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 = {
+    const E = ve(s, r, "signal"), B = ve(s, r, "checkPasswordOnly");
+    B && (t = new WritableStream()), t = ja(t), await Jt(t, S ? m : O);
+    const { writable: L } = t, { onstart: Y, onprogress: H, onend: j } = r, K = {
       options: {
-        codecType: Ui,
-        password: A,
-        rawPassword: P,
+        codecType: Li,
+        password: R,
+        rawPassword: C,
         zipCrypto: F,
         encryptionStrength: f && f.strength,
         signed: ve(s, r, "checkSignature") && !S,
@@ -7645,50 +7645,50 @@ class pc {
         useWebWorkers: ve(s, r, "useWebWorkers"),
         useCompressionStream: ve(s, r, "useCompressionStream"),
         transferStreams: ve(s, r, "transferStreams"),
-        checkPasswordOnly: M
+        checkPasswordOnly: B
       },
       config: x,
-      streamOptions: { signal: E, size: D, onstart: $, onprogress: H, onend: j }
+      streamOptions: { signal: E, size: P, onstart: Y, onprogress: H, onend: j }
     };
-    let K = 0;
+    let G = 0;
     try {
-      ({ outputSize: K } = await Ia({ readable: b, writable: O }, G));
-    } catch (te) {
-      if (!M || te.message != Mn)
-        throw te;
+      ({ outputSize: G } = await Da({ readable: k, writable: L }, K));
+    } catch (re) {
+      if (!B || re.message != Mn)
+        throw re;
     } finally {
-      const te = ve(s, r, "preventClose");
-      O.size += K, !te && !O.locked && await O.getWriter().close();
+      const re = ve(s, r, "preventClose");
+      L.size += G, !re && !L.locked && await L.getWriter().close();
     }
-    return M ? Ee : t.getData ? t.getData() : O;
+    return B ? Ee : t.getData ? t.getData() : L;
   }
 }
-function Xi(n, t, e) {
-  const r = n.rawBitFlag = he(t, e + 2), s = (r & Sr) == Sr, a = ce(t, e + 6);
+function Ki(n, t, e) {
+  const r = n.rawBitFlag = he(t, e + 2), s = (r & Er) == Er, a = ce(t, e + 6);
   Object.assign(n, {
     encrypted: s,
     version: he(t, e),
     bitFlag: {
-      level: (r & Ho) >> 1,
-      dataDescriptor: (r & Ar) == Ar,
-      languageEncodingFlag: (r & Tr) == Tr
+      level: (r & Yo) >> 1,
+      dataDescriptor: (r & Sr) == Sr,
+      languageEncodingFlag: (r & Ar) == Ar
     },
     rawLastModDate: a,
-    lastModDate: _c(a),
+    lastModDate: bc(a),
     filenameLength: he(t, e + 22),
     extraFieldLength: he(t, e + 24)
   });
 }
-function zi(n, t, e, r, s) {
+function Xi(n, t, e, r, s) {
   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 = he(l, f), v = he(l, f + 2);
+      const h = he(l, f), b = he(l, f + 2);
       c.set(h, {
         type: h,
-        data: a.slice(f + 4, f + 4 + v)
-      }), f += 4 + v;
+        data: a.slice(f + 4, f + 4 + b)
+      }), f += 4 + b;
     }
   } catch {
   }
@@ -7698,34 +7698,34 @@ function zi(n, t, e, r, s) {
     uncompressedSize: ce(e, r + 18),
     compressedSize: ce(e, r + 14)
   });
-  const x = c.get(Uo);
-  x && (mc(x, t), t.extraFieldZip64 = x);
-  const w = c.get(No);
-  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 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);
+  const x = c.get(Wo);
+  x && (xc(x, t), t.extraFieldZip64 = x);
+  const w = c.get(jo);
+  w && (zr(w, Ni, qi, t, n), t.extraFieldUnicodePath = w);
+  const g = c.get(Ho);
+  g && (zr(g, ji, Hi, t, n), t.extraFieldUnicodeComment = g);
+  const T = c.get(Bo);
+  T ? (wc(T, t, _), t.extraFieldAES = T) : t.compressionMethod = _;
+  const O = c.get(Mo);
+  O && (gc(O, t), t.extraFieldNTFS = O);
+  const m = c.get(qo);
+  m && (_c(m, t, s), t.extraFieldExtendedTimestamp = m);
+  const d = c.get($o);
   d && (t.extraFieldUSDZ = d);
 }
-function mc(n, t) {
+function xc(n, t) {
   t.zip64 = !0;
-  const e = xe(n.data), r = uc.filter(([s, a]) => t[s] == a);
+  const e = xe(n.data), r = pc.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) {
-      const f = dc[l];
+      const f = mc[l];
       t[c] = n[c] = f.getValue(e, a), a += f.bytes;
     } else if (n[c])
-      throw new Error(cc);
+      throw new Error(fc);
   }
 }
-function Jr(n, t, e, r, s) {
+function zr(n, t, e, r, s) {
   const a = xe(n.data), c = new Xt();
   c.append(s[e]);
   const l = xe(new Uint8Array(4));
@@ -7737,7 +7737,7 @@ function Jr(n, t, e, r, s) {
     valid: !s.bitFlag.languageEncodingFlag && f == ce(l, 0)
   }), n.valid && (r[t] = n[t], r[t + "UTF8"] = !0);
 }
-function hc(n, t, e) {
+function wc(n, t, e) {
   const r = xe(n.data), s = xt(r, 4);
   Object.assign(n, {
     vendorVersion: xt(r, 0),
@@ -7747,13 +7747,13 @@ function hc(n, t, e) {
     compressionMethod: he(r, 5)
   }), t.compressionMethod = n.compressionMethod;
 }
-function xc(n, t) {
+function gc(n, t) {
   const e = xe(n.data);
   let r = 4, s;
   try {
     for (; r < n.data.length && !s; ) {
       const a = he(e, r), c = he(e, r + 2);
-      a == Wo && (s = n.data.slice(r + 4, r + 4 + c)), r += 4 + c;
+      a == No && (s = n.data.slice(r + 4, r + 4 + c)), r += 4 + c;
     }
   } catch {
   }
@@ -7771,9 +7771,9 @@ function xc(n, t) {
   } catch {
   }
 }
-function wc(n, t, e) {
+function _c(n, t, e) {
   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));
+  e ? ((s & 1) == 1 && (a.push(Cn), c.push(In)), (s & 2) == 2 && (a.push(Vi), c.push(Ya)), (s & 4) == 4 && (a.push(Gi), c.push(Za))) : n.data.length >= 5 && (a.push(Cn), c.push(In));
   let l = 1;
   a.forEach((f, _) => {
     if (n.data.length >= l + 4) {
@@ -7785,9 +7785,9 @@ function wc(n, t, e) {
     l += 4;
   });
 }
-async function gc(n, t, e, r, s) {
+async function yc(n, t, e, r, s) {
   const a = new Uint8Array(4), c = xe(a);
-  yc(c, 0, t);
+  vc(c, 0, t);
   const l = r + s;
   return await f(r) || await f(Math.min(l, e));
   async function f(_) {
@@ -7803,7 +7803,7 @@ async function gc(n, t, e, r, s) {
 function ve(n, t, e) {
   return t[e] === Ee ? n.options[e] : t[e];
 }
-function _c(n) {
+function bc(n) {
   const t = (n & 4294901760) >> 16, e = n & 65535;
   try {
     return new Date(1980 + ((t & 65024) >> 9), ((t & 480) >> 5) - 1, t & 31, (e & 63488) >> 11, (e & 2016) >> 5, (e & 31) * 2, 0);
@@ -7825,21 +7825,21 @@ function ce(n, t) {
 function Zt(n, t) {
   return Number(n.getBigUint64(t, !0));
 }
-function yc(n, t, e) {
+function vc(n, t, e) {
   n.setUint32(t, e, !0);
 }
 function xe(n) {
   return new DataView(n.buffer);
 }
-let Ji;
+let zi;
 try {
-  Ji = import.meta.url;
+  zi = import.meta.url;
 } catch {
 }
-Wn({ baseURL: Ji });
-Da(Wn);
-Wn({ Deflate: so, Inflate: To });
-class bc {
+Bn({ baseURL: zi });
+Ua(Bn);
+Bn({ Deflate: ao, Inflate: Fo });
+class kc {
   constructor(t) {
     this.fileTree = t;
   }
@@ -7876,19 +7876,19 @@ class Qt {
     this.entries = /* @__PURE__ */ new Map(), this.zipReader = t;
   }
   static fromStream(t) {
-    const e = new zr(
+    const e = new Xr(
       new Rn(new Vt(t, "archive.zip"))
     );
     return new Qt(e);
   }
   static fromArrayBuffer(t) {
-    const e = new zr(
+    const e = new Xr(
       new Rn(new Blob([t]))
     );
     return new Qt(e);
   }
   async read(t) {
-    const e = await this.getEntry(t), r = await e.getData(new Ba());
+    const e = await this.getEntry(t), r = await e.getData(new Ma());
     return new Vt(r.stream(), t, {
       filesize: e.uncompressedSize
     });
@@ -7908,7 +7908,7 @@ class Qt {
     return this.entries;
   }
 }
-class vc {
+class Ec {
   /**
    * Creates a new OverlayFilesystem.
    *
@@ -7948,7 +7948,7 @@ class vc {
     );
   }
 }
-class kc {
+class Sc {
   constructor(t) {
     this.root = t;
   }
@@ -7985,7 +7985,7 @@ class kc {
           )
         ) : e(
           new Vt(
-            Ec(a),
+            Ac(a),
             t,
             {
               filesize: l.size
@@ -7996,21 +7996,21 @@ class kc {
     });
   }
 }
-function Ec(n) {
+function Ac(n) {
   return new ReadableStream({
     start(e) {
       n.on("data", (r) => e.enqueue(r)), n.on("end", () => e.close());
     }
   });
 }
-async function Sc({
+async function Tc({
   sourceString: n,
   blueprintMayReadAdjacentFiles: t
 }) {
   if (!n)
     return;
   if (n.startsWith("http://") || n.startsWith("https://"))
-    return await as(n);
+    return await cs(n);
   let e = Je.resolve(process.cwd(), n);
   if (!ye.existsSync(e))
     throw new Error(`Blueprint file does not exist: ${e}`);
@@ -8034,9 +8034,9 @@ async function Sc({
           `Blueprint file at ${e} is not a valid JSON file`
         );
       }
-      const c = Je.dirname(e), l = new kc(c);
-      return new vc([
-        new bc({
+      const c = Je.dirname(e), l = new Sc(c);
+      return new Ec([
+        new kc({
           "blueprint.json": a
         }),
         /**
@@ -8046,7 +8046,7 @@ async function Sc({
         {
           read(f) {
             if (!t)
-              throw new oi(
+              throw new si(
                 `Error: Blueprint contained tried to read a local file at path "${f}" (via a resource of type "bundled"). Playground restricts access to local resources by default as a security measure. 
 
 You can allow this Blueprint to read files from the same parent directory by explicitly adding the --blueprint-may-read-adjacent-files option to your command.`
@@ -8062,8 +8062,8 @@ You can allow this Blueprint to read files from the same parent directory by exp
       );
   }
 }
-async function jc() {
-  const n = gs(process.argv.slice(2)).usage("Usage: wp-playground <command> [options]").positional("command", {
+async function Yc() {
+  const n = bs(process.argv.slice(2)).usage("Usage: wp-playground <command> [options]").positional("command", {
     describe: "Command to run",
     choices: ["server", "run-blueprint", "build-snapshot"],
     demandOption: !0
@@ -8078,8 +8078,8 @@ async function jc() {
   }).option("php", {
     describe: "PHP version to use.",
     type: "string",
-    default: Qr,
-    choices: ss
+    default: Jr,
+    choices: is
   }).option("wp", {
     describe: "WordPress version to use.",
     type: "string",
@@ -8088,12 +8088,12 @@ async function jc() {
     describe: "Mount a directory to the PHP runtime (can be used multiple times). Format: /host/path:/vfs/path",
     type: "array",
     string: !0,
-    coerce: Kn
+    coerce: Gn
   }).option("mount-before-install", {
     describe: "Mount a directory to the PHP runtime before WordPress installation (can be used multiple times). Format: /host/path:/vfs/path",
     type: "array",
     string: !0,
-    coerce: Kn
+    coerce: Gn
   }).option("mount-dir", {
     describe: 'Mount a directory to the PHP runtime (can be used multiple times). Format: "/host/path" "/vfs/path"',
     type: "array",
@@ -8105,7 +8105,7 @@ async function jc() {
     type: "string",
     nargs: 2,
     array: !0,
-    coerce: Cs
+    coerce: Ps
   }).option("login", {
     describe: "Should log the user in",
     type: "boolean",
@@ -8148,12 +8148,16 @@ Warning: Following symlinks will expose files outside mounted directories to Pla
     default: !1,
     // Hide this option because we want to replace with a more general log-level flag.
     hidden: !0
+  }).option("internal-cookie-store", {
+    describe: "Enable internal cookie handling. When enabled, Playground will manage cookies internally using an HttpCookieStore that persists cookies across requests. When disabled, cookies are handled externally (e.g., by a browser in Node.js environments).",
+    type: "boolean",
+    default: !1
   }).option("experimentalMultiWorker", {
     describe: "Enable experimental multi-worker support which requires JSPI and a /wordpress directory backed by a real filesystem. Pass a positive number to specify the number of workers to use. Otherwise, default to the number of CPUs minus 1.",
     type: "number",
-    coerce: (s) => s ?? hs().length - 1
+    coerce: (s) => s ?? ws().length - 1
   }).showHelpOnFail(!1).check(async (s) => {
-    if (s.wp !== void 0 && !Fs(s.wp))
+    if (s.wp !== void 0 && !Is(s.wp))
       try {
         new URL(s.wp);
       } catch {
@@ -8166,10 +8170,6 @@ Warning: Following symlinks will expose files outside mounted directories to Pla
         throw new Error(
           "The --experimentalMultiWorker flag must be a positive integer greater than 1."
         );
-      if (!await Rs())
-        throw new Error(
-          "JavaScript Promise Integration (JSPI) is not enabled. Please enable JSPI in your JavaScript runtime before using the --experimentalMultiWorker flag."
-        );
       const a = (c) => c.vfsPath === "/wordpress";
       if (!s.mount?.some(a) && !s.mountBeforeInstall?.some(
         a
@@ -8186,7 +8186,7 @@ Warning: Following symlinks will expose files outside mounted directories to Pla
   const r = {
     ...t,
     command: e,
-    blueprint: await Sc({
+    blueprint: await Tc({
       sourceString: t.blueprint,
       blueprintMayReadAdjacentFiles: t.blueprintMayReadAdjacentFiles
     }),
@@ -8197,20 +8197,20 @@ Warning: Following symlinks will expose files outside mounted directories to Pla
     ]
   };
   try {
-    return Ac(r);
+    return Rc(r);
   } catch (s) {
-    const a = oi.getReportableCause(s);
+    const a = si.getReportableCause(s);
     if (a)
       console.log(""), console.log(a.message), process.exit(1);
     else
       throw s;
   }
 }
-async function Ac(n) {
+async function Rc(n) {
   let t, e;
   const r = [];
-  n.autoMount && (n = _s(n));
-  async function s(C) {
+  n.autoMount && (n = vs(n));
+  async function s(m) {
     await e.run({
       code: `<?php
 			$zip = new ZipArchive();
@@ -8231,152 +8231,164 @@ async function Ac(n) {
 
 		`
     });
-    const m = await e.readFileAsBuffer("/tmp/build.zip");
-    ye.writeFileSync(C, m);
+    const d = await e.readFileAsBuffer("/tmp/build.zip");
+    ye.writeFileSync(m, d);
   }
   async function a() {
-    const C = cs(n.blueprint) ? n.blueprint : {
+    const m = ls(n.blueprint) ? n.blueprint : {
       login: n.login,
       ...n.blueprint,
       preferredVersions: {
-        php: n.php ?? n?.blueprint?.preferredVersions?.php ?? Qr,
+        php: n.php ?? n?.blueprint?.preferredVersions?.php ?? Jr,
         wp: n.wp ?? n?.blueprint?.preferredVersions?.wp ?? "latest",
         ...n.blueprint?.preferredVersions || {}
       }
-    }, m = new rs();
-    let d = "", h = !1;
-    return m.addEventListener("progress", (v) => {
-      if (h)
+    }, d = new ns();
+    let h = "", b = !1;
+    return d.addEventListener("progress", (R) => {
+      if (b)
         return;
-      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}%`;
+      b = R.detail.progress === 100;
+      const C = Math.floor(R.detail.progress);
+      h = R.detail.caption || h || "Running the Blueprint";
+      const S = `${h.trim()} – ${C}%`;
       n.quiet || l(
         process.stdout,
-        P,
-        h
+        S,
+        b
       );
-    }), await ls(C, {
-      progress: m
+    }), await fs(m, {
+      progress: d
     });
   }
   let c = "";
-  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}
+  function l(m, d, h) {
+    d !== c && (c = d, m.isTTY ? (m.cursorTo(0), m.write(d), m.clearLine(1), h && m.write(`
+`)) : m.write(`${d}
 `));
   }
-  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 A(P) {
-        const S = new Error(
-          `Worker failed to load at ${C}. ${P.message ? `Original error: ${P.message}` : ""}`
-        );
-        S.filename = C, h(S), m.off("error", A);
+  async function f(m) {
+    const d = new ms(m);
+    return new Promise(
+      (h, b) => {
+        d.once("message", function(R) {
+          R.command === "worker-script-initialized" && h({ worker: d, phpPort: R.phpPort });
+        }), d.once("error", function(R) {
+          console.error(R);
+          const C = new Error(
+            `Worker failed to load at ${m}. ${R.message ? `Original error: ${R.message}` : ""}`
+          );
+          C.filename = m, b(C);
+        });
       }
-      m.on("message", v), m.on("error", A);
-    });
+    );
   }
-  function _(C) {
-    const m = new URL(
-      As,
+  function _(m) {
+    const d = new URL(
+      Fs,
       import.meta.url
-    ), d = [];
-    for (let h = 0; h < C; h++)
-      d.push(f(m));
-    return Promise.all(d);
+    ), h = [];
+    for (let b = 0; b < m; b++)
+      h.push(f(d));
+    return Promise.all(h);
   }
   n.quiet && (me.handlers = []);
-  const x = await a(), w = await import("fs-ext").then((C) => C.flockSync).catch(() => {
+  const x = await a(), w = await import("fs-ext").then((m) => m.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({
+  }), g = new _s(w);
+  async function T() {
+    const { port1: m, port2: d } = new ps();
+    return await ys() ? os(g, null, m) : await as(g, m), d;
+  }
+  let O = !1;
+  return me.log("Starting a PHP server..."), As({
     port: n.port,
-    onBind: async (C, m) => {
-      const d = `http://127.0.0.1:${m}`, h = n.experimentalMultiWorker ?? 1, v = _(h);
+    onBind: async (m, d) => {
+      const h = `http://127.0.0.1:${d}`, b = n.experimentalMultiWorker ?? 1, R = _(b);
       me.log(`Setting up WordPress ${n.wp}`);
-      let A;
-      const P = new is();
+      let C;
+      const S = new rs();
       if (!n.skipWordPressSetup) {
-        let b = !1;
-        P.addEventListener("progress", (E) => {
-          if (b)
+        let E = !1;
+        S.addEventListener("progress", (B) => {
+          if (E)
             return;
-          const { loaded: M, total: O } = E.detail, $ = Math.floor(
-            Math.min(100, 100 * M / O)
+          const { loaded: L, total: Y } = B.detail, H = Math.floor(
+            Math.min(100, 100 * L / Y)
           );
-          b = $ === 100, n.quiet || l(
+          E = H === 100, n.quiet || l(
             process.stdout,
-            `Downloading WordPress ${$}%...`,
-            b
+            `Downloading WordPress ${H}%...`,
+            E
           );
-        }), A = await ps(n.wp), me.log(
-          `Resolved WordPress release URL: ${A?.releaseUrl}`
+        }), C = await hs(n.wp), me.log(
+          `Resolved WordPress release URL: ${C?.releaseUrl}`
         );
       }
-      const S = A && Je.join(
+      const A = C && 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
+        `prebuilt-wp-content-for-wp-${C.version}.zip`
+      ), F = C ? ye.existsSync(A) ? ii(A) : await ri(
+        C.releaseUrl,
+        `${C.version}.zip`,
+        S
       ) : void 0;
       me.log("Fetching SQLite integration plugin...");
-      const F = n.skipSqliteSetup ? void 0 : await bs(P), y = n.followSymlinks === !0, D = n.experimentalTrace === !0;
+      const y = n.skipSqliteSetup ? void 0 : await Es(S), P = n.followSymlinks === !0, k = n.experimentalTrace === !0;
       try {
-        const b = n.mountBeforeInstall || [], E = n.mount || [], [M, ...O] = await v;
-        e = Yn(M), r.push({
+        const E = n.mountBeforeInstall || [], B = n.mount || [], [L, ...Y] = await R;
+        e = Yn(
+          L.phpPort
+        ), r.push({
           playground: e,
-          worker: M
-        }), await e.isConnected(), Zn(g, void 0, M), me.log("Booting WordPress...");
-        const $ = Math.floor(
-          Number.MAX_SAFE_INTEGER / h
+          worker: L.worker
+        }), await e.isConnected();
+        const H = await T();
+        me.log("Booting WordPress...");
+        const j = Math.floor(
+          Number.MAX_SAFE_INTEGER / b
         );
-        if (await e.boot({
+        if (await e.useFileLockManager(H), await e.boot({
           phpVersion: x.versions.php,
           wpVersion: x.versions.wp,
-          absoluteUrl: d,
-          mountsBeforeWpInstall: b,
-          mountsAfterWpInstall: E,
-          wordPressZip: R && await R.arrayBuffer(),
-          sqliteIntegrationPluginZip: await F.arrayBuffer(),
+          absoluteUrl: h,
+          mountsBeforeWpInstall: E,
+          mountsAfterWpInstall: B,
+          wordPressZip: F && await F.arrayBuffer(),
+          sqliteIntegrationPluginZip: await y.arrayBuffer(),
           firstProcessId: 0,
-          processIdSpaceLength: $,
-          followSymlinks: y,
-          trace: D
-        }), A && !n.mountBeforeInstall && !ye.existsSync(S) && (me.log(
+          processIdSpaceLength: j,
+          followSymlinks: P,
+          trace: k,
+          internalCookieStore: n.internalCookieStore
+        }), C && !n.mountBeforeInstall && !ye.existsSync(A) && (me.log(
           "Caching preinstalled WordPress for the next boot..."
         ), ye.writeFileSync(
-          S,
-          await Vn(e, "/wordpress")
-        ), 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) {
+          A,
+          await Zn(e, "/wordpress")
+        ), me.log("Cached!")), t = new Cs(e), await e.isReady(), O = !0, me.log("Booted!"), x && (me.log("Running the Blueprint..."), await us(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(
+          const K = await Zn(
             e,
             "/internal"
-          ), j = $;
+          ), G = j;
           await Promise.all(
-            O.map(async (G, K) => {
-              const te = Yn(G);
+            Y.map(async (re, Z) => {
+              const X = Yn(re.phpPort);
               r.push({
-                playground: te,
-                worker: G
-              }), await te.isConnected(), Zn(g, void 0, G);
-              const Z = j + K * $;
-              await te.boot({
+                playground: X,
+                worker: re.worker
+              }), await X.isConnected();
+              const $ = G + Z * j, J = await T();
+              await X.useFileLockManager(
+                J
+              ), await X.boot({
                 phpVersion: x.versions.php,
-                absoluteUrl: d,
-                mountsBeforeWpInstall: b,
-                mountsAfterWpInstall: E,
+                absoluteUrl: h,
+                mountsBeforeWpInstall: E,
+                mountsAfterWpInstall: B,
                 // Skip WordPress zip because we share the /wordpress directory
                 // populated by the initial worker.
                 wordPressZip: void 0,
@@ -8384,45 +8396,46 @@ async function Ac(n) {
                 // will copy it from primary's `/internal` directory.
                 sqliteIntegrationPluginZip: void 0,
                 dataSqlPath: "/wordpress/wp-content/database/.ht.sqlite",
-                firstProcessId: Z,
-                processIdSpaceLength: $,
-                followSymlinks: y,
-                trace: D
-              }), await te.isReady(), await te.writeFile(
+                firstProcessId: $,
+                processIdSpaceLength: j,
+                followSymlinks: P,
+                trace: k,
+                internalCookieStore: n.internalCookieStore
+              }), await X.isReady(), await X.writeFile(
                 "/tmp/internal.zip",
-                H
-              ), await us(
-                te,
+                K
+              ), await ds(
+                X,
                 "/tmp/internal.zip",
                 "/internal"
-              ), await te.unlink(
+              ), await X.unlink(
                 "/tmp/internal.zip"
-              ), t.addWorker(te);
+              ), t.addWorker(X);
             })
           ), me.log("Ready!");
         }
-        return me.log(`WordPress is running on ${d}`), {
+        return me.log(`WordPress is running on ${h}`), {
           playground: e,
-          server: C,
+          server: m,
           [Symbol.asyncDispose]: async function() {
             await Promise.all(
               r.map(
-                async ({ playground: j, worker: G }) => {
-                  await j.dispose(), await G.terminate();
+                async ({ playground: G, worker: re }) => {
+                  await G.dispose(), await re.terminate();
                 }
               )
-            ), await new Promise((j) => C.close(j));
+            ), await new Promise((G) => m.close(G));
           }
         };
-      } catch (b) {
+      } catch (E) {
         if (!n.debug)
-          throw b;
-        const E = await e.readFileAsText(ns);
-        throw new Error(E, { cause: b });
+          throw E;
+        const B = await e.readFileAsText(ts);
+        throw new Error(B, { cause: E });
       }
     },
-    async handleRequest(C) {
-      return T ? await t.handleRequest(C) : os.forHttpCode(
+    async handleRequest(m) {
+      return O ? await t.handleRequest(m) : ss.forHttpCode(
         502,
         "WordPress is not ready yet"
       );
@@ -8430,7 +8443,7 @@ async function Ac(n) {
   });
 }
 export {
-  jc as p,
-  Ac as r
+  Yc as p,
+  Rc as r
 };
-//# sourceMappingURL=run-cli-CbJy_CRO.js.map
+//# sourceMappingURL=run-cli-DyJ6_Vj8.js.map