@seayoo-web/app-info 0.2.2 → 0.3.0

package/dist/index.js

@@ -1,21 +1,26 @@
-import Dt from "jszip";
-function st(e) {
+import Bt from "jszip";
+function ot(e) {
   return typeof e == "string" ? e : `${e}`;
 }
 function _r(e) {
-  return typeof e == "number" ? e : typeof e == "string" ? /^\d+(?:\.\d+)/.test(e) ? +e : Number(e) : NaN;
+  if (typeof e == "number") return e;
+  if (typeof e == "string") {
+    const n = e.match(/^-?\d+(?:\.\d+)?/);
+    return n ? +n[0] : NaN;
+  }
+  return NaN;
 }
-function M(e) {
+function B(e) {
   return e instanceof Error ? e : new Error(String(e));
 }
-function Bt(e) {
+function zt(e) {
   return `data:image/png;base64,${e}`;
 }
-async function zt(e, n, t) {
+async function Mt(e, n, t) {
   const a = e.file(n) || e.filter((l) => l.includes(n))[0];
   if (!a)
     return new Error(`not found ${n}`);
-  const s = await a.async(t).catch(M);
+  const s = await a.async(t).catch(B);
   return s instanceof Error ? new Error(`read ${n} error: ${s.message}`) : { name: a.name, content: s };
 }
 function wr(e) {
@@ -27,17 +32,17 @@ function wr(e) {
     t += String.fromCharCode(n[a]);
   return btoa(t);
 }
-const Ht = Dt.loadAsync;
+const Xt = Bt.loadAsync;
 class Os {
   zip;
   constructor(n) {
-    this.zip = Ht(n).catch(M);
+    this.zip = Xt(n).catch(B);
   }
   async parse(n) {
     const t = await this.zip;
     if (t instanceof Error)
       return new Error(`load file error: ${t.message}`);
-    const a = await yr(t);
+    const a = await yr(t).catch(B);
     if (a instanceof Error)
       return new Error(`read pack.info error: ${a.message}`);
     const s = {
@@ -48,70 +53,70 @@ class Os {
     };
     if (n?.ignoreIcon)
       return s;
-    const l = a.packages.find((I) => I.moduleType === "entry");
+    const l = a.packages.find((T) => T.moduleType === "entry");
     if (!l)
       return s;
-    const c = t.file(`${l.name}.hap`);
-    if (!c)
+    const d = t.file(`${l.name}.hap`);
+    if (!d)
       return s;
-    const d = await c.async("arraybuffer").catch(M);
-    if (d instanceof Error)
+    const c = await d.async("uint8array").catch(B);
+    if (c instanceof Error)
       return s;
-    const x = await Ht(d).catch(M);
+    const x = await Xt(c).catch(B);
     if (x instanceof Error)
       return s;
-    const g = await br(x);
+    const g = await br(x).catch(B);
     if (g instanceof Error)
       return s;
-    const _ = await Er(x, g.app.icon);
-    return _ instanceof Error || (s.icon = Bt(_)), s;
+    const w = await Er(x, g).catch(B);
+    return w instanceof Error || (s.icon = zt(w.iconData), s.iconPath = w.iconPath), s;
   }
   /**
    * 读取指定文件的内容
    */
   async readFile(n, t) {
     const a = await this.zip;
-    return a instanceof Error ? new Error(`load file error: ${a.message}`) : await zt(a, n, t);
+    return a instanceof Error ? new Error(`load file error: ${a.message}`) : await Mt(a, n, t);
   }
 }
 async function yr(e) {
   const n = e.file("pack.info");
   if (!n)
-    return new Error("not found pack.info file");
-  const t = await n.async("text").catch(M);
+    throw new Error("not found pack.info file");
+  const t = await n.async("text").catch(B);
   if (t instanceof Error)
-    return new Error(`read pack.info file error: ${t.message}`);
+    throw new Error(`read pack.info file error: ${t.message}`);
   if (!t)
-    return new Error("pack.info file is empty");
+    throw new Error("pack.info file is empty");
   try {
     return JSON.parse(t);
   } catch (a) {
-    const s = M(a);
-    return new Error(`parse pack.info file error: ${s.message}`);
+    throw new Error(`parse pack.info file error: ${B(a).message}`);
   }
 }
 async function br(e) {
   const n = e.file("module.json") || e.file("module.json5");
   if (!n)
-    return new Error("not found module.json file");
-  const t = await n.async("text").catch(M);
+    throw new Error("not found module.json file");
+  const t = await n.async("text").catch(B);
   if (t instanceof Error)
-    return new Error(`read module.json file error: ${t.message}`);
+    throw new Error(`read module.json file error: ${t.message}`);
   if (!t)
-    return new Error("module.json file is empty");
+    throw new Error("module.json file is empty");
   try {
     return JSON.parse(t);
   } catch (a) {
-    const s = M(a);
-    return new Error(`parse module.json file error: ${s.message}`);
+    throw new Error(`parse module.json file error: ${B(a).message}`);
   }
 }
 async function Er(e, n) {
-  const a = `resources/base/media/${(n || "app_icon").replace(/(?:^\$media:|\.[a-z]+$)/gi, "")}.png`, s = e.file(a);
-  if (!s)
-    return new Error(`not found icon file at ${a}`);
-  const l = await s.async("base64").catch(M);
-  return l instanceof Error ? new Error(`read icon file error: ${l.message}`) : l;
+  const s = `resources/base/media/${(n.module.mainElement && n.module.abilities.find((c) => c.name === n.module.mainElement)?.icon || n.app.icon || "app_icon").replace(/(?:^\$media:|\.[a-z]+$)/gi, "")}.png`, l = e.file(s);
+  if (!l)
+    throw new Error(`not found icon file at ${s}`);
+  const d = await l.async("base64").catch(B);
+  if (d instanceof Error)
+    throw new Error(`read icon file error: ${d.message}`);
+  return { iconData: d, iconPath: s };
 }
 function vr(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
@@ -119,99 +124,94 @@ function vr(e) {
 function Oi(e) {
   throw new Error('Could not dynamically require "' + e + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
-var et = { exports: {} }, tt = { exports: {} }, xr = tt.exports, Xt;
+var tt = { exports: {} }, it = { exports: {} }, xr = it.exports, Vt;
 function Tr() {
-  return Xt || (Xt = 1, function(e) {
-    /**
-     * @license long.js (c) 2013 Daniel Wirtz <dcode@dcode.io>
-     * Released under the Apache License, Version 2.0
-     * see: https://github.com/dcodeIO/long.js for details
-     */
+  return Vt || (Vt = 1, (function(e) {
     (function(n, t) {
       typeof Oi == "function" && e && e.exports ? e.exports = t() : (n.dcodeIO = n.dcodeIO || {}).Long = t();
     })(xr, function() {
-      function n(y, u, T) {
-        this.low = y | 0, this.high = u | 0, this.unsigned = !!T;
+      function n(b, u, I) {
+        this.low = b | 0, this.high = u | 0, this.unsigned = !!I;
       }
       n.prototype.__isLong__, Object.defineProperty(n.prototype, "__isLong__", {
         value: !0,
         enumerable: !1,
         configurable: !1
       });
-      function t(y) {
-        return (y && y.__isLong__) === !0;
+      function t(b) {
+        return (b && b.__isLong__) === !0;
       }
       n.isLong = t;
       var a = {}, s = {};
-      function l(y, u) {
-        var T, S, N;
-        return u ? (y >>>= 0, (N = 0 <= y && y < 256) && (S = s[y], S) ? S : (T = d(y, (y | 0) < 0 ? -1 : 0, !0), N && (s[y] = T), T)) : (y |= 0, (N = -128 <= y && y < 128) && (S = a[y], S) ? S : (T = d(y, y < 0 ? -1 : 0, !1), N && (a[y] = T), T));
+      function l(b, u) {
+        var I, S, N;
+        return u ? (b >>>= 0, (N = 0 <= b && b < 256) && (S = s[b], S) ? S : (I = c(b, (b | 0) < 0 ? -1 : 0, !0), N && (s[b] = I), I)) : (b |= 0, (N = -128 <= b && b < 128) && (S = a[b], S) ? S : (I = c(b, b < 0 ? -1 : 0, !1), N && (a[b] = I), I));
       }
       n.fromInt = l;
-      function c(y, u) {
-        if (isNaN(y) || !isFinite(y))
-          return u ? w : p;
+      function d(b, u) {
+        if (isNaN(b) || !isFinite(b))
+          return u ? _ : p;
         if (u) {
-          if (y < 0)
-            return w;
-          if (y >= o)
+          if (b < 0)
+            return _;
+          if (b >= o)
             return F;
         } else {
-          if (y <= -h)
+          if (b <= -h)
             return k;
-          if (y + 1 >= h)
+          if (b + 1 >= h)
             return A;
         }
-        return y < 0 ? c(-y, u).neg() : d(y % r | 0, y / r | 0, u);
+        return b < 0 ? d(-b, u).neg() : c(b % r | 0, b / r | 0, u);
       }
-      n.fromNumber = c;
-      function d(y, u, T) {
-        return new n(y, u, T);
+      n.fromNumber = d;
+      function c(b, u, I) {
+        return new n(b, u, I);
       }
-      n.fromBits = d;
+      n.fromBits = c;
       var x = Math.pow;
-      function g(y, u, T) {
-        if (y.length === 0)
+      function g(b, u, I) {
+        if (b.length === 0)
           throw Error("empty string");
-        if (y === "NaN" || y === "Infinity" || y === "+Infinity" || y === "-Infinity")
+        if (b === "NaN" || b === "Infinity" || b === "+Infinity" || b === "-Infinity")
           return p;
-        if (typeof u == "number" ? (T = u, u = !1) : u = !!u, T = T || 10, T < 2 || 36 < T)
+        if (typeof u == "number" ? (I = u, u = !1) : u = !!u, I = I || 10, I < 2 || 36 < I)
           throw RangeError("radix");
         var S;
-        if ((S = y.indexOf("-")) > 0)
+        if ((S = b.indexOf("-")) > 0)
           throw Error("interior hyphen");
         if (S === 0)
-          return g(y.substring(1), u, T).neg();
-        for (var N = c(x(T, 8)), U = p, R = 0; R < y.length; R += 8) {
-          var O = Math.min(8, y.length - R), B = parseInt(y.substring(R, R + O), T);
+          return g(b.substring(1), u, I).neg();
+        for (var N = d(x(I, 8)), U = p, R = 0; R < b.length; R += 8) {
+          var O = Math.min(8, b.length - R), z = parseInt(b.substring(R, R + O), I);
           if (O < 8) {
-            var V = c(x(T, O));
-            U = U.mul(V).add(c(B));
+            var V = d(x(I, O));
+            U = U.mul(V).add(d(z));
           } else
-            U = U.mul(N), U = U.add(c(B));
+            U = U.mul(N), U = U.add(d(z));
         }
         return U.unsigned = u, U;
       }
       n.fromString = g;
-      function _(y) {
-        return y instanceof n ? y : typeof y == "number" ? c(y) : typeof y == "string" ? g(y) : d(y.low, y.high, y.unsigned);
+      function w(b) {
+        return b instanceof n ? b : typeof b == "number" ? d(b) : typeof b == "string" ? g(b) : c(b.low, b.high, b.unsigned);
       }
-      n.fromValue = _;
-      var I = 65536, i = 1 << 24, r = I * I, o = r * r, h = o / 2, f = l(i), p = l(0);
+      n.fromValue = w;
+      var T = 65536, i = 1 << 24, r = T * T, o = r * r, h = o / 2, f = l(i), p = l(0);
       n.ZERO = p;
-      var w = l(0, !0);
-      n.UZERO = w;
-      var b = l(1);
-      n.ONE = b;
-      var E = l(1, !0);
-      n.UONE = E;
+      var _ = l(0, !0);
+      n.UZERO = _;
+      var E = l(1);
+      n.ONE = E;
+      var y = l(1, !0);
+      n.UONE = y;
       var m = l(-1);
       n.NEG_ONE = m;
-      var A = d(-1, 2147483647, !1);
+      var A = c(-1, 2147483647, !1);
       n.MAX_VALUE = A;
-      var F = d(-1, -1, !0);
+      var F = c(-1, -1, !0);
       n.MAX_UNSIGNED_VALUE = F;
-      var k = d(0, -2147483648, !1);
+      var k = c(0, -2147483648, !1);
       n.MIN_VALUE = k;
       var v = n.prototype;
       return v.toInt = function() {
@@ -225,13 +225,13 @@ function Tr() {
           return "0";
         if (this.isNegative())
           if (this.eq(k)) {
-            var T = c(u), S = this.div(T), N = S.mul(T).sub(this);
+            var I = d(u), S = this.div(I), N = S.mul(I).sub(this);
             return S.toString(u) + N.toInt().toString(u);
           } else
             return "-" + this.neg().toString(u);
-        for (var U = c(x(u, 6), this.unsigned), R = this, O = ""; ; ) {
-          var B = R.div(U), V = R.sub(B.mul(U)).toInt() >>> 0, H = V.toString(u);
-          if (R = B, R.isZero())
+        for (var U = d(x(u, 6), this.unsigned), R = this, O = ""; ; ) {
+          var z = R.div(U), V = R.sub(z.mul(U)).toInt() >>> 0, H = V.toString(u);
+          if (R = z, R.isZero())
             return H + O;
           for (; H.length < 6; )
             H = "0" + H;
@@ -248,9 +248,9 @@ function Tr() {
       }, v.getNumBitsAbs = function() {
         if (this.isNegative())
           return this.eq(k) ? 64 : this.neg().getNumBitsAbs();
-        for (var u = this.high != 0 ? this.high : this.low, T = 31; T > 0 && (u & 1 << T) == 0; T--)
+        for (var u = this.high != 0 ? this.high : this.low, I = 31; I > 0 && (u & 1 << I) == 0; I--)
           ;
-        return this.high != 0 ? T + 33 : T + 1;
+        return this.high != 0 ? I + 33 : I + 1;
       }, v.isZero = function() {
         return this.high === 0 && this.low === 0;
       }, v.isNegative = function() {
@@ -262,7 +262,7 @@ function Tr() {
       }, v.isEven = function() {
         return (this.low & 1) === 0;
       }, v.equals = function(u) {
-        return t(u) || (u = _(u)), this.unsigned !== u.unsigned && this.high >>> 31 === 1 && u.high >>> 31 === 1 ? !1 : this.high === u.high && this.low === u.low;
+        return t(u) || (u = w(u)), this.unsigned !== u.unsigned && this.high >>> 31 === 1 && u.high >>> 31 === 1 ? !1 : this.high === u.high && this.low === u.low;
       }, v.eq = v.equals, v.notEquals = function(u) {
         return !this.eq(
           /* validates */
@@ -289,20 +289,20 @@ function Tr() {
           u
         ) >= 0;
       }, v.gte = v.greaterThanOrEqual, v.compare = function(u) {
-        if (t(u) || (u = _(u)), this.eq(u))
+        if (t(u) || (u = w(u)), this.eq(u))
           return 0;
-        var T = this.isNegative(), S = u.isNegative();
-        return T && !S ? -1 : !T && S ? 1 : this.unsigned ? u.high >>> 0 > this.high >>> 0 || u.high === this.high && u.low >>> 0 > this.low >>> 0 ? -1 : 1 : this.sub(u).isNegative() ? -1 : 1;
+        var I = this.isNegative(), S = u.isNegative();
+        return I && !S ? -1 : !I && S ? 1 : this.unsigned ? u.high >>> 0 > this.high >>> 0 || u.high === this.high && u.low >>> 0 > this.low >>> 0 ? -1 : 1 : this.sub(u).isNegative() ? -1 : 1;
       }, v.comp = v.compare, v.negate = function() {
-        return !this.unsigned && this.eq(k) ? k : this.not().add(b);
+        return !this.unsigned && this.eq(k) ? k : this.not().add(E);
       }, v.neg = v.negate, v.add = function(u) {
-        t(u) || (u = _(u));
-        var T = this.high >>> 16, S = this.high & 65535, N = this.low >>> 16, U = this.low & 65535, R = u.high >>> 16, O = u.high & 65535, B = u.low >>> 16, V = u.low & 65535, H = 0, Z = 0, Y = 0, re = 0;
-        return re += U + V, Y += re >>> 16, re &= 65535, Y += N + B, Z += Y >>> 16, Y &= 65535, Z += S + O, H += Z >>> 16, Z &= 65535, H += T + R, H &= 65535, d(Y << 16 | re, H << 16 | Z, this.unsigned);
+        t(u) || (u = w(u));
+        var I = this.high >>> 16, S = this.high & 65535, N = this.low >>> 16, U = this.low & 65535, R = u.high >>> 16, O = u.high & 65535, z = u.low >>> 16, V = u.low & 65535, H = 0, Z = 0, Y = 0, re = 0;
+        return re += U + V, Y += re >>> 16, re &= 65535, Y += N + z, Z += Y >>> 16, Y &= 65535, Z += S + O, H += Z >>> 16, Z &= 65535, H += I + R, H &= 65535, c(Y << 16 | re, H << 16 | Z, this.unsigned);
       }, v.subtract = function(u) {
-        return t(u) || (u = _(u)), this.add(u.neg());
+        return t(u) || (u = w(u)), this.add(u.neg());
       }, v.sub = v.subtract, v.multiply = function(u) {
-        if (this.isZero() || (t(u) || (u = _(u)), u.isZero()))
+        if (this.isZero() || (t(u) || (u = w(u)), u.isZero()))
           return p;
         if (this.eq(k))
           return u.isOdd() ? k : p;
@@ -313,31 +313,31 @@ function Tr() {
         if (u.isNegative())
           return this.mul(u.neg()).neg();
         if (this.lt(f) && u.lt(f))
-          return c(this.toNumber() * u.toNumber(), this.unsigned);
-        var T = this.high >>> 16, S = this.high & 65535, N = this.low >>> 16, U = this.low & 65535, R = u.high >>> 16, O = u.high & 65535, B = u.low >>> 16, V = u.low & 65535, H = 0, Z = 0, Y = 0, re = 0;
-        return re += U * V, Y += re >>> 16, re &= 65535, Y += N * V, Z += Y >>> 16, Y &= 65535, Y += U * B, Z += Y >>> 16, Y &= 65535, Z += S * V, H += Z >>> 16, Z &= 65535, Z += N * B, H += Z >>> 16, Z &= 65535, Z += U * O, H += Z >>> 16, Z &= 65535, H += T * V + S * B + N * O + U * R, H &= 65535, d(Y << 16 | re, H << 16 | Z, this.unsigned);
+          return d(this.toNumber() * u.toNumber(), this.unsigned);
+        var I = this.high >>> 16, S = this.high & 65535, N = this.low >>> 16, U = this.low & 65535, R = u.high >>> 16, O = u.high & 65535, z = u.low >>> 16, V = u.low & 65535, H = 0, Z = 0, Y = 0, re = 0;
+        return re += U * V, Y += re >>> 16, re &= 65535, Y += N * V, Z += Y >>> 16, Y &= 65535, Y += U * z, Z += Y >>> 16, Y &= 65535, Z += S * V, H += Z >>> 16, Z &= 65535, Z += N * z, H += Z >>> 16, Z &= 65535, Z += U * O, H += Z >>> 16, Z &= 65535, H += I * V + S * z + N * O + U * R, H &= 65535, c(Y << 16 | re, H << 16 | Z, this.unsigned);
       }, v.mul = v.multiply, v.divide = function(u) {
-        if (t(u) || (u = _(u)), u.isZero())
+        if (t(u) || (u = w(u)), u.isZero())
           throw Error("division by zero");
         if (this.isZero())
-          return this.unsigned ? w : p;
-        var T, S, N;
+          return this.unsigned ? _ : p;
+        var I, S, N;
         if (this.unsigned) {
           if (u.unsigned || (u = u.toUnsigned()), u.gt(this))
-            return w;
+            return _;
           if (u.gt(this.shru(1)))
-            return E;
-          N = w;
+            return y;
+          N = _;
         } else {
           if (this.eq(k)) {
-            if (u.eq(b) || u.eq(m))
+            if (u.eq(E) || u.eq(m))
               return k;
             if (u.eq(k))
-              return b;
+              return E;
             var U = this.shr(1);
-            return T = U.div(u).shl(1), T.eq(p) ? u.isNegative() ? b : m : (S = this.sub(u.mul(T)), N = T.add(S.div(u)), N);
+            return I = U.div(u).shl(1), I.eq(p) ? u.isNegative() ? E : m : (S = this.sub(u.mul(I)), N = I.add(S.div(u)), N);
           } else if (u.eq(k))
-            return this.unsigned ? w : p;
+            return this.unsigned ? _ : p;
           if (this.isNegative())
             return u.isNegative() ? this.neg().div(u.neg()) : this.neg().div(u).neg();
           if (u.isNegative())
@@ -345,59 +345,59 @@ function Tr() {
           N = p;
         }
         for (S = this; S.gte(u); ) {
-          T = Math.max(1, Math.floor(S.toNumber() / u.toNumber()));
-          for (var R = Math.ceil(Math.log(T) / Math.LN2), O = R <= 48 ? 1 : x(2, R - 48), B = c(T), V = B.mul(u); V.isNegative() || V.gt(S); )
-            T -= O, B = c(T, this.unsigned), V = B.mul(u);
-          B.isZero() && (B = b), N = N.add(B), S = S.sub(V);
+          I = Math.max(1, Math.floor(S.toNumber() / u.toNumber()));
+          for (var R = Math.ceil(Math.log(I) / Math.LN2), O = R <= 48 ? 1 : x(2, R - 48), z = d(I), V = z.mul(u); V.isNegative() || V.gt(S); )
+            I -= O, z = d(I, this.unsigned), V = z.mul(u);
+          z.isZero() && (z = E), N = N.add(z), S = S.sub(V);
         }
         return N;
       }, v.div = v.divide, v.modulo = function(u) {
-        return t(u) || (u = _(u)), this.sub(this.div(u).mul(u));
+        return t(u) || (u = w(u)), this.sub(this.div(u).mul(u));
       }, v.mod = v.modulo, v.not = function() {
-        return d(~this.low, ~this.high, this.unsigned);
+        return c(~this.low, ~this.high, this.unsigned);
       }, v.and = function(u) {
-        return t(u) || (u = _(u)), d(this.low & u.low, this.high & u.high, this.unsigned);
+        return t(u) || (u = w(u)), c(this.low & u.low, this.high & u.high, this.unsigned);
       }, v.or = function(u) {
-        return t(u) || (u = _(u)), d(this.low | u.low, this.high | u.high, this.unsigned);
+        return t(u) || (u = w(u)), c(this.low | u.low, this.high | u.high, this.unsigned);
       }, v.xor = function(u) {
-        return t(u) || (u = _(u)), d(this.low ^ u.low, this.high ^ u.high, this.unsigned);
+        return t(u) || (u = w(u)), c(this.low ^ u.low, this.high ^ u.high, this.unsigned);
       }, v.shiftLeft = function(u) {
-        return t(u) && (u = u.toInt()), (u &= 63) === 0 ? this : u < 32 ? d(this.low << u, this.high << u | this.low >>> 32 - u, this.unsigned) : d(0, this.low << u - 32, this.unsigned);
+        return t(u) && (u = u.toInt()), (u &= 63) === 0 ? this : u < 32 ? c(this.low << u, this.high << u | this.low >>> 32 - u, this.unsigned) : c(0, this.low << u - 32, this.unsigned);
       }, v.shl = v.shiftLeft, v.shiftRight = function(u) {
-        return t(u) && (u = u.toInt()), (u &= 63) === 0 ? this : u < 32 ? d(this.low >>> u | this.high << 32 - u, this.high >> u, this.unsigned) : d(this.high >> u - 32, this.high >= 0 ? 0 : -1, this.unsigned);
+        return t(u) && (u = u.toInt()), (u &= 63) === 0 ? this : u < 32 ? c(this.low >>> u | this.high << 32 - u, this.high >> u, this.unsigned) : c(this.high >> u - 32, this.high >= 0 ? 0 : -1, this.unsigned);
       }, v.shr = v.shiftRight, v.shiftRightUnsigned = function(u) {
         if (t(u) && (u = u.toInt()), u &= 63, u === 0)
           return this;
-        var T = this.high;
+        var I = this.high;
         if (u < 32) {
           var S = this.low;
-          return d(S >>> u | T << 32 - u, T >>> u, this.unsigned);
-        } else return u === 32 ? d(T, 0, this.unsigned) : d(T >>> u - 32, 0, this.unsigned);
+          return c(S >>> u | I << 32 - u, I >>> u, this.unsigned);
+        } else return u === 32 ? c(I, 0, this.unsigned) : c(I >>> u - 32, 0, this.unsigned);
       }, v.shru = v.shiftRightUnsigned, v.toSigned = function() {
-        return this.unsigned ? d(this.low, this.high, !1) : this;
+        return this.unsigned ? c(this.low, this.high, !1) : this;
       }, v.toUnsigned = function() {
-        return this.unsigned ? this : d(this.low, this.high, !0);
-      }, v.toBytes = function(y) {
-        return y ? this.toBytesLE() : this.toBytesBE();
+        return this.unsigned ? this : c(this.low, this.high, !0);
+      }, v.toBytes = function(b) {
+        return b ? this.toBytesLE() : this.toBytesBE();
       }, v.toBytesLE = function() {
-        var y = this.high, u = this.low;
+        var b = this.high, u = this.low;
         return [
           u & 255,
           u >>> 8 & 255,
           u >>> 16 & 255,
           u >>> 24 & 255,
-          y & 255,
-          y >>> 8 & 255,
-          y >>> 16 & 255,
-          y >>> 24 & 255
+          b & 255,
+          b >>> 8 & 255,
+          b >>> 16 & 255,
+          b >>> 24 & 255
         ];
       }, v.toBytesBE = function() {
-        var y = this.high, u = this.low;
+        var b = this.high, u = this.low;
         return [
-          y >>> 24 & 255,
-          y >>> 16 & 255,
-          y >>> 8 & 255,
-          y & 255,
+          b >>> 24 & 255,
+          b >>> 16 & 255,
+          b >>> 8 & 255,
+          b & 255,
           u >>> 24 & 255,
           u >>> 16 & 255,
           u >>> 8 & 255,
@@ -405,26 +405,20 @@ function Tr() {
         ];
       }, n;
     });
-  }(tt)), tt.exports;
+  })(it)), it.exports;
 }
-var Ir = et.exports, Vt;
+var Ir = tt.exports, Yt;
 function Fr() {
-  return Vt || (Vt = 1, function(e) {
-    /**
-     * @license bytebuffer.js (c) 2015 Daniel Wirtz <dcode@dcode.io>
-     * Backing buffer: ArrayBuffer, Accessor: Uint8Array
-     * Released under the Apache License, Version 2.0
-     * see: https://github.com/dcodeIO/bytebuffer.js for details
-     */
+  return Yt || (Yt = 1, (function(e) {
     (function(n, t) {
-      typeof Oi == "function" && e && e.exports ? e.exports = function() {
+      typeof Oi == "function" && e && e.exports ? e.exports = (function() {
         var a;
         try {
           a = Tr();
         } catch {
         }
         return t(a);
-      }() : (n.dcodeIO = n.dcodeIO || {}).ByteBuffer = t(n.dcodeIO.Long);
+      })() : (n.dcodeIO = n.dcodeIO || {}).ByteBuffer = t(n.dcodeIO.Long);
     })(Ir, function(n) {
       var t = function(i, r, o) {
         if (typeof i > "u" && (i = t.DEFAULT_CAPACITY), typeof r > "u" && (r = t.DEFAULT_ENDIAN), typeof o > "u" && (o = t.DEFAULT_NOASSERT), !o) {
@@ -442,13 +436,13 @@ function Fr() {
         configurable: !1
       });
       var s = new ArrayBuffer(0), l = String.fromCharCode;
-      function c(i) {
+      function d(i) {
         var r = 0;
         return function() {
           return r < i.length ? i.charCodeAt(r++) : null;
         };
       }
-      function d() {
+      function c() {
         var i = [], r = [];
         return function() {
           if (arguments.length === 0)
@@ -462,14 +456,14 @@ function Fr() {
         return new t(i, r, o);
       }, t.concat = function(i, r, o, h) {
         (typeof r == "boolean" || typeof r != "string") && (h = o, o = r, r = void 0);
-        for (var f = 0, p = 0, w = i.length, b; p < w; ++p)
-          t.isByteBuffer(i[p]) || (i[p] = t.wrap(i[p], r)), b = i[p].limit - i[p].offset, b > 0 && (f += b);
+        for (var f = 0, p = 0, _ = i.length, E; p < _; ++p)
+          t.isByteBuffer(i[p]) || (i[p] = t.wrap(i[p], r)), E = i[p].limit - i[p].offset, E > 0 && (f += E);
         if (f === 0)
           return new t(0, o, h);
-        var E = new t(f, o, h), m;
-        for (p = 0; p < w; )
-          m = i[p++], b = m.limit - m.offset, !(b <= 0) && (E.view.set(m.view.subarray(m.offset, m.limit), E.offset), E.offset += b);
-        return E.limit = E.offset, E.offset = 0, E;
+        var y = new t(f, o, h), m;
+        for (p = 0; p < _; )
+          m = i[p++], E = m.limit - m.offset, !(E <= 0) && (y.view.set(m.view.subarray(m.offset, m.limit), y.offset), y.offset += E);
+        return y.limit = y.offset, y.offset = 0, y;
       }, t.isByteBuffer = function(i) {
         return (i && i.__isByteBuffer__) === !0;
       }, t.type = function() {
@@ -516,26 +510,26 @@ function Fr() {
           if (r >>>= 0, r < 0 || r + 0 > this.buffer.byteLength)
             throw RangeError("Illegal offset: 0 <= " + r + " (+0) <= " + this.buffer.byteLength);
         }
-        var h = r, f = i.length, p = f >> 3, w = 0, b;
+        var h = r, f = i.length, p = f >> 3, _ = 0, E;
         for (r += this.writeVarint32(f, r); p--; )
-          b = !!i[w++] & 1 | (!!i[w++] & 1) << 1 | (!!i[w++] & 1) << 2 | (!!i[w++] & 1) << 3 | (!!i[w++] & 1) << 4 | (!!i[w++] & 1) << 5 | (!!i[w++] & 1) << 6 | (!!i[w++] & 1) << 7, this.writeByte(b, r++);
-        if (w < f) {
-          var E = 0;
-          for (b = 0; w < f; ) b = b | (!!i[w++] & 1) << E++;
-          this.writeByte(b, r++);
+          E = !!i[_++] & 1 | (!!i[_++] & 1) << 1 | (!!i[_++] & 1) << 2 | (!!i[_++] & 1) << 3 | (!!i[_++] & 1) << 4 | (!!i[_++] & 1) << 5 | (!!i[_++] & 1) << 6 | (!!i[_++] & 1) << 7, this.writeByte(E, r++);
+        if (_ < f) {
+          var y = 0;
+          for (E = 0; _ < f; ) E = E | (!!i[_++] & 1) << y++;
+          this.writeByte(E, r++);
         }
         return o ? (this.offset = r, this) : r - h;
       }, a.readBitSet = function(i) {
         var r = typeof i > "u";
         r && (i = this.offset);
-        var o = this.readVarint32(i), h = o.value, f = h >> 3, p = 0, w = [], b;
+        var o = this.readVarint32(i), h = o.value, f = h >> 3, p = 0, _ = [], E;
         for (i += o.length; f--; )
-          b = this.readByte(i++), w[p++] = !!(b & 1), w[p++] = !!(b & 2), w[p++] = !!(b & 4), w[p++] = !!(b & 8), w[p++] = !!(b & 16), w[p++] = !!(b & 32), w[p++] = !!(b & 64), w[p++] = !!(b & 128);
+          E = this.readByte(i++), _[p++] = !!(E & 1), _[p++] = !!(E & 2), _[p++] = !!(E & 4), _[p++] = !!(E & 8), _[p++] = !!(E & 16), _[p++] = !!(E & 32), _[p++] = !!(E & 64), _[p++] = !!(E & 128);
         if (p < h) {
-          var E = 0;
-          for (b = this.readByte(i++); p < h; ) w[p++] = !!(b >> E++ & 1);
+          var y = 0;
+          for (E = this.readByte(i++); p < h; ) _[p++] = !!(E >> y++ & 1);
         }
-        return r && (this.offset = i), w;
+        return r && (this.offset = i), _;
       }, a.readBytes = function(i, r) {
         var o = typeof r > "u";
         if (o && (r = this.offset), !this.noAssert) {
@@ -748,27 +742,27 @@ function Fr() {
         return r && (this.offset += 8), f;
       }, a.readUInt64 = a.readUint64);
       function x(i, r, o, h, f) {
-        var p, w, b = f * 8 - h - 1, E = (1 << b) - 1, m = E >> 1, A = -7, F = o ? f - 1 : 0, k = o ? -1 : 1, v = i[r + F];
-        for (F += k, p = v & (1 << -A) - 1, v >>= -A, A += b; A > 0; p = p * 256 + i[r + F], F += k, A -= 8)
+        var p, _, E = f * 8 - h - 1, y = (1 << E) - 1, m = y >> 1, A = -7, F = o ? f - 1 : 0, k = o ? -1 : 1, v = i[r + F];
+        for (F += k, p = v & (1 << -A) - 1, v >>= -A, A += E; A > 0; p = p * 256 + i[r + F], F += k, A -= 8)
           ;
-        for (w = p & (1 << -A) - 1, p >>= -A, A += h; A > 0; w = w * 256 + i[r + F], F += k, A -= 8)
+        for (_ = p & (1 << -A) - 1, p >>= -A, A += h; A > 0; _ = _ * 256 + i[r + F], F += k, A -= 8)
           ;
         if (p === 0)
           p = 1 - m;
         else {
-          if (p === E)
-            return w ? NaN : (v ? -1 : 1) * (1 / 0);
-          w = w + Math.pow(2, h), p = p - m;
+          if (p === y)
+            return _ ? NaN : (v ? -1 : 1) * (1 / 0);
+          _ = _ + Math.pow(2, h), p = p - m;
         }
-        return (v ? -1 : 1) * w * Math.pow(2, p - h);
+        return (v ? -1 : 1) * _ * Math.pow(2, p - h);
       }
       function g(i, r, o, h, f, p) {
-        var w, b, E, m = p * 8 - f - 1, A = (1 << m) - 1, F = A >> 1, k = f === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, v = h ? 0 : p - 1, y = h ? 1 : -1, u = r < 0 || r === 0 && 1 / r < 0 ? 1 : 0;
-        for (r = Math.abs(r), isNaN(r) || r === 1 / 0 ? (b = isNaN(r) ? 1 : 0, w = A) : (w = Math.floor(Math.log(r) / Math.LN2), r * (E = Math.pow(2, -w)) < 1 && (w--, E *= 2), w + F >= 1 ? r += k / E : r += k * Math.pow(2, 1 - F), r * E >= 2 && (w++, E /= 2), w + F >= A ? (b = 0, w = A) : w + F >= 1 ? (b = (r * E - 1) * Math.pow(2, f), w = w + F) : (b = r * Math.pow(2, F - 1) * Math.pow(2, f), w = 0)); f >= 8; i[o + v] = b & 255, v += y, b /= 256, f -= 8)
+        var _, E, y, m = p * 8 - f - 1, A = (1 << m) - 1, F = A >> 1, k = f === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, v = h ? 0 : p - 1, b = h ? 1 : -1, u = r < 0 || r === 0 && 1 / r < 0 ? 1 : 0;
+        for (r = Math.abs(r), isNaN(r) || r === 1 / 0 ? (E = isNaN(r) ? 1 : 0, _ = A) : (_ = Math.floor(Math.log(r) / Math.LN2), r * (y = Math.pow(2, -_)) < 1 && (_--, y *= 2), _ + F >= 1 ? r += k / y : r += k * Math.pow(2, 1 - F), r * y >= 2 && (_++, y /= 2), _ + F >= A ? (E = 0, _ = A) : _ + F >= 1 ? (E = (r * y - 1) * Math.pow(2, f), _ = _ + F) : (E = r * Math.pow(2, F - 1) * Math.pow(2, f), _ = 0)); f >= 8; i[o + v] = E & 255, v += b, E /= 256, f -= 8)
           ;
-        for (w = w << f | b, m += f; m > 0; i[o + v] = w & 255, v += y, w /= 256, m -= 8)
+        for (_ = _ << f | E, m += f; m > 0; i[o + v] = _ & 255, v += b, _ /= 256, m -= 8)
           ;
-        i[o + v - y] |= u * 128;
+        i[o + v - b] |= u * 128;
       }
       a.writeFloat32 = function(i, r) {
         var o = typeof r > "u";
@@ -886,14 +880,14 @@ function Fr() {
             throw RangeError("Illegal offset: 0 <= " + r + " (+0) <= " + this.buffer.byteLength);
         }
         typeof i == "number" ? i = n.fromNumber(i, !1) : typeof i == "string" ? i = n.fromString(i, !1) : i.unsigned !== !1 && (i = i.toSigned());
-        var h = t.calculateVarint64(i), f = i.toInt() >>> 0, p = i.shiftRightUnsigned(28).toInt() >>> 0, w = i.shiftRightUnsigned(56).toInt() >>> 0;
+        var h = t.calculateVarint64(i), f = i.toInt() >>> 0, p = i.shiftRightUnsigned(28).toInt() >>> 0, _ = i.shiftRightUnsigned(56).toInt() >>> 0;
         r += h;
-        var b = this.buffer.byteLength;
-        switch (r > b && this.resize((b *= 2) > r ? b : r), r -= h, h) {
+        var E = this.buffer.byteLength;
+        switch (r > E && this.resize((E *= 2) > r ? E : r), r -= h, h) {
           case 10:
-            this.view[r + 9] = w >>> 7 & 1;
+            this.view[r + 9] = _ >>> 7 & 1;
           case 9:
-            this.view[r + 8] = h !== 9 ? w | 128 : w & 127;
+            this.view[r + 8] = h !== 9 ? _ | 128 : _ & 127;
           case 8:
             this.view[r + 7] = h !== 8 ? p >>> 21 | 128 : p >>> 21 & 127;
           case 7:
@@ -922,12 +916,12 @@ function Fr() {
           if (i >>>= 0, i < 0 || i + 1 > this.buffer.byteLength)
             throw RangeError("Illegal offset: 0 <= " + i + " (+1) <= " + this.buffer.byteLength);
         }
-        var o = i, h = 0, f = 0, p = 0, w = 0;
-        if (w = this.view[i++], h = w & 127, w & 128 && (w = this.view[i++], h |= (w & 127) << 7, (w & 128 || this.noAssert && typeof w > "u") && (w = this.view[i++], h |= (w & 127) << 14, (w & 128 || this.noAssert && typeof w > "u") && (w = this.view[i++], h |= (w & 127) << 21, (w & 128 || this.noAssert && typeof w > "u") && (w = this.view[i++], f = w & 127, (w & 128 || this.noAssert && typeof w > "u") && (w = this.view[i++], f |= (w & 127) << 7, (w & 128 || this.noAssert && typeof w > "u") && (w = this.view[i++], f |= (w & 127) << 14, (w & 128 || this.noAssert && typeof w > "u") && (w = this.view[i++], f |= (w & 127) << 21, (w & 128 || this.noAssert && typeof w > "u") && (w = this.view[i++], p = w & 127, (w & 128 || this.noAssert && typeof w > "u") && (w = this.view[i++], p |= (w & 127) << 7, w & 128 || this.noAssert && typeof w > "u"))))))))))
+        var o = i, h = 0, f = 0, p = 0, _ = 0;
+        if (_ = this.view[i++], h = _ & 127, _ & 128 && (_ = this.view[i++], h |= (_ & 127) << 7, (_ & 128 || this.noAssert && typeof _ > "u") && (_ = this.view[i++], h |= (_ & 127) << 14, (_ & 128 || this.noAssert && typeof _ > "u") && (_ = this.view[i++], h |= (_ & 127) << 21, (_ & 128 || this.noAssert && typeof _ > "u") && (_ = this.view[i++], f = _ & 127, (_ & 128 || this.noAssert && typeof _ > "u") && (_ = this.view[i++], f |= (_ & 127) << 7, (_ & 128 || this.noAssert && typeof _ > "u") && (_ = this.view[i++], f |= (_ & 127) << 14, (_ & 128 || this.noAssert && typeof _ > "u") && (_ = this.view[i++], f |= (_ & 127) << 21, (_ & 128 || this.noAssert && typeof _ > "u") && (_ = this.view[i++], p = _ & 127, (_ & 128 || this.noAssert && typeof _ > "u") && (_ = this.view[i++], p |= (_ & 127) << 7, _ & 128 || this.noAssert && typeof _ > "u"))))))))))
           throw Error("Buffer overrun");
-        var b = n.fromBits(h | f << 28, f >>> 4 | p << 24, !1);
-        return r ? (this.offset = i, b) : {
-          value: b,
+        var E = n.fromBits(h | f << 28, f >>> 4 | p << 24, !1);
+        return r ? (this.offset = i, E) : {
+          value: E,
           length: i - o
         };
       }, a.readVarint64ZigZag = function(i) {
@@ -948,10 +942,10 @@ function Fr() {
           if (r >>>= 0, r < 0 || r + 0 > this.buffer.byteLength)
             throw RangeError("Illegal offset: 0 <= " + r + " (+0) <= " + this.buffer.byteLength);
         }
-        f = I.calculateUTF16asUTF8(c(i))[1], r += f + 1;
+        f = T.calculateUTF16asUTF8(d(i))[1], r += f + 1;
         var p = this.buffer.byteLength;
-        return r > p && this.resize((p *= 2) > r ? p : r), r -= f + 1, I.encodeUTF16toUTF8(c(i), (function(w) {
-          this.view[r++] = w;
+        return r > p && this.resize((p *= 2) > r ? p : r), r -= f + 1, T.encodeUTF16toUTF8(d(i), (function(_) {
+          this.view[r++] = _;
         }).bind(this)), this.view[r++] = 0, o ? (this.offset = r, this) : f;
       }, a.readCString = function(i) {
         var r = typeof i > "u";
@@ -962,12 +956,12 @@ function Fr() {
             throw RangeError("Illegal offset: 0 <= " + i + " (+1) <= " + this.buffer.byteLength);
         }
         var o = i, h, f = -1;
-        return I.decodeUTF8toUTF16((function() {
+        return T.decodeUTF8toUTF16((function() {
           if (f === 0) return null;
           if (i >= this.limit)
             throw RangeError("Illegal range: Truncated data, " + i + " < " + this.limit);
           return f = this.view[i++], f === 0 ? null : f;
-        }).bind(this), h = d(), !0), r ? (this.offset = i, h()) : {
+        }).bind(this), h = c(), !0), r ? (this.offset = i, h()) : {
           string: h(),
           length: i - o
         };
@@ -982,10 +976,10 @@ function Fr() {
             throw RangeError("Illegal offset: 0 <= " + r + " (+0) <= " + this.buffer.byteLength);
         }
         var h = r, f;
-        f = I.calculateUTF16asUTF8(c(i), this.noAssert)[1], r += 4 + f;
+        f = T.calculateUTF16asUTF8(d(i), this.noAssert)[1], r += 4 + f;
         var p = this.buffer.byteLength;
-        if (r > p && this.resize((p *= 2) > r ? p : r), r -= 4 + f, this.littleEndian ? (this.view[r + 3] = f >>> 24 & 255, this.view[r + 2] = f >>> 16 & 255, this.view[r + 1] = f >>> 8 & 255, this.view[r] = f & 255) : (this.view[r] = f >>> 24 & 255, this.view[r + 1] = f >>> 16 & 255, this.view[r + 2] = f >>> 8 & 255, this.view[r + 3] = f & 255), r += 4, I.encodeUTF16toUTF8(c(i), (function(w) {
-          this.view[r++] = w;
+        if (r > p && this.resize((p *= 2) > r ? p : r), r -= 4 + f, this.littleEndian ? (this.view[r + 3] = f >>> 24 & 255, this.view[r + 2] = f >>> 16 & 255, this.view[r + 1] = f >>> 8 & 255, this.view[r] = f & 255) : (this.view[r] = f >>> 24 & 255, this.view[r + 1] = f >>> 16 & 255, this.view[r + 2] = f >>> 8 & 255, this.view[r + 3] = f & 255), r += 4, T.encodeUTF16toUTF8(d(i), (function(_) {
+          this.view[r++] = _;
         }).bind(this)), r !== h + 4 + f)
           throw RangeError("Illegal range: Truncated data, " + r + " == " + (r + 4 + f));
         return o ? (this.offset = r, this) : r - h;
@@ -1011,15 +1005,15 @@ function Fr() {
             throw RangeError("Illegal offset: 0 <= " + r + " (+0) <= " + this.buffer.byteLength);
         }
         var h, f = r;
-        h = I.calculateUTF16asUTF8(c(i))[1], r += h;
+        h = T.calculateUTF16asUTF8(d(i))[1], r += h;
         var p = this.buffer.byteLength;
-        return r > p && this.resize((p *= 2) > r ? p : r), r -= h, I.encodeUTF16toUTF8(c(i), (function(w) {
-          this.view[r++] = w;
+        return r > p && this.resize((p *= 2) > r ? p : r), r -= h, T.encodeUTF16toUTF8(d(i), (function(_) {
+          this.view[r++] = _;
         }).bind(this)), o ? (this.offset = r, this) : r - f;
       }, a.writeString = a.writeUTF8String, t.calculateUTF8Chars = function(i) {
-        return I.calculateUTF16asUTF8(c(i))[0];
+        return T.calculateUTF16asUTF8(d(i))[0];
       }, t.calculateUTF8Bytes = function(i) {
-        return I.calculateUTF16asUTF8(c(i))[1];
+        return T.calculateUTF16asUTF8(d(i))[1];
       }, t.calculateString = t.calculateUTF8Bytes, a.readUTF8String = function(i, r, o) {
         typeof r == "number" && (o = r, r = void 0);
         var h = typeof o > "u";
@@ -1031,16 +1025,16 @@ function Fr() {
           if (o >>>= 0, o < 0 || o + 0 > this.buffer.byteLength)
             throw RangeError("Illegal offset: 0 <= " + o + " (+0) <= " + this.buffer.byteLength);
         }
-        var f = 0, p = o, w;
+        var f = 0, p = o, _;
         if (r === t.METRICS_CHARS) {
-          if (w = d(), I.decodeUTF8((function() {
+          if (_ = c(), T.decodeUTF8((function() {
             return f < i && o < this.limit ? this.view[o++] : null;
-          }).bind(this), function(E) {
-            ++f, I.UTF8toUTF16(E, w);
+          }).bind(this), function(y) {
+            ++f, T.UTF8toUTF16(y, _);
           }), f !== i)
             throw RangeError("Illegal range: Truncated data, " + f + " == " + i);
-          return h ? (this.offset = o, w()) : {
-            string: w(),
+          return h ? (this.offset = o, _()) : {
+            string: _(),
             length: o - p
           };
         } else if (r === t.METRICS_BYTES) {
@@ -1050,13 +1044,13 @@ function Fr() {
             if (o >>>= 0, o < 0 || o + i > this.buffer.byteLength)
               throw RangeError("Illegal offset: 0 <= " + o + " (+" + i + ") <= " + this.buffer.byteLength);
           }
-          var b = o + i;
-          if (I.decodeUTF8toUTF16((function() {
-            return o < b ? this.view[o++] : null;
-          }).bind(this), w = d(), this.noAssert), o !== b)
-            throw RangeError("Illegal range: Truncated data, " + o + " == " + b);
-          return h ? (this.offset = o, w()) : {
-            string: w(),
+          var E = o + i;
+          if (T.decodeUTF8toUTF16((function() {
+            return o < E ? this.view[o++] : null;
+          }).bind(this), _ = c(), this.noAssert), o !== E)
+            throw RangeError("Illegal range: Truncated data, " + o + " == " + E);
+          return h ? (this.offset = o, _()) : {
+            string: _(),
             length: o - p
           };
         } else
@@ -1072,10 +1066,10 @@ function Fr() {
             throw RangeError("Illegal offset: 0 <= " + r + " (+0) <= " + this.buffer.byteLength);
         }
         var h = r, f, p;
-        f = I.calculateUTF16asUTF8(c(i), this.noAssert)[1], p = t.calculateVarint32(f), r += p + f;
-        var w = this.buffer.byteLength;
-        if (r > w && this.resize((w *= 2) > r ? w : r), r -= p + f, r += this.writeVarint32(f, r), I.encodeUTF16toUTF8(c(i), (function(b) {
-          this.view[r++] = b;
+        f = T.calculateUTF16asUTF8(d(i), this.noAssert)[1], p = t.calculateVarint32(f), r += p + f;
+        var _ = this.buffer.byteLength;
+        if (r > _ && this.resize((_ *= 2) > r ? _ : r), r -= p + f, r += this.writeVarint32(f, r), T.encodeUTF16toUTF8(d(i), (function(E) {
+          this.view[r++] = E;
         }).bind(this)), r !== h + f + p)
           throw RangeError("Illegal range: Truncated data, " + r + " == " + (r + f + p));
         return o ? (this.offset = r, this) : r - h;
@@ -1155,8 +1149,8 @@ function Fr() {
           throw RangeError("Illegal target range: 0 <= " + r + " <= " + i.buffer.byteLength);
         if (o < 0 || h > this.buffer.byteLength)
           throw RangeError("Illegal source range: 0 <= " + o + " <= " + this.buffer.byteLength);
-        var w = h - o;
-        return w === 0 ? i : (i.ensureCapacity(r + w), i.view.set(this.view.subarray(o, h), r), f && (this.offset += w), p && (i.offset += w), this);
+        var _ = h - o;
+        return _ === 0 ? i : (i.ensureCapacity(r + _), i.view.set(this.view.subarray(o, h), r), f && (this.offset += _), p && (i.offset += _), this);
       }, a.ensureCapacity = function(i) {
         var r = this.buffer.byteLength;
         return r < i ? this.resize((r *= 2) > i ? r : i) : this;
@@ -1208,8 +1202,8 @@ function Fr() {
         if (f <= 0) return this;
         var p = f - o;
         if (p > 0) {
-          var w = new ArrayBuffer(this.buffer.byteLength + p), b = new Uint8Array(w);
-          b.set(this.view.subarray(o, this.buffer.byteLength), f), this.buffer = w, this.view = b, this.offset += p, this.markedOffset >= 0 && (this.markedOffset += p), this.limit += p, o += p;
+          var _ = new ArrayBuffer(this.buffer.byteLength + p), E = new Uint8Array(_);
+          E.set(this.view.subarray(o, this.buffer.byteLength), f), this.buffer = _, this.view = E, this.offset += p, this.markedOffset >= 0 && (this.markedOffset += p), this.limit += p, o += p;
         } else
           new Uint8Array(this.buffer);
         return this.view.set(i.view.subarray(i.offset, i.limit), o - f), i.offset = i.limit, h && (this.offset -= f), this;
@@ -1307,7 +1301,7 @@ function Fr() {
             throw Error("Unsupported encoding: " + i);
         }
       };
-      var _ = function() {
+      var w = (function() {
         for (var i = {}, r = [
           65,
           66,
@@ -1375,44 +1369,44 @@ function Fr() {
           47
         ], o = [], h = 0, f = r.length; h < f; ++h)
           o[r[h]] = h;
-        return i.encode = function(p, w) {
-          for (var b, E; (b = p()) !== null; )
-            w(r[b >> 2 & 63]), E = (b & 3) << 4, (b = p()) !== null ? (E |= b >> 4 & 15, w(r[(E | b >> 4 & 15) & 63]), E = (b & 15) << 2, (b = p()) !== null ? (w(r[(E | b >> 6 & 3) & 63]), w(r[b & 63])) : (w(r[E & 63]), w(61))) : (w(r[E & 63]), w(61), w(61));
-        }, i.decode = function(p, w) {
-          var b, E, m;
+        return i.encode = function(p, _) {
+          for (var E, y; (E = p()) !== null; )
+            _(r[E >> 2 & 63]), y = (E & 3) << 4, (E = p()) !== null ? (y |= E >> 4 & 15, _(r[(y | E >> 4 & 15) & 63]), y = (E & 15) << 2, (E = p()) !== null ? (_(r[(y | E >> 6 & 3) & 63]), _(r[E & 63])) : (_(r[y & 63]), _(61))) : (_(r[y & 63]), _(61), _(61));
+        }, i.decode = function(p, _) {
+          var E, y, m;
           function A(F) {
             throw Error("Illegal character code: " + F);
           }
-          for (; (b = p()) !== null; )
-            if (E = o[b], typeof E > "u" && A(b), (b = p()) !== null && (m = o[b], typeof m > "u" && A(b), w(E << 2 >>> 0 | (m & 48) >> 4), (b = p()) !== null)) {
-              if (E = o[b], typeof E > "u") {
-                if (b === 61) break;
-                A(b);
+          for (; (E = p()) !== null; )
+            if (y = o[E], typeof y > "u" && A(E), (E = p()) !== null && (m = o[E], typeof m > "u" && A(E), _(y << 2 >>> 0 | (m & 48) >> 4), (E = p()) !== null)) {
+              if (y = o[E], typeof y > "u") {
+                if (E === 61) break;
+                A(E);
               }
-              if (w((m & 15) << 4 >>> 0 | (E & 60) >> 2), (b = p()) !== null) {
-                if (m = o[b], typeof m > "u") {
-                  if (b === 61) break;
-                  A(b);
+              if (_((m & 15) << 4 >>> 0 | (y & 60) >> 2), (E = p()) !== null) {
+                if (m = o[E], typeof m > "u") {
+                  if (E === 61) break;
+                  A(E);
                 }
-                w((E & 3) << 6 >>> 0 | m);
+                _((y & 3) << 6 >>> 0 | m);
               }
             }
         }, i.test = function(p) {
           return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(p);
         }, i;
-      }();
+      })();
       a.toBase64 = function(i, r) {
         if (typeof i > "u" && (i = this.offset), typeof r > "u" && (r = this.limit), i = i | 0, r = r | 0, i < 0 || r > this.capacity || i > r)
           throw RangeError("begin, end");
         var o;
-        return _.encode((function() {
+        return w.encode((function() {
           return i < r ? this.view[i++] : null;
-        }).bind(this), o = d()), o();
+        }).bind(this), o = c()), o();
       }, t.fromBase64 = function(i, r) {
         if (typeof i != "string")
           throw TypeError("str");
         var o = new t(i.length / 4 * 3, r), h = 0;
-        return _.decode(c(i), function(f) {
+        return w.decode(d(i), function(f) {
           o.view[h++] = f;
         }), o.limit = h, o;
       }, t.btoa = function(i) {
@@ -1437,24 +1431,24 @@ function Fr() {
         }
         return p.limit = h, p;
       }, a.toDebug = function(i) {
-        for (var r = -1, o = this.buffer.byteLength, h, f = "", p = "", w = ""; r < o; ) {
+        for (var r = -1, o = this.buffer.byteLength, h, f = "", p = "", _ = ""; r < o; ) {
           if (r !== -1 && (h = this.view[r], h < 16 ? f += "0" + h.toString(16).toUpperCase() : f += h.toString(16).toUpperCase(), i && (p += h > 32 && h < 127 ? String.fromCharCode(h) : ".")), ++r, i && r > 0 && r % 16 === 0 && r !== o) {
-            for (; f.length < 3 * 16 + 3; ) f += " ";
-            w += f + p + `
+            for (; f.length < 51; ) f += " ";
+            _ += f + p + `
 `, f = p = "";
           }
           r === this.offset && r === this.limit ? f += r === this.markedOffset ? "!" : "|" : r === this.offset ? f += r === this.markedOffset ? "[" : "<" : r === this.limit ? f += r === this.markedOffset ? "]" : ">" : f += r === this.markedOffset ? "'" : i || r !== 0 && r !== o ? " " : "";
         }
         if (i && f !== " ") {
-          for (; f.length < 3 * 16 + 3; )
+          for (; f.length < 51; )
             f += " ";
-          w += f + p + `
+          _ += f + p + `
 `;
         }
-        return i ? w : f;
+        return i ? _ : f;
       }, t.fromDebug = function(i, r, o) {
-        for (var h = i.length, f = new t((h + 1) / 3 | 0, r, o), p = 0, w = 0, b, E, m = !1, A = !1, F = !1, k = !1, v = !1; p < h; ) {
-          switch (b = i.charAt(p++)) {
+        for (var h = i.length, f = new t((h + 1) / 3 | 0, r, o), p = 0, _ = 0, E, y, m = !1, A = !1, F = !1, k = !1, v = !1; p < h; ) {
+          switch (E = i.charAt(p++)) {
             case "!":
               if (!o) {
                 if (A || F || k) {
@@ -1463,7 +1457,7 @@ function Fr() {
                 }
                 A = F = k = !0;
               }
-              f.offset = f.markedOffset = f.limit = w, m = !1;
+              f.offset = f.markedOffset = f.limit = _, m = !1;
               break;
             case "|":
               if (!o) {
@@ -1473,7 +1467,7 @@ function Fr() {
                 }
                 A = k = !0;
               }
-              f.offset = f.limit = w, m = !1;
+              f.offset = f.limit = _, m = !1;
               break;
             case "[":
               if (!o) {
@@ -1483,7 +1477,7 @@ function Fr() {
                 }
                 A = F = !0;
               }
-              f.offset = f.markedOffset = w, m = !1;
+              f.offset = f.markedOffset = _, m = !1;
               break;
             case "<":
               if (!o) {
@@ -1493,7 +1487,7 @@ function Fr() {
                 }
                 A = !0;
               }
-              f.offset = w, m = !1;
+              f.offset = _, m = !1;
               break;
             case "]":
               if (!o) {
@@ -1503,7 +1497,7 @@ function Fr() {
                 }
                 k = F = !0;
               }
-              f.limit = f.markedOffset = w, m = !1;
+              f.limit = f.markedOffset = _, m = !1;
               break;
             case ">":
               if (!o) {
@@ -1513,7 +1507,7 @@ function Fr() {
                 }
                 k = !0;
               }
-              f.limit = w, m = !1;
+              f.limit = _, m = !1;
               break;
             case "'":
               if (!o) {
@@ -1523,7 +1517,7 @@ function Fr() {
                 }
                 F = !0;
               }
-              f.markedOffset = w, m = !1;
+              f.markedOffset = _, m = !1;
               break;
             case " ":
               m = !1;
@@ -1533,9 +1527,9 @@ function Fr() {
                 v = !0;
                 break;
               }
-              if (E = parseInt(b + i.charAt(p++), 16), !o && (isNaN(E) || E < 0 || E > 255))
+              if (y = parseInt(E + i.charAt(p++), 16), !o && (isNaN(y) || y < 0 || y > 255))
                 throw TypeError("Illegal str: Not a debug encoded string");
-              f.view[w++] = E, m = !0;
+              f.view[_++] = y, m = !0;
           }
           if (v)
             throw TypeError("Illegal str: Invalid symbol at " + p);
@@ -1543,8 +1537,8 @@ function Fr() {
         if (!o) {
           if (!A || !k)
             throw TypeError("Illegal str: Missing offset or limit");
-          if (w < f.buffer.byteLength)
-            throw TypeError("Illegal str: Not a debug encoded string (is it hex?) " + w + " < " + h);
+          if (_ < f.buffer.byteLength)
+            throw TypeError("Illegal str: Not a debug encoded string (is it hex?) " + _ + " < " + h);
         }
         return f;
       }, a.toHex = function(i, r) {
@@ -1566,14 +1560,14 @@ function Fr() {
           if (i.length % 2 !== 0)
             throw TypeError("Illegal str: Length not a multiple of 2");
         }
-        for (var h = i.length, f = new t(h / 2 | 0, r), p, w = 0, b = 0; w < h; w += 2) {
-          if (p = parseInt(i.substring(w, w + 2), 16), !o && (!isFinite(p) || p < 0 || p > 255))
+        for (var h = i.length, f = new t(h / 2 | 0, r), p, _ = 0, E = 0; _ < h; _ += 2) {
+          if (p = parseInt(i.substring(_, _ + 2), 16), !o && (!isFinite(p) || p < 0 || p > 255))
             throw TypeError("Illegal str: Contains non-hex characters");
-          f.view[b++] = p;
+          f.view[E++] = p;
         }
-        return f.limit = b, f;
+        return f.limit = E, f;
       };
-      var I = function() {
+      var T = (function() {
         var i = {};
         return i.MAX_CODEPOINT = 1114111, i.encodeUTF8 = function(r, o) {
           var h = null;
@@ -1582,19 +1576,19 @@ function Fr() {
           }); h !== null || (h = r()) !== null; )
             h < 128 ? o(h & 127) : h < 2048 ? (o(h >> 6 & 31 | 192), o(h & 63 | 128)) : h < 65536 ? (o(h >> 12 & 15 | 224), o(h >> 6 & 63 | 128), o(h & 63 | 128)) : (o(h >> 18 & 7 | 240), o(h >> 12 & 63 | 128), o(h >> 6 & 63 | 128), o(h & 63 | 128)), h = null;
         }, i.decodeUTF8 = function(r, o) {
-          for (var h, f, p, w, b = function(E) {
-            E = E.slice(0, E.indexOf(null));
-            var m = Error(E.toString());
-            throw m.name = "TruncatedError", m.bytes = E, m;
+          for (var h, f, p, _, E = function(y) {
+            y = y.slice(0, y.indexOf(null));
+            var m = Error(y.toString());
+            throw m.name = "TruncatedError", m.bytes = y, m;
           }; (h = r()) !== null; )
             if ((h & 128) === 0)
               o(h);
             else if ((h & 224) === 192)
-              (f = r()) === null && b([h, f]), o((h & 31) << 6 | f & 63);
+              (f = r()) === null && E([h, f]), o((h & 31) << 6 | f & 63);
             else if ((h & 240) === 224)
-              ((f = r()) === null || (p = r()) === null) && b([h, f, p]), o((h & 15) << 12 | (f & 63) << 6 | p & 63);
+              ((f = r()) === null || (p = r()) === null) && E([h, f, p]), o((h & 15) << 12 | (f & 63) << 6 | p & 63);
             else if ((h & 248) === 240)
-              ((f = r()) === null || (p = r()) === null || (w = r()) === null) && b([h, f, p, w]), o((h & 7) << 18 | (f & 63) << 12 | (p & 63) << 6 | w & 63);
+              ((f = r()) === null || (p = r()) === null || (_ = r()) === null) && E([h, f, p, _]), o((h & 7) << 18 | (f & 63) << 12 | (p & 63) << 6 | _ & 63);
             else throw RangeError("Illegal starting byte: " + h);
         }, i.UTF16toUTF8 = function(r, o) {
           for (var h, f = null; (h = f !== null ? f : r()) !== null; ) {
@@ -1631,7 +1625,7 @@ function Fr() {
             ++o, h += f < 128 ? 1 : f < 2048 ? 2 : f < 65536 ? 3 : 4;
           }), [o, h];
         }, i;
-      }();
+      })();
       return a.toUTF8 = function(i, r) {
         if (typeof i > "u" && (i = this.offset), typeof r > "u" && (r = this.limit), !this.noAssert) {
           if (typeof i != "number" || i % 1 !== 0)
@@ -1643,9 +1637,9 @@ function Fr() {
         }
         var o;
         try {
-          I.decodeUTF8toUTF16((function() {
+          T.decodeUTF8toUTF16((function() {
             return i < r ? this.view[i++] : null;
-          }).bind(this), o = d());
+          }).bind(this), o = c());
         } catch {
           if (i !== r)
             throw RangeError("Illegal range: Truncated data, " + i + " != " + r);
@@ -1654,13 +1648,13 @@ function Fr() {
       }, t.fromUTF8 = function(i, r, o) {
         if (!o && typeof i != "string")
           throw TypeError("Illegal str: Not a string");
-        var h = new t(I.calculateUTF16asUTF8(c(i), !0)[1], r, o), f = 0;
-        return I.encodeUTF16toUTF8(c(i), function(p) {
+        var h = new t(T.calculateUTF16asUTF8(d(i), !0)[1], r, o), f = 0;
+        return T.encodeUTF16toUTF8(d(i), function(p) {
           h.view[f++] = p;
         }), h.limit = f, h;
       }, t;
     });
-  }(et)), et.exports;
+  })(tt)), tt.exports;
 }
 var mr = Fr();
 const le = /* @__PURE__ */ vr(mr), kr = 1, Ar = 2, Sr = 512, Nr = 513, Ur = 514, Lr = 1, Rr = 3;
@@ -1695,33 +1689,33 @@ class fe {
    * @return {Record<string, string[]>}
    */
   processResourceTable(n) {
-    const t = le.wrap(n, "binary", !0), a = t.readShort(), s = t.readShort(), l = t.readInt(), c = t.readInt();
-    let d, x;
+    const t = le.wrap(n, "binary", !0), a = t.readShort(), s = t.readShort(), l = t.readInt(), d = t.readInt();
+    let c, x;
     if (a !== Ar)
       throw new Error("No RES_TABLE_TYPE found!");
     if (l !== t.limit)
       throw new Error("The buffer size not matches to the resource table size.");
     t.offset = s;
-    let g = 0, _ = 0;
+    let g = 0, w = 0;
     for (; ; ) {
-      let I, i, r;
+      let T, i, r;
       try {
-        I = t.offset, i = t.readShort(), t.readShort(), r = t.readInt();
+        T = t.offset, i = t.readShort(), t.readShort(), r = t.readInt();
       } catch {
         break;
       }
       if (i === kr)
-        g === 0 && (d = new le(r), t.offset = I, t.prependTo(d), x = le.wrap(d, "binary", !0), x.LE(), this.valueStringPool = this.processStringPool(x)), g++;
+        g === 0 && (c = new le(r), t.offset = T, t.prependTo(c), x = le.wrap(c, "binary", !0), x.LE(), this.valueStringPool = this.processStringPool(x)), g++;
       else if (i === Sr)
-        d = new le(r), t.offset = I, t.prependTo(d), x = le.wrap(d, "binary", !0), x.LE(), this.processPackage(x), _++;
+        c = new le(r), t.offset = T, t.prependTo(c), x = le.wrap(c, "binary", !0), x.LE(), this.processPackage(x), w++;
       else
         throw new Error("Unsupported type");
-      if (t.offset = I + r, !t.remaining())
+      if (t.offset = T + r, !t.remaining())
         break;
     }
     if (g !== 1)
       throw new Error("More than 1 string pool found!");
-    if (_ !== c)
+    if (w !== d)
       throw new Error("Real package count not equals the declared count.");
     return this.responseMap;
   }
@@ -1735,31 +1729,31 @@ class fe {
     n.readInt();
     const a = n.readInt();
     this.package_id = a;
-    for (let I = 0; I < 256; ++I)
+    for (let T = 0; T < 256; ++T)
       n.readUint8();
     const s = n.readInt();
     n.readInt();
     const l = n.readInt();
     if (n.readInt(), s !== t)
       throw new Error("TypeStrings must immediately following the package structure header.");
-    let c = n.offset;
+    let d = n.offset;
     n.offset = s;
-    const d = fe.readBytes(n, n.limit - n.offset);
-    n.offset = c, this.typeStringPool = this.processStringPool(d), n.offset = l, n.readShort(), n.readShort();
+    const c = fe.readBytes(n, n.limit - n.offset);
+    n.offset = d, this.typeStringPool = this.processStringPool(c), n.offset = l, n.readShort(), n.readShort();
     const x = n.readInt();
-    c = n.offset, n.offset = l;
+    d = n.offset, n.offset = l;
     const g = fe.readBytes(n, n.limit - n.offset);
-    n.offset = c, this.keyStringPool = this.processStringPool(g), n.offset = l + x;
-    let _;
+    n.offset = d, this.keyStringPool = this.processStringPool(g), n.offset = l + x;
+    let w;
     for (; ; ) {
-      const I = n.offset;
+      const T = n.offset;
       let i, r;
       try {
         i = n.readShort(), n.readShort(), r = n.readInt();
       } catch {
         break;
       }
-      if (i === Ur ? (n.offset = I, _ = fe.readBytes(n, r), this.processTypeSpec(_)) : i === Nr && (n.offset = I, _ = fe.readBytes(n, r), this.processType(_)), r === 0 || (n.offset = I + r, !n.remaining()))
+      if (i === Ur ? (n.offset = T, w = fe.readBytes(n, r), this.processTypeSpec(w)) : i === Nr && (n.offset = T, w = fe.readBytes(n, r), this.processType(w)), r === 0 || (n.offset = T + r, !n.remaining()))
         break;
     }
   }
@@ -1773,28 +1767,28 @@ class fe {
     n.readInt();
     const a = n.readByte();
     n.readByte(), n.readShort();
-    const s = n.readInt(), l = n.readInt(), c = {};
+    const s = n.readInt(), l = n.readInt(), d = {};
     if (n.readInt(), n.offset = t, t + s * 4 !== l)
       throw new Error("HeaderSize, entryCount and entriesStart are not valid.");
-    const d = new Array(s);
+    const c = new Array(s);
     for (let x = 0; x < s; ++x)
-      d[x] = n.readInt();
+      c[x] = n.readInt();
     for (let x = 0; x < s; ++x) {
-      if (d[x] === -1) continue;
-      const g = this.package_id << 24 | a << 16 | x, _ = n.offset;
-      let I, i, r, o;
+      if (c[x] === -1) continue;
+      const g = this.package_id << 24 | a << 16 | x, w = n.offset;
+      let T, i, r, o;
       try {
-        n.readShort(), I = n.readShort(), i = n.readInt();
+        n.readShort(), T = n.readShort(), i = n.readInt();
       } catch {
         break;
       }
-      if ((I & 1) === 0) {
+      if ((T & 1) === 0) {
         n.readShort(), n.readByte(), r = n.readByte(), o = n.readInt();
         const f = Number(g).toString(16), p = this.keyStringPool[i];
-        let w = null;
-        const b = parseInt(f, 16);
-        let E = this.entryMap[b];
-        E == null && (E = []), E.push(p), this.entryMap[b] = E, r === Rr ? w = this.valueStringPool[o] : r === Lr ? c[f] = o : w = "" + o, this.putIntoMap("@" + f, w), n.offset = _ + 8 + 8;
+        let _ = null;
+        const E = parseInt(f, 16);
+        let y = this.entryMap[E];
+        y == null && (y = []), y.push(p), this.entryMap[E] = y, r === Rr ? _ = this.valueStringPool[o] : r === Lr ? d[f] = o : _ = "" + o, this.putIntoMap("@" + f, _), n.offset = w + 8 + 8;
       } else {
         n.readInt();
         const f = n.readInt();
@@ -1802,11 +1796,11 @@ class fe {
           n.readInt(), n.readShort(), n.readByte(), r = n.readByte(), o = n.readInt();
       }
     }
-    for (const x in c) {
-      const g = this.responseMap["@" + Number(c[x]).toString(16).toUpperCase()];
+    for (const x in d) {
+      const g = this.responseMap["@" + Number(d[x]).toString(16).toUpperCase()];
       if (g != null && Object.keys(g).length < 1e3)
-        for (const _ of g)
-          this.putIntoMap("@" + x, _);
+        for (const w of g)
+          this.putIntoMap("@" + x, w);
     }
   }
   /**
@@ -1820,29 +1814,29 @@ class fe {
     n.readInt();
     const a = n.readInt(), s = n.readInt();
     n.readInt();
-    let l, c;
-    const d = (a & 256) !== 0, x = new Array(t);
-    for (let _ = 0; _ < t; ++_)
-      x[_] = n.readInt();
+    let l, d;
+    const c = (a & 256) !== 0, x = new Array(t);
+    for (let w = 0; w < t; ++w)
+      x[w] = n.readInt();
     const g = new Array(t);
-    for (let _ = 0; _ < t; ++_) {
-      const I = s + x[_];
-      if (n.offset = I, g[_] = "", d) {
+    for (let w = 0; w < t; ++w) {
+      const T = s + x[w];
+      if (n.offset = T, g[w] = "", c) {
         l = n.readUint8(), (l & 128) !== 0 && (l = ((l & 127) << 8) + n.readUint8());
         let i = n.readUint8();
         if ((i & 128) !== 0 && (i = ((i & 127) << 8) + n.readUint8()), i > 0) {
-          c = fe.readBytes(n, i);
+          d = fe.readBytes(n, i);
           try {
-            g[_] = le.wrap(c, "utf8", !0).toString("utf8");
+            g[w] = le.wrap(d, "utf8", !0).toString("utf8");
           } catch {
           }
         } else
-          g[_] = "";
+          g[w] = "";
       } else if (l = n.readUint16(), (l & 32768) !== 0 && (l = ((l & 32767) << 16) + n.readUint16()), l > 0) {
         const i = l * 2;
-        c = fe.readBytes(n, i);
+        d = fe.readBytes(n, i);
         try {
-          g[_] = le.wrap(c, "utf8", !0).toString("utf8");
+          g[w] = le.wrap(d, "utf8", !0).toString("utf8");
         } catch {
         }
       }
@@ -1886,7 +1880,7 @@ const q = {
 }, Ye = {
   SORTED: 1,
   UTF8: 256
-}, z = {
+}, M = {
   COMPLEX_UNIT_DIP: 1,
   COMPLEX_UNIT_FRACTION: 0,
   COMPLEX_UNIT_FRACTION_PARENT: 1,
@@ -1968,22 +1962,22 @@ class Cr {
       // Will be overwritten
     }, t = this.readU32(), a = t & 255;
     switch (n.value = t >> 8, n.rawUnit = a, a) {
-      case z.COMPLEX_UNIT_MM:
+      case M.COMPLEX_UNIT_MM:
         n.unit = "mm";
         break;
-      case z.COMPLEX_UNIT_PX:
+      case M.COMPLEX_UNIT_PX:
         n.unit = "px";
         break;
-      case z.COMPLEX_UNIT_DIP:
+      case M.COMPLEX_UNIT_DIP:
         n.unit = "dp";
         break;
-      case z.COMPLEX_UNIT_SP:
+      case M.COMPLEX_UNIT_SP:
         n.unit = "sp";
         break;
-      case z.COMPLEX_UNIT_PT:
+      case M.COMPLEX_UNIT_PT:
         n.unit = "pt";
         break;
-      case z.COMPLEX_UNIT_IN:
+      case M.COMPLEX_UNIT_IN:
         n.unit = "in";
         break;
     }
@@ -1999,10 +1993,10 @@ class Cr {
       // Will be overwritten
     }, t = this.readU32(), a = t & 15;
     switch (n.value = this.convertIntToFloat(t >> 4), n.rawType = a, a) {
-      case z.COMPLEX_UNIT_FRACTION:
+      case M.COMPLEX_UNIT_FRACTION:
         n.type = "%";
         break;
-      case z.COMPLEX_UNIT_FRACTION_PARENT:
+      case M.COMPLEX_UNIT_FRACTION_PARENT:
         n.type = "%p";
         break;
     }
@@ -2030,42 +2024,42 @@ class Cr {
     this.readU8();
     const s = this.readU8();
     switch (a === 0 && (a = 8), n.rawType = s, s) {
-      case z.TYPE_INT_DEC:
+      case M.TYPE_INT_DEC:
         n.value = this.readS32(), n.type = "int_dec";
         break;
-      case z.TYPE_INT_HEX:
+      case M.TYPE_INT_HEX:
         n.value = this.readS32(), n.type = "int_hex";
         break;
-      case z.TYPE_STRING:
-        const c = this.readS32();
-        n.value = c >= 0 ? this.strings[c] : "", n.type = "string";
+      case M.TYPE_STRING:
+        const d = this.readS32();
+        n.value = d >= 0 ? this.strings[d] : "", n.type = "string";
         break;
-      case z.TYPE_REFERENCE:
-        const d = this.readU32();
-        n.value = `resourceId:0x${d.toString(16)}`, n.type = "reference";
+      case M.TYPE_REFERENCE:
+        const c = this.readU32();
+        n.value = `resourceId:0x${c.toString(16)}`, n.type = "reference";
         break;
-      case z.TYPE_INT_BOOLEAN:
+      case M.TYPE_INT_BOOLEAN:
         n.value = this.readS32() !== 0, n.type = "boolean";
         break;
-      case z.TYPE_NULL:
+      case M.TYPE_NULL:
         this.readU32(), n.value = null, n.type = "null";
         break;
-      case z.TYPE_INT_COLOR_RGB8:
+      case M.TYPE_INT_COLOR_RGB8:
         n.value = this.readHex24(), n.type = "rgb8";
         break;
-      case z.TYPE_INT_COLOR_RGB4:
+      case M.TYPE_INT_COLOR_RGB4:
         n.value = this.readHex24(), n.type = "rgb4";
         break;
-      case z.TYPE_INT_COLOR_ARGB8:
+      case M.TYPE_INT_COLOR_ARGB8:
         n.value = this.readHex32(), n.type = "argb8";
         break;
-      case z.TYPE_INT_COLOR_ARGB4:
+      case M.TYPE_INT_COLOR_ARGB4:
         n.value = this.readHex32(), n.type = "argb4";
         break;
-      case z.TYPE_DIMENSION:
+      case M.TYPE_DIMENSION:
         n.value = this.readDimension(), n.type = "dimension";
         break;
-      case z.TYPE_FRACTION:
+      case M.TYPE_FRACTION:
         n.value = this.readFraction(), n.type = "fraction";
         break;
       default: {
@@ -2075,8 +2069,8 @@ class Cr {
     }
     const l = t + a;
     if (this.cursor !== l) {
-      const c = s.toString(16), d = l - this.cursor;
-      console.debug(`Cursor is off by ${d} bytes at ${this.cursor} at supposed end of typed value of type 0x${c}. The typed value started at offset ${t} and is supposed to end at offset ${l}. Ignoring the rest of the value.`), this.cursor = l;
+      const d = s.toString(16), c = l - this.cursor;
+      console.debug(`Cursor is off by ${c} bytes at ${this.cursor} at supposed end of typed value of type 0x${d}. The typed value started at offset ${t} and is supposed to end at offset ${l}. Ignoring the rest of the value.`), this.cursor = l;
     }
     return this.debug && console.groupEnd(), n;
   }
@@ -2101,8 +2095,8 @@ class Cr {
       default:
         throw new Error(`Unsupported encoding '${n}'`);
     }
-    const s = new TextDecoder(n === "ucs2" ? "utf-16le" : n), l = new Uint8Array(this.view.buffer, this.cursor, t), c = s.decode(l);
-    return this.cursor += t, this.debug && (console.debug("value:", c), console.groupEnd()), c;
+    const s = new TextDecoder(n === "ucs2" ? "utf-16le" : n), l = new Uint8Array(this.view.buffer, this.cursor, t), d = s.decode(l);
+    return this.cursor += t, this.debug && (console.debug("value:", d), console.groupEnd()), d;
   }
   readChunkHeader() {
     this.debug && console.group("readChunkHeader");
@@ -2118,15 +2112,15 @@ class Cr {
     if (this.debug && console.group("readStringPool"), n.stringCount = this.readU32(), this.debug && console.debug("stringCount:", n.stringCount), n.styleCount = this.readU32(), this.debug && console.debug("styleCount:", n.styleCount), n.flags = this.readU32(), this.debug && console.debug("flags:", n.flags), n.stringsStart = this.readU32(), this.debug && console.debug("stringsStart:", n.stringsStart), n.stylesStart = this.readU32(), this.debug && console.debug("stylesStart:", n.stylesStart), n.chunkType !== Q.STRING_POOL)
       throw new Error("Invalid string pool header");
     const t = [];
-    for (let c = 0, d = n.stringCount; c < d; ++c)
-      this.debug && console.debug("offset:", c), t.push(this.readU32());
+    for (let d = 0, c = n.stringCount; d < c; ++d)
+      this.debug && console.debug("offset:", d), t.push(this.readU32());
     const a = (n.flags & Ye.SORTED) === Ye.SORTED;
     this.debug && console.debug("sorted:", a);
     const s = (n.flags & Ye.UTF8) === Ye.UTF8 ? "utf-8" : "ucs2";
     this.debug && console.debug("encoding:", s);
     const l = n.startOffset + (n.stringsStart || 0);
-    for (let c = 0, d = n.stringCount; c < d; ++c)
-      this.debug && (console.debug("string:", c), console.debug("offset:", t[c])), this.cursor = l + t[c], this.strings.push(this.readString(s));
+    for (let d = 0, c = n.stringCount; d < c; ++d)
+      this.debug && (console.debug("string:", d), console.debug("offset:", t[d])), this.cursor = l + t[d], this.strings.push(this.readString(s));
     return this.cursor = n.startOffset + n.chunkSize, this.debug && console.groupEnd(), null;
   }
   readResourceMap(n) {
@@ -2156,7 +2150,7 @@ class Cr {
     a >= 0 && (t.namespaceURI = this.strings[a]), s >= 0 && (t.nodeName = this.strings[s]), this.readU16(), this.readU16();
     const l = this.readU16();
     this.readU16(), this.readU16(), this.readU16();
-    for (let c = 0; c < l; ++c)
+    for (let d = 0; d < l; ++d)
       t.attributes.push(this.readXmlAttribute());
     return this.document ? (this.parent && this.parent.nodeType === q.ELEMENT_NODE && this.parent.childNodes.push(t), this.parent = t) : this.document = this.parent = t, this.stack.push(t), this.debug && console.groupEnd(), t;
   }
@@ -2233,8 +2227,8 @@ class Cr {
       }
       const s = t + a.chunkSize;
       if (this.cursor !== s) {
-        const l = s - this.cursor, c = a.chunkType.toString(16);
-        console.debug(`Cursor is off by ${l} bytes at ${this.cursor} at supposed end of chunk of type 0x${c}. The chunk started at offset ${t} and is supposed to end at offset ${s}. Ignoring the rest of the chunk.`), this.cursor = s;
+        const l = s - this.cursor, d = a.chunkType.toString(16);
+        console.debug(`Cursor is off by ${l} bytes at ${this.cursor} at supposed end of chunk of type 0x${d}. The chunk started at offset ${t} and is supposed to end at offset ${s}. Ignoring the rest of the chunk.`), this.cursor = s;
       }
       this.debug && console.groupEnd();
     }
@@ -2418,48 +2412,48 @@ class Br {
     }), t;
   }
 }
-const zr = Dt.loadAsync;
+const zr = Bt.loadAsync;
 class Ds {
   zip;
   constructor(n) {
-    this.zip = zr(n).catch(M);
+    this.zip = zr(n).catch(B);
   }
   async parse(n) {
     const t = await this.zip;
     if (t instanceof Error)
       return new Error(`load file error: ${t.message}`);
-    const a = t.file("AndroidManifest.xml"), s = n?.ignoreIcon ? null : t.file("resources.arsc"), [l, c] = await Promise.all([
-      a?.async("arraybuffer").catch(M),
-      s?.async("arraybuffer").catch(M)
+    const a = t.file("AndroidManifest.xml"), s = n?.ignoreIcon ? null : t.file("resources.arsc"), [l, d] = await Promise.all([
+      a?.async("arraybuffer").catch(B),
+      s?.async("arraybuffer").catch(B)
     ]);
     if (!l || l instanceof Error)
       return new Error("not found AndroidManifest.xml");
-    const d = Mr(l);
-    if (d instanceof Error)
-      return new Error(`parse AndroidManifest.xml error: ${d.message}`);
+    const c = Mr(l);
+    if (c instanceof Error)
+      return new Error(`parse AndroidManifest.xml error: ${c.message}`);
     const x = {
-      package: d.package,
-      versionCode: d.versionCode,
-      versionName: d.versionName,
-      manifest: d
-    }, g = d.application?.icon;
-    if (!c || c instanceof Error || !g || typeof g != "string")
+      package: c.package,
+      versionCode: c.versionCode,
+      versionName: c.versionName,
+      manifest: c
+    }, g = c.application?.icon;
+    if (!d || d instanceof Error || !g || typeof g != "string")
       return x;
-    const _ = Pr(c, g);
-    if (!_)
+    const w = Pr(d, g);
+    if (!w)
       return x;
-    const I = t.file(_);
-    if (!I)
+    const T = t.file(w);
+    if (!T)
       return x;
-    const i = await I.async("base64").catch(M);
-    return i instanceof Error || (x.icon = Bt(i)), x;
+    const i = await T.async("base64").catch(B);
+    return i instanceof Error || (x.icon = zt(i)), x;
   }
   /**
    * 读取指定文件的内容
    */
   async readFile(n, t) {
     const a = await this.zip;
-    return a instanceof Error ? new Error(`load file error: ${a.message}`) : await zt(a, n, t);
+    return a instanceof Error ? new Error(`load file error: ${a.message}`) : await Mt(a, n, t);
   }
 }
 function Mr(e) {
@@ -2475,7 +2469,7 @@ function Mr(e) {
   try {
     return n.parse();
   } catch (t) {
-    return M(t);
+    return B(t);
   }
 }
 function Pr(e, n) {
@@ -2492,45 +2486,44 @@ function je(e, ...n) {
   const t = Object.getPrototypeOf(e);
   return t !== Object.prototype && t !== null ? !1 : n.every((a) => a in e);
 }
-/*! pako 2.0.4 https://github.com/nodeca/pako @license (MIT AND Zlib) */
-const Zr = 4, Yt = 0, jt = 1, $r = 2;
-function ke(e) {
+const Zr = 4, jt = 0, Gt = 1, $r = 2;
+function Ae(e) {
   let n = e.length;
   for (; --n >= 0; )
     e[n] = 0;
 }
-const Hr = 0, Di = 1, Xr = 2, Vr = 3, Yr = 258, Mt = 29, Xe = 256, De = Xe + 1 + Mt, me = 30, Pt = 19, Bi = 2 * De + 1, we = 15, _t = 16, jr = 7, Zt = 256, zi = 16, Mi = 17, Pi = 18, Ut = (
+const Hr = 0, Di = 1, Xr = 2, Vr = 3, Yr = 258, Pt = 29, Xe = 256, De = Xe + 1 + Pt, ke = 30, Zt = 19, Bi = 2 * De + 1, we = 15, wt = 16, jr = 7, $t = 256, zi = 16, Mi = 17, Pi = 18, Lt = (
   /* extra bits for each length code */
   new Uint8Array([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])
-), it = (
+), rt = (
   /* extra bits for each distance code */
   new Uint8Array([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])
 ), Gr = (
   /* extra bits for each bit length code */
   new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7])
 ), Zi = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), qr = 512, se = new Array((De + 2) * 2);
-ke(se);
-const Re = new Array(me * 2);
-ke(Re);
+Ae(se);
+const Re = new Array(ke * 2);
+Ae(Re);
 const Be = new Array(qr);
-ke(Be);
+Ae(Be);
 const ze = new Array(Yr - Vr + 1);
-ke(ze);
-const $t = new Array(Mt);
-ke($t);
-const ot = new Array(me);
-ke(ot);
-function wt(e, n, t, a, s) {
+Ae(ze);
+const Ht = new Array(Pt);
+Ae(Ht);
+const lt = new Array(ke);
+Ae(lt);
+function yt(e, n, t, a, s) {
   this.static_tree = e, this.extra_bits = n, this.extra_base = t, this.elems = a, this.max_length = s, this.has_stree = e && e.length;
 }
 let $i, Hi, Xi;
-function yt(e, n) {
+function bt(e, n) {
   this.dyn_tree = e, this.max_code = 0, this.stat_desc = n;
 }
 const Vi = (e) => e < 256 ? Be[e] : Be[256 + (e >>> 7)], Me = (e, n) => {
   e.pending_buf[e.pending++] = n & 255, e.pending_buf[e.pending++] = n >>> 8 & 255;
 }, j = (e, n, t) => {
-  e.bi_valid > _t - t ? (e.bi_buf |= n << e.bi_valid & 65535, Me(e, e.bi_buf), e.bi_buf = n >> _t - e.bi_valid, e.bi_valid += t - _t) : (e.bi_buf |= n << e.bi_valid & 65535, e.bi_valid += t);
+  e.bi_valid > wt - t ? (e.bi_buf |= n << e.bi_valid & 65535, Me(e, e.bi_buf), e.bi_buf = n >> wt - e.bi_valid, e.bi_valid += t - wt) : (e.bi_buf |= n << e.bi_valid & 65535, e.bi_valid += t);
 }, te = (e, n, t) => {
   j(
     e,
@@ -2547,12 +2540,12 @@ const Vi = (e) => e < 256 ? Be[e] : Be[256 + (e >>> 7)], Me = (e, n) => {
 }, Kr = (e) => {
   e.bi_valid === 16 ? (Me(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
 }, Wr = (e, n) => {
-  const t = n.dyn_tree, a = n.max_code, s = n.stat_desc.static_tree, l = n.stat_desc.has_stree, c = n.stat_desc.extra_bits, d = n.stat_desc.extra_base, x = n.stat_desc.max_length;
-  let g, _, I, i, r, o, h = 0;
+  const t = n.dyn_tree, a = n.max_code, s = n.stat_desc.static_tree, l = n.stat_desc.has_stree, d = n.stat_desc.extra_bits, c = n.stat_desc.extra_base, x = n.stat_desc.max_length;
+  let g, w, T, i, r, o, h = 0;
   for (i = 0; i <= we; i++)
     e.bl_count[i] = 0;
   for (t[e.heap[e.heap_max] * 2 + 1] = 0, g = e.heap_max + 1; g < Bi; g++)
-    _ = e.heap[g], i = t[t[_ * 2 + 1] * 2 + 1] + 1, i > x && (i = x, h++), t[_ * 2 + 1] = i, !(_ > a) && (e.bl_count[i]++, r = 0, _ >= d && (r = c[_ - d]), o = t[_ * 2], e.opt_len += o * (i + r), l && (e.static_len += o * (s[_ * 2 + 1] + r)));
+    w = e.heap[g], i = t[t[w * 2 + 1] * 2 + 1] + 1, i > x && (i = x, h++), t[w * 2 + 1] = i, !(w > a) && (e.bl_count[i]++, r = 0, w >= c && (r = d[w - c]), o = t[w * 2], e.opt_len += o * (i + r), l && (e.static_len += o * (s[w * 2 + 1] + r)));
   if (h !== 0) {
     do {
       for (i = x - 1; e.bl_count[i] === 0; )
@@ -2560,29 +2553,29 @@ const Vi = (e) => e < 256 ? Be[e] : Be[256 + (e >>> 7)], Me = (e, n) => {
       e.bl_count[i]--, e.bl_count[i + 1] += 2, e.bl_count[x]--, h -= 2;
     } while (h > 0);
     for (i = x; i !== 0; i--)
-      for (_ = e.bl_count[i]; _ !== 0; )
-        I = e.heap[--g], !(I > a) && (t[I * 2 + 1] !== i && (e.opt_len += (i - t[I * 2 + 1]) * t[I * 2], t[I * 2 + 1] = i), _--);
+      for (w = e.bl_count[i]; w !== 0; )
+        T = e.heap[--g], !(T > a) && (t[T * 2 + 1] !== i && (e.opt_len += (i - t[T * 2 + 1]) * t[T * 2], t[T * 2 + 1] = i), w--);
   }
 }, ji = (e, n, t) => {
   const a = new Array(we + 1);
-  let s = 0, l, c;
+  let s = 0, l, d;
   for (l = 1; l <= we; l++)
     a[l] = s = s + t[l - 1] << 1;
-  for (c = 0; c <= n; c++) {
-    let d = e[c * 2 + 1];
-    d !== 0 && (e[c * 2] = Yi(a[d]++, d));
+  for (d = 0; d <= n; d++) {
+    let c = e[d * 2 + 1];
+    c !== 0 && (e[d * 2] = Yi(a[c]++, c));
   }
 }, Jr = () => {
   let e, n, t, a, s;
   const l = new Array(we + 1);
-  for (t = 0, a = 0; a < Mt - 1; a++)
-    for ($t[a] = t, e = 0; e < 1 << Ut[a]; e++)
+  for (t = 0, a = 0; a < Pt - 1; a++)
+    for (Ht[a] = t, e = 0; e < 1 << Lt[a]; e++)
       ze[t++] = a;
   for (ze[t - 1] = a, s = 0, a = 0; a < 16; a++)
-    for (ot[a] = s, e = 0; e < 1 << it[a]; e++)
+    for (lt[a] = s, e = 0; e < 1 << rt[a]; e++)
       Be[s++] = a;
-  for (s >>= 7; a < me; a++)
-    for (ot[a] = s << 7, e = 0; e < 1 << it[a] - 7; e++)
+  for (s >>= 7; a < ke; a++)
+    for (lt[a] = s << 7, e = 0; e < 1 << rt[a] - 7; e++)
       Be[256 + s++] = a;
   for (n = 0; n <= we; n++)
     l[n] = 0;
@@ -2594,67 +2587,67 @@ const Vi = (e) => e < 256 ? Be[e] : Be[256 + (e >>> 7)], Me = (e, n) => {
     se[e * 2 + 1] = 7, e++, l[7]++;
   for (; e <= 287; )
     se[e * 2 + 1] = 8, e++, l[8]++;
-  for (ji(se, De + 1, l), e = 0; e < me; e++)
+  for (ji(se, De + 1, l), e = 0; e < ke; e++)
     Re[e * 2 + 1] = 5, Re[e * 2] = Yi(e, 5);
-  $i = new wt(se, Ut, Xe + 1, De, we), Hi = new wt(Re, it, 0, me, we), Xi = new wt(new Array(0), Gr, 0, Pt, jr);
+  $i = new yt(se, Lt, Xe + 1, De, we), Hi = new yt(Re, rt, 0, ke, we), Xi = new yt(new Array(0), Gr, 0, Zt, jr);
 }, Gi = (e) => {
   let n;
   for (n = 0; n < De; n++)
     e.dyn_ltree[n * 2] = 0;
-  for (n = 0; n < me; n++)
+  for (n = 0; n < ke; n++)
     e.dyn_dtree[n * 2] = 0;
-  for (n = 0; n < Pt; n++)
+  for (n = 0; n < Zt; n++)
     e.bl_tree[n * 2] = 0;
-  e.dyn_ltree[Zt * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
+  e.dyn_ltree[$t * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
 }, qi = (e) => {
   e.bi_valid > 8 ? Me(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
 }, Qr = (e, n, t, a) => {
   qi(e), Me(e, t), Me(e, ~t), e.pending_buf.set(e.window.subarray(n, n + t), e.pending), e.pending += t;
-}, Gt = (e, n, t, a) => {
+}, qt = (e, n, t, a) => {
   const s = n * 2, l = t * 2;
   return e[s] < e[l] || e[s] === e[l] && a[n] <= a[t];
-}, bt = (e, n, t) => {
+}, Et = (e, n, t) => {
   const a = e.heap[t];
   let s = t << 1;
-  for (; s <= e.heap_len && (s < e.heap_len && Gt(n, e.heap[s + 1], e.heap[s], e.depth) && s++, !Gt(n, a, e.heap[s], e.depth)); )
+  for (; s <= e.heap_len && (s < e.heap_len && qt(n, e.heap[s + 1], e.heap[s], e.depth) && s++, !qt(n, a, e.heap[s], e.depth)); )
     e.heap[t] = e.heap[s], t = s, s <<= 1;
   e.heap[t] = a;
-}, qt = (e, n, t) => {
-  let a, s, l = 0, c, d;
+}, Kt = (e, n, t) => {
+  let a, s, l = 0, d, c;
   if (e.last_lit !== 0)
     do
-      a = e.pending_buf[e.d_buf + l * 2] << 8 | e.pending_buf[e.d_buf + l * 2 + 1], s = e.pending_buf[e.l_buf + l], l++, a === 0 ? te(e, s, n) : (c = ze[s], te(e, c + Xe + 1, n), d = Ut[c], d !== 0 && (s -= $t[c], j(e, s, d)), a--, c = Vi(a), te(e, c, t), d = it[c], d !== 0 && (a -= ot[c], j(e, a, d)));
+      a = e.pending_buf[e.d_buf + l * 2] << 8 | e.pending_buf[e.d_buf + l * 2 + 1], s = e.pending_buf[e.l_buf + l], l++, a === 0 ? te(e, s, n) : (d = ze[s], te(e, d + Xe + 1, n), c = Lt[d], c !== 0 && (s -= Ht[d], j(e, s, c)), a--, d = Vi(a), te(e, d, t), c = rt[d], c !== 0 && (a -= lt[d], j(e, a, c)));
     while (l < e.last_lit);
-  te(e, Zt, n);
-}, Lt = (e, n) => {
+  te(e, $t, n);
+}, Rt = (e, n) => {
   const t = n.dyn_tree, a = n.stat_desc.static_tree, s = n.stat_desc.has_stree, l = n.stat_desc.elems;
-  let c, d, x = -1, g;
-  for (e.heap_len = 0, e.heap_max = Bi, c = 0; c < l; c++)
-    t[c * 2] !== 0 ? (e.heap[++e.heap_len] = x = c, e.depth[c] = 0) : t[c * 2 + 1] = 0;
+  let d, c, x = -1, g;
+  for (e.heap_len = 0, e.heap_max = Bi, d = 0; d < l; d++)
+    t[d * 2] !== 0 ? (e.heap[++e.heap_len] = x = d, e.depth[d] = 0) : t[d * 2 + 1] = 0;
   for (; e.heap_len < 2; )
     g = e.heap[++e.heap_len] = x < 2 ? ++x : 0, t[g * 2] = 1, e.depth[g] = 0, e.opt_len--, s && (e.static_len -= a[g * 2 + 1]);
-  for (n.max_code = x, c = e.heap_len >> 1; c >= 1; c--)
-    bt(e, t, c);
+  for (n.max_code = x, d = e.heap_len >> 1; d >= 1; d--)
+    Et(e, t, d);
   g = l;
   do
-    c = e.heap[
+    d = e.heap[
       1
       /*SMALLEST*/
     ], e.heap[
       1
       /*SMALLEST*/
-    ] = e.heap[e.heap_len--], bt(
+    ] = e.heap[e.heap_len--], Et(
       e,
       t,
       1
       /*SMALLEST*/
-    ), d = e.heap[
+    ), c = e.heap[
       1
       /*SMALLEST*/
-    ], e.heap[--e.heap_max] = c, e.heap[--e.heap_max] = d, t[g * 2] = t[c * 2] + t[d * 2], e.depth[g] = (e.depth[c] >= e.depth[d] ? e.depth[c] : e.depth[d]) + 1, t[c * 2 + 1] = t[d * 2 + 1] = g, e.heap[
+    ], e.heap[--e.heap_max] = d, e.heap[--e.heap_max] = c, t[g * 2] = t[d * 2] + t[c * 2], e.depth[g] = (e.depth[d] >= e.depth[c] ? e.depth[d] : e.depth[c]) + 1, t[d * 2 + 1] = t[c * 2 + 1] = g, e.heap[
       1
       /*SMALLEST*/
-    ] = g++, bt(
+    ] = g++, Et(
       e,
       t,
       1
@@ -2665,53 +2658,53 @@ const Vi = (e) => e < 256 ? Be[e] : Be[256 + (e >>> 7)], Me = (e, n) => {
     1
     /*SMALLEST*/
   ], Wr(e, n), ji(t, x, e.bl_count);
-}, Kt = (e, n, t) => {
-  let a, s = -1, l, c = n[0 * 2 + 1], d = 0, x = 7, g = 4;
-  for (c === 0 && (x = 138, g = 3), n[(t + 1) * 2 + 1] = 65535, a = 0; a <= t; a++)
-    l = c, c = n[(a + 1) * 2 + 1], !(++d < x && l === c) && (d < g ? e.bl_tree[l * 2] += d : l !== 0 ? (l !== s && e.bl_tree[l * 2]++, e.bl_tree[zi * 2]++) : d <= 10 ? e.bl_tree[Mi * 2]++ : e.bl_tree[Pi * 2]++, d = 0, s = l, c === 0 ? (x = 138, g = 3) : l === c ? (x = 6, g = 3) : (x = 7, g = 4));
 }, Wt = (e, n, t) => {
-  let a, s = -1, l, c = n[0 * 2 + 1], d = 0, x = 7, g = 4;
-  for (c === 0 && (x = 138, g = 3), a = 0; a <= t; a++)
-    if (l = c, c = n[(a + 1) * 2 + 1], !(++d < x && l === c)) {
-      if (d < g)
+  let a, s = -1, l, d = n[1], c = 0, x = 7, g = 4;
+  for (d === 0 && (x = 138, g = 3), n[(t + 1) * 2 + 1] = 65535, a = 0; a <= t; a++)
+    l = d, d = n[(a + 1) * 2 + 1], !(++c < x && l === d) && (c < g ? e.bl_tree[l * 2] += c : l !== 0 ? (l !== s && e.bl_tree[l * 2]++, e.bl_tree[zi * 2]++) : c <= 10 ? e.bl_tree[Mi * 2]++ : e.bl_tree[Pi * 2]++, c = 0, s = l, d === 0 ? (x = 138, g = 3) : l === d ? (x = 6, g = 3) : (x = 7, g = 4));
+}, Jt = (e, n, t) => {
+  let a, s = -1, l, d = n[1], c = 0, x = 7, g = 4;
+  for (d === 0 && (x = 138, g = 3), a = 0; a <= t; a++)
+    if (l = d, d = n[(a + 1) * 2 + 1], !(++c < x && l === d)) {
+      if (c < g)
         do
           te(e, l, e.bl_tree);
-        while (--d !== 0);
-      else l !== 0 ? (l !== s && (te(e, l, e.bl_tree), d--), te(e, zi, e.bl_tree), j(e, d - 3, 2)) : d <= 10 ? (te(e, Mi, e.bl_tree), j(e, d - 3, 3)) : (te(e, Pi, e.bl_tree), j(e, d - 11, 7));
-      d = 0, s = l, c === 0 ? (x = 138, g = 3) : l === c ? (x = 6, g = 3) : (x = 7, g = 4);
+        while (--c !== 0);
+      else l !== 0 ? (l !== s && (te(e, l, e.bl_tree), c--), te(e, zi, e.bl_tree), j(e, c - 3, 2)) : c <= 10 ? (te(e, Mi, e.bl_tree), j(e, c - 3, 3)) : (te(e, Pi, e.bl_tree), j(e, c - 11, 7));
+      c = 0, s = l, d === 0 ? (x = 138, g = 3) : l === d ? (x = 6, g = 3) : (x = 7, g = 4);
     }
 }, en = (e) => {
   let n;
-  for (Kt(e, e.dyn_ltree, e.l_desc.max_code), Kt(e, e.dyn_dtree, e.d_desc.max_code), Lt(e, e.bl_desc), n = Pt - 1; n >= 3 && e.bl_tree[Zi[n] * 2 + 1] === 0; n--)
+  for (Wt(e, e.dyn_ltree, e.l_desc.max_code), Wt(e, e.dyn_dtree, e.d_desc.max_code), Rt(e, e.bl_desc), n = Zt - 1; n >= 3 && e.bl_tree[Zi[n] * 2 + 1] === 0; n--)
     ;
   return e.opt_len += 3 * (n + 1) + 5 + 5 + 4, n;
 }, tn = (e, n, t, a) => {
   let s;
   for (j(e, n - 257, 5), j(e, t - 1, 5), j(e, a - 4, 4), s = 0; s < a; s++)
     j(e, e.bl_tree[Zi[s] * 2 + 1], 3);
-  Wt(e, e.dyn_ltree, n - 1), Wt(e, e.dyn_dtree, t - 1);
+  Jt(e, e.dyn_ltree, n - 1), Jt(e, e.dyn_dtree, t - 1);
 }, rn = (e) => {
   let n = 4093624447, t;
   for (t = 0; t <= 31; t++, n >>>= 1)
     if (n & 1 && e.dyn_ltree[t * 2] !== 0)
-      return Yt;
-  if (e.dyn_ltree[9 * 2] !== 0 || e.dyn_ltree[10 * 2] !== 0 || e.dyn_ltree[13 * 2] !== 0)
-    return jt;
+      return jt;
+  if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0)
+    return Gt;
   for (t = 32; t < Xe; t++)
     if (e.dyn_ltree[t * 2] !== 0)
-      return jt;
-  return Yt;
+      return Gt;
+  return jt;
 };
-let Jt = !1;
+let Qt = !1;
 const nn = (e) => {
-  Jt || (Jr(), Jt = !0), e.l_desc = new yt(e.dyn_ltree, $i), e.d_desc = new yt(e.dyn_dtree, Hi), e.bl_desc = new yt(e.bl_tree, Xi), e.bi_buf = 0, e.bi_valid = 0, Gi(e);
+  Qt || (Jr(), Qt = !0), e.l_desc = new bt(e.dyn_ltree, $i), e.d_desc = new bt(e.dyn_dtree, Hi), e.bl_desc = new bt(e.bl_tree, Xi), e.bi_buf = 0, e.bi_valid = 0, Gi(e);
 }, Ki = (e, n, t, a) => {
   j(e, (Hr << 1) + (a ? 1 : 0), 3), Qr(e, n, t);
 }, an = (e) => {
-  j(e, Di << 1, 3), te(e, Zt, se), Kr(e);
+  j(e, Di << 1, 3), te(e, $t, se), Kr(e);
 }, sn = (e, n, t, a) => {
-  let s, l, c = 0;
-  e.level > 0 ? (e.strm.data_type === $r && (e.strm.data_type = rn(e)), Lt(e, e.l_desc), Lt(e, e.d_desc), c = en(e), s = e.opt_len + 3 + 7 >>> 3, l = e.static_len + 3 + 7 >>> 3, l <= s && (s = l)) : s = l = t + 5, t + 4 <= s && n !== -1 ? Ki(e, n, t, a) : e.strategy === Zr || l === s ? (j(e, (Di << 1) + (a ? 1 : 0), 3), qt(e, se, Re)) : (j(e, (Xr << 1) + (a ? 1 : 0), 3), tn(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, c + 1), qt(e, e.dyn_ltree, e.dyn_dtree)), Gi(e), a && qi(e);
+  let s, l, d = 0;
+  e.level > 0 ? (e.strm.data_type === $r && (e.strm.data_type = rn(e)), Rt(e, e.l_desc), Rt(e, e.d_desc), d = en(e), s = e.opt_len + 3 + 7 >>> 3, l = e.static_len + 3 + 7 >>> 3, l <= s && (s = l)) : s = l = t + 5, t + 4 <= s && n !== -1 ? Ki(e, n, t, a) : e.strategy === Zr || l === s ? (j(e, (Di << 1) + (a ? 1 : 0), 3), Kt(e, se, Re)) : (j(e, (Xr << 1) + (a ? 1 : 0), 3), tn(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, d + 1), Kt(e, e.dyn_ltree, e.dyn_dtree)), Gi(e), a && qi(e);
 }, on = (e, n, t) => (e.pending_buf[e.d_buf + e.last_lit * 2] = n >>> 8 & 255, e.pending_buf[e.d_buf + e.last_lit * 2 + 1] = n & 255, e.pending_buf[e.l_buf + e.last_lit] = t & 255, e.last_lit++, n === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, n--, e.dyn_ltree[(ze[t] + Xe + 1) * 2]++, e.dyn_dtree[Vi(n) * 2]++), e.last_lit === e.lit_bufsize - 1);
 var ln = nn, hn = Ki, fn = sn, un = on, cn = an, dn = {
   _tr_init: ln,
@@ -2721,12 +2714,12 @@ var ln = nn, hn = Ki, fn = sn, un = on, cn = an, dn = {
   _tr_align: cn
 };
 const gn = (e, n, t, a) => {
-  let s = e & 65535 | 0, l = e >>> 16 & 65535 | 0, c = 0;
+  let s = e & 65535 | 0, l = e >>> 16 & 65535 | 0, d = 0;
   for (; t !== 0; ) {
-    c = t > 2e3 ? 2e3 : t, t -= c;
+    d = t > 2e3 ? 2e3 : t, t -= d;
     do
       s = s + n[a++] | 0, l = l + s | 0;
-    while (--c);
+    while (--d);
     s %= 65521, l %= 65521;
   }
   return s | l << 16 | 0;
@@ -2744,8 +2737,8 @@ const pn = () => {
 }, _n = new Uint32Array(pn()), wn = (e, n, t, a) => {
   const s = _n, l = a + t;
   e ^= -1;
-  for (let c = a; c < l; c++)
-    e = e >>> 8 ^ s[(e ^ n[c]) & 255];
+  for (let d = a; d < l; d++)
+    e = e >>> 8 ^ s[(e ^ n[d]) & 255];
   return e ^ -1;
 };
 var $ = wn, be = {
@@ -2767,7 +2760,7 @@ var $ = wn, be = {
   /* Z_BUF_ERROR     (-5) */
   "-6": "incompatible version"
   /* Z_VERSION_ERROR (-6) */
-}, ft = {
+}, ut = {
   /* Allowed flush values; see deflate() and inflate() below for details */
   Z_NO_FLUSH: 0,
   Z_PARTIAL_FLUSH: 1,
@@ -2803,12 +2796,12 @@ const { _tr_init: yn, _tr_stored_block: bn, _tr_flush_block: En, _tr_tally: ge,
   Z_PARTIAL_FLUSH: xn,
   Z_FULL_FLUSH: Tn,
   Z_FINISH: pe,
-  Z_BLOCK: Qt,
+  Z_BLOCK: ei,
   Z_OK: ie,
-  Z_STREAM_END: ei,
+  Z_STREAM_END: ti,
   Z_STREAM_ERROR: K,
   Z_DATA_ERROR: In,
-  Z_BUF_ERROR: Et,
+  Z_BUF_ERROR: vt,
   Z_DEFAULT_COMPRESSION: Fn,
   Z_FILTERED: mn,
   Z_HUFFMAN_ONLY: Ge,
@@ -2816,8 +2809,8 @@ const { _tr_init: yn, _tr_stored_block: bn, _tr_flush_block: En, _tr_tally: ge,
   Z_FIXED: An,
   Z_DEFAULT_STRATEGY: Sn,
   Z_UNKNOWN: Nn,
-  Z_DEFLATED: ut
-} = ft, Un = 9, Ln = 15, Rn = 8, Cn = 29, On = 256, Rt = On + 1 + Cn, Dn = 30, Bn = 19, zn = 2 * Rt + 1, Mn = 15, L = 3, ce = 258, J = ce + L + 1, Pn = 32, ct = 42, Ct = 69, rt = 73, nt = 91, at = 103, ye = 113, Ue = 666, P = 1, Ve = 2, Ee = 3, Ae = 4, Zn = 3, de = (e, n) => (e.msg = be[n], n), ti = (e) => (e << 1) - (e > 4 ? 9 : 0), ue = (e) => {
+  Z_DEFLATED: ct
+} = ut, Un = 9, Ln = 15, Rn = 8, Cn = 29, On = 256, Ct = On + 1 + Cn, Dn = 30, Bn = 19, zn = 2 * Ct + 1, Mn = 15, L = 3, ce = 258, J = ce + L + 1, Pn = 32, dt = 42, Ot = 69, nt = 73, at = 91, st = 103, ye = 113, Ue = 666, P = 1, Ve = 2, Ee = 3, Se = 4, Zn = 3, de = (e, n) => (e.msg = be[n], n), ii = (e) => (e << 1) - (e > 4 ? 9 : 0), ue = (e) => {
   let n = e.length;
   for (; --n >= 0; )
     e[n] = 0;
@@ -2831,33 +2824,33 @@ const he = (e) => {
   En(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, n), e.block_start = e.strstart, he(e.strm);
 }, C = (e, n) => {
   e.pending_buf[e.pending++] = n;
-}, Se = (e, n) => {
+}, Ne = (e, n) => {
   e.pending_buf[e.pending++] = n >>> 8 & 255, e.pending_buf[e.pending++] = n & 255;
 }, Hn = (e, n, t, a) => {
   let s = e.avail_in;
   return s > a && (s = a), s === 0 ? 0 : (e.avail_in -= s, n.set(e.input.subarray(e.next_in, e.next_in + s), t), e.state.wrap === 1 ? e.adler = Pe(e.adler, n, s, t) : e.state.wrap === 2 && (e.adler = $(e.adler, n, s, t)), e.next_in += s, e.total_in += s, s);
 }, Wi = (e, n) => {
-  let t = e.max_chain_length, a = e.strstart, s, l, c = e.prev_length, d = e.nice_match;
-  const x = e.strstart > e.w_size - J ? e.strstart - (e.w_size - J) : 0, g = e.window, _ = e.w_mask, I = e.prev, i = e.strstart + ce;
-  let r = g[a + c - 1], o = g[a + c];
-  e.prev_length >= e.good_match && (t >>= 2), d > e.lookahead && (d = e.lookahead);
+  let t = e.max_chain_length, a = e.strstart, s, l, d = e.prev_length, c = e.nice_match;
+  const x = e.strstart > e.w_size - J ? e.strstart - (e.w_size - J) : 0, g = e.window, w = e.w_mask, T = e.prev, i = e.strstart + ce;
+  let r = g[a + d - 1], o = g[a + d];
+  e.prev_length >= e.good_match && (t >>= 2), c > e.lookahead && (c = e.lookahead);
   do
-    if (s = n, !(g[s + c] !== o || g[s + c - 1] !== r || g[s] !== g[a] || g[++s] !== g[a + 1])) {
+    if (s = n, !(g[s + d] !== o || g[s + d - 1] !== r || g[s] !== g[a] || g[++s] !== g[a + 1])) {
       a += 2, s++;
       do
         ;
       while (g[++a] === g[++s] && g[++a] === g[++s] && g[++a] === g[++s] && g[++a] === g[++s] && g[++a] === g[++s] && g[++a] === g[++s] && g[++a] === g[++s] && g[++a] === g[++s] && a < i);
-      if (l = ce - (i - a), a = i - ce, l > c) {
-        if (e.match_start = n, c = l, l >= d)
+      if (l = ce - (i - a), a = i - ce, l > d) {
+        if (e.match_start = n, d = l, l >= c)
           break;
-        r = g[a + c - 1], o = g[a + c];
+        r = g[a + d - 1], o = g[a + d];
       }
     }
-  while ((n = I[n & _]) > x && --t !== 0);
-  return c <= e.lookahead ? c : e.lookahead;
+  while ((n = T[n & w]) > x && --t !== 0);
+  return d <= e.lookahead ? d : e.lookahead;
 }, ve = (e) => {
   const n = e.w_size;
-  let t, a, s, l, c;
+  let t, a, s, l, d;
   do {
     if (l = e.window_size - e.lookahead - e.strstart, e.strstart >= n + (n - J)) {
       e.window.set(e.window.subarray(n, n + n), 0), e.match_start -= n, e.strstart -= n, e.block_start -= n, a = e.hash_size, t = a;
@@ -2873,7 +2866,7 @@ const he = (e) => {
     if (e.strm.avail_in === 0)
       break;
     if (a = Hn(e.strm, e.window, e.strstart + e.lookahead, l), e.lookahead += a, e.lookahead + e.insert >= L)
-      for (c = e.strstart - e.insert, e.ins_h = e.window[c], e.ins_h = _e(e, e.ins_h, e.window[c + 1]); e.insert && (e.ins_h = _e(e, e.ins_h, e.window[c + L - 1]), e.prev[c & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = c, c++, e.insert--, !(e.lookahead + e.insert < L)); )
+      for (d = e.strstart - e.insert, e.ins_h = e.window[d], e.ins_h = _e(e, e.ins_h, e.window[d + 1]); e.insert && (e.ins_h = _e(e, e.ins_h, e.window[d + L - 1]), e.prev[d & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = d, d++, e.insert--, !(e.lookahead + e.insert < L)); )
         ;
   } while (e.lookahead < J && e.strm.avail_in !== 0);
 }, Xn = (e, n) => {
@@ -2890,8 +2883,8 @@ const he = (e) => {
     if ((e.strstart === 0 || e.strstart >= a) && (e.lookahead = e.strstart - a, e.strstart = a, X(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - J && (X(e, !1), e.strm.avail_out === 0))
       return P;
   }
-  return e.insert = 0, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Ae) : (e.strstart > e.block_start && (X(e, !1), e.strm.avail_out === 0), P);
-}, vt = (e, n) => {
+  return e.insert = 0, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Se) : (e.strstart > e.block_start && (X(e, !1), e.strm.avail_out === 0), P);
+}, xt = (e, n) => {
   let t, a;
   for (; ; ) {
     if (e.lookahead < J) {
@@ -2914,7 +2907,7 @@ const he = (e) => {
     if (a && (X(e, !1), e.strm.avail_out === 0))
       return P;
   }
-  return e.insert = e.strstart < L - 1 ? e.strstart : L - 1, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Ae) : e.last_lit && (X(e, !1), e.strm.avail_out === 0) ? P : Ve;
+  return e.insert = e.strstart < L - 1 ? e.strstart : L - 1, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Se) : e.last_lit && (X(e, !1), e.strm.avail_out === 0) ? P : Ve;
 }, Ie = (e, n) => {
   let t, a, s;
   for (; ; ) {
@@ -2937,10 +2930,10 @@ const he = (e) => {
     } else
       e.match_available = 1, e.strstart++, e.lookahead--;
   }
-  return e.match_available && (a = ge(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < L - 1 ? e.strstart : L - 1, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Ae) : e.last_lit && (X(e, !1), e.strm.avail_out === 0) ? P : Ve;
+  return e.match_available && (a = ge(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < L - 1 ? e.strstart : L - 1, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Se) : e.last_lit && (X(e, !1), e.strm.avail_out === 0) ? P : Ve;
 }, Vn = (e, n) => {
   let t, a, s, l;
-  const c = e.window;
+  const d = e.window;
   for (; ; ) {
     if (e.lookahead <= ce) {
       if (ve(e), e.lookahead <= ce && n === Te)
@@ -2948,17 +2941,17 @@ const he = (e) => {
       if (e.lookahead === 0)
         break;
     }
-    if (e.match_length = 0, e.lookahead >= L && e.strstart > 0 && (s = e.strstart - 1, a = c[s], a === c[++s] && a === c[++s] && a === c[++s])) {
+    if (e.match_length = 0, e.lookahead >= L && e.strstart > 0 && (s = e.strstart - 1, a = d[s], a === d[++s] && a === d[++s] && a === d[++s])) {
       l = e.strstart + ce;
       do
         ;
-      while (a === c[++s] && a === c[++s] && a === c[++s] && a === c[++s] && a === c[++s] && a === c[++s] && a === c[++s] && a === c[++s] && s < l);
+      while (a === d[++s] && a === d[++s] && a === d[++s] && a === d[++s] && a === d[++s] && a === d[++s] && a === d[++s] && a === d[++s] && s < l);
       e.match_length = ce - (l - s), e.match_length > e.lookahead && (e.match_length = e.lookahead);
     }
     if (e.match_length >= L ? (t = ge(e, 1, e.match_length - L), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = ge(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && (X(e, !1), e.strm.avail_out === 0))
       return P;
   }
-  return e.insert = 0, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Ae) : e.last_lit && (X(e, !1), e.strm.avail_out === 0) ? P : Ve;
+  return e.insert = 0, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Se) : e.last_lit && (X(e, !1), e.strm.avail_out === 0) ? P : Ve;
 }, Yn = (e, n) => {
   let t;
   for (; ; ) {
@@ -2970,7 +2963,7 @@ const he = (e) => {
     if (e.match_length = 0, t = ge(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, t && (X(e, !1), e.strm.avail_out === 0))
       return P;
   }
-  return e.insert = 0, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Ae) : e.last_lit && (X(e, !1), e.strm.avail_out === 0) ? P : Ve;
+  return e.insert = 0, n === pe ? (X(e, !0), e.strm.avail_out === 0 ? Ee : Se) : e.last_lit && (X(e, !1), e.strm.avail_out === 0) ? P : Ve;
 };
 function ee(e, n, t, a, s) {
   this.good_length = e, this.max_lazy = n, this.nice_length = t, this.max_chain = a, this.func = s;
@@ -2979,11 +2972,11 @@ const Le = [
   /*      good lazy nice chain */
   new ee(0, 0, 0, 0, Xn),
   /* 0 store only */
-  new ee(4, 4, 8, 4, vt),
+  new ee(4, 4, 8, 4, xt),
   /* 1 max speed, no lazy matches */
-  new ee(4, 5, 16, 8, vt),
+  new ee(4, 5, 16, 8, xt),
   /* 2 */
-  new ee(4, 6, 32, 32, vt),
+  new ee(4, 6, 32, 32, xt),
   /* 3 */
   new ee(4, 4, 16, 16, Ie),
   /* 4 lazy matches */
@@ -3001,53 +2994,53 @@ const Le = [
   e.window_size = 2 * e.w_size, ue(e.head), e.max_lazy_match = Le[e.level].max_lazy, e.good_match = Le[e.level].good_length, e.nice_match = Le[e.level].nice_length, e.max_chain_length = Le[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = L - 1, e.match_available = 0, e.ins_h = 0;
 };
 function Gn() {
-  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = ut, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(zn * 2), this.dyn_dtree = new Uint16Array((2 * Dn + 1) * 2), this.bl_tree = new Uint16Array((2 * Bn + 1) * 2), ue(this.dyn_ltree), ue(this.dyn_dtree), ue(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(Mn + 1), this.heap = new Uint16Array(2 * Rt + 1), ue(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Rt + 1), ue(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = ct, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(zn * 2), this.dyn_dtree = new Uint16Array((2 * Dn + 1) * 2), this.bl_tree = new Uint16Array((2 * Bn + 1) * 2), ue(this.dyn_ltree), ue(this.dyn_dtree), ue(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(Mn + 1), this.heap = new Uint16Array(2 * Ct + 1), ue(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Ct + 1), ue(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
 }
 const Ji = (e) => {
   if (!e || !e.state)
     return de(e, K);
   e.total_in = e.total_out = 0, e.data_type = Nn;
   const n = e.state;
-  return n.pending = 0, n.pending_out = 0, n.wrap < 0 && (n.wrap = -n.wrap), n.status = n.wrap ? ct : ye, e.adler = n.wrap === 2 ? 0 : 1, n.last_flush = Te, yn(n), ie;
+  return n.pending = 0, n.pending_out = 0, n.wrap < 0 && (n.wrap = -n.wrap), n.status = n.wrap ? dt : ye, e.adler = n.wrap === 2 ? 0 : 1, n.last_flush = Te, yn(n), ie;
 }, Qi = (e) => {
   const n = Ji(e);
   return n === ie && jn(e.state), n;
 }, qn = (e, n) => !e || !e.state || e.state.wrap !== 2 ? K : (e.state.gzhead = n, ie), er = (e, n, t, a, s, l) => {
   if (!e)
     return K;
-  let c = 1;
-  if (n === Fn && (n = 6), a < 0 ? (c = 0, a = -a) : a > 15 && (c = 2, a -= 16), s < 1 || s > Un || t !== ut || a < 8 || a > 15 || n < 0 || n > 9 || l < 0 || l > An)
+  let d = 1;
+  if (n === Fn && (n = 6), a < 0 ? (d = 0, a = -a) : a > 15 && (d = 2, a -= 16), s < 1 || s > Un || t !== ct || a < 8 || a > 15 || n < 0 || n > 9 || l < 0 || l > An)
     return de(e, K);
   a === 8 && (a = 9);
-  const d = new Gn();
-  return e.state = d, d.strm = e, d.wrap = c, d.gzhead = null, d.w_bits = a, d.w_size = 1 << d.w_bits, d.w_mask = d.w_size - 1, d.hash_bits = s + 7, d.hash_size = 1 << d.hash_bits, d.hash_mask = d.hash_size - 1, d.hash_shift = ~~((d.hash_bits + L - 1) / L), d.window = new Uint8Array(d.w_size * 2), d.head = new Uint16Array(d.hash_size), d.prev = new Uint16Array(d.w_size), d.lit_bufsize = 1 << s + 6, d.pending_buf_size = d.lit_bufsize * 4, d.pending_buf = new Uint8Array(d.pending_buf_size), d.d_buf = 1 * d.lit_bufsize, d.l_buf = 3 * d.lit_bufsize, d.level = n, d.strategy = l, d.method = t, Qi(e);
-}, Kn = (e, n) => er(e, n, ut, Ln, Rn, Sn), Wn = (e, n) => {
+  const c = new Gn();
+  return e.state = c, c.strm = e, c.wrap = d, c.gzhead = null, c.w_bits = a, c.w_size = 1 << c.w_bits, c.w_mask = c.w_size - 1, c.hash_bits = s + 7, c.hash_size = 1 << c.hash_bits, c.hash_mask = c.hash_size - 1, c.hash_shift = ~~((c.hash_bits + L - 1) / L), c.window = new Uint8Array(c.w_size * 2), c.head = new Uint16Array(c.hash_size), c.prev = new Uint16Array(c.w_size), c.lit_bufsize = 1 << s + 6, c.pending_buf_size = c.lit_bufsize * 4, c.pending_buf = new Uint8Array(c.pending_buf_size), c.d_buf = 1 * c.lit_bufsize, c.l_buf = 3 * c.lit_bufsize, c.level = n, c.strategy = l, c.method = t, Qi(e);
+}, Kn = (e, n) => er(e, n, ct, Ln, Rn, Sn), Wn = (e, n) => {
   let t, a;
-  if (!e || !e.state || n > Qt || n < 0)
+  if (!e || !e.state || n > ei || n < 0)
     return e ? de(e, K) : K;
   const s = e.state;
   if (!e.output || !e.input && e.avail_in !== 0 || s.status === Ue && n !== pe)
-    return de(e, e.avail_out === 0 ? Et : K);
+    return de(e, e.avail_out === 0 ? vt : K);
   s.strm = e;
   const l = s.last_flush;
-  if (s.last_flush = n, s.status === ct)
+  if (s.last_flush = n, s.status === dt)
     if (s.wrap === 2)
       e.adler = 0, C(s, 31), C(s, 139), C(s, 8), s.gzhead ? (C(
         s,
         (s.gzhead.text ? 1 : 0) + (s.gzhead.hcrc ? 2 : 0) + (s.gzhead.extra ? 4 : 0) + (s.gzhead.name ? 8 : 0) + (s.gzhead.comment ? 16 : 0)
-      ), C(s, s.gzhead.time & 255), C(s, s.gzhead.time >> 8 & 255), C(s, s.gzhead.time >> 16 & 255), C(s, s.gzhead.time >> 24 & 255), C(s, s.level === 9 ? 2 : s.strategy >= Ge || s.level < 2 ? 4 : 0), C(s, s.gzhead.os & 255), s.gzhead.extra && s.gzhead.extra.length && (C(s, s.gzhead.extra.length & 255), C(s, s.gzhead.extra.length >> 8 & 255)), s.gzhead.hcrc && (e.adler = $(e.adler, s.pending_buf, s.pending, 0)), s.gzindex = 0, s.status = Ct) : (C(s, 0), C(s, 0), C(s, 0), C(s, 0), C(s, 0), C(s, s.level === 9 ? 2 : s.strategy >= Ge || s.level < 2 ? 4 : 0), C(s, Zn), s.status = ye);
+      ), C(s, s.gzhead.time & 255), C(s, s.gzhead.time >> 8 & 255), C(s, s.gzhead.time >> 16 & 255), C(s, s.gzhead.time >> 24 & 255), C(s, s.level === 9 ? 2 : s.strategy >= Ge || s.level < 2 ? 4 : 0), C(s, s.gzhead.os & 255), s.gzhead.extra && s.gzhead.extra.length && (C(s, s.gzhead.extra.length & 255), C(s, s.gzhead.extra.length >> 8 & 255)), s.gzhead.hcrc && (e.adler = $(e.adler, s.pending_buf, s.pending, 0)), s.gzindex = 0, s.status = Ot) : (C(s, 0), C(s, 0), C(s, 0), C(s, 0), C(s, 0), C(s, s.level === 9 ? 2 : s.strategy >= Ge || s.level < 2 ? 4 : 0), C(s, Zn), s.status = ye);
     else {
-      let c = ut + (s.w_bits - 8 << 4) << 8, d = -1;
-      s.strategy >= Ge || s.level < 2 ? d = 0 : s.level < 6 ? d = 1 : s.level === 6 ? d = 2 : d = 3, c |= d << 6, s.strstart !== 0 && (c |= Pn), c += 31 - c % 31, s.status = ye, Se(s, c), s.strstart !== 0 && (Se(s, e.adler >>> 16), Se(s, e.adler & 65535)), e.adler = 1;
+      let d = ct + (s.w_bits - 8 << 4) << 8, c = -1;
+      s.strategy >= Ge || s.level < 2 ? c = 0 : s.level < 6 ? c = 1 : s.level === 6 ? c = 2 : c = 3, d |= c << 6, s.strstart !== 0 && (d |= Pn), d += 31 - d % 31, s.status = ye, Ne(s, d), s.strstart !== 0 && (Ne(s, e.adler >>> 16), Ne(s, e.adler & 65535)), e.adler = 1;
     }
-  if (s.status === Ct)
+  if (s.status === Ot)
     if (s.gzhead.extra) {
       for (t = s.pending; s.gzindex < (s.gzhead.extra.length & 65535) && !(s.pending === s.pending_buf_size && (s.gzhead.hcrc && s.pending > t && (e.adler = $(e.adler, s.pending_buf, s.pending - t, t)), he(e), t = s.pending, s.pending === s.pending_buf_size)); )
         C(s, s.gzhead.extra[s.gzindex] & 255), s.gzindex++;
-      s.gzhead.hcrc && s.pending > t && (e.adler = $(e.adler, s.pending_buf, s.pending - t, t)), s.gzindex === s.gzhead.extra.length && (s.gzindex = 0, s.status = rt);
+      s.gzhead.hcrc && s.pending > t && (e.adler = $(e.adler, s.pending_buf, s.pending - t, t)), s.gzindex === s.gzhead.extra.length && (s.gzindex = 0, s.status = nt);
     } else
-      s.status = rt;
-  if (s.status === rt)
+      s.status = nt;
+  if (s.status === nt)
     if (s.gzhead.name) {
       t = s.pending;
       do {
@@ -3057,10 +3050,10 @@ const Ji = (e) => {
         }
         s.gzindex < s.gzhead.name.length ? a = s.gzhead.name.charCodeAt(s.gzindex++) & 255 : a = 0, C(s, a);
       } while (a !== 0);
-      s.gzhead.hcrc && s.pending > t && (e.adler = $(e.adler, s.pending_buf, s.pending - t, t)), a === 0 && (s.gzindex = 0, s.status = nt);
+      s.gzhead.hcrc && s.pending > t && (e.adler = $(e.adler, s.pending_buf, s.pending - t, t)), a === 0 && (s.gzindex = 0, s.status = at);
     } else
-      s.status = nt;
-  if (s.status === nt)
+      s.status = at;
+  if (s.status === at)
     if (s.gzhead.comment) {
       t = s.pending;
       do {
@@ -3070,42 +3063,42 @@ const Ji = (e) => {
         }
         s.gzindex < s.gzhead.comment.length ? a = s.gzhead.comment.charCodeAt(s.gzindex++) & 255 : a = 0, C(s, a);
       } while (a !== 0);
-      s.gzhead.hcrc && s.pending > t && (e.adler = $(e.adler, s.pending_buf, s.pending - t, t)), a === 0 && (s.status = at);
+      s.gzhead.hcrc && s.pending > t && (e.adler = $(e.adler, s.pending_buf, s.pending - t, t)), a === 0 && (s.status = st);
     } else
-      s.status = at;
-  if (s.status === at && (s.gzhead.hcrc ? (s.pending + 2 > s.pending_buf_size && he(e), s.pending + 2 <= s.pending_buf_size && (C(s, e.adler & 255), C(s, e.adler >> 8 & 255), e.adler = 0, s.status = ye)) : s.status = ye), s.pending !== 0) {
+      s.status = st;
+  if (s.status === st && (s.gzhead.hcrc ? (s.pending + 2 > s.pending_buf_size && he(e), s.pending + 2 <= s.pending_buf_size && (C(s, e.adler & 255), C(s, e.adler >> 8 & 255), e.adler = 0, s.status = ye)) : s.status = ye), s.pending !== 0) {
     if (he(e), e.avail_out === 0)
       return s.last_flush = -1, ie;
-  } else if (e.avail_in === 0 && ti(n) <= ti(l) && n !== pe)
-    return de(e, Et);
+  } else if (e.avail_in === 0 && ii(n) <= ii(l) && n !== pe)
+    return de(e, vt);
   if (s.status === Ue && e.avail_in !== 0)
-    return de(e, Et);
+    return de(e, vt);
   if (e.avail_in !== 0 || s.lookahead !== 0 || n !== Te && s.status !== Ue) {
-    let c = s.strategy === Ge ? Yn(s, n) : s.strategy === kn ? Vn(s, n) : Le[s.level].func(s, n);
-    if ((c === Ee || c === Ae) && (s.status = Ue), c === P || c === Ee)
+    let d = s.strategy === Ge ? Yn(s, n) : s.strategy === kn ? Vn(s, n) : Le[s.level].func(s, n);
+    if ((d === Ee || d === Se) && (s.status = Ue), d === P || d === Ee)
       return e.avail_out === 0 && (s.last_flush = -1), ie;
-    if (c === Ve && (n === xn ? vn(s) : n !== Qt && (bn(s, 0, 0, !1), n === Tn && (ue(s.head), s.lookahead === 0 && (s.strstart = 0, s.block_start = 0, s.insert = 0))), he(e), e.avail_out === 0))
+    if (d === Ve && (n === xn ? vn(s) : n !== ei && (bn(s, 0, 0, !1), n === Tn && (ue(s.head), s.lookahead === 0 && (s.strstart = 0, s.block_start = 0, s.insert = 0))), he(e), e.avail_out === 0))
       return s.last_flush = -1, ie;
   }
-  return n !== pe ? ie : s.wrap <= 0 ? ei : (s.wrap === 2 ? (C(s, e.adler & 255), C(s, e.adler >> 8 & 255), C(s, e.adler >> 16 & 255), C(s, e.adler >> 24 & 255), C(s, e.total_in & 255), C(s, e.total_in >> 8 & 255), C(s, e.total_in >> 16 & 255), C(s, e.total_in >> 24 & 255)) : (Se(s, e.adler >>> 16), Se(s, e.adler & 65535)), he(e), s.wrap > 0 && (s.wrap = -s.wrap), s.pending !== 0 ? ie : ei);
+  return n !== pe ? ie : s.wrap <= 0 ? ti : (s.wrap === 2 ? (C(s, e.adler & 255), C(s, e.adler >> 8 & 255), C(s, e.adler >> 16 & 255), C(s, e.adler >> 24 & 255), C(s, e.total_in & 255), C(s, e.total_in >> 8 & 255), C(s, e.total_in >> 16 & 255), C(s, e.total_in >> 24 & 255)) : (Ne(s, e.adler >>> 16), Ne(s, e.adler & 65535)), he(e), s.wrap > 0 && (s.wrap = -s.wrap), s.pending !== 0 ? ie : ti);
 }, Jn = (e) => {
   if (!e || !e.state)
     return K;
   const n = e.state.status;
-  return n !== ct && n !== Ct && n !== rt && n !== nt && n !== at && n !== ye && n !== Ue ? de(e, K) : (e.state = null, n === ye ? de(e, In) : ie);
+  return n !== dt && n !== Ot && n !== nt && n !== at && n !== st && n !== ye && n !== Ue ? de(e, K) : (e.state = null, n === ye ? de(e, In) : ie);
 }, Qn = (e, n) => {
   let t = n.length;
   if (!e || !e.state)
     return K;
   const a = e.state, s = a.wrap;
-  if (s === 2 || s === 1 && a.status !== ct || a.lookahead)
+  if (s === 2 || s === 1 && a.status !== dt || a.lookahead)
     return K;
   if (s === 1 && (e.adler = Pe(e.adler, n, t, 0)), a.wrap = 0, t >= a.w_size) {
     s === 0 && (ue(a.head), a.strstart = 0, a.block_start = 0, a.insert = 0);
     let x = new Uint8Array(a.w_size);
     x.set(n.subarray(t - a.w_size, t), 0), n = x, t = a.w_size;
   }
-  const l = e.avail_in, c = e.next_in, d = e.input;
+  const l = e.avail_in, d = e.next_in, c = e.input;
   for (e.avail_in = t, e.next_in = 0, e.input = n, ve(a); a.lookahead >= L; ) {
     let x = a.strstart, g = a.lookahead - (L - 1);
     do
@@ -3113,7 +3106,7 @@ const Ji = (e) => {
     while (--g);
     a.strstart = x, a.lookahead = L - 1, ve(a);
   }
-  return a.strstart += a.lookahead, a.block_start = a.strstart, a.insert = a.lookahead, a.lookahead = 0, a.match_length = a.prev_length = L - 1, a.match_available = 0, e.next_in = c, e.input = d, e.avail_in = l, a.wrap = s, ie;
+  return a.strstart += a.lookahead, a.block_start = a.strstart, a.insert = a.lookahead, a.lookahead = 0, a.match_length = a.prev_length = L - 1, a.match_available = 0, e.next_in = d, e.input = c, e.avail_in = l, a.wrap = s, ie;
 };
 var ea = Kn, ta = er, ia = Qi, ra = Ji, na = qn, aa = Wn, sa = Jn, oa = Qn, la = "pako deflate (from Nodeca project)", Ce = {
   deflateInit: ea,
@@ -3145,11 +3138,11 @@ var fa = function(e) {
     n += e[a].length;
   const t = new Uint8Array(n);
   for (let a = 0, s = 0, l = e.length; a < l; a++) {
-    let c = e[a];
-    t.set(c, s), s += c.length;
+    let d = e[a];
+    t.set(d, s), s += d.length;
   }
   return t;
-}, dt = {
+}, gt = {
   assign: fa,
   flattenChunks: ua
 };
@@ -3166,11 +3159,11 @@ Ze[254] = Ze[254] = 1;
 var ca = (e) => {
   if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
     return new TextEncoder().encode(e);
-  let n, t, a, s, l, c = e.length, d = 0;
-  for (s = 0; s < c; s++)
-    t = e.charCodeAt(s), (t & 64512) === 55296 && s + 1 < c && (a = e.charCodeAt(s + 1), (a & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (a - 56320), s++)), d += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
-  for (n = new Uint8Array(d), l = 0, s = 0; l < d; s++)
-    t = e.charCodeAt(s), (t & 64512) === 55296 && s + 1 < c && (a = e.charCodeAt(s + 1), (a & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (a - 56320), s++)), t < 128 ? n[l++] = t : t < 2048 ? (n[l++] = 192 | t >>> 6, n[l++] = 128 | t & 63) : t < 65536 ? (n[l++] = 224 | t >>> 12, n[l++] = 128 | t >>> 6 & 63, n[l++] = 128 | t & 63) : (n[l++] = 240 | t >>> 18, n[l++] = 128 | t >>> 12 & 63, n[l++] = 128 | t >>> 6 & 63, n[l++] = 128 | t & 63);
+  let n, t, a, s, l, d = e.length, c = 0;
+  for (s = 0; s < d; s++)
+    t = e.charCodeAt(s), (t & 64512) === 55296 && s + 1 < d && (a = e.charCodeAt(s + 1), (a & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (a - 56320), s++)), c += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
+  for (n = new Uint8Array(c), l = 0, s = 0; l < c; s++)
+    t = e.charCodeAt(s), (t & 64512) === 55296 && s + 1 < d && (a = e.charCodeAt(s + 1), (a & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (a - 56320), s++)), t < 128 ? n[l++] = t : t < 2048 ? (n[l++] = 192 | t >>> 6, n[l++] = 128 | t & 63) : t < 65536 ? (n[l++] = 224 | t >>> 12, n[l++] = 128 | t >>> 6 & 63, n[l++] = 128 | t & 63) : (n[l++] = 240 | t >>> 18, n[l++] = 128 | t >>> 12 & 63, n[l++] = 128 | t >>> 6 & 63, n[l++] = 128 | t & 63);
   return n;
 };
 const da = (e, n) => {
@@ -3188,23 +3181,23 @@ var ga = (e, n) => {
   let a, s;
   const l = new Array(t * 2);
   for (s = 0, a = 0; a < t; ) {
-    let c = e[a++];
-    if (c < 128) {
-      l[s++] = c;
+    let d = e[a++];
+    if (d < 128) {
+      l[s++] = d;
       continue;
     }
-    let d = Ze[c];
-    if (d > 4) {
-      l[s++] = 65533, a += d - 1;
+    let c = Ze[d];
+    if (c > 4) {
+      l[s++] = 65533, a += c - 1;
       continue;
     }
-    for (c &= d === 2 ? 31 : d === 3 ? 15 : 7; d > 1 && a < t; )
-      c = c << 6 | e[a++] & 63, d--;
-    if (d > 1) {
+    for (d &= c === 2 ? 31 : c === 3 ? 15 : 7; c > 1 && a < t; )
+      d = d << 6 | e[a++] & 63, c--;
+    if (c > 1) {
       l[s++] = 65533;
       continue;
     }
-    c < 65536 ? l[s++] = c : (c -= 65536, l[s++] = 55296 | c >> 10 & 1023, l[s++] = 56320 | c & 1023);
+    d < 65536 ? l[s++] = d : (d -= 65536, l[s++] = 55296 | d >> 10 & 1023, l[s++] = 56320 | d & 1023);
   }
   return da(l, s);
 }, pa = (e, n) => {
@@ -3227,14 +3220,14 @@ const rr = Object.prototype.toString, {
   Z_SYNC_FLUSH: ya,
   Z_FULL_FLUSH: ba,
   Z_FINISH: Ea,
-  Z_OK: lt,
+  Z_OK: ht,
   Z_STREAM_END: va,
   Z_DEFAULT_COMPRESSION: xa,
   Z_DEFAULT_STRATEGY: Ta,
   Z_DEFLATED: Ia
-} = ft;
-function gt(e) {
-  this.options = dt.assign({
+} = ut;
+function pt(e) {
+  this.options = gt.assign({
     level: xa,
     method: Ia,
     chunkSize: 16384,
@@ -3252,16 +3245,16 @@ function gt(e) {
     n.memLevel,
     n.strategy
   );
-  if (t !== lt)
+  if (t !== ht)
     throw new Error(be[t]);
   if (n.header && Ce.deflateSetHeader(this.strm, n.header), n.dictionary) {
     let a;
-    if (typeof n.dictionary == "string" ? a = $e.string2buf(n.dictionary) : rr.call(n.dictionary) === "[object ArrayBuffer]" ? a = new Uint8Array(n.dictionary) : a = n.dictionary, t = Ce.deflateSetDictionary(this.strm, a), t !== lt)
+    if (typeof n.dictionary == "string" ? a = $e.string2buf(n.dictionary) : rr.call(n.dictionary) === "[object ArrayBuffer]" ? a = new Uint8Array(n.dictionary) : a = n.dictionary, t = Ce.deflateSetDictionary(this.strm, a), t !== ht)
       throw new Error(be[t]);
     this._dict_set = !0;
   }
 }
-gt.prototype.push = function(e, n) {
+pt.prototype.push = function(e, n) {
   const t = this.strm, a = this.options.chunkSize;
   let s, l;
   if (this.ended)
@@ -3272,7 +3265,7 @@ gt.prototype.push = function(e, n) {
       continue;
     }
     if (s = Ce.deflate(t, l), s === va)
-      return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), s = Ce.deflateEnd(this.strm), this.onEnd(s), this.ended = !0, s === lt;
+      return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), s = Ce.deflateEnd(this.strm), this.onEnd(s), this.ended = !0, s === ht;
     if (t.avail_out === 0) {
       this.onData(t.output);
       continue;
@@ -3285,14 +3278,14 @@ gt.prototype.push = function(e, n) {
   }
   return !0;
 };
-gt.prototype.onData = function(e) {
+pt.prototype.onData = function(e) {
   this.chunks.push(e);
 };
-gt.prototype.onEnd = function(e) {
-  e === lt && (this.result = dt.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+pt.prototype.onEnd = function(e) {
+  e === ht && (this.result = gt.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
 function Fa(e, n) {
-  const t = new gt(n);
+  const t = new pt(n);
   if (t.push(e, !0), t.err)
     throw t.msg || be[t.err];
   return t.result;
@@ -3302,71 +3295,71 @@ var ma = Fa, ka = {
 };
 const qe = 30, Aa = 12;
 var Sa = function(n, t) {
-  let a, s, l, c, d, x, g, _, I, i, r, o, h, f, p, w, b, E, m, A, F, k, v, y;
+  let a, s, l, d, c, x, g, w, T, i, r, o, h, f, p, _, E, y, m, A, F, k, v, b;
   const u = n.state;
-  a = n.next_in, v = n.input, s = a + (n.avail_in - 5), l = n.next_out, y = n.output, c = l - (t - n.avail_out), d = l + (n.avail_out - 257), x = u.dmax, g = u.wsize, _ = u.whave, I = u.wnext, i = u.window, r = u.hold, o = u.bits, h = u.lencode, f = u.distcode, p = (1 << u.lenbits) - 1, w = (1 << u.distbits) - 1;
+  a = n.next_in, v = n.input, s = a + (n.avail_in - 5), l = n.next_out, b = n.output, d = l - (t - n.avail_out), c = l + (n.avail_out - 257), x = u.dmax, g = u.wsize, w = u.whave, T = u.wnext, i = u.window, r = u.hold, o = u.bits, h = u.lencode, f = u.distcode, p = (1 << u.lenbits) - 1, _ = (1 << u.distbits) - 1;
   e:
     do {
-      o < 15 && (r += v[a++] << o, o += 8, r += v[a++] << o, o += 8), b = h[r & p];
+      o < 15 && (r += v[a++] << o, o += 8, r += v[a++] << o, o += 8), E = h[r & p];
       t:
         for (; ; ) {
-          if (E = b >>> 24, r >>>= E, o -= E, E = b >>> 16 & 255, E === 0)
-            y[l++] = b & 65535;
-          else if (E & 16) {
-            m = b & 65535, E &= 15, E && (o < E && (r += v[a++] << o, o += 8), m += r & (1 << E) - 1, r >>>= E, o -= E), o < 15 && (r += v[a++] << o, o += 8, r += v[a++] << o, o += 8), b = f[r & w];
+          if (y = E >>> 24, r >>>= y, o -= y, y = E >>> 16 & 255, y === 0)
+            b[l++] = E & 65535;
+          else if (y & 16) {
+            m = E & 65535, y &= 15, y && (o < y && (r += v[a++] << o, o += 8), m += r & (1 << y) - 1, r >>>= y, o -= y), o < 15 && (r += v[a++] << o, o += 8, r += v[a++] << o, o += 8), E = f[r & _];
             i:
               for (; ; ) {
-                if (E = b >>> 24, r >>>= E, o -= E, E = b >>> 16 & 255, E & 16) {
-                  if (A = b & 65535, E &= 15, o < E && (r += v[a++] << o, o += 8, o < E && (r += v[a++] << o, o += 8)), A += r & (1 << E) - 1, A > x) {
+                if (y = E >>> 24, r >>>= y, o -= y, y = E >>> 16 & 255, y & 16) {
+                  if (A = E & 65535, y &= 15, o < y && (r += v[a++] << o, o += 8, o < y && (r += v[a++] << o, o += 8)), A += r & (1 << y) - 1, A > x) {
                     n.msg = "invalid distance too far back", u.mode = qe;
                     break e;
                   }
-                  if (r >>>= E, o -= E, E = l - c, A > E) {
-                    if (E = A - E, E > _ && u.sane) {
+                  if (r >>>= y, o -= y, y = l - d, A > y) {
+                    if (y = A - y, y > w && u.sane) {
                       n.msg = "invalid distance too far back", u.mode = qe;
                       break e;
                     }
-                    if (F = 0, k = i, I === 0) {
-                      if (F += g - E, E < m) {
-                        m -= E;
+                    if (F = 0, k = i, T === 0) {
+                      if (F += g - y, y < m) {
+                        m -= y;
                         do
-                          y[l++] = i[F++];
-                        while (--E);
-                        F = l - A, k = y;
+                          b[l++] = i[F++];
+                        while (--y);
+                        F = l - A, k = b;
                       }
-                    } else if (I < E) {
-                      if (F += g + I - E, E -= I, E < m) {
-                        m -= E;
+                    } else if (T < y) {
+                      if (F += g + T - y, y -= T, y < m) {
+                        m -= y;
                         do
-                          y[l++] = i[F++];
-                        while (--E);
-                        if (F = 0, I < m) {
-                          E = I, m -= E;
+                          b[l++] = i[F++];
+                        while (--y);
+                        if (F = 0, T < m) {
+                          y = T, m -= y;
                           do
-                            y[l++] = i[F++];
-                          while (--E);
-                          F = l - A, k = y;
+                            b[l++] = i[F++];
+                          while (--y);
+                          F = l - A, k = b;
                         }
                       }
-                    } else if (F += I - E, E < m) {
-                      m -= E;
+                    } else if (F += T - y, y < m) {
+                      m -= y;
                       do
-                        y[l++] = i[F++];
-                      while (--E);
-                      F = l - A, k = y;
+                        b[l++] = i[F++];
+                      while (--y);
+                      F = l - A, k = b;
                     }
                     for (; m > 2; )
-                      y[l++] = k[F++], y[l++] = k[F++], y[l++] = k[F++], m -= 3;
-                    m && (y[l++] = k[F++], m > 1 && (y[l++] = k[F++]));
+                      b[l++] = k[F++], b[l++] = k[F++], b[l++] = k[F++], m -= 3;
+                    m && (b[l++] = k[F++], m > 1 && (b[l++] = k[F++]));
                   } else {
                     F = l - A;
                     do
-                      y[l++] = y[F++], y[l++] = y[F++], y[l++] = y[F++], m -= 3;
+                      b[l++] = b[F++], b[l++] = b[F++], b[l++] = b[F++], m -= 3;
                     while (m > 2);
-                    m && (y[l++] = y[F++], m > 1 && (y[l++] = y[F++]));
+                    m && (b[l++] = b[F++], m > 1 && (b[l++] = b[F++]));
                   }
-                } else if ((E & 64) === 0) {
-                  b = f[(b & 65535) + (r & (1 << E) - 1)];
+                } else if ((y & 64) === 0) {
+                  E = f[(E & 65535) + (r & (1 << y) - 1)];
                   continue i;
                 } else {
                   n.msg = "invalid distance code", u.mode = qe;
@@ -3374,10 +3367,10 @@ var Sa = function(n, t) {
                 }
                 break;
               }
-          } else if ((E & 64) === 0) {
-            b = h[(b & 65535) + (r & (1 << E) - 1)];
+          } else if ((y & 64) === 0) {
+            E = h[(E & 65535) + (r & (1 << y) - 1)];
             continue t;
-          } else if (E & 32) {
+          } else if (y & 32) {
             u.mode = Aa;
             break e;
           } else {
@@ -3386,10 +3379,10 @@ var Sa = function(n, t) {
           }
           break;
         }
-    } while (a < s && l < d);
-  m = o >> 3, a -= m, o -= m << 3, r &= (1 << o) - 1, n.next_in = a, n.next_out = l, n.avail_in = a < s ? 5 + (s - a) : 5 - (a - s), n.avail_out = l < d ? 257 + (d - l) : 257 - (l - d), u.hold = r, u.bits = o;
+    } while (a < s && l < c);
+  m = o >> 3, a -= m, o -= m << 3, r &= (1 << o) - 1, n.next_in = a, n.next_out = l, n.avail_in = a < s ? 5 + (s - a) : 5 - (a - s), n.avail_out = l < c ? 257 + (c - l) : 257 - (l - c), u.hold = r, u.bits = o;
 };
-const Fe = 15, ii = 852, ri = 592, ni = 0, xt = 1, ai = 2, Na = new Uint16Array([
+const Fe = 15, ri = 852, ni = 592, ai = 0, Tt = 1, si = 2, Na = new Uint16Array([
   /* Length codes 257..285 base */
   3,
   4,
@@ -3523,57 +3516,57 @@ const Fe = 15, ii = 852, ri = 592, ni = 0, xt = 1, ai = 2, Na = new Uint16Array(
   29,
   64,
   64
-]), Ca = (e, n, t, a, s, l, c, d) => {
-  const x = d.bits;
-  let g = 0, _ = 0, I = 0, i = 0, r = 0, o = 0, h = 0, f = 0, p = 0, w = 0, b, E, m, A, F, k = null, v = 0, y;
-  const u = new Uint16Array(Fe + 1), T = new Uint16Array(Fe + 1);
+]), Ca = (e, n, t, a, s, l, d, c) => {
+  const x = c.bits;
+  let g = 0, w = 0, T = 0, i = 0, r = 0, o = 0, h = 0, f = 0, p = 0, _ = 0, E, y, m, A, F, k = null, v = 0, b;
+  const u = new Uint16Array(Fe + 1), I = new Uint16Array(Fe + 1);
   let S = null, N = 0, U, R, O;
   for (g = 0; g <= Fe; g++)
     u[g] = 0;
-  for (_ = 0; _ < a; _++)
-    u[n[t + _]]++;
+  for (w = 0; w < a; w++)
+    u[n[t + w]]++;
   for (r = x, i = Fe; i >= 1 && u[i] === 0; i--)
     ;
   if (r > i && (r = i), i === 0)
-    return s[l++] = 1 << 24 | 64 << 16 | 0, s[l++] = 1 << 24 | 64 << 16 | 0, d.bits = 1, 0;
-  for (I = 1; I < i && u[I] === 0; I++)
+    return s[l++] = 1 << 24 | 64 << 16 | 0, s[l++] = 1 << 24 | 64 << 16 | 0, c.bits = 1, 0;
+  for (T = 1; T < i && u[T] === 0; T++)
     ;
-  for (r < I && (r = I), f = 1, g = 1; g <= Fe; g++)
+  for (r < T && (r = T), f = 1, g = 1; g <= Fe; g++)
     if (f <<= 1, f -= u[g], f < 0)
       return -1;
-  if (f > 0 && (e === ni || i !== 1))
+  if (f > 0 && (e === ai || i !== 1))
     return -1;
-  for (T[1] = 0, g = 1; g < Fe; g++)
-    T[g + 1] = T[g] + u[g];
-  for (_ = 0; _ < a; _++)
-    n[t + _] !== 0 && (c[T[n[t + _]]++] = _);
-  if (e === ni ? (k = S = c, y = 19) : e === xt ? (k = Na, v -= 257, S = Ua, N -= 257, y = 256) : (k = La, S = Ra, y = -1), w = 0, _ = 0, g = I, F = l, o = r, h = 0, m = -1, p = 1 << r, A = p - 1, e === xt && p > ii || e === ai && p > ri)
+  for (I[1] = 0, g = 1; g < Fe; g++)
+    I[g + 1] = I[g] + u[g];
+  for (w = 0; w < a; w++)
+    n[t + w] !== 0 && (d[I[n[t + w]]++] = w);
+  if (e === ai ? (k = S = d, b = 19) : e === Tt ? (k = Na, v -= 257, S = Ua, N -= 257, b = 256) : (k = La, S = Ra, b = -1), _ = 0, w = 0, g = T, F = l, o = r, h = 0, m = -1, p = 1 << r, A = p - 1, e === Tt && p > ri || e === si && p > ni)
     return 1;
   for (; ; ) {
-    U = g - h, c[_] < y ? (R = 0, O = c[_]) : c[_] > y ? (R = S[N + c[_]], O = k[v + c[_]]) : (R = 96, O = 0), b = 1 << g - h, E = 1 << o, I = E;
+    U = g - h, d[w] < b ? (R = 0, O = d[w]) : d[w] > b ? (R = S[N + d[w]], O = k[v + d[w]]) : (R = 96, O = 0), E = 1 << g - h, y = 1 << o, T = y;
     do
-      E -= b, s[F + (w >> h) + E] = U << 24 | R << 16 | O | 0;
-    while (E !== 0);
-    for (b = 1 << g - 1; w & b; )
-      b >>= 1;
-    if (b !== 0 ? (w &= b - 1, w += b) : w = 0, _++, --u[g] === 0) {
+      y -= E, s[F + (_ >> h) + y] = U << 24 | R << 16 | O | 0;
+    while (y !== 0);
+    for (E = 1 << g - 1; _ & E; )
+      E >>= 1;
+    if (E !== 0 ? (_ &= E - 1, _ += E) : _ = 0, w++, --u[g] === 0) {
       if (g === i)
         break;
-      g = n[t + c[_]];
+      g = n[t + d[w]];
     }
-    if (g > r && (w & A) !== m) {
-      for (h === 0 && (h = r), F += I, o = g - h, f = 1 << o; o + h < i && (f -= u[o + h], !(f <= 0)); )
+    if (g > r && (_ & A) !== m) {
+      for (h === 0 && (h = r), F += T, o = g - h, f = 1 << o; o + h < i && (f -= u[o + h], !(f <= 0)); )
         o++, f <<= 1;
-      if (p += 1 << o, e === xt && p > ii || e === ai && p > ri)
+      if (p += 1 << o, e === Tt && p > ri || e === si && p > ni)
         return 1;
-      m = w & A, s[m] = r << 24 | o << 16 | F - l | 0;
+      m = _ & A, s[m] = r << 24 | o << 16 | F - l | 0;
     }
   }
-  return w !== 0 && (s[F + w] = g - h << 24 | 64 << 16 | 0), d.bits = r, 0;
+  return _ !== 0 && (s[F + _] = g - h << 24 | 64 << 16 | 0), c.bits = r, 0;
 };
 var Oe = Ca;
 const Oa = 0, nr = 1, ar = 2, {
-  Z_FINISH: si,
+  Z_FINISH: oi,
   Z_BLOCK: Da,
   Z_TREES: Ke,
   Z_OK: xe,
@@ -3583,8 +3576,8 @@ const Oa = 0, nr = 1, ar = 2, {
   Z_DATA_ERROR: sr,
   Z_MEM_ERROR: or,
   Z_BUF_ERROR: Ma,
-  Z_DEFLATED: oi
-} = ft, lr = 1, li = 2, hi = 3, fi = 4, ui = 5, ci = 6, di = 7, gi = 8, pi = 9, _i = 10, ht = 11, ne = 12, Tt = 13, wi = 14, It = 15, yi = 16, bi = 17, Ei = 18, vi = 19, We = 20, Je = 21, xi = 22, Ti = 23, Ii = 24, Fi = 25, mi = 26, Ft = 27, ki = 28, Ai = 29, D = 30, hr = 31, Pa = 32, Za = 852, $a = 592, Ha = 15, Xa = Ha, Si = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
+  Z_DEFLATED: li
+} = ut, lr = 1, hi = 2, fi = 3, ui = 4, ci = 5, di = 6, gi = 7, pi = 8, _i = 9, wi = 10, ft = 11, ne = 12, It = 13, yi = 14, Ft = 15, bi = 16, Ei = 17, vi = 18, xi = 19, We = 20, Je = 21, Ti = 22, Ii = 23, Fi = 24, mi = 25, ki = 26, mt = 27, Ai = 28, Si = 29, D = 30, hr = 31, Pa = 32, Za = 852, $a = 592, Ha = 15, Xa = Ha, Ni = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
 function Va() {
   this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
 }
@@ -3612,10 +3605,10 @@ const fr = (e) => {
   const a = cr(e, n);
   return a !== xe && (e.state = null), a;
 }, Ya = (e) => dr(e, Xa);
-let Ni = !0, mt, kt;
+let Ui = !0, kt, At;
 const ja = (e) => {
-  if (Ni) {
-    mt = new Int32Array(512), kt = new Int32Array(32);
+  if (Ui) {
+    kt = new Int32Array(512), At = new Int32Array(32);
     let n = 0;
     for (; n < 144; )
       e.lens[n++] = 8;
@@ -3625,41 +3618,41 @@ const ja = (e) => {
       e.lens[n++] = 7;
     for (; n < 288; )
       e.lens[n++] = 8;
-    for (Oe(nr, e.lens, 0, 288, mt, 0, e.work, { bits: 9 }), n = 0; n < 32; )
+    for (Oe(nr, e.lens, 0, 288, kt, 0, e.work, { bits: 9 }), n = 0; n < 32; )
       e.lens[n++] = 5;
-    Oe(ar, e.lens, 0, 32, kt, 0, e.work, { bits: 5 }), Ni = !1;
+    Oe(ar, e.lens, 0, 32, At, 0, e.work, { bits: 5 }), Ui = !1;
   }
-  e.lencode = mt, e.lenbits = 9, e.distcode = kt, e.distbits = 5;
+  e.lencode = kt, e.lenbits = 9, e.distcode = At, e.distbits = 5;
 }, gr = (e, n, t, a) => {
   let s;
   const l = e.state;
   return l.window === null && (l.wsize = 1 << l.wbits, l.wnext = 0, l.whave = 0, l.window = new Uint8Array(l.wsize)), a >= l.wsize ? (l.window.set(n.subarray(t - l.wsize, t), 0), l.wnext = 0, l.whave = l.wsize) : (s = l.wsize - l.wnext, s > a && (s = a), l.window.set(n.subarray(t - a, t - a + s), l.wnext), a -= s, a ? (l.window.set(n.subarray(t - a, t), 0), l.wnext = a, l.whave = l.wsize) : (l.wnext += s, l.wnext === l.wsize && (l.wnext = 0), l.whave < l.wsize && (l.whave += s))), 0;
 }, Ga = (e, n) => {
-  let t, a, s, l, c, d, x, g, _, I, i, r, o, h, f = 0, p, w, b, E, m, A, F, k;
+  let t, a, s, l, d, c, x, g, w, T, i, r, o, h, f = 0, p, _, E, y, m, A, F, k;
   const v = new Uint8Array(4);
-  let y, u;
-  const T = (
+  let b, u;
+  const I = (
     /* permutation of code lengths */
     new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
   );
   if (!e || !e.state || !e.output || !e.input && e.avail_in !== 0)
     return W;
-  t = e.state, t.mode === ne && (t.mode = Tt), c = e.next_out, s = e.output, x = e.avail_out, l = e.next_in, a = e.input, d = e.avail_in, g = t.hold, _ = t.bits, I = d, i = x, k = xe;
+  t = e.state, t.mode === ne && (t.mode = It), d = e.next_out, s = e.output, x = e.avail_out, l = e.next_in, a = e.input, c = e.avail_in, g = t.hold, w = t.bits, T = c, i = x, k = xe;
   e:
     for (; ; )
       switch (t.mode) {
         case lr:
           if (t.wrap === 0) {
-            t.mode = Tt;
+            t.mode = It;
             break;
           }
-          for (; _ < 16; ) {
-            if (d === 0)
+          for (; w < 16; ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
           if (t.wrap & 2 && g === 35615) {
-            t.check = 0, v[0] = g & 255, v[1] = g >>> 8 & 255, t.check = $(t.check, v, 2, 0), g = 0, _ = 0, t.mode = li;
+            t.check = 0, v[0] = g & 255, v[1] = g >>> 8 & 255, t.check = $(t.check, v, 2, 0), g = 0, w = 0, t.mode = hi;
             break;
           }
           if (t.flags = 0, t.head && (t.head.done = !1), !(t.wrap & 1) || /* check if zlib header allowed */
@@ -3667,25 +3660,25 @@ const ja = (e) => {
             e.msg = "incorrect header check", t.mode = D;
             break;
           }
-          if ((g & 15) !== oi) {
+          if ((g & 15) !== li) {
             e.msg = "unknown compression method", t.mode = D;
             break;
           }
-          if (g >>>= 4, _ -= 4, F = (g & 15) + 8, t.wbits === 0)
+          if (g >>>= 4, w -= 4, F = (g & 15) + 8, t.wbits === 0)
             t.wbits = F;
           else if (F > t.wbits) {
             e.msg = "invalid window size", t.mode = D;
             break;
           }
-          t.dmax = 1 << t.wbits, e.adler = t.check = 1, t.mode = g & 512 ? _i : ne, g = 0, _ = 0;
+          t.dmax = 1 << t.wbits, e.adler = t.check = 1, t.mode = g & 512 ? wi : ne, g = 0, w = 0;
           break;
-        case li:
-          for (; _ < 16; ) {
-            if (d === 0)
+        case hi:
+          for (; w < 16; ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
-          if (t.flags = g, (t.flags & 255) !== oi) {
+          if (t.flags = g, (t.flags & 255) !== li) {
             e.msg = "unknown compression method", t.mode = D;
             break;
           }
@@ -3693,37 +3686,37 @@ const ja = (e) => {
             e.msg = "unknown header flags set", t.mode = D;
             break;
           }
-          t.head && (t.head.text = g >> 8 & 1), t.flags & 512 && (v[0] = g & 255, v[1] = g >>> 8 & 255, t.check = $(t.check, v, 2, 0)), g = 0, _ = 0, t.mode = hi;
+          t.head && (t.head.text = g >> 8 & 1), t.flags & 512 && (v[0] = g & 255, v[1] = g >>> 8 & 255, t.check = $(t.check, v, 2, 0)), g = 0, w = 0, t.mode = fi;
         /* falls through */
-        case hi:
-          for (; _ < 32; ) {
-            if (d === 0)
+        case fi:
+          for (; w < 32; ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
-          t.head && (t.head.time = g), t.flags & 512 && (v[0] = g & 255, v[1] = g >>> 8 & 255, v[2] = g >>> 16 & 255, v[3] = g >>> 24 & 255, t.check = $(t.check, v, 4, 0)), g = 0, _ = 0, t.mode = fi;
+          t.head && (t.head.time = g), t.flags & 512 && (v[0] = g & 255, v[1] = g >>> 8 & 255, v[2] = g >>> 16 & 255, v[3] = g >>> 24 & 255, t.check = $(t.check, v, 4, 0)), g = 0, w = 0, t.mode = ui;
         /* falls through */
-        case fi:
-          for (; _ < 16; ) {
-            if (d === 0)
+        case ui:
+          for (; w < 16; ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
-          t.head && (t.head.xflags = g & 255, t.head.os = g >> 8), t.flags & 512 && (v[0] = g & 255, v[1] = g >>> 8 & 255, t.check = $(t.check, v, 2, 0)), g = 0, _ = 0, t.mode = ui;
+          t.head && (t.head.xflags = g & 255, t.head.os = g >> 8), t.flags & 512 && (v[0] = g & 255, v[1] = g >>> 8 & 255, t.check = $(t.check, v, 2, 0)), g = 0, w = 0, t.mode = ci;
         /* falls through */
-        case ui:
+        case ci:
           if (t.flags & 1024) {
-            for (; _ < 16; ) {
-              if (d === 0)
+            for (; w < 16; ) {
+              if (c === 0)
                 break e;
-              d--, g += a[l++] << _, _ += 8;
+              c--, g += a[l++] << w, w += 8;
             }
-            t.length = g, t.head && (t.head.extra_len = g), t.flags & 512 && (v[0] = g & 255, v[1] = g >>> 8 & 255, t.check = $(t.check, v, 2, 0)), g = 0, _ = 0;
+            t.length = g, t.head && (t.head.extra_len = g), t.flags & 512 && (v[0] = g & 255, v[1] = g >>> 8 & 255, t.check = $(t.check, v, 2, 0)), g = 0, w = 0;
           } else t.head && (t.head.extra = null);
-          t.mode = ci;
+          t.mode = di;
         /* falls through */
-        case ci:
-          if (t.flags & 1024 && (r = t.length, r > d && (r = d), r && (t.head && (F = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
+        case di:
+          if (t.flags & 1024 && (r = t.length, r > c && (r = c), r && (t.head && (F = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
             a.subarray(
               l,
               // extra field is limited to 65536 bytes
@@ -3732,185 +3725,185 @@ const ja = (e) => {
             ),
             /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
             F
-          )), t.flags & 512 && (t.check = $(t.check, a, r, l)), d -= r, l += r, t.length -= r), t.length))
+          )), t.flags & 512 && (t.check = $(t.check, a, r, l)), c -= r, l += r, t.length -= r), t.length))
             break e;
-          t.length = 0, t.mode = di;
+          t.length = 0, t.mode = gi;
         /* falls through */
-        case di:
+        case gi:
           if (t.flags & 2048) {
-            if (d === 0)
+            if (c === 0)
               break e;
             r = 0;
             do
               F = a[l + r++], t.head && F && t.length < 65536 && (t.head.name += String.fromCharCode(F));
-            while (F && r < d);
-            if (t.flags & 512 && (t.check = $(t.check, a, r, l)), d -= r, l += r, F)
+            while (F && r < c);
+            if (t.flags & 512 && (t.check = $(t.check, a, r, l)), c -= r, l += r, F)
               break e;
           } else t.head && (t.head.name = null);
-          t.length = 0, t.mode = gi;
+          t.length = 0, t.mode = pi;
         /* falls through */
-        case gi:
+        case pi:
           if (t.flags & 4096) {
-            if (d === 0)
+            if (c === 0)
               break e;
             r = 0;
             do
               F = a[l + r++], t.head && F && t.length < 65536 && (t.head.comment += String.fromCharCode(F));
-            while (F && r < d);
-            if (t.flags & 512 && (t.check = $(t.check, a, r, l)), d -= r, l += r, F)
+            while (F && r < c);
+            if (t.flags & 512 && (t.check = $(t.check, a, r, l)), c -= r, l += r, F)
               break e;
           } else t.head && (t.head.comment = null);
-          t.mode = pi;
+          t.mode = _i;
         /* falls through */
-        case pi:
+        case _i:
           if (t.flags & 512) {
-            for (; _ < 16; ) {
-              if (d === 0)
+            for (; w < 16; ) {
+              if (c === 0)
                 break e;
-              d--, g += a[l++] << _, _ += 8;
+              c--, g += a[l++] << w, w += 8;
             }
             if (g !== (t.check & 65535)) {
               e.msg = "header crc mismatch", t.mode = D;
               break;
             }
-            g = 0, _ = 0;
+            g = 0, w = 0;
           }
           t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = !0), e.adler = t.check = 0, t.mode = ne;
           break;
-        case _i:
-          for (; _ < 32; ) {
-            if (d === 0)
+        case wi:
+          for (; w < 32; ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
-          e.adler = t.check = Si(g), g = 0, _ = 0, t.mode = ht;
+          e.adler = t.check = Ni(g), g = 0, w = 0, t.mode = ft;
         /* falls through */
-        case ht:
+        case ft:
           if (t.havedict === 0)
-            return e.next_out = c, e.avail_out = x, e.next_in = l, e.avail_in = d, t.hold = g, t.bits = _, za;
+            return e.next_out = d, e.avail_out = x, e.next_in = l, e.avail_in = c, t.hold = g, t.bits = w, za;
           e.adler = t.check = 1, t.mode = ne;
         /* falls through */
         case ne:
           if (n === Da || n === Ke)
             break e;
         /* falls through */
-        case Tt:
+        case It:
           if (t.last) {
-            g >>>= _ & 7, _ -= _ & 7, t.mode = Ft;
+            g >>>= w & 7, w -= w & 7, t.mode = mt;
             break;
           }
-          for (; _ < 3; ) {
-            if (d === 0)
+          for (; w < 3; ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
-          switch (t.last = g & 1, g >>>= 1, _ -= 1, g & 3) {
+          switch (t.last = g & 1, g >>>= 1, w -= 1, g & 3) {
             case 0:
-              t.mode = wi;
+              t.mode = yi;
               break;
             case 1:
               if (ja(t), t.mode = We, n === Ke) {
-                g >>>= 2, _ -= 2;
+                g >>>= 2, w -= 2;
                 break e;
               }
               break;
             case 2:
-              t.mode = bi;
+              t.mode = Ei;
               break;
             case 3:
               e.msg = "invalid block type", t.mode = D;
           }
-          g >>>= 2, _ -= 2;
+          g >>>= 2, w -= 2;
           break;
-        case wi:
-          for (g >>>= _ & 7, _ -= _ & 7; _ < 32; ) {
-            if (d === 0)
+        case yi:
+          for (g >>>= w & 7, w -= w & 7; w < 32; ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
           if ((g & 65535) !== (g >>> 16 ^ 65535)) {
             e.msg = "invalid stored block lengths", t.mode = D;
             break;
           }
-          if (t.length = g & 65535, g = 0, _ = 0, t.mode = It, n === Ke)
+          if (t.length = g & 65535, g = 0, w = 0, t.mode = Ft, n === Ke)
             break e;
         /* falls through */
-        case It:
-          t.mode = yi;
+        case Ft:
+          t.mode = bi;
         /* falls through */
-        case yi:
+        case bi:
           if (r = t.length, r) {
-            if (r > d && (r = d), r > x && (r = x), r === 0)
+            if (r > c && (r = c), r > x && (r = x), r === 0)
               break e;
-            s.set(a.subarray(l, l + r), c), d -= r, l += r, x -= r, c += r, t.length -= r;
+            s.set(a.subarray(l, l + r), d), c -= r, l += r, x -= r, d += r, t.length -= r;
             break;
           }
           t.mode = ne;
           break;
-        case bi:
-          for (; _ < 14; ) {
-            if (d === 0)
+        case Ei:
+          for (; w < 14; ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
-          if (t.nlen = (g & 31) + 257, g >>>= 5, _ -= 5, t.ndist = (g & 31) + 1, g >>>= 5, _ -= 5, t.ncode = (g & 15) + 4, g >>>= 4, _ -= 4, t.nlen > 286 || t.ndist > 30) {
+          if (t.nlen = (g & 31) + 257, g >>>= 5, w -= 5, t.ndist = (g & 31) + 1, g >>>= 5, w -= 5, t.ncode = (g & 15) + 4, g >>>= 4, w -= 4, t.nlen > 286 || t.ndist > 30) {
             e.msg = "too many length or distance symbols", t.mode = D;
             break;
           }
-          t.have = 0, t.mode = Ei;
+          t.have = 0, t.mode = vi;
         /* falls through */
-        case Ei:
+        case vi:
           for (; t.have < t.ncode; ) {
-            for (; _ < 3; ) {
-              if (d === 0)
+            for (; w < 3; ) {
+              if (c === 0)
                 break e;
-              d--, g += a[l++] << _, _ += 8;
+              c--, g += a[l++] << w, w += 8;
             }
-            t.lens[T[t.have++]] = g & 7, g >>>= 3, _ -= 3;
+            t.lens[I[t.have++]] = g & 7, g >>>= 3, w -= 3;
           }
           for (; t.have < 19; )
-            t.lens[T[t.have++]] = 0;
-          if (t.lencode = t.lendyn, t.lenbits = 7, y = { bits: t.lenbits }, k = Oe(Oa, t.lens, 0, 19, t.lencode, 0, t.work, y), t.lenbits = y.bits, k) {
+            t.lens[I[t.have++]] = 0;
+          if (t.lencode = t.lendyn, t.lenbits = 7, b = { bits: t.lenbits }, k = Oe(Oa, t.lens, 0, 19, t.lencode, 0, t.work, b), t.lenbits = b.bits, k) {
             e.msg = "invalid code lengths set", t.mode = D;
             break;
           }
-          t.have = 0, t.mode = vi;
+          t.have = 0, t.mode = xi;
         /* falls through */
-        case vi:
+        case xi:
           for (; t.have < t.nlen + t.ndist; ) {
-            for (; f = t.lencode[g & (1 << t.lenbits) - 1], p = f >>> 24, w = f >>> 16 & 255, b = f & 65535, !(p <= _); ) {
-              if (d === 0)
+            for (; f = t.lencode[g & (1 << t.lenbits) - 1], p = f >>> 24, _ = f >>> 16 & 255, E = f & 65535, !(p <= w); ) {
+              if (c === 0)
                 break e;
-              d--, g += a[l++] << _, _ += 8;
+              c--, g += a[l++] << w, w += 8;
             }
-            if (b < 16)
-              g >>>= p, _ -= p, t.lens[t.have++] = b;
+            if (E < 16)
+              g >>>= p, w -= p, t.lens[t.have++] = E;
             else {
-              if (b === 16) {
-                for (u = p + 2; _ < u; ) {
-                  if (d === 0)
+              if (E === 16) {
+                for (u = p + 2; w < u; ) {
+                  if (c === 0)
                     break e;
-                  d--, g += a[l++] << _, _ += 8;
+                  c--, g += a[l++] << w, w += 8;
                 }
-                if (g >>>= p, _ -= p, t.have === 0) {
+                if (g >>>= p, w -= p, t.have === 0) {
                   e.msg = "invalid bit length repeat", t.mode = D;
                   break;
                 }
-                F = t.lens[t.have - 1], r = 3 + (g & 3), g >>>= 2, _ -= 2;
-              } else if (b === 17) {
-                for (u = p + 3; _ < u; ) {
-                  if (d === 0)
+                F = t.lens[t.have - 1], r = 3 + (g & 3), g >>>= 2, w -= 2;
+              } else if (E === 17) {
+                for (u = p + 3; w < u; ) {
+                  if (c === 0)
                     break e;
-                  d--, g += a[l++] << _, _ += 8;
+                  c--, g += a[l++] << w, w += 8;
                 }
-                g >>>= p, _ -= p, F = 0, r = 3 + (g & 7), g >>>= 3, _ -= 3;
+                g >>>= p, w -= p, F = 0, r = 3 + (g & 7), g >>>= 3, w -= 3;
               } else {
-                for (u = p + 7; _ < u; ) {
-                  if (d === 0)
+                for (u = p + 7; w < u; ) {
+                  if (c === 0)
                     break e;
-                  d--, g += a[l++] << _, _ += 8;
+                  c--, g += a[l++] << w, w += 8;
                 }
-                g >>>= p, _ -= p, F = 0, r = 11 + (g & 127), g >>>= 7, _ -= 7;
+                g >>>= p, w -= p, F = 0, r = 11 + (g & 127), g >>>= 7, w -= 7;
               }
               if (t.have + r > t.nlen + t.ndist) {
                 e.msg = "invalid bit length repeat", t.mode = D;
@@ -3926,11 +3919,11 @@ const ja = (e) => {
             e.msg = "invalid code -- missing end-of-block", t.mode = D;
             break;
           }
-          if (t.lenbits = 9, y = { bits: t.lenbits }, k = Oe(nr, t.lens, 0, t.nlen, t.lencode, 0, t.work, y), t.lenbits = y.bits, k) {
+          if (t.lenbits = 9, b = { bits: t.lenbits }, k = Oe(nr, t.lens, 0, t.nlen, t.lencode, 0, t.work, b), t.lenbits = b.bits, k) {
             e.msg = "invalid literal/lengths set", t.mode = D;
             break;
           }
-          if (t.distbits = 6, t.distcode = t.distdyn, y = { bits: t.distbits }, k = Oe(ar, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, y), t.distbits = y.bits, k) {
+          if (t.distbits = 6, t.distcode = t.distdyn, b = { bits: t.distbits }, k = Oe(ar, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, b), t.distbits = b.bits, k) {
             e.msg = "invalid distances set", t.mode = D;
             break;
           }
@@ -3941,84 +3934,84 @@ const ja = (e) => {
           t.mode = Je;
         /* falls through */
         case Je:
-          if (d >= 6 && x >= 258) {
-            e.next_out = c, e.avail_out = x, e.next_in = l, e.avail_in = d, t.hold = g, t.bits = _, Sa(e, i), c = e.next_out, s = e.output, x = e.avail_out, l = e.next_in, a = e.input, d = e.avail_in, g = t.hold, _ = t.bits, t.mode === ne && (t.back = -1);
+          if (c >= 6 && x >= 258) {
+            e.next_out = d, e.avail_out = x, e.next_in = l, e.avail_in = c, t.hold = g, t.bits = w, Sa(e, i), d = e.next_out, s = e.output, x = e.avail_out, l = e.next_in, a = e.input, c = e.avail_in, g = t.hold, w = t.bits, t.mode === ne && (t.back = -1);
             break;
           }
-          for (t.back = 0; f = t.lencode[g & (1 << t.lenbits) - 1], p = f >>> 24, w = f >>> 16 & 255, b = f & 65535, !(p <= _); ) {
-            if (d === 0)
+          for (t.back = 0; f = t.lencode[g & (1 << t.lenbits) - 1], p = f >>> 24, _ = f >>> 16 & 255, E = f & 65535, !(p <= w); ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
-          if (w && (w & 240) === 0) {
-            for (E = p, m = w, A = b; f = t.lencode[A + ((g & (1 << E + m) - 1) >> E)], p = f >>> 24, w = f >>> 16 & 255, b = f & 65535, !(E + p <= _); ) {
-              if (d === 0)
+          if (_ && (_ & 240) === 0) {
+            for (y = p, m = _, A = E; f = t.lencode[A + ((g & (1 << y + m) - 1) >> y)], p = f >>> 24, _ = f >>> 16 & 255, E = f & 65535, !(y + p <= w); ) {
+              if (c === 0)
                 break e;
-              d--, g += a[l++] << _, _ += 8;
+              c--, g += a[l++] << w, w += 8;
             }
-            g >>>= E, _ -= E, t.back += E;
+            g >>>= y, w -= y, t.back += y;
           }
-          if (g >>>= p, _ -= p, t.back += p, t.length = b, w === 0) {
-            t.mode = mi;
+          if (g >>>= p, w -= p, t.back += p, t.length = E, _ === 0) {
+            t.mode = ki;
             break;
           }
-          if (w & 32) {
+          if (_ & 32) {
             t.back = -1, t.mode = ne;
             break;
           }
-          if (w & 64) {
+          if (_ & 64) {
             e.msg = "invalid literal/length code", t.mode = D;
             break;
           }
-          t.extra = w & 15, t.mode = xi;
+          t.extra = _ & 15, t.mode = Ti;
         /* falls through */
-        case xi:
+        case Ti:
           if (t.extra) {
-            for (u = t.extra; _ < u; ) {
-              if (d === 0)
+            for (u = t.extra; w < u; ) {
+              if (c === 0)
                 break e;
-              d--, g += a[l++] << _, _ += 8;
+              c--, g += a[l++] << w, w += 8;
             }
-            t.length += g & (1 << t.extra) - 1, g >>>= t.extra, _ -= t.extra, t.back += t.extra;
+            t.length += g & (1 << t.extra) - 1, g >>>= t.extra, w -= t.extra, t.back += t.extra;
           }
-          t.was = t.length, t.mode = Ti;
+          t.was = t.length, t.mode = Ii;
         /* falls through */
-        case Ti:
-          for (; f = t.distcode[g & (1 << t.distbits) - 1], p = f >>> 24, w = f >>> 16 & 255, b = f & 65535, !(p <= _); ) {
-            if (d === 0)
+        case Ii:
+          for (; f = t.distcode[g & (1 << t.distbits) - 1], p = f >>> 24, _ = f >>> 16 & 255, E = f & 65535, !(p <= w); ) {
+            if (c === 0)
               break e;
-            d--, g += a[l++] << _, _ += 8;
+            c--, g += a[l++] << w, w += 8;
           }
-          if ((w & 240) === 0) {
-            for (E = p, m = w, A = b; f = t.distcode[A + ((g & (1 << E + m) - 1) >> E)], p = f >>> 24, w = f >>> 16 & 255, b = f & 65535, !(E + p <= _); ) {
-              if (d === 0)
+          if ((_ & 240) === 0) {
+            for (y = p, m = _, A = E; f = t.distcode[A + ((g & (1 << y + m) - 1) >> y)], p = f >>> 24, _ = f >>> 16 & 255, E = f & 65535, !(y + p <= w); ) {
+              if (c === 0)
                 break e;
-              d--, g += a[l++] << _, _ += 8;
+              c--, g += a[l++] << w, w += 8;
             }
-            g >>>= E, _ -= E, t.back += E;
+            g >>>= y, w -= y, t.back += y;
           }
-          if (g >>>= p, _ -= p, t.back += p, w & 64) {
+          if (g >>>= p, w -= p, t.back += p, _ & 64) {
             e.msg = "invalid distance code", t.mode = D;
             break;
           }
-          t.offset = b, t.extra = w & 15, t.mode = Ii;
+          t.offset = E, t.extra = _ & 15, t.mode = Fi;
         /* falls through */
-        case Ii:
+        case Fi:
           if (t.extra) {
-            for (u = t.extra; _ < u; ) {
-              if (d === 0)
+            for (u = t.extra; w < u; ) {
+              if (c === 0)
                 break e;
-              d--, g += a[l++] << _, _ += 8;
+              c--, g += a[l++] << w, w += 8;
             }
-            t.offset += g & (1 << t.extra) - 1, g >>>= t.extra, _ -= t.extra, t.back += t.extra;
+            t.offset += g & (1 << t.extra) - 1, g >>>= t.extra, w -= t.extra, t.back += t.extra;
           }
           if (t.offset > t.dmax) {
             e.msg = "invalid distance too far back", t.mode = D;
             break;
           }
-          t.mode = Fi;
+          t.mode = mi;
         /* falls through */
-        case Fi:
+        case mi:
           if (x === 0)
             break e;
           if (r = i - x, t.offset > r) {
@@ -4028,50 +4021,50 @@ const ja = (e) => {
             }
             r > t.wnext ? (r -= t.wnext, o = t.wsize - r) : o = t.wnext - r, r > t.length && (r = t.length), h = t.window;
           } else
-            h = s, o = c - t.offset, r = t.length;
+            h = s, o = d - t.offset, r = t.length;
           r > x && (r = x), x -= r, t.length -= r;
           do
-            s[c++] = h[o++];
+            s[d++] = h[o++];
           while (--r);
           t.length === 0 && (t.mode = Je);
           break;
-        case mi:
+        case ki:
           if (x === 0)
             break e;
-          s[c++] = t.length, x--, t.mode = Je;
+          s[d++] = t.length, x--, t.mode = Je;
           break;
-        case Ft:
+        case mt:
           if (t.wrap) {
-            for (; _ < 32; ) {
-              if (d === 0)
+            for (; w < 32; ) {
+              if (c === 0)
                 break e;
-              d--, g |= a[l++] << _, _ += 8;
+              c--, g |= a[l++] << w, w += 8;
             }
             if (i -= x, e.total_out += i, t.total += i, i && (e.adler = t.check = /*UPDATE(state.check, put - _out, _out);*/
-            t.flags ? $(t.check, s, i, c - i) : Pe(t.check, s, i, c - i)), i = x, (t.flags ? g : Si(g)) !== t.check) {
+            t.flags ? $(t.check, s, i, d - i) : Pe(t.check, s, i, d - i)), i = x, (t.flags ? g : Ni(g)) !== t.check) {
               e.msg = "incorrect data check", t.mode = D;
               break;
             }
-            g = 0, _ = 0;
+            g = 0, w = 0;
           }
-          t.mode = ki;
+          t.mode = Ai;
         /* falls through */
-        case ki:
+        case Ai:
           if (t.wrap && t.flags) {
-            for (; _ < 32; ) {
-              if (d === 0)
+            for (; w < 32; ) {
+              if (c === 0)
                 break e;
-              d--, g += a[l++] << _, _ += 8;
+              c--, g += a[l++] << w, w += 8;
             }
             if (g !== (t.total & 4294967295)) {
               e.msg = "incorrect length check", t.mode = D;
               break;
             }
-            g = 0, _ = 0;
+            g = 0, w = 0;
           }
-          t.mode = Ai;
+          t.mode = Si;
         /* falls through */
-        case Ai:
+        case Si:
           k = Ba;
           break e;
         case D:
@@ -4084,8 +4077,8 @@ const ja = (e) => {
         default:
           return W;
       }
-  return e.next_out = c, e.avail_out = x, e.next_in = l, e.avail_in = d, t.hold = g, t.bits = _, (t.wsize || i !== e.avail_out && t.mode < D && (t.mode < Ft || n !== si)) && gr(e, e.output, e.next_out, i - e.avail_out), I -= e.avail_in, i -= e.avail_out, e.total_in += I, e.total_out += i, t.total += i, t.wrap && i && (e.adler = t.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
-  t.flags ? $(t.check, s, i, e.next_out - i) : Pe(t.check, s, i, e.next_out - i)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === ne ? 128 : 0) + (t.mode === We || t.mode === It ? 256 : 0), (I === 0 && i === 0 || n === si) && k === xe && (k = Ma), k;
+  return e.next_out = d, e.avail_out = x, e.next_in = l, e.avail_in = c, t.hold = g, t.bits = w, (t.wsize || i !== e.avail_out && t.mode < D && (t.mode < mt || n !== oi)) && gr(e, e.output, e.next_out, i - e.avail_out), T -= e.avail_in, i -= e.avail_out, e.total_in += T, e.total_out += i, t.total += i, t.wrap && i && (e.adler = t.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
+  t.flags ? $(t.check, s, i, e.next_out - i) : Pe(t.check, s, i, e.next_out - i)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === ne ? 128 : 0) + (t.mode === We || t.mode === Ft ? 256 : 0), (T === 0 && i === 0 || n === oi) && k === xe && (k = Ma), k;
 }, qa = (e) => {
   if (!e || !e.state)
     return W;
@@ -4099,7 +4092,7 @@ const ja = (e) => {
 }, Wa = (e, n) => {
   const t = n.length;
   let a, s, l;
-  return !e || !e.state || (a = e.state, a.wrap !== 0 && a.mode !== ht) ? W : a.mode === ht && (s = 1, s = Pe(s, n, t, 0), s !== a.check) ? sr : (l = gr(e, n, t, t), l ? (a.mode = hr, or) : (a.havedict = 1, xe));
+  return !e || !e.state || (a = e.state, a.wrap !== 0 && a.mode !== ft) ? W : a.mode === ft && (s = 1, s = Pe(s, n, t, 0), s !== a.check) ? sr : (l = gr(e, n, t, t), l ? (a.mode = hr, or) : (a.havedict = 1, xe));
 };
 var Ja = ur, Qa = cr, es = fr, ts = Ya, is = dr, rs = Ga, ns = qa, as = Ka, ss = Wa, os = "pako inflate (from Nodeca project)", oe = {
   inflateReset: Ja,
@@ -4121,14 +4114,14 @@ const pr = Object.prototype.toString, {
   Z_NO_FLUSH: fs,
   Z_FINISH: us,
   Z_OK: He,
-  Z_STREAM_END: At,
-  Z_NEED_DICT: St,
+  Z_STREAM_END: St,
+  Z_NEED_DICT: Nt,
   Z_STREAM_ERROR: cs,
-  Z_DATA_ERROR: Ui,
+  Z_DATA_ERROR: Li,
   Z_MEM_ERROR: ds
-} = ft;
-function pt(e) {
-  this.options = dt.assign({
+} = ut;
+function _t(e) {
+  this.options = gt.assign({
     chunkSize: 1024 * 64,
     windowBits: 15,
     to: ""
@@ -4144,42 +4137,42 @@ function pt(e) {
   if (this.header = new hs(), oe.inflateGetHeader(this.strm, this.header), n.dictionary && (typeof n.dictionary == "string" ? n.dictionary = $e.string2buf(n.dictionary) : pr.call(n.dictionary) === "[object ArrayBuffer]" && (n.dictionary = new Uint8Array(n.dictionary)), n.raw && (t = oe.inflateSetDictionary(this.strm, n.dictionary), t !== He)))
     throw new Error(be[t]);
 }
-pt.prototype.push = function(e, n) {
+_t.prototype.push = function(e, n) {
   const t = this.strm, a = this.options.chunkSize, s = this.options.dictionary;
-  let l, c, d;
+  let l, d, c;
   if (this.ended) return !1;
-  for (n === ~~n ? c = n : c = n === !0 ? us : fs, pr.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
-    for (t.avail_out === 0 && (t.output = new Uint8Array(a), t.next_out = 0, t.avail_out = a), l = oe.inflate(t, c), l === St && s && (l = oe.inflateSetDictionary(t, s), l === He ? l = oe.inflate(t, c) : l === Ui && (l = St)); t.avail_in > 0 && l === At && t.state.wrap > 0 && e[t.next_in] !== 0; )
-      oe.inflateReset(t), l = oe.inflate(t, c);
+  for (n === ~~n ? d = n : d = n === !0 ? us : fs, pr.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
+    for (t.avail_out === 0 && (t.output = new Uint8Array(a), t.next_out = 0, t.avail_out = a), l = oe.inflate(t, d), l === Nt && s && (l = oe.inflateSetDictionary(t, s), l === He ? l = oe.inflate(t, d) : l === Li && (l = Nt)); t.avail_in > 0 && l === St && t.state.wrap > 0 && e[t.next_in] !== 0; )
+      oe.inflateReset(t), l = oe.inflate(t, d);
     switch (l) {
       case cs:
-      case Ui:
-      case St:
+      case Li:
+      case Nt:
       case ds:
         return this.onEnd(l), this.ended = !0, !1;
     }
-    if (d = t.avail_out, t.next_out && (t.avail_out === 0 || l === At))
+    if (c = t.avail_out, t.next_out && (t.avail_out === 0 || l === St))
       if (this.options.to === "string") {
-        let x = $e.utf8border(t.output, t.next_out), g = t.next_out - x, _ = $e.buf2string(t.output, x);
-        t.next_out = g, t.avail_out = a - g, g && t.output.set(t.output.subarray(x, x + g), 0), this.onData(_);
+        let x = $e.utf8border(t.output, t.next_out), g = t.next_out - x, w = $e.buf2string(t.output, x);
+        t.next_out = g, t.avail_out = a - g, g && t.output.set(t.output.subarray(x, x + g), 0), this.onData(w);
       } else
         this.onData(t.output.length === t.next_out ? t.output : t.output.subarray(0, t.next_out));
-    if (!(l === He && d === 0)) {
-      if (l === At)
+    if (!(l === He && c === 0)) {
+      if (l === St)
         return l = oe.inflateEnd(this.strm), this.onEnd(l), this.ended = !0, !0;
       if (t.avail_in === 0) break;
     }
   }
   return !0;
 };
-pt.prototype.onData = function(e) {
+_t.prototype.onData = function(e) {
   this.chunks.push(e);
 };
-pt.prototype.onEnd = function(e) {
-  e === He && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = dt.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+_t.prototype.onEnd = function(e) {
+  e === He && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = gt.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
 function gs(e, n) {
-  const t = new pt(n);
+  const t = new _t(n);
   if (t.push(e), t.err) throw t.msg || be[t.err];
   return t.result;
 }
@@ -4191,7 +4184,7 @@ var _s = ps, ws = {
 };
 const { deflate: ys } = ka, { inflateRaw: bs } = ws;
 var Es = ys, vs = bs;
-function Li(e, n = 4294967295) {
+function Qe(e, n = 4294967295) {
   let t = n ^ 4294967295;
   const a = 3988292384;
   for (let s = 0; s < e.length; s++) {
@@ -4201,11 +4194,11 @@ function Li(e, n = 4294967295) {
   }
   return (t ^ 4294967295) >>> 0;
 }
-const Qe = (e, n) => e.getUint32(n, !1), Ri = (e) => {
+const et = (e, n) => e.getUint32(n, !1), Ri = (e) => {
   const n = new ArrayBuffer(4);
   return new DataView(n).setUint32(0, e, !1), new Uint8Array(n);
 };
-function Ne(...e) {
+function me(...e) {
   const n = e.reduce((s, l) => s + l.length, 0), t = new Uint8Array(n);
   let a = 0;
   for (const s of e)
@@ -4226,96 +4219,105 @@ async function Fs(e) {
   const n = e, t = new DataView(n.buffer, n.byteOffset, n.byteLength);
   let a = !1, s = 8;
   const l = [];
-  let c = new Uint8Array(0);
-  const d = n.slice(0, 8);
-  let x = 0, g = 0;
+  let d = new Uint8Array(0), c = null;
+  const x = n.slice(0, 8);
+  let g = 0, w = 0;
   for (; s < n.length; ) {
     if (s + 4 > n.length)
       throw new Error("Truncated chunk length.");
-    const i = Qe(t, s);
+    const r = et(t, s);
     if (s += 4, s + 4 > n.length)
       throw new Error("Truncated chunk type.");
-    const r = n.slice(s, s + 4);
+    const o = n.slice(s, s + 4);
     s += 4;
-    const o = new TextDecoder("ascii").decode(r);
-    if (s + i > n.length)
+    const h = new TextDecoder("ascii").decode(o);
+    if (s + r > n.length)
       throw new Error("Truncated chunk data.");
-    const h = n.slice(s, s + i);
-    if (s += i, s + 4 > n.length)
+    const f = n.slice(s, s + r);
+    if (s += r, s + 4 > n.length)
       throw new Error("Truncated chunk CRC.");
-    const f = Qe(t, s);
-    if (s += 4, o === "CgBI") {
+    const p = et(t, s);
+    if (s += 4, h === "CgBI") {
       a = !0;
       continue;
     }
-    if (!Ts.includes(o)) {
-      if (o === "IHDR") {
-        if (i < 8)
+    if (!Ts.includes(h)) {
+      if (h === "IHDR") {
+        if (r < 8)
           throw new Error("Invalid IHDR chunk length.");
-        const p = new DataView(h.buffer, h.byteOffset, h.byteLength);
-        x = Qe(p, 0), g = Qe(p, 4);
+        const _ = new DataView(f.buffer, f.byteOffset, f.byteLength);
+        g = et(_, 0), w = et(_, 4);
       }
-      if (o === "IDAT" && a) {
-        c = Ne(c, h);
+      if (h === "IDAT" && a) {
+        d = me(d, f);
         continue;
       }
-      if (o === "IEND" && a) {
-        if (c.length === 0)
+      if (h === "IDAT" && !a) {
+        c = c ? me(c, f) : f;
+        continue;
+      }
+      if (h === "IEND" && a) {
+        if (d.length === 0)
           throw new Error("No IDAT data found for CgBI PNG.");
-        let p;
+        let _;
         try {
-          p = vs(c);
-        } catch (y) {
-          throw new Error(`Failed to inflate IDAT data: ${y}`);
+          _ = vs(d);
+        } catch (u) {
+          throw new Error(`Failed to inflate IDAT data: ${u}`);
         }
-        const w = new Uint8Array(p.length);
-        let b = 0;
-        const E = 4;
-        for (let y = 0; y < g; y++) {
-          w[b] = p[b], b++;
-          for (let u = 0; u < x; u++)
-            w[b + 0] = p[b + 2], w[b + 1] = p[b + 1], w[b + 2] = p[b + 0], w[b + 3] = p[b + 3], b += E;
+        const E = new Uint8Array(_.length);
+        let y = 0;
+        const m = 4;
+        for (let u = 0; u < w; u++) {
+          E[y] = _[y], y++;
+          for (let I = 0; I < g; I++)
+            E[y + 0] = _[y + 2], E[y + 1] = _[y + 1], E[y + 2] = _[y + 0], E[y + 3] = _[y + 3], y += m;
         }
-        let m;
+        let A;
         try {
-          m = Es(w, { level: 9 });
-        } catch (y) {
-          throw new Error(`Failed to deflate IDAT data: ${y}`);
+          A = Es(E, { level: 9 });
+        } catch (u) {
+          throw new Error(`Failed to deflate IDAT data: ${u}`);
         }
-        const F = new TextEncoder().encode("IDAT");
-        let k = Li(F);
-        k = Li(m, k);
-        const v = {
+        const k = new TextEncoder().encode("IDAT");
+        let v = Qe(k);
+        v = Qe(A, v);
+        const b = {
           type: "IDAT",
-          length: m.length,
-          data: m,
-          crc: k
+          length: A.length,
+          data: A,
+          crc: v
         };
-        l.push(v);
+        l.push(b);
+      }
+      if (h === "IEND" && !a && c && c.length > 0) {
+        const E = new TextEncoder().encode("IDAT");
+        let y = Qe(E);
+        y = Qe(c, y), l.push({
+          type: "IDAT",
+          length: c.length,
+          data: c,
+          crc: y
+        });
       }
-      o === "IEND" && !a && l.push({
-        type: "IDAT",
-        length: i,
-        data: h,
-        crc: f
-      }), o !== "IDAT" && o !== "IEND" && l.push({
-        type: o,
-        length: i,
-        data: h,
-        crc: f
-      }), o === "IEND" && l.push({
+      h !== "IDAT" && h !== "IEND" && l.push({
+        type: h,
+        length: r,
+        data: f,
+        crc: p
+      }), h === "IEND" && l.push({
         type: "IEND",
         length: 0,
         data: new Uint8Array(0),
-        crc: f
+        crc: p
       });
     }
   }
-  let _ = d;
-  const I = new TextEncoder();
-  for (const i of l)
-    _ = Ne(_, Ri(i.length)), _ = Ne(_, I.encode(i.type)), i.length > 0 && (_ = Ne(_, i.data)), _ = Ne(_, Ri(i.crc));
-  return _;
+  let T = x;
+  const i = new TextEncoder();
+  for (const r of l)
+    T = me(T, Ri(r.length)), T = me(T, i.encode(r.type)), r.length > 0 && (T = me(T, r.data)), T = me(T, Ri(r.crc));
+  return T;
 }
 class ms {
   constructor(n) {
@@ -4323,7 +4325,7 @@ class ms {
   }
 }
 const ks = 9783072e5, G = 100 * 1e3 * 1e3, As = 32768;
-function Ot(e, n, t) {
+function Dt(e, n, t) {
   return new DataView(e, n, t);
 }
 function ae(e, n = 0) {
@@ -4332,8 +4334,8 @@ function ae(e, n = 0) {
     t <<= 8, t |= e[a] & 255;
   return t;
 }
-function Nt(e, n) {
-  return Ot(e, n, 8).getUint32(4, !1);
+function Ut(e, n) {
+  return Dt(e, n, 8).getUint32(4, !1);
 }
 function Ss(e) {
   const n = e.length;
@@ -4355,32 +4357,33 @@ function Ns(e) {
 }
 function Ci(e) {
   try {
-    return Us(e);
+    const n = Us(e);
+    return n && typeof n == "object" ? n : new Error("Invalid binary plist");
   } catch (n) {
-    return M(n);
+    return B(n);
   }
 }
 function Us(e) {
   const n = new Uint8Array(e), t = n.slice(0, 6);
   if (new TextDecoder("utf8").decode(t) !== "bplist")
     throw new Error("Invalid binary plist. Expected 'bplist' at offset 0.");
-  const s = e.byteLength - 32, l = new DataView(e, s, 32), c = l.getUint8(6), d = l.getUint8(7), x = Nt(e, s + 8), g = Nt(e, s + 16), _ = Nt(e, s + 24);
+  const s = e.byteLength - 32, l = new DataView(e, s, 32), d = l.getUint8(6), c = l.getUint8(7), x = Ut(e, s + 8), g = Ut(e, s + 16), w = Ut(e, s + 24);
   if (x > As)
     throw new Error("maxObjectCount exceeded");
-  const I = [];
+  const T = [];
   for (let r = 0; r < x; r++) {
-    const o = n.slice(_ + r * c, _ + (r + 1) * c);
-    I[r] = ae(o, 0);
+    const o = n.slice(w + r * d, w + (r + 1) * d);
+    T[r] = ae(o, 0);
   }
   function i(r) {
-    const o = I[r], h = n[o], f = (h & 240) >> 4, p = h & 15;
+    const o = T[r], h = n[o], f = (h & 240) >> 4, p = h & 15;
     switch (f) {
       case 0:
-        return w();
+        return _();
       case 1:
-        return b();
-      case 8:
         return E();
+      case 8:
+        return y();
       case 2:
         return m();
       case 3:
@@ -4394,11 +4397,11 @@ function Us(e) {
       case 10:
         return v();
       case 13:
-        return y();
+        return b();
       default:
         throw new Error("Unhandled type 0x" + f.toString(16));
     }
-    function w() {
+    function _() {
       switch (p) {
         case 0:
           return null;
@@ -4412,21 +4415,21 @@ function Us(e) {
           throw new Error("Unhandled simple type 0x" + f.toString(16) + p.toString(16));
       }
     }
-    function b() {
+    function E() {
       const u = Math.pow(2, p);
       if (u < G) {
-        const T = n.slice(o + 1, o + 1 + u);
+        const I = n.slice(o + 1, o + 1 + u);
         if (u === 16) {
-          const S = Ns(T);
+          const S = Ns(I);
           return BigInt("0x" + S);
         }
-        return T.reduce((S, N) => (S <<= 8, S |= N & 255, S), 0);
+        return I.reduce((S, N) => (S <<= 8, S |= N & 255, S), 0);
       }
       throw new Error(
         "Too little heap space available! Wanted to read " + u + " bytes, but only " + G + " are available."
       );
     }
-    function E() {
+    function y() {
       const u = p + 1;
       if (u < G)
         return new ms(ae(n.slice(o + 1, o + 1 + u)));
@@ -4437,11 +4440,11 @@ function Us(e) {
     function m() {
       const u = Math.pow(2, p);
       if (u < G) {
-        const T = Ot(e, o + 1, u);
+        const I = Dt(e, o + 1, u);
         if (u === 4)
-          return T.getFloat32(0, !1);
+          return I.getFloat32(0, !1);
         if (u === 8)
-          return T.getFloat64(0, !1);
+          return I.getFloat64(0, !1);
       } else
         throw new Error(
           "Too little heap space available! Wanted to read " + u + " bytes, but only " + G + " are available."
@@ -4449,23 +4452,23 @@ function Us(e) {
       return 0;
     }
     function A() {
-      const T = Ot(e, o + 1, 8).getFloat64(0, !1);
-      return new Date(ks + 1e3 * T);
+      const I = Dt(e, o + 1, 8).getFloat64(0, !1);
+      return new Date(ks + 1e3 * I);
     }
     function F() {
-      let u = 1, T = p;
+      let u = 1, I = p;
       if (p === 15) {
         const N = n[o + 1] & 15, U = Math.pow(2, N);
-        u = 2 + U, T = ae(n.slice(o + 2, o + 2 + U));
+        u = 2 + U, I = ae(n.slice(o + 2, o + 2 + U));
       }
-      if (T < G)
-        return n.slice(o + u, o + u + T);
+      if (I < G)
+        return n.slice(o + u, o + u + I);
       throw new Error(
-        "Too little heap space available! Wanted to read " + T + " bytes, but only " + G + " are available."
+        "Too little heap space available! Wanted to read " + I + " bytes, but only " + G + " are available."
       );
     }
     function k(u) {
-      let T = "utf8", S = p, N = 1;
+      let I = "utf8", S = p, N = 1;
       if (p === 15) {
         const R = n[o + 1] & 15, O = Math.pow(2, R);
         N = 2 + O, S = ae(n.slice(o + 2, o + 2 + O));
@@ -4474,62 +4477,62 @@ function Us(e) {
         let U = n.slice(o + N, o + N + S);
         if (u) {
           const R = new Uint8Array(U);
-          U = Ss(R), T = "utf-16le";
+          U = Ss(R), I = "utf-16le";
         } else
-          T = "utf8";
-        return new TextDecoder(T).decode(U);
+          I = "utf8";
+        return new TextDecoder(I).decode(U);
       }
       throw new Error(
         "Too little heap space available! Wanted to read " + S + " bytes, but only " + G + " are available."
       );
     }
     function v() {
-      let u = p, T = 1;
+      let u = p, I = 1;
       if (p === 15) {
         const U = n[o + 1] & 15, R = Math.pow(2, U);
-        T = 2 + R, u = ae(n.slice(o + 2, o + 2 + R));
+        I = 2 + R, u = ae(n.slice(o + 2, o + 2 + R));
       }
-      if (u * d > G)
+      if (u * c > G)
         throw new Error("Too little heap space available!");
       const S = [];
       for (let N = 0; N < u; N++) {
         const U = ae(
-          n.slice(o + T + N * d, o + T + (N + 1) * d)
+          n.slice(o + I + N * c, o + I + (N + 1) * c)
         );
         S[N] = i(U);
       }
       return S;
     }
-    function y() {
-      let u = p, T = 1;
+    function b() {
+      let u = p, I = 1;
       if (p === 15) {
         const U = n[o + 1] & 15, R = Math.pow(2, U);
-        T = 2 + R, u = ae(n.slice(o + 2, o + 2 + R));
+        I = 2 + R, u = ae(n.slice(o + 2, o + 2 + R));
       }
-      if (u * 2 * d > G)
+      if (u * 2 * c > G)
         throw new Error("Too little heap space available!");
       const S = {};
       for (let N = 0; N < u; N++) {
         const U = ae(
-          n.slice(o + T + N * d, o + T + (N + 1) * d)
+          n.slice(o + I + N * c, o + I + (N + 1) * c)
         ), R = ae(
           n.slice(
-            o + T + u * d + N * d,
-            o + T + u * d + (N + 1) * d
+            o + I + u * c + N * c,
+            o + I + u * c + (N + 1) * c
           )
-        ), O = i(U), B = i(R);
-        S[String(O)] = B;
+        ), O = i(U), z = i(R);
+        S[String(O)] = z;
       }
       return S;
     }
   }
   return i(g);
 }
-const Ls = Dt.loadAsync;
+const Ls = Bt.loadAsync;
 class Bs {
   zip;
   constructor(n) {
-    this.zip = Ls(n).catch(M);
+    this.zip = Ls(n).catch(B);
   }
   /**
    * 解析应用 plist 信息
@@ -4538,35 +4541,35 @@ class Bs {
     const t = await this.zip;
     if (t instanceof Error)
       return new Error(`load IPA error: ${t.message}`);
-    const a = t.filter((I) => /payload\/[^/]+?.app\/info.plist$/i.test(I))[0];
+    const a = t.filter((T) => /payload\/[^/]+?.app\/info.plist$/i.test(T))[0];
     if (!a)
       return new Error("not found Info.plist file in IPA");
-    const s = await a.async("arraybuffer").catch(M);
+    const s = await a.async("arraybuffer").catch(B);
     if (s instanceof Error)
       return new Error(`read Info.plist file error: ${s.message}`);
     const l = Ci(s);
     if (l instanceof Error)
       return new Error(`parse Info.plist error: ${l.message}`);
-    const c = {
-      package: "CFBundleIdentifier" in l ? st(l.CFBundleIdentifier) : "",
+    const d = {
+      package: "CFBundleIdentifier" in l ? ot(l.CFBundleIdentifier) : "",
       versionCode: "CFBundleVersion" in l ? _r(l.CFBundleVersion) : 0,
-      versionName: "CFBundleShortVersionString" in l ? st(l.CFBundleShortVersionString) : "",
+      versionName: "CFBundleShortVersionString" in l ? ot(l.CFBundleShortVersionString) : "",
       plist: l
     };
     if (n?.ignoreIcon)
-      return c;
-    const d = Rs(l);
-    if (c.iconPath = d, !c.iconPath)
-      return c;
-    const x = t.filter((I) => I.includes(d))[0];
+      return d;
+    const c = Rs(l);
+    if (d.iconPath = c, !d.iconPath)
+      return d;
+    const x = t.filter((T) => T.includes(c))[0];
     if (!x)
-      return c;
-    c.iconPath = x.name;
-    const g = await x.async("uint8array").catch(M);
+      return d;
+    d.iconPath = x.name;
+    const g = await x.async("uint8array").catch(B);
     if (g instanceof Error)
-      return c;
-    const _ = await Fs(g).catch(M);
-    return _ instanceof Error || (c.icon = Bt(wr(_))), c;
+      return d;
+    const w = await Fs(g).catch(B);
+    return w instanceof Error || (d.icon = zt(wr(w))), d;
   }
   // async parseProvision() {
   //   const zip = await this.zip;
@@ -4599,21 +4602,21 @@ class Bs {
     const a = n.replace(/\.framework/i, ""), s = new RegExp(`\\/frameworks\\/${a}\\.framework\\/[^/]+?\\.plist$`, "i"), l = t.file(s)[0];
     if (!l)
       return new Error(`not found ${n} plist file in IPA`);
-    const c = await l.async("arraybuffer").catch(M);
-    return c instanceof Error ? new Error(`read ${n} plist file error: ${c.message}`) : Ci(c);
+    const d = await l.async("arraybuffer").catch(B);
+    return d instanceof Error ? new Error(`read ${n} plist file error: ${d.message}`) : Ci(d);
   }
   /**
    * 读取指定文件的内容
    */
   async readFile(n, t) {
     const a = await this.zip;
-    return a instanceof Error ? new Error(`load file error: ${a.message}`) : await zt(a, n, t);
+    return a instanceof Error ? new Error(`load file error: ${a.message}`) : await Mt(a, n, t);
   }
 }
 function Rs(e) {
-  return je(e, "CFBundleIcons") && je(e.CFBundleIcons, "CFBundlePrimaryIcon") && je(e.CFBundleIcons.CFBundlePrimaryIcon, "CFBundleIconFiles") && Array.isArray(e.CFBundleIcons.CFBundlePrimaryIcon.CFBundleIconFiles) && e.CFBundleIcons.CFBundlePrimaryIcon.CFBundleIconFiles.length ? st(
+  return je(e, "CFBundleIcons") && je(e.CFBundleIcons, "CFBundlePrimaryIcon") && je(e.CFBundleIcons.CFBundlePrimaryIcon, "CFBundleIconFiles") && Array.isArray(e.CFBundleIcons.CFBundlePrimaryIcon.CFBundleIconFiles) && e.CFBundleIcons.CFBundlePrimaryIcon.CFBundleIconFiles.length ? ot(
     e.CFBundleIcons.CFBundlePrimaryIcon.CFBundleIconFiles[e.CFBundleIcons.CFBundlePrimaryIcon.CFBundleIconFiles.length - 1]
-  ) : je(e, "CFBundleIconFiles") && Array.isArray(e.CFBundleIconFiles) && e.CFBundleIconFiles.length ? st(e.CFBundleIconFiles[e.CFBundleIconFiles.length - 1]) : "";
+  ) : je(e, "CFBundleIconFiles") && Array.isArray(e.CFBundleIconFiles) && e.CFBundleIconFiles.length ? ot(e.CFBundleIconFiles[e.CFBundleIconFiles.length - 1]) : "";
 }
 export {
   Ds as AndroidAppParser,