cm-reporting 0.1.0

package/dist/browser-CFE8q4oi.js

@@ -0,0 +1,604 @@
+var A = Uint8Array, R = Uint16Array, Tr = Int32Array, gr = new A([
+  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,
+  /* unused */
+  0,
+  0,
+  /* impossible */
+  0
+]), wr = new A([
+  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,
+  /* unused */
+  0,
+  0
+]), Cr = new A([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Hr = function(r, e) {
+  for (var n = new R(31), a = 0; a < 31; ++a)
+    n[a] = e += 1 << r[a - 1];
+  for (var v = new Tr(n[30]), a = 1; a < 30; ++a)
+    for (var f = n[a]; f < n[a + 1]; ++f)
+      v[f] = f - n[a] << 5 | a;
+  return { b: n, r: v };
+}, Or = Hr(gr, 2), Yr = Or.b, Sr = Or.r;
+Yr[28] = 258, Sr[258] = 28;
+var Gr = Hr(wr, 0), Qr = Gr.b, Br = Gr.r, zr = new R(32768);
+for (var y = 0; y < 32768; ++y) {
+  var b = (y & 43690) >> 1 | (y & 21845) << 1;
+  b = (b & 52428) >> 2 | (b & 13107) << 2, b = (b & 61680) >> 4 | (b & 3855) << 4, zr[y] = ((b & 65280) >> 8 | (b & 255) << 8) >> 1;
+}
+var j = (function(r, e, n) {
+  for (var a = r.length, v = 0, f = new R(e); v < a; ++v)
+    r[v] && ++f[r[v] - 1];
+  var o = new R(e);
+  for (v = 1; v < e; ++v)
+    o[v] = o[v - 1] + f[v - 1] << 1;
+  var h;
+  if (n) {
+    h = new R(1 << e);
+    var t = 15 - e;
+    for (v = 0; v < a; ++v)
+      if (r[v])
+        for (var w = v << 4 | r[v], l = e - r[v], i = o[r[v] - 1]++ << l, u = i | (1 << l) - 1; i <= u; ++i)
+          h[zr[i] >> t] = w;
+  } else
+    for (h = new R(a), v = 0; v < a; ++v)
+      r[v] && (h[v] = zr[o[r[v] - 1]++] >> 15 - r[v]);
+  return h;
+}), d = new A(288);
+for (var y = 0; y < 144; ++y)
+  d[y] = 8;
+for (var y = 144; y < 256; ++y)
+  d[y] = 9;
+for (var y = 256; y < 280; ++y)
+  d[y] = 7;
+for (var y = 280; y < 288; ++y)
+  d[y] = 8;
+var or = new A(32);
+for (var y = 0; y < 32; ++y)
+  or[y] = 5;
+var Rr = /* @__PURE__ */ j(d, 9, 0), Vr = /* @__PURE__ */ j(d, 9, 1), Wr = /* @__PURE__ */ j(or, 5, 0), Xr = /* @__PURE__ */ j(or, 5, 1), sr = function(r) {
+  for (var e = r[0], n = 1; n < r.length; ++n)
+    r[n] > e && (e = r[n]);
+  return e;
+}, W = function(r, e, n) {
+  var a = e / 8 | 0;
+  return (r[a] | r[a + 1] << 8) >> (e & 7) & n;
+}, xr = function(r, e) {
+  var n = e / 8 | 0;
+  return (r[n] | r[n + 1] << 8 | r[n + 2] << 16) >> (e & 7);
+}, mr = function(r) {
+  return (r + 7) / 8 | 0;
+}, tr = function(r, e, n) {
+  return (e == null || e < 0) && (e = 0), (n == null || n > r.length) && (n = r.length), new A(r.subarray(e, n));
+}, Zr = [
+  "unexpected EOF",
+  "invalid block type",
+  "invalid length/literal",
+  "invalid distance",
+  "stream finished",
+  "no stream handler",
+  ,
+  "no callback",
+  "invalid UTF-8 data",
+  "extra field too long",
+  "date not in range 1980-2099",
+  "filename too long",
+  "stream finishing",
+  "invalid zip data"
+  // determined by unknown compression method
+], G = function(r, e, n) {
+  var a = new Error(e || Zr[r]);
+  if (a.code = r, Error.captureStackTrace && Error.captureStackTrace(a, G), !n)
+    throw a;
+  return a;
+}, $r = function(r, e, n, a) {
+  var v = r.length, f = a ? a.length : 0;
+  if (!v || e.f && !e.l)
+    return n || new A(0);
+  var o = !n, h = o || e.i != 2, t = e.i;
+  o && (n = new A(v * 3));
+  var w = function(vr) {
+    var fr = n.length;
+    if (vr > fr) {
+      var nr = new A(Math.max(fr * 2, vr));
+      nr.set(n), n = nr;
+    }
+  }, l = e.f || 0, i = e.p || 0, u = e.b || 0, c = e.l, M = e.d, x = e.m, C = e.n, m = v * 8;
+  do {
+    if (!c) {
+      l = W(r, i, 1);
+      var O = W(r, i + 1, 3);
+      if (i += 3, O)
+        if (O == 1)
+          c = Vr, M = Xr, x = 9, C = 5;
+        else if (O == 2) {
+          var U = W(r, i, 31) + 257, T = W(r, i + 10, 15) + 4, s = U + W(r, i + 5, 31) + 1;
+          i += 14;
+          for (var g = new A(s), D = new A(19), B = 0; B < T; ++B)
+            D[Cr[B]] = W(r, i + B * 3, 7);
+          i += T * 3;
+          for (var Y = sr(D), p = (1 << Y) - 1, N = j(D, Y, 1), B = 0; B < s; ) {
+            var J = N[W(r, i, p)];
+            i += J & 15;
+            var F = J >> 4;
+            if (F < 16)
+              g[B++] = F;
+            else {
+              var I = 0, S = 0;
+              for (F == 16 ? (S = 3 + W(r, i, 3), i += 2, I = g[B - 1]) : F == 17 ? (S = 3 + W(r, i, 7), i += 3) : F == 18 && (S = 11 + W(r, i, 127), i += 7); S--; )
+                g[B++] = I;
+            }
+          }
+          var K = g.subarray(0, U), q = g.subarray(U);
+          x = sr(K), C = sr(q), c = j(K, x, 1), M = j(q, C, 1);
+        } else
+          G(1);
+      else {
+        var F = mr(i) + 4, k = r[F - 4] | r[F - 3] << 8, E = F + k;
+        if (E > v) {
+          t && G(0);
+          break;
+        }
+        h && w(u + k), n.set(r.subarray(F, E), u), e.b = u += k, e.p = i = E * 8, e.f = l;
+        continue;
+      }
+      if (i > m) {
+        t && G(0);
+        break;
+      }
+    }
+    h && w(u + 131072);
+    for (var ar = (1 << x) - 1, V = (1 << C) - 1, L = i; ; L = i) {
+      var I = c[xr(r, i) & ar], P = I >> 4;
+      if (i += I & 15, i > m) {
+        t && G(0);
+        break;
+      }
+      if (I || G(2), P < 256)
+        n[u++] = P;
+      else if (P == 256) {
+        L = i, c = null;
+        break;
+      } else {
+        var Q = P - 254;
+        if (P > 264) {
+          var B = P - 257, z = gr[B];
+          Q = W(r, i, (1 << z) - 1) + Yr[B], i += z;
+        }
+        var Z = M[xr(r, i) & V], rr = Z >> 4;
+        Z || G(3), i += Z & 15;
+        var q = Qr[rr];
+        if (rr > 3) {
+          var z = wr[rr];
+          q += xr(r, i) & (1 << z) - 1, i += z;
+        }
+        if (i > m) {
+          t && G(0);
+          break;
+        }
+        h && w(u + 131072);
+        var er = u + Q;
+        if (u < q) {
+          var ur = f - q, hr = Math.min(q, er);
+          for (ur + u < 0 && G(3); u < hr; ++u)
+            n[u] = a[ur + u];
+        }
+        for (; u < er; ++u)
+          n[u] = n[u - q];
+      }
+    }
+    e.l = c, e.p = L, e.b = u, e.f = l, c && (l = 1, e.m = x, e.d = M, e.n = C);
+  } while (!l);
+  return u != n.length && o ? tr(n, 0, u) : n.subarray(0, u);
+}, _ = function(r, e, n) {
+  n <<= e & 7;
+  var a = e / 8 | 0;
+  r[a] |= n, r[a + 1] |= n >> 8;
+}, ir = function(r, e, n) {
+  n <<= e & 7;
+  var a = e / 8 | 0;
+  r[a] |= n, r[a + 1] |= n >> 8, r[a + 2] |= n >> 16;
+}, Mr = function(r, e) {
+  for (var n = [], a = 0; a < r.length; ++a)
+    r[a] && n.push({ s: a, f: r[a] });
+  var v = n.length, f = n.slice();
+  if (!v)
+    return { t: Kr, l: 0 };
+  if (v == 1) {
+    var o = new A(n[0].s + 1);
+    return o[n[0].s] = 1, { t: o, l: 1 };
+  }
+  n.sort(function(E, U) {
+    return E.f - U.f;
+  }), n.push({ s: -1, f: 25001 });
+  var h = n[0], t = n[1], w = 0, l = 1, i = 2;
+  for (n[0] = { s: -1, f: h.f + t.f, l: h, r: t }; l != v - 1; )
+    h = n[n[w].f < n[i].f ? w++ : i++], t = n[w != l && n[w].f < n[i].f ? w++ : i++], n[l++] = { s: -1, f: h.f + t.f, l: h, r: t };
+  for (var u = f[0].s, a = 1; a < v; ++a)
+    f[a].s > u && (u = f[a].s);
+  var c = new R(u + 1), M = Ar(n[l - 1], c, 0);
+  if (M > e) {
+    var a = 0, x = 0, C = M - e, m = 1 << C;
+    for (f.sort(function(U, T) {
+      return c[T.s] - c[U.s] || U.f - T.f;
+    }); a < v; ++a) {
+      var O = f[a].s;
+      if (c[O] > e)
+        x += m - (1 << M - c[O]), c[O] = e;
+      else
+        break;
+    }
+    for (x >>= C; x > 0; ) {
+      var F = f[a].s;
+      c[F] < e ? x -= 1 << e - c[F]++ - 1 : ++a;
+    }
+    for (; a >= 0 && x; --a) {
+      var k = f[a].s;
+      c[k] == e && (--c[k], ++x);
+    }
+    M = e;
+  }
+  return { t: new A(c), l: M };
+}, Ar = function(r, e, n) {
+  return r.s == -1 ? Math.max(Ar(r.l, e, n + 1), Ar(r.r, e, n + 1)) : e[r.s] = n;
+}, Er = function(r) {
+  for (var e = r.length; e && !r[--e]; )
+    ;
+  for (var n = new R(++e), a = 0, v = r[0], f = 1, o = function(t) {
+    n[a++] = t;
+  }, h = 1; h <= e; ++h)
+    if (r[h] == v && h != e)
+      ++f;
+    else {
+      if (!v && f > 2) {
+        for (; f > 138; f -= 138)
+          o(32754);
+        f > 2 && (o(f > 10 ? f - 11 << 5 | 28690 : f - 3 << 5 | 12305), f = 0);
+      } else if (f > 3) {
+        for (o(v), --f; f > 6; f -= 6)
+          o(8304);
+        f > 2 && (o(f - 3 << 5 | 8208), f = 0);
+      }
+      for (; f--; )
+        o(v);
+      f = 1, v = r[h];
+    }
+  return { c: n.subarray(0, a), n: e };
+}, lr = function(r, e) {
+  for (var n = 0, a = 0; a < e.length; ++a)
+    n += r[a] * e[a];
+  return n;
+}, Jr = function(r, e, n) {
+  var a = n.length, v = mr(e + 2);
+  r[v] = a & 255, r[v + 1] = a >> 8, r[v + 2] = r[v] ^ 255, r[v + 3] = r[v + 1] ^ 255;
+  for (var f = 0; f < a; ++f)
+    r[v + f + 4] = n[f];
+  return (v + 4 + a) * 8;
+}, Ur = function(r, e, n, a, v, f, o, h, t, w, l) {
+  _(e, l++, n), ++v[256];
+  for (var i = Mr(v, 15), u = i.t, c = i.l, M = Mr(f, 15), x = M.t, C = M.l, m = Er(u), O = m.c, F = m.n, k = Er(x), E = k.c, U = k.n, T = new R(19), s = 0; s < O.length; ++s)
+    ++T[O[s] & 31];
+  for (var s = 0; s < E.length; ++s)
+    ++T[E[s] & 31];
+  for (var g = Mr(T, 7), D = g.t, B = g.l, Y = 19; Y > 4 && !D[Cr[Y - 1]]; --Y)
+    ;
+  var p = w + 5 << 3, N = lr(v, d) + lr(f, or) + o, J = lr(v, u) + lr(f, x) + o + 14 + 3 * Y + lr(T, D) + 2 * T[16] + 3 * T[17] + 7 * T[18];
+  if (t >= 0 && p <= N && p <= J)
+    return Jr(e, l, r.subarray(t, t + w));
+  var I, S, K, q;
+  if (_(e, l, 1 + (J < N)), l += 2, J < N) {
+    I = j(u, c, 0), S = u, K = j(x, C, 0), q = x;
+    var ar = j(D, B, 0);
+    _(e, l, F - 257), _(e, l + 5, U - 1), _(e, l + 10, Y - 4), l += 14;
+    for (var s = 0; s < Y; ++s)
+      _(e, l + 3 * s, D[Cr[s]]);
+    l += 3 * Y;
+    for (var V = [O, E], L = 0; L < 2; ++L)
+      for (var P = V[L], s = 0; s < P.length; ++s) {
+        var Q = P[s] & 31;
+        _(e, l, ar[Q]), l += D[Q], Q > 15 && (_(e, l, P[s] >> 5 & 127), l += P[s] >> 12);
+      }
+  } else
+    I = Rr, S = d, K = Wr, q = or;
+  for (var s = 0; s < h; ++s) {
+    var z = a[s];
+    if (z > 255) {
+      var Q = z >> 18 & 31;
+      ir(e, l, I[Q + 257]), l += S[Q + 257], Q > 7 && (_(e, l, z >> 23 & 31), l += gr[Q]);
+      var Z = z & 31;
+      ir(e, l, K[Z]), l += q[Z], Z > 3 && (ir(e, l, z >> 5 & 8191), l += wr[Z]);
+    } else
+      ir(e, l, I[z]), l += S[z];
+  }
+  return ir(e, l, I[256]), l + S[256];
+}, jr = /* @__PURE__ */ new Tr([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]), Kr = /* @__PURE__ */ new A(0), Lr = function(r, e, n, a, v, f) {
+  var o = f.z || r.length, h = new A(a + o + 5 * (1 + Math.ceil(o / 7e3)) + v), t = h.subarray(a, h.length - v), w = f.l, l = (f.r || 0) & 7;
+  if (e) {
+    l && (t[0] = f.r >> 3);
+    for (var i = jr[e - 1], u = i >> 13, c = i & 8191, M = (1 << n) - 1, x = f.p || new R(32768), C = f.h || new R(M + 1), m = Math.ceil(n / 3), O = 2 * m, F = function(cr) {
+      return (r[cr] ^ r[cr + 1] << m ^ r[cr + 2] << O) & M;
+    }, k = new Tr(25e3), E = new R(288), U = new R(32), T = 0, s = 0, g = f.i || 0, D = 0, B = f.w || 0, Y = 0; g + 2 < o; ++g) {
+      var p = F(g), N = g & 32767, J = C[p];
+      if (x[N] = J, C[p] = N, B <= g) {
+        var I = o - g;
+        if ((T > 7e3 || D > 24576) && (I > 423 || !w)) {
+          l = Ur(r, t, 0, k, E, U, s, D, Y, g - Y, l), D = T = s = 0, Y = g;
+          for (var S = 0; S < 286; ++S)
+            E[S] = 0;
+          for (var S = 0; S < 30; ++S)
+            U[S] = 0;
+        }
+        var K = 2, q = 0, ar = c, V = N - J & 32767;
+        if (I > 2 && p == F(g - V))
+          for (var L = Math.min(u, I) - 1, P = Math.min(32767, g), Q = Math.min(258, I); V <= P && --ar && N != J; ) {
+            if (r[g + K] == r[g + K - V]) {
+              for (var z = 0; z < Q && r[g + z] == r[g + z - V]; ++z)
+                ;
+              if (z > K) {
+                if (K = z, q = V, z > L)
+                  break;
+                for (var Z = Math.min(V, z - 2), rr = 0, S = 0; S < Z; ++S) {
+                  var er = g - V + S & 32767, ur = x[er], hr = er - ur & 32767;
+                  hr > rr && (rr = hr, J = er);
+                }
+              }
+            }
+            N = J, J = x[N], V += N - J & 32767;
+          }
+        if (q) {
+          k[D++] = 268435456 | Sr[K] << 18 | Br[q];
+          var vr = Sr[K] & 31, fr = Br[q] & 31;
+          s += gr[vr] + wr[fr], ++E[257 + vr], ++U[fr], B = g + K, ++T;
+        } else
+          k[D++] = r[g], ++E[r[g]];
+      }
+    }
+    for (g = Math.max(g, B); g < o; ++g)
+      k[D++] = r[g], ++E[r[g]];
+    l = Ur(r, t, w, k, E, U, s, D, Y, g - Y, l), w || (f.r = l & 7 | t[l / 8 | 0] << 3, l -= 7, f.h = C, f.p = x, f.i = g, f.w = B);
+  } else {
+    for (var g = f.w || 0; g < o + w; g += 65535) {
+      var nr = g + 65535;
+      nr >= o && (t[l / 8 | 0] = w, nr = o), l = Jr(t, l + 1, r.subarray(g, nr));
+    }
+    f.i = o;
+  }
+  return tr(h, 0, a + mr(l) + v);
+}, _r = /* @__PURE__ */ (function() {
+  for (var r = new Int32Array(256), e = 0; e < 256; ++e) {
+    for (var n = e, a = 9; --a; )
+      n = (n & 1 && -306674912) ^ n >>> 1;
+    r[e] = n;
+  }
+  return r;
+})(), pr = function() {
+  var r = -1;
+  return {
+    p: function(e) {
+      for (var n = r, a = 0; a < e.length; ++a)
+        n = _r[n & 255 ^ e[a]] ^ n >>> 8;
+      r = n;
+    },
+    d: function() {
+      return ~r;
+    }
+  };
+}, br = function(r, e, n, a, v) {
+  if (!v && (v = { l: 1 }, e.dictionary)) {
+    var f = e.dictionary.subarray(-32768), o = new A(f.length + r.length);
+    o.set(f), o.set(r, f.length), r = o, v.w = f.length;
+  }
+  return Lr(r, e.level == null ? 6 : e.level, e.mem == null ? v.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(r.length))) * 1.5) : 20 : 12 + e.mem, n, a, v);
+}, Nr = function(r, e) {
+  var n = {};
+  for (var a in r)
+    n[a] = r[a];
+  for (var a in e)
+    n[a] = e[a];
+  return n;
+}, $ = function(r, e) {
+  return r[e] | r[e + 1] << 8;
+}, X = function(r, e) {
+  return (r[e] | r[e + 1] << 8 | r[e + 2] << 16 | r[e + 3] << 24) >>> 0;
+}, yr = function(r, e) {
+  return X(r, e) + X(r, e + 4) * 4294967296;
+}, H = function(r, e, n) {
+  for (; n; ++e)
+    r[e] = n, n >>>= 8;
+};
+function dr(r, e) {
+  return br(r, e || {}, 0, 0);
+}
+function re(r, e) {
+  return $r(r, { i: 2 }, e && e.out, e && e.dictionary);
+}
+var Pr = function(r, e, n, a) {
+  for (var v in r) {
+    var f = r[v], o = e + v, h = a;
+    Array.isArray(f) && (h = Nr(a, f[1]), f = f[0]), f instanceof A ? n[o] = [f, h] : (n[o += "/"] = [new A(0), h], Pr(f, o, n, a));
+  }
+}, Dr = typeof TextEncoder < "u" && /* @__PURE__ */ new TextEncoder(), Fr = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder(), ee = 0;
+try {
+  Fr.decode(Kr, { stream: !0 }), ee = 1;
+} catch {
+}
+var ne = function(r) {
+  for (var e = "", n = 0; ; ) {
+    var a = r[n++], v = (a > 127) + (a > 223) + (a > 239);
+    if (n + v > r.length)
+      return { s: e, r: tr(r, n - 1) };
+    v ? v == 3 ? (a = ((a & 15) << 18 | (r[n++] & 63) << 12 | (r[n++] & 63) << 6 | r[n++] & 63) - 65536, e += String.fromCharCode(55296 | a >> 10, 56320 | a & 1023)) : v & 1 ? e += String.fromCharCode((a & 31) << 6 | r[n++] & 63) : e += String.fromCharCode((a & 15) << 12 | (r[n++] & 63) << 6 | r[n++] & 63) : e += String.fromCharCode(a);
+  }
+};
+function Ir(r, e) {
+  var n;
+  if (Dr)
+    return Dr.encode(r);
+  for (var a = r.length, v = new A(r.length + (r.length >> 1)), f = 0, o = function(w) {
+    v[f++] = w;
+  }, n = 0; n < a; ++n) {
+    if (f + 5 > v.length) {
+      var h = new A(f + 8 + (a - n << 1));
+      h.set(v), v = h;
+    }
+    var t = r.charCodeAt(n);
+    t < 128 || e ? o(t) : t < 2048 ? (o(192 | t >> 6), o(128 | t & 63)) : t > 55295 && t < 57344 ? (t = 65536 + (t & 1047552) | r.charCodeAt(++n) & 1023, o(240 | t >> 18), o(128 | t >> 12 & 63), o(128 | t >> 6 & 63), o(128 | t & 63)) : (o(224 | t >> 12), o(128 | t >> 6 & 63), o(128 | t & 63));
+  }
+  return tr(v, 0, f);
+}
+function ae(r, e) {
+  if (e) {
+    for (var n = "", a = 0; a < r.length; a += 16384)
+      n += String.fromCharCode.apply(null, r.subarray(a, a + 16384));
+    return n;
+  } else {
+    if (Fr)
+      return Fr.decode(r);
+    var v = ne(r), f = v.s, n = v.r;
+    return n.length && G(8), f;
+  }
+}
+var ve = function(r, e) {
+  return e + 30 + $(r, e + 26) + $(r, e + 28);
+}, fe = function(r, e, n) {
+  var a = $(r, e + 28), v = ae(r.subarray(e + 46, e + 46 + a), !($(r, e + 8) & 2048)), f = e + 46 + a, o = X(r, e + 20), h = n && o == 4294967295 ? ie(r, f) : [o, X(r, e + 24), X(r, e + 42)], t = h[0], w = h[1], l = h[2];
+  return [$(r, e + 10), t, w, v, f + $(r, e + 30) + $(r, e + 32), l];
+}, ie = function(r, e) {
+  for (; $(r, e) != 1; e += 4 + $(r, e + 2))
+    ;
+  return [yr(r, e + 12), yr(r, e + 4), yr(r, e + 20)];
+}, kr = function(r) {
+  var e = 0;
+  if (r)
+    for (var n in r) {
+      var a = r[n].length;
+      a > 65535 && G(9), e += a + 4;
+    }
+  return e;
+}, qr = function(r, e, n, a, v, f, o, h) {
+  var t = a.length, w = n.extra, l = h && h.length, i = kr(w);
+  H(r, e, o != null ? 33639248 : 67324752), e += 4, o != null && (r[e++] = 20, r[e++] = n.os), r[e] = 20, e += 2, r[e++] = n.flag << 1 | (f < 0 && 8), r[e++] = v && 8, r[e++] = n.compression & 255, r[e++] = n.compression >> 8;
+  var u = new Date(n.mtime == null ? Date.now() : n.mtime), c = u.getFullYear() - 1980;
+  if ((c < 0 || c > 119) && G(10), H(r, e, c << 25 | u.getMonth() + 1 << 21 | u.getDate() << 16 | u.getHours() << 11 | u.getMinutes() << 5 | u.getSeconds() >> 1), e += 4, f != -1 && (H(r, e, n.crc), H(r, e + 4, f < 0 ? -f - 2 : f), H(r, e + 8, n.size)), H(r, e + 12, t), H(r, e + 14, i), e += 16, o != null && (H(r, e, l), H(r, e + 6, n.attrs), H(r, e + 10, o), e += 14), r.set(a, e), e += t, i)
+    for (var M in w) {
+      var x = w[M], C = x.length;
+      H(r, e, +M), H(r, e + 2, C), r.set(x, e + 4), e += 4 + C;
+    }
+  return l && (r.set(h, e), e += l), e;
+}, le = function(r, e, n, a, v) {
+  H(r, e, 101010256), H(r, e + 8, n), H(r, e + 10, n), H(r, e + 12, a), H(r, e + 16, v);
+};
+function oe(r, e) {
+  e || (e = {});
+  var n = {}, a = [];
+  Pr(r, "", n, e);
+  var v = 0, f = 0;
+  for (var o in n) {
+    var h = n[o], t = h[0], w = h[1], l = w.level == 0 ? 0 : 8, i = Ir(o), u = i.length, c = w.comment, M = c && Ir(c), x = M && M.length, C = kr(w.extra);
+    u > 65535 && G(11);
+    var m = l ? dr(t, w) : t, O = m.length, F = pr();
+    F.p(t), a.push(Nr(w, {
+      size: t.length,
+      crc: F.d(),
+      c: m,
+      f: i,
+      m: M,
+      u: u != o.length || M && c.length != x,
+      o: v,
+      compression: l
+    })), v += 30 + u + C + O, f += 76 + 2 * (u + C) + (x || 0) + O;
+  }
+  for (var k = new A(f + 22), E = v, U = f - v, T = 0; T < a.length; ++T) {
+    var i = a[T];
+    qr(k, i.o, i, i.f, i.u, i.c.length);
+    var s = 30 + i.f.length + kr(i.extra);
+    k.set(i.c, i.o + s), qr(k, v, i, i.f, i.u, i.c.length, i.o, i.m), v += 16 + s + (i.m ? i.m.length : 0);
+  }
+  return le(k, v, a.length, U, E), k;
+}
+function te(r, e) {
+  for (var n = {}, a = r.length - 22; X(r, a) != 101010256; --a)
+    (!a || r.length - a > 65558) && G(13);
+  var v = $(r, a + 8);
+  if (!v)
+    return {};
+  var f = X(r, a + 16), o = f == 4294967295 || v == 65535;
+  if (o) {
+    var h = X(r, a - 12);
+    o = X(r, h) == 101075792, o && (v = X(r, h + 32), f = X(r, h + 48));
+  }
+  for (var t = e && e.filter, w = 0; w < v; ++w) {
+    var l = fe(r, f, o), i = l[0], u = l[1], c = l[2], M = l[3], x = l[4], C = l[5], m = ve(r, C);
+    f = x, (!t || t({
+      name: M,
+      size: u,
+      originalSize: c,
+      compression: i
+    })) && (i ? i == 8 ? n[M] = re(r.subarray(m, m + u), { out: new A(c) }) : G(14, "unknown compression type " + i) : n[M] = tr(r, m, m + u));
+  }
+  return n;
+}
+export {
+  dr as deflateSync,
+  re as inflateSync,
+  ae as strFromU8,
+  Ir as strToU8,
+  te as unzipSync,
+  oe as zipSync
+};
+//# sourceMappingURL=browser-CFE8q4oi.js.map