@genome-spy/app 0.42.2 → 0.43.1

package/dist/{index-d7k3kkin.js → index-noY1e-G6.js}

@@ -597,19 +597,19 @@ class N {
         return d;
       }, a = (f) => (f <= 8 ? (n.pushCode(`${i} = dataView.getUint8(offset);`), f = 8) : f <= 16 ? (n.pushCode(`${i} = dataView.getUint16(offset);`), f = 16) : f <= 24 ? (n.pushCode(`${i} = (dataView.getUint16(offset) << 8) | dataView.getUint8(offset + 2);`), f = 24) : (n.pushCode(`${i} = dataView.getUint32(offset);`), f = 32), n.pushCode(`offset += ${f / 8};`), f);
       let o = 0;
-      const l = this.endian === "be";
-      let u = 0, s = 0;
+      const s = this.endian === "be";
+      let u = 0, l = 0;
       n.bitFields.forEach((f, d) => {
         let c = f.options.length;
-        if (c > s) {
-          if (s) {
-            const g = -1 >>> 32 - s;
-            n.pushCode(`${f.varName} = (${i} & 0x${g.toString(16)}) << ${c - s};`), c -= s;
+        if (c > l) {
+          if (l) {
+            const g = -1 >>> 32 - l;
+            n.pushCode(`${f.varName} = (${i} & 0x${g.toString(16)}) << ${c - l};`), c -= l;
           }
-          o = 0, s = u = a(r(d) - s);
+          o = 0, l = u = a(r(d) - l);
         }
-        const h = l ? u - o - c : o, _ = -1 >>> 32 - c;
-        n.pushCode(`${f.varName} ${c < f.options.length ? "|=" : "="} ${i} >> ${h} & 0x${_.toString(16)};`), f.options.length === 32 && n.pushCode(`${f.varName} >>>= 0`), f.options.assert && f.generateAssert(n), f.options.formatter && f.generateFormatter(n, f.varName, f.options.formatter), o += c, s -= c;
+        const h = s ? u - o - c : o, _ = -1 >>> 32 - c;
+        n.pushCode(`${f.varName} ${c < f.options.length ? "|=" : "="} ${i} >> ${h} & 0x${_.toString(16)};`), f.options.length === 32 && n.pushCode(`${f.varName} >>>= 0`), f.options.assert && f.generateAssert(n), f.options.formatter && f.generateFormatter(n, f.varName, f.options.formatter), o += c, l -= c;
       }), n.bitFields = [];
     }
   }
@@ -620,13 +620,13 @@ class N {
   generateString(n) {
     const t = n.generateVariable(this.varName), i = n.generateTmpVariable(), r = this.options.encoding, a = r.toLowerCase() === "hex", o = 'b => b.toString(16).padStart(2, "0")';
     if (this.options.length && this.options.zeroTerminated) {
-      const l = this.options.length;
-      n.pushCode(`var ${i} = offset;`), n.pushCode(`while(dataView.getUint8(offset++) !== 0 && offset - ${i} < ${l});`);
-      const u = `offset - ${i} < ${l} ? offset - 1 : offset`;
+      const s = this.options.length;
+      n.pushCode(`var ${i} = offset;`), n.pushCode(`while(dataView.getUint8(offset++) !== 0 && offset - ${i} < ${s});`);
+      const u = `offset - ${i} < ${s} ? offset - 1 : offset`;
       n.pushCode(a ? `${t} = Array.from(buffer.subarray(${i}, ${u}), ${o}).join('');` : `${t} = new TextDecoder('${r}').decode(buffer.subarray(${i}, ${u}));`);
     } else if (this.options.length) {
-      const l = n.generateOption(this.options.length);
-      n.pushCode(a ? `${t} = Array.from(buffer.subarray(offset, offset + ${l}), ${o}).join('');` : `${t} = new TextDecoder('${r}').decode(buffer.subarray(offset, offset + ${l}));`), n.pushCode(`offset += ${l};`);
+      const s = n.generateOption(this.options.length);
+      n.pushCode(a ? `${t} = Array.from(buffer.subarray(offset, offset + ${s}), ${o}).join('');` : `${t} = new TextDecoder('${r}').decode(buffer.subarray(offset, offset + ${s}));`), n.pushCode(`offset += ${s};`);
     } else
       this.options.zeroTerminated ? (n.pushCode(`var ${i} = offset;`), n.pushCode("while(dataView.getUint8(offset++) !== 0);"), n.pushCode(a ? `${t} = Array.from(buffer.subarray(${i}, offset - 1), ${o}).join('');` : `${t} = new TextDecoder('${r}').decode(buffer.subarray(${i}, offset - 1));`)) : this.options.greedy && (n.pushCode(`var ${i} = offset;`), n.pushCode("while(buffer.length > offset++);"), n.pushCode(a ? `${t} = Array.from(buffer.subarray(${i}, offset), ${o}).join('');` : `${t} = new TextDecoder('${r}').decode(buffer.subarray(${i}, offset));`));
     this.options.stripNull && n.pushCode(`${t} = ${t}.replace(/\\x00+$/g, '')`);
@@ -647,27 +647,27 @@ class N {
     this.options.clone && n.pushCode(`${t} = buffer.constructor.from(${t});`);
   }
   generateArray(n) {
-    const t = n.generateOption(this.options.length), i = n.generateOption(this.options.lengthInBytes), r = this.options.type, a = n.generateTmpVariable(), o = n.generateVariable(this.varName), l = n.generateTmpVariable(), u = this.options.key, s = typeof u == "string";
-    if (s ? n.pushCode(`${o} = {};`) : n.pushCode(`${o} = [];`), typeof this.options.readUntil == "function" ? n.pushCode("do {") : this.options.readUntil === "eof" ? n.pushCode(`for (var ${a} = 0; offset < buffer.length; ${a}++) {`) : i !== void 0 ? n.pushCode(`for (var ${a} = offset + ${i}; offset < ${a}; ) {`) : n.pushCode(`for (var ${a} = ${t}; ${a} > 0; ${a}--) {`), typeof r == "string")
+    const t = n.generateOption(this.options.length), i = n.generateOption(this.options.lengthInBytes), r = this.options.type, a = n.generateTmpVariable(), o = n.generateVariable(this.varName), s = n.generateTmpVariable(), u = this.options.key, l = typeof u == "string";
+    if (l ? n.pushCode(`${o} = {};`) : n.pushCode(`${o} = [];`), typeof this.options.readUntil == "function" ? n.pushCode("do {") : this.options.readUntil === "eof" ? n.pushCode(`for (var ${a} = 0; offset < buffer.length; ${a}++) {`) : i !== void 0 ? n.pushCode(`for (var ${a} = offset + ${i}; offset < ${a}; ) {`) : n.pushCode(`for (var ${a} = ${t}; ${a} > 0; ${a}--) {`), typeof r == "string")
       if (x.get(r)) {
         const f = n.generateTmpVariable();
         if (n.pushCode(`var ${f} = ${oe + r}(offset, {`), n.useContextVariables) {
           const d = n.generateVariable();
           n.pushCode(`$parent: ${d},`), n.pushCode(`$root: ${d}.$root,`), !this.options.readUntil && i === void 0 && n.pushCode(`$index: ${t} - ${a},`);
         }
-        n.pushCode("});"), n.pushCode(`var ${l} = ${f}.result; offset = ${f}.offset;`), r !== this.alias && n.addReference(r);
+        n.pushCode("});"), n.pushCode(`var ${s} = ${f}.result; offset = ${f}.offset;`), r !== this.alias && n.addReference(r);
       } else {
         const f = Ye[r], d = Ke[r];
-        n.pushCode(`var ${l} = dataView.get${f}(offset, ${d});`), n.pushCode(`offset += ${M[r]};`);
+        n.pushCode(`var ${s} = dataView.get${f}(offset, ${d});`), n.pushCode(`offset += ${M[r]};`);
       }
     else if (r instanceof N) {
-      n.pushCode(`var ${l} = {};`);
+      n.pushCode(`var ${s} = {};`);
       const f = n.generateVariable();
-      n.pushScope(l), n.useContextVariables && (n.pushCode(`${l}.$parent = ${f};`), n.pushCode(`${l}.$root = ${f}.$root;`), !this.options.readUntil && i === void 0 && n.pushCode(`${l}.$index = ${t} - ${a};`)), r.generate(n), n.useContextVariables && (n.pushCode(`delete ${l}.$parent;`), n.pushCode(`delete ${l}.$root;`), n.pushCode(`delete ${l}.$index;`)), n.popScope();
+      n.pushScope(s), n.useContextVariables && (n.pushCode(`${s}.$parent = ${f};`), n.pushCode(`${s}.$root = ${f}.$root;`), !this.options.readUntil && i === void 0 && n.pushCode(`${s}.$index = ${t} - ${a};`)), r.generate(n), n.useContextVariables && (n.pushCode(`delete ${s}.$parent;`), n.pushCode(`delete ${s}.$root;`), n.pushCode(`delete ${s}.$index;`)), n.popScope();
     }
-    if (s ? n.pushCode(`${o}[${l}.${u}] = ${l};`) : n.pushCode(`${o}.push(${l});`), n.pushCode("}"), typeof this.options.readUntil == "function") {
+    if (l ? n.pushCode(`${o}[${s}.${u}] = ${s};`) : n.pushCode(`${o}.push(${s});`), n.pushCode("}"), typeof this.options.readUntil == "function") {
       const f = this.options.readUntil, d = n.addImport(f);
-      n.pushCode(`while (!${d}.call(${n.generateVariable()}, ${l}, buffer.subarray(offset)));`);
+      n.pushCode(`while (!${d}.call(${n.generateVariable()}, ${s}, buffer.subarray(offset)));`);
     }
   }
   generateChoiceCase(n, t, i) {
@@ -716,10 +716,10 @@ class N {
   generateWrapper(n) {
     const t = n.generateVariable(this.varName), i = n.generateTmpVariable();
     if (typeof this.options.readUntil == "function") {
-      const u = this.options.readUntil, s = n.generateTmpVariable(), f = n.generateTmpVariable();
-      n.pushCode(`var ${s} = offset;`), n.pushCode(`var ${f} = 0;`), n.pushCode("while (offset < buffer.length) {"), n.pushCode(`${f} = dataView.getUint8(offset);`);
+      const u = this.options.readUntil, l = n.generateTmpVariable(), f = n.generateTmpVariable();
+      n.pushCode(`var ${l} = offset;`), n.pushCode(`var ${f} = 0;`), n.pushCode("while (offset < buffer.length) {"), n.pushCode(`${f} = dataView.getUint8(offset);`);
       const d = n.addImport(u);
-      n.pushCode(`if (${d}.call(${n.generateVariable()}, ${f}, buffer.subarray(offset))) break;`), n.pushCode("offset += 1;"), n.pushCode("}"), n.pushCode(`${i} = buffer.subarray(${s}, offset);`);
+      n.pushCode(`if (${d}.call(${n.generateVariable()}, ${f}, buffer.subarray(offset))) break;`), n.pushCode("offset += 1;"), n.pushCode("}"), n.pushCode(`${i} = buffer.subarray(${l}, offset);`);
     } else if (this.options.readUntil === "eof")
       n.pushCode(`${i} = buffer.subarray(offset);`);
     else {
@@ -727,8 +727,8 @@ class N {
       n.pushCode(`${i} = buffer.subarray(offset, offset + ${u});`), n.pushCode(`offset += ${u};`);
     }
     this.options.clone && n.pushCode(`${i} = buffer.constructor.from(${i});`);
-    const r = n.generateTmpVariable(), a = n.generateTmpVariable(), o = n.generateTmpVariable(), l = n.addImport(this.options.wrapper);
-    if (n.pushCode(`${i} = ${l}.call(this, ${i}).subarray(0);`), n.pushCode(`var ${r} = buffer;`), n.pushCode(`var ${a} = offset;`), n.pushCode(`var ${o} = dataView;`), n.pushCode(`buffer = ${i};`), n.pushCode("offset = 0;"), n.pushCode("dataView = new DataView(buffer.buffer, buffer.byteOffset, buffer.length);"), this.options.type instanceof N)
+    const r = n.generateTmpVariable(), a = n.generateTmpVariable(), o = n.generateTmpVariable(), s = n.addImport(this.options.wrapper);
+    if (n.pushCode(`${i} = ${s}.call(this, ${i}).subarray(0);`), n.pushCode(`var ${r} = buffer;`), n.pushCode(`var ${a} = offset;`), n.pushCode(`var ${o} = dataView;`), n.pushCode(`buffer = ${i};`), n.pushCode("offset = 0;"), n.pushCode("dataView = new DataView(buffer.buffer, buffer.byteOffset, buffer.length);"), this.options.type instanceof N)
       this.varName && n.pushCode(`${t} = {};`), n.pushPath(this.varName), this.options.type.generate(n), n.popPath(this.varName);
     else if (x.has(this.options.type)) {
       const u = n.generateTmpVariable();
@@ -753,13 +753,13 @@ class N {
     } else if (x.has(this.options.type)) {
       const o = n.generateTmpVariable();
       if (n.pushCode(`var ${o} = ${oe + this.options.type}(offset, {`), n.useContextVariables) {
-        const l = n.generateVariable();
-        n.pushCode(`$parent: ${l},`), n.pushCode(`$root: ${l}.$root,`);
+        const s = n.generateVariable();
+        n.pushCode(`$parent: ${s},`), n.pushCode(`$root: ${s}.$root,`);
       }
       n.pushCode("});"), n.pushCode(`${a} = ${o}.result; offset = ${o}.offset;`), this.options.type !== this.alias && n.addReference(this.options.type);
     } else if (Object.keys(M).indexOf(this.options.type) >= 0) {
-      const o = Ye[t], l = Ke[t];
-      n.pushCode(`${a} = dataView.get${o}(offset, ${l});`), n.pushCode(`offset += ${M[t]};`);
+      const o = Ye[t], s = Ke[t];
+      n.pushCode(`${a} = dataView.get${o}(offset, ${s});`), n.pushCode(`offset += ${M[t]};`);
     }
     n.pushCode(`offset = ${r};`);
   }
@@ -806,13 +806,13 @@ class q {
   }
   intersection(n) {
     let t = this, i = n;
-    const r = this.ranges(), a = i.ranges(), o = r.length, l = a.length;
-    let u = 0, s = 0;
+    const r = this.ranges(), a = i.ranges(), o = r.length, s = a.length;
+    let u = 0, l = 0;
     const f = [];
-    for (; u < o && s < l; ) {
-      t = r[u], i = a[s];
+    for (; u < o && l < s; ) {
+      t = r[u], i = a[l];
       const d = Math.max(t.min(), i.min()), c = Math.min(t.max(), i.max());
-      c >= d && f.push(new q(d, c)), t.max() > i.max() ? s += 1 : u += 1;
+      c >= d && f.push(new q(d, c)), t.max() > i.max() ? l += 1 : u += 1;
     }
     if (f.length === 0)
       throw new Error("found range of length 0");
@@ -885,12 +885,12 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
 }, wr = (e) => {
   e.bi_valid === 16 ? (Be(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
 }, mr = (e, n) => {
-  const t = n.dyn_tree, i = n.max_code, r = n.stat_desc.static_tree, a = n.stat_desc.has_stree, o = n.stat_desc.extra_bits, l = n.stat_desc.extra_base, u = n.stat_desc.max_length;
-  let s, f, d, c, h, _, g = 0;
+  const t = n.dyn_tree, i = n.max_code, r = n.stat_desc.static_tree, a = n.stat_desc.has_stree, o = n.stat_desc.extra_bits, s = n.stat_desc.extra_base, u = n.stat_desc.max_length;
+  let l, 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 < 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)));
+  for (t[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < Wn; l++)
+    f = e.heap[l], 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 >= s && (h = o[f - s]), _ = t[f * 2], e.opt_len += _ * (c + h), a && (e.static_len += _ * (r[f * 2 + 1] + h)));
   if (g !== 0) {
     do {
       for (c = u - 1; e.bl_count[c] === 0; )
@@ -899,7 +899,7 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     } while (g > 0);
     for (c = u; c !== 0; c--)
       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--);
+        d = e.heap[--l], !(d > i) && (t[d * 2 + 1] !== c && (e.opt_len += (c - t[d * 2 + 1]) * t[d * 2], t[d * 2 + 1] = c), f--);
   }
 }, ai = (e, n, t) => {
   const i = new Array(se + 1);
@@ -907,8 +907,8 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
   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] = ri(i[l]++, l));
+    let s = e[o * 2 + 1];
+    s !== 0 && (e[o * 2] = ri(i[s]++, s));
   }
 }, yr = () => {
   let e, n, t, i, r;
@@ -956,22 +956,22 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     e.heap[t] = e.heap[r], t = r, r <<= 1;
   e.heap[t] = i;
 }, nn = (e, n, t) => {
-  let i, r, a = 0, o, l;
+  let i, r, a = 0, o, s;
   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 = 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)));
+      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), s = Tt[o], s !== 0 && (r -= Ht[o], D(e, r, s)), i--, o = ii(i), j(e, o, t), s = nt[o], s !== 0 && (i -= it[o], D(e, i, s)));
     while (a < e.sym_next);
   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;
+  let o, s, u = -1, l;
   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]);
+    l = e.heap[++e.heap_len] = u < 2 ? ++u : 0, t[l * 2] = 1, e.depth[l] = 0, e.opt_len--, r && (e.static_len -= i[l * 2 + 1]);
   for (n.max_code = u, o = e.heap_len >> 1; o >= 1; o--)
     pt(e, t, o);
-  s = a;
+  l = a;
   do
     o = e.heap[
       1
@@ -984,13 +984,13 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
       t,
       1
       /*SMALLEST*/
-    ), l = e.heap[
+    ), s = e.heap[
       1
       /*SMALLEST*/
-    ], 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[
+    ], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = s, t[l * 2] = t[o * 2] + t[s * 2], e.depth[l] = (e.depth[o] >= e.depth[s] ? e.depth[o] : e.depth[s]) + 1, t[o * 2 + 1] = t[s * 2 + 1] = l, e.heap[
       1
       /*SMALLEST*/
-    ] = s++, pt(
+    ] = l++, pt(
       e,
       t,
       1
@@ -1002,20 +1002,20 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     /*SMALLEST*/
   ], 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[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));
+  let i, r = -1, a, o = n[0 * 2 + 1], s = 0, u = 7, l = 4;
+  for (o === 0 && (u = 138, l = 3), n[(t + 1) * 2 + 1] = 65535, i = 0; i <= t; i++)
+    a = o, o = n[(i + 1) * 2 + 1], !(++s < u && a === o) && (s < l ? e.bl_tree[a * 2] += s : a !== 0 ? (a !== r && e.bl_tree[a * 2]++, e.bl_tree[Xn * 2]++) : s <= 10 ? e.bl_tree[qn * 2]++ : e.bl_tree[Jn * 2]++, s = 0, r = a, o === 0 ? (u = 138, l = 3) : a === o ? (u = 6, l = 3) : (u = 7, l = 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)) {
-      if (l < s)
+  let i, r = -1, a, o = n[0 * 2 + 1], s = 0, u = 7, l = 4;
+  for (o === 0 && (u = 138, l = 3), i = 0; i <= t; i++)
+    if (a = o, o = n[(i + 1) * 2 + 1], !(++s < u && a === o)) {
+      if (s < l)
         do
           j(e, a, e.bl_tree);
-        while (--l !== 0);
+        while (--s !== 0);
       else
-        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);
+        a !== 0 ? (a !== r && (j(e, a, e.bl_tree), s--), j(e, Xn, e.bl_tree), D(e, s - 3, 2)) : s <= 10 ? (j(e, qn, e.bl_tree), D(e, s - 3, 3)) : (j(e, Jn, e.bl_tree), D(e, s - 11, 7));
+      s = 0, r = a, o === 0 ? (u = 138, l = 3) : a === o ? (u = 6, l = 3) : (u = 7, l = 4);
     }
 }, vr = (e) => {
   let n;
@@ -1193,20 +1193,20 @@ const V = (e) => {
   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);
 }, 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];
-  e.prev_length >= e.good_match && (t >>= 2), l > e.lookahead && (l = e.lookahead);
+  let t = e.max_chain_length, i = e.strstart, r, a, o = e.prev_length, s = e.nice_match;
+  const u = e.strstart > e.w_size - Y ? e.strstart - (e.w_size - Y) : 0, l = e.window, f = e.w_mask, d = e.prev, c = e.strstart + ee;
+  let h = l[i + o - 1], _ = l[i + o];
+  e.prev_length >= e.good_match && (t >>= 2), s > e.lookahead && (s = e.lookahead);
   do
-    if (r = n, !(s[r + o] !== _ || s[r + o - 1] !== h || s[r] !== s[i] || s[++r] !== s[i + 1])) {
+    if (r = n, !(l[r + o] !== _ || l[r + o - 1] !== h || l[r] !== l[i] || l[++r] !== l[i + 1])) {
       i += 2, r++;
       do
         ;
-      while (s[++i] === s[++r] && s[++i] === s[++r] && s[++i] === s[++r] && s[++i] === s[++r] && s[++i] === s[++r] && s[++i] === s[++r] && s[++i] === s[++r] && s[++i] === s[++r] && i < c);
+      while (l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && i < c);
       if (a = ee - (c - i), i = c - ee, a > o) {
-        if (e.match_start = n, o = a, a >= l)
+        if (e.match_start = n, o = a, a >= s)
           break;
-        h = s[i + o - 1], _ = s[i + o];
+        h = l[i + o - 1], _ = l[i + o];
       }
     }
   while ((n = d[n & f]) > u && --t !== 0);
@@ -1222,13 +1222,13 @@ const V = (e) => {
         ;
   } while (e.lookahead < Y && e.strm.avail_in !== 0);
 }, 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;
+  let t = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, i, r, a, o = 0, s = 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, 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 && (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);
+  return s -= e.strm.avail_in, s && (s >= 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 <= s && (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 - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), 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 (; ; ) {
@@ -1368,8 +1368,8 @@ const Me = (e) => {
   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 + 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);
+  const s = new ca();
+  return e.state = s, s.strm = e, s.status = we, s.wrap = o, s.gzhead = null, s.w_bits = i, s.w_size = 1 << s.w_bits, s.w_mask = s.w_size - 1, s.hash_bits = r + 7, s.hash_size = 1 << s.hash_bits, s.hash_mask = s.hash_size - 1, s.hash_shift = ~~((s.hash_bits + T - 1) / T), s.window = new Uint8Array(s.w_size * 2), s.head = new Uint16Array(s.hash_size), s.prev = new Uint16Array(s.w_size), s.lit_bufsize = 1 << r + 6, s.pending_buf_size = s.lit_bufsize * 4, s.pending_buf = new Uint8Array(s.pending_buf_size), s.sym_buf = s.lit_bufsize, s.sym_end = (s.lit_bufsize - 1) * 3, s.level = n, s.strategy = a, s.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;
@@ -1402,10 +1402,10 @@ const Me = (e) => {
     if (t.gzhead.extra) {
       let r = t.pending, a = (t.gzhead.extra.length & 65535) - t.gzindex;
       for (; t.pending + a > t.pending_buf_size; ) {
-        let l = t.pending_buf_size - t.pending;
-        if (t.pending_buf.set(t.gzhead.extra.subarray(t.gzindex, t.gzindex + l), t.pending), t.pending = t.pending_buf_size, t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex += l, V(e), t.pending !== 0)
+        let s = t.pending_buf_size - t.pending;
+        if (t.pending_buf.set(t.gzhead.extra.subarray(t.gzindex, t.gzindex + s), t.pending), t.pending = t.pending_buf_size, t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex += s, V(e), t.pending !== 0)
           return t.last_flush = -1, B;
-        r = 0, a -= l;
+        r = 0, a -= s;
       }
       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;
@@ -1476,15 +1476,15 @@ const Me = (e) => {
     let u = new Uint8Array(i.w_size);
     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;
+  const a = e.avail_in, o = e.next_in, s = e.input;
   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);
+    let u = i.strstart, l = i.lookahead - (T - 1);
     do
       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);
+    while (--l);
     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 = T - 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 = s, e.avail_in = a, i.wrap = r, B;
 };
 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,
@@ -1537,10 +1537,10 @@ De[254] = De[254] = 1;
 var Aa = (e) => {
   if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
     return new TextEncoder().encode(e);
-  let n, t, i, r, a, o = e.length, l = 0;
+  let n, t, i, r, a, o = e.length, s = 0;
   for (r = 0; r < o; r++)
-    t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < o && (i = e.charCodeAt(r + 1), (i & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (i - 56320), r++)), l += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
-  for (n = new Uint8Array(l), a = 0, r = 0; a < l; r++)
+    t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < o && (i = e.charCodeAt(r + 1), (i & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (i - 56320), r++)), s += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
+  for (n = new Uint8Array(s), a = 0, r = 0; a < s; r++)
     t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < o && (i = e.charCodeAt(r + 1), (i & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (i - 56320), r++)), t < 128 ? n[a++] = t : t < 2048 ? (n[a++] = 192 | t >>> 6, n[a++] = 128 | t & 63) : t < 65536 ? (n[a++] = 224 | t >>> 12, n[a++] = 128 | t >>> 6 & 63, n[a++] = 128 | t & 63) : (n[a++] = 240 | t >>> 18, n[a++] = 128 | t >>> 12 & 63, n[a++] = 128 | t >>> 6 & 63, n[a++] = 128 | t & 63);
   return n;
 };
@@ -1564,14 +1564,14 @@ var za = (e, n) => {
       a[r++] = o;
       continue;
     }
-    let l = De[o];
-    if (l > 4) {
-      a[r++] = 65533, i += l - 1;
+    let s = De[o];
+    if (s > 4) {
+      a[r++] = 65533, i += s - 1;
       continue;
     }
-    for (o &= l === 2 ? 31 : l === 3 ? 15 : 7; l > 1 && i < t; )
-      o = o << 6 | e[i++] & 63, l--;
-    if (l > 1) {
+    for (o &= s === 2 ? 31 : s === 3 ? 15 : 7; s > 1 && i < t; )
+      o = o << 6 | e[i++] & 63, s--;
+    if (s > 1) {
       a[r++] = 65533;
       continue;
     }
@@ -1665,9 +1665,9 @@ Gt.prototype.onEnd = function(e) {
 };
 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;
+  let i, r, a, o, s, u, l, f, d, c, h, _, g, k, y, E, C, p, $, S, b, w, m, v;
   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;
+  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), s = a + (n.avail_out - 257), u = I.dmax, l = 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];
@@ -1690,7 +1690,7 @@ var Ha = function(n, t) {
                       break e;
                     }
                     if (b = 0, w = c, d === 0) {
-                      if (b += s - p, p < $) {
+                      if (b += l - p, p < $) {
                         $ -= p;
                         do
                           v[a++] = c[b++];
@@ -1698,7 +1698,7 @@ var Ha = function(n, t) {
                         b = a - S, w = v;
                       }
                     } else if (d < p) {
-                      if (b += s + d - p, p -= d, p < $) {
+                      if (b += l + d - p, p -= d, p < $) {
                         $ -= p;
                         do
                           v[a++] = c[b++];
@@ -1751,8 +1751,8 @@ 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), I.hold = h, I.bits = _;
+    } while (i < r && a < s);
+  $ = _ >> 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 < s ? 257 + (s - a) : 257 - (a - s), I.hold = h, I.bits = _;
 };
 const pe = 15, un = 852, hn = 592, cn = 0, gt = 1, dn = 2, ja = new Uint16Array([
   /* Length codes 257..285 base */
@@ -1888,53 +1888,53 @@ const pe = 15, un = 852, hn = 592, cn = 0, gt = 1, dn = 2, ja = new Uint16Array(
   29,
   64,
   64
-]), 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;
+]), Wa = (e, n, t, i, r, a, o, s) => {
+  const u = s.bits;
+  let l = 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), I = new Uint16Array(pe + 1);
   let ae = null, Jt, je, Ge;
-  for (s = 0; s <= pe; s++)
-    v[s] = 0;
+  for (l = 0; l <= pe; l++)
+    v[l] = 0;
   for (f = 0; f < i; f++)
     v[n[t + f]]++;
   for (h = u, c = pe; c >= 1 && v[c] === 0; c--)
     ;
   if (h > c && (h = c), c === 0)
-    return r[a++] = 1 << 24 | 64 << 16 | 0, r[a++] = 1 << 24 | 64 << 16 | 0, l.bits = 1, 0;
+    return r[a++] = 1 << 24 | 64 << 16 | 0, r[a++] = 1 << 24 | 64 << 16 | 0, s.bits = 1, 0;
   for (d = 1; d < c && v[d] === 0; d++)
     ;
-  for (h < d && (h = d), k = 1, s = 1; s <= pe; s++)
-    if (k <<= 1, k -= v[s], k < 0)
+  for (h < d && (h = d), k = 1, l = 1; l <= pe; l++)
+    if (k <<= 1, k -= v[l], k < 0)
       return -1;
   if (k > 0 && (e === cn || c !== 1))
     return -1;
-  for (I[1] = 0, s = 1; s < pe; s++)
-    I[s + 1] = I[s] + v[s];
+  for (I[1] = 0, l = 1; l < pe; l++)
+    I[l + 1] = I[l] + v[l];
   for (f = 0; f < i; f++)
     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)
+  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, l = d, b = a, _ = h, g = 0, $ = -1, y = 1 << h, S = y - 1, e === gt && y > un || e === dn && y > hn)
     return 1;
   for (; ; ) {
-    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;
+    Jt = l - 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 << l - g, p = 1 << _, d = p;
     do
       p -= C, r[b + (E >> g) + p] = Jt << 24 | je << 16 | Ge | 0;
     while (p !== 0);
-    for (C = 1 << s - 1; E & C; )
+    for (C = 1 << l - 1; E & C; )
       C >>= 1;
-    if (C !== 0 ? (E &= C - 1, E += C) : E = 0, f++, --v[s] === 0) {
-      if (s === c)
+    if (C !== 0 ? (E &= C - 1, E += C) : E = 0, f++, --v[l] === 0) {
+      if (l === c)
         break;
-      s = n[t + o[f]];
+      l = n[t + o[f]];
     }
-    if (s > h && (E & S) !== $) {
-      for (g === 0 && (g = h), b += d, _ = s - g, k = 1 << _; _ + g < c && (k -= v[_ + g], !(k <= 0)); )
+    if (l > h && (E & S) !== $) {
+      for (g === 0 && (g = h), b += d, _ = l - g, k = 1 << _; _ + g < c && (k -= v[_ + g], !(k <= 0)); )
         _++, k <<= 1;
       if (y += 1 << _, e === gt && y > un || e === dn && y > hn)
         return 1;
       $ = E & S, r[$] = h << 24 | _ << 16 | b - a | 0;
     }
   }
-  return E !== 0 && (r[b + E] = s - g << 24 | 64 << 16 | 0), l.bits = h, 0;
+  return E !== 0 && (r[b + E] = l - g << 24 | 64 << 16 | 0), s.bits = h, 0;
 };
 var Ae = Wa;
 const Xa = 0, gi = 1, wi = 2, {
@@ -2005,7 +2005,7 @@ const so = (e) => {
   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;
+  let t, i, r, a, o, s, u, l, f, d, c, h, _, g, k = 0, y, E, C, p, $, S, b, w;
   const m = new Uint8Array(4);
   let v, I;
   const ae = (
@@ -2014,7 +2014,7 @@ const so = (e) => {
   );
   if (ce(e) || !e.output || !e.input && e.avail_in !== 0)
     return P;
-  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;
+  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, s = e.avail_in, l = t.hold, f = t.bits, d = s, c = u, w = he;
   e:
     for (; ; )
       switch (t.mode) {
@@ -2024,36 +2024,36 @@ const so = (e) => {
             break;
           }
           for (; f < 16; ) {
-            if (l === 0)
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += 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 = bn;
+          if (t.wrap & 2 && l === 35615) {
+            t.wbits === 0 && (t.wbits = 15), t.check = 0, m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = R(t.check, m, 2, 0), l = 0, f = 0, t.mode = bn;
             break;
           }
           if (t.head && (t.head.done = !1), !(t.wrap & 1) || /* check if zlib header allowed */
-          (((s & 255) << 8) + (s >> 8)) % 31) {
+          (((l & 255) << 8) + (l >> 8)) % 31) {
             e.msg = "incorrect header check", t.mode = O;
             break;
           }
-          if ((s & 15) !== _n) {
+          if ((l & 15) !== _n) {
             e.msg = "unknown compression method", t.mode = O;
             break;
           }
-          if (s >>>= 4, f -= 4, b = (s & 15) + 8, t.wbits === 0 && (t.wbits = b), b > 15 || b > t.wbits) {
+          if (l >>>= 4, f -= 4, b = (l & 15) + 8, t.wbits === 0 && (t.wbits = b), b > 15 || b > t.wbits) {
             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 ? En : K, s = 0, f = 0;
+          t.dmax = 1 << t.wbits, t.flags = 0, e.adler = t.check = 1, t.mode = l & 512 ? En : K, l = 0, f = 0;
           break;
         case bn:
           for (; f < 16; ) {
-            if (l === 0)
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += i[a++] << f, f += 8;
           }
-          if (t.flags = s, (t.flags & 255) !== _n) {
+          if (t.flags = l, (t.flags & 255) !== _n) {
             e.msg = "unknown compression method", t.mode = O;
             break;
           }
@@ -2061,34 +2061,34 @@ 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 = gn;
+          t.head && (t.head.text = l >> 8 & 1), t.flags & 512 && t.wrap & 4 && (m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = R(t.check, m, 2, 0)), l = 0, f = 0, t.mode = gn;
         case gn:
           for (; f < 32; ) {
-            if (l === 0)
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += 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 = wn;
+          t.head && (t.head.time = l), t.flags & 512 && t.wrap & 4 && (m[0] = l & 255, m[1] = l >>> 8 & 255, m[2] = l >>> 16 & 255, m[3] = l >>> 24 & 255, t.check = R(t.check, m, 4, 0)), l = 0, f = 0, t.mode = wn;
         case wn:
           for (; f < 16; ) {
-            if (l === 0)
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += 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 = mn;
+          t.head && (t.head.xflags = l & 255, t.head.os = l >> 8), t.flags & 512 && t.wrap & 4 && (m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = R(t.check, m, 2, 0)), l = 0, f = 0, t.mode = mn;
         case mn:
           if (t.flags & 1024) {
             for (; f < 16; ) {
-              if (l === 0)
+              if (s === 0)
                 break e;
-              l--, s += i[a++] << f, f += 8;
+              s--, l += i[a++] << f, f += 8;
             }
-            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;
+            t.length = l, t.head && (t.head.extra_len = l), t.flags & 512 && t.wrap & 4 && (m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = R(t.check, m, 2, 0)), l = 0, f = 0;
           } else
             t.head && (t.head.extra = null);
           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(
+          if (t.flags & 1024 && (h = t.length, h > s && (h = s), 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,
               // extra field is limited to 65536 bytes
@@ -2097,31 +2097,31 @@ const so = (e) => {
             ),
             /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
             b
-          )), t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), l -= h, a += h, t.length -= h), t.length))
+          )), t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), s -= h, a += h, t.length -= h), t.length))
             break e;
           t.length = 0, t.mode = vn;
         case vn:
           if (t.flags & 2048) {
-            if (l === 0)
+            if (s === 0)
               break e;
             h = 0;
             do
               b = i[a + h++], t.head && b && t.length < 65536 && (t.head.name += String.fromCharCode(b));
-            while (b && h < l);
-            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), l -= h, a += h, b)
+            while (b && h < s);
+            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), s -= h, a += h, b)
               break e;
           } else
             t.head && (t.head.name = null);
           t.length = 0, t.mode = kn;
         case kn:
           if (t.flags & 4096) {
-            if (l === 0)
+            if (s === 0)
               break e;
             h = 0;
             do
               b = i[a + h++], t.head && b && t.length < 65536 && (t.head.comment += String.fromCharCode(b));
-            while (b && h < l);
-            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), l -= h, a += h, b)
+            while (b && h < s);
+            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), s -= h, a += h, b)
               break e;
           } else
             t.head && (t.head.comment = null);
@@ -2129,49 +2129,49 @@ const so = (e) => {
         case $n:
           if (t.flags & 512) {
             for (; f < 16; ) {
-              if (l === 0)
+              if (s === 0)
                 break e;
-              l--, s += i[a++] << f, f += 8;
+              s--, l += i[a++] << f, f += 8;
             }
-            if (t.wrap & 4 && s !== (t.check & 65535)) {
+            if (t.wrap & 4 && l !== (t.check & 65535)) {
               e.msg = "header crc mismatch", t.mode = O;
               break;
             }
-            s = 0, f = 0;
+            l = 0, f = 0;
           }
           t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = !0), e.adler = t.check = 0, t.mode = K;
           break;
         case En:
           for (; f < 32; ) {
-            if (l === 0)
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += i[a++] << f, f += 8;
           }
-          e.adler = t.check = Vn(s), s = 0, f = 0, t.mode = at;
+          e.adler = t.check = Vn(l), l = 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;
+            return e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = s, t.hold = l, t.bits = f, Qa;
           e.adler = t.check = 1, t.mode = K;
         case K:
           if (n === qa || n === qe)
             break e;
         case wt:
           if (t.last) {
-            s >>>= f & 7, f -= f & 7, t.mode = yt;
+            l >>>= f & 7, f -= f & 7, t.mode = yt;
             break;
           }
           for (; f < 3; ) {
-            if (l === 0)
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += i[a++] << f, f += 8;
           }
-          switch (t.last = s & 1, s >>>= 1, f -= 1, s & 3) {
+          switch (t.last = l & 1, l >>>= 1, f -= 1, l & 3) {
             case 0:
               t.mode = Cn;
               break;
             case 1:
               if (so(t), t.mode = Je, n === qe) {
-                s >>>= 2, f -= 2;
+                l >>>= 2, f -= 2;
                 break e;
               }
               break;
@@ -2181,38 +2181,38 @@ const so = (e) => {
             case 3:
               e.msg = "invalid block type", t.mode = O;
           }
-          s >>>= 2, f -= 2;
+          l >>>= 2, f -= 2;
           break;
         case Cn:
-          for (s >>>= f & 7, f -= f & 7; f < 32; ) {
-            if (l === 0)
+          for (l >>>= f & 7, f -= f & 7; f < 32; ) {
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += i[a++] << f, f += 8;
           }
-          if ((s & 65535) !== (s >>> 16 ^ 65535)) {
+          if ((l & 65535) !== (l >>> 16 ^ 65535)) {
             e.msg = "invalid stored block lengths", t.mode = O;
             break;
           }
-          if (t.length = s & 65535, s = 0, f = 0, t.mode = mt, n === qe)
+          if (t.length = l & 65535, l = 0, f = 0, t.mode = mt, n === qe)
             break e;
         case mt:
           t.mode = Sn;
         case Sn:
           if (h = t.length, h) {
-            if (h > l && (h = l), h > u && (h = u), h === 0)
+            if (h > s && (h = s), h > u && (h = u), h === 0)
               break e;
-            r.set(i.subarray(a, a + h), o), l -= h, a += h, u -= h, o += h, t.length -= h;
+            r.set(i.subarray(a, a + h), o), s -= h, a += h, u -= h, o += h, t.length -= h;
             break;
           }
           t.mode = K;
           break;
         case Nn:
           for (; f < 14; ) {
-            if (l === 0)
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += i[a++] << f, f += 8;
           }
-          if (t.nlen = (s & 31) + 257, s >>>= 5, f -= 5, t.ndist = (s & 31) + 1, s >>>= 5, f -= 5, t.ncode = (s & 15) + 4, s >>>= 4, f -= 4, t.nlen > 286 || t.ndist > 30) {
+          if (t.nlen = (l & 31) + 257, l >>>= 5, f -= 5, t.ndist = (l & 31) + 1, l >>>= 5, f -= 5, t.ncode = (l & 15) + 4, l >>>= 4, f -= 4, t.nlen > 286 || t.ndist > 30) {
             e.msg = "too many length or distance symbols", t.mode = O;
             break;
           }
@@ -2220,11 +2220,11 @@ const so = (e) => {
         case In:
           for (; t.have < t.ncode; ) {
             for (; f < 3; ) {
-              if (l === 0)
+              if (s === 0)
                 break e;
-              l--, s += i[a++] << f, f += 8;
+              s--, l += i[a++] << f, f += 8;
             }
-            t.lens[ae[t.have++]] = s & 7, s >>>= 3, f -= 3;
+            t.lens[ae[t.have++]] = l & 7, l >>>= 3, f -= 3;
           }
           for (; t.have < 19; )
             t.lens[ae[t.have++]] = 0;
@@ -2235,39 +2235,39 @@ const so = (e) => {
           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)
+            for (; k = t.lencode[l & (1 << t.lenbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
+              if (s === 0)
                 break e;
-              l--, s += i[a++] << f, f += 8;
+              s--, l += i[a++] << f, f += 8;
             }
             if (C < 16)
-              s >>>= y, f -= y, t.lens[t.have++] = C;
+              l >>>= y, f -= y, t.lens[t.have++] = C;
             else {
               if (C === 16) {
                 for (I = y + 2; f < I; ) {
-                  if (l === 0)
+                  if (s === 0)
                     break e;
-                  l--, s += i[a++] << f, f += 8;
+                  s--, l += i[a++] << f, f += 8;
                 }
-                if (s >>>= y, f -= y, t.have === 0) {
+                if (l >>>= y, f -= y, t.have === 0) {
                   e.msg = "invalid bit length repeat", t.mode = O;
                   break;
                 }
-                b = t.lens[t.have - 1], h = 3 + (s & 3), s >>>= 2, f -= 2;
+                b = t.lens[t.have - 1], h = 3 + (l & 3), l >>>= 2, f -= 2;
               } else if (C === 17) {
                 for (I = y + 3; f < I; ) {
-                  if (l === 0)
+                  if (s === 0)
                     break e;
-                  l--, s += i[a++] << f, f += 8;
+                  s--, l += i[a++] << f, f += 8;
                 }
-                s >>>= y, f -= y, b = 0, h = 3 + (s & 7), s >>>= 3, f -= 3;
+                l >>>= y, f -= y, b = 0, h = 3 + (l & 7), l >>>= 3, f -= 3;
               } else {
                 for (I = y + 7; f < I; ) {
-                  if (l === 0)
+                  if (s === 0)
                     break e;
-                  l--, s += i[a++] << f, f += 8;
+                  s--, l += i[a++] << f, f += 8;
                 }
-                s >>>= y, f -= y, b = 0, h = 11 + (s & 127), s >>>= 7, f -= 7;
+                l >>>= y, f -= y, b = 0, h = 11 + (l & 127), l >>>= 7, f -= 7;
               }
               if (t.have + h > t.nlen + t.ndist) {
                 e.msg = "invalid bit length repeat", t.mode = O;
@@ -2296,24 +2296,24 @@ const so = (e) => {
         case Je:
           t.mode = Qe;
         case Qe:
-          if (l >= 6 && u >= 258) {
-            e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = l, t.hold = s, t.bits = f, Ha(e, c), 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, t.mode === K && (t.back = -1);
+          if (s >= 6 && u >= 258) {
+            e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = s, t.hold = l, t.bits = f, Ha(e, c), o = e.next_out, r = e.output, u = e.avail_out, a = e.next_in, i = e.input, s = e.avail_in, l = t.hold, f = t.bits, t.mode === K && (t.back = -1);
             break;
           }
-          for (t.back = 0; k = t.lencode[s & (1 << t.lenbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
-            if (l === 0)
+          for (t.back = 0; k = t.lencode[l & (1 << t.lenbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += i[a++] << f, f += 8;
           }
           if (E && !(E & 240)) {
-            for (p = y, $ = E, S = C; k = t.lencode[S + ((s & (1 << p + $) - 1) >> p)], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(p + y <= f); ) {
-              if (l === 0)
+            for (p = y, $ = E, S = C; k = t.lencode[S + ((l & (1 << p + $) - 1) >> p)], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(p + y <= f); ) {
+              if (s === 0)
                 break e;
-              l--, s += i[a++] << f, f += 8;
+              s--, l += i[a++] << f, f += 8;
             }
-            s >>>= p, f -= p, t.back += p;
+            l >>>= p, f -= p, t.back += p;
           }
-          if (s >>>= y, f -= y, t.back += y, t.length = C, E === 0) {
+          if (l >>>= y, f -= y, t.back += y, t.length = C, E === 0) {
             t.mode = Bn;
             break;
           }
@@ -2329,28 +2329,28 @@ const so = (e) => {
         case An:
           if (t.extra) {
             for (I = t.extra; f < I; ) {
-              if (l === 0)
+              if (s === 0)
                 break e;
-              l--, s += i[a++] << f, f += 8;
+              s--, l += i[a++] << f, f += 8;
             }
-            t.length += s & (1 << t.extra) - 1, s >>>= t.extra, f -= t.extra, t.back += t.extra;
+            t.length += l & (1 << t.extra) - 1, l >>>= t.extra, f -= t.extra, t.back += t.extra;
           }
           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)
+          for (; k = t.distcode[l & (1 << t.distbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
+            if (s === 0)
               break e;
-            l--, s += i[a++] << f, f += 8;
+            s--, l += i[a++] << f, f += 8;
           }
           if (!(E & 240)) {
-            for (p = y, $ = E, S = C; k = t.distcode[S + ((s & (1 << p + $) - 1) >> p)], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(p + y <= f); ) {
-              if (l === 0)
+            for (p = y, $ = E, S = C; k = t.distcode[S + ((l & (1 << p + $) - 1) >> p)], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(p + y <= f); ) {
+              if (s === 0)
                 break e;
-              l--, s += i[a++] << f, f += 8;
+              s--, l += i[a++] << f, f += 8;
             }
-            s >>>= p, f -= p, t.back += p;
+            l >>>= p, f -= p, t.back += p;
           }
-          if (s >>>= y, f -= y, t.back += y, E & 64) {
+          if (l >>>= y, f -= y, t.back += y, E & 64) {
             e.msg = "invalid distance code", t.mode = O;
             break;
           }
@@ -2358,11 +2358,11 @@ const so = (e) => {
         case zn:
           if (t.extra) {
             for (I = t.extra; f < I; ) {
-              if (l === 0)
+              if (s === 0)
                 break e;
-              l--, s += i[a++] << f, f += 8;
+              s--, l += i[a++] << f, f += 8;
             }
-            t.offset += s & (1 << t.extra) - 1, s >>>= t.extra, f -= t.extra, t.back += t.extra;
+            t.offset += l & (1 << t.extra) - 1, l >>>= t.extra, f -= t.extra, t.back += t.extra;
           }
           if (t.offset > t.dmax) {
             e.msg = "invalid distance too far back", t.mode = O;
@@ -2394,30 +2394,30 @@ const so = (e) => {
         case yt:
           if (t.wrap) {
             for (; f < 32; ) {
-              if (l === 0)
+              if (s === 0)
                 break e;
-              l--, s |= i[a++] << f, f += 8;
+              s--, l |= 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 : Vn(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 ? l : Vn(l)) !== t.check) {
               e.msg = "incorrect data check", t.mode = O;
               break;
             }
-            s = 0, f = 0;
+            l = 0, f = 0;
           }
           t.mode = Un;
         case Un:
           if (t.wrap && t.flags) {
             for (; f < 32; ) {
-              if (l === 0)
+              if (s === 0)
                 break e;
-              l--, s += i[a++] << f, f += 8;
+              s--, l += i[a++] << f, f += 8;
             }
-            if (t.wrap & 4 && s !== (t.total & 4294967295)) {
+            if (t.wrap & 4 && l !== (t.total & 4294967295)) {
               e.msg = "incorrect length check", t.mode = O;
               break;
             }
-            s = 0, f = 0;
+            l = 0, f = 0;
           }
           t.mode = Dn;
         case Dn:
@@ -2432,7 +2432,7 @@ const so = (e) => {
         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 < 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);*/
+  return e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = s, t.hold = l, 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))
@@ -2494,7 +2494,7 @@ function He(e) {
 }
 He.prototype.push = function(e, n) {
   const t = this.strm, i = this.options.chunkSize, r = this.options.dictionary;
-  let a, o, l;
+  let a, o, s;
   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; ; ) {
@@ -2507,13 +2507,13 @@ He.prototype.push = function(e, n) {
       case Io:
         return this.onEnd(a), this.ended = !0, !1;
     }
-    if (l = t.avail_out, t.next_out && (t.avail_out === 0 || a === $t))
+    if (s = 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);
+        let u = Ve.utf8border(t.output, t.next_out), l = t.next_out - u, f = Ve.buf2string(t.output, u);
+        t.next_out = l, t.avail_out = i - l, l && t.output.set(t.output.subarray(u, u + l), 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 === Le && s === 0)) {
       if (a === $t)
         return a = X.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, !0;
       if (t.avail_in === 0)
@@ -2621,24 +2621,24 @@ 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 Gn({
       cache: new Yn({ maxSize: 1e3 }),
-      fill: async (u, s) => {
+      fill: async (u, l) => {
         const f = Number(u.length), d = Number(u.offset), { buffer: c } = await this.bbi.read(Q.Buffer.alloc(f), 0, f, d, {
-          signal: s
+          signal: l
         });
         return c;
       }
     }), !(i >= 0))
       throw new Error("invalid cirTreeOffset!");
-    const l = Ho(r);
-    this.leafParser = l.leafParser, this.bigBedParser = l.bigBedParser;
+    const s = Ho(r);
+    this.leafParser = s.leafParser, this.bigBedParser = s.bigBedParser;
   }
   async readWigData(n, t, i, r, a) {
     try {
-      const { refsByName: o, bbi: l, cirTreeOffset: u, isBigEndian: s } = this, f = o[n];
+      const { refsByName: o, bbi: s, cirTreeOffset: u, isBigEndian: l } = this, f = o[n];
       f === void 0 && r.complete();
       const d = { chrId: f, start: t, end: i };
-      this.cirTreePromise || (this.cirTreePromise = l.read(Q.Buffer.alloc(48), 0, 48, Number(u), a));
-      const { buffer: c } = await this.cirTreePromise, h = s ? c.readUInt32BE(4) : c.readUInt32LE(4);
+      this.cirTreePromise || (this.cirTreePromise = s.read(Q.Buffer.alloc(48), 0, 48, Number(u), a));
+      const { buffer: c } = await this.cirTreePromise, h = l ? c.readUInt32BE(4) : c.readUInt32LE(4);
       let _ = [], g = 0;
       const k = (p, $, S) => {
         try {
@@ -2688,11 +2688,11 @@ class Ti {
     let a = t;
     const o = new DataView(n.buffer, n.byteOffset, n.length);
     for (; a < n.byteLength; ) {
-      const l = o.getUint32(a, !0);
+      const s = o.getUint32(a, !0);
       a += 4;
       const u = o.getUint32(a, !0);
       a += 4;
-      const s = o.getUint32(a, !0);
+      const l = o.getUint32(a, !0);
       a += 4;
       const f = o.getUint32(a, !0);
       a += 4;
@@ -2701,9 +2701,9 @@ class Ti {
       const c = o.getFloat32(a, !0);
       a += 4;
       const h = o.getFloat32(a, !0);
-      a += 4, a += 4, (!i || l === i.chrId && Ct(u, s, i.start, i.end)) && r.push({
+      a += 4, a += 4, (!i || s === i.chrId && Ct(u, l, i.start, i.end)) && r.push({
         start: u,
-        end: s,
+        end: l,
         maxScore: c,
         minScore: d,
         summary: !0,
@@ -2716,20 +2716,20 @@ class Ti {
     const a = [];
     let o = t;
     for (; o < n.byteLength; ) {
-      const l = this.bigBedParser.parse(n.subarray(o));
-      a.push({ ...l, uniqueId: `bb-${i + o}` }), o += l.offset;
+      const s = this.bigBedParser.parse(n.subarray(o));
+      s.uniqueId = `bb-${i + o}`, a.push(s), o += s.offset;
     }
-    return r ? a.filter((l) => Ct(l.start, l.end, r.start, r.end)) : a;
+    return r ? a.filter((s) => Ct(s.start, s.end, r.start, r.end)) : a;
   }
   parseBigWigBlock(n, t, i) {
     const r = n.subarray(t), a = new DataView(r.buffer, r.byteOffset, r.length);
     let o = 0;
     o += 4;
-    const l = a.getInt32(o, !0);
+    const s = a.getInt32(o, !0);
     o += 8;
     const u = a.getUint32(o, !0);
     o += 4;
-    const s = a.getUint32(o, !0);
+    const l = a.getUint32(o, !0);
     o += 4;
     const f = a.getUint8(o);
     o += 2;
@@ -2753,7 +2753,7 @@ class Ti {
           const _ = a.getInt32(o, !0);
           o += 4;
           const g = a.getFloat32(o, !0);
-          o += 4, c[h] = { score: g, start: _, end: _ + s };
+          o += 4, c[h] = { score: g, start: _, end: _ + l };
         }
         break;
       }
@@ -2761,8 +2761,8 @@ class Ti {
         for (let h = 0; h < d; h++) {
           const _ = a.getFloat32(o, !0);
           o += 4;
-          const g = l + h * u;
-          c[h] = { score: _, start: g, end: g + s };
+          const g = s + h * u;
+          c[h] = { score: _, start: g, end: g + l };
         }
         break;
       }
@@ -2771,24 +2771,24 @@ class Ti {
   }
   async readFeatures(n, t, i = {}) {
     try {
-      const { blockType: r, isCompressed: a } = this, { signal: o, request: l } = i, u = Po(t);
-      et(o), await Promise.all(u.map(async (s) => {
+      const { blockType: r, isCompressed: a } = this, { signal: o, request: s } = i, u = Po(t);
+      et(o), await Promise.all(u.map(async (l) => {
         et(o);
-        const { length: f, offset: d } = s, c = await this.featureCache.get(`${f}_${d}`, s, o);
-        for (const h of s.blocks) {
+        const { length: f, offset: d } = l, c = await this.featureCache.get(`${f}_${d}`, l, o);
+        for (const h of l.blocks) {
           et(o);
-          let _ = Number(h.offset) - Number(s.offset), g = c;
+          let _ = Number(h.offset) - Number(l.offset), g = c;
           switch (a && (g = Lo(c.subarray(_)), _ = 0), et(o), r) {
             case "summary": {
-              n.next(this.parseSummaryBlock(g, _, l));
+              n.next(this.parseSummaryBlock(g, _, s));
               break;
             }
             case "bigwig": {
-              n.next(this.parseBigWigBlock(g, _, l));
+              n.next(this.parseBigWigBlock(g, _, s));
               break;
             }
             case "bigbed": {
-              n.next(this.parseBigBedBlock(g, _, Number(h.offset) * 256, l));
+              n.next(this.parseBigBedBlock(g, _, Number(h.offset) * 256, s));
               break;
             }
             default:
@@ -2825,24 +2825,24 @@ function jo(e, n, t, i) {
     });
   }
   return new (t || (t = Promise))(function(a, o) {
-    function l(f) {
+    function s(f) {
       try {
-        s(i.next(f));
+        l(i.next(f));
       } catch (d) {
         o(d);
       }
     }
     function u(f) {
       try {
-        s(i.throw(f));
+        l(i.throw(f));
       } catch (d) {
         o(d);
       }
     }
-    function s(f) {
-      f.done ? a(f.value) : r(f.value).then(l, u);
+    function l(f) {
+      f.done ? a(f.value) : r(f.value).then(s, u);
     }
-    s((i = i.apply(e, n || [])).next());
+    l((i = i.apply(e, n || [])).next());
   });
 }
 function Ai(e, n) {
@@ -2851,63 +2851,63 @@ function Ai(e, n) {
       throw a[1];
     return a[1];
   }, trys: [], ops: [] }, i, r, a, o;
-  return o = { next: l(0), throw: l(1), return: l(2) }, typeof Symbol == "function" && (o[Symbol.iterator] = function() {
+  return o = { next: s(0), throw: s(1), return: s(2) }, typeof Symbol == "function" && (o[Symbol.iterator] = function() {
     return this;
   }), o;
-  function l(s) {
+  function s(l) {
     return function(f) {
-      return u([s, f]);
+      return u([l, f]);
     };
   }
-  function u(s) {
+  function u(l) {
     if (i)
       throw new TypeError("Generator is already executing.");
-    for (; o && (o = 0, s[0] && (t = 0)), t; )
+    for (; o && (o = 0, l[0] && (t = 0)), t; )
       try {
-        if (i = 1, r && (a = s[0] & 2 ? r.return : s[0] ? r.throw || ((a = r.return) && a.call(r), 0) : r.next) && !(a = a.call(r, s[1])).done)
+        if (i = 1, r && (a = l[0] & 2 ? r.return : l[0] ? r.throw || ((a = r.return) && a.call(r), 0) : r.next) && !(a = a.call(r, l[1])).done)
           return a;
-        switch (r = 0, a && (s = [s[0] & 2, a.value]), s[0]) {
+        switch (r = 0, a && (l = [l[0] & 2, a.value]), l[0]) {
           case 0:
           case 1:
-            a = s;
+            a = l;
             break;
           case 4:
-            return t.label++, { value: s[1], done: !1 };
+            return t.label++, { value: l[1], done: !1 };
           case 5:
-            t.label++, r = s[1], s = [0];
+            t.label++, r = l[1], l = [0];
             continue;
           case 7:
-            s = t.ops.pop(), t.trys.pop();
+            l = t.ops.pop(), t.trys.pop();
             continue;
           default:
-            if (a = t.trys, !(a = a.length > 0 && a[a.length - 1]) && (s[0] === 6 || s[0] === 2)) {
+            if (a = t.trys, !(a = a.length > 0 && a[a.length - 1]) && (l[0] === 6 || l[0] === 2)) {
               t = 0;
               continue;
             }
-            if (s[0] === 3 && (!a || s[1] > a[0] && s[1] < a[3])) {
-              t.label = s[1];
+            if (l[0] === 3 && (!a || l[1] > a[0] && l[1] < a[3])) {
+              t.label = l[1];
               break;
             }
-            if (s[0] === 6 && t.label < a[1]) {
-              t.label = a[1], a = s;
+            if (l[0] === 6 && t.label < a[1]) {
+              t.label = a[1], a = l;
               break;
             }
             if (a && t.label < a[2]) {
-              t.label = a[2], t.ops.push(s);
+              t.label = a[2], t.ops.push(l);
               break;
             }
             a[2] && t.ops.pop(), t.trys.pop();
             continue;
         }
-        s = n.call(e, t);
+        l = n.call(e, t);
       } catch (f) {
-        s = [6, f], r = 0;
+        l = [6, f], r = 0;
       } finally {
         i = a = 0;
       }
-    if (s[0] & 5)
-      throw s[1];
-    return { value: s[0] ? s[1] : void 0, done: !0 };
+    if (l[0] & 5)
+      throw l[1];
+    return { value: l[0] ? l[1] : void 0, done: !0 };
   }
 }
 function Fe(e) {
@@ -2930,8 +2930,8 @@ function Ft(e, n) {
   try {
     for (; (n === void 0 || n-- > 0) && !(r = i.next()).done; )
       a.push(r.value);
-  } catch (l) {
-    o = { error: l };
+  } catch (s) {
+    o = { error: s };
   } finally {
     try {
       r && !r.done && (t = i.return) && t.call(i);
@@ -2961,11 +2961,11 @@ function Go(e, n, t) {
   function o(c) {
     i[c] && (r[c] = function(h) {
       return new Promise(function(_, g) {
-        a.push([c, h, _, g]) > 1 || l(c, h);
+        a.push([c, h, _, g]) > 1 || s(c, h);
       });
     });
   }
-  function l(c, h) {
+  function s(c, h) {
     try {
       u(i[c](h));
     } catch (_) {
@@ -2973,16 +2973,16 @@ function Go(e, n, t) {
     }
   }
   function u(c) {
-    c.value instanceof be ? Promise.resolve(c.value.v).then(s, f) : d(a[0][2], c);
+    c.value instanceof be ? Promise.resolve(c.value.v).then(l, f) : d(a[0][2], c);
   }
-  function s(c) {
-    l("next", c);
+  function l(c) {
+    s("next", c);
   }
   function f(c) {
-    l("throw", c);
+    s("throw", c);
   }
   function d(c, h) {
-    c(h), a.shift(), a.length && l(a[0][0], a[0][1]);
+    c(h), a.shift(), a.length && s(a[0][0], a[0][1]);
   }
 }
 function Yo(e) {
@@ -2994,14 +2994,14 @@ function Yo(e) {
   }, t);
   function i(a) {
     t[a] = e[a] && function(o) {
-      return new Promise(function(l, u) {
-        o = e[a](o), r(l, u, o.done, o.value);
+      return new Promise(function(s, u) {
+        o = e[a](o), r(s, u, o.done, o.value);
       });
     };
   }
-  function r(a, o, l, u) {
-    Promise.resolve(u).then(function(s) {
-      a({ value: s, done: l });
+  function r(a, o, s, u) {
+    Promise.resolve(u).then(function(l) {
+      a({ value: l, done: s });
     }, o);
   }
 }
@@ -3041,15 +3041,15 @@ var Wt = function() {
       if (o)
         if (this._parentage = null, Array.isArray(o))
           try {
-            for (var l = Fe(o), u = l.next(); !u.done; u = l.next()) {
-              var s = u.value;
-              s.remove(this);
+            for (var s = Fe(o), u = s.next(); !u.done; u = s.next()) {
+              var l = u.value;
+              l.remove(this);
             }
           } catch (g) {
             n = { error: g };
           } finally {
             try {
-              u && !u.done && (t = l.return) && t.call(l);
+              u && !u.done && (t = s.return) && t.call(s);
             } finally {
               if (n)
                 throw n.error;
@@ -3232,13 +3232,13 @@ var Xo = function() {
         complete: r ?? void 0
       };
     else {
-      var l;
-      a && Ri.useDeprecatedNextContext ? (l = Object.create(t), l.unsubscribe = function() {
+      var s;
+      a && Ri.useDeprecatedNextContext ? (s = Object.create(t), s.unsubscribe = function() {
         return a.unsubscribe();
       }, o = {
-        next: t.next && Nt(t.next, l),
-        error: t.error && Nt(t.error, l),
-        complete: t.complete && Nt(t.complete, l)
+        next: t.next && Nt(t.next, s),
+        error: t.error && Nt(t.error, s),
+        complete: t.complete && Nt(t.complete, s)
       }) : o = t;
     }
     return a.destination = new Xo(o), a;
@@ -3279,8 +3279,8 @@ var Z = function() {
   }, e.prototype.subscribe = function(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));
+      var o = r, s = o.operator, u = o.source;
+      a.add(s ? s.call(a, u) : u ? r._subscribe(a) : r._trySubscribe(a));
     }), a;
   }, e.prototype._trySubscribe = function(n) {
     try {
@@ -3292,9 +3292,9 @@ var Z = function() {
     var i = this;
     return t = Mn(t), new t(function(r, a) {
       var o = new ot({
-        next: function(l) {
+        next: function(s) {
           try {
-            n(l);
+            n(s);
           } catch (u) {
             a(u), o.unsubscribe();
           }
@@ -3360,17 +3360,17 @@ function Pe(e, n, t, i, r) {
 }
 var is = function(e) {
   Kt(n, e);
-  function n(t, i, r, a, o, l) {
+  function n(t, i, r, a, o, s) {
     var u = e.call(this, t) || this;
-    return u.onFinalize = o, u.shouldUnsubscribe = l, u._next = i ? function(s) {
+    return u.onFinalize = o, u.shouldUnsubscribe = s, u._next = i ? function(l) {
       try {
-        i(s);
+        i(l);
       } catch (f) {
         t.error(f);
       }
-    } : e.prototype._next, u._error = a ? function(s) {
+    } : e.prototype._next, u._error = a ? function(l) {
       try {
-        a(s);
+        a(l);
       } catch (f) {
         t.error(f);
       } finally {
@@ -3379,8 +3379,8 @@ var is = function(e) {
     } : e.prototype._error, u._complete = r ? function() {
       try {
         r();
-      } catch (s) {
-        t.error(s);
+      } catch (l) {
+        t.error(l);
       } finally {
         this.unsubscribe();
       }
@@ -3516,8 +3516,8 @@ function cs(e) {
         if (n.next(o), n.closed)
           return;
       }
-    } catch (l) {
-      t = { error: l };
+    } catch (s) {
+      t = { error: s };
     } finally {
       try {
         a && !a.done && (i = r.return) && i.call(r);
@@ -3542,7 +3542,7 @@ function ds(e) {
 function ps(e, n) {
   var t, i, r, a;
   return jo(this, void 0, void 0, function() {
-    var o, l;
+    var o, s;
     return Ai(this, function(u) {
       switch (u.label) {
         case 0:
@@ -3560,7 +3560,7 @@ function ps(e, n) {
         case 4:
           return [3, 11];
         case 5:
-          return l = u.sent(), r = { error: l }, [3, 11];
+          return s = u.sent(), r = { error: s }, [3, 11];
         case 6:
           return u.trys.push([6, , 9, 10]), i && !i.done && (a = t.return) ? [4, a.call(t)] : [3, 8];
         case 7:
@@ -3633,8 +3633,8 @@ function ws(e, n) {
         var r, a, o;
         try {
           r = i.next(), a = r.value, o = r.done;
-        } catch (l) {
-          t.error(l);
+        } catch (s) {
+          t.error(s);
           return;
         }
         o ? t.complete() : t.next(a);
@@ -3709,13 +3709,13 @@ function Ji(e, n) {
     }));
   });
 }
-function $s(e, n, t, i, r, a, o, l) {
-  var u = [], s = 0, f = 0, d = !1, c = function() {
-    d && !u.length && !s && n.complete();
+function $s(e, n, t, i, r, a, o, s) {
+  var u = [], l = 0, f = 0, d = !1, c = function() {
+    d && !u.length && !l && n.complete();
   }, h = function(g) {
-    return s < i ? _(g) : u.push(g);
+    return l < i ? _(g) : u.push(g);
   }, _ = function(g) {
-    a && n.next(g), s++;
+    a && n.next(g), l++;
     var k = !1;
     Ee(t(g, f++)).subscribe(Pe(n, function(y) {
       r == null || r(y), a ? h(y) : n.next(y);
@@ -3724,13 +3724,13 @@ function $s(e, n, t, i, r, a, o, l) {
     }, void 0, function() {
       if (k)
         try {
-          s--;
+          l--;
           for (var y = function() {
             var E = u.shift();
             o ? re(n, o, function() {
               return _(E);
             }) : _(E);
-          }; u.length && s < i; )
+          }; u.length && l < i; )
             y();
           c();
         } catch (E) {
@@ -3741,7 +3741,7 @@ function $s(e, n, t, i, r, a, o, l) {
   return e.subscribe(Pe(n, h, function() {
     d = !0, c();
   })), function() {
-    l == null || l();
+    s == null || s();
   };
 }
 function Qi(e, n, t) {
@@ -3764,12 +3764,12 @@ function Cs() {
 }
 function Ss(e, n, t, i, r) {
   return function(a, o) {
-    var l = t, u = n, s = 0;
+    var s = t, u = n, l = 0;
     a.subscribe(Pe(o, function(f) {
-      var d = s++;
-      u = l ? e(u, f, d) : (l = !0, f), i && o.next(u);
+      var d = l++;
+      u = s ? e(u, f, d) : (s = !0, f), i && o.next(u);
     }, r && function() {
-      l && o.next(u), o.complete();
+      s && o.next(u), o.complete();
     }));
   };
 }
@@ -3812,9 +3812,13 @@ class tr {
   }
   /*
    * @param filehandle - a filehandle from generic-filehandle or implementing something similar to the node10 fs.promises API
+   *
    * @param path - a Local file path as a string
+   *
    * @param url - a URL string
-   * @param renameRefSeqs - an optional method to rename the internal reference sequences using a mapping function
+   *
+   * @param renameRefSeqs - an optional method to rename the internal reference
+   * sequences using a mapping function
    */
   constructor(n) {
     const { filehandle: t, renameRefSeqs: i = (o) => o, path: r, url: a } = n;
@@ -3832,14 +3836,14 @@ 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 = 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)
+    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: s, asOffset: u, totalSummaryOffset: l } = o;
+    if (o.fileType = s === It ? "bigbed" : "bigwig", u > t || l > t)
       return this._getMainHeader(n, t * 2);
     if (u) {
       const f = Number(o.asOffset);
       o.autoSql = Ts(i.subarray(f, i.indexOf(0, f)));
     }
-    if (o.totalSummaryOffset > t)
+    if (o.totalSummaryOffset > t - 8 * 5)
       return this._getMainHeader(n, t * 2);
     if (o.totalSummaryOffset) {
       const f = i.subarray(Number(o.totalSummaryOffset)), d = a.totalSummaryParser.parse(f);
@@ -3858,11 +3862,11 @@ class tr {
   // todo: add progress if long running
   async _readChromTree(n, t) {
     const i = n.isBigEndian, r = i ? "big" : "little", a = [], o = {};
-    let l = Number(n.unzoomedDataOffset);
+    let s = Number(n.unzoomedDataOffset);
     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 = 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) => {
+    for (; s % 4 !== 0; )
+      s += 1;
+    const l = s - u, { buffer: f } = await this.bbi.read(Q.Buffer.alloc(l), 0, l, 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");
@@ -3908,9 +3912,9 @@ class tr {
     await this.getHeader(r);
     const a = this.renameRefSeqs(n);
     let o;
-    const { basesPerSpan: l, scale: u } = r || {};
-    return l ? o = await this.getView(1 / l, r) : u ? o = await this.getView(u, r) : o = await this.getView(1, r), new Z((s) => {
-      o.readWigData(a, t, i, s, r);
+    const { basesPerSpan: s, scale: u } = r || {};
+    return s ? o = await this.getView(1 / s, r) : u ? o = await this.getView(u, r) : o = await this.getView(1, r), new Z((l) => {
+      o.readWigData(a, t, i, l, r);
     });
   }
   async getFeatures(n, t, i, r) {
@@ -3926,14 +3930,14 @@ class Fs extends tr {
    * @param opts - An object containing basesPerSpan (e.g. pixels per basepair) or scale used to infer the zoomLevel to use
    */
   async getView(n, t) {
-    const { zoomLevels: i, refsByName: r, fileSize: a, isBigEndian: o, uncompressBufSize: l } = await this.getHeader(t), u = 1 / n;
-    let s = i.length;
-    a || (s -= 1);
-    for (let f = s; f >= 0; f -= 1) {
+    const { zoomLevels: i, refsByName: r, fileSize: a, isBigEndian: o, uncompressBufSize: s } = await this.getHeader(t), u = 1 / n;
+    let l = i.length;
+    a || (l -= 1);
+    for (let f = l; f >= 0; f -= 1) {
       const d = i[f];
       if (d && d.reductionLevel <= 2 * u) {
         const c = Number(d.indexOffset);
-        return new Ti(this.bbi, r, c, o, l > 0, "summary");
+        return new Ti(this.bbi, r, c, o, s > 0, "summary");
       }
     }
     return this.getUnzoomedView(t);
@@ -3965,12 +3969,12 @@ class Ps extends tr {
    * @return a Promise for an array of Index data structure since there can be multiple extraIndexes in a bigbed, see bedToBigBed documentation
    */
   async _readIndices(n) {
-    const { extHeaderOffset: t, isBigEndian: i } = await this.getHeader(n), { buffer: r } = await this.bbi.read(Q.Buffer.alloc(64), 0, 64, Number(t)), a = i ? "big" : "little", o = new N().endianess(a).uint16("size").uint16("count").uint64("offset").parse(r), { count: l, offset: u } = o;
-    if (l === 0)
+    const { extHeaderOffset: t, isBigEndian: i } = await this.getHeader(n), { buffer: r } = await this.bbi.read(Q.Buffer.alloc(64), 0, 64, Number(t)), a = i ? "big" : "little", o = new N().endianess(a).uint16("size").uint16("count").uint64("offset").parse(r), { count: s, offset: u } = o;
+    if (s === 0)
       return [];
-    const s = 20, f = s * l, { buffer: d } = await this.bbi.read(Q.Buffer.alloc(f), 0, f, Number(u)), c = new N().endianess(a).int16("type").int16("fieldcount").uint64("offset").skip(4).int16("field"), h = [];
-    for (let _ = 0; _ < l; _ += 1)
-      h.push(c.parse(d.subarray(_ * s)));
+    const l = 20, f = l * s, { buffer: d } = await this.bbi.read(Q.Buffer.alloc(f), 0, f, Number(u)), c = new N().endianess(a).int16("type").int16("fieldcount").uint64("offset").skip(4).int16("field"), h = [];
+    for (let _ = 0; _ < s; _ += 1)
+      h.push(c.parse(d.subarray(_ * l)));
     return h;
   }
   /*
@@ -3986,7 +3990,7 @@ class Ps extends tr {
     if (r.length === 0)
       return [];
     const a = r.map(async (o) => {
-      const { offset: l, field: u } = o, { buffer: s } = await this.bbi.read(Q.Buffer.alloc(32), 0, 32, Number(l), t), f = i ? "big" : "little", d = new N().endianess(f).int32("magic").int32("blockSize").int32("keySize").int32("valSize").uint64("itemCount"), { blockSize: c, keySize: h, valSize: _ } = d.parse(s), g = new N().endianess(f).int8("nodeType").skip(1).int16("cnt").choice({
+      const { offset: s, field: u } = o, { buffer: l } = await this.bbi.read(Q.Buffer.alloc(32), 0, 32, Number(s), t), f = i ? "big" : "little", d = new N().endianess(f).int32("magic").int32("blockSize").int32("keySize").int32("valSize").uint64("itemCount"), { blockSize: c, keySize: h, valSize: _ } = d.parse(l), g = new N().endianess(f).int8("nodeType").skip(1).int16("cnt").choice({
         tag: "nodeType",
         choices: {
           0: new N().array("leafkeys", {
@@ -4014,7 +4018,7 @@ class Ps extends tr {
           if (S.keys[b].key === n)
             return { ...S.keys[b], field: u };
       }, y = 32;
-      return k(Number(l) + y);
+      return k(Number(s) + y);
     });
     return As(await Promise.all(a));
   }
@@ -4030,16 +4034,16 @@ class Ps extends tr {
     const i = await this.searchExtraIndexBlocks(n, t);
     if (i.length === 0)
       return [];
-    const r = await this.getUnzoomedView(t), a = i.map((l) => new Z((u) => {
-      r.readFeatures(u, [l], t);
-    }).pipe(er((u, s) => u.concat(s)), Ji((u) => {
-      for (const s of u)
-        s.field = l.field;
+    const r = await this.getUnzoomedView(t), a = i.map((s) => new Z((u) => {
+      r.readFeatures(u, [s], t);
+    }).pipe(er((u, l) => u.concat(l)), Ji((u) => {
+      for (const l of u)
+        l.field = s.field;
       return u;
     })));
-    return (await qi(Cs(...a))).filter((l) => {
+    return (await qi(Cs(...a))).filter((s) => {
       var u;
-      return ((u = l.rest) === null || u === void 0 ? void 0 : u.split("	")[(l.field || 0) - 3]) === n;
+      return ((u = s.rest) === null || u === void 0 ? void 0 : u.split("	")[(s.field || 0) - 3]) === n;
     });
   }
 }