@genome-spy/app 0.37.4 → 0.39.0

package/dist/long-Veu0zKh9.js

@@ -0,0 +1,2382 @@
+import { b as Pi } from "./index-1QVesMzU.js";
+import { g as Da } from "./_commonjsHelpers-QtkX90xp.js";
+var re = {};
+(function(e) {
+  var i = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Int32Array < "u";
+  function t(n, h) {
+    return Object.prototype.hasOwnProperty.call(n, h);
+  }
+  e.assign = function(n) {
+    for (var h = Array.prototype.slice.call(arguments, 1); h.length; ) {
+      var f = h.shift();
+      if (f) {
+        if (typeof f != "object")
+          throw new TypeError(f + "must be non-object");
+        for (var _ in f)
+          t(f, _) && (n[_] = f[_]);
+      }
+    }
+    return n;
+  }, e.shrinkBuf = function(n, h) {
+    return n.length === h ? n : n.subarray ? n.subarray(0, h) : (n.length = h, n);
+  };
+  var a = {
+    arraySet: function(n, h, f, _, l) {
+      if (h.subarray && n.subarray) {
+        n.set(h.subarray(f, f + _), l);
+        return;
+      }
+      for (var o = 0; o < _; o++)
+        n[l + o] = h[f + o];
+    },
+    // Join array of chunks to single array.
+    flattenChunks: function(n) {
+      var h, f, _, l, o, v;
+      for (_ = 0, h = 0, f = n.length; h < f; h++)
+        _ += n[h].length;
+      for (v = new Uint8Array(_), l = 0, h = 0, f = n.length; h < f; h++)
+        o = n[h], v.set(o, l), l += o.length;
+      return v;
+    }
+  }, r = {
+    arraySet: function(n, h, f, _, l) {
+      for (var o = 0; o < _; o++)
+        n[l + o] = h[f + o];
+    },
+    // Join array of chunks to single array.
+    flattenChunks: function(n) {
+      return [].concat.apply([], n);
+    }
+  };
+  e.setTyped = function(n) {
+    n ? (e.Buf8 = Uint8Array, e.Buf16 = Uint16Array, e.Buf32 = Int32Array, e.assign(e, a)) : (e.Buf8 = Array, e.Buf16 = Array, e.Buf32 = Array, e.assign(e, r));
+  }, e.setTyped(i);
+})(re);
+var qe = {}, ie = {}, Ze = {}, Ra = re, Ba = 4, jt = 0, Vt = 1, Ca = 2;
+function Ie(e) {
+  for (var i = e.length; --i >= 0; )
+    e[i] = 0;
+}
+var Ua = 0, Ki = 1, $a = 2, Ma = 3, Ha = 258, $t = 29, Ge = 256, He = Ge + 1 + $t, Ne = 30, Mt = 19, Yi = 2 * He + 1, se = 15, bt = 16, Pa = 7, Ht = 256, Xi = 16, qi = 17, Gi = 18, Ot = (
+  /* extra bits for each length code */
+  [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]
+), ft = (
+  /* extra bits for each distance code */
+  [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]
+), Ka = (
+  /* extra bits for each bit length code */
+  [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7]
+), Wi = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Ya = 512, ne = new Array((He + 2) * 2);
+Ie(ne);
+var Be = new Array(Ne * 2);
+Ie(Be);
+var Pe = new Array(Ya);
+Ie(Pe);
+var Ke = new Array(Ha - Ma + 1);
+Ie(Ke);
+var Pt = new Array($t);
+Ie(Pt);
+var ut = new Array(Ne);
+Ie(ut);
+function pt(e, i, t, a, r) {
+  this.static_tree = e, this.extra_bits = i, this.extra_base = t, this.elems = a, this.max_length = r, this.has_stree = e && e.length;
+}
+var ji, Vi, Ji;
+function xt(e, i) {
+  this.dyn_tree = e, this.max_code = 0, this.stat_desc = i;
+}
+function Qi(e) {
+  return e < 256 ? Pe[e] : Pe[256 + (e >>> 7)];
+}
+function Ye(e, i) {
+  e.pending_buf[e.pending++] = i & 255, e.pending_buf[e.pending++] = i >>> 8 & 255;
+}
+function C(e, i, t) {
+  e.bi_valid > bt - t ? (e.bi_buf |= i << e.bi_valid & 65535, Ye(e, e.bi_buf), e.bi_buf = i >> bt - e.bi_valid, e.bi_valid += t - bt) : (e.bi_buf |= i << e.bi_valid & 65535, e.bi_valid += t);
+}
+function ee(e, i, t) {
+  C(
+    e,
+    t[i * 2],
+    t[i * 2 + 1]
+    /*.Len*/
+  );
+}
+function ea(e, i) {
+  var t = 0;
+  do
+    t |= e & 1, e >>>= 1, t <<= 1;
+  while (--i > 0);
+  return t >>> 1;
+}
+function Xa(e) {
+  e.bi_valid === 16 ? (Ye(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
+}
+function qa(e, i) {
+  var t = i.dyn_tree, a = i.max_code, r = i.stat_desc.static_tree, n = i.stat_desc.has_stree, h = i.stat_desc.extra_bits, f = i.stat_desc.extra_base, _ = i.stat_desc.max_length, l, o, v, d, u, g, w = 0;
+  for (d = 0; d <= se; d++)
+    e.bl_count[d] = 0;
+  for (t[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < Yi; l++)
+    o = e.heap[l], d = t[t[o * 2 + 1] * 2 + 1] + 1, d > _ && (d = _, w++), t[o * 2 + 1] = d, !(o > a) && (e.bl_count[d]++, u = 0, o >= f && (u = h[o - f]), g = t[o * 2], e.opt_len += g * (d + u), n && (e.static_len += g * (r[o * 2 + 1] + u)));
+  if (w !== 0) {
+    do {
+      for (d = _ - 1; e.bl_count[d] === 0; )
+        d--;
+      e.bl_count[d]--, e.bl_count[d + 1] += 2, e.bl_count[_]--, w -= 2;
+    } while (w > 0);
+    for (d = _; d !== 0; d--)
+      for (o = e.bl_count[d]; o !== 0; )
+        v = e.heap[--l], !(v > a) && (t[v * 2 + 1] !== d && (e.opt_len += (d - t[v * 2 + 1]) * t[v * 2], t[v * 2 + 1] = d), o--);
+  }
+}
+function ta(e, i, t) {
+  var a = new Array(se + 1), r = 0, n, h;
+  for (n = 1; n <= se; n++)
+    a[n] = r = r + t[n - 1] << 1;
+  for (h = 0; h <= i; h++) {
+    var f = e[h * 2 + 1];
+    f !== 0 && (e[h * 2] = ea(a[f]++, f));
+  }
+}
+function Ga() {
+  var e, i, t, a, r, n = new Array(se + 1);
+  for (t = 0, a = 0; a < $t - 1; a++)
+    for (Pt[a] = t, e = 0; e < 1 << Ot[a]; e++)
+      Ke[t++] = a;
+  for (Ke[t - 1] = a, r = 0, a = 0; a < 16; a++)
+    for (ut[a] = r, e = 0; e < 1 << ft[a]; e++)
+      Pe[r++] = a;
+  for (r >>= 7; a < Ne; a++)
+    for (ut[a] = r << 7, e = 0; e < 1 << ft[a] - 7; e++)
+      Pe[256 + r++] = a;
+  for (i = 0; i <= se; i++)
+    n[i] = 0;
+  for (e = 0; e <= 143; )
+    ne[e * 2 + 1] = 8, e++, n[8]++;
+  for (; e <= 255; )
+    ne[e * 2 + 1] = 9, e++, n[9]++;
+  for (; e <= 279; )
+    ne[e * 2 + 1] = 7, e++, n[7]++;
+  for (; e <= 287; )
+    ne[e * 2 + 1] = 8, e++, n[8]++;
+  for (ta(ne, He + 1, n), e = 0; e < Ne; e++)
+    Be[e * 2 + 1] = 5, Be[e * 2] = ea(e, 5);
+  ji = new pt(ne, Ot, Ge + 1, He, se), Vi = new pt(Be, ft, 0, Ne, se), Ji = new pt(new Array(0), Ka, 0, Mt, Pa);
+}
+function ia(e) {
+  var i;
+  for (i = 0; i < He; i++)
+    e.dyn_ltree[i * 2] = 0;
+  for (i = 0; i < Ne; i++)
+    e.dyn_dtree[i * 2] = 0;
+  for (i = 0; i < Mt; i++)
+    e.bl_tree[i * 2] = 0;
+  e.dyn_ltree[Ht * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
+}
+function aa(e) {
+  e.bi_valid > 8 ? Ye(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+}
+function Wa(e, i, t, a) {
+  aa(e), a && (Ye(e, t), Ye(e, ~t)), Ra.arraySet(e.pending_buf, e.window, i, t, e.pending), e.pending += t;
+}
+function Jt(e, i, t, a) {
+  var r = i * 2, n = t * 2;
+  return e[r] < e[n] || e[r] === e[n] && a[i] <= a[t];
+}
+function kt(e, i, t) {
+  for (var a = e.heap[t], r = t << 1; r <= e.heap_len && (r < e.heap_len && Jt(i, e.heap[r + 1], e.heap[r], e.depth) && r++, !Jt(i, a, e.heap[r], e.depth)); )
+    e.heap[t] = e.heap[r], t = r, r <<= 1;
+  e.heap[t] = a;
+}
+function Qt(e, i, t) {
+  var a, r, n = 0, h, f;
+  if (e.last_lit !== 0)
+    do
+      a = e.pending_buf[e.d_buf + n * 2] << 8 | e.pending_buf[e.d_buf + n * 2 + 1], r = e.pending_buf[e.l_buf + n], n++, a === 0 ? ee(e, r, i) : (h = Ke[r], ee(e, h + Ge + 1, i), f = Ot[h], f !== 0 && (r -= Pt[h], C(e, r, f)), a--, h = Qi(a), ee(e, h, t), f = ft[h], f !== 0 && (a -= ut[h], C(e, a, f)));
+    while (n < e.last_lit);
+  ee(e, Ht, i);
+}
+function Zt(e, i) {
+  var t = i.dyn_tree, a = i.stat_desc.static_tree, r = i.stat_desc.has_stree, n = i.stat_desc.elems, h, f, _ = -1, l;
+  for (e.heap_len = 0, e.heap_max = Yi, h = 0; h < n; h++)
+    t[h * 2] !== 0 ? (e.heap[++e.heap_len] = _ = h, e.depth[h] = 0) : t[h * 2 + 1] = 0;
+  for (; e.heap_len < 2; )
+    l = e.heap[++e.heap_len] = _ < 2 ? ++_ : 0, t[l * 2] = 1, e.depth[l] = 0, e.opt_len--, r && (e.static_len -= a[l * 2 + 1]);
+  for (i.max_code = _, h = e.heap_len >> 1; h >= 1; h--)
+    kt(e, t, h);
+  l = n;
+  do
+    h = e.heap[
+      1
+      /*SMALLEST*/
+    ], e.heap[
+      1
+      /*SMALLEST*/
+    ] = e.heap[e.heap_len--], kt(
+      e,
+      t,
+      1
+      /*SMALLEST*/
+    ), f = e.heap[
+      1
+      /*SMALLEST*/
+    ], e.heap[--e.heap_max] = h, e.heap[--e.heap_max] = f, t[l * 2] = t[h * 2] + t[f * 2], e.depth[l] = (e.depth[h] >= e.depth[f] ? e.depth[h] : e.depth[f]) + 1, t[h * 2 + 1] = t[f * 2 + 1] = l, e.heap[
+      1
+      /*SMALLEST*/
+    ] = l++, kt(
+      e,
+      t,
+      1
+      /*SMALLEST*/
+    );
+  while (e.heap_len >= 2);
+  e.heap[--e.heap_max] = e.heap[
+    1
+    /*SMALLEST*/
+  ], qa(e, i), ta(t, _, e.bl_count);
+}
+function ei(e, i, t) {
+  var a, r = -1, n, h = i[0 * 2 + 1], f = 0, _ = 7, l = 4;
+  for (h === 0 && (_ = 138, l = 3), i[(t + 1) * 2 + 1] = 65535, a = 0; a <= t; a++)
+    n = h, h = i[(a + 1) * 2 + 1], !(++f < _ && n === h) && (f < l ? e.bl_tree[n * 2] += f : n !== 0 ? (n !== r && e.bl_tree[n * 2]++, e.bl_tree[Xi * 2]++) : f <= 10 ? e.bl_tree[qi * 2]++ : e.bl_tree[Gi * 2]++, f = 0, r = n, h === 0 ? (_ = 138, l = 3) : n === h ? (_ = 6, l = 3) : (_ = 7, l = 4));
+}
+function ti(e, i, t) {
+  var a, r = -1, n, h = i[0 * 2 + 1], f = 0, _ = 7, l = 4;
+  for (h === 0 && (_ = 138, l = 3), a = 0; a <= t; a++)
+    if (n = h, h = i[(a + 1) * 2 + 1], !(++f < _ && n === h)) {
+      if (f < l)
+        do
+          ee(e, n, e.bl_tree);
+        while (--f !== 0);
+      else
+        n !== 0 ? (n !== r && (ee(e, n, e.bl_tree), f--), ee(e, Xi, e.bl_tree), C(e, f - 3, 2)) : f <= 10 ? (ee(e, qi, e.bl_tree), C(e, f - 3, 3)) : (ee(e, Gi, e.bl_tree), C(e, f - 11, 7));
+      f = 0, r = n, h === 0 ? (_ = 138, l = 3) : n === h ? (_ = 6, l = 3) : (_ = 7, l = 4);
+    }
+}
+function ja(e) {
+  var i;
+  for (ei(e, e.dyn_ltree, e.l_desc.max_code), ei(e, e.dyn_dtree, e.d_desc.max_code), Zt(e, e.bl_desc), i = Mt - 1; i >= 3 && e.bl_tree[Wi[i] * 2 + 1] === 0; i--)
+    ;
+  return e.opt_len += 3 * (i + 1) + 5 + 5 + 4, i;
+}
+function Va(e, i, t, a) {
+  var r;
+  for (C(e, i - 257, 5), C(e, t - 1, 5), C(e, a - 4, 4), r = 0; r < a; r++)
+    C(e, e.bl_tree[Wi[r] * 2 + 1], 3);
+  ti(e, e.dyn_ltree, i - 1), ti(e, e.dyn_dtree, t - 1);
+}
+function Ja(e) {
+  var i = 4093624447, t;
+  for (t = 0; t <= 31; t++, i >>>= 1)
+    if (i & 1 && e.dyn_ltree[t * 2] !== 0)
+      return jt;
+  if (e.dyn_ltree[9 * 2] !== 0 || e.dyn_ltree[10 * 2] !== 0 || e.dyn_ltree[13 * 2] !== 0)
+    return Vt;
+  for (t = 32; t < Ge; t++)
+    if (e.dyn_ltree[t * 2] !== 0)
+      return Vt;
+  return jt;
+}
+var ii = !1;
+function Qa(e) {
+  ii || (Ga(), ii = !0), e.l_desc = new xt(e.dyn_ltree, ji), e.d_desc = new xt(e.dyn_dtree, Vi), e.bl_desc = new xt(e.bl_tree, Ji), e.bi_buf = 0, e.bi_valid = 0, ia(e);
+}
+function na(e, i, t, a) {
+  C(e, (Ua << 1) + (a ? 1 : 0), 3), Wa(e, i, t, !0);
+}
+function en(e) {
+  C(e, Ki << 1, 3), ee(e, Ht, ne), Xa(e);
+}
+function tn(e, i, t, a) {
+  var r, n, h = 0;
+  e.level > 0 ? (e.strm.data_type === Ca && (e.strm.data_type = Ja(e)), Zt(e, e.l_desc), Zt(e, e.d_desc), h = ja(e), r = e.opt_len + 3 + 7 >>> 3, n = e.static_len + 3 + 7 >>> 3, n <= r && (r = n)) : r = n = t + 5, t + 4 <= r && i !== -1 ? na(e, i, t, a) : e.strategy === Ba || n === r ? (C(e, (Ki << 1) + (a ? 1 : 0), 3), Qt(e, ne, Be)) : (C(e, ($a << 1) + (a ? 1 : 0), 3), Va(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, h + 1), Qt(e, e.dyn_ltree, e.dyn_dtree)), ia(e), a && aa(e);
+}
+function an(e, i, t) {
+  return e.pending_buf[e.d_buf + e.last_lit * 2] = i >>> 8 & 255, e.pending_buf[e.d_buf + e.last_lit * 2 + 1] = i & 255, e.pending_buf[e.l_buf + e.last_lit] = t & 255, e.last_lit++, i === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, i--, e.dyn_ltree[(Ke[t] + Ge + 1) * 2]++, e.dyn_dtree[Qi(i) * 2]++), e.last_lit === e.lit_bufsize - 1;
+}
+Ze._tr_init = Qa;
+Ze._tr_stored_block = na;
+Ze._tr_flush_block = tn;
+Ze._tr_tally = an;
+Ze._tr_align = en;
+function nn(e, i, t, a) {
+  for (var r = e & 65535 | 0, n = e >>> 16 & 65535 | 0, h = 0; t !== 0; ) {
+    h = t > 2e3 ? 2e3 : t, t -= h;
+    do
+      r = r + i[a++] | 0, n = n + r | 0;
+    while (--h);
+    r %= 65521, n %= 65521;
+  }
+  return r | n << 16 | 0;
+}
+var ra = nn;
+function rn() {
+  for (var e, i = [], t = 0; t < 256; t++) {
+    e = t;
+    for (var a = 0; a < 8; a++)
+      e = e & 1 ? 3988292384 ^ e >>> 1 : e >>> 1;
+    i[t] = e;
+  }
+  return i;
+}
+var fn = rn();
+function hn(e, i, t, a) {
+  var r = fn, n = a + t;
+  e ^= -1;
+  for (var h = a; h < n; h++)
+    e = e >>> 8 ^ r[(e ^ i[h]) & 255];
+  return e ^ -1;
+}
+var fa = hn, Kt = {
+  2: "need dictionary",
+  /* Z_NEED_DICT       2  */
+  1: "stream end",
+  /* Z_STREAM_END      1  */
+  0: "",
+  /* Z_OK              0  */
+  "-1": "file error",
+  /* Z_ERRNO         (-1) */
+  "-2": "stream error",
+  /* Z_STREAM_ERROR  (-2) */
+  "-3": "data error",
+  /* Z_DATA_ERROR    (-3) */
+  "-4": "insufficient memory",
+  /* Z_MEM_ERROR     (-4) */
+  "-5": "buffer error",
+  /* Z_BUF_ERROR     (-5) */
+  "-6": "incompatible version"
+  /* Z_VERSION_ERROR (-6) */
+}, B = re, Y = Ze, ha = ra, he = fa, ln = Kt, ke = 0, on = 1, _n = 3, de = 4, ai = 5, te = 0, ni = 1, X = -2, un = -3, Et = -5, dn = -1, sn = 1, tt = 2, cn = 3, vn = 4, gn = 0, wn = 2, vt = 8, bn = 9, pn = 15, xn = 8, kn = 29, En = 256, It = En + 1 + kn, Sn = 30, yn = 19, mn = 2 * It + 1, Fn = 15, S = 3, _e = 258, W = _e + S + 1, Tn = 32, gt = 42, Lt = 69, ht = 73, lt = 91, ot = 103, ce = 113, Re = 666, D = 1, We = 2, ge = 3, Le = 4, Nn = 3;
+function ue(e, i) {
+  return e.msg = ln[i], i;
+}
+function ri(e) {
+  return (e << 1) - (e > 4 ? 9 : 0);
+}
+function oe(e) {
+  for (var i = e.length; --i >= 0; )
+    e[i] = 0;
+}
+function le(e) {
+  var i = e.state, t = i.pending;
+  t > e.avail_out && (t = e.avail_out), t !== 0 && (B.arraySet(e.output, i.pending_buf, i.pending_out, t, e.next_out), e.next_out += t, i.pending_out += t, e.total_out += t, e.avail_out -= t, i.pending -= t, i.pending === 0 && (i.pending_out = 0));
+}
+function R(e, i) {
+  Y._tr_flush_block(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, i), e.block_start = e.strstart, le(e.strm);
+}
+function F(e, i) {
+  e.pending_buf[e.pending++] = i;
+}
+function De(e, i) {
+  e.pending_buf[e.pending++] = i >>> 8 & 255, e.pending_buf[e.pending++] = i & 255;
+}
+function zn(e, i, t, a) {
+  var r = e.avail_in;
+  return r > a && (r = a), r === 0 ? 0 : (e.avail_in -= r, B.arraySet(i, e.input, e.next_in, r, t), e.state.wrap === 1 ? e.adler = ha(e.adler, i, r, t) : e.state.wrap === 2 && (e.adler = he(e.adler, i, r, t)), e.next_in += r, e.total_in += r, r);
+}
+function la(e, i) {
+  var t = e.max_chain_length, a = e.strstart, r, n, h = e.prev_length, f = e.nice_match, _ = e.strstart > e.w_size - W ? e.strstart - (e.w_size - W) : 0, l = e.window, o = e.w_mask, v = e.prev, d = e.strstart + _e, u = l[a + h - 1], g = l[a + h];
+  e.prev_length >= e.good_match && (t >>= 2), f > e.lookahead && (f = e.lookahead);
+  do
+    if (r = i, !(l[r + h] !== g || l[r + h - 1] !== u || l[r] !== l[a] || l[++r] !== l[a + 1])) {
+      a += 2, r++;
+      do
+        ;
+      while (l[++a] === l[++r] && l[++a] === l[++r] && l[++a] === l[++r] && l[++a] === l[++r] && l[++a] === l[++r] && l[++a] === l[++r] && l[++a] === l[++r] && l[++a] === l[++r] && a < d);
+      if (n = _e - (d - a), a = d - _e, n > h) {
+        if (e.match_start = i, h = n, n >= f)
+          break;
+        u = l[a + h - 1], g = l[a + h];
+      }
+    }
+  while ((i = v[i & o]) > _ && --t !== 0);
+  return h <= e.lookahead ? h : e.lookahead;
+}
+function we(e) {
+  var i = e.w_size, t, a, r, n, h;
+  do {
+    if (n = e.window_size - e.lookahead - e.strstart, e.strstart >= i + (i - W)) {
+      B.arraySet(e.window, e.window, i, i, 0), e.match_start -= i, e.strstart -= i, e.block_start -= i, a = e.hash_size, t = a;
+      do
+        r = e.head[--t], e.head[t] = r >= i ? r - i : 0;
+      while (--a);
+      a = i, t = a;
+      do
+        r = e.prev[--t], e.prev[t] = r >= i ? r - i : 0;
+      while (--a);
+      n += i;
+    }
+    if (e.strm.avail_in === 0)
+      break;
+    if (a = zn(e.strm, e.window, e.strstart + e.lookahead, n), e.lookahead += a, e.lookahead + e.insert >= S)
+      for (h = e.strstart - e.insert, e.ins_h = e.window[h], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[h + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[h + S - 1]) & e.hash_mask, e.prev[h & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = h, h++, e.insert--, !(e.lookahead + e.insert < S)); )
+        ;
+  } while (e.lookahead < W && e.strm.avail_in !== 0);
+}
+function An(e, i) {
+  var t = 65535;
+  for (t > e.pending_buf_size - 5 && (t = e.pending_buf_size - 5); ; ) {
+    if (e.lookahead <= 1) {
+      if (we(e), e.lookahead === 0 && i === ke)
+        return D;
+      if (e.lookahead === 0)
+        break;
+    }
+    e.strstart += e.lookahead, e.lookahead = 0;
+    var a = e.block_start + t;
+    if ((e.strstart === 0 || e.strstart >= a) && (e.lookahead = e.strstart - a, e.strstart = a, R(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - W && (R(e, !1), e.strm.avail_out === 0))
+      return D;
+  }
+  return e.insert = 0, i === de ? (R(e, !0), e.strm.avail_out === 0 ? ge : Le) : (e.strstart > e.block_start && (R(e, !1), e.strm.avail_out === 0), D);
+}
+function St(e, i) {
+  for (var t, a; ; ) {
+    if (e.lookahead < W) {
+      if (we(e), e.lookahead < W && i === ke)
+        return D;
+      if (e.lookahead === 0)
+        break;
+    }
+    if (t = 0, e.lookahead >= S && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + S - 1]) & e.hash_mask, t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), t !== 0 && e.strstart - t <= e.w_size - W && (e.match_length = la(e, t)), e.match_length >= S)
+      if (a = Y._tr_tally(e, e.strstart - e.match_start, e.match_length - S), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= S) {
+        e.match_length--;
+        do
+          e.strstart++, e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + S - 1]) & e.hash_mask, t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
+        while (--e.match_length !== 0);
+        e.strstart++;
+      } else
+        e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + 1]) & e.hash_mask;
+    else
+      a = Y._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+    if (a && (R(e, !1), e.strm.avail_out === 0))
+      return D;
+  }
+  return e.insert = e.strstart < S - 1 ? e.strstart : S - 1, i === de ? (R(e, !0), e.strm.avail_out === 0 ? ge : Le) : e.last_lit && (R(e, !1), e.strm.avail_out === 0) ? D : We;
+}
+function ye(e, i) {
+  for (var t, a, r; ; ) {
+    if (e.lookahead < W) {
+      if (we(e), e.lookahead < W && i === ke)
+        return D;
+      if (e.lookahead === 0)
+        break;
+    }
+    if (t = 0, e.lookahead >= S && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + S - 1]) & e.hash_mask, t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = S - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - W && (e.match_length = la(e, t), e.match_length <= 5 && (e.strategy === sn || e.match_length === S && e.strstart - e.match_start > 4096) && (e.match_length = S - 1)), e.prev_length >= S && e.match_length <= e.prev_length) {
+      r = e.strstart + e.lookahead - S, a = Y._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - S), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+      do
+        ++e.strstart <= r && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + S - 1]) & e.hash_mask, t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
+      while (--e.prev_length !== 0);
+      if (e.match_available = 0, e.match_length = S - 1, e.strstart++, a && (R(e, !1), e.strm.avail_out === 0))
+        return D;
+    } else if (e.match_available) {
+      if (a = Y._tr_tally(e, 0, e.window[e.strstart - 1]), a && R(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
+        return D;
+    } else
+      e.match_available = 1, e.strstart++, e.lookahead--;
+  }
+  return e.match_available && (a = Y._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < S - 1 ? e.strstart : S - 1, i === de ? (R(e, !0), e.strm.avail_out === 0 ? ge : Le) : e.last_lit && (R(e, !1), e.strm.avail_out === 0) ? D : We;
+}
+function On(e, i) {
+  for (var t, a, r, n, h = e.window; ; ) {
+    if (e.lookahead <= _e) {
+      if (we(e), e.lookahead <= _e && i === ke)
+        return D;
+      if (e.lookahead === 0)
+        break;
+    }
+    if (e.match_length = 0, e.lookahead >= S && e.strstart > 0 && (r = e.strstart - 1, a = h[r], a === h[++r] && a === h[++r] && a === h[++r])) {
+      n = e.strstart + _e;
+      do
+        ;
+      while (a === h[++r] && a === h[++r] && a === h[++r] && a === h[++r] && a === h[++r] && a === h[++r] && a === h[++r] && a === h[++r] && r < n);
+      e.match_length = _e - (n - r), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+    }
+    if (e.match_length >= S ? (t = Y._tr_tally(e, 1, e.match_length - S), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = Y._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && (R(e, !1), e.strm.avail_out === 0))
+      return D;
+  }
+  return e.insert = 0, i === de ? (R(e, !0), e.strm.avail_out === 0 ? ge : Le) : e.last_lit && (R(e, !1), e.strm.avail_out === 0) ? D : We;
+}
+function Zn(e, i) {
+  for (var t; ; ) {
+    if (e.lookahead === 0 && (we(e), e.lookahead === 0)) {
+      if (i === ke)
+        return D;
+      break;
+    }
+    if (e.match_length = 0, t = Y._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, t && (R(e, !1), e.strm.avail_out === 0))
+      return D;
+  }
+  return e.insert = 0, i === de ? (R(e, !0), e.strm.avail_out === 0 ? ge : Le) : e.last_lit && (R(e, !1), e.strm.avail_out === 0) ? D : We;
+}
+function J(e, i, t, a, r) {
+  this.good_length = e, this.max_lazy = i, this.nice_length = t, this.max_chain = a, this.func = r;
+}
+var Fe;
+Fe = [
+  /*      good lazy nice chain */
+  new J(0, 0, 0, 0, An),
+  /* 0 store only */
+  new J(4, 4, 8, 4, St),
+  /* 1 max speed, no lazy matches */
+  new J(4, 5, 16, 8, St),
+  /* 2 */
+  new J(4, 6, 32, 32, St),
+  /* 3 */
+  new J(4, 4, 16, 16, ye),
+  /* 4 lazy matches */
+  new J(8, 16, 32, 32, ye),
+  /* 5 */
+  new J(8, 16, 128, 128, ye),
+  /* 6 */
+  new J(8, 32, 128, 256, ye),
+  /* 7 */
+  new J(32, 128, 258, 1024, ye),
+  /* 8 */
+  new J(32, 258, 258, 4096, ye)
+  /* 9 max compression */
+];
+function In(e) {
+  e.window_size = 2 * e.w_size, oe(e.head), e.max_lazy_match = Fe[e.level].max_lazy, e.good_match = Fe[e.level].good_length, e.nice_match = Fe[e.level].nice_length, e.max_chain_length = Fe[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = S - 1, e.match_available = 0, e.ins_h = 0;
+}
+function Ln() {
+  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = vt, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new B.Buf16(mn * 2), this.dyn_dtree = new B.Buf16((2 * Sn + 1) * 2), this.bl_tree = new B.Buf16((2 * yn + 1) * 2), oe(this.dyn_ltree), oe(this.dyn_dtree), oe(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new B.Buf16(Fn + 1), this.heap = new B.Buf16(2 * It + 1), oe(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new B.Buf16(2 * It + 1), oe(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+}
+function oa(e) {
+  var i;
+  return !e || !e.state ? ue(e, X) : (e.total_in = e.total_out = 0, e.data_type = wn, i = e.state, i.pending = 0, i.pending_out = 0, i.wrap < 0 && (i.wrap = -i.wrap), i.status = i.wrap ? gt : ce, e.adler = i.wrap === 2 ? 0 : 1, i.last_flush = ke, Y._tr_init(i), te);
+}
+function _a(e) {
+  var i = oa(e);
+  return i === te && In(e.state), i;
+}
+function Dn(e, i) {
+  return !e || !e.state || e.state.wrap !== 2 ? X : (e.state.gzhead = i, te);
+}
+function ua(e, i, t, a, r, n) {
+  if (!e)
+    return X;
+  var h = 1;
+  if (i === dn && (i = 6), a < 0 ? (h = 0, a = -a) : a > 15 && (h = 2, a -= 16), r < 1 || r > bn || t !== vt || a < 8 || a > 15 || i < 0 || i > 9 || n < 0 || n > vn)
+    return ue(e, X);
+  a === 8 && (a = 9);
+  var f = new Ln();
+  return e.state = f, f.strm = e, f.wrap = h, f.gzhead = null, f.w_bits = a, f.w_size = 1 << f.w_bits, f.w_mask = f.w_size - 1, f.hash_bits = r + 7, f.hash_size = 1 << f.hash_bits, f.hash_mask = f.hash_size - 1, f.hash_shift = ~~((f.hash_bits + S - 1) / S), f.window = new B.Buf8(f.w_size * 2), f.head = new B.Buf16(f.hash_size), f.prev = new B.Buf16(f.w_size), f.lit_bufsize = 1 << r + 6, f.pending_buf_size = f.lit_bufsize * 4, f.pending_buf = new B.Buf8(f.pending_buf_size), f.d_buf = 1 * f.lit_bufsize, f.l_buf = (1 + 2) * f.lit_bufsize, f.level = i, f.strategy = n, f.method = t, _a(e);
+}
+function Rn(e, i) {
+  return ua(e, i, vt, pn, xn, gn);
+}
+function Bn(e, i) {
+  var t, a, r, n;
+  if (!e || !e.state || i > ai || i < 0)
+    return e ? ue(e, X) : X;
+  if (a = e.state, !e.output || !e.input && e.avail_in !== 0 || a.status === Re && i !== de)
+    return ue(e, e.avail_out === 0 ? Et : X);
+  if (a.strm = e, t = a.last_flush, a.last_flush = i, a.status === gt)
+    if (a.wrap === 2)
+      e.adler = 0, F(a, 31), F(a, 139), F(a, 8), a.gzhead ? (F(
+        a,
+        (a.gzhead.text ? 1 : 0) + (a.gzhead.hcrc ? 2 : 0) + (a.gzhead.extra ? 4 : 0) + (a.gzhead.name ? 8 : 0) + (a.gzhead.comment ? 16 : 0)
+      ), F(a, a.gzhead.time & 255), F(a, a.gzhead.time >> 8 & 255), F(a, a.gzhead.time >> 16 & 255), F(a, a.gzhead.time >> 24 & 255), F(a, a.level === 9 ? 2 : a.strategy >= tt || a.level < 2 ? 4 : 0), F(a, a.gzhead.os & 255), a.gzhead.extra && a.gzhead.extra.length && (F(a, a.gzhead.extra.length & 255), F(a, a.gzhead.extra.length >> 8 & 255)), a.gzhead.hcrc && (e.adler = he(e.adler, a.pending_buf, a.pending, 0)), a.gzindex = 0, a.status = Lt) : (F(a, 0), F(a, 0), F(a, 0), F(a, 0), F(a, 0), F(a, a.level === 9 ? 2 : a.strategy >= tt || a.level < 2 ? 4 : 0), F(a, Nn), a.status = ce);
+    else {
+      var h = vt + (a.w_bits - 8 << 4) << 8, f = -1;
+      a.strategy >= tt || a.level < 2 ? f = 0 : a.level < 6 ? f = 1 : a.level === 6 ? f = 2 : f = 3, h |= f << 6, a.strstart !== 0 && (h |= Tn), h += 31 - h % 31, a.status = ce, De(a, h), a.strstart !== 0 && (De(a, e.adler >>> 16), De(a, e.adler & 65535)), e.adler = 1;
+    }
+  if (a.status === Lt)
+    if (a.gzhead.extra) {
+      for (r = a.pending; a.gzindex < (a.gzhead.extra.length & 65535) && !(a.pending === a.pending_buf_size && (a.gzhead.hcrc && a.pending > r && (e.adler = he(e.adler, a.pending_buf, a.pending - r, r)), le(e), r = a.pending, a.pending === a.pending_buf_size)); )
+        F(a, a.gzhead.extra[a.gzindex] & 255), a.gzindex++;
+      a.gzhead.hcrc && a.pending > r && (e.adler = he(e.adler, a.pending_buf, a.pending - r, r)), a.gzindex === a.gzhead.extra.length && (a.gzindex = 0, a.status = ht);
+    } else
+      a.status = ht;
+  if (a.status === ht)
+    if (a.gzhead.name) {
+      r = a.pending;
+      do {
+        if (a.pending === a.pending_buf_size && (a.gzhead.hcrc && a.pending > r && (e.adler = he(e.adler, a.pending_buf, a.pending - r, r)), le(e), r = a.pending, a.pending === a.pending_buf_size)) {
+          n = 1;
+          break;
+        }
+        a.gzindex < a.gzhead.name.length ? n = a.gzhead.name.charCodeAt(a.gzindex++) & 255 : n = 0, F(a, n);
+      } while (n !== 0);
+      a.gzhead.hcrc && a.pending > r && (e.adler = he(e.adler, a.pending_buf, a.pending - r, r)), n === 0 && (a.gzindex = 0, a.status = lt);
+    } else
+      a.status = lt;
+  if (a.status === lt)
+    if (a.gzhead.comment) {
+      r = a.pending;
+      do {
+        if (a.pending === a.pending_buf_size && (a.gzhead.hcrc && a.pending > r && (e.adler = he(e.adler, a.pending_buf, a.pending - r, r)), le(e), r = a.pending, a.pending === a.pending_buf_size)) {
+          n = 1;
+          break;
+        }
+        a.gzindex < a.gzhead.comment.length ? n = a.gzhead.comment.charCodeAt(a.gzindex++) & 255 : n = 0, F(a, n);
+      } while (n !== 0);
+      a.gzhead.hcrc && a.pending > r && (e.adler = he(e.adler, a.pending_buf, a.pending - r, r)), n === 0 && (a.status = ot);
+    } else
+      a.status = ot;
+  if (a.status === ot && (a.gzhead.hcrc ? (a.pending + 2 > a.pending_buf_size && le(e), a.pending + 2 <= a.pending_buf_size && (F(a, e.adler & 255), F(a, e.adler >> 8 & 255), e.adler = 0, a.status = ce)) : a.status = ce), a.pending !== 0) {
+    if (le(e), e.avail_out === 0)
+      return a.last_flush = -1, te;
+  } else if (e.avail_in === 0 && ri(i) <= ri(t) && i !== de)
+    return ue(e, Et);
+  if (a.status === Re && e.avail_in !== 0)
+    return ue(e, Et);
+  if (e.avail_in !== 0 || a.lookahead !== 0 || i !== ke && a.status !== Re) {
+    var _ = a.strategy === tt ? Zn(a, i) : a.strategy === cn ? On(a, i) : Fe[a.level].func(a, i);
+    if ((_ === ge || _ === Le) && (a.status = Re), _ === D || _ === ge)
+      return e.avail_out === 0 && (a.last_flush = -1), te;
+    if (_ === We && (i === on ? Y._tr_align(a) : i !== ai && (Y._tr_stored_block(a, 0, 0, !1), i === _n && (oe(a.head), a.lookahead === 0 && (a.strstart = 0, a.block_start = 0, a.insert = 0))), le(e), e.avail_out === 0))
+      return a.last_flush = -1, te;
+  }
+  return i !== de ? te : a.wrap <= 0 ? ni : (a.wrap === 2 ? (F(a, e.adler & 255), F(a, e.adler >> 8 & 255), F(a, e.adler >> 16 & 255), F(a, e.adler >> 24 & 255), F(a, e.total_in & 255), F(a, e.total_in >> 8 & 255), F(a, e.total_in >> 16 & 255), F(a, e.total_in >> 24 & 255)) : (De(a, e.adler >>> 16), De(a, e.adler & 65535)), le(e), a.wrap > 0 && (a.wrap = -a.wrap), a.pending !== 0 ? te : ni);
+}
+function Cn(e) {
+  var i;
+  return !e || !e.state ? X : (i = e.state.status, i !== gt && i !== Lt && i !== ht && i !== lt && i !== ot && i !== ce && i !== Re ? ue(e, X) : (e.state = null, i === ce ? ue(e, un) : te));
+}
+function Un(e, i) {
+  var t = i.length, a, r, n, h, f, _, l, o;
+  if (!e || !e.state || (a = e.state, h = a.wrap, h === 2 || h === 1 && a.status !== gt || a.lookahead))
+    return X;
+  for (h === 1 && (e.adler = ha(e.adler, i, t, 0)), a.wrap = 0, t >= a.w_size && (h === 0 && (oe(a.head), a.strstart = 0, a.block_start = 0, a.insert = 0), o = new B.Buf8(a.w_size), B.arraySet(o, i, t - a.w_size, a.w_size, 0), i = o, t = a.w_size), f = e.avail_in, _ = e.next_in, l = e.input, e.avail_in = t, e.next_in = 0, e.input = i, we(a); a.lookahead >= S; ) {
+    r = a.strstart, n = a.lookahead - (S - 1);
+    do
+      a.ins_h = (a.ins_h << a.hash_shift ^ a.window[r + S - 1]) & a.hash_mask, a.prev[r & a.w_mask] = a.head[a.ins_h], a.head[a.ins_h] = r, r++;
+    while (--n);
+    a.strstart = r, a.lookahead = S - 1, we(a);
+  }
+  return a.strstart += a.lookahead, a.block_start = a.strstart, a.insert = a.lookahead, a.lookahead = 0, a.match_length = a.prev_length = S - 1, a.match_available = 0, e.next_in = _, e.input = l, e.avail_in = f, a.wrap = h, te;
+}
+ie.deflateInit = Rn;
+ie.deflateInit2 = ua;
+ie.deflateReset = _a;
+ie.deflateResetKeep = oa;
+ie.deflateSetHeader = Dn;
+ie.deflate = Bn;
+ie.deflateEnd = Cn;
+ie.deflateSetDictionary = Un;
+ie.deflateInfo = "pako deflate (from Nodeca project)";
+var Ee = {}, wt = re, da = !0, sa = !0;
+try {
+  String.fromCharCode.apply(null, [0]);
+} catch {
+  da = !1;
+}
+try {
+  String.fromCharCode.apply(null, new Uint8Array(1));
+} catch {
+  sa = !1;
+}
+var Xe = new wt.Buf8(256);
+for (var fe = 0; fe < 256; fe++)
+  Xe[fe] = fe >= 252 ? 6 : fe >= 248 ? 5 : fe >= 240 ? 4 : fe >= 224 ? 3 : fe >= 192 ? 2 : 1;
+Xe[254] = Xe[254] = 1;
+Ee.string2buf = function(e) {
+  var i, t, a, r, n, h = e.length, f = 0;
+  for (r = 0; r < h; r++)
+    t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < h && (a = e.charCodeAt(r + 1), (a & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (a - 56320), r++)), f += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
+  for (i = new wt.Buf8(f), n = 0, r = 0; n < f; r++)
+    t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < h && (a = e.charCodeAt(r + 1), (a & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (a - 56320), r++)), t < 128 ? i[n++] = t : t < 2048 ? (i[n++] = 192 | t >>> 6, i[n++] = 128 | t & 63) : t < 65536 ? (i[n++] = 224 | t >>> 12, i[n++] = 128 | t >>> 6 & 63, i[n++] = 128 | t & 63) : (i[n++] = 240 | t >>> 18, i[n++] = 128 | t >>> 12 & 63, i[n++] = 128 | t >>> 6 & 63, i[n++] = 128 | t & 63);
+  return i;
+};
+function ca(e, i) {
+  if (i < 65534 && (e.subarray && sa || !e.subarray && da))
+    return String.fromCharCode.apply(null, wt.shrinkBuf(e, i));
+  for (var t = "", a = 0; a < i; a++)
+    t += String.fromCharCode(e[a]);
+  return t;
+}
+Ee.buf2binstring = function(e) {
+  return ca(e, e.length);
+};
+Ee.binstring2buf = function(e) {
+  for (var i = new wt.Buf8(e.length), t = 0, a = i.length; t < a; t++)
+    i[t] = e.charCodeAt(t);
+  return i;
+};
+Ee.buf2string = function(e, i) {
+  var t, a, r, n, h = i || e.length, f = new Array(h * 2);
+  for (a = 0, t = 0; t < h; ) {
+    if (r = e[t++], r < 128) {
+      f[a++] = r;
+      continue;
+    }
+    if (n = Xe[r], n > 4) {
+      f[a++] = 65533, t += n - 1;
+      continue;
+    }
+    for (r &= n === 2 ? 31 : n === 3 ? 15 : 7; n > 1 && t < h; )
+      r = r << 6 | e[t++] & 63, n--;
+    if (n > 1) {
+      f[a++] = 65533;
+      continue;
+    }
+    r < 65536 ? f[a++] = r : (r -= 65536, f[a++] = 55296 | r >> 10 & 1023, f[a++] = 56320 | r & 1023);
+  }
+  return ca(f, a);
+};
+Ee.utf8border = function(e, i) {
+  var t;
+  for (i = i || e.length, i > e.length && (i = e.length), t = i - 1; t >= 0 && (e[t] & 192) === 128; )
+    t--;
+  return t < 0 || t === 0 ? i : t + Xe[e[t]] > i ? t : i;
+};
+function $n() {
+  this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
+}
+var va = $n, Ce = ie, Ue = re, Dt = Ee, Rt = Kt, Mn = va, ga = Object.prototype.toString, Hn = 0, yt = 4, ze = 0, fi = 1, hi = 2, Pn = -1, Kn = 0, Yn = 8;
+function be(e) {
+  if (!(this instanceof be))
+    return new be(e);
+  this.options = Ue.assign({
+    level: Pn,
+    method: Yn,
+    chunkSize: 16384,
+    windowBits: 15,
+    memLevel: 8,
+    strategy: Kn,
+    to: ""
+  }, e || {});
+  var i = this.options;
+  i.raw && i.windowBits > 0 ? i.windowBits = -i.windowBits : i.gzip && i.windowBits > 0 && i.windowBits < 16 && (i.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Mn(), this.strm.avail_out = 0;
+  var t = Ce.deflateInit2(
+    this.strm,
+    i.level,
+    i.method,
+    i.windowBits,
+    i.memLevel,
+    i.strategy
+  );
+  if (t !== ze)
+    throw new Error(Rt[t]);
+  if (i.header && Ce.deflateSetHeader(this.strm, i.header), i.dictionary) {
+    var a;
+    if (typeof i.dictionary == "string" ? a = Dt.string2buf(i.dictionary) : ga.call(i.dictionary) === "[object ArrayBuffer]" ? a = new Uint8Array(i.dictionary) : a = i.dictionary, t = Ce.deflateSetDictionary(this.strm, a), t !== ze)
+      throw new Error(Rt[t]);
+    this._dict_set = !0;
+  }
+}
+be.prototype.push = function(e, i) {
+  var t = this.strm, a = this.options.chunkSize, r, n;
+  if (this.ended)
+    return !1;
+  n = i === ~~i ? i : i === !0 ? yt : Hn, typeof e == "string" ? t.input = Dt.string2buf(e) : ga.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length;
+  do {
+    if (t.avail_out === 0 && (t.output = new Ue.Buf8(a), t.next_out = 0, t.avail_out = a), r = Ce.deflate(t, n), r !== fi && r !== ze)
+      return this.onEnd(r), this.ended = !0, !1;
+    (t.avail_out === 0 || t.avail_in === 0 && (n === yt || n === hi)) && (this.options.to === "string" ? this.onData(Dt.buf2binstring(Ue.shrinkBuf(t.output, t.next_out))) : this.onData(Ue.shrinkBuf(t.output, t.next_out)));
+  } while ((t.avail_in > 0 || t.avail_out === 0) && r !== fi);
+  return n === yt ? (r = Ce.deflateEnd(this.strm), this.onEnd(r), this.ended = !0, r === ze) : (n === hi && (this.onEnd(ze), t.avail_out = 0), !0);
+};
+be.prototype.onData = function(e) {
+  this.chunks.push(e);
+};
+be.prototype.onEnd = function(e) {
+  e === ze && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = Ue.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+};
+function Yt(e, i) {
+  var t = new be(i);
+  if (t.push(e, !0), t.err)
+    throw t.msg || Rt[t.err];
+  return t.result;
+}
+function Xn(e, i) {
+  return i = i || {}, i.raw = !0, Yt(e, i);
+}
+function qn(e, i) {
+  return i = i || {}, i.gzip = !0, Yt(e, i);
+}
+qe.Deflate = be;
+qe.deflate = Yt;
+qe.deflateRaw = Xn;
+qe.gzip = qn;
+var je = {}, j = {}, it = 30, Gn = 12, Wn = function(i, t) {
+  var a, r, n, h, f, _, l, o, v, d, u, g, w, k, b, N, z, E, c, T, y, p, m, I, x;
+  a = i.state, r = i.next_in, I = i.input, n = r + (i.avail_in - 5), h = i.next_out, x = i.output, f = h - (t - i.avail_out), _ = h + (i.avail_out - 257), l = a.dmax, o = a.wsize, v = a.whave, d = a.wnext, u = a.window, g = a.hold, w = a.bits, k = a.lencode, b = a.distcode, N = (1 << a.lenbits) - 1, z = (1 << a.distbits) - 1;
+  e:
+    do {
+      w < 15 && (g += I[r++] << w, w += 8, g += I[r++] << w, w += 8), E = k[g & N];
+      t:
+        for (; ; ) {
+          if (c = E >>> 24, g >>>= c, w -= c, c = E >>> 16 & 255, c === 0)
+            x[h++] = E & 65535;
+          else if (c & 16) {
+            T = E & 65535, c &= 15, c && (w < c && (g += I[r++] << w, w += 8), T += g & (1 << c) - 1, g >>>= c, w -= c), w < 15 && (g += I[r++] << w, w += 8, g += I[r++] << w, w += 8), E = b[g & z];
+            i:
+              for (; ; ) {
+                if (c = E >>> 24, g >>>= c, w -= c, c = E >>> 16 & 255, c & 16) {
+                  if (y = E & 65535, c &= 15, w < c && (g += I[r++] << w, w += 8, w < c && (g += I[r++] << w, w += 8)), y += g & (1 << c) - 1, y > l) {
+                    i.msg = "invalid distance too far back", a.mode = it;
+                    break e;
+                  }
+                  if (g >>>= c, w -= c, c = h - f, y > c) {
+                    if (c = y - c, c > v && a.sane) {
+                      i.msg = "invalid distance too far back", a.mode = it;
+                      break e;
+                    }
+                    if (p = 0, m = u, d === 0) {
+                      if (p += o - c, c < T) {
+                        T -= c;
+                        do
+                          x[h++] = u[p++];
+                        while (--c);
+                        p = h - y, m = x;
+                      }
+                    } else if (d < c) {
+                      if (p += o + d - c, c -= d, c < T) {
+                        T -= c;
+                        do
+                          x[h++] = u[p++];
+                        while (--c);
+                        if (p = 0, d < T) {
+                          c = d, T -= c;
+                          do
+                            x[h++] = u[p++];
+                          while (--c);
+                          p = h - y, m = x;
+                        }
+                      }
+                    } else if (p += d - c, c < T) {
+                      T -= c;
+                      do
+                        x[h++] = u[p++];
+                      while (--c);
+                      p = h - y, m = x;
+                    }
+                    for (; T > 2; )
+                      x[h++] = m[p++], x[h++] = m[p++], x[h++] = m[p++], T -= 3;
+                    T && (x[h++] = m[p++], T > 1 && (x[h++] = m[p++]));
+                  } else {
+                    p = h - y;
+                    do
+                      x[h++] = x[p++], x[h++] = x[p++], x[h++] = x[p++], T -= 3;
+                    while (T > 2);
+                    T && (x[h++] = x[p++], T > 1 && (x[h++] = x[p++]));
+                  }
+                } else if (c & 64) {
+                  i.msg = "invalid distance code", a.mode = it;
+                  break e;
+                } else {
+                  E = b[(E & 65535) + (g & (1 << c) - 1)];
+                  continue i;
+                }
+                break;
+              }
+          } else if (c & 64)
+            if (c & 32) {
+              a.mode = Gn;
+              break e;
+            } else {
+              i.msg = "invalid literal/length code", a.mode = it;
+              break e;
+            }
+          else {
+            E = k[(E & 65535) + (g & (1 << c) - 1)];
+            continue t;
+          }
+          break;
+        }
+    } while (r < n && h < _);
+  T = w >> 3, r -= T, w -= T << 3, g &= (1 << w) - 1, i.next_in = r, i.next_out = h, i.avail_in = r < n ? 5 + (n - r) : 5 - (r - n), i.avail_out = h < _ ? 257 + (_ - h) : 257 - (h - _), a.hold = g, a.bits = w;
+}, li = re, me = 15, oi = 852, _i = 592, ui = 0, mt = 1, di = 2, jn = [
+  /* Length codes 257..285 base */
+  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
+], Vn = [
+  /* Length codes 257..285 extra */
+  16,
+  16,
+  16,
+  16,
+  16,
+  16,
+  16,
+  16,
+  17,
+  17,
+  17,
+  17,
+  18,
+  18,
+  18,
+  18,
+  19,
+  19,
+  19,
+  19,
+  20,
+  20,
+  20,
+  20,
+  21,
+  21,
+  21,
+  21,
+  16,
+  72,
+  78
+], Jn = [
+  /* Distance codes 0..29 base */
+  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,
+  0,
+  0
+], Qn = [
+  /* Distance codes 0..29 extra */
+  16,
+  16,
+  16,
+  16,
+  17,
+  17,
+  18,
+  18,
+  19,
+  19,
+  20,
+  20,
+  21,
+  21,
+  22,
+  22,
+  23,
+  23,
+  24,
+  24,
+  25,
+  25,
+  26,
+  26,
+  27,
+  27,
+  28,
+  28,
+  29,
+  29,
+  64,
+  64
+], er = function(i, t, a, r, n, h, f, _) {
+  var l = _.bits, o = 0, v = 0, d = 0, u = 0, g = 0, w = 0, k = 0, b = 0, N = 0, z = 0, E, c, T, y, p, m = null, I = 0, x, G = new li.Buf16(me + 1), Ve = new li.Buf16(me + 1), Je = null, Gt = 0, Wt, Qe, et;
+  for (o = 0; o <= me; o++)
+    G[o] = 0;
+  for (v = 0; v < r; v++)
+    G[t[a + v]]++;
+  for (g = l, u = me; u >= 1 && G[u] === 0; u--)
+    ;
+  if (g > u && (g = u), u === 0)
+    return n[h++] = 1 << 24 | 64 << 16 | 0, n[h++] = 1 << 24 | 64 << 16 | 0, _.bits = 1, 0;
+  for (d = 1; d < u && G[d] === 0; d++)
+    ;
+  for (g < d && (g = d), b = 1, o = 1; o <= me; o++)
+    if (b <<= 1, b -= G[o], b < 0)
+      return -1;
+  if (b > 0 && (i === ui || u !== 1))
+    return -1;
+  for (Ve[1] = 0, o = 1; o < me; o++)
+    Ve[o + 1] = Ve[o] + G[o];
+  for (v = 0; v < r; v++)
+    t[a + v] !== 0 && (f[Ve[t[a + v]]++] = v);
+  if (i === ui ? (m = Je = f, x = 19) : i === mt ? (m = jn, I -= 257, Je = Vn, Gt -= 257, x = 256) : (m = Jn, Je = Qn, x = -1), z = 0, v = 0, o = d, p = h, w = g, k = 0, T = -1, N = 1 << g, y = N - 1, i === mt && N > oi || i === di && N > _i)
+    return 1;
+  for (; ; ) {
+    Wt = o - k, f[v] < x ? (Qe = 0, et = f[v]) : f[v] > x ? (Qe = Je[Gt + f[v]], et = m[I + f[v]]) : (Qe = 32 + 64, et = 0), E = 1 << o - k, c = 1 << w, d = c;
+    do
+      c -= E, n[p + (z >> k) + c] = Wt << 24 | Qe << 16 | et | 0;
+    while (c !== 0);
+    for (E = 1 << o - 1; z & E; )
+      E >>= 1;
+    if (E !== 0 ? (z &= E - 1, z += E) : z = 0, v++, --G[o] === 0) {
+      if (o === u)
+        break;
+      o = t[a + f[v]];
+    }
+    if (o > g && (z & y) !== T) {
+      for (k === 0 && (k = g), p += d, w = o - k, b = 1 << w; w + k < u && (b -= G[w + k], !(b <= 0)); )
+        w++, b <<= 1;
+      if (N += 1 << w, i === mt && N > oi || i === di && N > _i)
+        return 1;
+      T = z & y, n[T] = g << 24 | w << 16 | p - h | 0;
+    }
+  }
+  return z !== 0 && (n[p + z] = o - k << 24 | 64 << 16 | 0), _.bits = g, 0;
+}, M = re, Bt = ra, Q = fa, tr = Wn, $e = er, ir = 0, wa = 1, ba = 2, si = 4, ar = 5, at = 6, pe = 0, nr = 1, rr = 2, q = -2, pa = -3, xa = -4, fr = -5, ci = 8, ka = 1, vi = 2, gi = 3, wi = 4, bi = 5, pi = 6, xi = 7, ki = 8, Ei = 9, Si = 10, dt = 11, ae = 12, Ft = 13, yi = 14, Tt = 15, mi = 16, Fi = 17, Ti = 18, Ni = 19, nt = 20, rt = 21, zi = 22, Ai = 23, Oi = 24, Zi = 25, Ii = 26, Nt = 27, Li = 28, Di = 29, Z = 30, Ea = 31, hr = 32, lr = 852, or = 592, _r = 15, ur = _r;
+function Ri(e) {
+  return (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
+}
+function dr() {
+  this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new M.Buf16(320), this.work = new M.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+}
+function Sa(e) {
+  var i;
+  return !e || !e.state ? q : (i = e.state, e.total_in = e.total_out = i.total = 0, e.msg = "", i.wrap && (e.adler = i.wrap & 1), i.mode = ka, i.last = 0, i.havedict = 0, i.dmax = 32768, i.head = null, i.hold = 0, i.bits = 0, i.lencode = i.lendyn = new M.Buf32(lr), i.distcode = i.distdyn = new M.Buf32(or), i.sane = 1, i.back = -1, pe);
+}
+function ya(e) {
+  var i;
+  return !e || !e.state ? q : (i = e.state, i.wsize = 0, i.whave = 0, i.wnext = 0, Sa(e));
+}
+function ma(e, i) {
+  var t, a;
+  return !e || !e.state || (a = e.state, i < 0 ? (t = 0, i = -i) : (t = (i >> 4) + 1, i < 48 && (i &= 15)), i && (i < 8 || i > 15)) ? q : (a.window !== null && a.wbits !== i && (a.window = null), a.wrap = t, a.wbits = i, ya(e));
+}
+function Fa(e, i) {
+  var t, a;
+  return e ? (a = new dr(), e.state = a, a.window = null, t = ma(e, i), t !== pe && (e.state = null), t) : q;
+}
+function sr(e) {
+  return Fa(e, ur);
+}
+var Bi = !0, zt, At;
+function cr(e) {
+  if (Bi) {
+    var i;
+    for (zt = new M.Buf32(512), At = new M.Buf32(32), i = 0; i < 144; )
+      e.lens[i++] = 8;
+    for (; i < 256; )
+      e.lens[i++] = 9;
+    for (; i < 280; )
+      e.lens[i++] = 7;
+    for (; i < 288; )
+      e.lens[i++] = 8;
+    for ($e(wa, e.lens, 0, 288, zt, 0, e.work, { bits: 9 }), i = 0; i < 32; )
+      e.lens[i++] = 5;
+    $e(ba, e.lens, 0, 32, At, 0, e.work, { bits: 5 }), Bi = !1;
+  }
+  e.lencode = zt, e.lenbits = 9, e.distcode = At, e.distbits = 5;
+}
+function Ta(e, i, t, a) {
+  var r, n = e.state;
+  return n.window === null && (n.wsize = 1 << n.wbits, n.wnext = 0, n.whave = 0, n.window = new M.Buf8(n.wsize)), a >= n.wsize ? (M.arraySet(n.window, i, t - n.wsize, n.wsize, 0), n.wnext = 0, n.whave = n.wsize) : (r = n.wsize - n.wnext, r > a && (r = a), M.arraySet(n.window, i, t - a, r, n.wnext), a -= r, a ? (M.arraySet(n.window, i, t - a, a, 0), n.wnext = a, n.whave = n.wsize) : (n.wnext += r, n.wnext === n.wsize && (n.wnext = 0), n.whave < n.wsize && (n.whave += r))), 0;
+}
+function vr(e, i) {
+  var t, a, r, n, h, f, _, l, o, v, d, u, g, w, k = 0, b, N, z, E, c, T, y, p, m = new M.Buf8(4), I, x, G = (
+    /* permutation of code lengths */
+    [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]
+  );
+  if (!e || !e.state || !e.output || !e.input && e.avail_in !== 0)
+    return q;
+  t = e.state, t.mode === ae && (t.mode = Ft), h = e.next_out, r = e.output, _ = e.avail_out, n = e.next_in, a = e.input, f = e.avail_in, l = t.hold, o = t.bits, v = f, d = _, p = pe;
+  e:
+    for (; ; )
+      switch (t.mode) {
+        case ka:
+          if (t.wrap === 0) {
+            t.mode = Ft;
+            break;
+          }
+          for (; o < 16; ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          if (t.wrap & 2 && l === 35615) {
+            t.check = 0, m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = Q(t.check, m, 2, 0), l = 0, o = 0, t.mode = vi;
+            break;
+          }
+          if (t.flags = 0, t.head && (t.head.done = !1), !(t.wrap & 1) || /* check if zlib header allowed */
+          (((l & 255) << 8) + (l >> 8)) % 31) {
+            e.msg = "incorrect header check", t.mode = Z;
+            break;
+          }
+          if ((l & 15) !== ci) {
+            e.msg = "unknown compression method", t.mode = Z;
+            break;
+          }
+          if (l >>>= 4, o -= 4, y = (l & 15) + 8, t.wbits === 0)
+            t.wbits = y;
+          else if (y > t.wbits) {
+            e.msg = "invalid window size", t.mode = Z;
+            break;
+          }
+          t.dmax = 1 << y, e.adler = t.check = 1, t.mode = l & 512 ? Si : ae, l = 0, o = 0;
+          break;
+        case vi:
+          for (; o < 16; ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          if (t.flags = l, (t.flags & 255) !== ci) {
+            e.msg = "unknown compression method", t.mode = Z;
+            break;
+          }
+          if (t.flags & 57344) {
+            e.msg = "unknown header flags set", t.mode = Z;
+            break;
+          }
+          t.head && (t.head.text = l >> 8 & 1), t.flags & 512 && (m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = Q(t.check, m, 2, 0)), l = 0, o = 0, t.mode = gi;
+        case gi:
+          for (; o < 32; ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          t.head && (t.head.time = l), t.flags & 512 && (m[0] = l & 255, m[1] = l >>> 8 & 255, m[2] = l >>> 16 & 255, m[3] = l >>> 24 & 255, t.check = Q(t.check, m, 4, 0)), l = 0, o = 0, t.mode = wi;
+        case wi:
+          for (; o < 16; ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          t.head && (t.head.xflags = l & 255, t.head.os = l >> 8), t.flags & 512 && (m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = Q(t.check, m, 2, 0)), l = 0, o = 0, t.mode = bi;
+        case bi:
+          if (t.flags & 1024) {
+            for (; o < 16; ) {
+              if (f === 0)
+                break e;
+              f--, l += a[n++] << o, o += 8;
+            }
+            t.length = l, t.head && (t.head.extra_len = l), t.flags & 512 && (m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = Q(t.check, m, 2, 0)), l = 0, o = 0;
+          } else
+            t.head && (t.head.extra = null);
+          t.mode = pi;
+        case pi:
+          if (t.flags & 1024 && (u = t.length, u > f && (u = f), u && (t.head && (y = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Array(t.head.extra_len)), M.arraySet(
+            t.head.extra,
+            a,
+            n,
+            // extra field is limited to 65536 bytes
+            // - no need for additional size check
+            u,
+            /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
+            y
+          )), t.flags & 512 && (t.check = Q(t.check, a, u, n)), f -= u, n += u, t.length -= u), t.length))
+            break e;
+          t.length = 0, t.mode = xi;
+        case xi:
+          if (t.flags & 2048) {
+            if (f === 0)
+              break e;
+            u = 0;
+            do
+              y = a[n + u++], t.head && y && t.length < 65536 && (t.head.name += String.fromCharCode(y));
+            while (y && u < f);
+            if (t.flags & 512 && (t.check = Q(t.check, a, u, n)), f -= u, n += u, y)
+              break e;
+          } else
+            t.head && (t.head.name = null);
+          t.length = 0, t.mode = ki;
+        case ki:
+          if (t.flags & 4096) {
+            if (f === 0)
+              break e;
+            u = 0;
+            do
+              y = a[n + u++], t.head && y && t.length < 65536 && (t.head.comment += String.fromCharCode(y));
+            while (y && u < f);
+            if (t.flags & 512 && (t.check = Q(t.check, a, u, n)), f -= u, n += u, y)
+              break e;
+          } else
+            t.head && (t.head.comment = null);
+          t.mode = Ei;
+        case Ei:
+          if (t.flags & 512) {
+            for (; o < 16; ) {
+              if (f === 0)
+                break e;
+              f--, l += a[n++] << o, o += 8;
+            }
+            if (l !== (t.check & 65535)) {
+              e.msg = "header crc mismatch", t.mode = Z;
+              break;
+            }
+            l = 0, o = 0;
+          }
+          t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = !0), e.adler = t.check = 0, t.mode = ae;
+          break;
+        case Si:
+          for (; o < 32; ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          e.adler = t.check = Ri(l), l = 0, o = 0, t.mode = dt;
+        case dt:
+          if (t.havedict === 0)
+            return e.next_out = h, e.avail_out = _, e.next_in = n, e.avail_in = f, t.hold = l, t.bits = o, rr;
+          e.adler = t.check = 1, t.mode = ae;
+        case ae:
+          if (i === ar || i === at)
+            break e;
+        case Ft:
+          if (t.last) {
+            l >>>= o & 7, o -= o & 7, t.mode = Nt;
+            break;
+          }
+          for (; o < 3; ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          switch (t.last = l & 1, l >>>= 1, o -= 1, l & 3) {
+            case 0:
+              t.mode = yi;
+              break;
+            case 1:
+              if (cr(t), t.mode = nt, i === at) {
+                l >>>= 2, o -= 2;
+                break e;
+              }
+              break;
+            case 2:
+              t.mode = Fi;
+              break;
+            case 3:
+              e.msg = "invalid block type", t.mode = Z;
+          }
+          l >>>= 2, o -= 2;
+          break;
+        case yi:
+          for (l >>>= o & 7, o -= o & 7; o < 32; ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          if ((l & 65535) !== (l >>> 16 ^ 65535)) {
+            e.msg = "invalid stored block lengths", t.mode = Z;
+            break;
+          }
+          if (t.length = l & 65535, l = 0, o = 0, t.mode = Tt, i === at)
+            break e;
+        case Tt:
+          t.mode = mi;
+        case mi:
+          if (u = t.length, u) {
+            if (u > f && (u = f), u > _ && (u = _), u === 0)
+              break e;
+            M.arraySet(r, a, n, u, h), f -= u, n += u, _ -= u, h += u, t.length -= u;
+            break;
+          }
+          t.mode = ae;
+          break;
+        case Fi:
+          for (; o < 14; ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          if (t.nlen = (l & 31) + 257, l >>>= 5, o -= 5, t.ndist = (l & 31) + 1, l >>>= 5, o -= 5, t.ncode = (l & 15) + 4, l >>>= 4, o -= 4, t.nlen > 286 || t.ndist > 30) {
+            e.msg = "too many length or distance symbols", t.mode = Z;
+            break;
+          }
+          t.have = 0, t.mode = Ti;
+        case Ti:
+          for (; t.have < t.ncode; ) {
+            for (; o < 3; ) {
+              if (f === 0)
+                break e;
+              f--, l += a[n++] << o, o += 8;
+            }
+            t.lens[G[t.have++]] = l & 7, l >>>= 3, o -= 3;
+          }
+          for (; t.have < 19; )
+            t.lens[G[t.have++]] = 0;
+          if (t.lencode = t.lendyn, t.lenbits = 7, I = { bits: t.lenbits }, p = $e(ir, t.lens, 0, 19, t.lencode, 0, t.work, I), t.lenbits = I.bits, p) {
+            e.msg = "invalid code lengths set", t.mode = Z;
+            break;
+          }
+          t.have = 0, t.mode = Ni;
+        case Ni:
+          for (; t.have < t.nlen + t.ndist; ) {
+            for (; k = t.lencode[l & (1 << t.lenbits) - 1], b = k >>> 24, N = k >>> 16 & 255, z = k & 65535, !(b <= o); ) {
+              if (f === 0)
+                break e;
+              f--, l += a[n++] << o, o += 8;
+            }
+            if (z < 16)
+              l >>>= b, o -= b, t.lens[t.have++] = z;
+            else {
+              if (z === 16) {
+                for (x = b + 2; o < x; ) {
+                  if (f === 0)
+                    break e;
+                  f--, l += a[n++] << o, o += 8;
+                }
+                if (l >>>= b, o -= b, t.have === 0) {
+                  e.msg = "invalid bit length repeat", t.mode = Z;
+                  break;
+                }
+                y = t.lens[t.have - 1], u = 3 + (l & 3), l >>>= 2, o -= 2;
+              } else if (z === 17) {
+                for (x = b + 3; o < x; ) {
+                  if (f === 0)
+                    break e;
+                  f--, l += a[n++] << o, o += 8;
+                }
+                l >>>= b, o -= b, y = 0, u = 3 + (l & 7), l >>>= 3, o -= 3;
+              } else {
+                for (x = b + 7; o < x; ) {
+                  if (f === 0)
+                    break e;
+                  f--, l += a[n++] << o, o += 8;
+                }
+                l >>>= b, o -= b, y = 0, u = 11 + (l & 127), l >>>= 7, o -= 7;
+              }
+              if (t.have + u > t.nlen + t.ndist) {
+                e.msg = "invalid bit length repeat", t.mode = Z;
+                break;
+              }
+              for (; u--; )
+                t.lens[t.have++] = y;
+            }
+          }
+          if (t.mode === Z)
+            break;
+          if (t.lens[256] === 0) {
+            e.msg = "invalid code -- missing end-of-block", t.mode = Z;
+            break;
+          }
+          if (t.lenbits = 9, I = { bits: t.lenbits }, p = $e(wa, t.lens, 0, t.nlen, t.lencode, 0, t.work, I), t.lenbits = I.bits, p) {
+            e.msg = "invalid literal/lengths set", t.mode = Z;
+            break;
+          }
+          if (t.distbits = 6, t.distcode = t.distdyn, I = { bits: t.distbits }, p = $e(ba, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, I), t.distbits = I.bits, p) {
+            e.msg = "invalid distances set", t.mode = Z;
+            break;
+          }
+          if (t.mode = nt, i === at)
+            break e;
+        case nt:
+          t.mode = rt;
+        case rt:
+          if (f >= 6 && _ >= 258) {
+            e.next_out = h, e.avail_out = _, e.next_in = n, e.avail_in = f, t.hold = l, t.bits = o, tr(e, d), h = e.next_out, r = e.output, _ = e.avail_out, n = e.next_in, a = e.input, f = e.avail_in, l = t.hold, o = t.bits, t.mode === ae && (t.back = -1);
+            break;
+          }
+          for (t.back = 0; k = t.lencode[l & (1 << t.lenbits) - 1], b = k >>> 24, N = k >>> 16 & 255, z = k & 65535, !(b <= o); ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          if (N && !(N & 240)) {
+            for (E = b, c = N, T = z; k = t.lencode[T + ((l & (1 << E + c) - 1) >> E)], b = k >>> 24, N = k >>> 16 & 255, z = k & 65535, !(E + b <= o); ) {
+              if (f === 0)
+                break e;
+              f--, l += a[n++] << o, o += 8;
+            }
+            l >>>= E, o -= E, t.back += E;
+          }
+          if (l >>>= b, o -= b, t.back += b, t.length = z, N === 0) {
+            t.mode = Ii;
+            break;
+          }
+          if (N & 32) {
+            t.back = -1, t.mode = ae;
+            break;
+          }
+          if (N & 64) {
+            e.msg = "invalid literal/length code", t.mode = Z;
+            break;
+          }
+          t.extra = N & 15, t.mode = zi;
+        case zi:
+          if (t.extra) {
+            for (x = t.extra; o < x; ) {
+              if (f === 0)
+                break e;
+              f--, l += a[n++] << o, o += 8;
+            }
+            t.length += l & (1 << t.extra) - 1, l >>>= t.extra, o -= t.extra, t.back += t.extra;
+          }
+          t.was = t.length, t.mode = Ai;
+        case Ai:
+          for (; k = t.distcode[l & (1 << t.distbits) - 1], b = k >>> 24, N = k >>> 16 & 255, z = k & 65535, !(b <= o); ) {
+            if (f === 0)
+              break e;
+            f--, l += a[n++] << o, o += 8;
+          }
+          if (!(N & 240)) {
+            for (E = b, c = N, T = z; k = t.distcode[T + ((l & (1 << E + c) - 1) >> E)], b = k >>> 24, N = k >>> 16 & 255, z = k & 65535, !(E + b <= o); ) {
+              if (f === 0)
+                break e;
+              f--, l += a[n++] << o, o += 8;
+            }
+            l >>>= E, o -= E, t.back += E;
+          }
+          if (l >>>= b, o -= b, t.back += b, N & 64) {
+            e.msg = "invalid distance code", t.mode = Z;
+            break;
+          }
+          t.offset = z, t.extra = N & 15, t.mode = Oi;
+        case Oi:
+          if (t.extra) {
+            for (x = t.extra; o < x; ) {
+              if (f === 0)
+                break e;
+              f--, l += a[n++] << o, o += 8;
+            }
+            t.offset += l & (1 << t.extra) - 1, l >>>= t.extra, o -= t.extra, t.back += t.extra;
+          }
+          if (t.offset > t.dmax) {
+            e.msg = "invalid distance too far back", t.mode = Z;
+            break;
+          }
+          t.mode = Zi;
+        case Zi:
+          if (_ === 0)
+            break e;
+          if (u = d - _, t.offset > u) {
+            if (u = t.offset - u, u > t.whave && t.sane) {
+              e.msg = "invalid distance too far back", t.mode = Z;
+              break;
+            }
+            u > t.wnext ? (u -= t.wnext, g = t.wsize - u) : g = t.wnext - u, u > t.length && (u = t.length), w = t.window;
+          } else
+            w = r, g = h - t.offset, u = t.length;
+          u > _ && (u = _), _ -= u, t.length -= u;
+          do
+            r[h++] = w[g++];
+          while (--u);
+          t.length === 0 && (t.mode = rt);
+          break;
+        case Ii:
+          if (_ === 0)
+            break e;
+          r[h++] = t.length, _--, t.mode = rt;
+          break;
+        case Nt:
+          if (t.wrap) {
+            for (; o < 32; ) {
+              if (f === 0)
+                break e;
+              f--, l |= a[n++] << o, o += 8;
+            }
+            if (d -= _, e.total_out += d, t.total += d, d && (e.adler = t.check = /*UPDATE(state.check, put - _out, _out);*/
+            t.flags ? Q(t.check, r, d, h - d) : Bt(t.check, r, d, h - d)), d = _, (t.flags ? l : Ri(l)) !== t.check) {
+              e.msg = "incorrect data check", t.mode = Z;
+              break;
+            }
+            l = 0, o = 0;
+          }
+          t.mode = Li;
+        case Li:
+          if (t.wrap && t.flags) {
+            for (; o < 32; ) {
+              if (f === 0)
+                break e;
+              f--, l += a[n++] << o, o += 8;
+            }
+            if (l !== (t.total & 4294967295)) {
+              e.msg = "incorrect length check", t.mode = Z;
+              break;
+            }
+            l = 0, o = 0;
+          }
+          t.mode = Di;
+        case Di:
+          p = nr;
+          break e;
+        case Z:
+          p = pa;
+          break e;
+        case Ea:
+          return xa;
+        case hr:
+        default:
+          return q;
+      }
+  return e.next_out = h, e.avail_out = _, e.next_in = n, e.avail_in = f, t.hold = l, t.bits = o, (t.wsize || d !== e.avail_out && t.mode < Z && (t.mode < Nt || i !== si)) && Ta(e, e.output, e.next_out, d - e.avail_out), v -= e.avail_in, d -= e.avail_out, e.total_in += v, e.total_out += d, t.total += d, t.wrap && d && (e.adler = t.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
+  t.flags ? Q(t.check, r, d, e.next_out - d) : Bt(t.check, r, d, e.next_out - d)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === ae ? 128 : 0) + (t.mode === nt || t.mode === Tt ? 256 : 0), (v === 0 && d === 0 || i === si) && p === pe && (p = fr), p;
+}
+function gr(e) {
+  if (!e || !e.state)
+    return q;
+  var i = e.state;
+  return i.window && (i.window = null), e.state = null, pe;
+}
+function wr(e, i) {
+  var t;
+  return !e || !e.state || (t = e.state, !(t.wrap & 2)) ? q : (t.head = i, i.done = !1, pe);
+}
+function br(e, i) {
+  var t = i.length, a, r, n;
+  return !e || !e.state || (a = e.state, a.wrap !== 0 && a.mode !== dt) ? q : a.mode === dt && (r = 1, r = Bt(r, i, t, 0), r !== a.check) ? pa : (n = Ta(e, i, t, t), n ? (a.mode = Ea, xa) : (a.havedict = 1, pe));
+}
+j.inflateReset = ya;
+j.inflateReset2 = ma;
+j.inflateResetKeep = Sa;
+j.inflateInit = sr;
+j.inflateInit2 = Fa;
+j.inflate = vr;
+j.inflateEnd = gr;
+j.inflateGetHeader = wr;
+j.inflateSetDictionary = br;
+j.inflateInfo = "pako inflate (from Nodeca project)";
+var Na = {
+  /* Allowed flush values; see deflate() and inflate() below for details */
+  Z_NO_FLUSH: 0,
+  Z_PARTIAL_FLUSH: 1,
+  Z_SYNC_FLUSH: 2,
+  Z_FULL_FLUSH: 3,
+  Z_FINISH: 4,
+  Z_BLOCK: 5,
+  Z_TREES: 6,
+  /* Return codes for the compression/decompression functions. Negative values
+  * are errors, positive values are used for special but normal events.
+  */
+  Z_OK: 0,
+  Z_STREAM_END: 1,
+  Z_NEED_DICT: 2,
+  Z_ERRNO: -1,
+  Z_STREAM_ERROR: -2,
+  Z_DATA_ERROR: -3,
+  //Z_MEM_ERROR:     -4,
+  Z_BUF_ERROR: -5,
+  //Z_VERSION_ERROR: -6,
+  /* compression levels */
+  Z_NO_COMPRESSION: 0,
+  Z_BEST_SPEED: 1,
+  Z_BEST_COMPRESSION: 9,
+  Z_DEFAULT_COMPRESSION: -1,
+  Z_FILTERED: 1,
+  Z_HUFFMAN_ONLY: 2,
+  Z_RLE: 3,
+  Z_FIXED: 4,
+  Z_DEFAULT_STRATEGY: 0,
+  /* Possible values of the data_type field (though see inflate()) */
+  Z_BINARY: 0,
+  Z_TEXT: 1,
+  //Z_ASCII:                1, // = Z_TEXT (deprecated)
+  Z_UNKNOWN: 2,
+  /* The deflate compression method */
+  Z_DEFLATED: 8
+  //Z_NULL:                 null // Use -1 or null inline, depending on var type
+};
+function pr() {
+  this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1;
+}
+var xr = pr, Ae = j, Me = re, _t = Ee, L = Na, Ct = Kt, kr = va, Er = xr, za = Object.prototype.toString;
+function xe(e) {
+  if (!(this instanceof xe))
+    return new xe(e);
+  this.options = Me.assign({
+    chunkSize: 16384,
+    windowBits: 0,
+    to: ""
+  }, e || {});
+  var i = this.options;
+  i.raw && i.windowBits >= 0 && i.windowBits < 16 && (i.windowBits = -i.windowBits, i.windowBits === 0 && (i.windowBits = -15)), i.windowBits >= 0 && i.windowBits < 16 && !(e && e.windowBits) && (i.windowBits += 32), i.windowBits > 15 && i.windowBits < 48 && (i.windowBits & 15 || (i.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new kr(), this.strm.avail_out = 0;
+  var t = Ae.inflateInit2(
+    this.strm,
+    i.windowBits
+  );
+  if (t !== L.Z_OK)
+    throw new Error(Ct[t]);
+  if (this.header = new Er(), Ae.inflateGetHeader(this.strm, this.header), i.dictionary && (typeof i.dictionary == "string" ? i.dictionary = _t.string2buf(i.dictionary) : za.call(i.dictionary) === "[object ArrayBuffer]" && (i.dictionary = new Uint8Array(i.dictionary)), i.raw && (t = Ae.inflateSetDictionary(this.strm, i.dictionary), t !== L.Z_OK)))
+    throw new Error(Ct[t]);
+}
+xe.prototype.push = function(e, i) {
+  var t = this.strm, a = this.options.chunkSize, r = this.options.dictionary, n, h, f, _, l, o = !1;
+  if (this.ended)
+    return !1;
+  h = i === ~~i ? i : i === !0 ? L.Z_FINISH : L.Z_NO_FLUSH, typeof e == "string" ? t.input = _t.binstring2buf(e) : za.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length;
+  do {
+    if (t.avail_out === 0 && (t.output = new Me.Buf8(a), t.next_out = 0, t.avail_out = a), n = Ae.inflate(t, L.Z_NO_FLUSH), n === L.Z_NEED_DICT && r && (n = Ae.inflateSetDictionary(this.strm, r)), n === L.Z_BUF_ERROR && o === !0 && (n = L.Z_OK, o = !1), n !== L.Z_STREAM_END && n !== L.Z_OK)
+      return this.onEnd(n), this.ended = !0, !1;
+    t.next_out && (t.avail_out === 0 || n === L.Z_STREAM_END || t.avail_in === 0 && (h === L.Z_FINISH || h === L.Z_SYNC_FLUSH)) && (this.options.to === "string" ? (f = _t.utf8border(t.output, t.next_out), _ = t.next_out - f, l = _t.buf2string(t.output, f), t.next_out = _, t.avail_out = a - _, _ && Me.arraySet(t.output, t.output, f, _, 0), this.onData(l)) : this.onData(Me.shrinkBuf(t.output, t.next_out))), t.avail_in === 0 && t.avail_out === 0 && (o = !0);
+  } while ((t.avail_in > 0 || t.avail_out === 0) && n !== L.Z_STREAM_END);
+  return n === L.Z_STREAM_END && (h = L.Z_FINISH), h === L.Z_FINISH ? (n = Ae.inflateEnd(this.strm), this.onEnd(n), this.ended = !0, n === L.Z_OK) : (h === L.Z_SYNC_FLUSH && (this.onEnd(L.Z_OK), t.avail_out = 0), !0);
+};
+xe.prototype.onData = function(e) {
+  this.chunks.push(e);
+};
+xe.prototype.onEnd = function(e) {
+  e === L.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = Me.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+};
+function Xt(e, i) {
+  var t = new xe(i);
+  if (t.push(e, !0), t.err)
+    throw t.msg || Ct[t.err];
+  return t.result;
+}
+function Sr(e, i) {
+  return i = i || {}, i.raw = !0, Xt(e, i);
+}
+je.Inflate = xe;
+je.inflate = Xt;
+je.inflateRaw = Sr;
+je.ungzip = Xt;
+var yr = re.assign, mr = qe, Fr = je, Tr = Na, Aa = {};
+yr(Aa, mr, Fr, Tr);
+var st = Aa;
+async function Zr(e) {
+  try {
+    let i, t = 0, a = 0;
+    const r = [];
+    let n = 0, h;
+    do {
+      const _ = e.subarray(t);
+      if (h = new st.Inflate(), { strm: i } = h, h.push(_, st.Z_SYNC_FLUSH), h.err)
+        throw new Error(h.msg);
+      t += i.next_in, r[a] = h.result, n += r[a].length, a += 1;
+    } while (i.avail_in);
+    const f = new Uint8Array(n);
+    for (let _ = 0, l = 0; _ < r.length; _++)
+      f.set(r[_], l), l += r[_].length;
+    return Pi.Buffer.from(f);
+  } catch (i) {
+    throw `${i}`.match(/incorrect header check/) ? new Error("problem decompressing block: incorrect gzip header check") : i;
+  }
+}
+async function Ir(e, i) {
+  try {
+    let t;
+    const { minv: a, maxv: r } = i;
+    let n = a.blockPosition, h = a.dataPosition;
+    const f = [], _ = [], l = [];
+    let o = 0, v = 0;
+    do {
+      const g = e.subarray(n - a.blockPosition), w = new st.Inflate();
+      if ({ strm: t } = w, w.push(g, st.Z_SYNC_FLUSH), w.err)
+        throw new Error(w.msg);
+      const k = w.result;
+      f.push(k);
+      let b = k.length;
+      _.push(n), l.push(h), f.length === 1 && a.dataPosition && (f[0] = f[0].subarray(a.dataPosition), b = f[0].length);
+      const N = n;
+      if (n += t.next_in, h += b, N >= r.blockPosition) {
+        f[v] = f[v].subarray(0, r.blockPosition === a.blockPosition ? r.dataPosition - a.dataPosition + 1 : r.dataPosition + 1), _.push(n), l.push(h), o += f[v].length;
+        break;
+      }
+      o += f[v].length, v++;
+    } while (t.avail_in);
+    const d = new Uint8Array(o);
+    for (let g = 0, w = 0; g < f.length; g++)
+      d.set(f[g], w), w += f[g].length;
+    return { buffer: Pi.Buffer.from(d), cpositions: _, dpositions: l };
+  } catch (t) {
+    throw `${t}`.match(/incorrect header check/) ? new Error("problem decompressing block: incorrect gzip header check") : t;
+  }
+}
+var Nr = A, H = null;
+try {
+  H = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([
+    0,
+    97,
+    115,
+    109,
+    1,
+    0,
+    0,
+    0,
+    1,
+    13,
+    2,
+    96,
+    0,
+    1,
+    127,
+    96,
+    4,
+    127,
+    127,
+    127,
+    127,
+    1,
+    127,
+    3,
+    7,
+    6,
+    0,
+    1,
+    1,
+    1,
+    1,
+    1,
+    6,
+    6,
+    1,
+    127,
+    1,
+    65,
+    0,
+    11,
+    7,
+    50,
+    6,
+    3,
+    109,
+    117,
+    108,
+    0,
+    1,
+    5,
+    100,
+    105,
+    118,
+    95,
+    115,
+    0,
+    2,
+    5,
+    100,
+    105,
+    118,
+    95,
+    117,
+    0,
+    3,
+    5,
+    114,
+    101,
+    109,
+    95,
+    115,
+    0,
+    4,
+    5,
+    114,
+    101,
+    109,
+    95,
+    117,
+    0,
+    5,
+    8,
+    103,
+    101,
+    116,
+    95,
+    104,
+    105,
+    103,
+    104,
+    0,
+    0,
+    10,
+    191,
+    1,
+    6,
+    4,
+    0,
+    35,
+    0,
+    11,
+    36,
+    1,
+    1,
+    126,
+    32,
+    0,
+    173,
+    32,
+    1,
+    173,
+    66,
+    32,
+    134,
+    132,
+    32,
+    2,
+    173,
+    32,
+    3,
+    173,
+    66,
+    32,
+    134,
+    132,
+    126,
+    34,
+    4,
+    66,
+    32,
+    135,
+    167,
+    36,
+    0,
+    32,
+    4,
+    167,
+    11,
+    36,
+    1,
+    1,
+    126,
+    32,
+    0,
+    173,
+    32,
+    1,
+    173,
+    66,
+    32,
+    134,
+    132,
+    32,
+    2,
+    173,
+    32,
+    3,
+    173,
+    66,
+    32,
+    134,
+    132,
+    127,
+    34,
+    4,
+    66,
+    32,
+    135,
+    167,
+    36,
+    0,
+    32,
+    4,
+    167,
+    11,
+    36,
+    1,
+    1,
+    126,
+    32,
+    0,
+    173,
+    32,
+    1,
+    173,
+    66,
+    32,
+    134,
+    132,
+    32,
+    2,
+    173,
+    32,
+    3,
+    173,
+    66,
+    32,
+    134,
+    132,
+    128,
+    34,
+    4,
+    66,
+    32,
+    135,
+    167,
+    36,
+    0,
+    32,
+    4,
+    167,
+    11,
+    36,
+    1,
+    1,
+    126,
+    32,
+    0,
+    173,
+    32,
+    1,
+    173,
+    66,
+    32,
+    134,
+    132,
+    32,
+    2,
+    173,
+    32,
+    3,
+    173,
+    66,
+    32,
+    134,
+    132,
+    129,
+    34,
+    4,
+    66,
+    32,
+    135,
+    167,
+    36,
+    0,
+    32,
+    4,
+    167,
+    11,
+    36,
+    1,
+    1,
+    126,
+    32,
+    0,
+    173,
+    32,
+    1,
+    173,
+    66,
+    32,
+    134,
+    132,
+    32,
+    2,
+    173,
+    32,
+    3,
+    173,
+    66,
+    32,
+    134,
+    132,
+    130,
+    34,
+    4,
+    66,
+    32,
+    135,
+    167,
+    36,
+    0,
+    32,
+    4,
+    167,
+    11
+  ])), {}).exports;
+} catch {
+}
+function A(e, i, t) {
+  this.low = e | 0, this.high = i | 0, this.unsigned = !!t;
+}
+A.prototype.__isLong__;
+Object.defineProperty(A.prototype, "__isLong__", { value: !0 });
+function $(e) {
+  return (e && e.__isLong__) === !0;
+}
+A.isLong = $;
+var Ci = {}, Ui = {};
+function Se(e, i) {
+  var t, a, r;
+  return i ? (e >>>= 0, (r = 0 <= e && e < 256) && (a = Ui[e], a) ? a : (t = O(e, (e | 0) < 0 ? -1 : 0, !0), r && (Ui[e] = t), t)) : (e |= 0, (r = -128 <= e && e < 128) && (a = Ci[e], a) ? a : (t = O(e, e < 0 ? -1 : 0, !1), r && (Ci[e] = t), t));
+}
+A.fromInt = Se;
+function P(e, i) {
+  if (isNaN(e))
+    return i ? ve : K;
+  if (i) {
+    if (e < 0)
+      return ve;
+    if (e >= Oa)
+      return La;
+  } else {
+    if (e <= -Mi)
+      return U;
+    if (e + 1 >= Mi)
+      return Ia;
+  }
+  return e < 0 ? P(-e, i).neg() : O(e % Oe | 0, e / Oe | 0, i);
+}
+A.fromNumber = P;
+function O(e, i, t) {
+  return new A(e, i, t);
+}
+A.fromBits = O;
+var ct = Math.pow;
+function qt(e, i, t) {
+  if (e.length === 0)
+    throw Error("empty string");
+  if (e === "NaN" || e === "Infinity" || e === "+Infinity" || e === "-Infinity")
+    return K;
+  if (typeof i == "number" ? (t = i, i = !1) : i = !!i, t = t || 10, t < 2 || 36 < t)
+    throw RangeError("radix");
+  var a;
+  if ((a = e.indexOf("-")) > 0)
+    throw Error("interior hyphen");
+  if (a === 0)
+    return qt(e.substring(1), i, t).neg();
+  for (var r = P(ct(t, 8)), n = K, h = 0; h < e.length; h += 8) {
+    var f = Math.min(8, e.length - h), _ = parseInt(e.substring(h, h + f), t);
+    if (f < 8) {
+      var l = P(ct(t, f));
+      n = n.mul(l).add(P(_));
+    } else
+      n = n.mul(r), n = n.add(P(_));
+  }
+  return n.unsigned = i, n;
+}
+A.fromString = qt;
+function V(e, i) {
+  return typeof e == "number" ? P(e, i) : typeof e == "string" ? qt(e, i) : O(e.low, e.high, typeof i == "boolean" ? i : e.unsigned);
+}
+A.fromValue = V;
+var $i = 65536, zr = 1 << 24, Oe = $i * $i, Oa = Oe * Oe, Mi = Oa / 2, Hi = Se(zr), K = Se(0);
+A.ZERO = K;
+var ve = Se(0, !0);
+A.UZERO = ve;
+var Te = Se(1);
+A.ONE = Te;
+var Za = Se(1, !0);
+A.UONE = Za;
+var Ut = Se(-1);
+A.NEG_ONE = Ut;
+var Ia = O(-1, 2147483647, !1);
+A.MAX_VALUE = Ia;
+var La = O(-1, -1, !0);
+A.MAX_UNSIGNED_VALUE = La;
+var U = O(0, -2147483648, !1);
+A.MIN_VALUE = U;
+var s = A.prototype;
+s.toInt = function() {
+  return this.unsigned ? this.low >>> 0 : this.low;
+};
+s.toNumber = function() {
+  return this.unsigned ? (this.high >>> 0) * Oe + (this.low >>> 0) : this.high * Oe + (this.low >>> 0);
+};
+s.toString = function(i) {
+  if (i = i || 10, i < 2 || 36 < i)
+    throw RangeError("radix");
+  if (this.isZero())
+    return "0";
+  if (this.isNegative())
+    if (this.eq(U)) {
+      var t = P(i), a = this.div(t), r = a.mul(t).sub(this);
+      return a.toString(i) + r.toInt().toString(i);
+    } else
+      return "-" + this.neg().toString(i);
+  for (var n = P(ct(i, 6), this.unsigned), h = this, f = ""; ; ) {
+    var _ = h.div(n), l = h.sub(_.mul(n)).toInt() >>> 0, o = l.toString(i);
+    if (h = _, h.isZero())
+      return o + f;
+    for (; o.length < 6; )
+      o = "0" + o;
+    f = "" + o + f;
+  }
+};
+s.getHighBits = function() {
+  return this.high;
+};
+s.getHighBitsUnsigned = function() {
+  return this.high >>> 0;
+};
+s.getLowBits = function() {
+  return this.low;
+};
+s.getLowBitsUnsigned = function() {
+  return this.low >>> 0;
+};
+s.getNumBitsAbs = function() {
+  if (this.isNegative())
+    return this.eq(U) ? 64 : this.neg().getNumBitsAbs();
+  for (var i = this.high != 0 ? this.high : this.low, t = 31; t > 0 && !(i & 1 << t); t--)
+    ;
+  return this.high != 0 ? t + 33 : t + 1;
+};
+s.isZero = function() {
+  return this.high === 0 && this.low === 0;
+};
+s.eqz = s.isZero;
+s.isNegative = function() {
+  return !this.unsigned && this.high < 0;
+};
+s.isPositive = function() {
+  return this.unsigned || this.high >= 0;
+};
+s.isOdd = function() {
+  return (this.low & 1) === 1;
+};
+s.isEven = function() {
+  return (this.low & 1) === 0;
+};
+s.equals = function(i) {
+  return $(i) || (i = V(i)), this.unsigned !== i.unsigned && this.high >>> 31 === 1 && i.high >>> 31 === 1 ? !1 : this.high === i.high && this.low === i.low;
+};
+s.eq = s.equals;
+s.notEquals = function(i) {
+  return !this.eq(
+    /* validates */
+    i
+  );
+};
+s.neq = s.notEquals;
+s.ne = s.notEquals;
+s.lessThan = function(i) {
+  return this.comp(
+    /* validates */
+    i
+  ) < 0;
+};
+s.lt = s.lessThan;
+s.lessThanOrEqual = function(i) {
+  return this.comp(
+    /* validates */
+    i
+  ) <= 0;
+};
+s.lte = s.lessThanOrEqual;
+s.le = s.lessThanOrEqual;
+s.greaterThan = function(i) {
+  return this.comp(
+    /* validates */
+    i
+  ) > 0;
+};
+s.gt = s.greaterThan;
+s.greaterThanOrEqual = function(i) {
+  return this.comp(
+    /* validates */
+    i
+  ) >= 0;
+};
+s.gte = s.greaterThanOrEqual;
+s.ge = s.greaterThanOrEqual;
+s.compare = function(i) {
+  if ($(i) || (i = V(i)), this.eq(i))
+    return 0;
+  var t = this.isNegative(), a = i.isNegative();
+  return t && !a ? -1 : !t && a ? 1 : this.unsigned ? i.high >>> 0 > this.high >>> 0 || i.high === this.high && i.low >>> 0 > this.low >>> 0 ? -1 : 1 : this.sub(i).isNegative() ? -1 : 1;
+};
+s.comp = s.compare;
+s.negate = function() {
+  return !this.unsigned && this.eq(U) ? U : this.not().add(Te);
+};
+s.neg = s.negate;
+s.add = function(i) {
+  $(i) || (i = V(i));
+  var t = this.high >>> 16, a = this.high & 65535, r = this.low >>> 16, n = this.low & 65535, h = i.high >>> 16, f = i.high & 65535, _ = i.low >>> 16, l = i.low & 65535, o = 0, v = 0, d = 0, u = 0;
+  return u += n + l, d += u >>> 16, u &= 65535, d += r + _, v += d >>> 16, d &= 65535, v += a + f, o += v >>> 16, v &= 65535, o += t + h, o &= 65535, O(d << 16 | u, o << 16 | v, this.unsigned);
+};
+s.subtract = function(i) {
+  return $(i) || (i = V(i)), this.add(i.neg());
+};
+s.sub = s.subtract;
+s.multiply = function(i) {
+  if (this.isZero())
+    return K;
+  if ($(i) || (i = V(i)), H) {
+    var t = H.mul(
+      this.low,
+      this.high,
+      i.low,
+      i.high
+    );
+    return O(t, H.get_high(), this.unsigned);
+  }
+  if (i.isZero())
+    return K;
+  if (this.eq(U))
+    return i.isOdd() ? U : K;
+  if (i.eq(U))
+    return this.isOdd() ? U : K;
+  if (this.isNegative())
+    return i.isNegative() ? this.neg().mul(i.neg()) : this.neg().mul(i).neg();
+  if (i.isNegative())
+    return this.mul(i.neg()).neg();
+  if (this.lt(Hi) && i.lt(Hi))
+    return P(this.toNumber() * i.toNumber(), this.unsigned);
+  var a = this.high >>> 16, r = this.high & 65535, n = this.low >>> 16, h = this.low & 65535, f = i.high >>> 16, _ = i.high & 65535, l = i.low >>> 16, o = i.low & 65535, v = 0, d = 0, u = 0, g = 0;
+  return g += h * o, u += g >>> 16, g &= 65535, u += n * o, d += u >>> 16, u &= 65535, u += h * l, d += u >>> 16, u &= 65535, d += r * o, v += d >>> 16, d &= 65535, d += n * l, v += d >>> 16, d &= 65535, d += h * _, v += d >>> 16, d &= 65535, v += a * o + r * l + n * _ + h * f, v &= 65535, O(u << 16 | g, v << 16 | d, this.unsigned);
+};
+s.mul = s.multiply;
+s.divide = function(i) {
+  if ($(i) || (i = V(i)), i.isZero())
+    throw Error("division by zero");
+  if (H) {
+    if (!this.unsigned && this.high === -2147483648 && i.low === -1 && i.high === -1)
+      return this;
+    var t = (this.unsigned ? H.div_u : H.div_s)(
+      this.low,
+      this.high,
+      i.low,
+      i.high
+    );
+    return O(t, H.get_high(), this.unsigned);
+  }
+  if (this.isZero())
+    return this.unsigned ? ve : K;
+  var a, r, n;
+  if (this.unsigned) {
+    if (i.unsigned || (i = i.toUnsigned()), i.gt(this))
+      return ve;
+    if (i.gt(this.shru(1)))
+      return Za;
+    n = ve;
+  } else {
+    if (this.eq(U)) {
+      if (i.eq(Te) || i.eq(Ut))
+        return U;
+      if (i.eq(U))
+        return Te;
+      var h = this.shr(1);
+      return a = h.div(i).shl(1), a.eq(K) ? i.isNegative() ? Te : Ut : (r = this.sub(i.mul(a)), n = a.add(r.div(i)), n);
+    } else if (i.eq(U))
+      return this.unsigned ? ve : K;
+    if (this.isNegative())
+      return i.isNegative() ? this.neg().div(i.neg()) : this.neg().div(i).neg();
+    if (i.isNegative())
+      return this.div(i.neg()).neg();
+    n = K;
+  }
+  for (r = this; r.gte(i); ) {
+    a = Math.max(1, Math.floor(r.toNumber() / i.toNumber()));
+    for (var f = Math.ceil(Math.log(a) / Math.LN2), _ = f <= 48 ? 1 : ct(2, f - 48), l = P(a), o = l.mul(i); o.isNegative() || o.gt(r); )
+      a -= _, l = P(a, this.unsigned), o = l.mul(i);
+    l.isZero() && (l = Te), n = n.add(l), r = r.sub(o);
+  }
+  return n;
+};
+s.div = s.divide;
+s.modulo = function(i) {
+  if ($(i) || (i = V(i)), H) {
+    var t = (this.unsigned ? H.rem_u : H.rem_s)(
+      this.low,
+      this.high,
+      i.low,
+      i.high
+    );
+    return O(t, H.get_high(), this.unsigned);
+  }
+  return this.sub(this.div(i).mul(i));
+};
+s.mod = s.modulo;
+s.rem = s.modulo;
+s.not = function() {
+  return O(~this.low, ~this.high, this.unsigned);
+};
+s.and = function(i) {
+  return $(i) || (i = V(i)), O(this.low & i.low, this.high & i.high, this.unsigned);
+};
+s.or = function(i) {
+  return $(i) || (i = V(i)), O(this.low | i.low, this.high | i.high, this.unsigned);
+};
+s.xor = function(i) {
+  return $(i) || (i = V(i)), O(this.low ^ i.low, this.high ^ i.high, this.unsigned);
+};
+s.shiftLeft = function(i) {
+  return $(i) && (i = i.toInt()), (i &= 63) === 0 ? this : i < 32 ? O(this.low << i, this.high << i | this.low >>> 32 - i, this.unsigned) : O(0, this.low << i - 32, this.unsigned);
+};
+s.shl = s.shiftLeft;
+s.shiftRight = function(i) {
+  return $(i) && (i = i.toInt()), (i &= 63) === 0 ? this : i < 32 ? O(this.low >>> i | this.high << 32 - i, this.high >> i, this.unsigned) : O(this.high >> i - 32, this.high >= 0 ? 0 : -1, this.unsigned);
+};
+s.shr = s.shiftRight;
+s.shiftRightUnsigned = function(i) {
+  if ($(i) && (i = i.toInt()), i &= 63, i === 0)
+    return this;
+  var t = this.high;
+  if (i < 32) {
+    var a = this.low;
+    return O(a >>> i | t << 32 - i, t >>> i, this.unsigned);
+  } else
+    return i === 32 ? O(t, 0, this.unsigned) : O(t >>> i - 32, 0, this.unsigned);
+};
+s.shru = s.shiftRightUnsigned;
+s.shr_u = s.shiftRightUnsigned;
+s.toSigned = function() {
+  return this.unsigned ? O(this.low, this.high, !1) : this;
+};
+s.toUnsigned = function() {
+  return this.unsigned ? this : O(this.low, this.high, !0);
+};
+s.toBytes = function(i) {
+  return i ? this.toBytesLE() : this.toBytesBE();
+};
+s.toBytesLE = function() {
+  var i = this.high, t = this.low;
+  return [
+    t & 255,
+    t >>> 8 & 255,
+    t >>> 16 & 255,
+    t >>> 24,
+    i & 255,
+    i >>> 8 & 255,
+    i >>> 16 & 255,
+    i >>> 24
+  ];
+};
+s.toBytesBE = function() {
+  var i = this.high, t = this.low;
+  return [
+    i >>> 24,
+    i >>> 16 & 255,
+    i >>> 8 & 255,
+    i & 255,
+    t >>> 24,
+    t >>> 16 & 255,
+    t >>> 8 & 255,
+    t & 255
+  ];
+};
+A.fromBytes = function(i, t, a) {
+  return a ? A.fromBytesLE(i, t) : A.fromBytesBE(i, t);
+};
+A.fromBytesLE = function(i, t) {
+  return new A(
+    i[0] | i[1] << 8 | i[2] << 16 | i[3] << 24,
+    i[4] | i[5] << 8 | i[6] << 16 | i[7] << 24,
+    t
+  );
+};
+A.fromBytesBE = function(i, t) {
+  return new A(
+    i[4] << 24 | i[5] << 16 | i[6] << 8 | i[7],
+    i[0] << 24 | i[1] << 16 | i[2] << 8 | i[3],
+    t
+  );
+};
+const Lr = /* @__PURE__ */ Da(Nr);
+export {
+  Lr as L,
+  Ir as a,
+  Zr as u
+};