@wp-playground/cli 1.1.2 → 1.1.4

package/cli.js

@@ -1,13 +1,15 @@
-import { SupportedPHPVersions as Mi } from "@php-wasm/universal";
-import { RecommendedPHPVersion as Wi } from "@wp-playground/common";
-import qi from "yargs";
-import { p as Mn, a as ji, r as Hi } from "./run-cli-_8y4VW5F.js";
-import Tt from "fs";
-import Ft from "path";
+import { SupportedPHPVersions as Wi } from "@php-wasm/universal";
+import { RecommendedPHPVersion as qi } from "@wp-playground/common";
+import ji from "yargs";
+import { cpus as Hi } from "os";
+import { r as Yi } from "./run-cli-CznLz9jO.js";
+import Ft, { existsSync as Hr } from "fs";
+import bt from "path";
 import { Semaphore as Tn } from "@php-wasm/util";
-import { resolveRemoteBlueprint as Yi } from "@wp-playground/blueprints";
-import { logger as Gi } from "@php-wasm/logger";
-function Vi(n) {
+import { resolveRemoteBlueprint as Gi } from "@wp-playground/blueprints";
+import { logger as Vi } from "@php-wasm/logger";
+import "@php-wasm/node";
+function Zi(n) {
   return /^latest$|^trunk$|^nightly$|^(?:(\d+)\.(\d+)(?:\.(\d+))?)((?:-beta(?:\d+)?)|(?:-RC(?:\d+)?))?$/.test(n);
 }
 new Tn({ concurrency: 15 });
@@ -33,7 +35,7 @@ class Fn extends Error {
     return !0;
   }
 }
-var Zi = {};
+var Ki = {};
 /*! crc32.js (C) 2014-present SheetJS -- http://sheetjs.com */
 (function(n) {
   (function(t) {
@@ -72,17 +74,17 @@ var Zi = {};
     }
     t.table = r, t.bstr = S, t.buf = T, t.str = F;
   });
-})(Zi);
-var Hr = {}, Jt = {};
-Jt.byteLength = $i;
-Jt.toByteArray = zi;
-Jt.fromByteArray = ts;
-var Pe = [], Fe = [], Ki = typeof Uint8Array < "u" ? Uint8Array : Array, nn = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-for (var st = 0, Xi = nn.length; st < Xi; ++st)
+})(Ki);
+var Yr = {}, Jt = {};
+Jt.byteLength = Ji;
+Jt.toByteArray = Qi;
+Jt.fromByteArray = ns;
+var Pe = [], Fe = [], Xi = typeof Uint8Array < "u" ? Uint8Array : Array, nn = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+for (var st = 0, $i = nn.length; st < $i; ++st)
   Pe[st] = nn[st], Fe[nn.charCodeAt(st)] = st;
 Fe[45] = 62;
 Fe[95] = 63;
-function Yr(n) {
+function Gr(n) {
   var t = n.length;
   if (t % 4 > 0)
     throw new Error("Invalid string. Length must be a multiple of 4");
@@ -91,30 +93,30 @@ function Yr(n) {
   var r = e === t ? 0 : 4 - e % 4;
   return [e, r];
 }
-function $i(n) {
-  var t = Yr(n), e = t[0], r = t[1];
+function Ji(n) {
+  var t = Gr(n), e = t[0], r = t[1];
   return (e + r) * 3 / 4 - r;
 }
-function Ji(n, t, e) {
+function zi(n, t, e) {
   return (t + e) * 3 / 4 - e;
 }
-function zi(n) {
-  var t, e = Yr(n), r = e[0], a = e[1], o = new Ki(Ji(n, r, a)), c = 0, l = a > 0 ? r - 4 : r, u;
+function Qi(n) {
+  var t, e = Gr(n), r = e[0], a = e[1], o = new Xi(zi(n, r, a)), c = 0, l = a > 0 ? r - 4 : r, u;
   for (u = 0; u < l; u += 4)
     t = Fe[n.charCodeAt(u)] << 18 | Fe[n.charCodeAt(u + 1)] << 12 | Fe[n.charCodeAt(u + 2)] << 6 | Fe[n.charCodeAt(u + 3)], o[c++] = t >> 16 & 255, o[c++] = t >> 8 & 255, o[c++] = t & 255;
   return a === 2 && (t = Fe[n.charCodeAt(u)] << 2 | Fe[n.charCodeAt(u + 1)] >> 4, o[c++] = t & 255), a === 1 && (t = Fe[n.charCodeAt(u)] << 10 | Fe[n.charCodeAt(u + 1)] << 4 | Fe[n.charCodeAt(u + 2)] >> 2, o[c++] = t >> 8 & 255, o[c++] = t & 255), o;
 }
-function Qi(n) {
+function es(n) {
   return Pe[n >> 18 & 63] + Pe[n >> 12 & 63] + Pe[n >> 6 & 63] + Pe[n & 63];
 }
-function es(n, t, e) {
+function ts(n, t, e) {
   for (var r, a = [], o = t; o < e; o += 3)
-    r = (n[o] << 16 & 16711680) + (n[o + 1] << 8 & 65280) + (n[o + 2] & 255), a.push(Qi(r));
+    r = (n[o] << 16 & 16711680) + (n[o + 1] << 8 & 65280) + (n[o + 2] & 255), a.push(es(r));
   return a.join("");
 }
-function ts(n) {
+function ns(n) {
   for (var t, e = n.length, r = e % 3, a = [], o = 16383, c = 0, l = e - r; c < l; c += o)
-    a.push(es(n, c, c + o > l ? l : c + o));
+    a.push(ts(n, c, c + o > l ? l : c + o));
   return r === 1 ? (t = n[e - 1], a.push(
     Pe[t >> 2] + Pe[t << 4 & 63] + "=="
   )) : r === 2 && (t = (n[e - 2] << 8) + n[e - 1], a.push(
@@ -304,7 +306,7 @@ Rn.write = function(n, t, e, r, a, o) {
         'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
       );
     if (i === s) return 0;
-    for (var d = i.length, y = s.length, L = 0, N = Math.min(d, y); L < N; ++L)
+    for (var d = i.length, y = s.length, L = 0, B = Math.min(d, y); L < B; ++L)
       if (i[L] !== s[L]) {
         d = i[L], y = s[L];
         break;
@@ -338,18 +340,18 @@ Rn.write = function(n, t, e, r, a, o) {
         s += i[d].length;
     var y = l.allocUnsafe(s), L = 0;
     for (d = 0; d < i.length; ++d) {
-      var N = i[d];
-      if (fe(N, Uint8Array))
-        L + N.length > y.length ? l.from(N).copy(y, L) : Uint8Array.prototype.set.call(
+      var B = i[d];
+      if (fe(B, Uint8Array))
+        L + B.length > y.length ? l.from(B).copy(y, L) : Uint8Array.prototype.set.call(
           y,
-          N,
+          B,
           L
         );
-      else if (l.isBuffer(N))
-        N.copy(y, L);
+      else if (l.isBuffer(B))
+        B.copy(y, L);
       else
         throw new TypeError('"list" argument must be an Array of Buffers');
-      L += N.length;
+      L += B.length;
     }
     return y;
   };
@@ -372,7 +374,7 @@ Rn.write = function(n, t, e, r, a, o) {
           return s;
         case "utf8":
         case "utf-8":
-          return Me(f).length;
+          return Ne(f).length;
         case "ucs2":
         case "ucs-2":
         case "utf16le":
@@ -384,7 +386,7 @@ Rn.write = function(n, t, e, r, a, o) {
           return ze(f).length;
         default:
           if (y)
-            return d ? -1 : Me(f).length;
+            return d ? -1 : Ne(f).length;
           i = ("" + i).toLowerCase(), y = !0;
       }
   }
@@ -466,12 +468,12 @@ Rn.write = function(n, t, e, r, a, o) {
     if (s >= d)
       return 1;
     if (s >>>= 0, d >>>= 0, y >>>= 0, L >>>= 0, this === i) return 0;
-    for (var N = L - y, $ = d - s, ne = Math.min(N, $), re = this.slice(y, L), pe = i.slice(s, d), te = 0; te < ne; ++te)
+    for (var B = L - y, $ = d - s, ne = Math.min(B, $), re = this.slice(y, L), pe = i.slice(s, d), te = 0; te < ne; ++te)
       if (re[te] !== pe[te]) {
-        N = re[te], $ = pe[te];
+        B = re[te], $ = pe[te];
         break;
       }
-    return N < $ ? -1 : $ < N ? 1 : 0;
+    return B < $ ? -1 : $ < B ? 1 : 0;
   };
   function T(f, i, s, d, y) {
     if (f.length === 0) return -1;
@@ -488,25 +490,25 @@ Rn.write = function(n, t, e, r, a, o) {
     throw new TypeError("val must be string, number or Buffer");
   }
   function F(f, i, s, d, y) {
-    var L = 1, N = f.length, $ = i.length;
+    var L = 1, B = f.length, $ = i.length;
     if (d !== void 0 && (d = String(d).toLowerCase(), d === "ucs2" || d === "ucs-2" || d === "utf16le" || d === "utf-16le")) {
       if (f.length < 2 || i.length < 2)
         return -1;
-      L = 2, N /= 2, $ /= 2, s /= 2;
+      L = 2, B /= 2, $ /= 2, s /= 2;
     }
-    function ne(At, mt) {
-      return L === 1 ? At[mt] : At.readUInt16BE(mt * L);
+    function ne(Tt, mt) {
+      return L === 1 ? Tt[mt] : Tt.readUInt16BE(mt * L);
     }
     var re;
     if (y) {
       var pe = -1;
-      for (re = s; re < N; re++)
+      for (re = s; re < B; re++)
         if (ne(f, re) === ne(i, pe === -1 ? 0 : re - pe)) {
           if (pe === -1 && (pe = re), re - pe + 1 === $) return pe * L;
         } else
           pe !== -1 && (re -= re - pe), pe = -1;
     } else
-      for (s + $ > N && (s = N - $), re = s; re >= 0; re--) {
+      for (s + $ > B && (s = B - $), re = s; re >= 0; re--) {
         for (var te = !0, He = 0; He < $; He++)
           if (ne(f, re + He) !== ne(i, He)) {
             te = !1;
@@ -529,15 +531,15 @@ Rn.write = function(n, t, e, r, a, o) {
     d ? (d = Number(d), d > y && (d = y)) : d = y;
     var L = i.length;
     d > L / 2 && (d = L / 2);
-    for (var N = 0; N < d; ++N) {
-      var $ = parseInt(i.substr(N * 2, 2), 16);
-      if (We($)) return N;
-      f[s + N] = $;
+    for (var B = 0; B < d; ++B) {
+      var $ = parseInt(i.substr(B * 2, 2), 16);
+      if (We($)) return B;
+      f[s + B] = $;
     }
-    return N;
+    return B;
   }
   function I(f, i, s, d) {
-    return we(Me(i, f.length - s), f, s, d);
+    return we(Ne(i, f.length - s), f, s, d);
   }
   function v(f, i, s, d) {
     return we(it(i), f, s, d);
@@ -563,7 +565,7 @@ Rn.write = function(n, t, e, r, a, o) {
     if ((d === void 0 || d > L) && (d = L), i.length > 0 && (d < 0 || s < 0) || s > this.length)
       throw new RangeError("Attempt to write outside buffer bounds");
     y || (y = "utf8");
-    for (var N = !1; ; )
+    for (var B = !1; ; )
       switch (y) {
         case "hex":
           return b(this, i, s, d);
@@ -582,8 +584,8 @@ Rn.write = function(n, t, e, r, a, o) {
         case "utf-16le":
           return W(this, i, s, d);
         default:
-          if (N) throw new TypeError("Unknown encoding: " + y);
-          y = ("" + y).toLowerCase(), N = !0;
+          if (B) throw new TypeError("Unknown encoding: " + y);
+          y = ("" + y).toLowerCase(), B = !0;
       }
   }, l.prototype.toJSON = function() {
     return {
@@ -597,24 +599,24 @@ Rn.write = function(n, t, e, r, a, o) {
   function Z(f, i, s) {
     s = Math.min(f.length, s);
     for (var d = [], y = i; y < s; ) {
-      var L = f[y], N = null, $ = L > 239 ? 4 : L > 223 ? 3 : L > 191 ? 2 : 1;
+      var L = f[y], B = null, $ = L > 239 ? 4 : L > 223 ? 3 : L > 191 ? 2 : 1;
       if (y + $ <= s) {
         var ne, re, pe, te;
         switch ($) {
           case 1:
-            L < 128 && (N = L);
+            L < 128 && (B = L);
             break;
           case 2:
-            ne = f[y + 1], (ne & 192) === 128 && (te = (L & 31) << 6 | ne & 63, te > 127 && (N = te));
+            ne = f[y + 1], (ne & 192) === 128 && (te = (L & 31) << 6 | ne & 63, te > 127 && (B = te));
             break;
           case 3:
-            ne = f[y + 1], re = f[y + 2], (ne & 192) === 128 && (re & 192) === 128 && (te = (L & 15) << 12 | (ne & 63) << 6 | re & 63, te > 2047 && (te < 55296 || te > 57343) && (N = te));
+            ne = f[y + 1], re = f[y + 2], (ne & 192) === 128 && (re & 192) === 128 && (te = (L & 15) << 12 | (ne & 63) << 6 | re & 63, te > 2047 && (te < 55296 || te > 57343) && (B = te));
             break;
           case 4:
-            ne = f[y + 1], re = f[y + 2], pe = f[y + 3], (ne & 192) === 128 && (re & 192) === 128 && (pe & 192) === 128 && (te = (L & 15) << 18 | (ne & 63) << 12 | (re & 63) << 6 | pe & 63, te > 65535 && te < 1114112 && (N = te));
+            ne = f[y + 1], re = f[y + 2], pe = f[y + 3], (ne & 192) === 128 && (re & 192) === 128 && (pe & 192) === 128 && (te = (L & 15) << 18 | (ne & 63) << 12 | (re & 63) << 6 | pe & 63, te > 65535 && te < 1114112 && (B = te));
         }
       }
-      N === null ? (N = 65533, $ = 1) : N > 65535 && (N -= 65536, d.push(N >>> 10 & 1023 | 55296), N = 56320 | N & 1023), d.push(N), y += $;
+      B === null ? (B = 65533, $ = 1) : B > 65535 && (B -= 65536, d.push(B >>> 10 & 1023 | 55296), B = 56320 | B & 1023), d.push(B), y += $;
     }
     return j(d);
   }
@@ -668,8 +670,8 @@ Rn.write = function(n, t, e, r, a, o) {
   }
   l.prototype.readUintLE = l.prototype.readUIntLE = function(i, s, d) {
     i = i >>> 0, s = s >>> 0, d || z(i, s, this.length);
-    for (var y = this[i], L = 1, N = 0; ++N < s && (L *= 256); )
-      y += this[i + N] * L;
+    for (var y = this[i], L = 1, B = 0; ++B < s && (L *= 256); )
+      y += this[i + B] * L;
     return y;
   }, l.prototype.readUintBE = l.prototype.readUIntBE = function(i, s, d) {
     i = i >>> 0, s = s >>> 0, d || z(i, s, this.length);
@@ -688,14 +690,14 @@ Rn.write = function(n, t, e, r, a, o) {
     return i = i >>> 0, s || z(i, 4, this.length), this[i] * 16777216 + (this[i + 1] << 16 | this[i + 2] << 8 | this[i + 3]);
   }, l.prototype.readIntLE = function(i, s, d) {
     i = i >>> 0, s = s >>> 0, d || z(i, s, this.length);
-    for (var y = this[i], L = 1, N = 0; ++N < s && (L *= 256); )
-      y += this[i + N] * L;
+    for (var y = this[i], L = 1, B = 0; ++B < s && (L *= 256); )
+      y += this[i + B] * L;
     return L *= 128, y >= L && (y -= Math.pow(2, 8 * s)), y;
   }, l.prototype.readIntBE = function(i, s, d) {
     i = i >>> 0, s = s >>> 0, d || z(i, s, this.length);
-    for (var y = s, L = 1, N = this[i + --y]; y > 0 && (L *= 256); )
-      N += this[i + --y] * L;
-    return L *= 128, N >= L && (N -= Math.pow(2, 8 * s)), N;
+    for (var y = s, L = 1, B = this[i + --y]; y > 0 && (L *= 256); )
+      B += this[i + --y] * L;
+    return L *= 128, B >= L && (B -= Math.pow(2, 8 * s)), B;
   }, l.prototype.readInt8 = function(i, s) {
     return i = i >>> 0, s || z(i, 1, this.length), this[i] & 128 ? (255 - this[i] + 1) * -1 : this[i];
   }, l.prototype.readInt16LE = function(i, s) {
@@ -729,18 +731,18 @@ Rn.write = function(n, t, e, r, a, o) {
       var L = Math.pow(2, 8 * d) - 1;
       Y(this, i, s, d, L, 0);
     }
-    var N = 1, $ = 0;
-    for (this[s] = i & 255; ++$ < d && (N *= 256); )
-      this[s + $] = i / N & 255;
+    var B = 1, $ = 0;
+    for (this[s] = i & 255; ++$ < d && (B *= 256); )
+      this[s + $] = i / B & 255;
     return s + d;
   }, l.prototype.writeUintBE = l.prototype.writeUIntBE = function(i, s, d, y) {
     if (i = +i, s = s >>> 0, d = d >>> 0, !y) {
       var L = Math.pow(2, 8 * d) - 1;
       Y(this, i, s, d, L, 0);
     }
-    var N = d - 1, $ = 1;
-    for (this[s + N] = i & 255; --N >= 0 && ($ *= 256); )
-      this[s + N] = i / $ & 255;
+    var B = d - 1, $ = 1;
+    for (this[s + B] = i & 255; --B >= 0 && ($ *= 256); )
+      this[s + B] = i / $ & 255;
     return s + d;
   }, l.prototype.writeUint8 = l.prototype.writeUInt8 = function(i, s, d) {
     return i = +i, s = s >>> 0, d || Y(this, i, s, 1, 255, 0), this[s] = i & 255, s + 1;
@@ -757,18 +759,18 @@ Rn.write = function(n, t, e, r, a, o) {
       var L = Math.pow(2, 8 * d - 1);
       Y(this, i, s, d, L - 1, -L);
     }
-    var N = 0, $ = 1, ne = 0;
-    for (this[s] = i & 255; ++N < d && ($ *= 256); )
-      i < 0 && ne === 0 && this[s + N - 1] !== 0 && (ne = 1), this[s + N] = (i / $ >> 0) - ne & 255;
+    var B = 0, $ = 1, ne = 0;
+    for (this[s] = i & 255; ++B < d && ($ *= 256); )
+      i < 0 && ne === 0 && this[s + B - 1] !== 0 && (ne = 1), this[s + B] = (i / $ >> 0) - ne & 255;
     return s + d;
   }, l.prototype.writeIntBE = function(i, s, d, y) {
     if (i = +i, s = s >>> 0, !y) {
       var L = Math.pow(2, 8 * d - 1);
       Y(this, i, s, d, L - 1, -L);
     }
-    var N = d - 1, $ = 1, ne = 0;
-    for (this[s + N] = i & 255; --N >= 0 && ($ *= 256); )
-      i < 0 && ne === 0 && this[s + N + 1] !== 0 && (ne = 1), this[s + N] = (i / $ >> 0) - ne & 255;
+    var B = d - 1, $ = 1, ne = 0;
+    for (this[s + B] = i & 255; --B >= 0 && ($ *= 256); )
+      i < 0 && ne === 0 && this[s + B + 1] !== 0 && (ne = 1), this[s + B] = (i / $ >> 0) - ne & 255;
     return s + d;
   }, l.prototype.writeInt8 = function(i, s, d) {
     return i = +i, s = s >>> 0, d || Y(this, i, s, 1, 127, -128), i < 0 && (i = 255 + i + 1), this[s] = i & 255, s + 1;
@@ -830,16 +832,16 @@ Rn.write = function(n, t, e, r, a, o) {
     if (d <= s)
       return this;
     s = s >>> 0, d = d === void 0 ? this.length : d >>> 0, i || (i = 0);
-    var N;
+    var B;
     if (typeof i == "number")
-      for (N = s; N < d; ++N)
-        this[N] = i;
+      for (B = s; B < d; ++B)
+        this[B] = i;
     else {
       var $ = l.isBuffer(i) ? i : l.from(i, y), ne = $.length;
       if (ne === 0)
         throw new TypeError('The value "' + i + '" is invalid for argument "value"');
-      for (N = 0; N < d - s; ++N)
-        this[N + s] = $[N % ne];
+      for (B = 0; B < d - s; ++B)
+        this[B + s] = $[B % ne];
     }
     return this;
   };
@@ -850,15 +852,15 @@ Rn.write = function(n, t, e, r, a, o) {
       f = f + "=";
     return f;
   }
-  function Me(f, i) {
+  function Ne(f, i) {
     i = i || 1 / 0;
-    for (var s, d = f.length, y = null, L = [], N = 0; N < d; ++N) {
-      if (s = f.charCodeAt(N), s > 55295 && s < 57344) {
+    for (var s, d = f.length, y = null, L = [], B = 0; B < d; ++B) {
+      if (s = f.charCodeAt(B), s > 55295 && s < 57344) {
         if (!y) {
           if (s > 56319) {
             (i -= 3) > -1 && L.push(239, 191, 189);
             continue;
-          } else if (N + 1 === d) {
+          } else if (B + 1 === d) {
             (i -= 3) > -1 && L.push(239, 191, 189);
             continue;
           }
@@ -906,8 +908,8 @@ Rn.write = function(n, t, e, r, a, o) {
     return i;
   }
   function Je(f, i) {
-    for (var s, d, y, L = [], N = 0; N < f.length && !((i -= 2) < 0); ++N)
-      s = f.charCodeAt(N), d = s >> 8, y = s % 256, L.push(y), L.push(d);
+    for (var s, d, y, L = [], B = 0; B < f.length && !((i -= 2) < 0); ++B)
+      s = f.charCodeAt(B), d = s >> 8, y = s % 256, L.push(y), L.push(d);
     return L;
   }
   function ze(f) {
@@ -930,7 +932,7 @@ Rn.write = function(n, t, e, r, a, o) {
         i[d + y] = f[s] + f[y];
     return i;
   }();
-})(Hr);
+})(Yr);
 class Cn extends Fn {
   /**
    * @param {string} oid
@@ -945,15 +947,15 @@ class Cn extends Fn {
   }
 }
 Cn.code = "ObjectTypeError";
-typeof window < "u" && (window.Buffer = Hr.Buffer);
-const Gr = function() {
+typeof window < "u" && (window.Buffer = Yr.Buffer);
+const Vr = 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 (Gr === "NODE") {
+if (Vr === "NODE") {
   let n = function(e) {
     return new Promise(function(r, a) {
       e.onload = e.onerror = function(o) {
@@ -1004,7 +1006,7 @@ if (Gr === "NODE") {
     });
   });
 }
-if (Gr === "NODE" && typeof CustomEvent > "u") {
+if (Vr === "NODE" && typeof CustomEvent > "u") {
   class n extends Event {
     constructor(e, r = {}) {
       super(e, r), this.detail = r.detail;
@@ -1014,7 +1016,7 @@ if (Gr === "NODE" && typeof CustomEvent > "u") {
   }
   globalThis.CustomEvent = n;
 }
-function ns(...n) {
+function rs(...n) {
   const t = new Uint8Array(
     n.reduce((r, a) => r + a.length, 0)
   );
@@ -1023,12 +1025,12 @@ function ns(...n) {
     t.set(r, e), e += r.length;
   return t;
 }
-function rs(n) {
+function is(n) {
   {
     let t = new Uint8Array();
     return new TransformStream({
       transform(e) {
-        t = ns(t, e);
+        t = rs(t, e);
       },
       flush(e) {
         e.enqueue(t);
@@ -1036,8 +1038,8 @@ function rs(n) {
     });
   }
 }
-async function is(n, t) {
-  return await n.pipeThrough(rs()).getReader().read().then(({ value: e }) => e);
+async function ss(n, t) {
+  return await n.pipeThrough(is()).getReader().read().then(({ value: e }) => e);
 }
 class Yt extends File {
   /**
@@ -1080,7 +1082,7 @@ class Yt extends File {
    * @returns File data as an ArrayBuffer.
    */
   async arrayBuffer() {
-    return await is(this.stream());
+    return await ss(this.stream());
   }
 }
 ReadableStream.prototype[Symbol.asyncIterator] || (ReadableStream.prototype[Symbol.asyncIterator] = async function* () {
@@ -1098,14 +1100,14 @@ ReadableStream.prototype[Symbol.asyncIterator] || (ReadableStream.prototype[Symb
 }, ReadableStream.prototype.iterate = // @ts-ignore
 ReadableStream.prototype[Symbol.asyncIterator]);
 new Tn({ concurrency: 10 });
-const bt = 15, gn = 30, bn = 19, ss = 29, Gt = 256, In = Gt + 1 + ss, Wn = 2 * In + 1, ht = 256, as = 7, qn = 16, jn = 17, Hn = 18, rn = 8 * 2, Vt = -1, os = 1, Rt = 2, cs = 0, lt = 0, Yn = 1, ls = 3, Ee = 4, Le = 0, Vr = 1, Ct = 2, Ue = -2, fs = -3, at = -5;
+const yt = 15, gn = 30, bn = 19, as = 29, Gt = 256, In = Gt + 1 + as, Nn = 2 * In + 1, ht = 256, os = 7, Wn = 16, qn = 17, jn = 18, rn = 8 * 2, Vt = -1, cs = 1, Rt = 2, ls = 0, lt = 0, Hn = 1, fs = 3, Ee = 4, Le = 0, Zr = 1, Ct = 2, Ue = -2, us = -3, at = -5;
 function zt(n) {
   return Qt(n.map(([t, e]) => new Array(t).fill(e, 0, t)));
 }
 function Qt(n) {
   return n.reduce((t, e) => t.concat(Array.isArray(e) ? Qt(e) : e), []);
 }
-const Gn = [0, 1, 2, 3].concat(...zt([
+const Yn = [0, 1, 2, 3].concat(...zt([
   [2, 4],
   [2, 5],
   [4, 6],
@@ -1139,9 +1141,9 @@ function ie() {
   function t(a) {
     const o = n.dyn_tree, c = n.stat_desc.static_tree, l = n.stat_desc.extra_bits, u = n.stat_desc.extra_base, g = n.stat_desc.max_length;
     let x, w, _, A, P, h, p = 0;
-    for (A = 0; A <= bt; A++)
+    for (A = 0; A <= yt; A++)
       a.bl_count[A] = 0;
-    for (o[a.heap[a.heap_max] * 2 + 1] = 0, x = a.heap_max + 1; x < Wn; x++)
+    for (o[a.heap[a.heap_max] * 2 + 1] = 0, x = a.heap_max + 1; x < Nn; x++)
       w = a.heap[x], A = o[o[w * 2 + 1] * 2 + 1] + 1, A > g && (A = g, p++), o[w * 2 + 1] = A, !(w > n.max_code) && (a.bl_count[A]++, P = 0, w >= u && (P = l[w - u]), h = o[w * 2], a.opt_len += h * (A + P), c && (a.static_len += h * (c[w * 2 + 1] + P)));
     if (p !== 0) {
       do {
@@ -1164,7 +1166,7 @@ function ie() {
   function r(a, o, c) {
     const l = [];
     let u = 0, g, x, w;
-    for (g = 1; g <= bt; g++)
+    for (g = 1; g <= yt; g++)
       l[g] = u = u + c[g - 1] << 1;
     for (x = 0; x <= o; x++)
       w = a[x * 2 + 1], w !== 0 && (a[x * 2] = e(l[w]++, w));
@@ -1172,7 +1174,7 @@ function ie() {
   n.build_tree = function(a) {
     const o = n.dyn_tree, c = n.stat_desc.static_tree, l = n.stat_desc.elems;
     let u, g, x = -1, w;
-    for (a.heap_len = 0, a.heap_max = Wn, u = 0; u < l; u++)
+    for (a.heap_len = 0, a.heap_max = Nn, u = 0; u < l; u++)
       o[u * 2] !== 0 ? (a.heap[++a.heap_len] = x = u, a.depth[u] = 0) : o[u * 2 + 1] = 0;
     for (; a.heap_len < 2; )
       w = a.heap[++a.heap_len] = x < 2 ? ++x : 0, o[w * 2] = 1, a.depth[w] = 0, a.opt_len--, c && (a.static_len -= c[w * 2 + 1]);
@@ -1242,7 +1244,7 @@ ie.base_dist = [
   24576
 ];
 ie.d_code = function(n) {
-  return n < 256 ? Gn[n] : Gn[256 + (n >>> 7)];
+  return n < 256 ? Yn[n] : Yn[256 + (n >>> 7)];
 };
 ie.extra_lbits = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0];
 ie.extra_dbits = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13];
@@ -1252,7 +1254,7 @@ function xe(n, t, e, r, a) {
   const o = this;
   o.static_tree = n, o.extra_bits = t, o.extra_base = e, o.elems = r, o.max_length = a;
 }
-const us = [
+const ds = [
   12,
   140,
   76,
@@ -1541,23 +1543,23 @@ const us = [
   163,
   99,
   227
-], ds = zt([[144, 8], [112, 9], [24, 7], [8, 8]]);
-xe.static_ltree = Qt(us.map((n, t) => [n, ds[t]]));
-const ps = [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], ms = zt([[30, 5]]);
-xe.static_dtree = Qt(ps.map((n, t) => [n, ms[t]]));
-xe.static_l_desc = new xe(xe.static_ltree, ie.extra_lbits, Gt + 1, In, bt);
-xe.static_d_desc = new xe(xe.static_dtree, ie.extra_dbits, 0, gn, bt);
-xe.static_bl_desc = new xe(null, ie.extra_blbits, 0, bn, as);
-const hs = 9, xs = 8;
+], ps = zt([[144, 8], [112, 9], [24, 7], [8, 8]]);
+xe.static_ltree = Qt(ds.map((n, t) => [n, ps[t]]));
+const ms = [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], hs = zt([[30, 5]]);
+xe.static_dtree = Qt(ms.map((n, t) => [n, hs[t]]));
+xe.static_l_desc = new xe(xe.static_ltree, ie.extra_lbits, Gt + 1, In, yt);
+xe.static_d_desc = new xe(xe.static_dtree, ie.extra_dbits, 0, gn, yt);
+xe.static_bl_desc = new xe(null, ie.extra_blbits, 0, bn, os);
+const xs = 9, ws = 8;
 function Oe(n, t, e, r, a) {
   const o = this;
   o.good_length = n, o.max_lazy = t, o.nice_length = e, o.max_chain = r, o.func = a;
 }
-const Zr = 0, Mt = 1, et = 2, De = [
-  new Oe(0, 0, 0, 0, Zr),
-  new Oe(4, 4, 8, 4, Mt),
-  new Oe(4, 5, 16, 8, Mt),
-  new Oe(4, 6, 32, 32, Mt),
+const Kr = 0, Nt = 1, et = 2, De = [
+  new Oe(0, 0, 0, 0, Kr),
+  new Oe(4, 4, 8, 4, Nt),
+  new Oe(4, 5, 16, 8, Nt),
+  new Oe(4, 6, 32, 32, Nt),
   new Oe(4, 4, 16, 16, et),
   new Oe(8, 16, 32, 32, et),
   new Oe(8, 16, 128, 128, et),
@@ -1585,12 +1587,12 @@ const Zr = 0, Mt = 1, et = 2, De = [
   "",
   // Z_VERSION_ERROR (-6)
   ""
-], Te = 0, Dt = 1, xt = 2, Lt = 3, ws = 32, sn = 42, Ut = 113, wt = 666, an = 8, _s = 0, on = 1, gs = 2, ae = 3, Wt = 258, Se = Wt + ae + 1;
-function Vn(n, t, e, r) {
+], Te = 0, Dt = 1, xt = 2, Lt = 3, _s = 32, sn = 42, Ut = 113, wt = 666, an = 8, gs = 0, on = 1, bs = 2, ae = 3, Wt = 258, Se = Wt + ae + 1;
+function Gn(n, t, e, r) {
   const a = n[t * 2], o = n[e * 2];
   return a < o || a == o && r[t] <= r[e];
 }
-function bs() {
+function ys() {
   const n = this;
   let t, e, r, a, o, c, l, u, g, x, w, _, A, P, h, p, m, E, R, D, S, T, F, b, I, v, k, W, O, Z, H, j, K;
   const X = new ie(), oe = new ie(), G = new ie();
@@ -1603,7 +1605,7 @@ function bs() {
       w[C] = 0;
     v = De[k].max_lazy, O = De[k].good_length, Z = De[k].nice_length, I = De[k].max_chain, S = 0, m = 0, F = 0, E = b = ae - 1, D = 0, _ = 0;
   }
-  function Me() {
+  function Ne() {
     let C;
     for (C = 0; C < In; C++)
       H[C * 2] = 0;
@@ -1614,20 +1616,20 @@ function bs() {
     H[ht * 2] = 1, n.opt_len = n.static_len = 0, Y = ee = 0;
   }
   function it() {
-    X.dyn_tree = H, X.stat_desc = xe.static_l_desc, oe.dyn_tree = j, oe.stat_desc = xe.static_d_desc, G.dyn_tree = K, G.stat_desc = xe.static_bl_desc, de = 0, le = 0, Ce = 8, Me();
-  }
-  n.pqdownheap = function(C, B) {
-    const U = n.heap, M = U[B];
-    let q = B << 1;
-    for (; q <= n.heap_len && (q < n.heap_len && Vn(C, U[q + 1], U[q], n.depth) && q++, !Vn(C, M, U[q], n.depth)); )
-      U[B] = U[q], B = q, q <<= 1;
-    U[B] = M;
+    X.dyn_tree = H, X.stat_desc = xe.static_l_desc, oe.dyn_tree = j, oe.stat_desc = xe.static_d_desc, G.dyn_tree = K, G.stat_desc = xe.static_bl_desc, de = 0, le = 0, Ce = 8, Ne();
+  }
+  n.pqdownheap = function(C, M) {
+    const U = n.heap, N = U[M];
+    let q = M << 1;
+    for (; q <= n.heap_len && (q < n.heap_len && Gn(C, U[q + 1], U[q], n.depth) && q++, !Gn(C, N, U[q], n.depth)); )
+      U[M] = U[q], M = q, q <<= 1;
+    U[M] = N;
   };
-  function Je(C, B) {
-    let U = -1, M, q = C[0 * 2 + 1], V = 0, J = 7, ge = 4;
-    q === 0 && (J = 138, ge = 3), C[(B + 1) * 2 + 1] = 65535;
-    for (let Ie = 0; Ie <= B; Ie++)
-      M = q, q = C[(Ie + 1) * 2 + 1], !(++V < J && M == q) && (V < ge ? K[M * 2] += V : M !== 0 ? (M != U && K[M * 2]++, K[qn * 2]++) : V <= 10 ? K[jn * 2]++ : K[Hn * 2]++, V = 0, U = M, q === 0 ? (J = 138, ge = 3) : M == q ? (J = 6, ge = 3) : (J = 7, ge = 4));
+  function Je(C, M) {
+    let U = -1, N, q = C[0 * 2 + 1], V = 0, J = 7, ge = 4;
+    q === 0 && (J = 138, ge = 3), C[(M + 1) * 2 + 1] = 65535;
+    for (let Ie = 0; Ie <= M; Ie++)
+      N = q, q = C[(Ie + 1) * 2 + 1], !(++V < J && N == q) && (V < ge ? K[N * 2] += V : N !== 0 ? (N != U && K[N * 2]++, K[Wn * 2]++) : V <= 10 ? K[qn * 2]++ : K[jn * 2]++, V = 0, U = N, q === 0 ? (J = 138, ge = 3) : N == q ? (J = 6, ge = 3) : (J = 7, ge = 4));
   }
   function ze() {
     let C;
@@ -1644,32 +1646,32 @@ function bs() {
   function We(C) {
     we(C >> 8 & 255), we(C & 255 & 255);
   }
-  function ue(C, B) {
+  function ue(C, M) {
     let U;
-    const M = B;
-    le > rn - M ? (U = C, de |= U << le & 65535, fe(de), de = U >>> rn - le, le += M - rn) : (de |= C << le & 65535, le += M);
+    const N = M;
+    le > rn - N ? (U = C, de |= U << le & 65535, fe(de), de = U >>> rn - le, le += N - rn) : (de |= C << le & 65535, le += N);
   }
-  function f(C, B) {
+  function f(C, M) {
     const U = C * 2;
-    ue(B[U] & 65535, B[U + 1] & 65535);
+    ue(M[U] & 65535, M[U + 1] & 65535);
   }
-  function i(C, B) {
-    let U, M = -1, q, V = C[0 * 2 + 1], J = 0, ge = 7, Ie = 4;
-    for (V === 0 && (ge = 138, Ie = 3), U = 0; U <= B; U++)
+  function i(C, M) {
+    let U, N = -1, q, V = C[0 * 2 + 1], J = 0, ge = 7, Ie = 4;
+    for (V === 0 && (ge = 138, Ie = 3), U = 0; U <= M; U++)
       if (q = V, V = C[(U + 1) * 2 + 1], !(++J < ge && q == V)) {
         if (J < Ie)
           do
             f(q, K);
           while (--J !== 0);
-        else q !== 0 ? (q != M && (f(q, K), J--), f(qn, K), ue(J - 3, 2)) : J <= 10 ? (f(jn, K), ue(J - 3, 3)) : (f(Hn, K), ue(J - 11, 7));
-        J = 0, M = q, V === 0 ? (ge = 138, Ie = 3) : q == V ? (ge = 6, Ie = 3) : (ge = 7, Ie = 4);
+        else q !== 0 ? (q != N && (f(q, K), J--), f(Wn, K), ue(J - 3, 2)) : J <= 10 ? (f(qn, K), ue(J - 3, 3)) : (f(jn, K), ue(J - 11, 7));
+        J = 0, N = q, V === 0 ? (ge = 138, Ie = 3) : q == V ? (ge = 6, Ie = 3) : (ge = 7, Ie = 4);
       }
   }
-  function s(C, B, U) {
-    let M;
-    for (ue(C - 257, 5), ue(B - 1, 5), ue(U - 4, 4), M = 0; M < U; M++)
-      ue(K[ie.bl_order[M] * 2 + 1], 3);
-    i(H, C - 1), i(j, B - 1);
+  function s(C, M, U) {
+    let N;
+    for (ue(C - 257, 5), ue(M - 1, 5), ue(U - 4, 4), N = 0; N < U; N++)
+      ue(K[ie.bl_order[N] * 2 + 1], 3);
+    i(H, C - 1), i(j, M - 1);
   }
   function d() {
     le == 16 ? (fe(de), de = 0, le = 0) : le >= 8 && (we(de & 255), de >>>= 8, le -= 8);
@@ -1677,101 +1679,101 @@ function bs() {
   function y() {
     ue(on << 1, 3), f(ht, xe.static_ltree), d(), 1 + Ce + 10 - le < 9 && (ue(on << 1, 3), f(ht, xe.static_ltree), d()), Ce = 7;
   }
-  function L(C, B) {
-    let U, M, q;
-    if (n.dist_buf[Y] = C, n.lc_buf[Y] = B & 255, Y++, C === 0 ? H[B * 2]++ : (ee++, C--, H[(ie._length_code[B] + Gt + 1) * 2]++, j[ie.d_code(C) * 2]++), !(Y & 8191) && k > 2) {
-      for (U = Y * 8, M = S - m, q = 0; q < gn; q++)
+  function L(C, M) {
+    let U, N, q;
+    if (n.dist_buf[Y] = C, n.lc_buf[Y] = M & 255, Y++, C === 0 ? H[M * 2]++ : (ee++, C--, H[(ie._length_code[M] + Gt + 1) * 2]++, j[ie.d_code(C) * 2]++), !(Y & 8191) && k > 2) {
+      for (U = Y * 8, N = S - m, q = 0; q < gn; q++)
         U += j[q * 2] * (5 + ie.extra_dbits[q]);
-      if (U >>>= 3, ee < Math.floor(Y / 2) && U < Math.floor(M / 2))
+      if (U >>>= 3, ee < Math.floor(Y / 2) && U < Math.floor(N / 2))
         return !0;
     }
     return Y == z - 1;
   }
-  function N(C, B) {
-    let U, M, q = 0, V, J;
+  function B(C, M) {
+    let U, N, q = 0, V, J;
     if (Y !== 0)
       do
-        U = n.dist_buf[q], M = n.lc_buf[q], q++, U === 0 ? f(M, C) : (V = ie._length_code[M], f(V + Gt + 1, C), J = ie.extra_lbits[V], J !== 0 && (M -= ie.base_length[V], ue(M, J)), U--, V = ie.d_code(U), f(V, B), J = ie.extra_dbits[V], J !== 0 && (U -= ie.base_dist[V], ue(U, J)));
+        U = n.dist_buf[q], N = n.lc_buf[q], q++, U === 0 ? f(N, C) : (V = ie._length_code[N], f(V + Gt + 1, C), J = ie.extra_lbits[V], J !== 0 && (N -= ie.base_length[V], ue(N, J)), U--, V = ie.d_code(U), f(V, M), J = ie.extra_dbits[V], J !== 0 && (U -= ie.base_dist[V], ue(U, J)));
       while (q < Y);
     f(ht, C), Ce = C[ht * 2 + 1];
   }
   function $() {
     le > 8 ? fe(de) : le > 0 && we(de & 255), de = 0, le = 0;
   }
-  function ne(C, B, U) {
-    $(), Ce = 8, fe(B), fe(~B), n.pending_buf.set(u.subarray(C, C + B), n.pending), n.pending += B;
+  function ne(C, M, U) {
+    $(), Ce = 8, fe(M), fe(~M), n.pending_buf.set(u.subarray(C, C + M), n.pending), n.pending += M;
   }
-  function re(C, B, U) {
-    ue((_s << 1) + (U ? 1 : 0), 3), ne(C, B);
+  function re(C, M, U) {
+    ue((gs << 1) + (U ? 1 : 0), 3), ne(C, M);
   }
-  function pe(C, B, U) {
-    let M, q, V = 0;
-    k > 0 ? (X.build_tree(n), oe.build_tree(n), V = ze(), M = n.opt_len + 3 + 7 >>> 3, q = n.static_len + 3 + 7 >>> 3, q <= M && (M = q)) : M = q = B + 5, B + 4 <= M && C != -1 ? re(C, B, U) : q == M ? (ue((on << 1) + (U ? 1 : 0), 3), N(xe.static_ltree, xe.static_dtree)) : (ue((gs << 1) + (U ? 1 : 0), 3), s(X.max_code + 1, oe.max_code + 1, V + 1), N(H, j)), Me(), U && $();
+  function pe(C, M, U) {
+    let N, q, V = 0;
+    k > 0 ? (X.build_tree(n), oe.build_tree(n), V = ze(), N = n.opt_len + 3 + 7 >>> 3, q = n.static_len + 3 + 7 >>> 3, q <= N && (N = q)) : N = q = M + 5, M + 4 <= N && C != -1 ? re(C, M, U) : q == N ? (ue((on << 1) + (U ? 1 : 0), 3), B(xe.static_ltree, xe.static_dtree)) : (ue((bs << 1) + (U ? 1 : 0), 3), s(X.max_code + 1, oe.max_code + 1, V + 1), B(H, j)), Ne(), U && $();
   }
   function te(C) {
     pe(m >= 0 ? m : -1, S - m, C), m = S, t.flush_pending();
   }
   function He() {
-    let C, B, U, M;
+    let C, M, U, N;
     do {
-      if (M = g - F - S, M === 0 && S === 0 && F === 0)
-        M = o;
-      else if (M == -1)
-        M--;
+      if (N = g - F - S, N === 0 && S === 0 && F === 0)
+        N = o;
+      else if (N == -1)
+        N--;
       else if (S >= o + o - Se) {
         u.set(u.subarray(o, o + o), 0), T -= o, S -= o, m -= o, C = A, U = C;
         do
-          B = w[--U] & 65535, w[U] = B >= o ? B - o : 0;
+          M = w[--U] & 65535, w[U] = M >= o ? M - o : 0;
         while (--C !== 0);
         C = o, U = C;
         do
-          B = x[--U] & 65535, x[U] = B >= o ? B - o : 0;
+          M = x[--U] & 65535, x[U] = M >= o ? M - o : 0;
         while (--C !== 0);
-        M += o;
+        N += o;
       }
       if (t.avail_in === 0)
         return;
-      C = t.read_buf(u, S + F, M), F += C, F >= ae && (_ = u[S] & 255, _ = (_ << p ^ u[S + 1] & 255) & h);
+      C = t.read_buf(u, S + F, N), F += C, F >= ae && (_ = u[S] & 255, _ = (_ << p ^ u[S + 1] & 255) & h);
     } while (F < Se && t.avail_in !== 0);
   }
-  function At(C) {
-    let B = 65535, U;
-    for (B > r - 5 && (B = r - 5); ; ) {
+  function Tt(C) {
+    let M = 65535, U;
+    for (M > r - 5 && (M = r - 5); ; ) {
       if (F <= 1) {
         if (He(), F === 0 && C == lt)
           return Te;
         if (F === 0)
           break;
       }
-      if (S += F, F = 0, U = m + B, (S === 0 || S >= U) && (F = S - U, S = U, te(!1), t.avail_out === 0) || S - m >= o - Se && (te(!1), t.avail_out === 0))
+      if (S += F, F = 0, U = m + M, (S === 0 || S >= U) && (F = S - U, S = U, te(!1), t.avail_out === 0) || S - m >= o - Se && (te(!1), t.avail_out === 0))
         return Te;
     }
     return te(C == Ee), t.avail_out === 0 ? C == Ee ? xt : Te : C == Ee ? Lt : Dt;
   }
   function mt(C) {
-    let B = I, U = S, M, q, V = b;
+    let M = I, U = S, N, q, V = b;
     const J = S > o - Se ? S - (o - Se) : 0;
     let ge = Z;
     const Ie = l, tn = S + Wt;
-    let Bn = u[U + V - 1], Nn = u[U + V];
-    b >= O && (B >>= 2), ge > F && (ge = F);
+    let Mn = u[U + V - 1], Bn = u[U + V];
+    b >= O && (M >>= 2), ge > F && (ge = F);
     do
-      if (M = C, !(u[M + V] != Nn || u[M + V - 1] != Bn || u[M] != u[U] || u[++M] != u[U + 1])) {
-        U += 2, M++;
+      if (N = C, !(u[N + V] != Bn || u[N + V - 1] != Mn || u[N] != u[U] || u[++N] != u[U + 1])) {
+        U += 2, N++;
         do
           ;
-        while (u[++U] == u[++M] && u[++U] == u[++M] && u[++U] == u[++M] && u[++U] == u[++M] && u[++U] == u[++M] && u[++U] == u[++M] && u[++U] == u[++M] && u[++U] == u[++M] && U < tn);
+        while (u[++U] == u[++N] && u[++U] == u[++N] && u[++U] == u[++N] && u[++U] == u[++N] && u[++U] == u[++N] && u[++U] == u[++N] && u[++U] == u[++N] && u[++U] == u[++N] && U < tn);
         if (q = Wt - (tn - U), U = tn - Wt, q > V) {
           if (T = C, V = q, q >= ge)
             break;
-          Bn = u[U + V - 1], Nn = u[U + V];
+          Mn = u[U + V - 1], Bn = u[U + V];
         }
       }
-    while ((C = x[C & Ie] & 65535) > J && --B !== 0);
+    while ((C = x[C & Ie] & 65535) > J && --M !== 0);
     return V <= F ? V : F;
   }
-  function Pi(C) {
-    let B = 0, U;
+  function Mi(C) {
+    let M = 0, U;
     for (; ; ) {
       if (F < Se) {
         if (He(), F < Se && C == lt)
@@ -1779,11 +1781,11 @@ function bs() {
         if (F === 0)
           break;
       }
-      if (F >= ae && (_ = (_ << p ^ u[S + (ae - 1)] & 255) & h, B = w[_] & 65535, x[S & l] = w[_], w[_] = S), B !== 0 && (S - B & 65535) <= o - Se && W != Rt && (E = mt(B)), E >= ae)
+      if (F >= ae && (_ = (_ << p ^ u[S + (ae - 1)] & 255) & h, M = w[_] & 65535, x[S & l] = w[_], w[_] = S), M !== 0 && (S - M & 65535) <= o - Se && W != Rt && (E = mt(M)), E >= ae)
         if (U = L(S - T, E - ae), F -= E, E <= v && F >= ae) {
           E--;
           do
-            S++, _ = (_ << p ^ u[S + (ae - 1)] & 255) & h, B = w[_] & 65535, x[S & l] = w[_], w[_] = S;
+            S++, _ = (_ << p ^ u[S + (ae - 1)] & 255) & h, M = w[_] & 65535, x[S & l] = w[_], w[_] = S;
           while (--E !== 0);
           S++;
         } else
@@ -1796,7 +1798,7 @@ function bs() {
     return te(C == Ee), t.avail_out === 0 ? C == Ee ? xt : Te : C == Ee ? Lt : Dt;
   }
   function Bi(C) {
-    let B = 0, U, M;
+    let M = 0, U, N;
     for (; ; ) {
       if (F < Se) {
         if (He(), F < Se && C == lt)
@@ -1804,10 +1806,10 @@ function bs() {
         if (F === 0)
           break;
       }
-      if (F >= ae && (_ = (_ << p ^ u[S + (ae - 1)] & 255) & h, B = w[_] & 65535, x[S & l] = w[_], w[_] = S), b = E, R = T, E = ae - 1, B !== 0 && b < v && (S - B & 65535) <= o - Se && (W != Rt && (E = mt(B)), E <= 5 && (W == os || E == ae && S - T > 4096) && (E = ae - 1)), b >= ae && E <= b) {
-        M = S + F - ae, U = L(S - 1 - R, b - ae), F -= b - 1, b -= 2;
+      if (F >= ae && (_ = (_ << p ^ u[S + (ae - 1)] & 255) & h, M = w[_] & 65535, x[S & l] = w[_], w[_] = S), b = E, R = T, E = ae - 1, M !== 0 && b < v && (S - M & 65535) <= o - Se && (W != Rt && (E = mt(M)), E <= 5 && (W == cs || E == ae && S - T > 4096) && (E = ae - 1)), b >= ae && E <= b) {
+        N = S + F - ae, U = L(S - 1 - R, b - ae), F -= b - 1, b -= 2;
         do
-          ++S <= M && (_ = (_ << p ^ u[S + (ae - 1)] & 255) & h, B = w[_] & 65535, x[S & l] = w[_], w[_] = S);
+          ++S <= N && (_ = (_ << p ^ u[S + (ae - 1)] & 255) & h, M = w[_] & 65535, x[S & l] = w[_], w[_] = S);
         while (--b !== 0);
         if (D = 0, E = ae - 1, S++, U && (te(!1), t.avail_out === 0))
           return Te;
@@ -1822,72 +1824,72 @@ function bs() {
   function Ni(C) {
     return C.total_in = C.total_out = 0, C.msg = null, n.pending = 0, n.pending_out = 0, e = Ut, a = lt, it(), pt(), Le;
   }
-  n.deflateInit = function(C, B, U, M, q, V) {
-    return M || (M = an), q || (q = xs), V || (V = cs), C.msg = null, B == Vt && (B = 6), q < 1 || q > hs || M != an || U < 9 || U > 15 || B < 0 || B > 9 || V < 0 || V > Rt ? Ue : (C.dstate = n, c = U, o = 1 << c, l = o - 1, P = q + 7, A = 1 << P, h = A - 1, p = Math.floor((P + ae - 1) / ae), u = new Uint8Array(o * 2), x = [], w = [], z = 1 << q + 6, n.pending_buf = new Uint8Array(z * 4), r = z * 4, n.dist_buf = new Uint16Array(z), n.lc_buf = new Uint8Array(z), k = B, W = V, Ni(C));
+  n.deflateInit = function(C, M, U, N, q, V) {
+    return N || (N = an), q || (q = ws), V || (V = ls), C.msg = null, M == Vt && (M = 6), q < 1 || q > xs || N != an || U < 9 || U > 15 || M < 0 || M > 9 || V < 0 || V > Rt ? Ue : (C.dstate = n, c = U, o = 1 << c, l = o - 1, P = q + 7, A = 1 << P, h = A - 1, p = Math.floor((P + ae - 1) / ae), u = new Uint8Array(o * 2), x = [], w = [], z = 1 << q + 6, n.pending_buf = new Uint8Array(z * 4), r = z * 4, n.dist_buf = new Uint16Array(z), n.lc_buf = new Uint8Array(z), k = M, W = V, Ni(C));
   }, n.deflateEnd = function() {
-    return e != sn && e != Ut && e != wt ? Ue : (n.lc_buf = null, n.dist_buf = null, n.pending_buf = null, w = null, x = null, u = null, n.dstate = null, e == Ut ? fs : Le);
-  }, n.deflateParams = function(C, B, U) {
-    let M = Le;
-    return B == Vt && (B = 6), B < 0 || B > 9 || U < 0 || U > Rt ? Ue : (De[k].func != De[B].func && C.total_in !== 0 && (M = C.deflate(Yn)), k != B && (k = B, v = De[k].max_lazy, O = De[k].good_length, Z = De[k].nice_length, I = De[k].max_chain), W = U, M);
-  }, n.deflateSetDictionary = function(C, B, U) {
-    let M = U, q, V = 0;
-    if (!B || e != sn)
+    return e != sn && e != Ut && e != wt ? Ue : (n.lc_buf = null, n.dist_buf = null, n.pending_buf = null, w = null, x = null, u = null, n.dstate = null, e == Ut ? us : Le);
+  }, n.deflateParams = function(C, M, U) {
+    let N = Le;
+    return M == Vt && (M = 6), M < 0 || M > 9 || U < 0 || U > Rt ? Ue : (De[k].func != De[M].func && C.total_in !== 0 && (N = C.deflate(Hn)), k != M && (k = M, v = De[k].max_lazy, O = De[k].good_length, Z = De[k].nice_length, I = De[k].max_chain), W = U, N);
+  }, n.deflateSetDictionary = function(C, M, U) {
+    let N = U, q, V = 0;
+    if (!M || e != sn)
       return Ue;
-    if (M < ae)
+    if (N < ae)
       return Le;
-    for (M > o - Se && (M = o - Se, V = U - M), u.set(B.subarray(V, V + M), 0), S = M, m = M, _ = u[0] & 255, _ = (_ << p ^ u[1] & 255) & h, q = 0; q <= M - ae; q++)
+    for (N > o - Se && (N = o - Se, V = U - N), u.set(M.subarray(V, V + N), 0), S = N, m = N, _ = u[0] & 255, _ = (_ << p ^ u[1] & 255) & h, q = 0; q <= N - ae; q++)
       _ = (_ << p ^ u[q + (ae - 1)] & 255) & h, x[q & l] = w[_], w[_] = q;
     return Le;
-  }, n.deflate = function(C, B) {
-    let U, M, q, V, J;
-    if (B > Ee || B < 0)
+  }, n.deflate = function(C, M) {
+    let U, N, q, V, J;
+    if (M > Ee || M < 0)
       return Ue;
-    if (!C.next_out || !C.next_in && C.avail_in !== 0 || e == wt && B != Ee)
+    if (!C.next_out || !C.next_in && C.avail_in !== 0 || e == wt && M != Ee)
       return C.msg = It[Ct - Ue], Ue;
     if (C.avail_out === 0)
       return C.msg = It[Ct - at], at;
-    if (t = C, V = a, a = B, e == sn && (M = an + (c - 8 << 4) << 8, q = (k - 1 & 255) >> 1, q > 3 && (q = 3), M |= q << 6, S !== 0 && (M |= ws), M += 31 - M % 31, e = Ut, We(M)), n.pending !== 0) {
+    if (t = C, V = a, a = M, e == sn && (N = an + (c - 8 << 4) << 8, q = (k - 1 & 255) >> 1, q > 3 && (q = 3), N |= q << 6, S !== 0 && (N |= _s), N += 31 - N % 31, e = Ut, We(N)), n.pending !== 0) {
       if (t.flush_pending(), t.avail_out === 0)
         return a = -1, Le;
-    } else if (t.avail_in === 0 && B <= V && B != Ee)
+    } else if (t.avail_in === 0 && M <= V && M != Ee)
       return t.msg = It[Ct - at], at;
     if (e == wt && t.avail_in !== 0)
       return C.msg = It[Ct - at], at;
-    if (t.avail_in !== 0 || F !== 0 || B != lt && e != wt) {
+    if (t.avail_in !== 0 || F !== 0 || M != lt && e != wt) {
       switch (J = -1, De[k].func) {
-        case Zr:
-          J = At(B);
+        case Kr:
+          J = Tt(M);
           break;
-        case Mt:
-          J = Pi(B);
+        case Nt:
+          J = Mi(M);
           break;
         case et:
-          J = Bi(B);
+          J = Bi(M);
           break;
       }
       if ((J == xt || J == Lt) && (e = wt), J == Te || J == xt)
         return t.avail_out === 0 && (a = -1), Le;
       if (J == Dt) {
-        if (B == Yn)
+        if (M == Hn)
           y();
-        else if (re(0, 0, !1), B == ls)
+        else if (re(0, 0, !1), M == fs)
           for (U = 0; U < A; U++)
             w[U] = 0;
         if (t.flush_pending(), t.avail_out === 0)
           return a = -1, Le;
       }
     }
-    return B != Ee ? Le : Vr;
+    return M != Ee ? Le : Zr;
   };
 }
-function Kr() {
+function Xr() {
   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;
 }
-Kr.prototype = {
+Xr.prototype = {
   deflateInit(n, t) {
     const e = this;
-    return e.dstate = new bs(), t || (t = bt), e.dstate.deflateInit(e, n, t);
+    return e.dstate = new ys(), t || (t = yt), e.dstate.deflateInit(e, n, t);
   },
   deflate(n) {
     const t = this;
@@ -1928,8 +1930,8 @@ Kr.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 ys(n) {
-  const t = this, e = new Kr(), r = vs(n && n.chunkSize ? n.chunkSize : 64 * 1024), a = lt, o = new Uint8Array(r);
+function vs(n) {
+  const t = this, e = new Xr(), r = Es(n && n.chunkSize ? n.chunkSize : 64 * 1024), a = lt, o = new Uint8Array(r);
   let c = n ? n.level : Vt;
   typeof c > "u" && (c = Vt), e.deflateInit(c), e.next_out = o, t.append = function(l, u) {
     let g, x, w = 0, _ = 0, A = 0;
@@ -1949,7 +1951,7 @@ function ys(n) {
     let l, u, g = 0, x = 0;
     const w = [];
     do {
-      if (e.next_out_index = 0, e.avail_out = r, l = e.deflate(Ee), l != Vr && l != Le)
+      if (e.next_out_index = 0, e.avail_out = r, l = e.deflate(Ee), l != Zr && l != Le)
         throw new Error("deflating: " + e.msg);
       r - e.avail_out > 0 && w.push(o.slice(0, e.next_out_index)), x += e.next_out_index;
     } while (e.avail_in > 0 || e.avail_out === 0);
@@ -1958,10 +1960,10 @@ function ys(n) {
     }), u;
   };
 }
-function vs(n) {
+function Es(n) {
   return n + 5 * (Math.floor(n / 16383) + 1);
 }
-const Es = 15, Q = 0, qe = 1, ks = 2, ke = -2, se = -3, Zn = -4, je = -5, Ae = [
+const ks = 15, Q = 0, qe = 1, Ss = 2, ke = -2, se = -3, Vn = -4, je = -5, Ae = [
   0,
   1,
   3,
@@ -1979,7 +1981,7 @@ const Es = 15, Q = 0, qe = 1, ks = 2, ke = -2, se = -3, Zn = -4, je = -5, Ae = [
   16383,
   32767,
   65535
-], Xr = 1440, Ss = 0, As = 4, Ts = 9, Fs = 5, Rs = [
+], $r = 1440, As = 0, Ts = 4, Fs = 9, Rs = 5, Cs = [
   96,
   7,
   256,
@@ -3516,7 +3518,7 @@ const Es = 15, Q = 0, qe = 1, ks = 2, ke = -2, se = -3, Zn = -4, je = -5, Ae = [
   0,
   9,
   255
-], Cs = [
+], Is = [
   80,
   5,
   1,
@@ -3613,7 +3615,7 @@ const Es = 15, Q = 0, qe = 1, ks = 2, ke = -2, se = -3, Zn = -4, je = -5, Ae = [
   192,
   5,
   24577
-], Is = [
+], Ds = [
   // Copy lengths for literal codes 257..285
   3,
   4,
@@ -3646,7 +3648,7 @@ const Es = 15, Q = 0, qe = 1, ks = 2, ke = -2, se = -3, Zn = -4, je = -5, Ae = [
   258,
   0,
   0
-], Ds = [
+], Ls = [
   // Extra bits for literal codes 257..285
   0,
   0,
@@ -3680,7 +3682,7 @@ const Es = 15, Q = 0, qe = 1, ks = 2, ke = -2, se = -3, Zn = -4, je = -5, Ae = [
   112,
   112
   // 112==invalid
-], Ls = [
+], Us = [
   // Copy offsets for distance codes 0..29
   1,
   2,
@@ -3712,7 +3714,7 @@ const Es = 15, Q = 0, qe = 1, ks = 2, ke = -2, se = -3, Zn = -4, je = -5, Ae = [
   12289,
   16385,
   24577
-], Us = [
+], Os = [
   // Extra bits for distance codes
   0,
   0,
@@ -3777,7 +3779,7 @@ function yn() {
           if (F++, H += k, X = T - H, X = X > k ? k : X, (S = 1 << (I = v - H)) > D + 1 && (S -= D + 1, j = v, I < X))
             for (; ++I < X && !((S <<= 1) <= r[++j]); )
               S -= r[j];
-          if (X = 1 << I, E[0] + X > Xr)
+          if (X = 1 << I, E[0] + X > $r)
             return se;
           o[F] = Z = /* hp+ */
           E[0], E[0] += X, F !== 0 ? (c[F] = b, a[0] = /* (byte) */
@@ -3812,14 +3814,14 @@ function yn() {
     return u(19), t[0] = 0, P = l(g, 0, 19, 19, null, null, w, x, _, t, e), P == se ? A.msg = "oversubscribed dynamic bit lengths tree" : (P == je || x[0] === 0) && (A.msg = "incomplete dynamic bit lengths tree", P = se), P;
   }, n.inflate_trees_dynamic = function(g, x, w, _, A, P, h, p, m) {
     let E;
-    return u(288), t[0] = 0, E = l(w, 0, g, 257, Is, Ds, P, _, p, t, e), E != Q || _[0] === 0 ? (E == se ? m.msg = "oversubscribed literal/length tree" : E != Zn && (m.msg = "incomplete literal/length tree", E = se), E) : (u(288), E = l(w, g, x, 0, Ls, Us, h, A, p, t, e), E != Q || A[0] === 0 && g > 257 ? (E == se ? m.msg = "oversubscribed distance tree" : E == je ? (m.msg = "incomplete distance tree", E = se) : E != Zn && (m.msg = "empty distance tree with lengths", E = se), E) : Q);
+    return u(288), t[0] = 0, E = l(w, 0, g, 257, Ds, Ls, P, _, p, t, e), E != Q || _[0] === 0 ? (E == se ? m.msg = "oversubscribed literal/length tree" : E != Vn && (m.msg = "incomplete literal/length tree", E = se), E) : (u(288), E = l(w, g, x, 0, Us, Os, h, A, p, t, e), E != Q || A[0] === 0 && g > 257 ? (E == se ? m.msg = "oversubscribed distance tree" : E == je ? (m.msg = "incomplete distance tree", E = se) : E != Vn && (m.msg = "empty distance tree with lengths", E = se), E) : Q);
   };
 }
 yn.inflate_trees_fixed = function(n, t, e, r) {
-  return n[0] = Ts, t[0] = Fs, e[0] = Rs, r[0] = Cs, Q;
+  return n[0] = Fs, t[0] = Rs, e[0] = Cs, r[0] = Is, Q;
 };
-const Ot = 0, Kn = 1, Xn = 2, $n = 3, Jn = 4, zn = 5, Qn = 6, cn = 7, er = 8, Pt = 9;
-function Os() {
+const Ot = 0, Zn = 1, Kn = 2, Xn = 3, $n = 4, Jn = 5, zn = 6, cn = 7, Qn = 8, Pt = 9;
+function Ps() {
   const n = this;
   let t, e = 0, r, a = 0, o = 0, c = 0, l = 0, u = 0, g = 0, x = 0, w, _ = 0, A, P = 0;
   function h(p, m, E, R, D, S, T, F) {
@@ -3898,8 +3900,8 @@ function Os() {
             t = E == qe ? cn : Pt;
             break;
           }
-          o = g, r = w, a = _, t = Kn;
-        case Kn:
+          o = g, r = w, a = _, t = Zn;
+        case Zn:
           for (R = o; F < R; ) {
             if (I !== 0)
               E = Q;
@@ -3908,11 +3910,11 @@ function Os() {
             I--, T |= (m.read_byte(b++) & 255) << F, F += 8;
           }
           if (D = (a + (T & Ae[R])) * 3, T >>>= r[D + 1], F -= r[D + 1], S = r[D], S === 0) {
-            c = r[D + 2], t = Qn;
+            c = r[D + 2], t = zn;
             break;
           }
           if (S & 16) {
-            l = S & 15, e = r[D + 2], t = Xn;
+            l = S & 15, e = r[D + 2], t = Kn;
             break;
           }
           if (!(S & 64)) {
@@ -3924,7 +3926,7 @@ function Os() {
             break;
           }
           return t = Pt, m.msg = "invalid literal/length code", E = se, p.bitb = T, p.bitk = F, m.avail_in = I, m.total_in += b - m.next_in_index, m.next_in_index = b, p.write = v, p.inflate_flush(m, E);
-        case Xn:
+        case Kn:
           for (R = l; F < R; ) {
             if (I !== 0)
               E = Q;
@@ -3932,8 +3934,8 @@ function Os() {
               return p.bitb = T, p.bitk = F, m.avail_in = I, m.total_in += b - m.next_in_index, m.next_in_index = b, p.write = v, p.inflate_flush(m, E);
             I--, T |= (m.read_byte(b++) & 255) << F, F += 8;
           }
-          e += T & Ae[R], T >>= R, F -= R, o = x, r = A, a = P, t = $n;
-        case $n:
+          e += T & Ae[R], T >>= R, F -= R, o = x, r = A, a = P, t = Xn;
+        case Xn:
           for (R = o; F < R; ) {
             if (I !== 0)
               E = Q;
@@ -3942,7 +3944,7 @@ function Os() {
             I--, T |= (m.read_byte(b++) & 255) << F, F += 8;
           }
           if (D = (a + (T & Ae[R])) * 3, T >>= r[D + 1], F -= r[D + 1], S = r[D], S & 16) {
-            l = S & 15, u = r[D + 2], t = Jn;
+            l = S & 15, u = r[D + 2], t = $n;
             break;
           }
           if (!(S & 64)) {
@@ -3950,7 +3952,7 @@ function Os() {
             break;
           }
           return t = Pt, m.msg = "invalid distance code", E = se, p.bitb = T, p.bitk = F, m.avail_in = I, m.total_in += b - m.next_in_index, m.next_in_index = b, p.write = v, p.inflate_flush(m, E);
-        case Jn:
+        case $n:
           for (R = l; F < R; ) {
             if (I !== 0)
               E = Q;
@@ -3958,8 +3960,8 @@ function Os() {
               return p.bitb = T, p.bitk = F, m.avail_in = I, m.total_in += b - m.next_in_index, m.next_in_index = b, p.write = v, p.inflate_flush(m, E);
             I--, T |= (m.read_byte(b++) & 255) << F, F += 8;
           }
-          u += T & Ae[R], T >>= R, F -= R, t = zn;
-        case zn:
+          u += T & Ae[R], T >>= R, F -= R, t = Jn;
+        case Jn:
           for (W = v - u; W < 0; )
             W += p.end;
           for (; e !== 0; ) {
@@ -3969,7 +3971,7 @@ function Os() {
           }
           t = Ot;
           break;
-        case Qn:
+        case zn:
           if (k === 0 && (v == p.end && p.read !== 0 && (v = 0, k = v < p.read ? p.read - v - 1 : p.end - v), k === 0 && (p.write = v, E = p.inflate_flush(m, E), v = p.write, k = v < p.read ? p.read - v - 1 : p.end - v, v == p.end && p.read !== 0 && (v = 0, k = v < p.read ? p.read - v - 1 : p.end - v), k === 0)))
             return p.bitb = T, p.bitk = F, m.avail_in = I, m.total_in += b - m.next_in_index, m.next_in_index = b, p.write = v, p.inflate_flush(m, E);
           E = Q, p.win[v++] = /* (byte) */
@@ -3978,8 +3980,8 @@ function Os() {
         case cn:
           if (F > 7 && (F -= 8, I++, b--), p.write = v, E = p.inflate_flush(m, E), v = p.write, k = v < p.read ? p.read - v - 1 : p.end - v, p.read != p.write)
             return p.bitb = T, p.bitk = F, m.avail_in = I, m.total_in += b - m.next_in_index, m.next_in_index = b, p.write = v, p.inflate_flush(m, E);
-          t = er;
-        case er:
+          t = Qn;
+        case Qn:
           return E = qe, p.bitb = T, p.bitk = F, m.avail_in = I, m.total_in += b - m.next_in_index, m.next_in_index = b, p.write = v, p.inflate_flush(m, E);
         case Pt:
           return E = se, p.bitb = T, p.bitk = F, m.avail_in = I, m.total_in += b - m.next_in_index, m.next_in_index = b, p.write = v, p.inflate_flush(m, E);
@@ -3989,7 +3991,7 @@ function Os() {
   }, n.free = function() {
   };
 }
-const tr = [
+const er = [
   // Order of the bit length code lengths
   16,
   17,
@@ -4010,15 +4012,15 @@ const tr = [
   14,
   1,
   15
-], ot = 0, ln = 1, nr = 2, rr = 3, ir = 4, sr = 5, Bt = 6, Nt = 7, ar = 8, Qe = 9;
-function Ps(n, t) {
+], ot = 0, ln = 1, tr = 2, nr = 3, rr = 4, ir = 5, Mt = 6, Bt = 7, sr = 8, Qe = 9;
+function Ms(n, t) {
   const e = this;
   let r = ot, a = 0, o = 0, c = 0, l;
-  const u = [0], g = [0], x = new Os();
-  let w = 0, _ = new Int32Array(Xr * 3);
+  const u = [0], g = [0], x = new Ps();
+  let w = 0, _ = new Int32Array($r * 3);
   const A = 0, P = new yn();
   e.bitk = 0, e.bitb = 0, e.win = new Uint8Array(t), e.end = t, e.read = 0, e.write = 0, e.reset = function(h, p) {
-    p && (p[0] = A), r == Bt && x.free(h), r = ot, e.bitk = 0, e.bitb = 0, e.read = e.write = 0;
+    p && (p[0] = A), r == Mt && x.free(h), r = ot, e.bitk = 0, e.bitb = 0, e.read = e.write = 0;
   }, e.reset(n, null), e.inflate_flush = function(h, p) {
     let m, E, R;
     return E = h.next_out_index, R = e.read, m = /* (int) */
@@ -4043,10 +4045,10 @@ function Ps(n, t) {
               E >>>= 3, R -= 3, m = R & 7, E >>>= m, R -= m, r = ln;
               break;
             case 1:
-              I = [], v = [], k = [[]], W = [[]], yn.inflate_trees_fixed(I, v, k, W), x.init(I[0], v[0], k[0], 0, W[0], 0), E >>>= 3, R -= 3, r = Bt;
+              I = [], v = [], k = [[]], W = [[]], yn.inflate_trees_fixed(I, v, k, W), x.init(I[0], v[0], k[0], 0, W[0], 0), E >>>= 3, R -= 3, r = Mt;
               break;
             case 2:
-              E >>>= 3, R -= 3, r = rr;
+              E >>>= 3, R -= 3, r = nr;
               break;
             case 3:
               return E >>>= 3, R -= 3, r = Qe, h.msg = "invalid block type", p = se, e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, e.inflate_flush(h, p);
@@ -4062,9 +4064,9 @@ function Ps(n, t) {
           }
           if ((~E >>> 16 & 65535) != (E & 65535))
             return r = Qe, h.msg = "invalid stored block lengths", p = se, e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, e.inflate_flush(h, p);
-          a = E & 65535, E = R = 0, r = a !== 0 ? nr : w !== 0 ? Nt : ot;
+          a = E & 65535, E = R = 0, r = a !== 0 ? tr : w !== 0 ? Bt : ot;
           break;
-        case nr:
+        case tr:
           if (S === 0 || F === 0 && (T == e.end && e.read !== 0 && (T = 0, F = /* (int) */
           T < e.read ? e.read - T - 1 : e.end - T), F === 0 && (e.write = T, p = e.inflate_flush(h, p), T = e.write, F = /* (int) */
           T < e.read ? e.read - T - 1 : e.end - T, T == e.end && e.read !== 0 && (T = 0, F = /* (int) */
@@ -4072,9 +4074,9 @@ function Ps(n, t) {
             return e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, e.inflate_flush(h, p);
           if (p = Q, m = a, m > S && (m = S), m > F && (m = F), e.win.set(h.read_buf(D, m), T), D += m, S -= m, T += m, F -= m, (a -= m) !== 0)
             break;
-          r = w !== 0 ? Nt : ot;
+          r = w !== 0 ? Bt : ot;
           break;
-        case rr:
+        case nr:
           for (; R < 14; ) {
             if (S !== 0)
               p = Q;
@@ -4089,8 +4091,8 @@ function Ps(n, t) {
           else
             for (b = 0; b < m; b++)
               l[b] = 0;
-          E >>>= 14, R -= 14, c = 0, r = ir;
-        case ir:
+          E >>>= 14, R -= 14, c = 0, r = rr;
+        case rr:
           for (; c < 4 + (o >>> 10); ) {
             for (; R < 3; ) {
               if (S !== 0)
@@ -4099,14 +4101,14 @@ function Ps(n, t) {
                 return e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, e.inflate_flush(h, p);
               S--, E |= (h.read_byte(D++) & 255) << R, R += 8;
             }
-            l[tr[c++]] = E & 7, E >>>= 3, R -= 3;
+            l[er[c++]] = E & 7, E >>>= 3, R -= 3;
           }
           for (; c < 19; )
-            l[tr[c++]] = 0;
+            l[er[c++]] = 0;
           if (u[0] = 7, m = P.inflate_trees_bits(l, u, g, _, h), m != Q)
             return p = m, p == se && (l = null, r = Qe), e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, e.inflate_flush(h, p);
-          c = 0, r = sr;
-        case sr:
+          c = 0, r = ir;
+        case ir:
           for (; m = o, !(c >= 258 + (m & 31) + (m >> 5 & 31)); ) {
             let K, X;
             for (m = u[0]; R < m; ) {
@@ -4137,8 +4139,8 @@ function Ps(n, t) {
           }
           if (g[0] = -1, O = [], Z = [], H = [], j = [], O[0] = 9, Z[0] = 6, m = o, m = P.inflate_trees_dynamic(257 + (m & 31), 1 + (m >> 5 & 31), l, O, Z, H, j, _, h), m != Q)
             return m == se && (l = null, r = Qe), p = m, e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, e.inflate_flush(h, p);
-          x.init(O[0], Z[0], _, H[0], _, j[0]), r = Bt;
-        case Bt:
+          x.init(O[0], Z[0], _, H[0], _, j[0]), r = Mt;
+        case Mt:
           if (e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, (p = x.proc(e, h, p)) != qe)
             return e.inflate_flush(h, p);
           if (p = Q, x.free(h), D = h.next_in_index, S = h.avail_in, E = e.bitb, R = e.bitk, T = e.write, F = /* (int) */
@@ -4146,13 +4148,13 @@ function Ps(n, t) {
             r = ot;
             break;
           }
-          r = Nt;
-        case Nt:
+          r = Bt;
+        case Bt:
           if (e.write = T, p = e.inflate_flush(h, p), T = e.write, F = /* (int) */
           T < e.read ? e.read - T - 1 : e.end - T, e.read != e.write)
             return e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, e.inflate_flush(h, p);
-          r = ar;
-        case ar:
+          r = sr;
+        case sr:
           return p = qe, e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, e.inflate_flush(h, p);
         case Qe:
           return p = se, e.bitb = E, e.bitk = R, h.avail_in = S, h.total_in += D - h.next_in_index, h.next_in_index = D, e.write = T, e.inflate_flush(h, p);
@@ -4168,8 +4170,8 @@ function Ps(n, t) {
     return r == ln ? 1 : 0;
   };
 }
-const Bs = 32, Ns = 8, Ms = 0, or = 1, cr = 2, lr = 3, fr = 4, ur = 5, fn = 6, _t = 7, dr = 12, Ge = 13, Ws = [0, 0, 255, 255];
-function qs() {
+const Bs = 32, Ns = 8, Ws = 0, ar = 1, or = 2, cr = 3, lr = 4, fr = 5, fn = 6, _t = 7, ur = 12, Ge = 13, qs = [0, 0, 255, 255];
+function js() {
   const n = this;
   n.mode = 0, n.method = 0, n.was = [0], n.need = 0, n.marker = 0, n.wbits = 0;
   function t(e) {
@@ -4178,15 +4180,15 @@ function qs() {
   n.inflateEnd = function(e) {
     return n.blocks && n.blocks.free(e), n.blocks = null, Q;
   }, n.inflateInit = function(e, r) {
-    return e.msg = null, n.blocks = null, r < 8 || r > 15 ? (n.inflateEnd(e), ke) : (n.wbits = r, e.istate.blocks = new Ps(e, 1 << r), t(e), Q);
+    return e.msg = null, n.blocks = null, r < 8 || r > 15 ? (n.inflateEnd(e), ke) : (n.wbits = r, e.istate.blocks = new Ms(e, 1 << r), t(e), Q);
   }, n.inflate = function(e, r) {
     let a, o;
     if (!e || !e.istate || !e.next_in)
       return ke;
     const c = e.istate;
-    for (r = r == As ? je : Q, a = je; ; )
+    for (r = r == Ts ? je : Q, a = je; ; )
       switch (c.mode) {
-        case Ms:
+        case Ws:
           if (e.avail_in === 0)
             return a;
           if (a = r, e.avail_in--, e.total_in++, ((c.method = e.read_byte(e.next_in_index++)) & 15) != Ns) {
@@ -4197,8 +4199,8 @@ function qs() {
             c.mode = Ge, e.msg = "invalid win size", c.marker = 5;
             break;
           }
-          c.mode = or;
-        case or:
+          c.mode = ar;
+        case ar:
           if (e.avail_in === 0)
             return a;
           if (a = r, e.avail_in--, e.total_in++, o = e.read_byte(e.next_in_index++) & 255, ((c.method << 8) + o) % 31 !== 0) {
@@ -4209,21 +4211,21 @@ function qs() {
             c.mode = _t;
             break;
           }
-          c.mode = cr;
+          c.mode = or;
+        case or:
+          if (e.avail_in === 0)
+            return a;
+          a = r, e.avail_in--, e.total_in++, c.need = (e.read_byte(e.next_in_index++) & 255) << 24 & 4278190080, c.mode = cr;
         case cr:
           if (e.avail_in === 0)
             return a;
-          a = r, e.avail_in--, e.total_in++, c.need = (e.read_byte(e.next_in_index++) & 255) << 24 & 4278190080, c.mode = lr;
+          a = r, e.avail_in--, e.total_in++, c.need += (e.read_byte(e.next_in_index++) & 255) << 16 & 16711680, c.mode = lr;
         case lr:
           if (e.avail_in === 0)
             return a;
-          a = r, e.avail_in--, e.total_in++, c.need += (e.read_byte(e.next_in_index++) & 255) << 16 & 16711680, c.mode = fr;
+          a = r, e.avail_in--, e.total_in++, c.need += (e.read_byte(e.next_in_index++) & 255) << 8 & 65280, c.mode = fr;
         case fr:
-          if (e.avail_in === 0)
-            return a;
-          a = r, e.avail_in--, e.total_in++, c.need += (e.read_byte(e.next_in_index++) & 255) << 8 & 65280, c.mode = ur;
-        case ur:
-          return e.avail_in === 0 ? a : (a = r, e.avail_in--, e.total_in++, c.need += e.read_byte(e.next_in_index++) & 255, c.mode = fn, ks);
+          return e.avail_in === 0 ? a : (a = r, e.avail_in--, e.total_in++, c.need += e.read_byte(e.next_in_index++) & 255, c.mode = fn, Ss);
         case fn:
           return c.mode = Ge, e.msg = "need dictionary", c.marker = 0, ke;
         case _t:
@@ -4233,8 +4235,8 @@ function qs() {
           }
           if (a == Q && (a = r), a != qe)
             return a;
-          a = r, c.blocks.reset(e, c.was), c.mode = dr;
-        case dr:
+          a = r, c.blocks.reset(e, c.was), c.mode = ur;
+        case ur:
           return e.avail_in = 0, qe;
         case Ge:
           return se;
@@ -4255,18 +4257,18 @@ function qs() {
     if (u.mode != Ge && (u.mode = Ge, u.marker = 0), (r = e.avail_in) === 0)
       return je;
     for (a = e.next_in_index, o = u.marker; r !== 0 && o < 4; )
-      e.read_byte(a) == Ws[o] ? o++ : e.read_byte(a) !== 0 ? o = 0 : o = 4 - o, a++, r--;
+      e.read_byte(a) == qs[o] ? o++ : e.read_byte(a) !== 0 ? o = 0 : o = 4 - o, a++, r--;
     return e.total_in += a - e.next_in_index, e.next_in_index = a, e.avail_in = r, u.marker = o, o != 4 ? se : (c = e.total_in, l = e.total_out, t(e), e.total_in = c, e.total_out = l, u.mode = _t, Q);
   }, n.inflateSyncPoint = function(e) {
     return !e || !e.istate || !e.istate.blocks ? ke : e.istate.blocks.sync_point();
   };
 }
-function $r() {
+function Jr() {
 }
-$r.prototype = {
+Jr.prototype = {
   inflateInit(n) {
     const t = this;
-    return t.istate = new qs(), n || (n = Es), t.istate.inflateInit(t, n);
+    return t.istate = new js(), n || (n = ks), t.istate.inflateInit(t, n);
   },
   inflate(n) {
     const t = this;
@@ -4294,8 +4296,8 @@ $r.prototype = {
     return this.next_in.subarray(n, n + t);
   }
 };
-function js(n) {
-  const t = this, e = new $r(), r = n && n.chunkSize ? Math.floor(n.chunkSize * 2) : 128 * 1024, a = Ss, o = new Uint8Array(r);
+function Hs(n) {
+  const t = this, e = new Jr(), r = n && n.chunkSize ? Math.floor(n.chunkSize * 2) : 128 * 1024, a = As, o = new Uint8Array(r);
   let c = !1;
   e.inflateInit(), e.next_out = o, t.append = function(l, u) {
     const g = [];
@@ -4320,8 +4322,8 @@ function js(n) {
     e.inflateEnd();
   };
 }
-const nt = 4294967295, Ke = 65535, Hs = 8, Ys = 0, Gs = 99, Vs = 67324752, Zs = 134695760, pr = 33639248, Ks = 101010256, mr = 101075792, Xs = 117853008, ct = 22, un = 20, dn = 56, $s = 1, Js = 39169, zs = 10, Qs = 1, ea = 21589, ta = 28789, na = 25461, ra = 6534, hr = 1, ia = 6, xr = 8, wr = 2048, _r = 16, gr = 16384, br = 73, yr = "/", ve = void 0, $e = "undefined", kt = "function";
-class vr {
+const nt = 4294967295, Ke = 65535, Ys = 8, Gs = 0, Vs = 99, Zs = 67324752, Ks = 134695760, dr = 33639248, Xs = 101010256, pr = 101075792, $s = 117853008, ct = 22, un = 20, dn = 56, Js = 1, zs = 39169, Qs = 10, ea = 1, ta = 21589, na = 28789, ra = 25461, ia = 6534, mr = 1, sa = 6, hr = 8, xr = 2048, wr = 16, _r = 16384, gr = 73, br = "/", ve = void 0, $e = "undefined", St = "function";
+class yr {
   constructor(t) {
     return class extends TransformStream {
       constructor(e, r) {
@@ -4339,27 +4341,27 @@ class vr {
     };
   }
 }
-const sa = 64;
-let Jr = 2;
+const aa = 64;
+let zr = 2;
 try {
-  typeof navigator != $e && navigator.hardwareConcurrency && (Jr = navigator.hardwareConcurrency);
+  typeof navigator != $e && navigator.hardwareConcurrency && (zr = navigator.hardwareConcurrency);
 } catch {
 }
-const aa = {
+const oa = {
   chunkSize: 512 * 1024,
-  maxWorkers: Jr,
+  maxWorkers: zr,
   terminateWorkerTimeout: 5e3,
   useWebWorkers: !0,
   useCompressionStream: !0,
   workerScripts: ve,
   CompressionStreamNative: typeof CompressionStream != $e && CompressionStream,
   DecompressionStreamNative: typeof DecompressionStream != $e && DecompressionStream
-}, Xe = Object.assign({}, aa);
-function oa() {
+}, Xe = Object.assign({}, oa);
+function ca() {
   return Xe;
 }
-function ca(n) {
-  return Math.max(n.chunkSize, sa);
+function la(n) {
+  return Math.max(n.chunkSize, aa);
 }
 function Dn(n) {
   const {
@@ -4375,7 +4377,7 @@ function Dn(n) {
     DecompressionStream: x,
     workerScripts: w
   } = n;
-  if (Ve("baseURL", t), Ve("chunkSize", e), Ve("maxWorkers", r), Ve("terminateWorkerTimeout", a), Ve("useCompressionStream", o), Ve("useWebWorkers", c), l && (Xe.CompressionStream = new vr(l)), u && (Xe.DecompressionStream = new vr(u)), Ve("CompressionStream", g), Ve("DecompressionStream", x), w !== ve) {
+  if (Ve("baseURL", t), Ve("chunkSize", e), Ve("maxWorkers", r), Ve("terminateWorkerTimeout", a), Ve("useCompressionStream", o), Ve("useWebWorkers", c), l && (Xe.CompressionStream = new yr(l)), u && (Xe.DecompressionStream = new yr(u)), Ve("CompressionStream", g), Ve("DecompressionStream", x), w !== ve) {
     const { deflate: _, inflate: A } = w;
     if ((_ || A) && (Xe.workerScripts || (Xe.workerScripts = {})), _) {
       if (!Array.isArray(_))
@@ -5986,12 +5988,12 @@ const pn = {
     }
   return n;
 })();
-const zr = [];
+const Qr = [];
 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;
-  zr[n] = t;
+  Qr[n] = t;
 }
 class Zt {
   constructor(t) {
@@ -6000,14 +6002,14 @@ class Zt {
   append(t) {
     let e = this.crc | 0;
     for (let r = 0, a = t.length | 0; r < a; r++)
-      e = e >>> 8 ^ zr[(e ^ t[r]) & 255];
+      e = e >>> 8 ^ Qr[(e ^ t[r]) & 255];
     this.crc = e;
   }
   get() {
     return ~this.crc;
   }
 }
-class Qr extends TransformStream {
+class ei extends TransformStream {
   constructor() {
     let t;
     const e = new Zt();
@@ -6022,7 +6024,7 @@ class Qr extends TransformStream {
     }), t = this;
   }
 }
-function la(n) {
+function fa(n) {
   if (typeof TextEncoder == $e) {
     n = unescape(encodeURIComponent(n));
     const t = new Uint8Array(n.length);
@@ -6124,8 +6126,8 @@ const ye = {
       return e & 3 && t.push(ye.partial(8 * (e & 3), r)), t;
     }
   }
-}, ei = {};
-ei.sha1 = class {
+}, ti = {};
+ti.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();
@@ -6209,8 +6211,8 @@ ei.sha1 = class {
     e[0] = e[0] + a | 0, e[1] = e[1] + o | 0, e[2] = e[2] + c | 0, e[3] = e[3] + l | 0, e[4] = e[4] + u | 0;
   }
 };
-const ti = {};
-ti.aes = class {
+const ni = {};
+ni.aes = class {
   constructor(n) {
     const t = this;
     t._tables = [[[], [], [], [], []], [[], [], [], [], []]], t._tables[0][0][0] || t._precompute();
@@ -6288,7 +6290,7 @@ ti.aes = class {
     return a;
   }
 };
-const fa = {
+const ua = {
   /** 
    * Generate random words with pure js, cryptographically not as strong & safe as native implementation.
    * @param {TypedArray} typedArray The array to fill.
@@ -6308,8 +6310,8 @@ const fa = {
     }
     return n;
   }
-}, ni = {};
-ni.ctrGladman = class {
+}, ri = {};
+ri.ctrGladman = class {
   constructor(n, t) {
     this._prf = n, this._initIv = t, this._iv = t;
   }
@@ -6370,7 +6372,7 @@ const rt = {
 };
 rt.hmacSha1 = class {
   constructor(n) {
-    const t = this, e = t._hash = ei.sha1, r = [[], []];
+    const t = this, e = t._hash = ti.sha1, r = [[], []];
     t._baseHash = [new e(), new e()];
     const a = t._baseHash[0].blockSize / 32;
     n.length > a && (n = new e().update(n).finalize());
@@ -6396,19 +6398,19 @@ rt.hmacSha1 = class {
     return this.update(n), this.digest(n);
   }
 };
-const ua = typeof crypto != $e && typeof crypto.getRandomValues == kt, ri = "Invalid password", ii = "Invalid signature", Ln = "zipjs-abort-check-password";
-function si(n) {
-  return ua ? crypto.getRandomValues(n) : fa.getRandomValues(n);
+const da = typeof crypto != $e && typeof crypto.getRandomValues == St, ii = "Invalid password", si = "Invalid signature", Ln = "zipjs-abort-check-password";
+function ai(n) {
+  return da ? crypto.getRandomValues(n) : ua.getRandomValues(n);
 }
-const ft = 16, da = "raw", ai = { name: "PBKDF2" }, pa = { name: "HMAC" }, ma = "SHA-1", ha = Object.assign({ hash: pa }, ai), vn = Object.assign({ iterations: 1e3, hash: { name: ma } }, ai), xa = ["deriveBits"], yt = [8, 12, 16], gt = [16, 24, 32], Ze = 10, wa = [0, 0, 0, 0], en = typeof crypto != $e, St = en && crypto.subtle, oi = en && typeof St != $e, Be = Kt.bytes, _a = ti.aes, ga = ni.ctrGladman, ba = rt.hmacSha1;
-let Er = en && oi && typeof St.importKey == kt, kr = en && oi && typeof St.deriveBits == kt;
-class ya extends TransformStream {
+const ft = 16, pa = "raw", oi = { name: "PBKDF2" }, ma = { name: "HMAC" }, ha = "SHA-1", xa = Object.assign({ hash: ma }, oi), vn = Object.assign({ iterations: 1e3, hash: { name: ha } }, oi), wa = ["deriveBits"], vt = [8, 12, 16], gt = [16, 24, 32], Ze = 10, _a = [0, 0, 0, 0], en = typeof crypto != $e, At = en && crypto.subtle, ci = en && typeof At != $e, Me = Kt.bytes, ga = ni.aes, ba = ri.ctrGladman, ya = rt.hmacSha1;
+let vr = en && ci && typeof At.importKey == St, Er = en && ci && typeof At.deriveBits == St;
+class va extends TransformStream {
   constructor({ password: t, rawPassword: e, signed: r, encryptionStrength: a, checkPasswordOnly: o }) {
     super({
       start() {
         Object.assign(this, {
           ready: new Promise((c) => this.resolveReady = c),
-          password: fi(t, e),
+          password: ui(t, e),
           signed: r,
           strength: a - 1,
           pending: new Uint8Array()
@@ -6421,9 +6423,9 @@ class ya extends TransformStream {
           resolveReady: w,
           ready: _
         } = u;
-        g ? (await Ea(u, x, g, Re(c, 0, yt[x] + 2)), c = Re(c, yt[x] + 2), o ? l.error(new Error(Ln)) : w()) : await _;
+        g ? (await ka(u, x, g, Re(c, 0, vt[x] + 2)), c = Re(c, vt[x] + 2), o ? l.error(new Error(Ln)) : w()) : await _;
         const A = new Uint8Array(c.length - Ze - (c.length - Ze) % ft);
-        l.enqueue(ci(u, c, A, 0, Ze, !0));
+        l.enqueue(li(u, c, A, 0, Ze, !0));
       },
       async flush(c) {
         const {
@@ -6438,16 +6440,16 @@ class ya extends TransformStream {
           const _ = Re(x, 0, x.length - Ze), A = Re(x, x.length - Ze);
           let P = new Uint8Array();
           if (_.length) {
-            const h = Et(Be, _);
+            const h = kt(Me, _);
             g.update(h);
             const p = u.update(h);
-            P = vt(Be, p);
+            P = Et(Me, p);
           }
           if (l) {
-            const h = Re(vt(Be, g.digest()), 0, Ze);
+            const h = Re(Et(Me, g.digest()), 0, Ze);
             for (let p = 0; p < Ze; p++)
               if (h[p] != A[p])
-                throw new Error(ii);
+                throw new Error(si);
           }
           c.enqueue(P);
         }
@@ -6455,14 +6457,14 @@ class ya extends TransformStream {
     });
   }
 }
-class va extends TransformStream {
+class Ea extends TransformStream {
   constructor({ password: t, rawPassword: e, encryptionStrength: r }) {
     let a;
     super({
       start() {
         Object.assign(this, {
           ready: new Promise((o) => this.resolveReady = o),
-          password: fi(t, e),
+          password: ui(t, e),
           strength: r - 1,
           pending: new Uint8Array()
         });
@@ -6475,9 +6477,9 @@ class va extends TransformStream {
           ready: w
         } = l;
         let _ = new Uint8Array();
-        u ? (_ = await ka(l, g, u), x()) : await w;
+        u ? (_ = await Sa(l, g, u), x()) : await w;
         const A = new Uint8Array(_.length + o.length - o.length % ft);
-        A.set(_, 0), c.enqueue(ci(l, o, A, _.length, 0));
+        A.set(_, 0), c.enqueue(li(l, o, A, _.length, 0));
       },
       async flush(o) {
         const {
@@ -6490,81 +6492,81 @@ class va extends TransformStream {
           await g;
           let x = new Uint8Array();
           if (u.length) {
-            const w = c.update(Et(Be, u));
-            l.update(w), x = vt(Be, w);
+            const w = c.update(kt(Me, u));
+            l.update(w), x = Et(Me, w);
           }
-          a.signature = vt(Be, l.digest()).slice(0, Ze), o.enqueue(Un(x, a.signature));
+          a.signature = Et(Me, l.digest()).slice(0, Ze), o.enqueue(Un(x, a.signature));
         }
       }
     }), a = this;
   }
 }
-function ci(n, t, e, r, a, o) {
+function li(n, t, e, r, a, o) {
   const {
     ctr: c,
     hmac: l,
     pending: u
   } = n, g = t.length - a;
-  u.length && (t = Un(u, t), e = Ta(e, g - g % ft));
+  u.length && (t = Un(u, t), e = Fa(e, g - g % ft));
   let x;
   for (x = 0; x <= g - ft; x += ft) {
-    const w = Et(Be, Re(t, x, x + ft));
+    const w = kt(Me, Re(t, x, x + ft));
     o && l.update(w);
     const _ = c.update(w);
-    o || l.update(_), e.set(vt(Be, _), x + r);
+    o || l.update(_), e.set(Et(Me, _), x + r);
   }
   return n.pending = Re(t, x), e;
 }
-async function Ea(n, t, e, r) {
-  const a = await li(n, t, e, Re(r, 0, yt[t])), o = Re(r, yt[t]);
+async function ka(n, t, e, r) {
+  const a = await fi(n, t, e, Re(r, 0, vt[t])), o = Re(r, vt[t]);
   if (a[0] != o[0] || a[1] != o[1])
-    throw new Error(ri);
+    throw new Error(ii);
 }
-async function ka(n, t, e) {
-  const r = si(new Uint8Array(yt[t])), a = await li(n, t, e, r);
+async function Sa(n, t, e) {
+  const r = ai(new Uint8Array(vt[t])), a = await fi(n, t, e, r);
   return Un(r, a);
 }
-async function li(n, t, e, r) {
+async function fi(n, t, e, r) {
   n.password = null;
-  const a = await Sa(da, e, ha, !1, xa), o = await Aa(Object.assign({ salt: r }, vn), a, 8 * (gt[t] * 2 + 2)), c = new Uint8Array(o), l = Et(Be, Re(c, 0, gt[t])), u = Et(Be, Re(c, gt[t], gt[t] * 2)), g = Re(c, gt[t] * 2);
+  const a = await Aa(pa, e, xa, !1, wa), o = await Ta(Object.assign({ salt: r }, vn), a, 8 * (gt[t] * 2 + 2)), c = new Uint8Array(o), l = kt(Me, Re(c, 0, gt[t])), u = kt(Me, Re(c, gt[t], gt[t] * 2)), g = Re(c, gt[t] * 2);
   return Object.assign(n, {
     keys: {
       key: l,
       authentication: u,
       passwordVerification: g
     },
-    ctr: new ga(new _a(l), Array.from(wa)),
-    hmac: new ba(u)
+    ctr: new ba(new ga(l), Array.from(_a)),
+    hmac: new ya(u)
   }), g;
 }
-async function Sa(n, t, e, r, a) {
-  if (Er)
+async function Aa(n, t, e, r, a) {
+  if (vr)
     try {
-      return await St.importKey(n, t, e, r, a);
+      return await At.importKey(n, t, e, r, a);
     } catch {
-      return Er = !1, rt.importKey(t);
+      return vr = !1, rt.importKey(t);
     }
   else
     return rt.importKey(t);
 }
-async function Aa(n, t, e) {
-  if (kr)
+async function Ta(n, t, e) {
+  if (Er)
     try {
-      return await St.deriveBits(n, t, e);
+      return await At.deriveBits(n, t, e);
     } catch {
-      return kr = !1, rt.pbkdf2(t, n.salt, vn.iterations, e);
+      return Er = !1, rt.pbkdf2(t, n.salt, vn.iterations, e);
     }
   else
     return rt.pbkdf2(t, n.salt, vn.iterations, e);
 }
-function fi(n, t) {
-  return t === ve ? la(n) : t;
+function ui(n, t) {
+  return t === ve ? fa(n) : t;
 }
 function Un(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 Ta(n, t) {
+function Fa(n, t) {
   if (t && t > n.length) {
     const e = n;
     n = new Uint8Array(t), n.set(e, 0);
@@ -6574,71 +6576,71 @@ function Ta(n, t) {
 function Re(n, t, e) {
   return n.subarray(t, e);
 }
-function vt(n, t) {
+function Et(n, t) {
   return n.fromBits(t);
 }
-function Et(n, t) {
+function kt(n, t) {
   return n.toBits(t);
 }
 const ut = 12;
-class Fa extends TransformStream {
+class Ra extends TransformStream {
   constructor({ password: t, passwordVerification: e, checkPasswordOnly: r }) {
     super({
       start() {
         Object.assign(this, {
           password: t,
           passwordVerification: e
-        }), ui(this, t);
+        }), di(this, t);
       },
       transform(a, o) {
         const c = this;
         if (c.password) {
-          const l = Sr(c, a.subarray(0, ut));
+          const l = kr(c, a.subarray(0, ut));
           if (c.password = null, l[ut - 1] != c.passwordVerification)
-            throw new Error(ri);
+            throw new Error(ii);
           a = a.subarray(ut);
         }
-        r ? o.error(new Error(Ln)) : o.enqueue(Sr(c, a));
+        r ? o.error(new Error(Ln)) : o.enqueue(kr(c, a));
       }
     });
   }
 }
-class Ra extends TransformStream {
+class Ca extends TransformStream {
   constructor({ password: t, passwordVerification: e }) {
     super({
       start() {
         Object.assign(this, {
           password: t,
           passwordVerification: e
-        }), ui(this, t);
+        }), di(this, t);
       },
       transform(r, a) {
         const o = this;
         let c, l;
         if (o.password) {
           o.password = null;
-          const u = si(new Uint8Array(ut));
-          u[ut - 1] = o.passwordVerification, c = new Uint8Array(r.length + u.length), c.set(Ar(o, u), 0), l = ut;
+          const u = ai(new Uint8Array(ut));
+          u[ut - 1] = o.passwordVerification, c = new Uint8Array(r.length + u.length), c.set(Sr(o, u), 0), l = ut;
         } else
           c = new Uint8Array(r.length), l = 0;
-        c.set(Ar(o, r), l), a.enqueue(c);
+        c.set(Sr(o, r), l), a.enqueue(c);
       }
     });
   }
 }
-function Sr(n, t) {
+function kr(n, t) {
   const e = new Uint8Array(t.length);
   for (let r = 0; r < t.length; r++)
-    e[r] = di(n) ^ t[r], On(n, e[r]);
+    e[r] = pi(n) ^ t[r], On(n, e[r]);
   return e;
 }
-function Ar(n, t) {
+function Sr(n, t) {
   const e = new Uint8Array(t.length);
   for (let r = 0; r < t.length; r++)
-    e[r] = di(n) ^ t[r], On(n, t[r]);
+    e[r] = pi(n) ^ t[r], On(n, t[r]);
   return e;
 }
-function ui(n, t) {
+function di(n, t) {
   const e = [305419896, 591751049, 878082192];
   Object.assign(n, {
     keys: e,
@@ -6650,66 +6652,66 @@ function ui(n, t) {
 }
 function On(n, t) {
   let [e, r, a] = n.keys;
-  n.crcKey0.append([t]), e = ~n.crcKey0.get(), r = Tr(Math.imul(Tr(r + pi(e)), 134775813) + 1), n.crcKey2.append([r >>> 24]), a = ~n.crcKey2.get(), n.keys = [e, r, a];
+  n.crcKey0.append([t]), e = ~n.crcKey0.get(), r = Ar(Math.imul(Ar(r + mi(e)), 134775813) + 1), n.crcKey2.append([r >>> 24]), a = ~n.crcKey2.get(), n.keys = [e, r, a];
 }
-function di(n) {
+function pi(n) {
   const t = n.keys[2] | 2;
-  return pi(Math.imul(t, t ^ 1) >>> 8);
+  return mi(Math.imul(t, t ^ 1) >>> 8);
 }
-function pi(n) {
+function mi(n) {
   return n & 255;
 }
-function Tr(n) {
+function Ar(n) {
   return n & 4294967295;
 }
-const Fr = "deflate-raw";
-class Ca extends TransformStream {
+const Tr = "deflate-raw";
+class Ia extends TransformStream {
   constructor(t, { chunkSize: e, CompressionStream: r, CompressionStreamNative: a }) {
     super({});
     const { compressed: o, encrypted: c, useCompressionStream: l, zipCrypto: u, signed: g, level: x } = t, w = this;
-    let _, A, P = mi(super.readable);
-    (!c || u) && g && (_ = new Qr(), P = Ne(P, _)), o && (P = xi(P, l, { level: x, chunkSize: e }, a, r)), c && (u ? P = Ne(P, new Ra(t)) : (A = new va(t), P = Ne(P, A))), hi(w, P, () => {
+    let _, A, P = hi(super.readable);
+    (!c || u) && g && (_ = new ei(), P = Be(P, _)), o && (P = wi(P, l, { level: x, chunkSize: e }, a, r)), c && (u ? P = Be(P, new Ca(t)) : (A = new Ea(t), P = Be(P, A))), xi(w, P, () => {
       let h;
       c && !u && (h = A.signature), (!c || u) && g && (h = new DataView(_.value.buffer).getUint32(0)), w.signature = h;
     });
   }
 }
-class Ia extends TransformStream {
+class Da extends TransformStream {
   constructor(t, { chunkSize: e, DecompressionStream: r, DecompressionStreamNative: a }) {
     super({});
     const { zipCrypto: o, encrypted: c, signed: l, signature: u, compressed: g, useCompressionStream: x } = t;
-    let w, _, A = mi(super.readable);
-    c && (o ? A = Ne(A, new Fa(t)) : (_ = new ya(t), A = Ne(A, _))), g && (A = xi(A, x, { chunkSize: e }, a, r)), (!c || o) && l && (w = new Qr(), A = Ne(A, w)), hi(this, A, () => {
+    let w, _, A = hi(super.readable);
+    c && (o ? A = Be(A, new Ra(t)) : (_ = new va(t), A = Be(A, _))), g && (A = wi(A, x, { chunkSize: e }, a, r)), (!c || o) && l && (w = new ei(), A = Be(A, w)), xi(this, A, () => {
       if ((!c || o) && l) {
         const P = new DataView(w.value.buffer);
         if (u != P.getUint32(0, !1))
-          throw new Error(ii);
+          throw new Error(si);
       }
     });
   }
 }
-function mi(n) {
-  return Ne(n, new TransformStream({
+function hi(n) {
+  return Be(n, new TransformStream({
     transform(t, e) {
       t && t.length && e.enqueue(t);
     }
   }));
 }
-function hi(n, t, e) {
-  t = Ne(t, new TransformStream({ flush: e })), Object.defineProperty(n, "readable", {
+function xi(n, t, e) {
+  t = Be(t, new TransformStream({ flush: e })), Object.defineProperty(n, "readable", {
     get() {
       return t;
     }
   });
 }
-function xi(n, t, e, r, a) {
+function wi(n, t, e, r, a) {
   try {
     const o = t && r ? r : a;
-    n = Ne(n, new o(Fr, e));
+    n = Be(n, new o(Tr, e));
   } catch {
     if (t)
       try {
-        n = Ne(n, new a(Fr, e));
+        n = Be(n, new a(Tr, e));
       } catch {
         return n;
       }
@@ -6718,16 +6720,16 @@ function xi(n, t, e, r, a) {
   }
   return n;
 }
-function Ne(n, t) {
+function Be(n, t) {
   return n.pipeThrough(t);
 }
-const Da = "message", La = "start", Ua = "pull", Rr = "data", Oa = "ack", Cr = "close", Pa = "deflate", wi = "inflate";
+const La = "message", Ua = "start", Oa = "pull", Fr = "data", Pa = "ack", Rr = "close", Ma = "deflate", _i = "inflate";
 class Ba extends TransformStream {
   constructor(t, e) {
     super({});
     const r = this, { codecType: a } = t;
     let o;
-    a.startsWith(Pa) ? o = Ca : a.startsWith(wi) && (o = Ia);
+    a.startsWith(Ma) ? o = Ia : a.startsWith(_i) && (o = Da);
     let c = 0, l = 0;
     const u = new o(t, e), g = super.readable, x = new TransformStream({
       transform(_, A) {
@@ -6776,13 +6778,13 @@ class Na extends TransformStream {
     }
   }
 }
-let _i = typeof Worker != $e;
+let gi = typeof Worker != $e;
 class mn {
   constructor(t, { readable: e, writable: r }, { options: a, config: o, streamOptions: c, useWebWorkers: l, transferStreams: u, scripts: g }, x) {
     const { signal: w } = c;
     return Object.assign(t, {
       busy: !0,
-      readable: e.pipeThrough(new Na(o.chunkSize)).pipeThrough(new Ma(e, c), { signal: w }),
+      readable: e.pipeThrough(new Na(o.chunkSize)).pipeThrough(new Wa(e, c), { signal: w }),
       writable: r,
       options: Object.assign({}, a),
       scripts: g,
@@ -6797,10 +6799,10 @@ class mn {
         const { resolveTerminated: _ } = t;
         _ && (t.resolveTerminated = null, t.terminated = !0, t.worker.terminate(), _()), t.busy = !1, x(t);
       }
-    }), (l && _i ? Wa : gi)(t, o);
+    }), (l && gi ? qa : bi)(t, o);
   }
 }
-class Ma extends TransformStream {
+class Wa extends TransformStream {
   constructor(t, { onstart: e, onprogress: r, size: a, onend: o }) {
     let c = 0;
     super({
@@ -6822,30 +6824,30 @@ async function hn(n, ...t) {
   } catch {
   }
 }
-function gi(n, t) {
+function bi(n, t) {
   return {
-    run: () => qa(n, t)
+    run: () => ja(n, t)
   };
 }
-function Wa(n, t) {
+function qa(n, t) {
   const { baseURL: e, chunkSize: r } = t;
   if (!n.interface) {
     let a;
     try {
-      a = Ya(n.scripts[0], e, n);
+      a = Ga(n.scripts[0], e, n);
     } catch {
-      return _i = !1, gi(n, t);
+      return gi = !1, bi(n, t);
     }
     Object.assign(n, {
       worker: a,
       interface: {
-        run: () => ja(n, { chunkSize: r })
+        run: () => Ha(n, { chunkSize: r })
       }
     });
   }
   return n.interface;
 }
-async function qa({ options: n, readable: t, writable: e, onTaskFinished: r }, a) {
+async function ja({ options: n, readable: t, writable: e, onTaskFinished: r }, a) {
   try {
     const o = new Ba(n, a);
     await t.pipeThrough(o).pipeTo(e, { preventClose: !0, preventAbort: !0 });
@@ -6863,7 +6865,7 @@ async function qa({ options: n, readable: t, writable: e, onTaskFinished: r }, a
     r();
   }
 }
-async function ja(n, t) {
+async function Ha(n, t) {
   let e, r;
   const a = new Promise((_, A) => {
     e = _, r = A;
@@ -6875,8 +6877,8 @@ async function ja(n, t) {
     rejectResult: r,
     result: a
   });
-  const { readable: o, options: c, scripts: l } = n, { writable: u, closed: g } = Ha(n.writable), x = qt({
-    type: La,
+  const { readable: o, options: c, scripts: l } = n, { writable: u, closed: g } = Ya(n.writable), x = qt({
+    type: Ua,
     scripts: l.slice(1),
     options: c,
     config: t,
@@ -6890,7 +6892,7 @@ async function ja(n, t) {
   const w = await a;
   return x || await u.getWriter().close(), await g, w;
 }
-function Ha(n) {
+function Ya(n) {
   let t;
   const e = new Promise((a) => t = a);
   return { writable: new WritableStream({
@@ -6906,34 +6908,34 @@ function Ha(n) {
     }
   }), closed: e };
 }
-let Ir = !0, Dr = !0;
-function Ya(n, t, e) {
+let Cr = !0, Ir = !0;
+function Ga(n, t, e) {
   const r = { type: "module" };
   let a, o;
-  typeof n == kt && (n = n());
+  typeof n == St && (n = n());
   try {
     a = new URL(n, t);
   } catch {
     a = n;
   }
-  if (Ir)
+  if (Cr)
     try {
       o = new Worker(a);
     } catch {
-      Ir = !1, o = new Worker(a, r);
+      Cr = !1, o = new Worker(a, r);
     }
   else
     o = new Worker(a, r);
-  return o.addEventListener(Da, (c) => Ga(c, e)), o;
+  return o.addEventListener(La, (c) => Va(c, e)), o;
 }
 function qt(n, { worker: t, writer: e, onTaskFinished: r, transferStreams: a }) {
   try {
     const { value: o, readable: c, writable: l } = n, u = [];
-    if (o && (o.byteLength < o.buffer.byteLength ? n.value = o.buffer.slice(0, o.byteLength) : n.value = o.buffer, u.push(n.value)), a && Dr ? (c && u.push(c), l && u.push(l)) : n.readable = n.writable = null, u.length)
+    if (o && (o.byteLength < o.buffer.byteLength ? n.value = o.buffer.slice(0, o.byteLength) : n.value = o.buffer, u.push(n.value)), a && Ir ? (c && u.push(c), l && u.push(l)) : n.readable = n.writable = null, u.length)
       try {
         return t.postMessage(n, u), !0;
       } catch {
-        Dr = !1, n.readable = n.writable = null, t.postMessage(n);
+        Ir = !1, n.readable = n.writable = null, t.postMessage(n);
       }
     else
       t.postMessage(n);
@@ -6941,21 +6943,21 @@ function qt(n, { worker: t, writer: e, onTaskFinished: r, transferStreams: a })
     throw e && e.releaseLock(), r(), o;
   }
 }
-async function Ga({ data: n }, t) {
+async function Va({ data: n }, t) {
   const { type: e, value: r, messageId: a, result: o, error: c } = n, { reader: l, writer: u, resolveResult: g, rejectResult: x, onTaskFinished: w } = t;
   try {
     if (c) {
       const { message: A, stack: P, code: h, name: p } = c, m = new Error(A);
       Object.assign(m, { stack: P, code: h, name: p }), _(m);
     } else {
-      if (e == Ua) {
+      if (e == Oa) {
         const { value: A, done: P } = await l.read();
-        qt({ type: Rr, value: A, done: P, messageId: a }, t);
+        qt({ type: Fr, value: A, done: P, messageId: a }, t);
       }
-      e == Rr && (await u.ready, await u.write(new Uint8Array(r)), qt({ type: Oa, messageId: a }, t)), e == Cr && _(null, o);
+      e == Fr && (await u.ready, await u.write(new Uint8Array(r)), qt({ type: Pa, messageId: a }, t)), e == Rr && _(null, o);
     }
   } catch (A) {
-    qt({ type: Cr, messageId: a }, t), _(A);
+    qt({ type: Rr, messageId: a }, t), _(A);
   }
   function _(A, P) {
     A ? x(A) : g(P), u && u.releaseLock(), w();
@@ -6963,8 +6965,8 @@ async function Ga({ data: n }, t) {
 }
 let tt = [];
 const xn = [];
-let Lr = 0;
-async function Va(n, t) {
+let Dr = 0;
+async function Za(n, t) {
   const { options: e, config: r } = t, { transferStreams: a, useWebWorkers: o, useCompressionStream: c, codecType: l, compressed: u, signed: g, encrypted: x } = e, { workerScripts: w, maxWorkers: _ } = r;
   t.transferStreams = a || a === ve;
   const A = !u && !g && !x && !t.transferStreams;
@@ -6972,10 +6974,10 @@ async function Va(n, t) {
   async function P() {
     const p = tt.find((m) => !m.busy);
     if (p)
-      return Ur(p), new mn(p, n, t, h);
+      return Lr(p), new mn(p, n, t, h);
     if (tt.length < _) {
-      const m = { indexWorker: Lr };
-      return Lr++, tt.push(m), new mn(m, n, t, h);
+      const m = { indexWorker: Dr };
+      return Dr++, tt.push(m), new mn(m, n, t, h);
     } else
       return new Promise((m) => xn.push({ resolve: m, stream: n, workerOptions: t }));
   }
@@ -6983,10 +6985,10 @@ async function Va(n, t) {
     if (xn.length) {
       const [{ resolve: m, stream: E, workerOptions: R }] = xn.splice(0, 1);
       m(new mn(p, E, R, h));
-    } else p.worker ? (Ur(p), Za(p, t)) : tt = tt.filter((m) => m != p);
+    } else p.worker ? (Lr(p), Ka(p, t)) : tt = tt.filter((m) => m != p);
   }
 }
-function Za(n, t) {
+function Ka(n, t) {
   const { config: e } = t, { terminateWorkerTimeout: r } = e;
   Number.isFinite(r) && r >= 0 && (n.terminated ? n.terminated = !1 : n.terminateTimeout = setTimeout(async () => {
     tt = tt.filter((a) => a != n);
@@ -6996,16 +6998,16 @@ function Za(n, t) {
     }
   }, r));
 }
-function Ur(n) {
+function Lr(n) {
   const { terminateTimeout: t } = n;
   t && (clearTimeout(t), n.terminateTimeout = null);
 }
-function Ka(n, t = {}) {
+function Xa(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 Xa = "Writer iterator completed too soon", $a = "Content-Type", Ja = 64 * 1024, bi = "writable";
+const $a = "Writer iterator completed too soon", Ja = "Content-Type", za = 64 * 1024, yi = "writable";
 class Pn {
   constructor() {
     this.size = 0;
@@ -7014,9 +7016,9 @@ class Pn {
     this.initialized = !0;
   }
 }
-class yi extends Pn {
+class vi extends Pn {
   get readable() {
-    const t = this, { chunkSize: e = Ja } = t, r = new ReadableStream({
+    const t = this, { chunkSize: e = za } = t, r = new ReadableStream({
       start() {
         this.chunkOffset = 0;
       },
@@ -7028,7 +7030,7 @@ class yi extends Pn {
     return r;
   }
 }
-class En extends yi {
+class En extends vi {
   constructor(t) {
     super(), Object.assign(this, {
       blob: t,
@@ -7041,11 +7043,11 @@ class En extends yi {
     return c.byteLength > e && (c = c.slice(t, a)), new Uint8Array(c);
   }
 }
-class za extends Pn {
+class Qa extends Pn {
   constructor(t) {
     super();
     const e = this, r = new TransformStream(), a = [];
-    t && a.push([$a, t]), Object.defineProperty(e, bi, {
+    t && a.push([Ja, t]), Object.defineProperty(e, yi, {
       get() {
         return r.writable;
       }
@@ -7055,7 +7057,7 @@ class za extends Pn {
     return this.blob;
   }
 }
-class Qa extends yi {
+class eo extends vi {
   constructor(t) {
     super(), this.readers = t;
   }
@@ -7082,7 +7084,7 @@ class Qa extends yi {
     return a.lastDiskNumber = Math.max(l, a.lastDiskNumber), c;
   }
 }
-class Or extends Pn {
+class Ur extends Pn {
   constructor(t, e = 4294967295) {
     super();
     const r = this;
@@ -7102,7 +7104,7 @@ class Or extends Pn {
         else {
           const { value: _, done: A } = await t.next();
           if (A && !_)
-            throw new Error(Xa);
+            throw new Error($a);
           a = _, a.size = 0, a.maxSize && (r.maxSize = a.maxSize), r.availableSize = r.maxSize, await Xt(a), o = _.writable, c = o.getWriter(), await this.write(x);
         }
       },
@@ -7110,7 +7112,7 @@ class Or extends Pn {
         await c.ready, await g();
       }
     });
-    Object.defineProperty(r, bi, {
+    Object.defineProperty(r, yi, {
       get() {
         return l;
       }
@@ -7130,17 +7132,17 @@ async function Xt(n, t) {
   else
     return Promise.resolve();
 }
-function eo(n) {
-  return Array.isArray(n) && (n = new Qa(n)), n instanceof ReadableStream && (n = {
+function to(n) {
+  return Array.isArray(n) && (n = new eo(n)), n instanceof ReadableStream && (n = {
     readable: n
   }), n;
 }
-function to(n) {
-  n.writable === ve && typeof n.next == kt && (n = new Or(n)), n instanceof WritableStream && (n = {
+function no(n) {
+  n.writable === ve && typeof n.next == St && (n = new Ur(n)), n instanceof WritableStream && (n = {
     writable: n
   });
   const { writable: t } = n;
-  return t.size === ve && (t.size = 0), n instanceof Or || Object.assign(n, {
+  return t.size === ve && (t.size = 0), n instanceof Ur || Object.assign(n, {
     diskNumber: 0,
     diskOffset: 0,
     availableSize: 1 / 0,
@@ -7150,34 +7152,33 @@ function to(n) {
 function _e(n, t, e, r) {
   return n.readUint8Array(t, e, r);
 }
-const vi = "\0☺☻♥♦♣♠•◘○◙♂♀♪♫☼►◄↕‼¶§▬↨↑↓→←∟↔▲▼ !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~⌂ÇüéâäàåçêëèïîìÄÅÉæÆôöòûùÿÖÜ¢£¥₧ƒáíóúñѪº¿⌐¬½¼¡«»░▒▓│┤╡╢╖╕╣║╗╝╜╛┐└┴┬├─┼╞╟╚╔╩╦╠═╬╧╨╤╥╙╘╒╓╫╪┘┌█▄▌▐▀αßΓπΣσµτΦΘΩδ∞φε∩≡±≥≤⌠⌡÷≈°∙·√ⁿ²■ ".split(""), no = vi.length == 256;
-function ro(n) {
-  if (no) {
+const Ei = "\0☺☻♥♦♣♠•◘○◙♂♀♪♫☼►◄↕‼¶§▬↨↑↓→←∟↔▲▼ !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~⌂ÇüéâäàåçêëèïîìÄÅÉæÆôöòûùÿÖÜ¢£¥₧ƒáíóúñѪº¿⌐¬½¼¡«»░▒▓│┤╡╢╖╕╣║╗╝╜╛┐└┴┬├─┼╞╟╚╔╩╦╠═╬╧╨╤╥╙╘╒╓╫╪┘┌█▄▌▐▀αßΓπΣσµτΦΘΩδ∞φε∩≡±≥≤⌠⌡÷≈°∙·√ⁿ²■ ".split(""), ro = Ei.length == 256;
+function io(n) {
+  if (ro) {
     let t = "";
     for (let e = 0; e < n.length; e++)
-      t += vi[n[e]];
+      t += Ei[n[e]];
     return t;
   } else
     return new TextDecoder().decode(n);
 }
 function jt(n, t) {
-  return t && t.trim().toLowerCase() == "cp437" ? ro(n) : new TextDecoder(t).decode(n);
+  return t && t.trim().toLowerCase() == "cp437" ? io(n) : new TextDecoder(t).decode(n);
 }
-const Ei = "filename", ki = "rawFilename", Si = "comment", Ai = "rawComment", Ti = "uncompressedSize", Fi = "compressedSize", Ri = "offset", kn = "diskNumberStart", Sn = "lastModDate", An = "rawLastModDate", Ci = "lastAccessDate", io = "rawLastAccessDate", Ii = "creationDate", so = "rawCreationDate", ao = "internalFileAttribute", oo = "internalFileAttributes", co = "externalFileAttribute", lo = "externalFileAttributes", fo = "msDosCompatible", uo = "zip64", po = "encrypted", mo = "version", ho = "versionMadeBy", xo = "zipCrypto", wo = "directory", _o = "executable", go = [
-  Ei,
+const ki = "filename", Si = "rawFilename", Ai = "comment", Ti = "rawComment", Fi = "uncompressedSize", Ri = "compressedSize", Ci = "offset", kn = "diskNumberStart", Sn = "lastModDate", An = "rawLastModDate", Ii = "lastAccessDate", so = "rawLastAccessDate", Di = "creationDate", ao = "rawCreationDate", oo = "internalFileAttribute", co = "internalFileAttributes", lo = "externalFileAttribute", fo = "externalFileAttributes", uo = "msDosCompatible", po = "zip64", mo = "encrypted", ho = "version", xo = "versionMadeBy", wo = "zipCrypto", _o = "directory", go = "executable", bo = [
   ki,
+  Si,
+  Ri,
   Fi,
-  Ti,
   Sn,
   An,
-  Si,
   Ai,
-  Ci,
+  Ti,
   Ii,
-  Ri,
+  Di,
+  Ci,
   kn,
   kn,
-  ao,
   oo,
   co,
   lo,
@@ -7189,6 +7190,7 @@ const Ei = "filename", ki = "rawFilename", Si = "comment", Ai = "rawComment", Ti
   xo,
   wo,
   _o,
+  go,
   "bitFlag",
   "signature",
   "filenameUTF8",
@@ -7203,17 +7205,17 @@ const Ei = "filename", ki = "rawFilename", Si = "comment", Ai = "rawComment", Ti
   "extraFieldNTFS",
   "extraFieldExtendedTimestamp"
 ];
-class Pr {
+class Or {
   constructor(t) {
-    go.forEach((e) => this[e] = t[e]);
+    bo.forEach((e) => this[e] = t[e]);
   }
 }
-const wn = "File format is not recognized", bo = "End of central directory not found", yo = "End of Zip64 central directory locator not found", vo = "Central directory header not found", Eo = "Local file header not found", ko = "Zip64 extra field not found", So = "File contains encrypted entry", Ao = "Encryption method not supported", Br = "Compression method not supported", Nr = "Split zip file", Mr = "utf-8", Wr = "cp437", To = [
-  [Ti, nt],
+const wn = "File format is not recognized", yo = "End of central directory not found", vo = "End of Zip64 central directory locator not found", Eo = "Central directory header not found", ko = "Local file header not found", So = "Zip64 extra field not found", Ao = "File contains encrypted entry", To = "Encryption method not supported", Pr = "Compression method not supported", Mr = "Split zip file", Br = "utf-8", Nr = "cp437", Fo = [
   [Fi, nt],
   [Ri, nt],
+  [Ci, nt],
   [kn, Ke]
-], Fo = {
+], Ro = {
   [Ke]: {
     getValue: ce,
     bytes: 4
@@ -7223,12 +7225,12 @@ const wn = "File format is not recognized", bo = "End of central directory not f
     bytes: 8
   }
 };
-class qr {
+class Wr {
   constructor(t, e = {}) {
     Object.assign(this, {
-      reader: eo(t),
+      reader: to(t),
       options: e,
-      config: oa()
+      config: ca()
     });
   }
   async *getEntriesGenerator(t = {}) {
@@ -7237,11 +7239,11 @@ class qr {
     const { config: a } = e;
     if (await Xt(r), (r.size === ve || !r.readUint8Array) && (r = new En(await new Response(r.readable).blob()), await Xt(r)), r.size < ct)
       throw new Error(wn);
-    r.chunkSize = ca(a);
-    const o = await Uo(r, Ks, r.size, ct, Ke * 16);
+    r.chunkSize = la(a);
+    const o = await Oo(r, Xs, r.size, ct, Ke * 16);
     if (!o) {
       const v = await _e(r, 0, 4), k = he(v);
-      throw ce(k) == Zs ? new Error(Nr) : new Error(bo);
+      throw ce(k) == Ks ? new Error(Mr) : new Error(yo);
     }
     const c = he(o);
     let l = ce(c, 12), u = ce(c, 16);
@@ -7251,27 +7253,27 @@ class qr {
     let P = me(c, 6), h = me(c, 8), p = 0, m = 0;
     if (u == nt || l == nt || h == Ke || P == Ke) {
       const v = await _e(r, o.offset - un, un), k = he(v);
-      if (ce(k, 0) == Xs) {
+      if (ce(k, 0) == $s) {
         u = Ht(k, 8);
         let W = await _e(r, u, dn, -1), O = he(W);
         const Z = o.offset - un - dn;
-        if (ce(O, 0) != mr && u != Z) {
+        if (ce(O, 0) != pr && u != Z) {
           const H = u;
           u = Z, p = u - H, W = await _e(r, u, dn, -1), O = he(W);
         }
-        if (ce(O, 0) != mr)
-          throw new Error(yo);
+        if (ce(O, 0) != pr)
+          throw new Error(vo);
         _ == Ke && (_ = ce(O, 16)), P == Ke && (P = ce(O, 20)), h == Ke && (h = Ht(O, 32)), l == nt && (l = Ht(O, 40)), u -= l;
       }
     }
     if (u >= r.size && (p = r.size - u - l - ct, u = r.size - l - ct), A != _)
-      throw new Error(Nr);
+      throw new Error(Mr);
     if (u < 0)
       throw new Error(wn);
     let E = 0, R = await _e(r, u, l, P), D = he(R);
     if (l) {
       const v = o.offset - l;
-      if (ce(D, E) != pr && u != v) {
+      if (ce(D, E) != dr && u != v) {
         const k = u;
         u = v, p += u - k, R = await _e(r, u, l, P), D = he(R);
       }
@@ -7281,11 +7283,11 @@ class qr {
       throw new Error(wn);
     const T = be(e, t, "filenameEncoding"), F = be(e, t, "commentEncoding");
     for (let v = 0; v < h; v++) {
-      const k = new Ro(r, a, e.options);
-      if (ce(D, E) != pr)
-        throw new Error(vo);
-      Di(k, D, E + 6);
-      const W = !!k.bitFlag.languageEncodingFlag, O = E + 46, Z = O + k.filenameLength, H = Z + k.extraFieldLength, j = me(D, E + 4), K = j >> 8 == 0, X = j >> 8 == 3, oe = R.subarray(O, Z), G = me(D, E + 32), z = H + G, Y = R.subarray(H, z), ee = W, Ce = W, de = ce(D, E + 38), le = K && (dt(D, E + 38) & _r) == _r || X && (de >> 16 & gr) == gr || oe.length && oe[oe.length - 1] == yr.charCodeAt(0), pt = X && (de >> 16 & br) == br, Me = ce(D, E + 42) + p;
+      const k = new Co(r, a, e.options);
+      if (ce(D, E) != dr)
+        throw new Error(Eo);
+      Li(k, D, E + 6);
+      const W = !!k.bitFlag.languageEncodingFlag, O = E + 46, Z = O + k.filenameLength, H = Z + k.extraFieldLength, j = me(D, E + 4), K = j >> 8 == 0, X = j >> 8 == 3, oe = R.subarray(O, Z), G = me(D, E + 32), z = H + G, Y = R.subarray(H, z), ee = W, Ce = W, de = ce(D, E + 38), le = K && (dt(D, E + 38) & wr) == wr || X && (de >> 16 & _r) == _r || oe.length && oe[oe.length - 1] == br.charCodeAt(0), pt = X && (de >> 16 & gr) == gr, Ne = ce(D, E + 42) + p;
       Object.assign(k, {
         versionMadeBy: j,
         msDosCompatible: K,
@@ -7293,7 +7295,7 @@ class qr {
         uncompressedSize: 0,
         commentLength: G,
         directory: le,
-        offset: Me,
+        offset: Ne,
         diskNumberStart: me(D, E + 34),
         internalFileAttributes: me(D, E + 36),
         externalFileAttributes: de,
@@ -7303,7 +7305,7 @@ class qr {
         rawExtraField: R.subarray(Z, H),
         executable: pt
       }), k.internalFileAttribute = k.internalFileAttributes, k.externalFileAttribute = k.externalFileAttributes;
-      const it = be(e, t, "decodeText") || jt, Je = ee ? Mr : T || Wr, ze = Ce ? Mr : F || Wr;
+      const it = be(e, t, "decodeText") || jt, Je = ee ? Br : T || Nr, ze = Ce ? Br : F || Nr;
       let we = it(oe, Je);
       we === ve && (we = jt(oe, Je));
       let fe = it(Y, ze);
@@ -7311,14 +7313,14 @@ class qr {
         rawComment: Y,
         filename: we,
         comment: fe,
-        directory: le || we.endsWith(yr)
-      }), m = Math.max(Me, m), Li(k, k, D, E + 6), k.zipCrypto = k.encrypted && !k.extraFieldAES;
-      const We = new Pr(k);
+        directory: le || we.endsWith(br)
+      }), m = Math.max(Ne, m), Ui(k, k, D, E + 6), k.zipCrypto = k.encrypted && !k.extraFieldAES;
+      const We = new Or(k);
       We.getData = (f, i) => k.getData(f, We, i), E = z;
       const { onprogress: ue } = t;
       if (ue)
         try {
-          await ue(v + 1, h, new Pr(k));
+          await ue(v + 1, h, new Or(k));
         } catch {
         }
       yield We;
@@ -7335,7 +7337,7 @@ class qr {
   async close() {
   }
 }
-class Ro {
+class Co {
   constructor(t, e, r) {
     Object.assign(this, {
       reader: t,
@@ -7359,22 +7361,22 @@ class Ro {
     } = a, p = e.localDirectory = {}, m = await _e(o, c, 30, l), E = he(m);
     let R = be(a, r, "password"), D = be(a, r, "rawPassword");
     const S = be(a, r, "passThrough");
-    if (R = R && R.length && R, D = D && D.length && D, u && u.originalCompressionMethod != Gs)
-      throw new Error(Br);
-    if (g != Ys && g != Hs && !S)
-      throw new Error(Br);
-    if (ce(E, 0) != Vs)
-      throw new Error(Eo);
-    Di(p, E, 4), p.rawExtraField = p.extraFieldLength ? await _e(o, c + 30 + p.filenameLength, p.extraFieldLength, l) : new Uint8Array(), Li(a, p, E, 4, !0), Object.assign(e, {
+    if (R = R && R.length && R, D = D && D.length && D, u && u.originalCompressionMethod != Vs)
+      throw new Error(Pr);
+    if (g != Gs && g != Ys && !S)
+      throw new Error(Pr);
+    if (ce(E, 0) != Zs)
+      throw new Error(ko);
+    Li(p, E, 4), p.rawExtraField = p.extraFieldLength ? await _e(o, c + 30 + p.filenameLength, p.extraFieldLength, l) : new Uint8Array(), Ui(a, p, E, 4, !0), Object.assign(e, {
       lastAccessDate: p.lastAccessDate,
       creationDate: p.creationDate
     });
     const T = a.encrypted && p.encrypted && !S, F = T && !u;
     if (S || (e.zipCrypto = F), T) {
       if (!F && u.strength === ve)
-        throw new Error(Ao);
+        throw new Error(To);
       if (!R && !D)
-        throw new Error(So);
+        throw new Error(Ao);
     }
     const b = c + 30 + p.filenameLength + p.extraFieldLength, I = h, v = o.readable;
     Object.assign(v, {
@@ -7383,10 +7385,10 @@ class Ro {
       size: I
     });
     const k = be(a, r, "signal"), W = be(a, r, "checkPasswordOnly");
-    W && (t = new WritableStream()), t = to(t), await Xt(t, S ? h : P);
+    W && (t = new WritableStream()), t = no(t), await Xt(t, S ? h : P);
     const { writable: O } = t, { onstart: Z, onprogress: H, onend: j } = r, K = {
       options: {
-        codecType: wi,
+        codecType: _i,
         password: R,
         rawPassword: D,
         zipCrypto: F,
@@ -7406,7 +7408,7 @@ class Ro {
     };
     let X = 0;
     try {
-      ({ outputSize: X } = await Va({ readable: v, writable: O }, K));
+      ({ outputSize: X } = await Za({ readable: v, writable: O }, K));
     } catch (oe) {
       if (!W || oe.message != Ln)
         throw oe;
@@ -7417,23 +7419,23 @@ class Ro {
     return W ? ve : t.getData ? t.getData() : O;
   }
 }
-function Di(n, t, e) {
-  const r = n.rawBitFlag = me(t, e + 2), a = (r & hr) == hr, o = ce(t, e + 6);
+function Li(n, t, e) {
+  const r = n.rawBitFlag = me(t, e + 2), a = (r & mr) == mr, o = ce(t, e + 6);
   Object.assign(n, {
     encrypted: a,
     version: me(t, e),
     bitFlag: {
-      level: (r & ia) >> 1,
-      dataDescriptor: (r & xr) == xr,
-      languageEncodingFlag: (r & wr) == wr
+      level: (r & sa) >> 1,
+      dataDescriptor: (r & hr) == hr,
+      languageEncodingFlag: (r & xr) == xr
     },
     rawLastModDate: o,
-    lastModDate: Oo(o),
+    lastModDate: Po(o),
     filenameLength: me(t, e + 22),
     extraFieldLength: me(t, e + 24)
   });
 }
-function Li(n, t, e, r, a) {
+function Ui(n, t, e, r, a) {
   const { rawExtraField: o } = t, c = t.extraField = /* @__PURE__ */ new Map(), l = he(new Uint8Array(o));
   let u = 0;
   try {
@@ -7452,34 +7454,34 @@ function Li(n, t, e, r, a) {
     uncompressedSize: ce(e, r + 18),
     compressedSize: ce(e, r + 14)
   });
-  const x = c.get($s);
-  x && (Co(x, t), t.extraFieldZip64 = x);
-  const w = c.get(ta);
-  w && (jr(w, Ei, ki, t, n), t.extraFieldUnicodePath = w);
-  const _ = c.get(na);
-  _ && (jr(_, Si, Ai, t, n), t.extraFieldUnicodeComment = _);
-  const A = c.get(Js);
-  A ? (Io(A, t, g), t.extraFieldAES = A) : t.compressionMethod = g;
-  const P = c.get(zs);
-  P && (Do(P, t), t.extraFieldNTFS = P);
-  const h = c.get(ea);
-  h && (Lo(h, t, a), t.extraFieldExtendedTimestamp = h);
-  const p = c.get(ra);
+  const x = c.get(Js);
+  x && (Io(x, t), t.extraFieldZip64 = x);
+  const w = c.get(na);
+  w && (qr(w, ki, Si, t, n), t.extraFieldUnicodePath = w);
+  const _ = c.get(ra);
+  _ && (qr(_, Ai, Ti, t, n), t.extraFieldUnicodeComment = _);
+  const A = c.get(zs);
+  A ? (Do(A, t, g), t.extraFieldAES = A) : t.compressionMethod = g;
+  const P = c.get(Qs);
+  P && (Lo(P, t), t.extraFieldNTFS = P);
+  const h = c.get(ta);
+  h && (Uo(h, t, a), t.extraFieldExtendedTimestamp = h);
+  const p = c.get(ia);
   p && (t.extraFieldUSDZ = p);
 }
-function Co(n, t) {
+function Io(n, t) {
   t.zip64 = !0;
-  const e = he(n.data), r = To.filter(([a, o]) => t[a] == o);
+  const e = he(n.data), r = Fo.filter(([a, o]) => t[a] == o);
   for (let a = 0, o = 0; a < r.length; a++) {
     const [c, l] = r[a];
     if (t[c] == l) {
-      const u = Fo[l];
+      const u = Ro[l];
       t[c] = n[c] = u.getValue(e, o), o += u.bytes;
     } else if (n[c])
-      throw new Error(ko);
+      throw new Error(So);
   }
 }
-function jr(n, t, e, r, a) {
+function qr(n, t, e, r, a) {
   const o = he(n.data), c = new Zt();
   c.append(a[e]);
   const l = he(new Uint8Array(4));
@@ -7491,7 +7493,7 @@ function jr(n, t, e, r, a) {
     valid: !a.bitFlag.languageEncodingFlag && u == ce(l, 0)
   }), n.valid && (r[t] = n[t], r[t + "UTF8"] = !0);
 }
-function Io(n, t, e) {
+function Do(n, t, e) {
   const r = he(n.data), a = dt(r, 4);
   Object.assign(n, {
     vendorVersion: dt(r, 0),
@@ -7501,13 +7503,13 @@ function Io(n, t, e) {
     compressionMethod: me(r, 5)
   }), t.compressionMethod = n.compressionMethod;
 }
-function Do(n, t) {
+function Lo(n, t) {
   const e = he(n.data);
   let r = 4, a;
   try {
     for (; r < n.data.length && !a; ) {
       const o = me(e, r), c = me(e, r + 2);
-      o == Qs && (a = n.data.slice(r + 4, r + 4 + c)), r += 4 + c;
+      o == ea && (a = n.data.slice(r + 4, r + 4 + c)), r += 4 + c;
     }
   } catch {
   }
@@ -7525,9 +7527,9 @@ function Do(n, t) {
   } catch {
   }
 }
-function Lo(n, t, e) {
+function Uo(n, t, e) {
   const r = he(n.data), a = dt(r, 0), o = [], c = [];
-  e ? ((a & 1) == 1 && (o.push(Sn), c.push(An)), (a & 2) == 2 && (o.push(Ci), c.push(io)), (a & 4) == 4 && (o.push(Ii), c.push(so))) : n.data.length >= 5 && (o.push(Sn), c.push(An));
+  e ? ((a & 1) == 1 && (o.push(Sn), c.push(An)), (a & 2) == 2 && (o.push(Ii), c.push(so)), (a & 4) == 4 && (o.push(Di), c.push(ao))) : n.data.length >= 5 && (o.push(Sn), c.push(An));
   let l = 1;
   o.forEach((u, g) => {
     if (n.data.length >= l + 4) {
@@ -7539,9 +7541,9 @@ function Lo(n, t, e) {
     l += 4;
   });
 }
-async function Uo(n, t, e, r, a) {
+async function Oo(n, t, e, r, a) {
   const o = new Uint8Array(4), c = he(o);
-  Po(c, 0, t);
+  Mo(c, 0, t);
   const l = r + a;
   return await u(r) || await u(Math.min(l, e));
   async function u(g) {
@@ -7557,7 +7559,7 @@ async function Uo(n, t, e, r, a) {
 function be(n, t, e) {
   return t[e] === ve ? n.options[e] : t[e];
 }
-function Oo(n) {
+function Po(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);
@@ -7579,20 +7581,20 @@ function ce(n, t) {
 function Ht(n, t) {
   return Number(n.getBigUint64(t, !0));
 }
-function Po(n, t, e) {
+function Mo(n, t, e) {
   n.setUint32(t, e, !0);
 }
 function he(n) {
   return new DataView(n.buffer);
 }
-let Ui;
+let Oi;
 try {
-  Ui = import.meta.url;
+  Oi = import.meta.url;
 } catch {
 }
-Dn({ baseURL: Ui });
-Ka(Dn);
-Dn({ Deflate: ys, Inflate: js });
+Dn({ baseURL: Oi });
+Xa(Dn);
+Dn({ Deflate: vs, Inflate: Hs });
 class Bo {
   constructor(t) {
     this.fileTree = t;
@@ -7630,19 +7632,19 @@ class $t {
     this.entries = /* @__PURE__ */ new Map(), this.zipReader = t;
   }
   static fromStream(t) {
-    const e = new qr(
+    const e = new Wr(
       new En(new Yt(t, "archive.zip"))
     );
     return new $t(e);
   }
   static fromArrayBuffer(t) {
-    const e = new qr(
+    const e = new Wr(
       new En(new Blob([t]))
     );
     return new $t(e);
   }
   async read(t) {
-    const e = await this.getEntry(t), r = await e.getData(new za());
+    const e = await this.getEntry(t), r = await e.getData(new Qa());
     return new Yt(r.stream(), t, {
       filesize: e.uncompressedSize
     });
@@ -7702,7 +7704,7 @@ class No {
     );
   }
 }
-class Mo {
+class Wo {
   constructor(t) {
     this.root = t;
   }
@@ -7739,7 +7741,7 @@ class Mo {
           )
         ) : e(
           new Yt(
-            Wo(o),
+            qo(o),
             t,
             {
               filesize: l.size
@@ -7750,14 +7752,14 @@ class Mo {
     });
   }
 }
-function Wo(n) {
+function qo(n) {
   return new ReadableStream({
     start(e) {
       n.on("data", (r) => e.enqueue(r)), n.on("end", () => e.close());
     }
   });
 }
-class Oi extends Error {
+class Pi extends Error {
   constructor(t, e) {
     super(t, {
       ...e,
@@ -7774,7 +7776,7 @@ class Oi extends Error {
       if (o instanceof Error) {
         if (o.isReportableInCLI)
           return o;
-        Array.isArray(o.cause) ? a.push(...o.cause) : a.push(o.cause), e++, e >= r && Gi.warn(
+        Array.isArray(o.cause) ? a.push(...o.cause) : a.push(o.cause), e++, e >= r && Vi.warn(
           "Recursion limit exceeded while checking if error is reportable"
         );
       }
@@ -7782,30 +7784,30 @@ class Oi extends Error {
     return null;
   }
 }
-async function qo({
+async function jo({
   sourceString: n,
   blueprintMayReadAdjacentFiles: t
 }) {
   if (!n)
     return;
   if (n.startsWith("http://") || n.startsWith("https://"))
-    return await Yi(n);
-  let e = Ft.resolve(process.cwd(), n);
-  if (!Tt.existsSync(e))
+    return await Gi(n);
+  let e = bt.resolve(process.cwd(), n);
+  if (!Ft.existsSync(e))
     throw new Error(`Blueprint file does not exist: ${e}`);
-  const r = Tt.statSync(e);
-  if (r.isDirectory() && (e = Ft.join(e, "blueprint.json")), !r.isFile() && r.isSymbolicLink())
+  const r = Ft.statSync(e);
+  if (r.isDirectory() && (e = bt.join(e, "blueprint.json")), !r.isFile() && r.isSymbolicLink())
     throw new Error(
       `Blueprint path is neither a file nor a directory: ${e}`
     );
-  const a = Ft.extname(e);
+  const a = bt.extname(e);
   switch (a) {
     case ".zip":
       return $t.fromArrayBuffer(
-        Tt.readFileSync(e)
+        Ft.readFileSync(e)
       );
     case ".json": {
-      const o = Tt.readFileSync(e, "utf-8");
+      const o = Ft.readFileSync(e, "utf-8");
       try {
         JSON.parse(o);
       } catch {
@@ -7813,7 +7815,7 @@ async function qo({
           `Blueprint file at ${e} is not a valid JSON file`
         );
       }
-      const c = Ft.dirname(e), l = new Mo(c);
+      const c = bt.dirname(e), l = new Wo(c);
       return new No([
         new Bo({
           "blueprint.json": o
@@ -7825,7 +7827,7 @@ async function qo({
         {
           read(u) {
             if (!t)
-              throw new Oi(
+              throw new Pi(
                 `Error: Blueprint contained tried to read a local file at path "${u}" (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.`
@@ -7841,8 +7843,40 @@ You can allow this Blueprint to read files from the same parent directory by exp
       );
   }
 }
-async function jo() {
-  const n = qi(process.argv.slice(2)).usage("Usage: wp-playground <command> [options]").positional("command", {
+function jr(n) {
+  const t = [];
+  for (const e of n) {
+    const r = e.split(":");
+    if (r.length !== 2)
+      throw new Error(`Invalid mount format: ${e}.
+				Expected format: /host/path:/vfs/path.
+				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 [a, o] = r;
+    if (!Hr(a))
+      throw new Error(`Host path does not exist: ${a}`);
+    t.push({ hostPath: a, vfsPath: o });
+  }
+  return t;
+}
+function Ho(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], a = n[e + 1];
+    if (!Hr(r))
+      throw new Error(`Host path does not exist: ${r}`);
+    t.push({
+      hostPath: bt.resolve(process.cwd(), r),
+      vfsPath: a
+    });
+  }
+  return t;
+}
+const Yo = () => (async () => "Suspending" in WebAssembly)();
+async function Go() {
+  const n = ji(process.argv.slice(2)).usage("Usage: wp-playground <command> [options]").positional("command", {
     describe: "Command to run",
     choices: ["server", "run-blueprint", "build-snapshot"],
     demandOption: !0
@@ -7857,8 +7891,8 @@ async function jo() {
   }).option("php", {
     describe: "PHP version to use.",
     type: "string",
-    default: Wi,
-    choices: Mi
+    default: qi,
+    choices: Wi
   }).option("wp", {
     describe: "WordPress version to use.",
     type: "string",
@@ -7867,12 +7901,12 @@ async function jo() {
     describe: "Mount a directory to the PHP runtime. You can provide --mount multiple times. Format: /host/path:/vfs/path",
     type: "array",
     string: !0,
-    coerce: Mn
+    coerce: jr
   }).option("mountBeforeInstall", {
     describe: "Mount a directory to the PHP runtime before installing WordPress. You can provide --mount-before-install multiple times. Format: /host/path:/vfs/path",
     type: "array",
     string: !0,
-    coerce: Mn
+    coerce: jr
   }).option("mountDir", {
     describe: 'Mount a directory to the PHP runtime. You can provide --mount-dir multiple times. Format: "/host/path" "/vfs/path"',
     type: "array",
@@ -7884,7 +7918,7 @@ async function jo() {
     type: "string",
     nargs: 2,
     array: !0,
-    coerce: ji
+    coerce: Ho
   }).option("login", {
     describe: "Should log the user in",
     type: "boolean",
@@ -7921,8 +7955,18 @@ async function jo() {
 Warning: Following symlinks will expose files outside mounted directories to Playground and could be a security risk.`,
     type: "boolean",
     default: !1
-  }).showHelpOnFail(!1).check((a) => {
-    if (a.wp !== void 0 && !Vi(a.wp))
+  }).option("experimentalTrace", {
+    describe: "Print detailed messages about system behavior to the console. Useful for troubleshooting.",
+    type: "boolean",
+    default: !1,
+    // Hide this option because we want to replace with a more general log-level flag.
+    hidden: !0
+  }).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: (a) => a ?? Hi().length - 1
+  }).showHelpOnFail(!1).check(async (a) => {
+    if (a.wp !== void 0 && !Zi(a.wp))
       try {
         new URL(a.wp);
       } catch {
@@ -7930,6 +7974,21 @@ Warning: Following symlinks will expose files outside mounted directories to Pla
           'Unrecognized WordPress version. Please use "latest", a URL, or a numeric version such as "6.2", "6.0.1", "6.2-beta1", or "6.2-RC1"'
         );
       }
+    if (a.experimentalMultiWorker !== void 0) {
+      if (a.experimentalMultiWorker <= 1)
+        throw new Error(
+          "The --experimentalMultiWorker flag must be a positive integer greater than 1."
+        );
+      if (!await Yo())
+        throw new Error(
+          "JavaScript Promise Integration (JSPI) is not enabled. Please enable JSPI in your JavaScript runtime before using the --experimentalMultiWorker flag."
+        );
+      const o = (c) => c.vfsPath === "/wordpress";
+      if (!a.mount?.some(o) && !a.mountBeforeInstall?.some(o))
+        throw new Error(
+          "Please mount a real filesystem directory as the /wordpress directory before using the --experimentalMultiWorker flag."
+        );
+    }
     return !0;
   });
   n.wrap(n.terminalWidth());
@@ -7938,7 +7997,7 @@ Warning: Following symlinks will expose files outside mounted directories to Pla
   const r = {
     ...t,
     command: e,
-    blueprint: await qo({
+    blueprint: await jo({
       sourceString: t.blueprint,
       blueprintMayReadAdjacentFiles: t.blueprintMayReadAdjacentFiles
     }),
@@ -7949,14 +8008,14 @@ Warning: Following symlinks will expose files outside mounted directories to Pla
     ]
   };
   try {
-    return Hi(r);
+    return Yi(r);
   } catch (a) {
-    const o = Oi.getReportableCause(a);
+    const o = Pi.getReportableCause(a);
     if (o)
       console.log(""), console.log(o.message), process.exit(1);
     else
       throw a;
   }
 }
-jo();
+Go();
 //# sourceMappingURL=cli.js.map