vue-book-reader 1.2.2 → 1.2.4

package/lib/zip-BtClDCuW.cjs

@@ -1,1513 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const e$1 = -2, t$1 = -3, n$1 = -5, i$1 = [0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535], r$1 = [96, 7, 256, 0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0, 8, 48, 0, 9, 192, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 160, 0, 8, 0, 0, 8, 128, 0, 8, 64, 0, 9, 224, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9, 144, 83, 7, 59, 0, 8, 120, 0, 8, 56, 0, 9, 208, 81, 7, 17, 0, 8, 104, 0, 8, 40, 0, 9, 176, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 240, 80, 7, 4, 0, 8, 84, 0, 8, 20, 85, 8, 227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0, 9, 200, 81, 7, 13, 0, 8, 100, 0, 8, 36, 0, 9, 168, 0, 8, 4, 0, 8, 132, 0, 8, 68, 0, 9, 232, 80, 7, 8, 0, 8, 92, 0, 8, 28, 0, 9, 152, 84, 7, 83, 0, 8, 124, 0, 8, 60, 0, 9, 216, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0, 9, 184, 0, 8, 12, 0, 8, 140, 0, 8, 76, 0, 9, 248, 80, 7, 3, 0, 8, 82, 0, 8, 18, 85, 8, 163, 83, 7, 35, 0, 8, 114, 0, 8, 50, 0, 9, 196, 81, 7, 11, 0, 8, 98, 0, 8, 34, 0, 9, 164, 0, 8, 2, 0, 8, 130, 0, 8, 66, 0, 9, 228, 80, 7, 7, 0, 8, 90, 0, 8, 26, 0, 9, 148, 84, 7, 67, 0, 8, 122, 0, 8, 58, 0, 9, 212, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9, 180, 0, 8, 10, 0, 8, 138, 0, 8, 74, 0, 9, 244, 80, 7, 5, 0, 8, 86, 0, 8, 22, 192, 8, 0, 83, 7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 204, 81, 7, 15, 0, 8, 102, 0, 8, 38, 0, 9, 172, 0, 8, 6, 0, 8, 134, 0, 8, 70, 0, 9, 236, 80, 7, 9, 0, 8, 94, 0, 8, 30, 0, 9, 156, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0, 9, 220, 82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 188, 0, 8, 14, 0, 8, 142, 0, 8, 78, 0, 9, 252, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131, 82, 7, 31, 0, 8, 113, 0, 8, 49, 0, 9, 194, 80, 7, 10, 0, 8, 97, 0, 8, 33, 0, 9, 162, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 226, 80, 7, 6, 0, 8, 89, 0, 8, 25, 0, 9, 146, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 210, 81, 7, 17, 0, 8, 105, 0, 8, 41, 0, 9, 178, 0, 8, 9, 0, 8, 137, 0, 8, 73, 0, 9, 242, 80, 7, 4, 0, 8, 85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0, 8, 117, 0, 8, 53, 0, 9, 202, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9, 170, 0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9, 234, 80, 7, 8, 0, 8, 93, 0, 8, 29, 0, 9, 154, 84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 218, 82, 7, 23, 0, 8, 109, 0, 8, 45, 0, 9, 186, 0, 8, 13, 0, 8, 141, 0, 8, 77, 0, 9, 250, 80, 7, 3, 0, 8, 83, 0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8, 115, 0, 8, 51, 0, 9, 198, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9, 166, 0, 8, 3, 0, 8, 131, 0, 8, 67, 0, 9, 230, 80, 7, 7, 0, 8, 91, 0, 8, 27, 0, 9, 150, 84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 214, 82, 7, 19, 0, 8, 107, 0, 8, 43, 0, 9, 182, 0, 8, 11, 0, 8, 139, 0, 8, 75, 0, 9, 246, 80, 7, 5, 0, 8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8, 55, 0, 9, 206, 81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 174, 0, 8, 7, 0, 8, 135, 0, 8, 71, 0, 9, 238, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 158, 84, 7, 99, 0, 8, 127, 0, 8, 63, 0, 9, 222, 82, 7, 27, 0, 8, 111, 0, 8, 47, 0, 9, 190, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 254, 96, 7, 256, 0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0, 8, 48, 0, 9, 193, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 161, 0, 8, 0, 0, 8, 128, 0, 8, 64, 0, 9, 225, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9, 145, 83, 7, 59, 0, 8, 120, 0, 8, 56, 0, 9, 209, 81, 7, 17, 0, 8, 104, 0, 8, 40, 0, 9, 177, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 241, 80, 7, 4, 0, 8, 84, 0, 8, 20, 85, 8, 227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0, 9, 201, 81, 7, 13, 0, 8, 100, 0, 8, 36, 0, 9, 169, 0, 8, 4, 0, 8, 132, 0, 8, 68, 0, 9, 233, 80, 7, 8, 0, 8, 92, 0, 8, 28, 0, 9, 153, 84, 7, 83, 0, 8, 124, 0, 8, 60, 0, 9, 217, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0, 9, 185, 0, 8, 12, 0, 8, 140, 0, 8, 76, 0, 9, 249, 80, 7, 3, 0, 8, 82, 0, 8, 18, 85, 8, 163, 83, 7, 35, 0, 8, 114, 0, 8, 50, 0, 9, 197, 81, 7, 11, 0, 8, 98, 0, 8, 34, 0, 9, 165, 0, 8, 2, 0, 8, 130, 0, 8, 66, 0, 9, 229, 80, 7, 7, 0, 8, 90, 0, 8, 26, 0, 9, 149, 84, 7, 67, 0, 8, 122, 0, 8, 58, 0, 9, 213, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9, 181, 0, 8, 10, 0, 8, 138, 0, 8, 74, 0, 9, 245, 80, 7, 5, 0, 8, 86, 0, 8, 22, 192, 8, 0, 83, 7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 205, 81, 7, 15, 0, 8, 102, 0, 8, 38, 0, 9, 173, 0, 8, 6, 0, 8, 134, 0, 8, 70, 0, 9, 237, 80, 7, 9, 0, 8, 94, 0, 8, 30, 0, 9, 157, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0, 9, 221, 82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 189, 0, 8, 14, 0, 8, 142, 0, 8, 78, 0, 9, 253, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131, 82, 7, 31, 0, 8, 113, 0, 8, 49, 0, 9, 195, 80, 7, 10, 0, 8, 97, 0, 8, 33, 0, 9, 163, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 227, 80, 7, 6, 0, 8, 89, 0, 8, 25, 0, 9, 147, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 211, 81, 7, 17, 0, 8, 105, 0, 8, 41, 0, 9, 179, 0, 8, 9, 0, 8, 137, 0, 8, 73, 0, 9, 243, 80, 7, 4, 0, 8, 85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0, 8, 117, 0, 8, 53, 0, 9, 203, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9, 171, 0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9, 235, 80, 7, 8, 0, 8, 93, 0, 8, 29, 0, 9, 155, 84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 219, 82, 7, 23, 0, 8, 109, 0, 8, 45, 0, 9, 187, 0, 8, 13, 0, 8, 141, 0, 8, 77, 0, 9, 251, 80, 7, 3, 0, 8, 83, 0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8, 115, 0, 8, 51, 0, 9, 199, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9, 167, 0, 8, 3, 0, 8, 131, 0, 8, 67, 0, 9, 231, 80, 7, 7, 0, 8, 91, 0, 8, 27, 0, 9, 151, 84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 215, 82, 7, 19, 0, 8, 107, 0, 8, 43, 0, 9, 183, 0, 8, 11, 0, 8, 139, 0, 8, 75, 0, 9, 247, 80, 7, 5, 0, 8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8, 55, 0, 9, 207, 81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 175, 0, 8, 7, 0, 8, 135, 0, 8, 71, 0, 9, 239, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 159, 84, 7, 99, 0, 8, 127, 0, 8, 63, 0, 9, 223, 82, 7, 27, 0, 8, 111, 0, 8, 47, 0, 9, 191, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 255], a$1 = [80, 5, 1, 87, 5, 257, 83, 5, 17, 91, 5, 4097, 81, 5, 5, 89, 5, 1025, 85, 5, 65, 93, 5, 16385, 80, 5, 3, 88, 5, 513, 84, 5, 33, 92, 5, 8193, 82, 5, 9, 90, 5, 2049, 86, 5, 129, 192, 5, 24577, 80, 5, 2, 87, 5, 385, 83, 5, 25, 91, 5, 6145, 81, 5, 7, 89, 5, 1537, 85, 5, 97, 93, 5, 24577, 80, 5, 4, 88, 5, 769, 84, 5, 49, 92, 5, 12289, 82, 5, 13, 90, 5, 3073, 86, 5, 193, 192, 5, 24577], s$1 = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0], o$1 = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112], l$1 = [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], c$1 = [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], u$1 = 15;
-function d$1() {
-  let e, i, r, a, d, f;
-  function h(e2, i2, s, o, l, c, h2, w2, _2, b, p) {
-    let m, g, y, x, k, v, S2, z, A, U2, D2, E, T, F2, O2;
-    U2 = 0, k = s;
-    do {
-      r[e2[i2 + U2]]++, U2++, k--;
-    } while (0 !== k);
-    if (r[0] == s) return h2[0] = -1, w2[0] = 0, 0;
-    for (z = w2[0], v = 1; v <= u$1 && 0 === r[v]; v++) ;
-    for (S2 = v, z < v && (z = v), k = u$1; 0 !== k && 0 === r[k]; k--) ;
-    for (y = k, z > k && (z = k), w2[0] = z, F2 = 1 << v; v < k; v++, F2 <<= 1) if ((F2 -= r[v]) < 0) return t$1;
-    if ((F2 -= r[k]) < 0) return t$1;
-    for (r[k] += F2, f[1] = v = 0, U2 = 1, T = 2; 0 != --k; ) f[T] = v += r[U2], T++, U2++;
-    k = 0, U2 = 0;
-    do {
-      0 !== (v = e2[i2 + U2]) && (p[f[v]++] = k), U2++;
-    } while (++k < s);
-    for (s = f[y], f[0] = k = 0, U2 = 0, x = -1, E = -z, d[0] = 0, D2 = 0, O2 = 0; S2 <= y; S2++) for (m = r[S2]; 0 != m--; ) {
-      for (; S2 > E + z; ) {
-        if (x++, E += z, O2 = y - E, O2 = O2 > z ? z : O2, (g = 1 << (v = S2 - E)) > m + 1 && (g -= m + 1, T = S2, v < O2)) for (; ++v < O2 && !((g <<= 1) <= r[++T]); ) g -= r[T];
-        if (O2 = 1 << v, b[0] + O2 > 1440) return t$1;
-        d[x] = D2 = b[0], b[0] += O2, 0 !== x ? (f[x] = k, a[0] = v, a[1] = z, v = k >>> E - z, a[2] = D2 - d[x - 1] - v, _2.set(a, 3 * (d[x - 1] + v))) : h2[0] = D2;
-      }
-      for (a[1] = S2 - E, U2 >= s ? a[0] = 192 : p[U2] < o ? (a[0] = p[U2] < 256 ? 0 : 96, a[2] = p[U2++]) : (a[0] = c[p[U2] - o] + 16 + 64, a[2] = l[p[U2++] - o]), g = 1 << S2 - E, v = k >>> E; v < O2; v += g) _2.set(a, 3 * (D2 + v));
-      for (v = 1 << S2 - 1; k & v; v >>>= 1) k ^= v;
-      for (k ^= v, A = (1 << E) - 1; (k & A) != f[x]; ) x--, E -= z, A = (1 << E) - 1;
-    }
-    return 0 !== F2 && 1 != y ? n$1 : 0;
-  }
-  function w(t) {
-    let n;
-    for (e || (e = [], i = [], r = new Int32Array(16), a = [], d = new Int32Array(u$1), f = new Int32Array(16)), i.length < t && (i = []), n = 0; n < t; n++) i[n] = 0;
-    for (n = 0; n < 16; n++) r[n] = 0;
-    for (n = 0; n < 3; n++) a[n] = 0;
-    d.set(r.subarray(0, u$1), 0), f.set(r.subarray(0, 16), 0);
-  }
-  this.inflate_trees_bits = function(r2, a2, s, o, l) {
-    let c;
-    return w(19), e[0] = 0, c = h(r2, 0, 19, 19, null, null, s, a2, o, e, i), c == t$1 ? l.msg = "oversubscribed dynamic bit lengths tree" : c != n$1 && 0 !== a2[0] || (l.msg = "incomplete dynamic bit lengths tree", c = t$1), c;
-  }, this.inflate_trees_dynamic = function(r2, a2, u, d2, f2, _2, b, p, m) {
-    let g;
-    return w(288), e[0] = 0, g = h(u, 0, r2, 257, s$1, o$1, _2, d2, p, e, i), 0 != g || 0 === d2[0] ? (g == t$1 ? m.msg = "oversubscribed literal/length tree" : -4 != g && (m.msg = "incomplete literal/length tree", g = t$1), g) : (w(288), g = h(u, r2, a2, 0, l$1, c$1, b, f2, p, e, i), 0 != g || 0 === f2[0] && r2 > 257 ? (g == t$1 ? m.msg = "oversubscribed distance tree" : g == n$1 ? (m.msg = "incomplete distance tree", g = t$1) : -4 != g && (m.msg = "empty distance tree with lengths", g = t$1), g) : 0);
-  };
-}
-d$1.inflate_trees_fixed = function(e, t, n, i) {
-  return e[0] = 9, t[0] = 5, n[0] = r$1, i[0] = a$1, 0;
-};
-function f$1() {
-  const n = this;
-  let r, a, s, o, l = 0, c = 0, u = 0, d = 0, f = 0, h = 0, w = 0, _2 = 0, b = 0, p = 0;
-  function m(e, n2, r2, a2, s2, o2, l2, c2) {
-    let u2, d2, f2, h2, w2, _3, b2, p2, m2, g, y, x, k, v, S2, z;
-    b2 = c2.next_in_index, p2 = c2.avail_in, w2 = l2.bitb, _3 = l2.bitk, m2 = l2.write, g = m2 < l2.read ? l2.read - m2 - 1 : l2.end - m2, y = i$1[e], x = i$1[n2];
-    do {
-      for (; _3 < 20; ) p2--, w2 |= (255 & c2.read_byte(b2++)) << _3, _3 += 8;
-      if (u2 = w2 & y, d2 = r2, f2 = a2, z = 3 * (f2 + u2), 0 !== (h2 = d2[z])) for (; ; ) {
-        if (w2 >>= d2[z + 1], _3 -= d2[z + 1], 16 & h2) {
-          for (h2 &= 15, k = d2[z + 2] + (w2 & i$1[h2]), w2 >>= h2, _3 -= h2; _3 < 15; ) p2--, w2 |= (255 & c2.read_byte(b2++)) << _3, _3 += 8;
-          for (u2 = w2 & x, d2 = s2, f2 = o2, z = 3 * (f2 + u2), h2 = d2[z]; ; ) {
-            if (w2 >>= d2[z + 1], _3 -= d2[z + 1], 16 & h2) {
-              for (h2 &= 15; _3 < h2; ) p2--, w2 |= (255 & c2.read_byte(b2++)) << _3, _3 += 8;
-              if (v = d2[z + 2] + (w2 & i$1[h2]), w2 >>= h2, _3 -= h2, g -= k, m2 >= v) S2 = m2 - v, m2 - S2 > 0 && 2 > m2 - S2 ? (l2.win[m2++] = l2.win[S2++], l2.win[m2++] = l2.win[S2++], k -= 2) : (l2.win.set(l2.win.subarray(S2, S2 + 2), m2), m2 += 2, S2 += 2, k -= 2);
-              else {
-                S2 = m2 - v;
-                do {
-                  S2 += l2.end;
-                } while (S2 < 0);
-                if (h2 = l2.end - S2, k > h2) {
-                  if (k -= h2, m2 - S2 > 0 && h2 > m2 - S2) do {
-                    l2.win[m2++] = l2.win[S2++];
-                  } while (0 != --h2);
-                  else l2.win.set(l2.win.subarray(S2, S2 + h2), m2), m2 += h2, S2 += h2, h2 = 0;
-                  S2 = 0;
-                }
-              }
-              if (m2 - S2 > 0 && k > m2 - S2) do {
-                l2.win[m2++] = l2.win[S2++];
-              } while (0 != --k);
-              else l2.win.set(l2.win.subarray(S2, S2 + k), m2), m2 += k, S2 += k, k = 0;
-              break;
-            }
-            if (64 & h2) return c2.msg = "invalid distance code", k = c2.avail_in - p2, k = _3 >> 3 < k ? _3 >> 3 : k, p2 += k, b2 -= k, _3 -= k << 3, l2.bitb = w2, l2.bitk = _3, c2.avail_in = p2, c2.total_in += b2 - c2.next_in_index, c2.next_in_index = b2, l2.write = m2, t$1;
-            u2 += d2[z + 2], u2 += w2 & i$1[h2], z = 3 * (f2 + u2), h2 = d2[z];
-          }
-          break;
-        }
-        if (64 & h2) return 32 & h2 ? (k = c2.avail_in - p2, k = _3 >> 3 < k ? _3 >> 3 : k, p2 += k, b2 -= k, _3 -= k << 3, l2.bitb = w2, l2.bitk = _3, c2.avail_in = p2, c2.total_in += b2 - c2.next_in_index, c2.next_in_index = b2, l2.write = m2, 1) : (c2.msg = "invalid literal/length code", k = c2.avail_in - p2, k = _3 >> 3 < k ? _3 >> 3 : k, p2 += k, b2 -= k, _3 -= k << 3, l2.bitb = w2, l2.bitk = _3, c2.avail_in = p2, c2.total_in += b2 - c2.next_in_index, c2.next_in_index = b2, l2.write = m2, t$1);
-        if (u2 += d2[z + 2], u2 += w2 & i$1[h2], z = 3 * (f2 + u2), 0 === (h2 = d2[z])) {
-          w2 >>= d2[z + 1], _3 -= d2[z + 1], l2.win[m2++] = d2[z + 2], g--;
-          break;
-        }
-      }
-      else w2 >>= d2[z + 1], _3 -= d2[z + 1], l2.win[m2++] = d2[z + 2], g--;
-    } while (g >= 258 && p2 >= 10);
-    return k = c2.avail_in - p2, k = _3 >> 3 < k ? _3 >> 3 : k, p2 += k, b2 -= k, _3 -= k << 3, l2.bitb = w2, l2.bitk = _3, c2.avail_in = p2, c2.total_in += b2 - c2.next_in_index, c2.next_in_index = b2, l2.write = m2, 0;
-  }
-  n.init = function(e, t, n2, i, l2, c2) {
-    r = 0, w = e, _2 = t, s = n2, b = i, o = l2, p = c2, a = null;
-  }, n.proc = function(n2, g, y) {
-    let x, k, v, S2, z, A, U2, D2 = 0, E = 0, T = 0;
-    for (T = g.next_in_index, S2 = g.avail_in, D2 = n2.bitb, E = n2.bitk, z = n2.write, A = z < n2.read ? n2.read - z - 1 : n2.end - z; ; ) switch (r) {
-      case 0:
-        if (A >= 258 && S2 >= 10 && (n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, y = m(w, _2, s, b, o, p, n2, g), T = g.next_in_index, S2 = g.avail_in, D2 = n2.bitb, E = n2.bitk, z = n2.write, A = z < n2.read ? n2.read - z - 1 : n2.end - z, 0 != y)) {
-          r = 1 == y ? 7 : 9;
-          break;
-        }
-        u = w, a = s, c = b, r = 1;
-      case 1:
-        for (x = u; E < x; ) {
-          if (0 === S2) return n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-          y = 0, S2--, D2 |= (255 & g.read_byte(T++)) << E, E += 8;
-        }
-        if (k = 3 * (c + (D2 & i$1[x])), D2 >>>= a[k + 1], E -= a[k + 1], v = a[k], 0 === v) {
-          d = a[k + 2], r = 6;
-          break;
-        }
-        if (16 & v) {
-          f = 15 & v, l = a[k + 2], r = 2;
-          break;
-        }
-        if (!(64 & v)) {
-          u = v, c = k / 3 + a[k + 2];
-          break;
-        }
-        if (32 & v) {
-          r = 7;
-          break;
-        }
-        return r = 9, g.msg = "invalid literal/length code", y = t$1, n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-      case 2:
-        for (x = f; E < x; ) {
-          if (0 === S2) return n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-          y = 0, S2--, D2 |= (255 & g.read_byte(T++)) << E, E += 8;
-        }
-        l += D2 & i$1[x], D2 >>= x, E -= x, u = _2, a = o, c = p, r = 3;
-      case 3:
-        for (x = u; E < x; ) {
-          if (0 === S2) return n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-          y = 0, S2--, D2 |= (255 & g.read_byte(T++)) << E, E += 8;
-        }
-        if (k = 3 * (c + (D2 & i$1[x])), D2 >>= a[k + 1], E -= a[k + 1], v = a[k], 16 & v) {
-          f = 15 & v, h = a[k + 2], r = 4;
-          break;
-        }
-        if (!(64 & v)) {
-          u = v, c = k / 3 + a[k + 2];
-          break;
-        }
-        return r = 9, g.msg = "invalid distance code", y = t$1, n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-      case 4:
-        for (x = f; E < x; ) {
-          if (0 === S2) return n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-          y = 0, S2--, D2 |= (255 & g.read_byte(T++)) << E, E += 8;
-        }
-        h += D2 & i$1[x], D2 >>= x, E -= x, r = 5;
-      case 5:
-        for (U2 = z - h; U2 < 0; ) U2 += n2.end;
-        for (; 0 !== l; ) {
-          if (0 === A && (z == n2.end && 0 !== n2.read && (z = 0, A = z < n2.read ? n2.read - z - 1 : n2.end - z), 0 === A && (n2.write = z, y = n2.inflate_flush(g, y), z = n2.write, A = z < n2.read ? n2.read - z - 1 : n2.end - z, z == n2.end && 0 !== n2.read && (z = 0, A = z < n2.read ? n2.read - z - 1 : n2.end - z), 0 === A))) return n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-          n2.win[z++] = n2.win[U2++], A--, U2 == n2.end && (U2 = 0), l--;
-        }
-        r = 0;
-        break;
-      case 6:
-        if (0 === A && (z == n2.end && 0 !== n2.read && (z = 0, A = z < n2.read ? n2.read - z - 1 : n2.end - z), 0 === A && (n2.write = z, y = n2.inflate_flush(g, y), z = n2.write, A = z < n2.read ? n2.read - z - 1 : n2.end - z, z == n2.end && 0 !== n2.read && (z = 0, A = z < n2.read ? n2.read - z - 1 : n2.end - z), 0 === A))) return n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-        y = 0, n2.win[z++] = d, A--, r = 0;
-        break;
-      case 7:
-        if (E > 7 && (E -= 8, S2++, T--), n2.write = z, y = n2.inflate_flush(g, y), z = n2.write, A = z < n2.read ? n2.read - z - 1 : n2.end - z, n2.read != n2.write) return n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-        r = 8;
-      case 8:
-        return y = 1, n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-      case 9:
-        return y = t$1, n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-      default:
-        return y = e$1, n2.bitb = D2, n2.bitk = E, g.avail_in = S2, g.total_in += T - g.next_in_index, g.next_in_index = T, n2.write = z, n2.inflate_flush(g, y);
-    }
-  }, n.free = function() {
-  };
-}
-const h$1 = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
-function w$1(r, a) {
-  const s = this;
-  let o, l = 0, c = 0, u = 0, w = 0;
-  const _2 = [0], b = [0], p = new f$1();
-  let m = 0, g = new Int32Array(4320);
-  const y = new d$1();
-  s.bitk = 0, s.bitb = 0, s.win = new Uint8Array(a), s.end = a, s.read = 0, s.write = 0, s.reset = function(e, t) {
-    t && (t[0] = 0), 6 == l && p.free(e), l = 0, s.bitk = 0, s.bitb = 0, s.read = s.write = 0;
-  }, s.reset(r, null), s.inflate_flush = function(e, t) {
-    let i, r2, a2;
-    return r2 = e.next_out_index, a2 = s.read, i = (a2 <= s.write ? s.write : s.end) - a2, i > e.avail_out && (i = e.avail_out), 0 !== i && t == n$1 && (t = 0), e.avail_out -= i, e.total_out += i, e.next_out.set(s.win.subarray(a2, a2 + i), r2), r2 += i, a2 += i, a2 == s.end && (a2 = 0, s.write == s.end && (s.write = 0), i = s.write - a2, i > e.avail_out && (i = e.avail_out), 0 !== i && t == n$1 && (t = 0), e.avail_out -= i, e.total_out += i, e.next_out.set(s.win.subarray(a2, a2 + i), r2), r2 += i, a2 += i), e.next_out_index = r2, s.read = a2, t;
-  }, s.proc = function(n, r2) {
-    let a2, f, x, k, v, S2, z, A;
-    for (k = n.next_in_index, v = n.avail_in, f = s.bitb, x = s.bitk, S2 = s.write, z = S2 < s.read ? s.read - S2 - 1 : s.end - S2; ; ) {
-      let U2, D2, E, T, F2, O2, C2, W2;
-      switch (l) {
-        case 0:
-          for (; x < 3; ) {
-            if (0 === v) return s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-            r2 = 0, v--, f |= (255 & n.read_byte(k++)) << x, x += 8;
-          }
-          switch (a2 = 7 & f, m = 1 & a2, a2 >>> 1) {
-            case 0:
-              f >>>= 3, x -= 3, a2 = 7 & x, f >>>= a2, x -= a2, l = 1;
-              break;
-            case 1:
-              U2 = [], D2 = [], E = [[]], T = [[]], d$1.inflate_trees_fixed(U2, D2, E, T), p.init(U2[0], D2[0], E[0], 0, T[0], 0), f >>>= 3, x -= 3, l = 6;
-              break;
-            case 2:
-              f >>>= 3, x -= 3, l = 3;
-              break;
-            case 3:
-              return f >>>= 3, x -= 3, l = 9, n.msg = "invalid block type", r2 = t$1, s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-          }
-          break;
-        case 1:
-          for (; x < 32; ) {
-            if (0 === v) return s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-            r2 = 0, v--, f |= (255 & n.read_byte(k++)) << x, x += 8;
-          }
-          if ((~f >>> 16 & 65535) != (65535 & f)) return l = 9, n.msg = "invalid stored block lengths", r2 = t$1, s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-          c = 65535 & f, f = x = 0, l = 0 !== c ? 2 : 0 !== m ? 7 : 0;
-          break;
-        case 2:
-          if (0 === v) return s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-          if (0 === z && (S2 == s.end && 0 !== s.read && (S2 = 0, z = S2 < s.read ? s.read - S2 - 1 : s.end - S2), 0 === z && (s.write = S2, r2 = s.inflate_flush(n, r2), S2 = s.write, z = S2 < s.read ? s.read - S2 - 1 : s.end - S2, S2 == s.end && 0 !== s.read && (S2 = 0, z = S2 < s.read ? s.read - S2 - 1 : s.end - S2), 0 === z))) return s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-          if (r2 = 0, a2 = c, a2 > v && (a2 = v), a2 > z && (a2 = z), s.win.set(n.read_buf(k, a2), S2), k += a2, v -= a2, S2 += a2, z -= a2, 0 != (c -= a2)) break;
-          l = 0 !== m ? 7 : 0;
-          break;
-        case 3:
-          for (; x < 14; ) {
-            if (0 === v) return s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-            r2 = 0, v--, f |= (255 & n.read_byte(k++)) << x, x += 8;
-          }
-          if (u = a2 = 16383 & f, (31 & a2) > 29 || (a2 >> 5 & 31) > 29) return l = 9, n.msg = "too many length or distance symbols", r2 = t$1, s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-          if (a2 = 258 + (31 & a2) + (a2 >> 5 & 31), !o || o.length < a2) o = [];
-          else for (A = 0; A < a2; A++) o[A] = 0;
-          f >>>= 14, x -= 14, w = 0, l = 4;
-        case 4:
-          for (; w < 4 + (u >>> 10); ) {
-            for (; x < 3; ) {
-              if (0 === v) return s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-              r2 = 0, v--, f |= (255 & n.read_byte(k++)) << x, x += 8;
-            }
-            o[h$1[w++]] = 7 & f, f >>>= 3, x -= 3;
-          }
-          for (; w < 19; ) o[h$1[w++]] = 0;
-          if (_2[0] = 7, a2 = y.inflate_trees_bits(o, _2, b, g, n), 0 != a2) return (r2 = a2) == t$1 && (o = null, l = 9), s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-          w = 0, l = 5;
-        case 5:
-          for (; a2 = u, !(w >= 258 + (31 & a2) + (a2 >> 5 & 31)); ) {
-            let e, c2;
-            for (a2 = _2[0]; x < a2; ) {
-              if (0 === v) return s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-              r2 = 0, v--, f |= (255 & n.read_byte(k++)) << x, x += 8;
-            }
-            if (a2 = g[3 * (b[0] + (f & i$1[a2])) + 1], c2 = g[3 * (b[0] + (f & i$1[a2])) + 2], c2 < 16) f >>>= a2, x -= a2, o[w++] = c2;
-            else {
-              for (A = 18 == c2 ? 7 : c2 - 14, e = 18 == c2 ? 11 : 3; x < a2 + A; ) {
-                if (0 === v) return s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-                r2 = 0, v--, f |= (255 & n.read_byte(k++)) << x, x += 8;
-              }
-              if (f >>>= a2, x -= a2, e += f & i$1[A], f >>>= A, x -= A, A = w, a2 = u, A + e > 258 + (31 & a2) + (a2 >> 5 & 31) || 16 == c2 && A < 1) return o = null, l = 9, n.msg = "invalid bit length repeat", r2 = t$1, s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-              c2 = 16 == c2 ? o[A - 1] : 0;
-              do {
-                o[A++] = c2;
-              } while (0 != --e);
-              w = A;
-            }
-          }
-          if (b[0] = -1, F2 = [], O2 = [], C2 = [], W2 = [], F2[0] = 9, O2[0] = 6, a2 = u, a2 = y.inflate_trees_dynamic(257 + (31 & a2), 1 + (a2 >> 5 & 31), o, F2, O2, C2, W2, g, n), 0 != a2) return a2 == t$1 && (o = null, l = 9), r2 = a2, s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-          p.init(F2[0], O2[0], g, C2[0], g, W2[0]), l = 6;
-        case 6:
-          if (s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, 1 != (r2 = p.proc(s, n, r2))) return s.inflate_flush(n, r2);
-          if (r2 = 0, p.free(n), k = n.next_in_index, v = n.avail_in, f = s.bitb, x = s.bitk, S2 = s.write, z = S2 < s.read ? s.read - S2 - 1 : s.end - S2, 0 === m) {
-            l = 0;
-            break;
-          }
-          l = 7;
-        case 7:
-          if (s.write = S2, r2 = s.inflate_flush(n, r2), S2 = s.write, z = S2 < s.read ? s.read - S2 - 1 : s.end - S2, s.read != s.write) return s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-          l = 8;
-        case 8:
-          return r2 = 1, s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-        case 9:
-          return r2 = t$1, s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-        default:
-          return r2 = e$1, s.bitb = f, s.bitk = x, n.avail_in = v, n.total_in += k - n.next_in_index, n.next_in_index = k, s.write = S2, s.inflate_flush(n, r2);
-      }
-    }
-  }, s.free = function(e) {
-    s.reset(e, null), s.win = null, g = null;
-  }, s.set_dictionary = function(e, t, n) {
-    s.win.set(e.subarray(t, t + n), 0), s.read = s.write = n;
-  }, s.sync_point = function() {
-    return 1 == l ? 1 : 0;
-  };
-}
-const _ = 13, b$1 = [0, 0, 255, 255];
-function p$1() {
-  const i = this;
-  function r(t) {
-    return t && t.istate ? (t.total_in = t.total_out = 0, t.msg = null, t.istate.mode = 7, t.istate.blocks.reset(t, null), 0) : e$1;
-  }
-  i.mode = 0, i.method = 0, i.was = [0], i.need = 0, i.marker = 0, i.wbits = 0, i.inflateEnd = function(e) {
-    return i.blocks && i.blocks.free(e), i.blocks = null, 0;
-  }, i.inflateInit = function(t, n) {
-    return t.msg = null, i.blocks = null, n < 8 || n > 15 ? (i.inflateEnd(t), e$1) : (i.wbits = n, t.istate.blocks = new w$1(t, 1 << n), r(t), 0);
-  }, i.inflate = function(i2, r2) {
-    let a, s;
-    if (!i2 || !i2.istate || !i2.next_in) return e$1;
-    const o = i2.istate;
-    for (r2 = 4 == r2 ? n$1 : 0, a = n$1; ; ) switch (o.mode) {
-      case 0:
-        if (0 === i2.avail_in) return a;
-        if (a = r2, i2.avail_in--, i2.total_in++, 8 != (15 & (o.method = i2.read_byte(i2.next_in_index++)))) {
-          o.mode = _, i2.msg = "unknown compression method", o.marker = 5;
-          break;
-        }
-        if (8 + (o.method >> 4) > o.wbits) {
-          o.mode = _, i2.msg = "invalid win size", o.marker = 5;
-          break;
-        }
-        o.mode = 1;
-      case 1:
-        if (0 === i2.avail_in) return a;
-        if (a = r2, i2.avail_in--, i2.total_in++, s = 255 & i2.read_byte(i2.next_in_index++), ((o.method << 8) + s) % 31 != 0) {
-          o.mode = _, i2.msg = "incorrect header check", o.marker = 5;
-          break;
-        }
-        if (!(32 & s)) {
-          o.mode = 7;
-          break;
-        }
-        o.mode = 2;
-      case 2:
-        if (0 === i2.avail_in) return a;
-        a = r2, i2.avail_in--, i2.total_in++, o.need = (255 & i2.read_byte(i2.next_in_index++)) << 24 & 4278190080, o.mode = 3;
-      case 3:
-        if (0 === i2.avail_in) return a;
-        a = r2, i2.avail_in--, i2.total_in++, o.need += (255 & i2.read_byte(i2.next_in_index++)) << 16 & 16711680, o.mode = 4;
-      case 4:
-        if (0 === i2.avail_in) return a;
-        a = r2, i2.avail_in--, i2.total_in++, o.need += (255 & i2.read_byte(i2.next_in_index++)) << 8 & 65280, o.mode = 5;
-      case 5:
-        return 0 === i2.avail_in ? a : (a = r2, i2.avail_in--, i2.total_in++, o.need += 255 & i2.read_byte(i2.next_in_index++), o.mode = 6, 2);
-      case 6:
-        return o.mode = _, i2.msg = "need dictionary", o.marker = 0, e$1;
-      case 7:
-        if (a = o.blocks.proc(i2, a), a == t$1) {
-          o.mode = _, o.marker = 0;
-          break;
-        }
-        if (0 == a && (a = r2), 1 != a) return a;
-        a = r2, o.blocks.reset(i2, o.was), o.mode = 12;
-      case 12:
-        return i2.avail_in = 0, 1;
-      case _:
-        return t$1;
-      default:
-        return e$1;
-    }
-  }, i.inflateSetDictionary = function(t, n, i2) {
-    let r2 = 0, a = i2;
-    if (!t || !t.istate || 6 != t.istate.mode) return e$1;
-    const s = t.istate;
-    return a >= 1 << s.wbits && (a = (1 << s.wbits) - 1, r2 = i2 - a), s.blocks.set_dictionary(n, r2, a), s.mode = 7, 0;
-  }, i.inflateSync = function(i2) {
-    let a, s, o, l, c;
-    if (!i2 || !i2.istate) return e$1;
-    const u = i2.istate;
-    if (u.mode != _ && (u.mode = _, u.marker = 0), 0 === (a = i2.avail_in)) return n$1;
-    for (s = i2.next_in_index, o = u.marker; 0 !== a && o < 4; ) i2.read_byte(s) == b$1[o] ? o++ : o = 0 !== i2.read_byte(s) ? 0 : 4 - o, s++, a--;
-    return i2.total_in += s - i2.next_in_index, i2.next_in_index = s, i2.avail_in = a, u.marker = o, 4 != o ? t$1 : (l = i2.total_in, c = i2.total_out, r(i2), i2.total_in = l, i2.total_out = c, u.mode = 7, 0);
-  }, i.inflateSyncPoint = function(t) {
-    return t && t.istate && t.istate.blocks ? t.istate.blocks.sync_point() : e$1;
-  };
-}
-function m$1() {
-}
-m$1.prototype = { inflateInit(e) {
-  const t = this;
-  return t.istate = new p$1(), e || (e = 15), t.istate.inflateInit(t, e);
-}, inflate(t) {
-  const n = this;
-  return n.istate ? n.istate.inflate(n, t) : e$1;
-}, inflateEnd() {
-  const t = this;
-  if (!t.istate) return e$1;
-  const n = t.istate.inflateEnd(t);
-  return t.istate = null, n;
-}, inflateSync() {
-  const t = this;
-  return t.istate ? t.istate.inflateSync(t) : e$1;
-}, inflateSetDictionary(t, n) {
-  const i = this;
-  return i.istate ? i.istate.inflateSetDictionary(i, t, n) : e$1;
-}, read_byte(e) {
-  return this.next_in[e];
-}, read_buf(e, t) {
-  return this.next_in.subarray(e, e + t);
-} };
-const g$1 = 4294967295, y$1 = 65535, x$1 = 33639248, k$1 = 101075792, v$1 = 22, S = void 0, z$1 = "undefined", A$1 = "function";
-let U$1 = class U {
-  constructor(e) {
-    return class extends TransformStream {
-      constructor(t, n) {
-        const i = new e(n);
-        super({ transform(e2, t2) {
-          t2.enqueue(i.append(e2));
-        }, flush(e2) {
-          const t2 = i.flush();
-          t2 && e2.enqueue(t2);
-        } });
-      }
-    };
-  }
-};
-let D = 2;
-try {
-  typeof navigator != z$1 && navigator.hardwareConcurrency && (D = navigator.hardwareConcurrency);
-} catch (e) {
-}
-const E$1 = { chunkSize: 524288, maxWorkers: D, terminateWorkerTimeout: 5e3, useWebWorkers: true, useCompressionStream: true, workerScripts: S, CompressionStreamNative: typeof CompressionStream != z$1 && CompressionStream, DecompressionStreamNative: typeof DecompressionStream != z$1 && DecompressionStream }, T$1 = Object.assign({}, E$1);
-function F(e) {
-  const { baseURL: t, chunkSize: n, maxWorkers: i, terminateWorkerTimeout: r, useCompressionStream: a, useWebWorkers: s, Deflate: o, Inflate: l, CompressionStream: c, DecompressionStream: u, workerScripts: d } = e;
-  if (O("baseURL", t), O("chunkSize", n), O("maxWorkers", i), O("terminateWorkerTimeout", r), O("useCompressionStream", a), O("useWebWorkers", s), o && (T$1.CompressionStream = new U$1(o)), l && (T$1.DecompressionStream = new U$1(l)), O("CompressionStream", c), O("DecompressionStream", u), d !== S) {
-    const { deflate: e2, inflate: t2 } = d;
-    if ((e2 || t2) && (T$1.workerScripts || (T$1.workerScripts = {})), e2) {
-      if (!Array.isArray(e2)) throw new Error("workerScripts.deflate must be an array");
-      T$1.workerScripts.deflate = e2;
-    }
-    if (t2) {
-      if (!Array.isArray(t2)) throw new Error("workerScripts.inflate must be an array");
-      T$1.workerScripts.inflate = t2;
-    }
-  }
-}
-function O(e, t) {
-  t !== S && (T$1[e] = t);
-}
-const C = [];
-for (let e = 0; e < 256; e++) {
-  let t = e;
-  for (let e2 = 0; e2 < 8; e2++) 1 & t ? t = t >>> 1 ^ 3988292384 : t >>>= 1;
-  C[e] = t;
-}
-class W {
-  constructor(e) {
-    this.crc = e || -1;
-  }
-  append(e) {
-    let t = 0 | this.crc;
-    for (let n = 0, i = 0 | e.length; n < i; n++) t = t >>> 8 ^ C[255 & (t ^ e[n])];
-    this.crc = t;
-  }
-  get() {
-    return ~this.crc;
-  }
-}
-class j extends TransformStream {
-  constructor() {
-    let e;
-    const t = new W();
-    super({ transform(e2, n) {
-      t.append(e2), n.enqueue(e2);
-    }, flush() {
-      const n = new Uint8Array(4);
-      new DataView(n.buffer).setUint32(0, t.get()), e.value = n;
-    } }), e = this;
-  }
-}
-const M = { concat(e, t) {
-  if (0 === e.length || 0 === t.length) return e.concat(t);
-  const n = e[e.length - 1], i = M.getPartial(n);
-  return 32 === i ? e.concat(t) : M._shiftRight(t, i, 0 | n, e.slice(0, e.length - 1));
-}, bitLength(e) {
-  const t = e.length;
-  if (0 === t) return 0;
-  const n = e[t - 1];
-  return 32 * (t - 1) + M.getPartial(n);
-}, clamp(e, t) {
-  if (32 * e.length < t) return e;
-  const n = (e = e.slice(0, Math.ceil(t / 32))).length;
-  return t &= 31, n > 0 && t && (e[n - 1] = M.partial(t, e[n - 1] & 2147483648 >> t - 1, 1)), e;
-}, partial: (e, t, n) => 32 === e ? t : (n ? 0 | t : t << 32 - e) + 1099511627776 * e, getPartial: (e) => Math.round(e / 1099511627776) || 32, _shiftRight(e, t, n, i) {
-  for (void 0 === i && (i = []); t >= 32; t -= 32) i.push(n), n = 0;
-  if (0 === t) return i.concat(e);
-  for (let r2 = 0; r2 < e.length; r2++) i.push(n | e[r2] >>> t), n = e[r2] << 32 - t;
-  const r = e.length ? e[e.length - 1] : 0, a = M.getPartial(r);
-  return i.push(M.partial(t + a & 31, t + a > 32 ? n : i.pop(), 1)), i;
-} }, L = { bytes: { fromBits(e) {
-  const t = M.bitLength(e) / 8, n = new Uint8Array(t);
-  let i;
-  for (let r = 0; r < t; r++) 3 & r || (i = e[r / 4]), n[r] = i >>> 24, i <<= 8;
-  return n;
-}, toBits(e) {
-  const t = [];
-  let n, i = 0;
-  for (n = 0; n < e.length; n++) i = i << 8 | e[n], 3 & ~n || (t.push(i), i = 0);
-  return 3 & n && t.push(M.partial(8 * (3 & n), i)), t;
-} } }, P = { sha1: class {
-  constructor(e) {
-    const t = this;
-    t.blockSize = 512, t._init = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], t._key = [1518500249, 1859775393, 2400959708, 3395469782], e ? (t._h = e._h.slice(0), t._buffer = e._buffer.slice(0), t._length = e._length) : t.reset();
-  }
-  reset() {
-    const e = this;
-    return e._h = e._init.slice(0), e._buffer = [], e._length = 0, e;
-  }
-  update(e) {
-    const t = this;
-    "string" == typeof e && (e = L.utf8String.toBits(e));
-    const n = t._buffer = M.concat(t._buffer, e), i = t._length, r = t._length = i + M.bitLength(e);
-    if (r > 9007199254740991) throw new Error("Cannot hash more than 2^53 - 1 bits");
-    const a = new Uint32Array(n);
-    let s = 0;
-    for (let e2 = t.blockSize + i - (t.blockSize + i & t.blockSize - 1); e2 <= r; e2 += t.blockSize) t._block(a.subarray(16 * s, 16 * (s + 1))), s += 1;
-    return n.splice(0, 16 * s), t;
-  }
-  finalize() {
-    const e = this;
-    let t = e._buffer;
-    const n = e._h;
-    t = M.concat(t, [M.partial(1, 1)]);
-    for (let e2 = t.length + 2; 15 & e2; e2++) t.push(0);
-    for (t.push(Math.floor(e._length / 4294967296)), t.push(0 | e._length); t.length; ) e._block(t.splice(0, 16));
-    return e.reset(), n;
-  }
-  _f(e, t, n, i) {
-    return e <= 19 ? t & n | ~t & i : e <= 39 ? t ^ n ^ i : e <= 59 ? t & n | t & i | n & i : e <= 79 ? t ^ n ^ i : void 0;
-  }
-  _S(e, t) {
-    return t << e | t >>> 32 - e;
-  }
-  _block(e) {
-    const t = this, n = t._h, i = Array(80);
-    for (let t2 = 0; t2 < 16; t2++) i[t2] = e[t2];
-    let r = n[0], a = n[1], s = n[2], o = n[3], l = n[4];
-    for (let e2 = 0; e2 <= 79; e2++) {
-      e2 >= 16 && (i[e2] = t._S(1, i[e2 - 3] ^ i[e2 - 8] ^ i[e2 - 14] ^ i[e2 - 16]));
-      const n2 = t._S(5, r) + t._f(e2, a, s, o) + l + i[e2] + t._key[Math.floor(e2 / 20)] | 0;
-      l = o, o = s, s = t._S(30, a), a = r, r = n2;
-    }
-    n[0] = n[0] + r | 0, n[1] = n[1] + a | 0, n[2] = n[2] + s | 0, n[3] = n[3] + o | 0, n[4] = n[4] + l | 0;
-  }
-} }, R = { aes: class {
-  constructor(e) {
-    const t = this;
-    t._tables = [[[], [], [], [], []], [[], [], [], [], []]], t._tables[0][0][0] || t._precompute();
-    const n = t._tables[0][4], i = t._tables[1], r = e.length;
-    let a, s, o, l = 1;
-    if (4 !== r && 6 !== r && 8 !== r) throw new Error("invalid aes key size");
-    for (t._key = [s = e.slice(0), o = []], a = r; a < 4 * r + 28; a++) {
-      let e2 = s[a - 1];
-      (a % r == 0 || 8 === r && a % r == 4) && (e2 = n[e2 >>> 24] << 24 ^ n[e2 >> 16 & 255] << 16 ^ n[e2 >> 8 & 255] << 8 ^ n[255 & e2], a % r == 0 && (e2 = e2 << 8 ^ e2 >>> 24 ^ l << 24, l = l << 1 ^ 283 * (l >> 7))), s[a] = s[a - r] ^ e2;
-    }
-    for (let e2 = 0; a; e2++, a--) {
-      const t2 = s[3 & e2 ? a : a - 4];
-      o[e2] = a <= 4 || e2 < 4 ? t2 : i[0][n[t2 >>> 24]] ^ i[1][n[t2 >> 16 & 255]] ^ i[2][n[t2 >> 8 & 255]] ^ i[3][n[255 & t2]];
-    }
-  }
-  encrypt(e) {
-    return this._crypt(e, 0);
-  }
-  decrypt(e) {
-    return this._crypt(e, 1);
-  }
-  _precompute() {
-    const e = this._tables[0], t = this._tables[1], n = e[4], i = t[4], r = [], a = [];
-    let s, o, l, c;
-    for (let e2 = 0; e2 < 256; e2++) a[(r[e2] = e2 << 1 ^ 283 * (e2 >> 7)) ^ e2] = e2;
-    for (let u = s = 0; !n[u]; u ^= o || 1, s = a[s] || 1) {
-      let a2 = s ^ s << 1 ^ s << 2 ^ s << 3 ^ s << 4;
-      a2 = a2 >> 8 ^ 255 & a2 ^ 99, n[u] = a2, i[a2] = u, c = r[l = r[o = r[u]]];
-      let d = 16843009 * c ^ 65537 * l ^ 257 * o ^ 16843008 * u, f = 257 * r[a2] ^ 16843008 * a2;
-      for (let n2 = 0; n2 < 4; n2++) e[n2][u] = f = f << 24 ^ f >>> 8, t[n2][a2] = d = d << 24 ^ d >>> 8;
-    }
-    for (let n2 = 0; n2 < 5; n2++) e[n2] = e[n2].slice(0), t[n2] = t[n2].slice(0);
-  }
-  _crypt(e, t) {
-    if (4 !== e.length) throw new Error("invalid aes block size");
-    const n = this._key[t], i = n.length / 4 - 2, r = [0, 0, 0, 0], a = this._tables[t], s = a[0], o = a[1], l = a[2], c = a[3], u = a[4];
-    let d, f, h, w = e[0] ^ n[0], _2 = e[t ? 3 : 1] ^ n[1], b = e[2] ^ n[2], p = e[t ? 1 : 3] ^ n[3], m = 4;
-    for (let e2 = 0; e2 < i; e2++) d = s[w >>> 24] ^ o[_2 >> 16 & 255] ^ l[b >> 8 & 255] ^ c[255 & p] ^ n[m], f = s[_2 >>> 24] ^ o[b >> 16 & 255] ^ l[p >> 8 & 255] ^ c[255 & w] ^ n[m + 1], h = s[b >>> 24] ^ o[p >> 16 & 255] ^ l[w >> 8 & 255] ^ c[255 & _2] ^ n[m + 2], p = s[p >>> 24] ^ o[w >> 16 & 255] ^ l[_2 >> 8 & 255] ^ c[255 & b] ^ n[m + 3], m += 4, w = d, _2 = f, b = h;
-    for (let e2 = 0; e2 < 4; e2++) r[t ? 3 & -e2 : e2] = u[w >>> 24] << 24 ^ u[_2 >> 16 & 255] << 16 ^ u[b >> 8 & 255] << 8 ^ u[255 & p] ^ n[m++], d = w, w = _2, _2 = b, b = p, p = d;
-    return r;
-  }
-} }, B = { getRandomValues(e) {
-  const t = new Uint32Array(e.buffer), n = (e2) => {
-    let t2 = 987654321;
-    const n2 = 4294967295;
-    return function() {
-      t2 = 36969 * (65535 & t2) + (t2 >> 16) & n2;
-      return (((t2 << 16) + (e2 = 18e3 * (65535 & e2) + (e2 >> 16) & n2) & n2) / 4294967296 + 0.5) * (Math.random() > 0.5 ? 1 : -1);
-    };
-  };
-  for (let i, r = 0; r < e.length; r += 4) {
-    const e2 = n(4294967296 * (i || Math.random()));
-    i = 987654071 * e2(), t[r / 4] = 4294967296 * e2() | 0;
-  }
-  return e;
-} }, I = { ctrGladman: class {
-  constructor(e, t) {
-    this._prf = e, this._initIv = t, this._iv = t;
-  }
-  reset() {
-    this._iv = this._initIv;
-  }
-  update(e) {
-    return this.calculate(this._prf, e, this._iv);
-  }
-  incWord(e) {
-    if (255 & ~(e >> 24)) e += 1 << 24;
-    else {
-      let t = e >> 16 & 255, n = e >> 8 & 255, i = 255 & e;
-      255 === t ? (t = 0, 255 === n ? (n = 0, 255 === i ? i = 0 : ++i) : ++n) : ++t, e = 0, e += t << 16, e += n << 8, e += i;
-    }
-    return e;
-  }
-  incCounter(e) {
-    0 === (e[0] = this.incWord(e[0])) && (e[1] = this.incWord(e[1]));
-  }
-  calculate(e, t, n) {
-    let i;
-    if (!(i = t.length)) return [];
-    const r = M.bitLength(t);
-    for (let r2 = 0; r2 < i; r2 += 4) {
-      this.incCounter(n);
-      const i2 = e.encrypt(n);
-      t[r2] ^= i2[0], t[r2 + 1] ^= i2[1], t[r2 + 2] ^= i2[2], t[r2 + 3] ^= i2[3];
-    }
-    return M.clamp(t, r);
-  }
-} }, N = { importKey: (e) => new N.hmacSha1(L.bytes.toBits(e)), pbkdf2(e, t, n, i) {
-  if (n = n || 1e4, i < 0 || n < 0) throw new Error("invalid params to pbkdf2");
-  const r = 1 + (i >> 5) << 2;
-  let a, s, o, l, c;
-  const u = new ArrayBuffer(r), d = new DataView(u);
-  let f = 0;
-  const h = M;
-  for (t = L.bytes.toBits(t), c = 1; f < (r || 1); c++) {
-    for (a = s = e.encrypt(h.concat(t, [c])), o = 1; o < n; o++) for (s = e.encrypt(s), l = 0; l < s.length; l++) a[l] ^= s[l];
-    for (o = 0; f < (r || 1) && o < a.length; o++) d.setInt32(f, a[o]), f += 4;
-  }
-  return u.slice(0, i / 8);
-}, hmacSha1: class {
-  constructor(e) {
-    const t = this, n = t._hash = P.sha1, i = [[], []];
-    t._baseHash = [new n(), new n()];
-    const r = t._baseHash[0].blockSize / 32;
-    e.length > r && (e = new n().update(e).finalize());
-    for (let t2 = 0; t2 < r; t2++) i[0][t2] = 909522486 ^ e[t2], i[1][t2] = 1549556828 ^ e[t2];
-    t._baseHash[0].update(i[0]), t._baseHash[1].update(i[1]), t._resultHash = new n(t._baseHash[0]);
-  }
-  reset() {
-    const e = this;
-    e._resultHash = new e._hash(e._baseHash[0]), e._updated = false;
-  }
-  update(e) {
-    this._updated = true, this._resultHash.update(e);
-  }
-  digest() {
-    const e = this, t = e._resultHash.finalize(), n = new e._hash(e._baseHash[1]).update(t).finalize();
-    return e.reset(), n;
-  }
-  encrypt(e) {
-    if (this._updated) throw new Error("encrypt on already updated hmac called!");
-    return this.update(e), this.digest(e);
-  }
-} }, V = typeof crypto != z$1 && typeof crypto.getRandomValues == A$1, q = "Invalid password", H = "Invalid signature", K = "zipjs-abort-check-password";
-function Z(e) {
-  return V ? crypto.getRandomValues(e) : B.getRandomValues(e);
-}
-const G = 16, J = { name: "PBKDF2" }, Q = Object.assign({ hash: { name: "HMAC" } }, J), X = Object.assign({ iterations: 1e3, hash: { name: "SHA-1" } }, J), Y = ["deriveBits"], $ = [8, 12, 16], ee = [16, 24, 32], te = 10, ne = [0, 0, 0, 0], ie = typeof crypto != z$1, re = ie && crypto.subtle, ae = ie && typeof re != z$1, se = L.bytes, oe = R.aes, le = I.ctrGladman, ce = N.hmacSha1;
-let ue = ie && ae && typeof re.importKey == A$1, de = ie && ae && typeof re.deriveBits == A$1;
-class fe extends TransformStream {
-  constructor({ password: e, rawPassword: t, signed: n, encryptionStrength: i, checkPasswordOnly: r }) {
-    super({ start() {
-      Object.assign(this, { ready: new Promise((e2) => this.resolveReady = e2), password: be(e, t), signed: n, strength: i - 1, pending: new Uint8Array() });
-    }, async transform(e2, t2) {
-      const n2 = this, { password: i2, strength: a, resolveReady: s, ready: o } = n2;
-      i2 ? (await async function(e3, t3, n3, i3) {
-        const r2 = await _e(e3, t3, n3, me(i3, 0, $[t3])), a2 = me(i3, $[t3]);
-        if (r2[0] != a2[0] || r2[1] != a2[1]) throw new Error(q);
-      }(n2, a, i2, me(e2, 0, $[a] + 2)), e2 = me(e2, $[a] + 2), r ? t2.error(new Error(K)) : s()) : await o;
-      const l = new Uint8Array(e2.length - te - (e2.length - te) % G);
-      t2.enqueue(we(n2, e2, l, 0, te, true));
-    }, async flush(e2) {
-      const { signed: t2, ctr: n2, hmac: i2, pending: r2, ready: a } = this;
-      if (i2 && n2) {
-        await a;
-        const s = me(r2, 0, r2.length - te), o = me(r2, r2.length - te);
-        let l = new Uint8Array();
-        if (s.length) {
-          const e3 = ye(se, s);
-          i2.update(e3);
-          const t3 = n2.update(e3);
-          l = ge(se, t3);
-        }
-        if (t2) {
-          const e3 = me(ge(se, i2.digest()), 0, te);
-          for (let t3 = 0; t3 < te; t3++) if (e3[t3] != o[t3]) throw new Error(H);
-        }
-        e2.enqueue(l);
-      }
-    } });
-  }
-}
-class he extends TransformStream {
-  constructor({ password: e, rawPassword: t, encryptionStrength: n }) {
-    let i;
-    super({ start() {
-      Object.assign(this, { ready: new Promise((e2) => this.resolveReady = e2), password: be(e, t), strength: n - 1, pending: new Uint8Array() });
-    }, async transform(e2, t2) {
-      const n2 = this, { password: i2, strength: r, resolveReady: a, ready: s } = n2;
-      let o = new Uint8Array();
-      i2 ? (o = await async function(e3, t3, n3) {
-        const i3 = Z(new Uint8Array($[t3])), r2 = await _e(e3, t3, n3, i3);
-        return pe(i3, r2);
-      }(n2, r, i2), a()) : await s;
-      const l = new Uint8Array(o.length + e2.length - e2.length % G);
-      l.set(o, 0), t2.enqueue(we(n2, e2, l, o.length, 0));
-    }, async flush(e2) {
-      const { ctr: t2, hmac: n2, pending: r, ready: a } = this;
-      if (n2 && t2) {
-        await a;
-        let s = new Uint8Array();
-        if (r.length) {
-          const e3 = t2.update(ye(se, r));
-          n2.update(e3), s = ge(se, e3);
-        }
-        i.signature = ge(se, n2.digest()).slice(0, te), e2.enqueue(pe(s, i.signature));
-      }
-    } }), i = this;
-  }
-}
-function we(e, t, n, i, r, a) {
-  const { ctr: s, hmac: o, pending: l } = e, c = t.length - r;
-  let u;
-  for (l.length && (t = pe(l, t), n = function(e2, t2) {
-    if (t2 && t2 > e2.length) {
-      const n2 = e2;
-      (e2 = new Uint8Array(t2)).set(n2, 0);
-    }
-    return e2;
-  }(n, c - c % G)), u = 0; u <= c - G; u += G) {
-    const e2 = ye(se, me(t, u, u + G));
-    a && o.update(e2);
-    const r2 = s.update(e2);
-    a || o.update(r2), n.set(ge(se, r2), u + i);
-  }
-  return e.pending = me(t, u), n;
-}
-async function _e(e, t, n, i) {
-  e.password = null;
-  const r = await async function(e2, t2, n2, i2, r2) {
-    if (!ue) return N.importKey(t2);
-    try {
-      return await re.importKey(e2, t2, n2, i2, r2);
-    } catch (e3) {
-      return ue = false, N.importKey(t2);
-    }
-  }("raw", n, Q, false, Y), a = await async function(e2, t2, n2) {
-    if (!de) return N.pbkdf2(t2, e2.salt, X.iterations, n2);
-    try {
-      return await re.deriveBits(e2, t2, n2);
-    } catch (i2) {
-      return de = false, N.pbkdf2(t2, e2.salt, X.iterations, n2);
-    }
-  }(Object.assign({ salt: i }, X), r, 8 * (2 * ee[t] + 2)), s = new Uint8Array(a), o = ye(se, me(s, 0, ee[t])), l = ye(se, me(s, ee[t], 2 * ee[t])), c = me(s, 2 * ee[t]);
-  return Object.assign(e, { keys: { key: o, authentication: l, passwordVerification: c }, ctr: new le(new oe(o), Array.from(ne)), hmac: new ce(l) }), c;
-}
-function be(e, t) {
-  return t === S ? function(e2) {
-    if (typeof TextEncoder == z$1) {
-      e2 = unescape(encodeURIComponent(e2));
-      const t2 = new Uint8Array(e2.length);
-      for (let n = 0; n < t2.length; n++) t2[n] = e2.charCodeAt(n);
-      return t2;
-    }
-    return new TextEncoder().encode(e2);
-  }(e) : t;
-}
-function pe(e, t) {
-  let n = e;
-  return e.length + t.length && (n = new Uint8Array(e.length + t.length), n.set(e, 0), n.set(t, e.length)), n;
-}
-function me(e, t, n) {
-  return e.subarray(t, n);
-}
-function ge(e, t) {
-  return e.fromBits(t);
-}
-function ye(e, t) {
-  return e.toBits(t);
-}
-const xe = 12;
-class ke extends TransformStream {
-  constructor({ password: e, passwordVerification: t, checkPasswordOnly: n }) {
-    super({ start() {
-      Object.assign(this, { password: e, passwordVerification: t }), Ae(this, e);
-    }, transform(e2, t2) {
-      const i = this;
-      if (i.password) {
-        const t3 = Se(i, e2.subarray(0, xe));
-        if (i.password = null, t3[11] != i.passwordVerification) throw new Error(q);
-        e2 = e2.subarray(xe);
-      }
-      n ? t2.error(new Error(K)) : t2.enqueue(Se(i, e2));
-    } });
-  }
-}
-class ve extends TransformStream {
-  constructor({ password: e, passwordVerification: t }) {
-    super({ start() {
-      Object.assign(this, { password: e, passwordVerification: t }), Ae(this, e);
-    }, transform(e2, t2) {
-      const n = this;
-      let i, r;
-      if (n.password) {
-        n.password = null;
-        const t3 = Z(new Uint8Array(xe));
-        t3[11] = n.passwordVerification, i = new Uint8Array(e2.length + t3.length), i.set(ze(n, t3), 0), r = xe;
-      } else i = new Uint8Array(e2.length), r = 0;
-      i.set(ze(n, e2), r), t2.enqueue(i);
-    } });
-  }
-}
-function Se(e, t) {
-  const n = new Uint8Array(t.length);
-  for (let i = 0; i < t.length; i++) n[i] = De(e) ^ t[i], Ue(e, n[i]);
-  return n;
-}
-function ze(e, t) {
-  const n = new Uint8Array(t.length);
-  for (let i = 0; i < t.length; i++) n[i] = De(e) ^ t[i], Ue(e, t[i]);
-  return n;
-}
-function Ae(e, t) {
-  const n = [305419896, 591751049, 878082192];
-  Object.assign(e, { keys: n, crcKey0: new W(n[0]), crcKey2: new W(n[2]) });
-  for (let n2 = 0; n2 < t.length; n2++) Ue(e, t.charCodeAt(n2));
-}
-function Ue(e, t) {
-  let [n, i, r] = e.keys;
-  e.crcKey0.append([t]), n = ~e.crcKey0.get(), i = Te(Math.imul(Te(i + Ee(n)), 134775813) + 1), e.crcKey2.append([i >>> 24]), r = ~e.crcKey2.get(), e.keys = [n, i, r];
-}
-function De(e) {
-  const t = 2 | e.keys[2];
-  return Ee(Math.imul(t, 1 ^ t) >>> 8);
-}
-function Ee(e) {
-  return 255 & e;
-}
-function Te(e) {
-  return 4294967295 & e;
-}
-const Fe = "deflate-raw";
-class Oe extends TransformStream {
-  constructor(e, { chunkSize: t, CompressionStream: n, CompressionStreamNative: i }) {
-    super({});
-    const { compressed: r, encrypted: a, useCompressionStream: s, zipCrypto: o, signed: l, level: c } = e, u = this;
-    let d, f, h = We(super.readable);
-    a && !o || !l || (d = new j(), h = Le(h, d)), r && (h = Me(h, s, { level: c, chunkSize: t }, i, n)), a && (o ? h = Le(h, new ve(e)) : (f = new he(e), h = Le(h, f))), je(u, h, () => {
-      let e2;
-      a && !o && (e2 = f.signature), a && !o || !l || (e2 = new DataView(d.value.buffer).getUint32(0)), u.signature = e2;
-    });
-  }
-}
-class Ce extends TransformStream {
-  constructor(e, { chunkSize: t, DecompressionStream: n, DecompressionStreamNative: i }) {
-    super({});
-    const { zipCrypto: r, encrypted: a, signed: s, signature: o, compressed: l, useCompressionStream: c } = e;
-    let u, d, f = We(super.readable);
-    a && (r ? f = Le(f, new ke(e)) : (d = new fe(e), f = Le(f, d))), l && (f = Me(f, c, { chunkSize: t }, i, n)), a && !r || !s || (u = new j(), f = Le(f, u)), je(this, f, () => {
-      if ((!a || r) && s) {
-        const e2 = new DataView(u.value.buffer);
-        if (o != e2.getUint32(0, false)) throw new Error(H);
-      }
-    });
-  }
-}
-function We(e) {
-  return Le(e, new TransformStream({ transform(e2, t) {
-    e2 && e2.length && t.enqueue(e2);
-  } }));
-}
-function je(e, t, n) {
-  t = Le(t, new TransformStream({ flush: n })), Object.defineProperty(e, "readable", { get: () => t });
-}
-function Me(e, t, n, i, r) {
-  try {
-    e = Le(e, new (t && i ? i : r)(Fe, n));
-  } catch (i2) {
-    if (!t) return e;
-    try {
-      e = Le(e, new r(Fe, n));
-    } catch (t2) {
-      return e;
-    }
-  }
-  return e;
-}
-function Le(e, t) {
-  return e.pipeThrough(t);
-}
-const Pe = "message", Re = "start", Be = "pull", Ie = "data", Ne = "close", Ve = "inflate";
-class qe extends TransformStream {
-  constructor(e, t) {
-    super({});
-    const n = this, { codecType: i } = e;
-    let r;
-    i.startsWith("deflate") ? r = Oe : i.startsWith(Ve) && (r = Ce);
-    let a = 0, s = 0;
-    const o = new r(e, t), l = super.readable, c = new TransformStream({ transform(e2, t2) {
-      e2 && e2.length && (s += e2.length, t2.enqueue(e2));
-    }, flush() {
-      Object.assign(n, { inputSize: s });
-    } }), u = new TransformStream({ transform(e2, t2) {
-      e2 && e2.length && (a += e2.length, t2.enqueue(e2));
-    }, flush() {
-      const { signature: e2 } = o;
-      Object.assign(n, { signature: e2, outputSize: a, inputSize: s });
-    } });
-    Object.defineProperty(n, "readable", { get: () => l.pipeThrough(c).pipeThrough(o).pipeThrough(u) });
-  }
-}
-class He extends TransformStream {
-  constructor(e) {
-    let t;
-    super({ transform: function n(i, r) {
-      if (t) {
-        const e2 = new Uint8Array(t.length + i.length);
-        e2.set(t), e2.set(i, t.length), i = e2, t = null;
-      }
-      i.length > e ? (r.enqueue(i.slice(0, e)), n(i.slice(e), r)) : t = i;
-    }, flush(e2) {
-      t && t.length && e2.enqueue(t);
-    } });
-  }
-}
-let Ke = typeof Worker != z$1;
-class Ze {
-  constructor(e, { readable: t, writable: n }, { options: i, config: r, streamOptions: a, useWebWorkers: s, transferStreams: o, scripts: l }, c) {
-    const { signal: u } = a;
-    return Object.assign(e, { busy: true, readable: t.pipeThrough(new He(r.chunkSize)).pipeThrough(new Ge(t, a), { signal: u }), writable: n, options: Object.assign({}, i), scripts: l, transferStreams: o, terminate: () => new Promise((t2) => {
-      const { worker: n2, busy: i2 } = e;
-      n2 ? (i2 ? e.resolveTerminated = t2 : (n2.terminate(), t2()), e.interface = null) : t2();
-    }), onTaskFinished() {
-      const { resolveTerminated: t2 } = e;
-      t2 && (e.resolveTerminated = null, e.terminated = true, e.worker.terminate(), t2()), e.busy = false, c(e);
-    } }), (s && Ke ? Xe : Qe)(e, r);
-  }
-}
-class Ge extends TransformStream {
-  constructor(e, { onstart: t, onprogress: n, size: i, onend: r }) {
-    let a = 0;
-    super({ async start() {
-      t && await Je(t, i);
-    }, async transform(e2, t2) {
-      a += e2.length, n && await Je(n, a, i), t2.enqueue(e2);
-    }, async flush() {
-      e.size = a, r && await Je(r, a);
-    } });
-  }
-}
-async function Je(e, ...t) {
-  try {
-    await e(...t);
-  } catch (e2) {
-  }
-}
-function Qe(e, t) {
-  return { run: () => async function({ options: e2, readable: t2, writable: n, onTaskFinished: i }, r) {
-    try {
-      const i2 = new qe(e2, r);
-      await t2.pipeThrough(i2).pipeTo(n, { preventClose: true, preventAbort: true });
-      const { signature: a, inputSize: s, outputSize: o } = i2;
-      return { signature: a, inputSize: s, outputSize: o };
-    } finally {
-      i();
-    }
-  }(e, t) };
-}
-function Xe(e, t) {
-  const { baseURL: n, chunkSize: i } = t;
-  if (!e.interface) {
-    let r;
-    try {
-      r = function(e2, t2, n2) {
-        const i2 = { type: "module" };
-        let r2, a;
-        typeof e2 == A$1 && (e2 = e2());
-        try {
-          r2 = new URL(e2, t2);
-        } catch (t3) {
-          r2 = e2;
-        }
-        if (Ye) try {
-          a = new Worker(r2);
-        } catch (e3) {
-          Ye = false, a = new Worker(r2, i2);
-        }
-        else a = new Worker(r2, i2);
-        return a.addEventListener(Pe, (e3) => async function({ data: e4 }, t3) {
-          const { type: n3, value: i3, messageId: r3, result: a2, error: s } = e4, { reader: o, writer: l, resolveResult: c, rejectResult: u, onTaskFinished: d } = t3;
-          try {
-            if (s) {
-              const { message: e5, stack: t4, code: n4, name: i4 } = s, r4 = new Error(e5);
-              Object.assign(r4, { stack: t4, code: n4, name: i4 }), f(r4);
-            } else {
-              if (n3 == Be) {
-                const { value: e5, done: n4 } = await o.read();
-                et({ type: Ie, value: e5, done: n4, messageId: r3 }, t3);
-              }
-              n3 == Ie && (await l.ready, await l.write(new Uint8Array(i3)), et({ type: "ack", messageId: r3 }, t3)), n3 == Ne && f(null, a2);
-            }
-          } catch (s2) {
-            et({ type: Ne, messageId: r3 }, t3), f(s2);
-          }
-          function f(e5, t4) {
-            e5 ? u(e5) : c(t4), l && l.releaseLock(), d();
-          }
-        }(e3, n2)), a;
-      }(e.scripts[0], n, e);
-    } catch (n2) {
-      return Ke = false, Qe(e, t);
-    }
-    Object.assign(e, { worker: r, interface: { run: () => async function(e2, t2) {
-      let n2, i2;
-      const r2 = new Promise((e3, t3) => {
-        n2 = e3, i2 = t3;
-      });
-      Object.assign(e2, { reader: null, writer: null, resolveResult: n2, rejectResult: i2, result: r2 });
-      const { readable: a, options: s, scripts: o } = e2, { writable: l, closed: c } = function(e3) {
-        let t3;
-        const n3 = new Promise((e4) => t3 = e4), i3 = new WritableStream({ async write(t4) {
-          const n4 = e3.getWriter();
-          await n4.ready, await n4.write(t4), n4.releaseLock();
-        }, close() {
-          t3();
-        }, abort: (t4) => e3.getWriter().abort(t4) });
-        return { writable: i3, closed: n3 };
-      }(e2.writable), u = et({ type: Re, scripts: o.slice(1), options: s, config: t2, readable: a, writable: l }, e2);
-      u || Object.assign(e2, { reader: a.getReader(), writer: l.getWriter() });
-      const d = await r2;
-      u || await l.getWriter().close();
-      return await c, d;
-    }(e, { chunkSize: i }) } });
-  }
-  return e.interface;
-}
-let Ye = true, $e = true;
-function et(e, { worker: t, writer: n, onTaskFinished: i, transferStreams: r }) {
-  try {
-    let { value: n2, readable: i2, writable: a } = e;
-    const s = [];
-    if (n2 && (n2.byteLength < n2.buffer.byteLength ? e.value = n2.buffer.slice(0, n2.byteLength) : e.value = n2.buffer, s.push(e.value)), r && $e ? (i2 && s.push(i2), a && s.push(a)) : e.readable = e.writable = null, s.length) try {
-      return t.postMessage(e, s), true;
-    } catch (n3) {
-      $e = false, e.readable = e.writable = null, t.postMessage(e);
-    }
-    else t.postMessage(e);
-  } catch (e2) {
-    throw n && n.releaseLock(), i(), e2;
-  }
-}
-let tt = [];
-const nt = [];
-let it = 0;
-async function rt(e, t) {
-  const { options: n, config: i } = t, { transferStreams: r, useWebWorkers: a, useCompressionStream: s, codecType: o, compressed: l, signed: c, encrypted: u } = n, { workerScripts: d, maxWorkers: f } = i;
-  t.transferStreams = r || r === S;
-  const h = !(l || c || u || t.transferStreams);
-  return t.useWebWorkers = !h && (a || a === S && i.useWebWorkers), t.scripts = t.useWebWorkers && d ? d[o] : [], n.useCompressionStream = s || s === S && i.useCompressionStream, (await async function() {
-    const n2 = tt.find((e2) => !e2.busy);
-    if (n2) return at(n2), new Ze(n2, e, t, w);
-    if (tt.length < f) {
-      const n3 = { indexWorker: it };
-      return it++, tt.push(n3), new Ze(n3, e, t, w);
-    }
-    return new Promise((n3) => nt.push({ resolve: n3, stream: e, workerOptions: t }));
-  }()).run();
-  function w(e2) {
-    if (nt.length) {
-      const [{ resolve: t2, stream: n2, workerOptions: i2 }] = nt.splice(0, 1);
-      t2(new Ze(e2, n2, i2, w));
-    } else e2.worker ? (at(e2), function(e3, t2) {
-      const { config: n2 } = t2, { terminateWorkerTimeout: i2 } = n2;
-      Number.isFinite(i2) && i2 >= 0 && (e3.terminated ? e3.terminated = false : e3.terminateTimeout = setTimeout(async () => {
-        tt = tt.filter((t3) => t3 != e3);
-        try {
-          await e3.terminate();
-        } catch (e4) {
-        }
-      }, i2));
-    }(e2, t)) : tt = tt.filter((t2) => t2 != e2);
-  }
-}
-function at(e) {
-  const { terminateTimeout: t } = e;
-  t && (clearTimeout(t), e.terminateTimeout = null);
-}
-const st = 65536, ot = "writable";
-class lt {
-  constructor() {
-    this.size = 0;
-  }
-  init() {
-    this.initialized = true;
-  }
-}
-class ct extends lt {
-  get readable() {
-    const e = this, { chunkSize: t = st } = e, n = new ReadableStream({ start() {
-      this.chunkOffset = 0;
-    }, async pull(i) {
-      const { offset: r = 0, size: a, diskNumberStart: s } = n, { chunkOffset: o } = this;
-      i.enqueue(await pt(e, r + o, Math.min(t, a - o), s)), o + t > a ? i.close() : this.chunkOffset += t;
-    } });
-    return n;
-  }
-}
-class ut extends ct {
-  constructor(e) {
-    super(), Object.assign(this, { blob: e, size: e.size });
-  }
-  async readUint8Array(e, t) {
-    const n = this, i = e + t, r = e || i < n.size ? n.blob.slice(e, i) : n.blob;
-    let a = await r.arrayBuffer();
-    return a.byteLength > t && (a = a.slice(e, i)), new Uint8Array(a);
-  }
-}
-class dt extends lt {
-  constructor(e) {
-    super();
-    const t = new TransformStream(), n = [];
-    e && n.push(["Content-Type", e]), Object.defineProperty(this, ot, { get: () => t.writable }), this.blob = new Response(t.readable, { headers: n }).blob();
-  }
-  getData() {
-    return this.blob;
-  }
-}
-class ft extends dt {
-  constructor(e) {
-    super(e), Object.assign(this, { encoding: e, utf8: !e || "utf-8" == e.toLowerCase() });
-  }
-  async getData() {
-    const { encoding: e, utf8: t } = this, n = await super.getData();
-    if (n.text && t) return n.text();
-    {
-      const t2 = new FileReader();
-      return new Promise((i, r) => {
-        Object.assign(t2, { onload: ({ target: e2 }) => i(e2.result), onerror: () => r(t2.error) }), t2.readAsText(n, e);
-      });
-    }
-  }
-}
-class ht extends ct {
-  constructor(e) {
-    super(), this.readers = e;
-  }
-  async init() {
-    const e = this, { readers: t } = e;
-    e.lastDiskNumber = 0, e.lastDiskOffset = 0, await Promise.all(t.map(async (n, i) => {
-      await n.init(), i != t.length - 1 && (e.lastDiskOffset += n.size), e.size += n.size;
-    })), super.init();
-  }
-  async readUint8Array(e, t, n = 0) {
-    const i = this, { readers: r } = this;
-    let a, s = n;
-    -1 == s && (s = r.length - 1);
-    let o = e;
-    for (; o >= r[s].size; ) o -= r[s].size, s++;
-    const l = r[s], c = l.size;
-    if (o + t <= c) a = await pt(l, o, t);
-    else {
-      const r2 = c - o;
-      a = new Uint8Array(t), a.set(await pt(l, o, r2)), a.set(await i.readUint8Array(e + r2, t - r2, n), r2);
-    }
-    return i.lastDiskNumber = Math.max(s, i.lastDiskNumber), a;
-  }
-}
-class wt extends lt {
-  constructor(e, t = 4294967295) {
-    super();
-    const n = this;
-    let i, r, a;
-    Object.assign(n, { diskNumber: 0, diskOffset: 0, size: 0, maxSize: t, availableSize: t });
-    const s = new WritableStream({ async write(t2) {
-      const { availableSize: s2 } = n;
-      if (a) t2.length >= s2 ? (await o(t2.slice(0, s2)), await l(), n.diskOffset += i.size, n.diskNumber++, a = null, await this.write(t2.slice(s2))) : await o(t2);
-      else {
-        const { value: s3, done: o2 } = await e.next();
-        if (o2 && !s3) throw new Error("Writer iterator completed too soon");
-        i = s3, i.size = 0, i.maxSize && (n.maxSize = i.maxSize), n.availableSize = n.maxSize, await _t(i), r = s3.writable, a = r.getWriter(), await this.write(t2);
-      }
-    }, async close() {
-      await a.ready, await l();
-    } });
-    async function o(e2) {
-      const t2 = e2.length;
-      t2 && (await a.ready, await a.write(e2), i.size += t2, n.size += t2, n.availableSize -= t2);
-    }
-    async function l() {
-      r.size = i.size, await a.close();
-    }
-    Object.defineProperty(n, ot, { get: () => s });
-  }
-}
-async function _t(e, t) {
-  if (!e.init || e.initialized) return Promise.resolve();
-  await e.init(t);
-}
-function bt(e) {
-  return Array.isArray(e) && (e = new ht(e)), e instanceof ReadableStream && (e = { readable: e }), e;
-}
-function pt(e, t, n, i) {
-  return e.readUint8Array(t, n, i);
-}
-const mt = "\0☺☻♥♦♣♠•◘○◙♂♀♪♫☼►◄↕‼¶§▬↨↑↓→←∟↔▲▼ !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~⌂ÇüéâäàåçêëèïîìÄÅÉæÆôöòûùÿÖÜ¢£¥₧ƒáíóúñѪº¿⌐¬½¼¡«»░▒▓│┤╡╢╖╕╣║╗╝╜╛┐└┴┬├─┼╞╟╚╔╩╦╠═╬╧╨╤╥╙╘╒╓╫╪┘┌█▄▌▐▀αßΓπΣσµτΦΘΩδ∞φε∩≡±≥≤⌠⌡÷≈°∙·√ⁿ²■ ".split(""), gt = 256 == mt.length;
-function yt(e, t) {
-  return t && "cp437" == t.trim().toLowerCase() ? function(e2) {
-    if (gt) {
-      let t2 = "";
-      for (let n = 0; n < e2.length; n++) t2 += mt[e2[n]];
-      return t2;
-    }
-    return new TextDecoder().decode(e2);
-  }(e) : new TextDecoder(t).decode(e);
-}
-const xt = "filename", kt = "rawFilename", vt = "comment", St = "rawComment", zt = "uncompressedSize", At = "compressedSize", Ut = "offset", Dt = "diskNumberStart", Et = "lastModDate", Tt = "rawLastModDate", Ft = "lastAccessDate", Ot = "rawLastAccessDate", Ct = "creationDate", Wt = "rawCreationDate", jt = [xt, kt, At, zt, Et, Tt, vt, St, Ft, Ct, Ut, Dt, Dt, "internalFileAttribute", "externalFileAttribute", "msDosCompatible", "zip64", "encrypted", "version", "versionMadeBy", "zipCrypto", "directory", "bitFlag", "signature", "filenameUTF8", "commentUTF8", "compressionMethod", "extraField", "rawExtraField", "extraFieldZip64", "extraFieldUnicodePath", "extraFieldUnicodeComment", "extraFieldAES", "extraFieldNTFS", "extraFieldExtendedTimestamp"];
-class Mt {
-  constructor(e) {
-    jt.forEach((t) => this[t] = e[t]);
-  }
-}
-const Lt = "File format is not recognized", Pt = "Zip64 extra field not found", Rt = "Compression method not supported", Bt = "Split zip file", It = "utf-8", Nt = "cp437", Vt = [[zt, g$1], [At, g$1], [Ut, g$1], [Dt, y$1]], qt = { [y$1]: { getValue: tn, bytes: 4 }, [g$1]: { getValue: nn, bytes: 8 } };
-class Ht {
-  constructor(e, t = {}) {
-    Object.assign(this, { reader: bt(e), options: t, config: T$1 });
-  }
-  async *getEntriesGenerator(e = {}) {
-    const t = this;
-    let { reader: n } = t;
-    const { config: i } = t;
-    if (await _t(n), n.size !== S && n.readUint8Array || (n = new ut(await new Response(n.readable).blob()), await _t(n)), n.size < v$1) throw new Error(Lt);
-    n.chunkSize = function(e2) {
-      return Math.max(e2.chunkSize, 64);
-    }(i);
-    const r = await async function(e2, t2, n2, i2, r2) {
-      const a2 = new Uint8Array(4);
-      !function(e3, t3, n3) {
-        e3.setUint32(t3, n3, true);
-      }(rn(a2), 0, t2);
-      const s2 = i2 + r2;
-      return await o2(i2) || await o2(Math.min(s2, n2));
-      async function o2(t3) {
-        const r3 = n2 - t3, s3 = await pt(e2, r3, t3);
-        for (let e3 = s3.length - i2; e3 >= 0; e3--) if (s3[e3] == a2[0] && s3[e3 + 1] == a2[1] && s3[e3 + 2] == a2[2] && s3[e3 + 3] == a2[3]) return { offset: r3 + e3, buffer: s3.slice(e3, e3 + i2).buffer };
-      }
-    }(n, 101010256, n.size, v$1, 1048560);
-    if (!r) {
-      throw 134695760 == tn(rn(await pt(n, 0, 4))) ? new Error(Bt) : new Error("End of central directory not found");
-    }
-    const a = rn(r);
-    let s = tn(a, 12), o = tn(a, 16);
-    const l = r.offset, c = en(a, 20), u = l + v$1 + c;
-    let d = en(a, 4);
-    const f = n.lastDiskNumber || 0;
-    let h = en(a, 6), w = en(a, 8), _2 = 0, b = 0;
-    if (o == g$1 || s == g$1 || w == y$1 || h == y$1) {
-      const e2 = rn(await pt(n, r.offset - 20, 20));
-      if (117853008 == tn(e2, 0)) {
-        o = nn(e2, 8);
-        let t2 = await pt(n, o, 56, -1), i2 = rn(t2);
-        const a2 = r.offset - 20 - 56;
-        if (tn(i2, 0) != k$1 && o != a2) {
-          const e3 = o;
-          o = a2, _2 = o - e3, t2 = await pt(n, o, 56, -1), i2 = rn(t2);
-        }
-        if (tn(i2, 0) != k$1) throw new Error("End of Zip64 central directory locator not found");
-        d == y$1 && (d = tn(i2, 16)), h == y$1 && (h = tn(i2, 20)), w == y$1 && (w = nn(i2, 32)), s == g$1 && (s = nn(i2, 40)), o -= s;
-      }
-    }
-    if (o >= n.size && (_2 = n.size - o - s - v$1, o = n.size - s - v$1), f != d) throw new Error(Bt);
-    if (o < 0) throw new Error(Lt);
-    let p = 0, m = await pt(n, o, s, h), z = rn(m);
-    if (s) {
-      const e2 = r.offset - s;
-      if (tn(z, p) != x$1 && o != e2) {
-        const t2 = o;
-        o = e2, _2 += o - t2, m = await pt(n, o, s, h), z = rn(m);
-      }
-    }
-    const A = r.offset - o - (n.lastDiskOffset || 0);
-    if (s != A && A >= 0 && (s = A, m = await pt(n, o, s, h), z = rn(m)), o < 0 || o >= n.size) throw new Error(Lt);
-    const U2 = Qt(t, e, "filenameEncoding"), D2 = Qt(t, e, "commentEncoding");
-    for (let r2 = 0; r2 < w; r2++) {
-      const a2 = new Kt(n, i, t.options);
-      if (tn(z, p) != x$1) throw new Error("Central directory header not found");
-      Zt(a2, z, p + 6);
-      const s2 = Boolean(a2.bitFlag.languageEncodingFlag), o2 = p + 46, l2 = o2 + a2.filenameLength, c2 = l2 + a2.extraFieldLength, u2 = en(z, p + 4), d2 = true, f2 = m.subarray(o2, l2), h2 = en(z, p + 32), g = c2 + h2, y = m.subarray(c2, g), k = s2, v = s2, A2 = !(16 & ~$t(z, p + 38)), E2 = tn(z, p + 42) + _2;
-      Object.assign(a2, { versionMadeBy: u2, msDosCompatible: d2, compressedSize: 0, uncompressedSize: 0, commentLength: h2, directory: A2, offset: E2, diskNumberStart: en(z, p + 34), internalFileAttribute: en(z, p + 36), externalFileAttribute: tn(z, p + 38), rawFilename: f2, filenameUTF8: k, commentUTF8: v, rawExtraField: m.subarray(l2, c2) });
-      const T2 = Qt(t, e, "decodeText") || yt, F2 = k ? It : U2 || Nt, O2 = v ? It : D2 || Nt;
-      let C2 = T2(f2, F2);
-      C2 === S && (C2 = yt(f2, F2));
-      let W2 = T2(y, O2);
-      W2 === S && (W2 = yt(y, O2)), Object.assign(a2, { rawComment: y, filename: C2, comment: W2, directory: A2 || C2.endsWith("/") }), b = Math.max(E2, b), await Gt(a2, a2, z, p + 6), a2.zipCrypto = a2.encrypted && !a2.extraFieldAES;
-      const j2 = new Mt(a2);
-      j2.getData = (e2, t2) => a2.getData(e2, j2, t2), p = g;
-      const { onprogress: M2 } = e;
-      if (M2) try {
-        await M2(r2 + 1, w, new Mt(a2));
-      } catch (e2) {
-      }
-      yield j2;
-    }
-    const E = Qt(t, e, "extractPrependedData"), T = Qt(t, e, "extractAppendedData");
-    return E && (t.prependedData = b > 0 ? await pt(n, 0, b) : new Uint8Array()), t.comment = c ? await pt(n, l + v$1, c) : new Uint8Array(), T && (t.appendedData = u < n.size ? await pt(n, u, n.size - u) : new Uint8Array()), true;
-  }
-  async getEntries(e = {}) {
-    const t = [];
-    for await (const n of this.getEntriesGenerator(e)) t.push(n);
-    return t;
-  }
-  async close() {
-  }
-}
-class Kt {
-  constructor(e, t, n) {
-    Object.assign(this, { reader: e, config: t, options: n });
-  }
-  async getData(e, t, n = {}) {
-    const i = this, { reader: r, offset: a, diskNumberStart: s, extraFieldAES: o, compressionMethod: l, config: c, bitFlag: u, signature: d, rawLastModDate: f, uncompressedSize: h, compressedSize: w } = i, _2 = t.localDirectory = {}, b = rn(await pt(r, a, 30, s));
-    let p = Qt(i, n, "password"), m = Qt(i, n, "rawPassword");
-    const g = Qt(i, n, "passThrough");
-    if (p = p && p.length && p, m = m && m.length && m, o && 99 != o.originalCompressionMethod) throw new Error(Rt);
-    if (0 != l && 8 != l && !g) throw new Error(Rt);
-    if (67324752 != tn(b, 0)) throw new Error("Local file header not found");
-    Zt(_2, b, 4), _2.rawExtraField = _2.extraFieldLength ? await pt(r, a + 30 + _2.filenameLength, _2.extraFieldLength, s) : new Uint8Array(), await Gt(i, _2, b, 4, true), Object.assign(t, { lastAccessDate: _2.lastAccessDate, creationDate: _2.creationDate });
-    const y = i.encrypted && _2.encrypted && !g, x = y && !o;
-    if (g || (t.zipCrypto = x), y) {
-      if (!x && o.strength === S) throw new Error("Encryption method not supported");
-      if (!p && !m) throw new Error("File contains encrypted entry");
-    }
-    const k = a + 30 + _2.filenameLength + _2.extraFieldLength, v = w, z = r.readable;
-    Object.assign(z, { diskNumberStart: s, offset: k, size: v });
-    const U2 = Qt(i, n, "signal"), D2 = Qt(i, n, "checkPasswordOnly");
-    D2 && (e = new WritableStream()), e = function(e2) {
-      e2.writable === S && typeof e2.next == A$1 && (e2 = new wt(e2)), e2 instanceof WritableStream && (e2 = { writable: e2 });
-      const { writable: t2 } = e2;
-      return t2.size === S && (t2.size = 0), e2 instanceof wt || Object.assign(e2, { diskNumber: 0, diskOffset: 0, availableSize: 1 / 0, maxSize: 1 / 0 }), e2;
-    }(e), await _t(e, g ? w : h);
-    const { writable: E } = e, { onstart: T, onprogress: F2, onend: O2 } = n, C2 = { options: { codecType: Ve, password: p, rawPassword: m, zipCrypto: x, encryptionStrength: o && o.strength, signed: Qt(i, n, "checkSignature") && !g, passwordVerification: x && (u.dataDescriptor ? f >>> 8 & 255 : d >>> 24 & 255), signature: d, compressed: 0 != l && !g, encrypted: i.encrypted && !g, useWebWorkers: Qt(i, n, "useWebWorkers"), useCompressionStream: Qt(i, n, "useCompressionStream"), transferStreams: Qt(i, n, "transferStreams"), checkPasswordOnly: D2 }, config: c, streamOptions: { signal: U2, size: v, onstart: T, onprogress: F2, onend: O2 } };
-    let W2 = 0;
-    try {
-      ({ outputSize: W2 } = await rt({ readable: z, writable: E }, C2));
-    } catch (e2) {
-      if (!D2 || e2.message != K) throw e2;
-    } finally {
-      const e2 = Qt(i, n, "preventClose");
-      E.size += W2, e2 || E.locked || await E.getWriter().close();
-    }
-    return D2 ? S : e.getData ? e.getData() : E;
-  }
-}
-function Zt(e, t, n) {
-  const i = e.rawBitFlag = en(t, n + 2), r = !(1 & ~i), a = tn(t, n + 6);
-  Object.assign(e, { encrypted: r, version: en(t, n), bitFlag: { level: (6 & i) >> 1, dataDescriptor: !(8 & ~i), languageEncodingFlag: !(2048 & ~i) }, rawLastModDate: a, lastModDate: Xt(a), filenameLength: en(t, n + 22), extraFieldLength: en(t, n + 24) });
-}
-async function Gt(e, t, n, i, r) {
-  const { rawExtraField: a } = t, s = t.extraField = /* @__PURE__ */ new Map(), o = rn(new Uint8Array(a));
-  let l = 0;
-  try {
-    for (; l < a.length; ) {
-      const e2 = en(o, l), t2 = en(o, l + 2);
-      s.set(e2, { type: e2, data: a.slice(l + 4, l + 4 + t2) }), l += 4 + t2;
-    }
-  } catch (e2) {
-  }
-  const c = en(n, i + 4);
-  Object.assign(t, { signature: tn(n, i + 10), uncompressedSize: tn(n, i + 18), compressedSize: tn(n, i + 14) });
-  const u = s.get(1);
-  u && (!function(e2, t2) {
-    t2.zip64 = true;
-    const n2 = rn(e2.data), i2 = Vt.filter(([e3, n3]) => t2[e3] == n3);
-    for (let r2 = 0, a2 = 0; r2 < i2.length; r2++) {
-      const [s2, o2] = i2[r2];
-      if (t2[s2] == o2) {
-        const i3 = qt[o2];
-        t2[s2] = e2[s2] = i3.getValue(n2, a2), a2 += i3.bytes;
-      } else if (e2[s2]) throw new Error(Pt);
-    }
-  }(u, t), t.extraFieldZip64 = u);
-  const d = s.get(28789);
-  d && (await Jt(d, xt, kt, t, e), t.extraFieldUnicodePath = d);
-  const f = s.get(25461);
-  f && (await Jt(f, vt, St, t, e), t.extraFieldUnicodeComment = f);
-  const h = s.get(39169);
-  h ? (!function(e2, t2, n2) {
-    const i2 = rn(e2.data), r2 = $t(i2, 4);
-    Object.assign(e2, { vendorVersion: $t(i2, 0), vendorId: $t(i2, 2), strength: r2, originalCompressionMethod: n2, compressionMethod: en(i2, 5) }), t2.compressionMethod = e2.compressionMethod;
-  }(h, t, c), t.extraFieldAES = h) : t.compressionMethod = c;
-  const w = s.get(10);
-  w && (!function(e2, t2) {
-    const n2 = rn(e2.data);
-    let i2, r2 = 4;
-    try {
-      for (; r2 < e2.data.length && !i2; ) {
-        const t3 = en(n2, r2), a2 = en(n2, r2 + 2);
-        1 == t3 && (i2 = e2.data.slice(r2 + 4, r2 + 4 + a2)), r2 += 4 + a2;
-      }
-    } catch (e3) {
-    }
-    try {
-      if (i2 && 24 == i2.length) {
-        const n3 = rn(i2), r3 = n3.getBigUint64(0, true), a2 = n3.getBigUint64(8, true), s2 = n3.getBigUint64(16, true);
-        Object.assign(e2, { rawLastModDate: r3, rawLastAccessDate: a2, rawCreationDate: s2 });
-        const o2 = Yt(r3), l2 = Yt(a2), c2 = { lastModDate: o2, lastAccessDate: l2, creationDate: Yt(s2) };
-        Object.assign(e2, c2), Object.assign(t2, c2);
-      }
-    } catch (e3) {
-    }
-  }(w, t), t.extraFieldNTFS = w);
-  const _2 = s.get(21589);
-  _2 && (!function(e2, t2, n2) {
-    const i2 = rn(e2.data), r2 = $t(i2, 0), a2 = [], s2 = [];
-    n2 ? (1 & ~r2 || (a2.push(Et), s2.push(Tt)), 2 & ~r2 || (a2.push(Ft), s2.push(Ot)), 4 & ~r2 || (a2.push(Ct), s2.push(Wt))) : e2.data.length >= 5 && (a2.push(Et), s2.push(Tt));
-    let o2 = 1;
-    a2.forEach((n3, r3) => {
-      if (e2.data.length >= o2 + 4) {
-        const a3 = tn(i2, o2);
-        t2[n3] = e2[n3] = new Date(1e3 * a3);
-        const l2 = s2[r3];
-        e2[l2] = a3;
-      }
-      o2 += 4;
-    });
-  }(_2, t, r), t.extraFieldExtendedTimestamp = _2);
-  const b = s.get(6534);
-  b && (t.extraFieldUSDZ = b);
-}
-async function Jt(e, t, n, i, r) {
-  const a = rn(e.data), s = new W();
-  s.append(r[n]);
-  const o = rn(new Uint8Array(4));
-  o.setUint32(0, s.get(), true);
-  const l = tn(a, 1);
-  Object.assign(e, { version: $t(a, 0), [t]: yt(e.data.subarray(5)), valid: !r.bitFlag.languageEncodingFlag && l == tn(o, 0) }), e.valid && (i[t] = e[t], i[t + "UTF8"] = true);
-}
-function Qt(e, t, n) {
-  return t[n] === S ? e.options[n] : t[n];
-}
-function Xt(e) {
-  const t = (4294901760 & e) >> 16, n = 65535 & e;
-  try {
-    return new Date(1980 + ((65024 & t) >> 9), ((480 & t) >> 5) - 1, 31 & t, (63488 & n) >> 11, (2016 & n) >> 5, 2 * (31 & n), 0);
-  } catch (e2) {
-  }
-}
-function Yt(e) {
-  return new Date(Number(e / BigInt(1e4) - BigInt(116444736e5)));
-}
-function $t(e, t) {
-  return e.getUint8(t);
-}
-function en(e, t) {
-  return e.getUint16(t, true);
-}
-function tn(e, t) {
-  return e.getUint32(t, true);
-}
-function nn(e, t) {
-  return Number(e.getBigUint64(t, true));
-}
-function rn(e) {
-  return new DataView(e.buffer);
-}
-F({ Inflate: function(e) {
-  const t = new m$1(), i = e && e.chunkSize ? Math.floor(2 * e.chunkSize) : 131072, r = new Uint8Array(i);
-  let a = false;
-  t.inflateInit(), t.next_out = r, this.append = function(e2, s) {
-    const o = [];
-    let l, c, u = 0, d = 0, f = 0;
-    if (0 !== e2.length) {
-      t.next_in_index = 0, t.next_in = e2, t.avail_in = e2.length;
-      do {
-        if (t.next_out_index = 0, t.avail_out = i, 0 !== t.avail_in || a || (t.next_in_index = 0, a = true), l = t.inflate(0), a && l === n$1) {
-          if (0 !== t.avail_in) throw new Error("inflating: bad input");
-        } else if (0 !== l && 1 !== l) throw new Error("inflating: " + t.msg);
-        if ((a || 1 === l) && t.avail_in === e2.length) throw new Error("inflating: bad input");
-        t.next_out_index && (t.next_out_index === i ? o.push(new Uint8Array(r)) : o.push(r.subarray(0, t.next_out_index))), f += t.next_out_index, s && t.next_in_index > 0 && t.next_in_index != u && (s(t.next_in_index), u = t.next_in_index);
-      } while (t.avail_in > 0 || 0 === t.avail_out);
-      return o.length > 1 ? (c = new Uint8Array(f), o.forEach(function(e3) {
-        c.set(e3, d), d += e3.length;
-      })) : c = o[0] ? new Uint8Array(o[0]) : new Uint8Array(), c;
-    }
-  }, this.flush = function() {
-    t.inflateEnd();
-  };
-} });
-exports.BlobReader = ut;
-exports.BlobWriter = dt;
-exports.TextWriter = ft;
-exports.ZipReader = Ht;
-exports.configure = F;