@genome-spy/app 0.41.0 → 0.42.1

package/dist/{index-gn8bhQ8w.js → index-d7k3kkin.js}

@@ -1,23 +1,23 @@
 import { b as Q } from "./index-1QVesMzU.js";
-import { _ as Yn, L as Kn } from "./index-LD6yPc3X.js";
+import { _ as Gn, L as Yn } from "./index-LD6yPc3X.js";
 import { L as nr } from "./__vite-browser-external-ENoMJThg.js";
 import { R as ir } from "./remoteFile-Ur-gRKsH.js";
 import "./_commonjsHelpers-QtkX90xp.js";
-const ft = BigInt(32);
+const st = BigInt(32);
 function rr(e, n, t) {
   const i = +!!t, r = +!t;
-  return BigInt(e.getInt32(n, t) * r + e.getInt32(n + 4, t) * i) << ft | BigInt(e.getUint32(n, t) * i + e.getUint32(n + 4, t) * r);
+  return BigInt(e.getInt32(n, t) * r + e.getInt32(n + 4, t) * i) << st | BigInt(e.getUint32(n, t) * i + e.getUint32(n + 4, t) * r);
 }
 function ar(e, n, t) {
   const i = e.getUint32(n, t), r = e.getUint32(n + 4, t), a = +!!t, o = +!t;
-  return BigInt(i * o + r * a) << ft | BigInt(i * a + r * o);
+  return BigInt(i * o + r * a) << st | BigInt(i * a + r * o);
 }
 function or(e, n, t, i) {
-  const r = Number(t >> ft), a = Number(t & BigInt(4294967295));
+  const r = Number(t >> st), a = Number(t & BigInt(4294967295));
   i ? (e.setInt32(n + 4, r, i), e.setUint32(n, a, i)) : (e.setInt32(n, r, i), e.setUint32(n + 4, a, i));
 }
 function sr(e, n, t, i) {
-  const r = Number(t >> ft), a = Number(t & BigInt(4294967295));
+  const r = Number(t >> st), a = Number(t & BigInt(4294967295));
   i ? (e.setUint32(n + 4, r, i), e.setUint32(n, a, i)) : (e.setUint32(n, r, i), e.setUint32(n + 4, a, i));
 }
 "getBigInt64" in DataView || (DataView.prototype.getBigInt64 = function(e, n) {
@@ -831,13 +831,13 @@ class q {
   }
 }
 /*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */
-const fr = 4, en = 0, tn = 1, ur = 2;
+const fr = 4, Qt = 0, en = 1, ur = 2;
 function ye(e) {
   let n = e.length;
   for (; --n >= 0; )
     e[n] = 0;
 }
-const hr = 0, Wn = 1, cr = 2, dr = 3, pr = 258, xt = 29, Ze = 256, Oe = Ze + 1 + xt, _e = 30, Mt = 19, Xn = 2 * Oe + 1, se = 15, dt = 16, _r = 7, Ht = 256, qn = 16, Jn = 17, Qn = 18, Ot = (
+const hr = 0, Kn = 1, cr = 2, dr = 3, pr = 258, Zt = 29, Ze = 256, Oe = Ze + 1 + Zt, _e = 30, xt = 19, Wn = 2 * Oe + 1, se = 15, ht = 16, _r = 7, Mt = 256, Xn = 16, qn = 17, Jn = 18, Tt = (
   /* extra bits for each length code */
   new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0])
 ), nt = (
@@ -846,29 +846,29 @@ const hr = 0, Wn = 1, cr = 2, dr = 3, pr = 258, xt = 29, Ze = 256, Oe = Ze + 1 +
 ), br = (
   /* extra bits for each bit length code */
   new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7])
-), ei = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), gr = 512, W = new Array((Oe + 2) * 2);
+), Qn = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), gr = 512, W = new Array((Oe + 2) * 2);
 ye(W);
-const Te = new Array(_e * 2);
-ye(Te);
+const Ie = new Array(_e * 2);
+ye(Ie);
 const ze = new Array(gr);
 ye(ze);
 const Re = new Array(pr - dr + 1);
 ye(Re);
-const jt = new Array(xt);
-ye(jt);
+const Ht = new Array(Zt);
+ye(Ht);
 const it = new Array(_e);
 ye(it);
-function pt(e, n, t, i, r) {
+function ct(e, n, t, i, r) {
   this.static_tree = e, this.extra_bits = n, this.extra_base = t, this.elems = i, this.max_length = r, this.has_stree = e && e.length;
 }
-let ti, ni, ii;
-function _t(e, n) {
+let ei, ti, ni;
+function dt(e, n) {
   this.dyn_tree = e, this.max_code = 0, this.stat_desc = n;
 }
-const ri = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
+const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
   e.pending_buf[e.pending++] = n & 255, e.pending_buf[e.pending++] = n >>> 8 & 255;
 }, D = (e, n, t) => {
-  e.bi_valid > dt - t ? (e.bi_buf |= n << e.bi_valid & 65535, Be(e, e.bi_buf), e.bi_buf = n >> dt - e.bi_valid, e.bi_valid += t - dt) : (e.bi_buf |= n << e.bi_valid & 65535, e.bi_valid += t);
+  e.bi_valid > ht - t ? (e.bi_buf |= n << e.bi_valid & 65535, Be(e, e.bi_buf), e.bi_buf = n >> ht - e.bi_valid, e.bi_valid += t - ht) : (e.bi_buf |= n << e.bi_valid & 65535, e.bi_valid += t);
 }, j = (e, n, t) => {
   D(
     e,
@@ -876,7 +876,7 @@ const ri = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     t[n * 2 + 1]
     /*.Len*/
   );
-}, ai = (e, n) => {
+}, ri = (e, n) => {
   let t = 0;
   do
     t |= e & 1, e >>>= 1, t <<= 1;
@@ -889,7 +889,7 @@ const ri = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
   let s, f, d, c, h, _, g = 0;
   for (c = 0; c <= se; c++)
     e.bl_count[c] = 0;
-  for (t[e.heap[e.heap_max] * 2 + 1] = 0, s = e.heap_max + 1; s < Xn; s++)
+  for (t[e.heap[e.heap_max] * 2 + 1] = 0, s = e.heap_max + 1; s < Wn; s++)
     f = e.heap[s], c = t[t[f * 2 + 1] * 2 + 1] + 1, c > u && (c = u, g++), t[f * 2 + 1] = c, !(f > i) && (e.bl_count[c]++, h = 0, f >= l && (h = o[f - l]), _ = t[f * 2], e.opt_len += _ * (c + h), a && (e.static_len += _ * (r[f * 2 + 1] + h)));
   if (g !== 0) {
     do {
@@ -901,20 +901,20 @@ const ri = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
       for (f = e.bl_count[c]; f !== 0; )
         d = e.heap[--s], !(d > i) && (t[d * 2 + 1] !== c && (e.opt_len += (c - t[d * 2 + 1]) * t[d * 2], t[d * 2 + 1] = c), f--);
   }
-}, oi = (e, n, t) => {
+}, ai = (e, n, t) => {
   const i = new Array(se + 1);
   let r = 0, a, o;
   for (a = 1; a <= se; a++)
     r = r + t[a - 1] << 1, i[a] = r;
   for (o = 0; o <= n; o++) {
     let l = e[o * 2 + 1];
-    l !== 0 && (e[o * 2] = ai(i[l]++, l));
+    l !== 0 && (e[o * 2] = ri(i[l]++, l));
   }
 }, yr = () => {
   let e, n, t, i, r;
   const a = new Array(se + 1);
-  for (t = 0, i = 0; i < xt - 1; i++)
-    for (jt[i] = t, e = 0; e < 1 << Ot[i]; e++)
+  for (t = 0, i = 0; i < Zt - 1; i++)
+    for (Ht[i] = t, e = 0; e < 1 << Tt[i]; e++)
       Re[t++] = i;
   for (Re[t - 1] = i, r = 0, i = 0; i < 16; i++)
     for (it[i] = r, e = 0; e < 1 << nt[i]; e++)
@@ -932,45 +932,45 @@ const ri = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     W[e * 2 + 1] = 7, e++, a[7]++;
   for (; e <= 287; )
     W[e * 2 + 1] = 8, e++, a[8]++;
-  for (oi(W, Oe + 1, a), e = 0; e < _e; e++)
-    Te[e * 2 + 1] = 5, Te[e * 2] = ai(e, 5);
-  ti = new pt(W, Ot, Ze + 1, Oe, se), ni = new pt(Te, nt, 0, _e, se), ii = new pt(new Array(0), br, 0, Mt, _r);
-}, si = (e) => {
+  for (ai(W, Oe + 1, a), e = 0; e < _e; e++)
+    Ie[e * 2 + 1] = 5, Ie[e * 2] = ri(e, 5);
+  ei = new ct(W, Tt, Ze + 1, Oe, se), ti = new ct(Ie, nt, 0, _e, se), ni = new ct(new Array(0), br, 0, xt, _r);
+}, oi = (e) => {
   let n;
   for (n = 0; n < Oe; n++)
     e.dyn_ltree[n * 2] = 0;
   for (n = 0; n < _e; n++)
     e.dyn_dtree[n * 2] = 0;
-  for (n = 0; n < Mt; n++)
+  for (n = 0; n < xt; n++)
     e.bl_tree[n * 2] = 0;
-  e.dyn_ltree[Ht * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0;
-}, li = (e) => {
+  e.dyn_ltree[Mt * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0;
+}, si = (e) => {
   e.bi_valid > 8 ? Be(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
-}, nn = (e, n, t, i) => {
+}, tn = (e, n, t, i) => {
   const r = n * 2, a = t * 2;
   return e[r] < e[a] || e[r] === e[a] && i[n] <= i[t];
-}, bt = (e, n, t) => {
+}, pt = (e, n, t) => {
   const i = e.heap[t];
   let r = t << 1;
-  for (; r <= e.heap_len && (r < e.heap_len && nn(n, e.heap[r + 1], e.heap[r], e.depth) && r++, !nn(n, i, e.heap[r], e.depth)); )
+  for (; r <= e.heap_len && (r < e.heap_len && tn(n, e.heap[r + 1], e.heap[r], e.depth) && r++, !tn(n, i, e.heap[r], e.depth)); )
     e.heap[t] = e.heap[r], t = r, r <<= 1;
   e.heap[t] = i;
-}, rn = (e, n, t) => {
+}, nn = (e, n, t) => {
   let i, r, a = 0, o, l;
   if (e.sym_next !== 0)
     do
-      i = e.pending_buf[e.sym_buf + a++] & 255, i += (e.pending_buf[e.sym_buf + a++] & 255) << 8, r = e.pending_buf[e.sym_buf + a++], i === 0 ? j(e, r, n) : (o = Re[r], j(e, o + Ze + 1, n), l = Ot[o], l !== 0 && (r -= jt[o], D(e, r, l)), i--, o = ri(i), j(e, o, t), l = nt[o], l !== 0 && (i -= it[o], D(e, i, l)));
+      i = e.pending_buf[e.sym_buf + a++] & 255, i += (e.pending_buf[e.sym_buf + a++] & 255) << 8, r = e.pending_buf[e.sym_buf + a++], i === 0 ? j(e, r, n) : (o = Re[r], j(e, o + Ze + 1, n), l = Tt[o], l !== 0 && (r -= Ht[o], D(e, r, l)), i--, o = ii(i), j(e, o, t), l = nt[o], l !== 0 && (i -= it[o], D(e, i, l)));
     while (a < e.sym_next);
-  j(e, Ht, n);
-}, zt = (e, n) => {
+  j(e, Mt, n);
+}, At = (e, n) => {
   const t = n.dyn_tree, i = n.stat_desc.static_tree, r = n.stat_desc.has_stree, a = n.stat_desc.elems;
   let o, l, u = -1, s;
-  for (e.heap_len = 0, e.heap_max = Xn, o = 0; o < a; o++)
+  for (e.heap_len = 0, e.heap_max = Wn, o = 0; o < a; o++)
     t[o * 2] !== 0 ? (e.heap[++e.heap_len] = u = o, e.depth[o] = 0) : t[o * 2 + 1] = 0;
   for (; e.heap_len < 2; )
     s = e.heap[++e.heap_len] = u < 2 ? ++u : 0, t[s * 2] = 1, e.depth[s] = 0, e.opt_len--, r && (e.static_len -= i[s * 2 + 1]);
   for (n.max_code = u, o = e.heap_len >> 1; o >= 1; o--)
-    bt(e, t, o);
+    pt(e, t, o);
   s = a;
   do
     o = e.heap[
@@ -979,7 +979,7 @@ const ri = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     ], e.heap[
       1
       /*SMALLEST*/
-    ] = e.heap[e.heap_len--], bt(
+    ] = e.heap[e.heap_len--], pt(
       e,
       t,
       1
@@ -990,7 +990,7 @@ const ri = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     ], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = l, t[s * 2] = t[o * 2] + t[l * 2], e.depth[s] = (e.depth[o] >= e.depth[l] ? e.depth[o] : e.depth[l]) + 1, t[o * 2 + 1] = t[l * 2 + 1] = s, e.heap[
       1
       /*SMALLEST*/
-    ] = s++, bt(
+    ] = s++, pt(
       e,
       t,
       1
@@ -1000,12 +1000,12 @@ const ri = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
   e.heap[--e.heap_max] = e.heap[
     1
     /*SMALLEST*/
-  ], mr(e, n), oi(t, u, e.bl_count);
-}, an = (e, n, t) => {
+  ], mr(e, n), ai(t, u, e.bl_count);
+}, rn = (e, n, t) => {
   let i, r = -1, a, o = n[0 * 2 + 1], l = 0, u = 7, s = 4;
   for (o === 0 && (u = 138, s = 3), n[(t + 1) * 2 + 1] = 65535, i = 0; i <= t; i++)
-    a = o, o = n[(i + 1) * 2 + 1], !(++l < u && a === o) && (l < s ? e.bl_tree[a * 2] += l : a !== 0 ? (a !== r && e.bl_tree[a * 2]++, e.bl_tree[qn * 2]++) : l <= 10 ? e.bl_tree[Jn * 2]++ : e.bl_tree[Qn * 2]++, l = 0, r = a, o === 0 ? (u = 138, s = 3) : a === o ? (u = 6, s = 3) : (u = 7, s = 4));
-}, on = (e, n, t) => {
+    a = o, o = n[(i + 1) * 2 + 1], !(++l < u && a === o) && (l < s ? e.bl_tree[a * 2] += l : a !== 0 ? (a !== r && e.bl_tree[a * 2]++, e.bl_tree[Xn * 2]++) : l <= 10 ? e.bl_tree[qn * 2]++ : e.bl_tree[Jn * 2]++, l = 0, r = a, o === 0 ? (u = 138, s = 3) : a === o ? (u = 6, s = 3) : (u = 7, s = 4));
+}, an = (e, n, t) => {
   let i, r = -1, a, o = n[0 * 2 + 1], l = 0, u = 7, s = 4;
   for (o === 0 && (u = 138, s = 3), i = 0; i <= t; i++)
     if (a = o, o = n[(i + 1) * 2 + 1], !(++l < u && a === o)) {
@@ -1014,45 +1014,45 @@ const ri = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
           j(e, a, e.bl_tree);
         while (--l !== 0);
       else
-        a !== 0 ? (a !== r && (j(e, a, e.bl_tree), l--), j(e, qn, e.bl_tree), D(e, l - 3, 2)) : l <= 10 ? (j(e, Jn, e.bl_tree), D(e, l - 3, 3)) : (j(e, Qn, e.bl_tree), D(e, l - 11, 7));
+        a !== 0 ? (a !== r && (j(e, a, e.bl_tree), l--), j(e, Xn, e.bl_tree), D(e, l - 3, 2)) : l <= 10 ? (j(e, qn, e.bl_tree), D(e, l - 3, 3)) : (j(e, Jn, e.bl_tree), D(e, l - 11, 7));
       l = 0, r = a, o === 0 ? (u = 138, s = 3) : a === o ? (u = 6, s = 3) : (u = 7, s = 4);
     }
 }, vr = (e) => {
   let n;
-  for (an(e, e.dyn_ltree, e.l_desc.max_code), an(e, e.dyn_dtree, e.d_desc.max_code), zt(e, e.bl_desc), n = Mt - 1; n >= 3 && e.bl_tree[ei[n] * 2 + 1] === 0; n--)
+  for (rn(e, e.dyn_ltree, e.l_desc.max_code), rn(e, e.dyn_dtree, e.d_desc.max_code), At(e, e.bl_desc), n = xt - 1; n >= 3 && e.bl_tree[Qn[n] * 2 + 1] === 0; n--)
     ;
   return e.opt_len += 3 * (n + 1) + 5 + 5 + 4, n;
 }, kr = (e, n, t, i) => {
   let r;
   for (D(e, n - 257, 5), D(e, t - 1, 5), D(e, i - 4, 4), r = 0; r < i; r++)
-    D(e, e.bl_tree[ei[r] * 2 + 1], 3);
-  on(e, e.dyn_ltree, n - 1), on(e, e.dyn_dtree, t - 1);
+    D(e, e.bl_tree[Qn[r] * 2 + 1], 3);
+  an(e, e.dyn_ltree, n - 1), an(e, e.dyn_dtree, t - 1);
 }, $r = (e) => {
   let n = 4093624447, t;
   for (t = 0; t <= 31; t++, n >>>= 1)
     if (n & 1 && e.dyn_ltree[t * 2] !== 0)
-      return en;
+      return Qt;
   if (e.dyn_ltree[9 * 2] !== 0 || e.dyn_ltree[10 * 2] !== 0 || e.dyn_ltree[13 * 2] !== 0)
-    return tn;
+    return en;
   for (t = 32; t < Ze; t++)
     if (e.dyn_ltree[t * 2] !== 0)
-      return tn;
-  return en;
+      return en;
+  return Qt;
 };
-let sn = !1;
+let on = !1;
 const Er = (e) => {
-  sn || (yr(), sn = !0), e.l_desc = new _t(e.dyn_ltree, ti), e.d_desc = new _t(e.dyn_dtree, ni), e.bl_desc = new _t(e.bl_tree, ii), e.bi_buf = 0, e.bi_valid = 0, si(e);
-}, fi = (e, n, t, i) => {
-  D(e, (hr << 1) + (i ? 1 : 0), 3), li(e), Be(e, t), Be(e, ~t), t && e.pending_buf.set(e.window.subarray(n, n + t), e.pending), e.pending += t;
+  on || (yr(), on = !0), e.l_desc = new dt(e.dyn_ltree, ei), e.d_desc = new dt(e.dyn_dtree, ti), e.bl_desc = new dt(e.bl_tree, ni), e.bi_buf = 0, e.bi_valid = 0, oi(e);
+}, li = (e, n, t, i) => {
+  D(e, (hr << 1) + (i ? 1 : 0), 3), si(e), Be(e, t), Be(e, ~t), t && e.pending_buf.set(e.window.subarray(n, n + t), e.pending), e.pending += t;
 }, Cr = (e) => {
-  D(e, Wn << 1, 3), j(e, Ht, W), wr(e);
+  D(e, Kn << 1, 3), j(e, Mt, W), wr(e);
 }, Sr = (e, n, t, i) => {
   let r, a, o = 0;
-  e.level > 0 ? (e.strm.data_type === ur && (e.strm.data_type = $r(e)), zt(e, e.l_desc), zt(e, e.d_desc), o = vr(e), r = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= r && (r = a)) : r = a = t + 5, t + 4 <= r && n !== -1 ? fi(e, n, t, i) : e.strategy === fr || a === r ? (D(e, (Wn << 1) + (i ? 1 : 0), 3), rn(e, W, Te)) : (D(e, (cr << 1) + (i ? 1 : 0), 3), kr(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), rn(e, e.dyn_ltree, e.dyn_dtree)), si(e), i && li(e);
-}, Nr = (e, n, t) => (e.pending_buf[e.sym_buf + e.sym_next++] = n, e.pending_buf[e.sym_buf + e.sym_next++] = n >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = t, n === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, n--, e.dyn_ltree[(Re[t] + Ze + 1) * 2]++, e.dyn_dtree[ri(n) * 2]++), e.sym_next === e.sym_end);
-var Tr = Er, Ir = fi, Ar = Sr, Or = Nr, zr = Cr, Rr = {
-  _tr_init: Tr,
-  _tr_stored_block: Ir,
+  e.level > 0 ? (e.strm.data_type === ur && (e.strm.data_type = $r(e)), At(e, e.l_desc), At(e, e.d_desc), o = vr(e), r = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= r && (r = a)) : r = a = t + 5, t + 4 <= r && n !== -1 ? li(e, n, t, i) : e.strategy === fr || a === r ? (D(e, (Kn << 1) + (i ? 1 : 0), 3), nn(e, W, Ie)) : (D(e, (cr << 1) + (i ? 1 : 0), 3), kr(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), nn(e, e.dyn_ltree, e.dyn_dtree)), oi(e), i && si(e);
+}, Nr = (e, n, t) => (e.pending_buf[e.sym_buf + e.sym_next++] = n, e.pending_buf[e.sym_buf + e.sym_next++] = n >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = t, n === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, n--, e.dyn_ltree[(Re[t] + Ze + 1) * 2]++, e.dyn_dtree[ii(n) * 2]++), e.sym_next === e.sym_end);
+var Ir = Er, Tr = li, Ar = Sr, Or = Nr, zr = Cr, Rr = {
+  _tr_init: Ir,
+  _tr_stored_block: Tr,
   _tr_flush_block: Ar,
   _tr_tally: Or,
   _tr_align: zr
@@ -1144,17 +1144,17 @@ var R = Vr, ge = {
   Z_DEFLATED: 8
   //Z_NULL:                 null // Use -1 or null inline, depending on var type
 };
-const { _tr_init: Lr, _tr_stored_block: Rt, _tr_flush_block: Fr, _tr_tally: te, _tr_align: Pr } = Rr, {
+const { _tr_init: Lr, _tr_stored_block: Ot, _tr_flush_block: Fr, _tr_tally: te, _tr_align: Pr } = Rr, {
   Z_NO_FLUSH: ne,
   Z_PARTIAL_FLUSH: Zr,
   Z_FULL_FLUSH: xr,
   Z_FINISH: F,
-  Z_BLOCK: ln,
+  Z_BLOCK: sn,
   Z_OK: B,
-  Z_STREAM_END: fn,
+  Z_STREAM_END: ln,
   Z_STREAM_ERROR: G,
   Z_DATA_ERROR: Mr,
-  Z_BUF_ERROR: gt,
+  Z_BUF_ERROR: _t,
   Z_DEFAULT_COMPRESSION: Hr,
   Z_FILTERED: jr,
   Z_HUFFMAN_ONLY: We,
@@ -1162,8 +1162,8 @@ const { _tr_init: Lr, _tr_stored_block: Rt, _tr_flush_block: Fr, _tr_tally: te,
   Z_FIXED: Yr,
   Z_DEFAULT_STRATEGY: Kr,
   Z_UNKNOWN: Wr,
-  Z_DEFLATED: ut
-} = xe, Xr = 9, qr = 15, Jr = 8, Qr = 29, ea = 256, Bt = ea + 1 + Qr, ta = 30, na = 19, ia = 2 * Bt + 1, ra = 15, I = 3, ee = 258, Y = ee + I + 1, aa = 32, we = 42, Gt = 57, Ut = 69, Dt = 73, Vt = 91, Lt = 103, le = 113, Se = 666, U = 1, ve = 2, ue = 3, ke = 4, oa = 3, fe = (e, n) => (e.msg = ge[n], n), un = (e) => e * 2 - (e > 4 ? 9 : 0), J = (e) => {
+  Z_DEFLATED: lt
+} = xe, Xr = 9, qr = 15, Jr = 8, Qr = 29, ea = 256, zt = ea + 1 + Qr, ta = 30, na = 19, ia = 2 * zt + 1, ra = 15, T = 3, ee = 258, Y = ee + T + 1, aa = 32, we = 42, jt = 57, Rt = 69, Bt = 73, Ut = 91, Dt = 103, le = 113, Se = 666, U = 1, ve = 2, ue = 3, ke = 4, oa = 3, fe = (e, n) => (e.msg = ge[n], n), fn = (e) => e * 2 - (e > 4 ? 9 : 0), J = (e) => {
   let n = e.length;
   for (; --n >= 0; )
     e[n] = 0;
@@ -1189,10 +1189,10 @@ const V = (e) => {
   e.pending_buf[e.pending++] = n;
 }, Ce = (e, n) => {
   e.pending_buf[e.pending++] = n >>> 8 & 255, e.pending_buf[e.pending++] = n & 255;
-}, Ft = (e, n, t, i) => {
+}, Vt = (e, n, t, i) => {
   let r = e.avail_in;
   return r > i && (r = i), r === 0 ? 0 : (e.avail_in -= r, n.set(e.input.subarray(e.next_in, e.next_in + r), t), e.state.wrap === 1 ? e.adler = Ue(e.adler, n, r, t) : e.state.wrap === 2 && (e.adler = R(e.adler, n, r, t)), e.next_in += r, e.total_in += r, r);
-}, ui = (e, n) => {
+}, fi = (e, n) => {
   let t = e.max_chain_length, i = e.strstart, r, a, o = e.prev_length, l = e.nice_match;
   const u = e.strstart > e.w_size - Y ? e.strstart - (e.w_size - Y) : 0, s = e.window, f = e.w_mask, d = e.prev, c = e.strstart + ee;
   let h = s[i + o - 1], _ = s[i + o];
@@ -1217,19 +1217,19 @@ const V = (e) => {
   do {
     if (i = e.window_size - e.lookahead - e.strstart, e.strstart >= n + (n - Y) && (e.window.set(e.window.subarray(n, n + n - i), 0), e.match_start -= n, e.strstart -= n, e.block_start -= n, e.insert > e.strstart && (e.insert = e.strstart), sa(e), i += n), e.strm.avail_in === 0)
       break;
-    if (t = Ft(e.strm, e.window, e.strstart + e.lookahead, i), e.lookahead += t, e.lookahead + e.insert >= I)
-      for (r = e.strstart - e.insert, e.ins_h = e.window[r], e.ins_h = ie(e, e.ins_h, e.window[r + 1]); e.insert && (e.ins_h = ie(e, e.ins_h, e.window[r + I - 1]), e.prev[r & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = r, r++, e.insert--, !(e.lookahead + e.insert < I)); )
+    if (t = Vt(e.strm, e.window, e.strstart + e.lookahead, i), e.lookahead += t, e.lookahead + e.insert >= T)
+      for (r = e.strstart - e.insert, e.ins_h = e.window[r], e.ins_h = ie(e, e.ins_h, e.window[r + 1]); e.insert && (e.ins_h = ie(e, e.ins_h, e.window[r + T - 1]), e.prev[r & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = r, r++, e.insert--, !(e.lookahead + e.insert < T)); )
         ;
   } while (e.lookahead < Y && e.strm.avail_in !== 0);
-}, hi = (e, n) => {
+}, ui = (e, n) => {
   let t = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, i, r, a, o = 0, l = e.strm.avail_in;
   do {
     if (i = 65535, a = e.bi_valid + 42 >> 3, e.strm.avail_out < a || (a = e.strm.avail_out - a, r = e.strstart - e.block_start, i > r + e.strm.avail_in && (i = r + e.strm.avail_in), i > a && (i = a), i < t && (i === 0 && n !== F || n === ne || i !== r + e.strm.avail_in)))
       break;
-    o = n === F && i === r + e.strm.avail_in ? 1 : 0, Rt(e, 0, 0, o), e.pending_buf[e.pending - 4] = i, e.pending_buf[e.pending - 3] = i >> 8, e.pending_buf[e.pending - 2] = ~i, e.pending_buf[e.pending - 1] = ~i >> 8, V(e.strm), r && (r > i && (r = i), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + r), e.strm.next_out), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r, e.block_start += r, i -= r), i && (Ft(e.strm, e.strm.output, e.strm.next_out, i), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i);
+    o = n === F && i === r + e.strm.avail_in ? 1 : 0, Ot(e, 0, 0, o), e.pending_buf[e.pending - 4] = i, e.pending_buf[e.pending - 3] = i >> 8, e.pending_buf[e.pending - 2] = ~i, e.pending_buf[e.pending - 1] = ~i >> 8, V(e.strm), r && (r > i && (r = i), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + r), e.strm.next_out), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r, e.block_start += r, i -= r), i && (Vt(e.strm, e.strm.output, e.strm.next_out, i), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i);
   } while (o === 0);
-  return l -= e.strm.avail_in, l && (l >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= l && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - l, e.strm.next_in), e.strstart), e.strstart += l, e.insert += l > e.w_size - e.insert ? e.w_size - e.insert : l), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ? ke : n !== ne && n !== F && e.strm.avail_in === 0 && e.strstart === e.block_start ? ve : (a = e.window_size - e.strstart, e.strm.avail_in > a && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, a += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), a > e.strm.avail_in && (a = e.strm.avail_in), a && (Ft(e.strm, e.window, e.strstart, a), e.strstart += a, e.insert += a > e.w_size - e.insert ? e.w_size - e.insert : a), e.high_water < e.strstart && (e.high_water = e.strstart), a = e.bi_valid + 42 >> 3, a = e.pending_buf_size - a > 65535 ? 65535 : e.pending_buf_size - a, t = a > e.w_size ? e.w_size : a, r = e.strstart - e.block_start, (r >= t || (r || n === F) && n !== ne && e.strm.avail_in === 0 && r <= a) && (i = r > a ? a : r, o = n === F && e.strm.avail_in === 0 && i === r ? 1 : 0, Rt(e, e.block_start, i, o), e.block_start += i, V(e.strm)), o ? ue : U);
-}, wt = (e, n) => {
+  return l -= e.strm.avail_in, l && (l >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= l && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - l, e.strm.next_in), e.strstart), e.strstart += l, e.insert += l > e.w_size - e.insert ? e.w_size - e.insert : l), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ? ke : n !== ne && n !== F && e.strm.avail_in === 0 && e.strstart === e.block_start ? ve : (a = e.window_size - e.strstart, e.strm.avail_in > a && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, a += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), a > e.strm.avail_in && (a = e.strm.avail_in), a && (Vt(e.strm, e.window, e.strstart, a), e.strstart += a, e.insert += a > e.w_size - e.insert ? e.w_size - e.insert : a), e.high_water < e.strstart && (e.high_water = e.strstart), a = e.bi_valid + 42 >> 3, a = e.pending_buf_size - a > 65535 ? 65535 : e.pending_buf_size - a, t = a > e.w_size ? e.w_size : a, r = e.strstart - e.block_start, (r >= t || (r || n === F) && n !== ne && e.strm.avail_in === 0 && r <= a) && (i = r > a ? a : r, o = n === F && e.strm.avail_in === 0 && i === r ? 1 : 0, Ot(e, e.block_start, i, o), e.block_start += i, V(e.strm)), o ? ue : U);
+}, bt = (e, n) => {
   let t, i;
   for (; ; ) {
     if (e.lookahead < Y) {
@@ -1238,11 +1238,11 @@ const V = (e) => {
       if (e.lookahead === 0)
         break;
     }
-    if (t = 0, e.lookahead >= I && (e.ins_h = ie(e, e.ins_h, e.window[e.strstart + I - 1]), 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 - Y && (e.match_length = ui(e, t)), e.match_length >= I)
-      if (i = te(e, e.strstart - e.match_start, e.match_length - I), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= I) {
+    if (t = 0, e.lookahead >= T && (e.ins_h = ie(e, e.ins_h, e.window[e.strstart + T - 1]), 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 - Y && (e.match_length = fi(e, t)), e.match_length >= T)
+      if (i = te(e, e.strstart - e.match_start, e.match_length - T), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= T) {
         e.match_length--;
         do
-          e.strstart++, e.ins_h = ie(e, e.ins_h, e.window[e.strstart + I - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
+          e.strstart++, e.ins_h = ie(e, e.ins_h, e.window[e.strstart + T - 1]), 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
@@ -1252,7 +1252,7 @@ const V = (e) => {
     if (i && (L(e, !1), e.strm.avail_out === 0))
       return U;
   }
-  return e.insert = e.strstart < I - 1 ? e.strstart : I - 1, n === F ? (L(e, !0), e.strm.avail_out === 0 ? ue : ke) : e.sym_next && (L(e, !1), e.strm.avail_out === 0) ? U : ve;
+  return e.insert = e.strstart < T - 1 ? e.strstart : T - 1, n === F ? (L(e, !0), e.strm.avail_out === 0 ? ue : ke) : e.sym_next && (L(e, !1), e.strm.avail_out === 0) ? U : ve;
 }, de = (e, n) => {
   let t, i, r;
   for (; ; ) {
@@ -1262,12 +1262,12 @@ const V = (e) => {
       if (e.lookahead === 0)
         break;
     }
-    if (t = 0, e.lookahead >= I && (e.ins_h = ie(e, e.ins_h, e.window[e.strstart + I - 1]), 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 = I - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - Y && (e.match_length = ui(e, t), e.match_length <= 5 && (e.strategy === jr || e.match_length === I && e.strstart - e.match_start > 4096) && (e.match_length = I - 1)), e.prev_length >= I && e.match_length <= e.prev_length) {
-      r = e.strstart + e.lookahead - I, i = te(e, e.strstart - 1 - e.prev_match, e.prev_length - I), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+    if (t = 0, e.lookahead >= T && (e.ins_h = ie(e, e.ins_h, e.window[e.strstart + T - 1]), 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 = T - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - Y && (e.match_length = fi(e, t), e.match_length <= 5 && (e.strategy === jr || e.match_length === T && e.strstart - e.match_start > 4096) && (e.match_length = T - 1)), e.prev_length >= T && e.match_length <= e.prev_length) {
+      r = e.strstart + e.lookahead - T, i = te(e, e.strstart - 1 - e.prev_match, e.prev_length - T), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
       do
-        ++e.strstart <= r && (e.ins_h = ie(e, e.ins_h, e.window[e.strstart + I - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
+        ++e.strstart <= r && (e.ins_h = ie(e, e.ins_h, e.window[e.strstart + T - 1]), 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 = I - 1, e.strstart++, i && (L(e, !1), e.strm.avail_out === 0))
+      if (e.match_available = 0, e.match_length = T - 1, e.strstart++, i && (L(e, !1), e.strm.avail_out === 0))
         return U;
     } else if (e.match_available) {
       if (i = te(e, 0, e.window[e.strstart - 1]), i && L(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
@@ -1275,7 +1275,7 @@ const V = (e) => {
     } else
       e.match_available = 1, e.strstart++, e.lookahead--;
   }
-  return e.match_available && (i = te(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < I - 1 ? e.strstart : I - 1, n === F ? (L(e, !0), e.strm.avail_out === 0 ? ue : ke) : e.sym_next && (L(e, !1), e.strm.avail_out === 0) ? U : ve;
+  return e.match_available && (i = te(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < T - 1 ? e.strstart : T - 1, n === F ? (L(e, !0), e.strm.avail_out === 0 ? ue : ke) : e.sym_next && (L(e, !1), e.strm.avail_out === 0) ? U : ve;
 }, fa = (e, n) => {
   let t, i, r, a;
   const o = e.window;
@@ -1286,14 +1286,14 @@ const V = (e) => {
       if (e.lookahead === 0)
         break;
     }
-    if (e.match_length = 0, e.lookahead >= I && e.strstart > 0 && (r = e.strstart - 1, i = o[r], i === o[++r] && i === o[++r] && i === o[++r])) {
+    if (e.match_length = 0, e.lookahead >= T && e.strstart > 0 && (r = e.strstart - 1, i = o[r], i === o[++r] && i === o[++r] && i === o[++r])) {
       a = e.strstart + ee;
       do
         ;
       while (i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && r < a);
       e.match_length = ee - (a - r), e.match_length > e.lookahead && (e.match_length = e.lookahead);
     }
-    if (e.match_length >= I ? (t = te(e, 1, e.match_length - I), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = te(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && (L(e, !1), e.strm.avail_out === 0))
+    if (e.match_length >= T ? (t = te(e, 1, e.match_length - T), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = te(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && (L(e, !1), e.strm.avail_out === 0))
       return U;
   }
   return e.insert = 0, n === F ? (L(e, !0), e.strm.avail_out === 0 ? ue : ke) : e.sym_next && (L(e, !1), e.strm.avail_out === 0) ? U : ve;
@@ -1315,13 +1315,13 @@ function H(e, n, t, i, r) {
 }
 const Ne = [
   /*      good lazy nice chain */
-  new H(0, 0, 0, 0, hi),
+  new H(0, 0, 0, 0, ui),
   /* 0 store only */
-  new H(4, 4, 8, 4, wt),
+  new H(4, 4, 8, 4, bt),
   /* 1 max speed, no lazy matches */
-  new H(4, 5, 16, 8, wt),
+  new H(4, 5, 16, 8, bt),
   /* 2 */
-  new H(4, 6, 32, 32, wt),
+  new H(4, 6, 32, 32, bt),
   /* 3 */
   new H(4, 4, 16, 16, de),
   /* 4 lazy matches */
@@ -1336,69 +1336,69 @@ const Ne = [
   new H(32, 258, 258, 4096, de)
   /* 9 max compression */
 ], ha = (e) => {
-  e.window_size = 2 * e.w_size, J(e.head), e.max_lazy_match = Ne[e.level].max_lazy, e.good_match = Ne[e.level].good_length, e.nice_match = Ne[e.level].nice_length, e.max_chain_length = Ne[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = I - 1, e.match_available = 0, e.ins_h = 0;
+  e.window_size = 2 * e.w_size, J(e.head), e.max_lazy_match = Ne[e.level].max_lazy, e.good_match = Ne[e.level].good_length, e.nice_match = Ne[e.level].nice_length, e.max_chain_length = Ne[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = T - 1, e.match_available = 0, e.ins_h = 0;
 };
 function ca() {
-  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = ut, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(ia * 2), this.dyn_dtree = new Uint16Array((2 * ta + 1) * 2), this.bl_tree = new Uint16Array((2 * na + 1) * 2), J(this.dyn_ltree), J(this.dyn_dtree), J(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(ra + 1), this.heap = new Uint16Array(2 * Bt + 1), J(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Bt + 1), J(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = lt, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(ia * 2), this.dyn_dtree = new Uint16Array((2 * ta + 1) * 2), this.bl_tree = new Uint16Array((2 * na + 1) * 2), J(this.dyn_ltree), J(this.dyn_dtree), J(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(ra + 1), this.heap = new Uint16Array(2 * zt + 1), J(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * zt + 1), J(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
 }
 const Me = (e) => {
   if (!e)
     return 1;
   const n = e.state;
   return !n || n.strm !== e || n.status !== we && //#ifdef GZIP
-  n.status !== Gt && //#endif
-  n.status !== Ut && n.status !== Dt && n.status !== Vt && n.status !== Lt && n.status !== le && n.status !== Se ? 1 : 0;
-}, ci = (e) => {
+  n.status !== jt && //#endif
+  n.status !== Rt && n.status !== Bt && n.status !== Ut && n.status !== Dt && n.status !== le && n.status !== Se ? 1 : 0;
+}, hi = (e) => {
   if (Me(e))
     return fe(e, G);
   e.total_in = e.total_out = 0, e.data_type = Wr;
   const n = e.state;
   return n.pending = 0, n.pending_out = 0, n.wrap < 0 && (n.wrap = -n.wrap), n.status = //#ifdef GZIP
-  n.wrap === 2 ? Gt : (
+  n.wrap === 2 ? jt : (
     //#endif
     n.wrap ? we : le
   ), e.adler = n.wrap === 2 ? 0 : 1, n.last_flush = -2, Lr(n), B;
-}, di = (e) => {
-  const n = ci(e);
+}, ci = (e) => {
+  const n = hi(e);
   return n === B && ha(e.state), n;
-}, da = (e, n) => Me(e) || e.state.wrap !== 2 ? G : (e.state.gzhead = n, B), pi = (e, n, t, i, r, a) => {
+}, da = (e, n) => Me(e) || e.state.wrap !== 2 ? G : (e.state.gzhead = n, B), di = (e, n, t, i, r, a) => {
   if (!e)
     return G;
   let o = 1;
-  if (n === Hr && (n = 6), i < 0 ? (o = 0, i = -i) : i > 15 && (o = 2, i -= 16), r < 1 || r > Xr || t !== ut || i < 8 || i > 15 || n < 0 || n > 9 || a < 0 || a > Yr || i === 8 && o !== 1)
+  if (n === Hr && (n = 6), i < 0 ? (o = 0, i = -i) : i > 15 && (o = 2, i -= 16), r < 1 || r > Xr || t !== lt || i < 8 || i > 15 || n < 0 || n > 9 || a < 0 || a > Yr || i === 8 && o !== 1)
     return fe(e, G);
   i === 8 && (i = 9);
   const l = new ca();
-  return e.state = l, l.strm = e, l.status = we, l.wrap = o, l.gzhead = null, l.w_bits = i, l.w_size = 1 << l.w_bits, l.w_mask = l.w_size - 1, l.hash_bits = r + 7, l.hash_size = 1 << l.hash_bits, l.hash_mask = l.hash_size - 1, l.hash_shift = ~~((l.hash_bits + I - 1) / I), l.window = new Uint8Array(l.w_size * 2), l.head = new Uint16Array(l.hash_size), l.prev = new Uint16Array(l.w_size), l.lit_bufsize = 1 << r + 6, l.pending_buf_size = l.lit_bufsize * 4, l.pending_buf = new Uint8Array(l.pending_buf_size), l.sym_buf = l.lit_bufsize, l.sym_end = (l.lit_bufsize - 1) * 3, l.level = n, l.strategy = a, l.method = t, di(e);
-}, pa = (e, n) => pi(e, n, ut, qr, Jr, Kr), _a = (e, n) => {
-  if (Me(e) || n > ln || n < 0)
+  return e.state = l, l.strm = e, l.status = we, l.wrap = o, l.gzhead = null, l.w_bits = i, l.w_size = 1 << l.w_bits, l.w_mask = l.w_size - 1, l.hash_bits = r + 7, l.hash_size = 1 << l.hash_bits, l.hash_mask = l.hash_size - 1, l.hash_shift = ~~((l.hash_bits + T - 1) / T), l.window = new Uint8Array(l.w_size * 2), l.head = new Uint16Array(l.hash_size), l.prev = new Uint16Array(l.w_size), l.lit_bufsize = 1 << r + 6, l.pending_buf_size = l.lit_bufsize * 4, l.pending_buf = new Uint8Array(l.pending_buf_size), l.sym_buf = l.lit_bufsize, l.sym_end = (l.lit_bufsize - 1) * 3, l.level = n, l.strategy = a, l.method = t, ci(e);
+}, pa = (e, n) => di(e, n, lt, qr, Jr, Kr), _a = (e, n) => {
+  if (Me(e) || n > sn || n < 0)
     return e ? fe(e, G) : G;
   const t = e.state;
   if (!e.output || e.avail_in !== 0 && !e.input || t.status === Se && n !== F)
-    return fe(e, e.avail_out === 0 ? gt : G);
+    return fe(e, e.avail_out === 0 ? _t : G);
   const i = t.last_flush;
   if (t.last_flush = n, t.pending !== 0) {
     if (V(e), e.avail_out === 0)
       return t.last_flush = -1, B;
-  } else if (e.avail_in === 0 && un(n) <= un(i) && n !== F)
-    return fe(e, gt);
+  } else if (e.avail_in === 0 && fn(n) <= fn(i) && n !== F)
+    return fe(e, _t);
   if (t.status === Se && e.avail_in !== 0)
-    return fe(e, gt);
+    return fe(e, _t);
   if (t.status === we && t.wrap === 0 && (t.status = le), t.status === we) {
-    let r = ut + (t.w_bits - 8 << 4) << 8, a = -1;
+    let r = lt + (t.w_bits - 8 << 4) << 8, a = -1;
     if (t.strategy >= We || t.level < 2 ? a = 0 : t.level < 6 ? a = 1 : t.level === 6 ? a = 2 : a = 3, r |= a << 6, t.strstart !== 0 && (r |= aa), r += 31 - r % 31, Ce(t, r), t.strstart !== 0 && (Ce(t, e.adler >>> 16), Ce(t, e.adler & 65535)), e.adler = 1, t.status = le, V(e), t.pending !== 0)
       return t.last_flush = -1, B;
   }
-  if (t.status === Gt) {
+  if (t.status === jt) {
     if (e.adler = 0, A(t, 31), A(t, 139), A(t, 8), t.gzhead)
       A(
         t,
         (t.gzhead.text ? 1 : 0) + (t.gzhead.hcrc ? 2 : 0) + (t.gzhead.extra ? 4 : 0) + (t.gzhead.name ? 8 : 0) + (t.gzhead.comment ? 16 : 0)
-      ), A(t, t.gzhead.time & 255), A(t, t.gzhead.time >> 8 & 255), A(t, t.gzhead.time >> 16 & 255), A(t, t.gzhead.time >> 24 & 255), A(t, t.level === 9 ? 2 : t.strategy >= We || t.level < 2 ? 4 : 0), A(t, t.gzhead.os & 255), t.gzhead.extra && t.gzhead.extra.length && (A(t, t.gzhead.extra.length & 255), A(t, t.gzhead.extra.length >> 8 & 255)), t.gzhead.hcrc && (e.adler = R(e.adler, t.pending_buf, t.pending, 0)), t.gzindex = 0, t.status = Ut;
+      ), A(t, t.gzhead.time & 255), A(t, t.gzhead.time >> 8 & 255), A(t, t.gzhead.time >> 16 & 255), A(t, t.gzhead.time >> 24 & 255), A(t, t.level === 9 ? 2 : t.strategy >= We || t.level < 2 ? 4 : 0), A(t, t.gzhead.os & 255), t.gzhead.extra && t.gzhead.extra.length && (A(t, t.gzhead.extra.length & 255), A(t, t.gzhead.extra.length >> 8 & 255)), t.gzhead.hcrc && (e.adler = R(e.adler, t.pending_buf, t.pending, 0)), t.gzindex = 0, t.status = Rt;
     else if (A(t, 0), A(t, 0), A(t, 0), A(t, 0), A(t, 0), A(t, t.level === 9 ? 2 : t.strategy >= We || t.level < 2 ? 4 : 0), A(t, oa), t.status = le, V(e), t.pending !== 0)
       return t.last_flush = -1, B;
   }
-  if (t.status === Ut) {
+  if (t.status === Rt) {
     if (t.gzhead.extra) {
       let r = t.pending, a = (t.gzhead.extra.length & 65535) - t.gzindex;
       for (; t.pending + a > t.pending_buf_size; ) {
@@ -1410,9 +1410,9 @@ const Me = (e) => {
       let o = new Uint8Array(t.gzhead.extra);
       t.pending_buf.set(o.subarray(t.gzindex, t.gzindex + a), t.pending), t.pending += a, t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex = 0;
     }
-    t.status = Dt;
+    t.status = Bt;
   }
-  if (t.status === Dt) {
+  if (t.status === Bt) {
     if (t.gzhead.name) {
       let r = t.pending, a;
       do {
@@ -1425,9 +1425,9 @@ const Me = (e) => {
       } while (a !== 0);
       t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex = 0;
     }
-    t.status = Vt;
+    t.status = Ut;
   }
-  if (t.status === Vt) {
+  if (t.status === Ut) {
     if (t.gzhead.comment) {
       let r = t.pending, a;
       do {
@@ -1440,9 +1440,9 @@ const Me = (e) => {
       } while (a !== 0);
       t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r));
     }
-    t.status = Lt;
+    t.status = Dt;
   }
-  if (t.status === Lt) {
+  if (t.status === Dt) {
     if (t.gzhead.hcrc) {
       if (t.pending + 2 > t.pending_buf_size && (V(e), t.pending !== 0))
         return t.last_flush = -1, B;
@@ -1452,13 +1452,13 @@ const Me = (e) => {
       return t.last_flush = -1, B;
   }
   if (e.avail_in !== 0 || t.lookahead !== 0 || n !== ne && t.status !== Se) {
-    let r = t.level === 0 ? hi(t, n) : t.strategy === We ? ua(t, n) : t.strategy === Gr ? fa(t, n) : Ne[t.level].func(t, n);
+    let r = t.level === 0 ? ui(t, n) : t.strategy === We ? ua(t, n) : t.strategy === Gr ? fa(t, n) : Ne[t.level].func(t, n);
     if ((r === ue || r === ke) && (t.status = Se), r === U || r === ue)
       return e.avail_out === 0 && (t.last_flush = -1), B;
-    if (r === ve && (n === Zr ? Pr(t) : n !== ln && (Rt(t, 0, 0, !1), n === xr && (J(t.head), t.lookahead === 0 && (t.strstart = 0, t.block_start = 0, t.insert = 0))), V(e), e.avail_out === 0))
+    if (r === ve && (n === Zr ? Pr(t) : n !== sn && (Ot(t, 0, 0, !1), n === xr && (J(t.head), t.lookahead === 0 && (t.strstart = 0, t.block_start = 0, t.insert = 0))), V(e), e.avail_out === 0))
       return t.last_flush = -1, B;
   }
-  return n !== F ? B : t.wrap <= 0 ? fn : (t.wrap === 2 ? (A(t, e.adler & 255), A(t, e.adler >> 8 & 255), A(t, e.adler >> 16 & 255), A(t, e.adler >> 24 & 255), A(t, e.total_in & 255), A(t, e.total_in >> 8 & 255), A(t, e.total_in >> 16 & 255), A(t, e.total_in >> 24 & 255)) : (Ce(t, e.adler >>> 16), Ce(t, e.adler & 65535)), V(e), t.wrap > 0 && (t.wrap = -t.wrap), t.pending !== 0 ? B : fn);
+  return n !== F ? B : t.wrap <= 0 ? ln : (t.wrap === 2 ? (A(t, e.adler & 255), A(t, e.adler >> 8 & 255), A(t, e.adler >> 16 & 255), A(t, e.adler >> 24 & 255), A(t, e.total_in & 255), A(t, e.total_in >> 8 & 255), A(t, e.total_in >> 16 & 255), A(t, e.total_in >> 24 & 255)) : (Ce(t, e.adler >>> 16), Ce(t, e.adler & 65535)), V(e), t.wrap > 0 && (t.wrap = -t.wrap), t.pending !== 0 ? B : ln);
 }, ba = (e) => {
   if (Me(e))
     return G;
@@ -1477,16 +1477,16 @@ const Me = (e) => {
     u.set(n.subarray(t - i.w_size, t), 0), n = u, t = i.w_size;
   }
   const a = e.avail_in, o = e.next_in, l = e.input;
-  for (e.avail_in = t, e.next_in = 0, e.input = n, me(i); i.lookahead >= I; ) {
-    let u = i.strstart, s = i.lookahead - (I - 1);
+  for (e.avail_in = t, e.next_in = 0, e.input = n, me(i); i.lookahead >= T; ) {
+    let u = i.strstart, s = i.lookahead - (T - 1);
     do
-      i.ins_h = ie(i, i.ins_h, i.window[u + I - 1]), i.prev[u & i.w_mask] = i.head[i.ins_h], i.head[i.ins_h] = u, u++;
+      i.ins_h = ie(i, i.ins_h, i.window[u + T - 1]), i.prev[u & i.w_mask] = i.head[i.ins_h], i.head[i.ins_h] = u, u++;
     while (--s);
-    i.strstart = u, i.lookahead = I - 1, me(i);
+    i.strstart = u, i.lookahead = T - 1, me(i);
   }
-  return i.strstart += i.lookahead, i.block_start = i.strstart, i.insert = i.lookahead, i.lookahead = 0, i.match_length = i.prev_length = I - 1, i.match_available = 0, e.next_in = o, e.input = l, e.avail_in = a, i.wrap = r, B;
+  return i.strstart += i.lookahead, i.block_start = i.strstart, i.insert = i.lookahead, i.lookahead = 0, i.match_length = i.prev_length = T - 1, i.match_available = 0, e.next_in = o, e.input = l, e.avail_in = a, i.wrap = r, B;
 };
-var wa = pa, ma = pi, ya = di, va = ci, ka = da, $a = _a, Ea = ba, Ca = ga, Sa = "pako deflate (from Nodeca project)", Ie = {
+var wa = pa, ma = di, ya = ci, va = hi, ka = da, $a = _a, Ea = ba, Ca = ga, Sa = "pako deflate (from Nodeca project)", Te = {
   deflateInit: wa,
   deflateInit2: ma,
   deflateReset: ya,
@@ -1498,7 +1498,7 @@ var wa = pa, ma = pi, ya = di, va = ci, ka = da, $a = _a, Ea = ba, Ca = ga, Sa =
   deflateInfo: Sa
 };
 const Na = (e, n) => Object.prototype.hasOwnProperty.call(e, n);
-var Ta = function(e) {
+var Ia = function(e) {
   const n = Array.prototype.slice.call(arguments, 1);
   for (; n.length; ) {
     const t = n.shift();
@@ -1510,7 +1510,7 @@ var Ta = function(e) {
     }
   }
   return e;
-}, Ia = (e) => {
+}, Ta = (e) => {
   let n = 0;
   for (let i = 0, r = e.length; i < r; i++)
     n += e[i].length;
@@ -1520,15 +1520,15 @@ var Ta = function(e) {
     t.set(o, r), r += o.length;
   }
   return t;
-}, ht = {
-  assign: Ta,
-  flattenChunks: Ia
+}, ft = {
+  assign: Ia,
+  flattenChunks: Ta
 };
-let _i = !0;
+let pi = !0;
 try {
   String.fromCharCode.apply(null, new Uint8Array(1));
 } catch {
-  _i = !1;
+  pi = !1;
 }
 const De = new Uint8Array(256);
 for (let e = 0; e < 256; e++)
@@ -1545,7 +1545,7 @@ var Aa = (e) => {
   return n;
 };
 const Oa = (e, n) => {
-  if (n < 65534 && e.subarray && _i)
+  if (n < 65534 && e.subarray && pi)
     return String.fromCharCode.apply(null, e.length === n ? e : e.subarray(0, n));
   let t = "";
   for (let i = 0; i < n; i++)
@@ -1592,8 +1592,8 @@ var za = (e, n) => {
 function Ba() {
   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 bi = Ba;
-const gi = Object.prototype.toString, {
+var _i = Ba;
+const bi = Object.prototype.toString, {
   Z_NO_FLUSH: Ua,
   Z_SYNC_FLUSH: Da,
   Z_FULL_FLUSH: Va,
@@ -1604,8 +1604,8 @@ const gi = Object.prototype.toString, {
   Z_DEFAULT_STRATEGY: Za,
   Z_DEFLATED: xa
 } = xe;
-function Yt(e) {
-  this.options = ht.assign({
+function Gt(e) {
+  this.options = ft.assign({
     level: Pa,
     method: xa,
     chunkSize: 16384,
@@ -1614,8 +1614,8 @@ function Yt(e) {
     strategy: Za
   }, e || {});
   let n = this.options;
-  n.raw && n.windowBits > 0 ? n.windowBits = -n.windowBits : n.gzip && n.windowBits > 0 && n.windowBits < 16 && (n.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new bi(), this.strm.avail_out = 0;
-  let t = Ie.deflateInit2(
+  n.raw && n.windowBits > 0 ? n.windowBits = -n.windowBits : n.gzip && n.windowBits > 0 && n.windowBits < 16 && (n.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new _i(), this.strm.avail_out = 0;
+  let t = Te.deflateInit2(
     this.strm,
     n.level,
     n.method,
@@ -1625,25 +1625,25 @@ function Yt(e) {
   );
   if (t !== rt)
     throw new Error(ge[t]);
-  if (n.header && Ie.deflateSetHeader(this.strm, n.header), n.dictionary) {
+  if (n.header && Te.deflateSetHeader(this.strm, n.header), n.dictionary) {
     let i;
-    if (typeof n.dictionary == "string" ? i = Ve.string2buf(n.dictionary) : gi.call(n.dictionary) === "[object ArrayBuffer]" ? i = new Uint8Array(n.dictionary) : i = n.dictionary, t = Ie.deflateSetDictionary(this.strm, i), t !== rt)
+    if (typeof n.dictionary == "string" ? i = Ve.string2buf(n.dictionary) : bi.call(n.dictionary) === "[object ArrayBuffer]" ? i = new Uint8Array(n.dictionary) : i = n.dictionary, t = Te.deflateSetDictionary(this.strm, i), t !== rt)
       throw new Error(ge[t]);
     this._dict_set = !0;
   }
 }
-Yt.prototype.push = function(e, n) {
+Gt.prototype.push = function(e, n) {
   const t = this.strm, i = this.options.chunkSize;
   let r, a;
   if (this.ended)
     return !1;
-  for (n === ~~n ? a = n : a = n === !0 ? La : Ua, typeof e == "string" ? t.input = Ve.string2buf(e) : gi.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
+  for (n === ~~n ? a = n : a = n === !0 ? La : Ua, typeof e == "string" ? t.input = Ve.string2buf(e) : bi.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
     if (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), (a === Da || a === Va) && t.avail_out <= 6) {
       this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0;
       continue;
     }
-    if (r = Ie.deflate(t, a), r === Fa)
-      return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), r = Ie.deflateEnd(this.strm), this.onEnd(r), this.ended = !0, r === rt;
+    if (r = Te.deflate(t, a), r === Fa)
+      return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), r = Te.deflateEnd(this.strm), this.onEnd(r), this.ended = !0, r === rt;
     if (t.avail_out === 0) {
       this.onData(t.output);
       continue;
@@ -1657,17 +1657,17 @@ Yt.prototype.push = function(e, n) {
   }
   return !0;
 };
-Yt.prototype.onData = function(e) {
+Gt.prototype.onData = function(e) {
   this.chunks.push(e);
 };
-Yt.prototype.onEnd = function(e) {
-  e === rt && (this.result = ht.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+Gt.prototype.onEnd = function(e) {
+  e === rt && (this.result = ft.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
 const Xe = 16209, Ma = 16191;
 var Ha = function(n, t) {
   let i, r, a, o, l, u, s, f, d, c, h, _, g, k, y, E, C, p, $, S, b, w, m, v;
-  const T = n.state;
-  i = n.next_in, m = n.input, r = i + (n.avail_in - 5), a = n.next_out, v = n.output, o = a - (t - n.avail_out), l = a + (n.avail_out - 257), u = T.dmax, s = T.wsize, f = T.whave, d = T.wnext, c = T.window, h = T.hold, _ = T.bits, g = T.lencode, k = T.distcode, y = (1 << T.lenbits) - 1, E = (1 << T.distbits) - 1;
+  const I = n.state;
+  i = n.next_in, m = n.input, r = i + (n.avail_in - 5), a = n.next_out, v = n.output, o = a - (t - n.avail_out), l = a + (n.avail_out - 257), u = I.dmax, s = I.wsize, f = I.whave, d = I.wnext, c = I.window, h = I.hold, _ = I.bits, g = I.lencode, k = I.distcode, y = (1 << I.lenbits) - 1, E = (1 << I.distbits) - 1;
   e:
     do {
       _ < 15 && (h += m[i++] << _, _ += 8, h += m[i++] << _, _ += 8), C = g[h & y];
@@ -1681,12 +1681,12 @@ var Ha = function(n, t) {
               for (; ; ) {
                 if (p = C >>> 24, h >>>= p, _ -= p, p = C >>> 16 & 255, p & 16) {
                   if (S = C & 65535, p &= 15, _ < p && (h += m[i++] << _, _ += 8, _ < p && (h += m[i++] << _, _ += 8)), S += h & (1 << p) - 1, S > u) {
-                    n.msg = "invalid distance too far back", T.mode = Xe;
+                    n.msg = "invalid distance too far back", I.mode = Xe;
                     break e;
                   }
                   if (h >>>= p, _ -= p, p = a - o, S > p) {
-                    if (p = S - p, p > f && T.sane) {
-                      n.msg = "invalid distance too far back", T.mode = Xe;
+                    if (p = S - p, p > f && I.sane) {
+                      n.msg = "invalid distance too far back", I.mode = Xe;
                       break e;
                     }
                     if (b = 0, w = c, d === 0) {
@@ -1729,7 +1729,7 @@ var Ha = function(n, t) {
                     $ && (v[a++] = v[b++], $ > 1 && (v[a++] = v[b++]));
                   }
                 } else if (p & 64) {
-                  n.msg = "invalid distance code", T.mode = Xe;
+                  n.msg = "invalid distance code", I.mode = Xe;
                   break e;
                 } else {
                   C = k[(C & 65535) + (h & (1 << p) - 1)];
@@ -1739,10 +1739,10 @@ var Ha = function(n, t) {
               }
           } else if (p & 64)
             if (p & 32) {
-              T.mode = Ma;
+              I.mode = Ma;
               break e;
             } else {
-              n.msg = "invalid literal/length code", T.mode = Xe;
+              n.msg = "invalid literal/length code", I.mode = Xe;
               break e;
             }
           else {
@@ -1752,9 +1752,9 @@ var Ha = function(n, t) {
           break;
         }
     } while (i < r && a < l);
-  $ = _ >> 3, i -= $, _ -= $ << 3, h &= (1 << _) - 1, n.next_in = i, n.next_out = a, n.avail_in = i < r ? 5 + (r - i) : 5 - (i - r), n.avail_out = a < l ? 257 + (l - a) : 257 - (a - l), T.hold = h, T.bits = _;
+  $ = _ >> 3, i -= $, _ -= $ << 3, h &= (1 << _) - 1, n.next_in = i, n.next_out = a, n.avail_in = i < r ? 5 + (r - i) : 5 - (i - r), n.avail_out = a < l ? 257 + (l - a) : 257 - (a - l), I.hold = h, I.bits = _;
 };
-const pe = 15, hn = 852, cn = 592, dn = 0, mt = 1, pn = 2, ja = new Uint16Array([
+const pe = 15, un = 852, hn = 592, cn = 0, gt = 1, dn = 2, ja = new Uint16Array([
   /* Length codes 257..285 base */
   3,
   4,
@@ -1891,8 +1891,8 @@ const pe = 15, hn = 852, cn = 592, dn = 0, mt = 1, pn = 2, ja = new Uint16Array(
 ]), Wa = (e, n, t, i, r, a, o, l) => {
   const u = l.bits;
   let s = 0, f = 0, d = 0, c = 0, h = 0, _ = 0, g = 0, k = 0, y = 0, E = 0, C, p, $, S, b, w = null, m;
-  const v = new Uint16Array(pe + 1), T = new Uint16Array(pe + 1);
-  let ae = null, Qt, je, Ge;
+  const v = new Uint16Array(pe + 1), I = new Uint16Array(pe + 1);
+  let ae = null, Jt, je, Ge;
   for (s = 0; s <= pe; s++)
     v[s] = 0;
   for (f = 0; f < i; f++)
@@ -1906,18 +1906,18 @@ const pe = 15, hn = 852, cn = 592, dn = 0, mt = 1, pn = 2, ja = new Uint16Array(
   for (h < d && (h = d), k = 1, s = 1; s <= pe; s++)
     if (k <<= 1, k -= v[s], k < 0)
       return -1;
-  if (k > 0 && (e === dn || c !== 1))
+  if (k > 0 && (e === cn || c !== 1))
     return -1;
-  for (T[1] = 0, s = 1; s < pe; s++)
-    T[s + 1] = T[s] + v[s];
+  for (I[1] = 0, s = 1; s < pe; s++)
+    I[s + 1] = I[s] + v[s];
   for (f = 0; f < i; f++)
-    n[t + f] !== 0 && (o[T[n[t + f]]++] = f);
-  if (e === dn ? (w = ae = o, m = 20) : e === mt ? (w = ja, ae = Ga, m = 257) : (w = Ya, ae = Ka, m = 0), E = 0, f = 0, s = d, b = a, _ = h, g = 0, $ = -1, y = 1 << h, S = y - 1, e === mt && y > hn || e === pn && y > cn)
+    n[t + f] !== 0 && (o[I[n[t + f]]++] = f);
+  if (e === cn ? (w = ae = o, m = 20) : e === gt ? (w = ja, ae = Ga, m = 257) : (w = Ya, ae = Ka, m = 0), E = 0, f = 0, s = d, b = a, _ = h, g = 0, $ = -1, y = 1 << h, S = y - 1, e === gt && y > un || e === dn && y > hn)
     return 1;
   for (; ; ) {
-    Qt = s - g, o[f] + 1 < m ? (je = 0, Ge = o[f]) : o[f] >= m ? (je = ae[o[f] - m], Ge = w[o[f] - m]) : (je = 32 + 64, Ge = 0), C = 1 << s - g, p = 1 << _, d = p;
+    Jt = s - g, o[f] + 1 < m ? (je = 0, Ge = o[f]) : o[f] >= m ? (je = ae[o[f] - m], Ge = w[o[f] - m]) : (je = 32 + 64, Ge = 0), C = 1 << s - g, p = 1 << _, d = p;
     do
-      p -= C, r[b + (E >> g) + p] = Qt << 24 | je << 16 | Ge | 0;
+      p -= C, r[b + (E >> g) + p] = Jt << 24 | je << 16 | Ge | 0;
     while (p !== 0);
     for (C = 1 << s - 1; E & C; )
       C >>= 1;
@@ -1929,7 +1929,7 @@ const pe = 15, hn = 852, cn = 592, dn = 0, mt = 1, pn = 2, ja = new Uint16Array(
     if (s > h && (E & S) !== $) {
       for (g === 0 && (g = h), b += d, _ = s - g, k = 1 << _; _ + g < c && (k -= v[_ + g], !(k <= 0)); )
         _++, k <<= 1;
-      if (y += 1 << _, e === mt && y > hn || e === pn && y > cn)
+      if (y += 1 << _, e === gt && y > un || e === dn && y > hn)
         return 1;
       $ = E & S, r[$] = h << 24 | _ << 16 | b - a | 0;
     }
@@ -1937,19 +1937,19 @@ const pe = 15, hn = 852, cn = 592, dn = 0, mt = 1, pn = 2, ja = new Uint16Array(
   return E !== 0 && (r[b + E] = s - g << 24 | 64 << 16 | 0), l.bits = h, 0;
 };
 var Ae = Wa;
-const Xa = 0, wi = 1, mi = 2, {
-  Z_FINISH: _n,
+const Xa = 0, gi = 1, wi = 2, {
+  Z_FINISH: pn,
   Z_BLOCK: qa,
   Z_TREES: qe,
   Z_OK: he,
   Z_STREAM_END: Ja,
   Z_NEED_DICT: Qa,
   Z_STREAM_ERROR: P,
-  Z_DATA_ERROR: yi,
-  Z_MEM_ERROR: vi,
+  Z_DATA_ERROR: mi,
+  Z_MEM_ERROR: yi,
   Z_BUF_ERROR: eo,
-  Z_DEFLATED: bn
-} = xe, ct = 16180, gn = 16181, wn = 16182, mn = 16183, yn = 16184, vn = 16185, kn = 16186, $n = 16187, En = 16188, Cn = 16189, at = 16190, K = 16191, yt = 16192, Sn = 16193, vt = 16194, Nn = 16195, Tn = 16196, In = 16197, An = 16198, Je = 16199, Qe = 16200, On = 16201, zn = 16202, Rn = 16203, Bn = 16204, Un = 16205, kt = 16206, Dn = 16207, Vn = 16208, O = 16209, ki = 16210, $i = 16211, to = 852, no = 592, io = 15, ro = io, Ln = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
+  Z_DEFLATED: _n
+} = xe, ut = 16180, bn = 16181, gn = 16182, wn = 16183, mn = 16184, yn = 16185, vn = 16186, kn = 16187, $n = 16188, En = 16189, at = 16190, K = 16191, wt = 16192, Cn = 16193, mt = 16194, Sn = 16195, Nn = 16196, In = 16197, Tn = 16198, Je = 16199, Qe = 16200, An = 16201, On = 16202, zn = 16203, Rn = 16204, Bn = 16205, yt = 16206, Un = 16207, Dn = 16208, O = 16209, vi = 16210, ki = 16211, to = 852, no = 592, io = 15, ro = io, Vn = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
 function ao() {
   this.strm = null, this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
 }
@@ -1957,35 +1957,35 @@ const ce = (e) => {
   if (!e)
     return 1;
   const n = e.state;
-  return !n || n.strm !== e || n.mode < ct || n.mode > $i ? 1 : 0;
-}, Ei = (e) => {
+  return !n || n.strm !== e || n.mode < ut || n.mode > ki ? 1 : 0;
+}, $i = (e) => {
   if (ce(e))
     return P;
   const n = e.state;
-  return e.total_in = e.total_out = n.total = 0, e.msg = "", n.wrap && (e.adler = n.wrap & 1), n.mode = ct, n.last = 0, n.havedict = 0, n.flags = -1, n.dmax = 32768, n.head = null, n.hold = 0, n.bits = 0, n.lencode = n.lendyn = new Int32Array(to), n.distcode = n.distdyn = new Int32Array(no), n.sane = 1, n.back = -1, he;
-}, Ci = (e) => {
+  return e.total_in = e.total_out = n.total = 0, e.msg = "", n.wrap && (e.adler = n.wrap & 1), n.mode = ut, n.last = 0, n.havedict = 0, n.flags = -1, n.dmax = 32768, n.head = null, n.hold = 0, n.bits = 0, n.lencode = n.lendyn = new Int32Array(to), n.distcode = n.distdyn = new Int32Array(no), n.sane = 1, n.back = -1, he;
+}, Ei = (e) => {
   if (ce(e))
     return P;
   const n = e.state;
-  return n.wsize = 0, n.whave = 0, n.wnext = 0, Ei(e);
-}, Si = (e, n) => {
+  return n.wsize = 0, n.whave = 0, n.wnext = 0, $i(e);
+}, Ci = (e, n) => {
   let t;
   if (ce(e))
     return P;
   const i = e.state;
-  return n < 0 ? (t = 0, n = -n) : (t = (n >> 4) + 5, n < 48 && (n &= 15)), n && (n < 8 || n > 15) ? P : (i.window !== null && i.wbits !== n && (i.window = null), i.wrap = t, i.wbits = n, Ci(e));
-}, Ni = (e, n) => {
+  return n < 0 ? (t = 0, n = -n) : (t = (n >> 4) + 5, n < 48 && (n &= 15)), n && (n < 8 || n > 15) ? P : (i.window !== null && i.wbits !== n && (i.window = null), i.wrap = t, i.wbits = n, Ei(e));
+}, Si = (e, n) => {
   if (!e)
     return P;
   const t = new ao();
-  e.state = t, t.strm = e, t.window = null, t.mode = ct;
-  const i = Si(e, n);
+  e.state = t, t.strm = e, t.window = null, t.mode = ut;
+  const i = Ci(e, n);
   return i !== he && (e.state = null), i;
-}, oo = (e) => Ni(e, ro);
-let Fn = !0, $t, Et;
+}, oo = (e) => Si(e, ro);
+let Ln = !0, vt, kt;
 const so = (e) => {
-  if (Fn) {
-    $t = new Int32Array(512), Et = new Int32Array(32);
+  if (Ln) {
+    vt = new Int32Array(512), kt = new Int32Array(32);
     let n = 0;
     for (; n < 144; )
       e.lens[n++] = 8;
@@ -1995,32 +1995,32 @@ const so = (e) => {
       e.lens[n++] = 7;
     for (; n < 288; )
       e.lens[n++] = 8;
-    for (Ae(wi, e.lens, 0, 288, $t, 0, e.work, { bits: 9 }), n = 0; n < 32; )
+    for (Ae(gi, e.lens, 0, 288, vt, 0, e.work, { bits: 9 }), n = 0; n < 32; )
       e.lens[n++] = 5;
-    Ae(mi, e.lens, 0, 32, Et, 0, e.work, { bits: 5 }), Fn = !1;
+    Ae(wi, e.lens, 0, 32, kt, 0, e.work, { bits: 5 }), Ln = !1;
   }
-  e.lencode = $t, e.lenbits = 9, e.distcode = Et, e.distbits = 5;
-}, Ti = (e, n, t, i) => {
+  e.lencode = vt, e.lenbits = 9, e.distcode = kt, e.distbits = 5;
+}, Ni = (e, n, t, i) => {
   let r;
   const a = e.state;
   return a.window === null && (a.wsize = 1 << a.wbits, a.wnext = 0, a.whave = 0, a.window = new Uint8Array(a.wsize)), i >= a.wsize ? (a.window.set(n.subarray(t - a.wsize, t), 0), a.wnext = 0, a.whave = a.wsize) : (r = a.wsize - a.wnext, r > i && (r = i), a.window.set(n.subarray(t - i, t - i + r), a.wnext), i -= r, i ? (a.window.set(n.subarray(t - i, t), 0), a.wnext = i, a.whave = a.wsize) : (a.wnext += r, a.wnext === a.wsize && (a.wnext = 0), a.whave < a.wsize && (a.whave += r))), 0;
 }, lo = (e, n) => {
   let t, i, r, a, o, l, u, s, f, d, c, h, _, g, k = 0, y, E, C, p, $, S, b, w;
   const m = new Uint8Array(4);
-  let v, T;
+  let v, I;
   const ae = (
     /* permutation of code lengths */
     new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
   );
   if (ce(e) || !e.output || !e.input && e.avail_in !== 0)
     return P;
-  t = e.state, t.mode === K && (t.mode = yt), o = e.next_out, r = e.output, u = e.avail_out, a = e.next_in, i = e.input, l = e.avail_in, s = t.hold, f = t.bits, d = l, c = u, w = he;
+  t = e.state, t.mode === K && (t.mode = wt), o = e.next_out, r = e.output, u = e.avail_out, a = e.next_in, i = e.input, l = e.avail_in, s = t.hold, f = t.bits, d = l, c = u, w = he;
   e:
     for (; ; )
       switch (t.mode) {
-        case ct:
+        case ut:
           if (t.wrap === 0) {
-            t.mode = yt;
+            t.mode = wt;
             break;
           }
           for (; f < 16; ) {
@@ -2029,7 +2029,7 @@ const so = (e) => {
             l--, s += i[a++] << f, f += 8;
           }
           if (t.wrap & 2 && s === 35615) {
-            t.wbits === 0 && (t.wbits = 15), t.check = 0, m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0), s = 0, f = 0, t.mode = gn;
+            t.wbits === 0 && (t.wbits = 15), t.check = 0, m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0), s = 0, f = 0, t.mode = bn;
             break;
           }
           if (t.head && (t.head.done = !1), !(t.wrap & 1) || /* check if zlib header allowed */
@@ -2037,7 +2037,7 @@ const so = (e) => {
             e.msg = "incorrect header check", t.mode = O;
             break;
           }
-          if ((s & 15) !== bn) {
+          if ((s & 15) !== _n) {
             e.msg = "unknown compression method", t.mode = O;
             break;
           }
@@ -2045,15 +2045,15 @@ const so = (e) => {
             e.msg = "invalid window size", t.mode = O;
             break;
           }
-          t.dmax = 1 << t.wbits, t.flags = 0, e.adler = t.check = 1, t.mode = s & 512 ? Cn : K, s = 0, f = 0;
+          t.dmax = 1 << t.wbits, t.flags = 0, e.adler = t.check = 1, t.mode = s & 512 ? En : K, s = 0, f = 0;
           break;
-        case gn:
+        case bn:
           for (; f < 16; ) {
             if (l === 0)
               break e;
             l--, s += i[a++] << f, f += 8;
           }
-          if (t.flags = s, (t.flags & 255) !== bn) {
+          if (t.flags = s, (t.flags & 255) !== _n) {
             e.msg = "unknown compression method", t.mode = O;
             break;
           }
@@ -2061,22 +2061,22 @@ const so = (e) => {
             e.msg = "unknown header flags set", t.mode = O;
             break;
           }
-          t.head && (t.head.text = s >> 8 & 1), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0)), s = 0, f = 0, t.mode = wn;
-        case wn:
+          t.head && (t.head.text = s >> 8 & 1), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0)), s = 0, f = 0, t.mode = gn;
+        case gn:
           for (; f < 32; ) {
             if (l === 0)
               break e;
             l--, s += i[a++] << f, f += 8;
           }
-          t.head && (t.head.time = s), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, m[2] = s >>> 16 & 255, m[3] = s >>> 24 & 255, t.check = R(t.check, m, 4, 0)), s = 0, f = 0, t.mode = mn;
-        case mn:
+          t.head && (t.head.time = s), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, m[2] = s >>> 16 & 255, m[3] = s >>> 24 & 255, t.check = R(t.check, m, 4, 0)), s = 0, f = 0, t.mode = wn;
+        case wn:
           for (; f < 16; ) {
             if (l === 0)
               break e;
             l--, s += i[a++] << f, f += 8;
           }
-          t.head && (t.head.xflags = s & 255, t.head.os = s >> 8), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0)), s = 0, f = 0, t.mode = yn;
-        case yn:
+          t.head && (t.head.xflags = s & 255, t.head.os = s >> 8), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0)), s = 0, f = 0, t.mode = mn;
+        case mn:
           if (t.flags & 1024) {
             for (; f < 16; ) {
               if (l === 0)
@@ -2086,8 +2086,8 @@ const so = (e) => {
             t.length = s, t.head && (t.head.extra_len = s), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0)), s = 0, f = 0;
           } else
             t.head && (t.head.extra = null);
-          t.mode = vn;
-        case vn:
+          t.mode = yn;
+        case yn:
           if (t.flags & 1024 && (h = t.length, h > l && (h = l), h && (t.head && (b = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
             i.subarray(
               a,
@@ -2099,8 +2099,8 @@ const so = (e) => {
             b
           )), t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), l -= h, a += h, t.length -= h), t.length))
             break e;
-          t.length = 0, t.mode = kn;
-        case kn:
+          t.length = 0, t.mode = vn;
+        case vn:
           if (t.flags & 2048) {
             if (l === 0)
               break e;
@@ -2112,8 +2112,8 @@ const so = (e) => {
               break e;
           } else
             t.head && (t.head.name = null);
-          t.length = 0, t.mode = $n;
-        case $n:
+          t.length = 0, t.mode = kn;
+        case kn:
           if (t.flags & 4096) {
             if (l === 0)
               break e;
@@ -2125,8 +2125,8 @@ const so = (e) => {
               break e;
           } else
             t.head && (t.head.comment = null);
-          t.mode = En;
-        case En:
+          t.mode = $n;
+        case $n:
           if (t.flags & 512) {
             for (; f < 16; ) {
               if (l === 0)
@@ -2141,13 +2141,13 @@ const so = (e) => {
           }
           t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = !0), e.adler = t.check = 0, t.mode = K;
           break;
-        case Cn:
+        case En:
           for (; f < 32; ) {
             if (l === 0)
               break e;
             l--, s += i[a++] << f, f += 8;
           }
-          e.adler = t.check = Ln(s), s = 0, f = 0, t.mode = at;
+          e.adler = t.check = Vn(s), s = 0, f = 0, t.mode = at;
         case at:
           if (t.havedict === 0)
             return e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = l, t.hold = s, t.bits = f, Qa;
@@ -2155,9 +2155,9 @@ const so = (e) => {
         case K:
           if (n === qa || n === qe)
             break e;
-        case yt:
+        case wt:
           if (t.last) {
-            s >>>= f & 7, f -= f & 7, t.mode = kt;
+            s >>>= f & 7, f -= f & 7, t.mode = yt;
             break;
           }
           for (; f < 3; ) {
@@ -2167,7 +2167,7 @@ const so = (e) => {
           }
           switch (t.last = s & 1, s >>>= 1, f -= 1, s & 3) {
             case 0:
-              t.mode = Sn;
+              t.mode = Cn;
               break;
             case 1:
               if (so(t), t.mode = Je, n === qe) {
@@ -2176,14 +2176,14 @@ const so = (e) => {
               }
               break;
             case 2:
-              t.mode = Tn;
+              t.mode = Nn;
               break;
             case 3:
               e.msg = "invalid block type", t.mode = O;
           }
           s >>>= 2, f -= 2;
           break;
-        case Sn:
+        case Cn:
           for (s >>>= f & 7, f -= f & 7; f < 32; ) {
             if (l === 0)
               break e;
@@ -2193,11 +2193,11 @@ const so = (e) => {
             e.msg = "invalid stored block lengths", t.mode = O;
             break;
           }
-          if (t.length = s & 65535, s = 0, f = 0, t.mode = vt, n === qe)
+          if (t.length = s & 65535, s = 0, f = 0, t.mode = mt, n === qe)
             break e;
-        case vt:
-          t.mode = Nn;
-        case Nn:
+        case mt:
+          t.mode = Sn;
+        case Sn:
           if (h = t.length, h) {
             if (h > l && (h = l), h > u && (h = u), h === 0)
               break e;
@@ -2206,7 +2206,7 @@ const so = (e) => {
           }
           t.mode = K;
           break;
-        case Tn:
+        case Nn:
           for (; f < 14; ) {
             if (l === 0)
               break e;
@@ -2232,8 +2232,8 @@ const so = (e) => {
             e.msg = "invalid code lengths set", t.mode = O;
             break;
           }
-          t.have = 0, t.mode = An;
-        case An:
+          t.have = 0, t.mode = Tn;
+        case Tn:
           for (; t.have < t.nlen + t.ndist; ) {
             for (; k = t.lencode[s & (1 << t.lenbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
               if (l === 0)
@@ -2244,7 +2244,7 @@ const so = (e) => {
               s >>>= y, f -= y, t.lens[t.have++] = C;
             else {
               if (C === 16) {
-                for (T = y + 2; f < T; ) {
+                for (I = y + 2; f < I; ) {
                   if (l === 0)
                     break e;
                   l--, s += i[a++] << f, f += 8;
@@ -2255,14 +2255,14 @@ const so = (e) => {
                 }
                 b = t.lens[t.have - 1], h = 3 + (s & 3), s >>>= 2, f -= 2;
               } else if (C === 17) {
-                for (T = y + 3; f < T; ) {
+                for (I = y + 3; f < I; ) {
                   if (l === 0)
                     break e;
                   l--, s += i[a++] << f, f += 8;
                 }
                 s >>>= y, f -= y, b = 0, h = 3 + (s & 7), s >>>= 3, f -= 3;
               } else {
-                for (T = y + 7; f < T; ) {
+                for (I = y + 7; f < I; ) {
                   if (l === 0)
                     break e;
                   l--, s += i[a++] << f, f += 8;
@@ -2283,11 +2283,11 @@ const so = (e) => {
             e.msg = "invalid code -- missing end-of-block", t.mode = O;
             break;
           }
-          if (t.lenbits = 9, v = { bits: t.lenbits }, w = Ae(wi, t.lens, 0, t.nlen, t.lencode, 0, t.work, v), t.lenbits = v.bits, w) {
+          if (t.lenbits = 9, v = { bits: t.lenbits }, w = Ae(gi, t.lens, 0, t.nlen, t.lencode, 0, t.work, v), t.lenbits = v.bits, w) {
             e.msg = "invalid literal/lengths set", t.mode = O;
             break;
           }
-          if (t.distbits = 6, t.distcode = t.distdyn, v = { bits: t.distbits }, w = Ae(mi, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, v), t.distbits = v.bits, w) {
+          if (t.distbits = 6, t.distcode = t.distdyn, v = { bits: t.distbits }, w = Ae(wi, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, v), t.distbits = v.bits, w) {
             e.msg = "invalid distances set", t.mode = O;
             break;
           }
@@ -2314,7 +2314,7 @@ const so = (e) => {
             s >>>= p, f -= p, t.back += p;
           }
           if (s >>>= y, f -= y, t.back += y, t.length = C, E === 0) {
-            t.mode = Un;
+            t.mode = Bn;
             break;
           }
           if (E & 32) {
@@ -2325,18 +2325,18 @@ const so = (e) => {
             e.msg = "invalid literal/length code", t.mode = O;
             break;
           }
-          t.extra = E & 15, t.mode = On;
-        case On:
+          t.extra = E & 15, t.mode = An;
+        case An:
           if (t.extra) {
-            for (T = t.extra; f < T; ) {
+            for (I = t.extra; f < I; ) {
               if (l === 0)
                 break e;
               l--, s += i[a++] << f, f += 8;
             }
             t.length += s & (1 << t.extra) - 1, s >>>= t.extra, f -= t.extra, t.back += t.extra;
           }
-          t.was = t.length, t.mode = zn;
-        case zn:
+          t.was = t.length, t.mode = On;
+        case On:
           for (; k = t.distcode[s & (1 << t.distbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
             if (l === 0)
               break e;
@@ -2354,10 +2354,10 @@ const so = (e) => {
             e.msg = "invalid distance code", t.mode = O;
             break;
           }
-          t.offset = C, t.extra = E & 15, t.mode = Rn;
-        case Rn:
+          t.offset = C, t.extra = E & 15, t.mode = zn;
+        case zn:
           if (t.extra) {
-            for (T = t.extra; f < T; ) {
+            for (I = t.extra; f < I; ) {
               if (l === 0)
                 break e;
               l--, s += i[a++] << f, f += 8;
@@ -2368,8 +2368,8 @@ const so = (e) => {
             e.msg = "invalid distance too far back", t.mode = O;
             break;
           }
-          t.mode = Bn;
-        case Bn:
+          t.mode = Rn;
+        case Rn:
           if (u === 0)
             break e;
           if (h = c - u, t.offset > h) {
@@ -2386,12 +2386,12 @@ const so = (e) => {
           while (--h);
           t.length === 0 && (t.mode = Qe);
           break;
-        case Un:
+        case Bn:
           if (u === 0)
             break e;
           r[o++] = t.length, u--, t.mode = Qe;
           break;
-        case kt:
+        case yt:
           if (t.wrap) {
             for (; f < 32; ) {
               if (l === 0)
@@ -2399,14 +2399,14 @@ const so = (e) => {
               l--, s |= i[a++] << f, f += 8;
             }
             if (c -= u, e.total_out += c, t.total += c, t.wrap & 4 && c && (e.adler = t.check = /*UPDATE_CHECK(state.check, put - _out, _out);*/
-            t.flags ? R(t.check, r, c, o - c) : Ue(t.check, r, c, o - c)), c = u, t.wrap & 4 && (t.flags ? s : Ln(s)) !== t.check) {
+            t.flags ? R(t.check, r, c, o - c) : Ue(t.check, r, c, o - c)), c = u, t.wrap & 4 && (t.flags ? s : Vn(s)) !== t.check) {
               e.msg = "incorrect data check", t.mode = O;
               break;
             }
             s = 0, f = 0;
           }
-          t.mode = Dn;
-        case Dn:
+          t.mode = Un;
+        case Un:
           if (t.wrap && t.flags) {
             for (; f < 32; ) {
               if (l === 0)
@@ -2419,21 +2419,21 @@ const so = (e) => {
             }
             s = 0, f = 0;
           }
-          t.mode = Vn;
-        case Vn:
+          t.mode = Dn;
+        case Dn:
           w = Ja;
           break e;
         case O:
-          w = yi;
+          w = mi;
           break e;
+        case vi:
+          return yi;
         case ki:
-          return vi;
-        case $i:
         default:
           return P;
       }
-  return e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = l, t.hold = s, t.bits = f, (t.wsize || c !== e.avail_out && t.mode < O && (t.mode < kt || n !== _n)) && Ti(e, e.output, e.next_out, c - e.avail_out), d -= e.avail_in, c -= e.avail_out, e.total_in += d, e.total_out += c, t.total += c, t.wrap & 4 && c && (e.adler = t.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
-  t.flags ? R(t.check, r, c, e.next_out - c) : Ue(t.check, r, c, e.next_out - c)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === K ? 128 : 0) + (t.mode === Je || t.mode === vt ? 256 : 0), (d === 0 && c === 0 || n === _n) && w === he && (w = eo), w;
+  return e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = l, t.hold = s, t.bits = f, (t.wsize || c !== e.avail_out && t.mode < O && (t.mode < yt || n !== pn)) && Ni(e, e.output, e.next_out, c - e.avail_out), d -= e.avail_in, c -= e.avail_out, e.total_in += d, e.total_out += c, t.total += c, t.wrap & 4 && c && (e.adler = t.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
+  t.flags ? R(t.check, r, c, e.next_out - c) : Ue(t.check, r, c, e.next_out - c)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === K ? 128 : 0) + (t.mode === Je || t.mode === mt ? 256 : 0), (d === 0 && c === 0 || n === pn) && w === he && (w = eo), w;
 }, fo = (e) => {
   if (ce(e))
     return P;
@@ -2447,9 +2447,9 @@ const so = (e) => {
 }, ho = (e, n) => {
   const t = n.length;
   let i, r, a;
-  return ce(e) || (i = e.state, i.wrap !== 0 && i.mode !== at) ? P : i.mode === at && (r = 1, r = Ue(r, n, t, 0), r !== i.check) ? yi : (a = Ti(e, n, t, t), a ? (i.mode = ki, vi) : (i.havedict = 1, he));
+  return ce(e) || (i = e.state, i.wrap !== 0 && i.mode !== at) ? P : i.mode === at && (r = 1, r = Ue(r, n, t, 0), r !== i.check) ? mi : (a = Ni(e, n, t, t), a ? (i.mode = vi, yi) : (i.havedict = 1, he));
 };
-var co = Ci, po = Si, _o = Ei, bo = oo, go = Ni, wo = lo, mo = fo, yo = uo, vo = ho, ko = "pako inflate (from Nodeca project)", X = {
+var co = Ei, po = Ci, _o = $i, bo = oo, go = Si, wo = lo, mo = fo, yo = uo, vo = ho, ko = "pako inflate (from Nodeca project)", X = {
   inflateReset: co,
   inflateReset2: po,
   inflateResetKeep: _o,
@@ -2469,20 +2469,20 @@ const Ii = Object.prototype.toString, {
   Z_NO_FLUSH: Co,
   Z_FINISH: So,
   Z_OK: Le,
-  Z_STREAM_END: Ct,
-  Z_NEED_DICT: St,
+  Z_STREAM_END: $t,
+  Z_NEED_DICT: Et,
   Z_STREAM_ERROR: No,
-  Z_DATA_ERROR: Pn,
-  Z_MEM_ERROR: To
+  Z_DATA_ERROR: Fn,
+  Z_MEM_ERROR: Io
 } = xe;
 function He(e) {
-  this.options = ht.assign({
+  this.options = ft.assign({
     chunkSize: 1024 * 64,
     windowBits: 15,
     to: ""
   }, e || {});
   const n = this.options;
-  n.raw && n.windowBits >= 0 && n.windowBits < 16 && (n.windowBits = -n.windowBits, n.windowBits === 0 && (n.windowBits = -15)), n.windowBits >= 0 && n.windowBits < 16 && !(e && e.windowBits) && (n.windowBits += 32), n.windowBits > 15 && n.windowBits < 48 && (n.windowBits & 15 || (n.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new bi(), this.strm.avail_out = 0;
+  n.raw && n.windowBits >= 0 && n.windowBits < 16 && (n.windowBits = -n.windowBits, n.windowBits === 0 && (n.windowBits = -15)), n.windowBits >= 0 && n.windowBits < 16 && !(e && e.windowBits) && (n.windowBits += 32), n.windowBits > 15 && n.windowBits < 48 && (n.windowBits & 15 || (n.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new _i(), this.strm.avail_out = 0;
   let t = X.inflateInit2(
     this.strm,
     n.windowBits
@@ -2498,23 +2498,23 @@ He.prototype.push = function(e, n) {
   if (this.ended)
     return !1;
   for (n === ~~n ? o = n : o = n === !0 ? So : Co, Ii.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
-    for (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), a = X.inflate(t, o), a === St && r && (a = X.inflateSetDictionary(t, r), a === Le ? a = X.inflate(t, o) : a === Pn && (a = St)); t.avail_in > 0 && a === Ct && t.state.wrap > 0 && e[t.next_in] !== 0; )
+    for (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), a = X.inflate(t, o), a === Et && r && (a = X.inflateSetDictionary(t, r), a === Le ? a = X.inflate(t, o) : a === Fn && (a = Et)); t.avail_in > 0 && a === $t && t.state.wrap > 0 && e[t.next_in] !== 0; )
       X.inflateReset(t), a = X.inflate(t, o);
     switch (a) {
       case No:
-      case Pn:
-      case St:
-      case To:
+      case Fn:
+      case Et:
+      case Io:
         return this.onEnd(a), this.ended = !0, !1;
     }
-    if (l = t.avail_out, t.next_out && (t.avail_out === 0 || a === Ct))
+    if (l = t.avail_out, t.next_out && (t.avail_out === 0 || a === $t))
       if (this.options.to === "string") {
         let u = Ve.utf8border(t.output, t.next_out), s = t.next_out - u, f = Ve.buf2string(t.output, u);
         t.next_out = s, t.avail_out = i - s, s && t.output.set(t.output.subarray(u, u + s), 0), this.onData(f);
       } else
         this.onData(t.output.length === t.next_out ? t.output : t.output.subarray(0, t.next_out));
     if (!(a === Le && l === 0)) {
-      if (a === Ct)
+      if (a === $t)
         return a = X.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, !0;
       if (t.avail_in === 0)
         break;
@@ -2526,18 +2526,18 @@ He.prototype.onData = function(e) {
   this.chunks.push(e);
 };
 He.prototype.onEnd = function(e) {
-  e === Le && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ht.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+  e === Le && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ft.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
-function Kt(e, n) {
+function Yt(e, n) {
   const t = new He(n);
   if (t.push(e), t.err)
     throw t.msg || ge[t.err];
   return t.result;
 }
-function Io(e, n) {
-  return n = n || {}, n.raw = !0, Kt(e, n);
+function To(e, n) {
+  return n = n || {}, n.raw = !0, Yt(e, n);
 }
-var Ao = He, Oo = Kt, zo = Io, Ro = Kt, Bo = xe, Uo = {
+var Ao = He, Oo = Yt, zo = To, Ro = Yt, Bo = xe, Uo = {
   Inflate: Ao,
   inflate: Oo,
   inflateRaw: zo,
@@ -2575,7 +2575,7 @@ function et(e) {
       throw new DOMException("aborted", "AbortError");
 }
 const Zo = 1, xo = 2, Mo = 3;
-function Nt(e, n, t, i) {
+function Ct(e, n, t, i) {
   return e < i && n >= t;
 }
 function Ho(e) {
@@ -2617,10 +2617,10 @@ function Ho(e) {
     leafParser: i
   };
 }
-class Ai {
+class Ti {
   constructor(n, t, i, r, a, o) {
-    if (this.bbi = n, this.refsByName = t, this.cirTreeOffset = i, this.isBigEndian = r, this.isCompressed = a, this.blockType = o, this.featureCache = new Yn({
-      cache: new Kn({ maxSize: 1e3 }),
+    if (this.bbi = n, this.refsByName = t, this.cirTreeOffset = i, this.isBigEndian = r, this.isCompressed = a, this.blockType = o, this.featureCache = new Gn({
+      cache: new Yn({ maxSize: 1e3 }),
       fill: async (u, s) => {
         const f = Number(u.length), d = Number(u.offset), { buffer: c } = await this.bbi.read(Q.Buffer.alloc(f), 0, f, d, {
           signal: s
@@ -2701,7 +2701,7 @@ class Ai {
       const c = o.getFloat32(a, !0);
       a += 4;
       const h = o.getFloat32(a, !0);
-      a += 4, a += 4, (!i || l === i.chrId && Nt(u, s, i.start, i.end)) && r.push({
+      a += 4, a += 4, (!i || l === i.chrId && Ct(u, s, i.start, i.end)) && r.push({
         start: u,
         end: s,
         maxScore: c,
@@ -2719,7 +2719,7 @@ class Ai {
       const l = this.bigBedParser.parse(n.subarray(o));
       a.push({ ...l, uniqueId: `bb-${i + o}` }), o += l.offset;
     }
-    return r ? a.filter((l) => Nt(l.start, l.end, r.start, r.end)) : a;
+    return r ? a.filter((l) => Ct(l.start, l.end, r.start, r.end)) : a;
   }
   parseBigWigBlock(n, t, i) {
     const r = n.subarray(t), a = new DataView(r.buffer, r.byteOffset, r.length);
@@ -2767,7 +2767,7 @@ class Ai {
         break;
       }
     }
-    return i ? c.filter((h) => Nt(h.start, h.end, i.start, i.end)) : c;
+    return i ? c.filter((h) => Ct(h.start, h.end, i.start, i.end)) : c;
   }
   async readFeatures(n, t, i = {}) {
     try {
@@ -2801,18 +2801,18 @@ class Ai {
     }
   }
 }
-var Pt = function(e, n) {
-  return Pt = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(t, i) {
+var Lt = function(e, n) {
+  return Lt = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(t, i) {
     t.__proto__ = i;
   } || function(t, i) {
     for (var r in i)
       Object.prototype.hasOwnProperty.call(i, r) && (t[r] = i[r]);
-  }, Pt(e, n);
+  }, Lt(e, n);
 };
-function Wt(e, n) {
+function Kt(e, n) {
   if (typeof n != "function" && n !== null)
     throw new TypeError("Class extends value " + String(n) + " is not a constructor or null");
-  Pt(e, n);
+  Lt(e, n);
   function t() {
     this.constructor = e;
   }
@@ -2845,7 +2845,7 @@ function jo(e, n, t, i) {
     s((i = i.apply(e, n || [])).next());
   });
 }
-function Oi(e, n) {
+function Ai(e, n) {
   var t = { label: 0, sent: function() {
     if (a[0] & 1)
       throw a[1];
@@ -2922,7 +2922,7 @@ function Fe(e) {
     };
   throw new TypeError(n ? "Object is not iterable." : "Symbol.iterator is not defined.");
 }
-function ot(e, n) {
+function Ft(e, n) {
   var t = typeof Symbol == "function" && e[Symbol.iterator];
   if (!t)
     return e;
@@ -2942,7 +2942,7 @@ function ot(e, n) {
   }
   return a;
 }
-function st(e, n, t) {
+function Pt(e, n, t) {
   if (t || arguments.length === 2)
     for (var i = 0, r = n.length, a; i < r; i++)
       (a || !(i in n)) && (a || (a = Array.prototype.slice.call(n, 0, i)), a[i] = n[i]);
@@ -3008,13 +3008,13 @@ function Yo(e) {
 function z(e) {
   return typeof e == "function";
 }
-function zi(e) {
+function Oi(e) {
   var n = function(i) {
     Error.call(i), i.stack = new Error().stack;
   }, t = e(n);
   return t.prototype = Object.create(Error.prototype), t.prototype.constructor = t, t;
 }
-var Tt = zi(function(e) {
+var St = Oi(function(e) {
   return function(t) {
     e(this), this.message = t ? t.length + ` errors occurred during unsubscription:
 ` + t.map(function(i, r) {
@@ -3023,13 +3023,13 @@ var Tt = zi(function(e) {
   `) : "", this.name = "UnsubscriptionError", this.errors = t;
   };
 });
-function Zn(e, n) {
+function Pn(e, n) {
   if (e) {
     var t = e.indexOf(n);
     0 <= t && e.splice(t, 1);
   }
 }
-var Xt = function() {
+var Wt = function() {
   function e(n) {
     this.initialTeardown = n, this.closed = !1, this._parentage = null, this._finalizers = null;
   }
@@ -3062,7 +3062,7 @@ var Xt = function() {
         try {
           f();
         } catch (g) {
-          a = g instanceof Tt ? g.errors : [g];
+          a = g instanceof St ? g.errors : [g];
         }
       var d = this._finalizers;
       if (d) {
@@ -3071,9 +3071,9 @@ var Xt = function() {
           for (var c = Fe(d), h = c.next(); !h.done; h = c.next()) {
             var _ = h.value;
             try {
-              xn(_);
+              Zn(_);
             } catch (g) {
-              a = a ?? [], g instanceof Tt ? a = st(st([], ot(a)), ot(g.errors)) : a.push(g);
+              a = a ?? [], g instanceof St ? a = Pt(Pt([], Ft(a)), Ft(g.errors)) : a.push(g);
             }
           }
         } catch (g) {
@@ -3088,13 +3088,13 @@ var Xt = function() {
         }
       }
       if (a)
-        throw new Tt(a);
+        throw new St(a);
     }
   }, e.prototype.add = function(n) {
     var t;
     if (n && n !== this)
       if (this.closed)
-        xn(n);
+        Zn(n);
       else {
         if (n instanceof e) {
           if (n.closed || n._hasParent(this))
@@ -3111,59 +3111,58 @@ var Xt = function() {
     this._parentage = Array.isArray(t) ? (t.push(n), t) : t ? [t, n] : n;
   }, e.prototype._removeParent = function(n) {
     var t = this._parentage;
-    t === n ? this._parentage = null : Array.isArray(t) && Zn(t, n);
+    t === n ? this._parentage = null : Array.isArray(t) && Pn(t, n);
   }, e.prototype.remove = function(n) {
     var t = this._finalizers;
-    t && Zn(t, n), n instanceof e && n._removeParent(this);
+    t && Pn(t, n), n instanceof e && n._removeParent(this);
   }, e.EMPTY = function() {
     var n = new e();
     return n.closed = !0, n;
   }(), e;
 }();
-Xt.EMPTY;
-function Ri(e) {
-  return e instanceof Xt || e && "closed" in e && z(e.remove) && z(e.add) && z(e.unsubscribe);
+Wt.EMPTY;
+function zi(e) {
+  return e instanceof Wt || e && "closed" in e && z(e.remove) && z(e.add) && z(e.unsubscribe);
 }
-function xn(e) {
+function Zn(e) {
   z(e) ? e() : e.unsubscribe();
 }
-var Bi = {
+var Ri = {
   onUnhandledError: null,
   onStoppedNotification: null,
   Promise: void 0,
   useDeprecatedSynchronousErrorHandling: !1,
   useDeprecatedNextContext: !1
-}, Zt = {
+}, Bi = {
   setTimeout: function(e, n) {
     for (var t = [], i = 2; i < arguments.length; i++)
       t[i - 2] = arguments[i];
-    var r = Zt.delegate;
-    return r != null && r.setTimeout ? r.setTimeout.apply(r, st([e, n], ot(t))) : setTimeout.apply(void 0, st([e, n], ot(t)));
+    return setTimeout.apply(void 0, Pt([e, n], Ft(t)));
   },
   clearTimeout: function(e) {
-    var n = Zt.delegate;
+    var n = Bi.delegate;
     return ((n == null ? void 0 : n.clearTimeout) || clearTimeout)(e);
   },
   delegate: void 0
 };
 function Ui(e) {
-  Zt.setTimeout(function() {
+  Bi.setTimeout(function() {
     throw e;
   });
 }
-function Mn() {
+function xn() {
 }
 function Ko(e) {
   e();
 }
-var qt = function(e) {
-  Wt(n, e);
+var Xt = function(e) {
+  Kt(n, e);
   function n(t) {
     var i = e.call(this) || this;
-    return i.isStopped = !1, t ? (i.destination = t, Ri(t) && t.add(i)) : i.destination = Jo, i;
+    return i.isStopped = !1, t ? (i.destination = t, zi(t) && t.add(i)) : i.destination = Jo, i;
   }
   return n.create = function(t, i, r) {
-    return new lt(t, i, r);
+    return new ot(t, i, r);
   }, n.prototype.next = function(t) {
     this.isStopped || this._next(t);
   }, n.prototype.error = function(t) {
@@ -3187,8 +3186,8 @@ var qt = function(e) {
       this.unsubscribe();
     }
   }, n;
-}(Xt), Wo = Function.prototype.bind;
-function It(e, n) {
+}(Wt), Wo = Function.prototype.bind;
+function Nt(e, n) {
   return Wo.call(e, n);
 }
 var Xo = function() {
@@ -3222,8 +3221,8 @@ var Xo = function() {
         tt(t);
       }
   }, e;
-}(), lt = function(e) {
-  Wt(n, e);
+}(), ot = function(e) {
+  Kt(n, e);
   function n(t, i, r) {
     var a = e.call(this) || this, o;
     if (z(t) || !t)
@@ -3234,18 +3233,18 @@ var Xo = function() {
       };
     else {
       var l;
-      a && Bi.useDeprecatedNextContext ? (l = Object.create(t), l.unsubscribe = function() {
+      a && Ri.useDeprecatedNextContext ? (l = Object.create(t), l.unsubscribe = function() {
         return a.unsubscribe();
       }, o = {
-        next: t.next && It(t.next, l),
-        error: t.error && It(t.error, l),
-        complete: t.complete && It(t.complete, l)
+        next: t.next && Nt(t.next, l),
+        error: t.error && Nt(t.error, l),
+        complete: t.complete && Nt(t.complete, l)
       }) : o = t;
     }
     return a.destination = new Xo(o), a;
   }
   return n;
-}(qt);
+}(Xt);
 function tt(e) {
   Ui(e);
 }
@@ -3254,10 +3253,10 @@ function qo(e) {
 }
 var Jo = {
   closed: !0,
-  next: Mn,
+  next: xn,
   error: qo,
-  complete: Mn
-}, Jt = function() {
+  complete: xn
+}, qt = function() {
   return typeof Symbol == "function" && Symbol.observable || "@@observable";
 }();
 function Di(e) {
@@ -3278,7 +3277,7 @@ var Z = function() {
     var t = new e();
     return t.source = this, t.operator = n, t;
   }, e.prototype.subscribe = function(n, t, i) {
-    var r = this, a = ts(n) ? n : new lt(n, t, i);
+    var r = this, a = ts(n) ? n : new ot(n, t, i);
     return Ko(function() {
       var o = r, l = o.operator, u = o.source;
       a.add(l ? l.call(a, u) : u ? r._subscribe(a) : r._trySubscribe(a));
@@ -3291,8 +3290,8 @@ var Z = function() {
     }
   }, e.prototype.forEach = function(n, t) {
     var i = this;
-    return t = Hn(t), new t(function(r, a) {
-      var o = new lt({
+    return t = Mn(t), new t(function(r, a) {
+      var o = new ot({
         next: function(l) {
           try {
             n(l);
@@ -3308,7 +3307,7 @@ var Z = function() {
   }, e.prototype._subscribe = function(n) {
     var t;
     return (t = this.source) === null || t === void 0 ? void 0 : t.subscribe(n);
-  }, e.prototype[Jt] = function() {
+  }, e.prototype[qt] = function() {
     return this;
   }, e.prototype.pipe = function() {
     for (var n = [], t = 0; t < arguments.length; t++)
@@ -3316,7 +3315,7 @@ var Z = function() {
     return Qo(n)(this);
   }, e.prototype.toPromise = function(n) {
     var t = this;
-    return n = Hn(n), new n(function(i, r) {
+    return n = Mn(n), new n(function(i, r) {
       var a;
       t.subscribe(function(o) {
         return a = o;
@@ -3330,15 +3329,15 @@ var Z = function() {
     return new e(n);
   }, e;
 }();
-function Hn(e) {
+function Mn(e) {
   var n;
-  return (n = e ?? Bi.Promise) !== null && n !== void 0 ? n : Promise;
+  return (n = e ?? Ri.Promise) !== null && n !== void 0 ? n : Promise;
 }
 function es(e) {
   return e && z(e.next) && z(e.error) && z(e.complete);
 }
 function ts(e) {
-  return e && e instanceof qt || es(e) && Ri(e);
+  return e && e instanceof Xt || es(e) && zi(e);
 }
 function ns(e) {
   return z(e == null ? void 0 : e.lift);
@@ -3360,7 +3359,7 @@ function Pe(e, n, t, i, r) {
   return new is(e, n, t, i, r);
 }
 var is = function(e) {
-  Wt(n, e);
+  Kt(n, e);
   function n(t, i, r, a, o, l) {
     var u = e.call(this, t) || this;
     return u.onFinalize = o, u.shouldUnsubscribe = l, u._next = i ? function(s) {
@@ -3394,7 +3393,7 @@ var is = function(e) {
       e.prototype.unsubscribe.call(this), !i && ((t = this.onFinalize) === null || t === void 0 || t.call(this));
     }
   }, n;
-}(qt), rs = new Z(function(e) {
+}(Xt), rs = new Z(function(e) {
   return e.complete();
 });
 function as(e) {
@@ -3416,7 +3415,7 @@ function Fi(e) {
   return z(e == null ? void 0 : e.then);
 }
 function Pi(e) {
-  return z(e[Jt]);
+  return z(e[qt]);
 }
 function Zi(e) {
   return Symbol.asyncIterator && z(e == null ? void 0 : e[Symbol.asyncIterator]);
@@ -3434,7 +3433,7 @@ function Hi(e) {
 function ji(e) {
   return Go(this, arguments, function() {
     var t, i, r, a;
-    return Oi(this, function(o) {
+    return Ai(this, function(o) {
       switch (o.label) {
         case 0:
           t = e.getReader(), o.label = 1;
@@ -3486,7 +3485,7 @@ function Ee(e) {
 }
 function fs(e) {
   return new Z(function(n) {
-    var t = e[Jt]();
+    var t = e[qt]();
     if (z(t.subscribe))
       return t.subscribe(n);
     throw new TypeError("Provided object does not correctly implement Symbol.observable");
@@ -3544,7 +3543,7 @@ function ps(e, n) {
   var t, i, r, a;
   return jo(this, void 0, void 0, function() {
     var o, l;
-    return Oi(this, function(u) {
+    return Ai(this, function(u) {
       switch (u.label) {
         case 0:
           u.trys.push([0, 5, 6, 11]), t = Yo(e), u.label = 1;
@@ -3682,7 +3681,7 @@ function ys(e, n) {
 function vs(e, n) {
   return n ? ys(e, n) : Ee(e);
 }
-var ks = zi(function(e) {
+var ks = Oi(function(e) {
   return function() {
     e(this), this.name = "EmptyError", this.message = "no elements in sequence";
   };
@@ -3690,7 +3689,7 @@ var ks = zi(function(e) {
 function qi(e, n) {
   var t = typeof n == "object";
   return new Promise(function(i, r) {
-    var a = new lt({
+    var a = new ot({
       next: function(o) {
         i(o), a.unsubscribe();
       },
@@ -3780,16 +3779,16 @@ function er(e, n) {
 var Ns = function(e, n) {
   return e.push(n), e;
 };
-function Ts() {
+function Is() {
   return $e(function(e, n) {
     er(Ns, [])(e).subscribe(n);
   });
 }
-const jn = -2003829722, At = -2021002517;
-function Is(e) {
+const Hn = -2003829722, It = -2021002517;
+function Ts(e) {
   return new TextDecoder().decode(e);
 }
-function Gn(e) {
+function jn(e) {
   const n = e ? "big" : "little", t = new N().endianess(n).int32("magic").uint16("version").uint16("numZoomLevels").uint64("chromTreeOffset").uint64("unzoomedDataOffset").uint64("unzoomedIndexOffset").uint16("fieldCount").uint16("definedFieldCount").uint64("asOffset").uint64("totalSummaryOffset").uint32("uncompressBufSize").uint64("extHeaderOffset").array("zoomLevels", {
     length: "numZoomLevels",
     type: new N().endianess(n).uint32("reductionLevel").uint32("reserved").uint64("dataOffset").uint64("indexOffset")
@@ -3833,12 +3832,12 @@ class tr {
     return { ...t, ...i };
   }
   async _getMainHeader(n, t = 2e3) {
-    const { buffer: i } = await this.bbi.read(Q.Buffer.alloc(t), 0, t, 0, n), r = this._isBigEndian(i), a = Gn(r), o = a.headerParser.parse(i), { magic: l, asOffset: u, totalSummaryOffset: s } = o;
-    if (o.fileType = l === At ? "bigbed" : "bigwig", u > t || s > t)
+    const { buffer: i } = await this.bbi.read(Q.Buffer.alloc(t), 0, t, 0, n), r = this._isBigEndian(i), a = jn(r), o = a.headerParser.parse(i), { magic: l, asOffset: u, totalSummaryOffset: s } = o;
+    if (o.fileType = l === It ? "bigbed" : "bigwig", u > t || s > t)
       return this._getMainHeader(n, t * 2);
     if (u) {
       const f = Number(o.asOffset);
-      o.autoSql = Is(i.subarray(f, i.indexOf(0, f)));
+      o.autoSql = Ts(i.subarray(f, i.indexOf(0, f)));
     }
     if (o.totalSummaryOffset > t)
       return this._getMainHeader(n, t * 2);
@@ -3850,9 +3849,9 @@ class tr {
   }
   _isBigEndian(n) {
     let t = n.readInt32LE(0);
-    if (t === jn || t === At)
+    if (t === Hn || t === It)
       return !1;
-    if (t = n.readInt32BE(0), t === jn || t === At)
+    if (t = n.readInt32BE(0), t === Hn || t === It)
       return !0;
     throw new Error("not a BigWig/BigBed file");
   }
@@ -3863,7 +3862,7 @@ class tr {
     const u = Number(n.chromTreeOffset);
     for (; l % 4 !== 0; )
       l += 1;
-    const s = l - u, { buffer: f } = await this.bbi.read(Q.Buffer.alloc(s), 0, s, Number(u), t), d = Gn(i), { keySize: c } = d.chromTreeParser.parse(f), h = new N().endianess(r).string("key", { stripNull: !0, length: c }).uint32("refId").uint32("refSize").saveOffset("offset"), _ = new N().endianess(r).skip(c).uint64("childOffset").saveOffset("offset"), g = 32, k = async (y) => {
+    const s = l - u, { buffer: f } = await this.bbi.read(Q.Buffer.alloc(s), 0, s, Number(u), t), d = jn(i), { keySize: c } = d.chromTreeParser.parse(f), h = new N().endianess(r).string("key", { stripNull: !0, length: c }).uint32("refId").uint32("refSize").saveOffset("offset"), _ = new N().endianess(r).skip(c).uint64("childOffset").saveOffset("offset"), g = 32, k = async (y) => {
       let E = y;
       if (E >= f.length)
         throw new Error("reading beyond end of buffer");
@@ -3872,8 +3871,8 @@ class tr {
         for (let S = 0; S < $; S += 1) {
           const b = h.parse(f.subarray(E));
           E += b.offset;
-          const { key: w, refId: m, refSize: v } = b, T = { name: w, id: m, length: v };
-          o[this.renameRefSeqs(w)] = m, a[m] = T;
+          const { key: w, refId: m, refSize: v } = b, I = { name: w, id: m, length: v };
+          o[this.renameRefSeqs(w)] = m, a[m] = I;
         }
       else {
         const S = [];
@@ -3895,7 +3894,7 @@ class tr {
    */
   async getUnzoomedView(n) {
     const { unzoomedIndexOffset: t, refsByName: i, uncompressBufSize: r, isBigEndian: a, fileType: o } = await this.getHeader(n);
-    return new Ai(this.bbi, i, t, a, r > 0, o);
+    return new Ti(this.bbi, i, t, a, r > 0, o);
   }
   /**
    * Gets features from a BigWig file
@@ -3916,7 +3915,7 @@ class tr {
   }
   async getFeatures(n, t, i, r) {
     const a = await this.getFeatureStream(n, t, i, r);
-    return (await qi(a.pipe(Ts()))).flat();
+    return (await qi(a.pipe(Is()))).flat();
   }
 }
 class Fs extends tr {
@@ -3934,7 +3933,7 @@ class Fs extends tr {
       const d = i[f];
       if (d && d.reductionLevel <= 2 * u) {
         const c = Number(d.indexOffset);
-        return new Ai(this.bbi, r, c, o, l > 0, "summary");
+        return new Ti(this.bbi, r, c, o, l > 0, "summary");
       }
     }
     return this.getUnzoomedView(t);
@@ -3945,8 +3944,8 @@ function As(e) {
 }
 class Ps extends tr {
   constructor() {
-    super(...arguments), this.readIndicesCache = new Yn({
-      cache: new Kn({ maxSize: 1 }),
+    super(...arguments), this.readIndicesCache = new Gn({
+      cache: new Yn({ maxSize: 1 }),
       fill: (n, t) => this._readIndices({ ...n, signal: t })
     });
   }