js-dev-tool 1.0.0

package/lib/unzip.min.js

@@ -0,0 +1,812 @@
+/*! @license zlib.js 2012 - imaya [ https://github.com/imaya/zlib.js ] The MIT License */ /*! (C) 2022 jeffy-g https://github.com/jeffy-g Released under the MIT license https://opensource.org/licenses/mit-license.php */ (function () {
+  var m,
+    aa = this;
+  Math.floor(2147483648 * Math.random()).toString(36);
+  function n(a, b) {
+    a = a.split(".");
+    var g = aa;
+    a[0] in g || !g.execScript || g.execScript("var " + a[0]);
+    for (var d; a.length && (d = a.shift()); )
+      a.length || void 0 === b
+        ? g[d]
+          ? (g = g[d])
+          : (g = g[d] = {})
+        : (g[d] = b);
+  }
+  var p =
+    "undefined" !== typeof Uint8Array &&
+    "undefined" !== typeof Uint16Array &&
+    "undefined" !== typeof Uint32Array &&
+    "undefined" !== typeof DataView;
+  var ba = new (p ? Uint8Array : Array)(256),
+    q;
+  for (q = 0; 256 > q; ++q) {
+    var r = q,
+      t = r,
+      ca = 7;
+    for (r >>>= 1; r; r >>>= 1) (t <<= 1), (t |= r & 1), --ca;
+    ba[q] = ((t << ca) & 255) >>> 0;
+  }
+  function da(a, b) {
+    return (u[(a ^ b) & 255] ^ (a >>> 8)) >>> 0;
+  }
+  var ea = [
+      0, 1996959894, 3993919788, 2567524794, 124634137, 1886057615, 3915621685,
+      2657392035, 249268274, 2044508324, 3772115230, 2547177864, 162941995,
+      2125561021, 3887607047, 2428444049, 498536548, 1789927666, 4089016648,
+      2227061214, 450548861, 1843258603, 4107580753, 2211677639, 325883990,
+      1684777152, 4251122042, 2321926636, 335633487, 1661365465, 4195302755,
+      2366115317, 997073096, 1281953886, 3579855332, 2724688242, 1006888145,
+      1258607687, 3524101629, 2768942443, 901097722, 1119000684, 3686517206,
+      2898065728, 853044451, 1172266101, 3705015759, 2882616665, 651767980,
+      1373503546, 3369554304, 3218104598, 565507253, 1454621731, 3485111705,
+      3099436303, 671266974, 1594198024, 3322730930, 2970347812, 795835527,
+      1483230225, 3244367275, 3060149565, 1994146192, 31158534, 2563907772,
+      4023717930, 1907459465, 112637215, 2680153253, 3904427059, 2013776290,
+      251722036, 2517215374, 3775830040, 2137656763, 141376813, 2439277719,
+      3865271297, 1802195444, 476864866, 2238001368, 4066508878, 1812370925,
+      453092731, 2181625025, 4111451223, 1706088902, 314042704, 2344532202,
+      4240017532, 1658658271, 366619977, 2362670323, 4224994405, 1303535960,
+      984961486, 2747007092, 3569037538, 1256170817, 1037604311, 2765210733,
+      3554079995, 1131014506, 879679996, 2909243462, 3663771856, 1141124467,
+      855842277, 2852801631, 3708648649, 1342533948, 654459306, 3188396048,
+      3373015174, 1466479909, 544179635, 3110523913, 3462522015, 1591671054,
+      702138776, 2966460450, 3352799412, 1504918807, 783551873, 3082640443,
+      3233442989, 3988292384, 2596254646, 62317068, 1957810842, 3939845945,
+      2647816111, 81470997, 1943803523, 3814918930, 2489596804, 225274430,
+      2053790376, 3826175755, 2466906013, 167816743, 2097651377, 4027552580,
+      2265490386, 503444072, 1762050814, 4150417245, 2154129355, 426522225,
+      1852507879, 4275313526, 2312317920, 282753626, 1742555852, 4189708143,
+      2394877945, 397917763, 1622183637, 3604390888, 2714866558, 953729732,
+      1340076626, 3518719985, 2797360999, 1068828381, 1219638859, 3624741850,
+      2936675148, 906185462, 1090812512, 3747672003, 2825379669, 829329135,
+      1181335161, 3412177804, 3160834842, 628085408, 1382605366, 3423369109,
+      3138078467, 570562233, 1426400815, 3317316542, 2998733608, 733239954,
+      1555261956, 3268935591, 3050360625, 752459403, 1541320221, 2607071920,
+      3965973030, 1969922972, 40735498, 2617837225, 3943577151, 1913087877,
+      83908371, 2512341634, 3803740692, 2075208622, 213261112, 2463272603,
+      3855990285, 2094854071, 198958881, 2262029012, 4057260610, 1759359992,
+      534414190, 2176718541, 4139329115, 1873836001, 414664567, 2282248934,
+      4279200368, 1711684554, 285281116, 2405801727, 4167216745, 1634467795,
+      376229701, 2685067896, 3608007406, 1308918612, 956543938, 2808555105,
+      3495958263, 1231636301, 1047427035, 2932959818, 3654703836, 1088359270,
+      936918e3, 2847714899, 3736837829, 1202900863, 817233897, 3183342108,
+      3401237130, 1404277552, 615818150, 3134207493, 3453421203, 1423857449,
+      601450431, 3009837614, 3294710456, 1567103746, 711928724, 3020668471,
+      3272380065, 1510334235, 755167117,
+    ],
+    u = p ? new Uint32Array(ea) : ea;
+  var v = [],
+    w;
+  for (w = 0; 288 > w; w++)
+    switch (!0) {
+      case 143 >= w:
+        v.push([w + 48, 8]);
+        break;
+      case 255 >= w:
+        v.push([w - 144 + 400, 9]);
+        break;
+      case 279 >= w:
+        v.push([w - 256, 7]);
+        break;
+      case 287 >= w:
+        v.push([w - 280 + 192, 8]);
+        break;
+      default:
+        throw "invalid literal: " + w;
+    }
+  var fa = (function () {
+    function a(e) {
+      switch (!0) {
+        case 3 === e:
+          return [257, e - 3, 0];
+        case 4 === e:
+          return [258, e - 4, 0];
+        case 5 === e:
+          return [259, e - 5, 0];
+        case 6 === e:
+          return [260, e - 6, 0];
+        case 7 === e:
+          return [261, e - 7, 0];
+        case 8 === e:
+          return [262, e - 8, 0];
+        case 9 === e:
+          return [263, e - 9, 0];
+        case 10 === e:
+          return [264, e - 10, 0];
+        case 12 >= e:
+          return [265, e - 11, 1];
+        case 14 >= e:
+          return [266, e - 13, 1];
+        case 16 >= e:
+          return [267, e - 15, 1];
+        case 18 >= e:
+          return [268, e - 17, 1];
+        case 22 >= e:
+          return [269, e - 19, 2];
+        case 26 >= e:
+          return [270, e - 23, 2];
+        case 30 >= e:
+          return [271, e - 27, 2];
+        case 34 >= e:
+          return [272, e - 31, 2];
+        case 42 >= e:
+          return [273, e - 35, 3];
+        case 50 >= e:
+          return [274, e - 43, 3];
+        case 58 >= e:
+          return [275, e - 51, 3];
+        case 66 >= e:
+          return [276, e - 59, 3];
+        case 82 >= e:
+          return [277, e - 67, 4];
+        case 98 >= e:
+          return [278, e - 83, 4];
+        case 114 >= e:
+          return [279, e - 99, 4];
+        case 130 >= e:
+          return [280, e - 115, 4];
+        case 162 >= e:
+          return [281, e - 131, 5];
+        case 194 >= e:
+          return [282, e - 163, 5];
+        case 226 >= e:
+          return [283, e - 195, 5];
+        case 257 >= e:
+          return [284, e - 227, 5];
+        case 258 === e:
+          return [285, e - 258, 0];
+        default:
+          throw "invalid length: " + e;
+      }
+    }
+    var b = [],
+      g;
+    for (g = 3; 258 >= g; g++) {
+      var d = a(g);
+      b[g] = (d[2] << 24) | (d[1] << 16) | d[0];
+    }
+    return b;
+  })();
+  p && new Uint32Array(fa);
+  if (void 0 !== aa.Uint8Array)
+    try {
+      eval("String.fromCharCode.apply(null, new Uint8Array([0]));");
+    } catch (a) {
+      String.fromCharCode.apply = (function (b) {
+        return function (g, d) {
+          return b.call(String.fromCharCode, g, Array.prototype.slice.call(d));
+        };
+      })(String.fromCharCode.apply);
+    }
+  function x(a) {
+    var b = a.length,
+      g = 0,
+      d = Number.POSITIVE_INFINITY,
+      e,
+      f,
+      c;
+    for (f = 0; f < b; ++f) a[f] > g && (g = a[f]), a[f] < d && (d = a[f]);
+    var h = 1 << g;
+    var k = new (p ? Uint32Array : Array)(h);
+    var l = 1;
+    var z = 0;
+    for (e = 2; l <= g; ) {
+      for (f = 0; f < b; ++f)
+        if (a[f] === l) {
+          var S = 0;
+          var K = z;
+          for (c = 0; c < l; ++c) (S = (S << 1) | (K & 1)), (K >>= 1);
+          K = (l << 16) | f;
+          for (c = S; c < h; c += e) k[c] = K;
+          ++z;
+        }
+      ++l;
+      z <<= 1;
+      e <<= 1;
+    }
+    return [k, g, d];
+  }
+  function ha(a, b) {
+    this.A = [];
+    this.u = 32768;
+    this.j = this.o = this.i = this.v = 0;
+    this.m = p ? new Uint8Array(a) : a;
+    this.C = !1;
+    this.l = y;
+    this.B = !1;
+    if (b || !(b = {}))
+      b.index && (this.i = b.index),
+        b.bufferSize && (this.u = b.bufferSize),
+        b.bufferType && (this.l = b.bufferType),
+        b.resize && (this.B = b.resize);
+    switch (this.l) {
+      case A:
+        this.g = 32768;
+        this.h = new (p ? Uint8Array : Array)(this.u + 33026);
+        break;
+      case y:
+        this.g = 0;
+        this.h = new (p ? Uint8Array : Array)(this.u);
+        break;
+      default:
+        throw Error("invalid inflate mode");
+    }
+  }
+  var A = 0,
+    y = 1,
+    B,
+    ia = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+  B = p ? new Uint16Array(ia) : ia;
+  var C,
+    ja = [
+      3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59,
+      67, 83, 99, 115, 131, 163, 195, 227, 258, 258, 258,
+    ];
+  C = p ? new Uint16Array(ja) : ja;
+  var D,
+    ka = [
+      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, 0, 0,
+    ];
+  D = p ? new Uint8Array(ka) : ka;
+  var E,
+    la = [
+      1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513,
+      769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577,
+    ];
+  E = p ? new Uint16Array(la) : la;
+  var F,
+    ma = [
+      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,
+    ];
+  F = p ? new Uint8Array(ma) : ma;
+  var G,
+    H = new (p ? Uint8Array : Array)(288),
+    I,
+    na;
+  I = 0;
+  for (na = H.length; I < na; ++I)
+    H[I] = 143 >= I ? 8 : 255 >= I ? 9 : 279 >= I ? 7 : 8;
+  G = x(H);
+  var J,
+    L = new (p ? Uint8Array : Array)(30),
+    M,
+    oa;
+  M = 0;
+  for (oa = L.length; M < oa; ++M) L[M] = 5;
+  J = x(L);
+  function N(a, b) {
+    var g = a.o,
+      d = a.j,
+      e = a.m,
+      f = a.i;
+    if (f + ((b - d + 7) >> 3) >= e.length)
+      throw Error("input buffer is broken");
+    for (; d < b; ) (g |= e[f++] << d), (d += 8);
+    a.o = g >>> b;
+    a.j = d - b;
+    a.i = f;
+    return g & ((1 << b) - 1);
+  }
+  function O(a, b) {
+    var g = a.o,
+      d = a.j,
+      e = a.m,
+      f = a.i,
+      c = e.length,
+      h = b[0];
+    for (b = b[1]; d < b && !(f >= c); ) (g |= e[f++] << d), (d += 8);
+    e = h[g & ((1 << b) - 1)];
+    c = e >>> 16;
+    if (c > d) throw Error("invalid code length: " + c);
+    a.o = g >> c;
+    a.j = d - c;
+    a.i = f;
+    return e & 65535;
+  }
+  function pa(a, b, g) {
+    var d = a.h,
+      e = a.g;
+    a.D = b;
+    for (var f = d.length - 258, c, h, k; 256 !== (c = O(a, b)); )
+      if (256 > c) e >= f && ((a.g = e), (d = P(a)), (e = a.g)), (d[e++] = c);
+      else
+        for (
+          c -= 257,
+            k = C[c],
+            0 < D[c] && (k += N(a, D[c])),
+            c = O(a, g),
+            h = E[c],
+            0 < F[c] && (h += N(a, F[c])),
+            e >= f && ((a.g = e), (d = P(a)), (e = a.g));
+          k--;
+
+        )
+          d[e] = d[e++ - h];
+    for (; 8 <= a.j; ) (a.j -= 8), a.i--;
+    a.g = e;
+  }
+  function qa(a, b, g) {
+    var d = a.h,
+      e = a.g;
+    a.D = b;
+    for (var f = d.length, c, h, k; 256 !== (c = O(a, b)); )
+      if (256 > c) e >= f && ((d = ra(a)), (f = d.length)), (d[e++] = c);
+      else
+        for (
+          c -= 257,
+            k = C[c],
+            0 < D[c] && (k += N(a, D[c])),
+            c = O(a, g),
+            h = E[c],
+            0 < F[c] && (h += N(a, F[c])),
+            e + k > f && ((d = ra(a)), (f = d.length));
+          k--;
+
+        )
+          d[e] = d[e++ - h];
+    for (; 8 <= a.j; ) (a.j -= 8), a.i--;
+    a.g = e;
+  }
+  function P(a) {
+    var b = new (p ? Uint8Array : Array)(a.g - 32768),
+      g = a.g - 32768,
+      d,
+      e = a.h;
+    if (p) b.set(e.subarray(32768, b.length));
+    else {
+      var f = 0;
+      for (d = b.length; f < d; ++f) b[f] = e[f + 32768];
+    }
+    a.A.push(b);
+    a.v += b.length;
+    if (p) e.set(e.subarray(g, g + 32768));
+    else for (f = 0; 32768 > f; ++f) e[f] = e[g + f];
+    a.g = 32768;
+    return e;
+  }
+  function ra(a, b) {
+    var g = (a.m.length / a.i + 1) | 0,
+      d = a.m,
+      e = a.h;
+    b &&
+      ("number" === typeof b.F && (g = b.F),
+      "number" === typeof b.M && (g += b.M));
+    2 > g
+      ? ((b = (d.length - a.i) / a.D[2]),
+        (b = ((b / 2) * 258) | 0),
+        (b = b < e.length ? e.length + b : e.length << 1))
+      : (b = e.length * g);
+    p ? ((b = new Uint8Array(b)), b.set(e)) : (b = e);
+    a.h = b;
+    return a.h;
+  }
+  var sa = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+  p && new Uint16Array(sa);
+  var ta = [
+    3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67,
+    83, 99, 115, 131, 163, 195, 227, 258, 258, 258,
+  ];
+  p && new Uint16Array(ta);
+  var ua = [
+    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, 0, 0,
+  ];
+  p && new Uint8Array(ua);
+  var va = [
+    1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513,
+    769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577,
+  ];
+  p && new Uint16Array(va);
+  var wa = [
+    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,
+  ];
+  p && new Uint8Array(wa);
+  var xa = new (p ? Uint8Array : Array)(288),
+    Q,
+    ya;
+  Q = 0;
+  for (ya = xa.length; Q < ya; ++Q)
+    xa[Q] = 143 >= Q ? 8 : 255 >= Q ? 9 : 279 >= Q ? 7 : 8;
+  x(xa);
+  var za = new (p ? Uint8Array : Array)(30),
+    R,
+    Aa;
+  R = 0;
+  for (Aa = za.length; R < Aa; ++R) za[R] = 5;
+  x(za);
+  function T() {}
+  var U = [80, 75, 1, 2],
+    V = [80, 75, 3, 4],
+    W = [80, 75, 5, 6];
+  T.prototype.h = function (a) {
+    a = (a[2] & 65535) | 2;
+    return ((a * (a ^ 1)) >> 8) & 255;
+  };
+  T.prototype.g = function (a, b) {
+    a[0] = da(a[0], b);
+    a[1] = (((6681 * ((20173 * (a[1] + (a[0] & 255))) >>> 0)) >>> 0) + 1) >>> 0;
+    a[2] = da(a[2], a[1] >>> 24);
+  };
+  T.prototype.i = function (a) {
+    var b = [305419896, 591751049, 878082192],
+      g;
+    p && (b = new Uint32Array(b));
+    var d = 0;
+    for (g = a.length; d < g; ++d) this.g(b, a[d] & 255);
+    return b;
+  };
+  function X(a, b) {
+    b = b || {};
+    this.g = p && a instanceof Array ? new Uint8Array(a) : a;
+    this.s = b.verify || !1;
+    this.i = b.password;
+  }
+  function Y(a, b) {
+    this.l = a;
+    this.h = b;
+  }
+  Y.prototype.s = function () {
+    return this.g;
+  };
+  Y.prototype.m = function () {
+    var a = this.g;
+    return a ? String.fromCharCode.apply(null, a) : "";
+  };
+  function Ba(a, b) {
+    this.s = a;
+    this.h = b;
+  }
+  m = X.prototype;
+  m.J = function () {
+    var a = this.o;
+    return a ? String.fromCharCode.apply(null, a) : "";
+  };
+  function Z(a) {
+    var b = [],
+      g = {},
+      d,
+      e;
+    if (!a.h) {
+      if (void 0 === a.j) {
+        var f = a.g;
+        if (!a.l)
+          a: {
+            var c = a.g;
+            for (d = c.length - 12; 0 < d; --d)
+              if (
+                c[d] === W[0] &&
+                c[d + 1] === W[1] &&
+                c[d + 2] === W[2] &&
+                c[d + 3] === W[3]
+              ) {
+                a.l = d;
+                break a;
+              }
+            throw Error("End of Central Directory Record not found");
+          }
+        c = a.l;
+        if (
+          f[c] !== W[0] ||
+          f[c + 1] !== W[1] ||
+          f[c + 2] !== W[2] ||
+          f[c + 3] !== W[3]
+        )
+          throw Error("invalid signature");
+        c += 9;
+        a.v = f[c + 1] | (f[c + 2] << 8);
+        a.u =
+          (f[c + 3] | (f[c + 4] << 8) | (f[c + 5] << 16) | (f[c + 6] << 24)) >>>
+          0;
+        a.j =
+          (f[c + 7] |
+            (f[c + 8] << 8) |
+            (f[c + 9] << 16) |
+            (f[c + 10] << 24)) >>>
+          0;
+        a.A = f[c + 11] | (f[(c += 12)] << 8);
+        a.o = f.slice(++c, c + a.A);
+      }
+      f = a.j;
+      d = 0;
+      for (e = a.v; d < e; ++d) {
+        var h = (c = new Y(a.g, f)),
+          k = h.l,
+          l = h.h;
+        if (
+          k[l] !== U[0] ||
+          k[l + 1] !== U[1] ||
+          k[l + 2] !== U[2] ||
+          k[l + 3] !== U[3]
+        )
+          throw Error("invalid file header signature");
+        h.version = k[(l += 4)];
+        h.time = k[(l += 8)] | (k[l + 1] << 8);
+        l += 2;
+        ++l;
+        h.j = k[(l += 13)] | (k[l + 1] << 8);
+        h.i = k[l + 2] | (k[l + 3] << 8);
+        h.o = k[l + 4] | (k[(l += 5)] << 8);
+        l += 8;
+        l++;
+        h.u = (k[l++] | (k[l++] << 8) | (k[l++] << 16) | (k[l++] << 24)) >>> 0;
+        h.filename = String.fromCharCode.apply(null, k.slice(l, (l += h.j)));
+        l += h.i;
+        h.g = k.slice(l, l + h.o);
+        h.length = l - h.h;
+        f += c.length;
+        b[d] = c;
+        g[c.filename] = d;
+      }
+      if (a.u < f - a.j) throw Error("invalid file header size");
+      a.h = b;
+      a.m = g;
+    }
+  }
+  m.O = function (a) {
+    var b = this.h;
+    b || (Z(this), (b = this.h));
+    return b[a];
+  };
+  m.G = function (a, b) {
+    b = b || {};
+    var g = this.g,
+      d = this.h,
+      e;
+    d || (Z(this), (d = this.h));
+    if (void 0 === d[a]) throw Error("wrong index");
+    d = d[a].u;
+    a = new Ba(this.g, d);
+    var f = a.s;
+    var c = a.h;
+    if (
+      f[c++] !== V[0] ||
+      f[c++] !== V[1] ||
+      f[c++] !== V[2] ||
+      f[c++] !== V[3]
+    )
+      throw Error("invalid local file header signature");
+    c++;
+    c++;
+    a.o = f[c++] | (f[c++] << 8);
+    a.j = f[c++] | (f[c++] << 8);
+    a.time = f[c++] | (f[c++] << 8);
+    c++;
+    c++;
+    a.g = (f[c++] | (f[c++] << 8) | (f[c++] << 16) | (f[c++] << 24)) >>> 0;
+    a.i = (f[c++] | (f[c++] << 8) | (f[c++] << 16) | (f[c++] << 24)) >>> 0;
+    a.u = (f[c++] | (f[c++] << 8) | (f[c++] << 16) | (f[c++] << 24)) >>> 0;
+    a.m = f[c++] | (f[c++] << 8);
+    a.l = f[c++] | (f[c++] << 8);
+    a.filename = String.fromCharCode.apply(null, f.slice(c, (c += a.m)));
+    c += a.l;
+    a.length = c - a.h;
+    d += a.length;
+    f = a.i;
+    if (0 !== (a.o & 1)) {
+      if (!b.password && !this.i) throw Error("please set password");
+      b = this.N(b.password || this.i);
+      c = d;
+      for (e = d + 12; c < e; ++c) Ca(this, b, g[c]);
+      d += 12;
+      f -= 12;
+      c = d;
+      for (e = d + f; c < e; ++c) g[c] = Ca(this, b, g[c]);
+    }
+    switch (a.j) {
+      case 0:
+        g = p ? this.g.subarray(d, d + f) : this.g.slice(d, d + f);
+        break;
+      case 8:
+        a: {
+          for (g = new ha(this.g, { index: d, bufferSize: a.u }); !g.C; )
+            switch (
+              ((b = void 0),
+              (d = g),
+              (f = N(d, 3)),
+              f & 1 && (d.C = !0),
+              (f >>>= 1),
+              f)
+            ) {
+              case 0:
+                f = d.m;
+                c = d.i;
+                e = d.h;
+                var h = d.g;
+                var k = f.length;
+                var l = e.length;
+                d.o = 0;
+                d.j = 0;
+                if (c + 1 >= k)
+                  throw Error("invalid uncompressed block header: LEN");
+                b = f[c++] | (f[c++] << 8);
+                if (c + 1 >= k)
+                  throw Error("invalid uncompressed block header: NLEN");
+                k = f[c++] | (f[c++] << 8);
+                if (b === ~k)
+                  throw Error(
+                    "invalid uncompressed block header: length verify",
+                  );
+                if (c + b > f.length) throw Error("input buffer is broken");
+                switch (d.l) {
+                  case A:
+                    for (; h + b > e.length; ) {
+                      k = l - h;
+                      b -= k;
+                      if (p) e.set(f.subarray(c, c + k), h), (h += k), (c += k);
+                      else for (; k--; ) e[h++] = f[c++];
+                      d.g = h;
+                      e = P(d);
+                      h = d.g;
+                    }
+                    break;
+                  case y:
+                    for (; h + b > e.length; ) e = ra(d, { F: 2 });
+                    break;
+                  default:
+                    throw Error("invalid inflate mode");
+                }
+                if (p) e.set(f.subarray(c, c + b), h), (h += b), (c += b);
+                else for (; b--; ) e[h++] = f[c++];
+                d.i = c;
+                d.g = h;
+                d.h = e;
+                break;
+              case 1:
+                switch (d.l) {
+                  case y:
+                    qa(d, G, J);
+                    break;
+                  case A:
+                    pa(d, G, J);
+                    break;
+                  default:
+                    throw Error("invalid inflate mode");
+                }
+                break;
+              case 2:
+                f = N(d, 5) + 257;
+                l = N(d, 5) + 1;
+                e = N(d, 4) + 4;
+                h = new (p ? Uint8Array : Array)(B.length);
+                for (c = 0; c < e; ++c) h[B[c]] = N(d, 3);
+                if (!p) for (c = e, e = h.length; c < e; ++c) h[B[c]] = 0;
+                h = x(h);
+                e = new (p ? Uint8Array : Array)(f + l);
+                c = 0;
+                for (l = f + l; c < l; )
+                  switch (((k = O(d, h)), k)) {
+                    case 16:
+                      for (k = 3 + N(d, 2); k--; ) e[c++] = b;
+                      break;
+                    case 17:
+                      for (k = 3 + N(d, 3); k--; ) e[c++] = 0;
+                      b = 0;
+                      break;
+                    case 18:
+                      for (k = 11 + N(d, 7); k--; ) e[c++] = 0;
+                      b = 0;
+                      break;
+                    default:
+                      b = e[c++] = k;
+                  }
+                b = p ? x(e.subarray(0, f)) : x(e.slice(0, f));
+                f = p ? x(e.subarray(f)) : x(e.slice(f));
+                switch (d.l) {
+                  case y:
+                    qa(d, b, f);
+                    break;
+                  case A:
+                    pa(d, b, f);
+                    break;
+                  default:
+                    throw Error("invalid inflate mode");
+                }
+                break;
+              default:
+                throw Error("unknown BTYPE: " + f);
+            }
+          switch (g.l) {
+            case A:
+              d = 0;
+              b = g.h;
+              f = g.A;
+              e = new (p ? Uint8Array : Array)(g.v + (g.g - 32768));
+              var z;
+              if (0 === f.length)
+                g = p ? g.h.subarray(32768, g.g) : g.h.slice(32768, g.g);
+              else {
+                h = 0;
+                for (l = f.length; h < l; ++h)
+                  for (c = f[h], k = 0, z = c.length; k < z; ++k) e[d++] = c[k];
+                h = 32768;
+                for (l = g.g; h < l; ++h) e[d++] = b[h];
+                g.A = [];
+                g.s = e;
+                g = g.s;
+              }
+              break a;
+            case y:
+              b = g.g;
+              p
+                ? g.B
+                  ? ((d = new Uint8Array(b)), d.set(g.h.subarray(0, b)))
+                  : (d = g.h.subarray(0, b))
+                : (g.h.length > b && (g.h.length = b), (d = g.h));
+              g.s = d;
+              g = g.s;
+              break a;
+            default:
+              throw Error("invalid inflate mode");
+          }
+        }
+        break;
+      default:
+        throw Error("unknown compression type");
+    }
+    if (this.s) {
+      d = void 0;
+      "number" === typeof d || (d = 0);
+      c = g.length;
+      b = -1;
+      for (f = c & 7; f--; ++d) b = (b >>> 8) ^ u[(b ^ g[d]) & 255];
+      for (f = c >> 3; f--; d += 8)
+        (b = (b >>> 8) ^ u[(b ^ g[d]) & 255]),
+          (b = (b >>> 8) ^ u[(b ^ g[d + 1]) & 255]),
+          (b = (b >>> 8) ^ u[(b ^ g[d + 2]) & 255]),
+          (b = (b >>> 8) ^ u[(b ^ g[d + 3]) & 255]),
+          (b = (b >>> 8) ^ u[(b ^ g[d + 4]) & 255]),
+          (b = (b >>> 8) ^ u[(b ^ g[d + 5]) & 255]),
+          (b = (b >>> 8) ^ u[(b ^ g[d + 6]) & 255]),
+          (b = (b >>> 8) ^ u[(b ^ g[d + 7]) & 255]);
+      d = (b ^ 4294967295) >>> 0;
+      if (a.g !== d)
+        throw Error(
+          "wrong crc: file=0x" +
+            a.g.toString(16) +
+            ", data=0x" +
+            d.toString(16),
+        );
+    }
+    return g;
+  };
+  m.P = function () {
+    var a = [],
+      b;
+    this.h || Z(this);
+    var g = this.h;
+    var d = 0;
+    for (b = g.length; d < b; ++d) a[d] = g[d].filename;
+    return a;
+  };
+  m.H = function (a, b) {
+    this.m || Z(this);
+    var g = this.m[a];
+    if (void 0 === g) throw Error(a + " not found");
+    return this.G(g, b);
+  };
+  m.K = function (a) {
+    this.i = a;
+  };
+  function Ca(a, b, g) {
+    g ^= a.I(b);
+    a.L(b, g);
+    return g;
+  }
+  m.L = T.prototype.g;
+  m.N = T.prototype.i;
+  m.I = T.prototype.h;
+  n("Zlib.Unzip", X);
+  n("Zlib.Unzip.FileHeader", Y);
+  n("Zlib.Unzip.prototype.decompress", X.prototype.H);
+  n("Zlib.Unzip.prototype.getFilenames", X.prototype.P);
+  n("Zlib.Unzip.prototype.getFileData", X.prototype.G);
+  n("Zlib.Unzip.prototype.getFileHeader", X.prototype.O);
+  n("Zlib.Unzip.prototype.setPassword", X.prototype.K);
+  n("Zlib.Unzip.prototype.getCommentAsString", X.prototype.J);
+  n("Zlib.Unzip.FileHeader.prototype.getComment", Y.prototype.s);
+  n("Zlib.Unzip.FileHeader.prototype.getCommentAsString", Y.prototype.m);
+}).call(this);