@genome-spy/app 0.56.1 → 0.57.0

package/dist/{index-COovE1Oo.js → index-Dpv0n-cZ.js}

@@ -1,7 +1,7 @@
-import { b as J } from "./index-B6haPltu.js";
-import { _ as Gn, L as Yn } from "./index-BhtH2nrr.js";
+import { b as J } from "./index-DluFz_0j.js";
+import { A as Gn, L as Yn } from "./index-C159nEYc.js";
 import { L as nr } from "./__vite-browser-external-C--ziKoh.js";
-import { R as ir } from "./remoteFile-DuIsnepi.js";
+import { R as ir } from "./remoteFile-DwSeXAZ0.js";
 const st = BigInt(32);
 function rr(e, n, t) {
   const i = +!!t, a = +!t;
@@ -152,12 +152,12 @@ const x = /* @__PURE__ */ new Map(), re = "___parser_", M = {
   doublele: !0,
   doublebe: !1
 };
-class N {
+class S {
   constructor() {
     this.varName = "", this.type = "", this.options = {}, this.endian = "be", this.useContextVariables = !1;
   }
   static start() {
-    return new N();
+    return new S();
   }
   primitiveGenerateN(n, t) {
     const i = Ye[n], a = Ke[n];
@@ -404,9 +404,9 @@ class N {
   nest(n, t) {
     if (typeof t != "object" && typeof n == "object" && (t = n, n = ""), !t || !t.type)
       throw new Error("type is required for nest.");
-    if (!(t.type instanceof N) && !x.has(t.type))
+    if (!(t.type instanceof S) && !x.has(t.type))
       throw new Error("type must be a known parser name or a Parser object.");
-    if (!(t.type instanceof N) && !n)
+    if (!(t.type instanceof S) && !n)
       throw new Error("type must be a Parser object if the variable name is omitted.");
     return this.setNextParser("nest", n, t);
   }
@@ -480,7 +480,7 @@ class N {
       n = this.options.length;
     else if (this.type === "array" && typeof this.options.length == "number") {
       let t = NaN;
-      typeof this.options.type == "string" ? t = M[this.options.type] : this.options.type instanceof N && (t = this.options.type.sizeOf()), n = this.options.length * t;
+      typeof this.options.type == "string" ? t = M[this.options.type] : this.options.type instanceof S && (t = this.options.type.sizeOf()), n = this.options.length * t;
     } else this.type === "seek" ? n = this.options.length : this.type === "nest" ? n = this.options.type.sizeOf() : this.type || (n = 0);
     return this.next && (n += this.next.sizeOf()), n;
   }
@@ -489,7 +489,7 @@ class N {
     return this.compiled || this.compile(), this.compiled(n, this.constructorFn);
   }
   setNextParser(n, t, i) {
-    const a = new N();
+    const a = new S();
     return a.type = n, a.varName = t, a.options = i, a.endian = this.endian, this.head ? this.head.next = a : this.next = a, this.head = a, this;
   }
   // Call code generator for this parser
@@ -584,29 +584,29 @@ class N {
       const i = n.generateTmpVariable();
       n.pushCode(`var ${i} = 0;`);
       const a = (f = 0) => {
-        let p = 0;
+        let _ = 0;
         for (let c = f; c < n.bitFields.length; c++) {
           const h = n.bitFields[c].options.length;
-          if (p + h > 32)
+          if (_ + h > 32)
             break;
-          p += h;
+          _ += h;
         }
-        return p;
+        return _;
       }, r = (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;
-      n.bitFields.forEach((f, p) => {
+      n.bitFields.forEach((f, _) => {
         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;
           }
-          o = 0, s = u = r(a(p) - s);
+          o = 0, s = u = r(a(_) - s);
         }
-        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 = l ? u - o - c : o, d = -1 >>> 32 - c;
+        n.pushCode(`${f.varName} ${c < f.options.length ? "|=" : "="} ${i} >> ${h} & 0x${d.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;
       }), n.bitFields = [];
     }
   }
@@ -648,22 +648,22 @@ class N {
       if (x.get(a)) {
         const f = n.generateTmpVariable();
         if (n.pushCode(`var ${f} = ${re + a}(offset, {`), n.useContextVariables) {
-          const p = n.generateVariable();
-          n.pushCode(`$parent: ${p},`), n.pushCode(`$root: ${p}.$root,`), !this.options.readUntil && i === void 0 && n.pushCode(`$index: ${t} - ${r},`);
+          const _ = n.generateVariable();
+          n.pushCode(`$parent: ${_},`), n.pushCode(`$root: ${_}.$root,`), !this.options.readUntil && i === void 0 && n.pushCode(`$index: ${t} - ${r},`);
         }
         n.pushCode("});"), n.pushCode(`var ${l} = ${f}.result; offset = ${f}.offset;`), a !== this.alias && n.addReference(a);
       } else {
-        const f = Ye[a], p = Ke[a];
-        n.pushCode(`var ${l} = dataView.get${f}(offset, ${p});`), n.pushCode(`offset += ${M[a]};`);
+        const f = Ye[a], _ = Ke[a];
+        n.pushCode(`var ${l} = dataView.get${f}(offset, ${_});`), n.pushCode(`offset += ${M[a]};`);
       }
-    else if (a instanceof N) {
+    else if (a instanceof S) {
       n.pushCode(`var ${l} = {};`);
       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} - ${r};`)), a.generate(n), n.useContextVariables && (n.pushCode(`delete ${l}.$parent;`), n.pushCode(`delete ${l}.$root;`), n.pushCode(`delete ${l}.$index;`)), n.popScope();
     }
     if (s ? n.pushCode(`${o}[${l}.${u}] = ${l};`) : n.pushCode(`${o}.push(${l});`), n.pushCode("}"), typeof this.options.readUntil == "function") {
-      const f = this.options.readUntil, p = n.addImport(f);
-      n.pushCode(`while (!${p}.call(${n.generateVariable()}, ${l}, buffer.subarray(offset)));`);
+      const f = this.options.readUntil, _ = n.addImport(f);
+      n.pushCode(`while (!${_}.call(${n.generateVariable()}, ${l}, buffer.subarray(offset)));`);
     }
   }
   generateChoiceCase(n, t, i) {
@@ -676,7 +676,7 @@ class N {
         const r = Ye[i], o = Ke[i];
         n.pushCode(`${a} = dataView.get${r}(offset, ${o});`), n.pushCode(`offset += ${M[i]}`);
       }
-    } else i instanceof N && (n.pushPath(t), i.generate(n), n.popPath(t));
+    } else i instanceof S && (n.pushPath(t), i.generate(n), n.popPath(t));
   }
   generateChoice(n) {
     const t = n.generateOption(this.options.tag), i = n.generateVariable(this.varName);
@@ -693,7 +693,7 @@ class N {
   }
   generateNest(n) {
     const t = n.generateVariable(this.varName);
-    if (this.options.type instanceof N) {
+    if (this.options.type instanceof S) {
       if (this.varName && (n.pushCode(`${t} = {};`), n.useContextVariables)) {
         const i = n.generateVariable();
         n.pushCode(`${t}.$parent = ${i};`), n.pushCode(`${t}.$root = ${i}.$root;`);
@@ -713,8 +713,8 @@ class N {
     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 p = n.addImport(u);
-      n.pushCode(`if (${p}.call(${n.generateVariable()}, ${f}, buffer.subarray(offset))) break;`), n.pushCode("offset += 1;"), n.pushCode("}"), n.pushCode(`${i} = buffer.subarray(${s}, offset);`);
+      const _ = n.addImport(u);
+      n.pushCode(`if (${_}.call(${n.generateVariable()}, ${f}, buffer.subarray(offset))) break;`), n.pushCode("offset += 1;"), n.pushCode("}"), n.pushCode(`${i} = buffer.subarray(${s}, offset);`);
     } else if (this.options.readUntil === "eof")
       n.pushCode(`${i} = buffer.subarray(offset);`);
     else {
@@ -723,7 +723,7 @@ class N {
     }
     this.options.clone && n.pushCode(`${i} = buffer.constructor.from(${i});`);
     const a = n.generateTmpVariable(), r = n.generateTmpVariable(), o = n.generateTmpVariable(), l = n.addImport(this.options.wrapper);
-    if (n.pushCode(`${i} = ${l}.call(this, ${i}).subarray(0);`), n.pushCode(`var ${a} = buffer;`), n.pushCode(`var ${r} = 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)
+    if (n.pushCode(`${i} = ${l}.call(this, ${i}).subarray(0);`), n.pushCode(`var ${a} = buffer;`), n.pushCode(`var ${r} = 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 S)
       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();
@@ -739,7 +739,7 @@ class N {
   }
   generatePointer(n) {
     const t = this.options.type, i = n.generateOption(this.options.offset), a = n.generateTmpVariable(), r = n.generateVariable(this.varName);
-    if (n.pushCode(`var ${a} = offset;`), n.pushCode(`offset = ${i};`), this.options.type instanceof N) {
+    if (n.pushCode(`var ${a} = offset;`), n.pushCode(`offset = ${i};`), this.options.type instanceof S) {
       if (n.pushCode(`${r} = {};`), n.useContextVariables) {
         const o = n.generateVariable();
         n.pushCode(`${r}.$parent = ${o};`), n.pushCode(`${r}.$root = ${o}.$root;`);
@@ -791,10 +791,8 @@ class pe {
   union(n) {
     const t = [...this.getRanges(), ...n.getRanges()].sort((r, o) => r.min < o.min ? -1 : r.min > o.min ? 1 : r.max < o.max ? -1 : o.max > r.max ? 1 : 0), i = [];
     let a = t[0];
-    for (let r = 1; r < t.length; r += 1) {
-      const o = t[r];
-      o.min > a.max + 1 ? (i.push(a), a = o) : o.max > a.max && (a = new pe([{ min: a.min, max: o.max }]));
-    }
+    for (const r of t)
+      r.min > a.max + 1 ? (i.push(a), a = r) : r.max > a.max && (a = new pe([{ min: a.min, max: r.max }]));
     return i.push(a), i.length === 1 ? i[0] : new pe(i);
   }
 }
@@ -854,11 +852,11 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
   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, a = n.stat_desc.static_tree, r = 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, p, c, h, _, g = 0;
+  let s, f, _, c, h, d, g = 0;
   for (c = 0; c <= ae; 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), r && (e.static_len += _ * (a[f * 2 + 1] + h)));
+    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]), d = t[f * 2], e.opt_len += d * (c + h), r && (e.static_len += d * (a[f * 2 + 1] + h)));
   if (g !== 0) {
     do {
       for (c = u - 1; e.bl_count[c] === 0; )
@@ -867,7 +865,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; )
-        p = e.heap[--s], !(p > i) && (t[p * 2 + 1] !== c && (e.opt_len += (c - t[p * 2 + 1]) * t[p * 2], t[p * 2 + 1] = c), f--);
+        _ = e.heap[--s], !(_ > i) && (t[_ * 2 + 1] !== c && (e.opt_len += (c - t[_ * 2 + 1]) * t[_ * 2], t[_ * 2 + 1] = c), f--);
   }
 }, ai = (e, n, t) => {
   const i = new Array(ae + 1);
@@ -1161,11 +1159,11 @@ const V = (e) => {
   return a > i && (a = i), a === 0 ? 0 : (e.avail_in -= a, n.set(e.input.subarray(e.next_in, e.next_in + a), t), e.state.wrap === 1 ? e.adler = Ue(e.adler, n, a, t) : e.state.wrap === 2 && (e.adler = R(e.adler, n, a, t)), e.next_in += a, e.total_in += a, a);
 }, fi = (e, n) => {
   let t = e.max_chain_length, i = e.strstart, a, r, 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, p = e.prev, c = e.strstart + Q;
-  let h = s[i + o - 1], _ = s[i + o];
+  const u = e.strstart > e.w_size - Y ? e.strstart - (e.w_size - Y) : 0, s = e.window, f = e.w_mask, _ = e.prev, c = e.strstart + Q;
+  let h = s[i + o - 1], d = s[i + o];
   e.prev_length >= e.good_match && (t >>= 2), l > e.lookahead && (l = e.lookahead);
   do
-    if (a = n, !(s[a + o] !== _ || s[a + o - 1] !== h || s[a] !== s[i] || s[++a] !== s[i + 1])) {
+    if (a = n, !(s[a + o] !== d || s[a + o - 1] !== h || s[a] !== s[i] || s[++a] !== s[i + 1])) {
       i += 2, a++;
       do
         ;
@@ -1173,10 +1171,10 @@ const V = (e) => {
       if (r = Q - (c - i), i = c - Q, r > o) {
         if (e.match_start = n, o = r, r >= l)
           break;
-        h = s[i + o - 1], _ = s[i + o];
+        h = s[i + o - 1], d = s[i + o];
       }
     }
-  while ((n = p[n & f]) > u && --t !== 0);
+  while ((n = _[n & f]) > u && --t !== 0);
   return o <= e.lookahead ? o : e.lookahead;
 }, me = (e) => {
   const n = e.w_size;
@@ -1631,80 +1629,80 @@ Gt.prototype.onEnd = function(e) {
 };
 const Xe = 16209, Ma = 16191;
 var Ha = function(n, t) {
-  let i, a, r, o, l, u, s, f, p, c, h, _, g, k, v, E, C, d, $, S, b, w, m, y;
+  let i, a, r, o, l, u, s, f, _, c, h, d, g, k, y, E, C, p, $, N, b, m, w, v;
   const I = n.state;
-  i = n.next_in, m = n.input, a = i + (n.avail_in - 5), r = n.next_out, y = n.output, o = r - (t - n.avail_out), l = r + (n.avail_out - 257), u = I.dmax, s = I.wsize, f = I.whave, p = I.wnext, c = I.window, h = I.hold, _ = I.bits, g = I.lencode, k = I.distcode, v = (1 << I.lenbits) - 1, E = (1 << I.distbits) - 1;
+  i = n.next_in, w = n.input, a = i + (n.avail_in - 5), r = n.next_out, v = n.output, o = r - (t - n.avail_out), l = r + (n.avail_out - 257), u = I.dmax, s = I.wsize, f = I.whave, _ = I.wnext, c = I.window, h = I.hold, d = 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 & v];
+      d < 15 && (h += w[i++] << d, d += 8, h += w[i++] << d, d += 8), C = g[h & y];
       t:
         for (; ; ) {
-          if (d = C >>> 24, h >>>= d, _ -= d, d = C >>> 16 & 255, d === 0)
-            y[r++] = C & 65535;
-          else if (d & 16) {
-            $ = C & 65535, d &= 15, d && (_ < d && (h += m[i++] << _, _ += 8), $ += h & (1 << d) - 1, h >>>= d, _ -= d), _ < 15 && (h += m[i++] << _, _ += 8, h += m[i++] << _, _ += 8), C = k[h & E];
+          if (p = C >>> 24, h >>>= p, d -= p, p = C >>> 16 & 255, p === 0)
+            v[r++] = C & 65535;
+          else if (p & 16) {
+            $ = C & 65535, p &= 15, p && (d < p && (h += w[i++] << d, d += 8), $ += h & (1 << p) - 1, h >>>= p, d -= p), d < 15 && (h += w[i++] << d, d += 8, h += w[i++] << d, d += 8), C = k[h & E];
             n:
               for (; ; ) {
-                if (d = C >>> 24, h >>>= d, _ -= d, d = C >>> 16 & 255, d & 16) {
-                  if (S = C & 65535, d &= 15, _ < d && (h += m[i++] << _, _ += 8, _ < d && (h += m[i++] << _, _ += 8)), S += h & (1 << d) - 1, S > u) {
+                if (p = C >>> 24, h >>>= p, d -= p, p = C >>> 16 & 255, p & 16) {
+                  if (N = C & 65535, p &= 15, d < p && (h += w[i++] << d, d += 8, d < p && (h += w[i++] << d, d += 8)), N += h & (1 << p) - 1, N > u) {
                     n.msg = "invalid distance too far back", I.mode = Xe;
                     break e;
                   }
-                  if (h >>>= d, _ -= d, d = r - o, S > d) {
-                    if (d = S - d, d > f && I.sane) {
+                  if (h >>>= p, d -= p, p = r - o, N > p) {
+                    if (p = N - p, p > f && I.sane) {
                       n.msg = "invalid distance too far back", I.mode = Xe;
                       break e;
                     }
-                    if (b = 0, w = c, p === 0) {
-                      if (b += s - d, d < $) {
-                        $ -= d;
+                    if (b = 0, m = c, _ === 0) {
+                      if (b += s - p, p < $) {
+                        $ -= p;
                         do
-                          y[r++] = c[b++];
-                        while (--d);
-                        b = r - S, w = y;
+                          v[r++] = c[b++];
+                        while (--p);
+                        b = r - N, m = v;
                       }
-                    } else if (p < d) {
-                      if (b += s + p - d, d -= p, d < $) {
-                        $ -= d;
+                    } else if (_ < p) {
+                      if (b += s + _ - p, p -= _, p < $) {
+                        $ -= p;
                         do
-                          y[r++] = c[b++];
-                        while (--d);
-                        if (b = 0, p < $) {
-                          d = p, $ -= d;
+                          v[r++] = c[b++];
+                        while (--p);
+                        if (b = 0, _ < $) {
+                          p = _, $ -= p;
                           do
-                            y[r++] = c[b++];
-                          while (--d);
-                          b = r - S, w = y;
+                            v[r++] = c[b++];
+                          while (--p);
+                          b = r - N, m = v;
                         }
                       }
-                    } else if (b += p - d, d < $) {
-                      $ -= d;
+                    } else if (b += _ - p, p < $) {
+                      $ -= p;
                       do
-                        y[r++] = c[b++];
-                      while (--d);
-                      b = r - S, w = y;
+                        v[r++] = c[b++];
+                      while (--p);
+                      b = r - N, m = v;
                     }
                     for (; $ > 2; )
-                      y[r++] = w[b++], y[r++] = w[b++], y[r++] = w[b++], $ -= 3;
-                    $ && (y[r++] = w[b++], $ > 1 && (y[r++] = w[b++]));
+                      v[r++] = m[b++], v[r++] = m[b++], v[r++] = m[b++], $ -= 3;
+                    $ && (v[r++] = m[b++], $ > 1 && (v[r++] = m[b++]));
                   } else {
-                    b = r - S;
+                    b = r - N;
                     do
-                      y[r++] = y[b++], y[r++] = y[b++], y[r++] = y[b++], $ -= 3;
+                      v[r++] = v[b++], v[r++] = v[b++], v[r++] = v[b++], $ -= 3;
                     while ($ > 2);
-                    $ && (y[r++] = y[b++], $ > 1 && (y[r++] = y[b++]));
+                    $ && (v[r++] = v[b++], $ > 1 && (v[r++] = v[b++]));
                   }
-                } else if (d & 64) {
+                } else if (p & 64) {
                   n.msg = "invalid distance code", I.mode = Xe;
                   break e;
                 } else {
-                  C = k[(C & 65535) + (h & (1 << d) - 1)];
+                  C = k[(C & 65535) + (h & (1 << p) - 1)];
                   continue n;
                 }
                 break;
               }
-          } else if (d & 64)
-            if (d & 32) {
+          } else if (p & 64)
+            if (p & 32) {
               I.mode = Ma;
               break e;
             } else {
@@ -1712,13 +1710,13 @@ var Ha = function(n, t) {
               break e;
             }
           else {
-            C = g[(C & 65535) + (h & (1 << d) - 1)];
+            C = g[(C & 65535) + (h & (1 << p) - 1)];
             continue t;
           }
           break;
         }
     } while (i < a && r < l);
-  $ = _ >> 3, i -= $, _ -= $ << 3, h &= (1 << _) - 1, n.next_in = i, n.next_out = r, n.avail_in = i < a ? 5 + (a - i) : 5 - (i - a), n.avail_out = r < l ? 257 + (l - r) : 257 - (r - l), I.hold = h, I.bits = _;
+  $ = d >> 3, i -= $, d -= $ << 3, h &= (1 << d) - 1, n.next_in = i, n.next_out = r, n.avail_in = i < a ? 5 + (a - i) : 5 - (i - a), n.avail_out = r < l ? 257 + (l - r) : 257 - (r - l), I.hold = h, I.bits = d;
 };
 const de = 15, un = 852, hn = 592, cn = 0, gt = 1, dn = 2, ja = new Uint16Array([
   /* Length codes 257..285 base */
@@ -1856,48 +1854,48 @@ const de = 15, un = 852, hn = 592, cn = 0, gt = 1, dn = 2, ja = new Uint16Array(
   64
 ]), Wa = (e, n, t, i, a, r, o, l) => {
   const u = l.bits;
-  let s = 0, f = 0, p = 0, c = 0, h = 0, _ = 0, g = 0, k = 0, v = 0, E = 0, C, d, $, S, b, w = null, m;
-  const y = new Uint16Array(de + 1), I = new Uint16Array(de + 1);
+  let s = 0, f = 0, _ = 0, c = 0, h = 0, d = 0, g = 0, k = 0, y = 0, E = 0, C, p, $, N, b, m = null, w;
+  const v = new Uint16Array(de + 1), I = new Uint16Array(de + 1);
   let ie = null, Jt, je, Ge;
   for (s = 0; s <= de; s++)
-    y[s] = 0;
+    v[s] = 0;
   for (f = 0; f < i; f++)
-    y[n[t + f]]++;
-  for (h = u, c = de; c >= 1 && y[c] === 0; c--)
+    v[n[t + f]]++;
+  for (h = u, c = de; c >= 1 && v[c] === 0; c--)
     ;
   if (h > c && (h = c), c === 0)
     return a[r++] = 1 << 24 | 64 << 16 | 0, a[r++] = 1 << 24 | 64 << 16 | 0, l.bits = 1, 0;
-  for (p = 1; p < c && y[p] === 0; p++)
+  for (_ = 1; _ < c && v[_] === 0; _++)
     ;
-  for (h < p && (h = p), k = 1, s = 1; s <= de; s++)
-    if (k <<= 1, k -= y[s], k < 0)
+  for (h < _ && (h = _), k = 1, s = 1; s <= de; s++)
+    if (k <<= 1, k -= v[s], k < 0)
       return -1;
   if (k > 0 && (e === cn || c !== 1))
     return -1;
   for (I[1] = 0, s = 1; s < de; s++)
-    I[s + 1] = I[s] + y[s];
+    I[s + 1] = I[s] + v[s];
   for (f = 0; f < i; f++)
     n[t + f] !== 0 && (o[I[n[t + f]]++] = f);
-  if (e === cn ? (w = ie = o, m = 20) : e === gt ? (w = ja, ie = Ga, m = 257) : (w = Ya, ie = Ka, m = 0), E = 0, f = 0, s = p, b = r, _ = h, g = 0, $ = -1, v = 1 << h, S = v - 1, e === gt && v > un || e === dn && v > hn)
+  if (e === cn ? (m = ie = o, w = 20) : e === gt ? (m = ja, ie = Ga, w = 257) : (m = Ya, ie = Ka, w = 0), E = 0, f = 0, s = _, b = r, d = h, g = 0, $ = -1, y = 1 << h, N = 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 = ie[o[f] - m], Ge = w[o[f] - m]) : (je = 96, Ge = 0), C = 1 << s - g, d = 1 << _, p = d;
+    Jt = s - g, o[f] + 1 < w ? (je = 0, Ge = o[f]) : o[f] >= w ? (je = ie[o[f] - w], Ge = m[o[f] - w]) : (je = 96, Ge = 0), C = 1 << s - g, p = 1 << d, _ = p;
     do
-      d -= C, a[b + (E >> g) + d] = Jt << 24 | je << 16 | Ge | 0;
-    while (d !== 0);
+      p -= C, a[b + (E >> g) + p] = Jt << 24 | je << 16 | Ge | 0;
+    while (p !== 0);
     for (C = 1 << s - 1; E & C; )
       C >>= 1;
-    if (C !== 0 ? (E &= C - 1, E += C) : E = 0, f++, --y[s] === 0) {
+    if (C !== 0 ? (E &= C - 1, E += C) : E = 0, f++, --v[s] === 0) {
       if (s === c)
         break;
       s = n[t + o[f]];
     }
-    if (s > h && (E & S) !== $) {
-      for (g === 0 && (g = h), b += p, _ = s - g, k = 1 << _; _ + g < c && (k -= y[_ + g], !(k <= 0)); )
-        _++, k <<= 1;
-      if (v += 1 << _, e === gt && v > un || e === dn && v > hn)
+    if (s > h && (E & N) !== $) {
+      for (g === 0 && (g = h), b += _, d = s - g, k = 1 << d; d + g < c && (k -= v[d + g], !(k <= 0)); )
+        d++, k <<= 1;
+      if (y += 1 << d, e === gt && y > un || e === dn && y > hn)
         return 1;
-      $ = E & S, a[$] = h << 24 | _ << 16 | b - r | 0;
+      $ = E & N, a[$] = h << 24 | d << 16 | b - r | 0;
     }
   }
   return E !== 0 && (a[b + E] = s - g << 24 | 64 << 16 | 0), l.bits = h, 0;
@@ -1971,16 +1969,16 @@ const so = (e) => {
   const r = e.state;
   return r.window === null && (r.wsize = 1 << r.wbits, r.wnext = 0, r.whave = 0, r.window = new Uint8Array(r.wsize)), i >= r.wsize ? (r.window.set(n.subarray(t - r.wsize, t), 0), r.wnext = 0, r.whave = r.wsize) : (a = r.wsize - r.wnext, a > i && (a = i), r.window.set(n.subarray(t - i, t - i + a), r.wnext), i -= a, i ? (r.window.set(n.subarray(t - i, t), 0), r.wnext = i, r.whave = r.wsize) : (r.wnext += a, r.wnext === r.wsize && (r.wnext = 0), r.whave < r.wsize && (r.whave += a))), 0;
 }, lo = (e, n) => {
-  let t, i, a, r, o, l, u, s, f, p, c, h, _, g, k = 0, v, E, C, d, $, S, b, w;
-  const m = new Uint8Array(4);
-  let y, I;
+  let t, i, a, r, o, l, u, s, f, _, c, h, d, g, k = 0, y, E, C, p, $, N, b, m;
+  const w = new Uint8Array(4);
+  let v, I;
   const ie = (
     /* 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 (he(e) || !e.output || !e.input && e.avail_in !== 0)
     return P;
-  t = e.state, t.mode === K && (t.mode = wt), o = e.next_out, a = e.output, u = e.avail_out, r = e.next_in, i = e.input, l = e.avail_in, s = t.hold, f = t.bits, p = l, c = u, w = ue;
+  t = e.state, t.mode === K && (t.mode = wt), o = e.next_out, a = e.output, u = e.avail_out, r = e.next_in, i = e.input, l = e.avail_in, s = t.hold, f = t.bits, _ = l, c = u, m = ue;
   e:
     for (; ; )
       switch (t.mode) {
@@ -1995,7 +1993,7 @@ const so = (e) => {
             l--, s += i[r++] << 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;
+            t.wbits === 0 && (t.wbits = 15), t.check = 0, w[0] = s & 255, w[1] = s >>> 8 & 255, t.check = R(t.check, w, 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 */
@@ -2027,21 +2025,21 @@ 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 = s >> 8 & 1), t.flags & 512 && t.wrap & 4 && (w[0] = s & 255, w[1] = s >>> 8 & 255, t.check = R(t.check, w, 2, 0)), s = 0, f = 0, t.mode = gn;
         case gn:
           for (; f < 32; ) {
             if (l === 0)
               break e;
             l--, s += i[r++] << 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 = s), t.flags & 512 && t.wrap & 4 && (w[0] = s & 255, w[1] = s >>> 8 & 255, w[2] = s >>> 16 & 255, w[3] = s >>> 24 & 255, t.check = R(t.check, w, 4, 0)), s = 0, f = 0, t.mode = wn;
         case wn:
           for (; f < 16; ) {
             if (l === 0)
               break e;
             l--, s += i[r++] << 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 = s & 255, t.head.os = s >> 8), t.flags & 512 && t.wrap & 4 && (w[0] = s & 255, w[1] = s >>> 8 & 255, t.check = R(t.check, w, 2, 0)), s = 0, f = 0, t.mode = mn;
         case mn:
           if (t.flags & 1024) {
             for (; f < 16; ) {
@@ -2049,7 +2047,7 @@ const so = (e) => {
                 break e;
               l--, s += i[r++] << 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 = s, t.head && (t.head.extra_len = s), t.flags & 512 && t.wrap & 4 && (w[0] = s & 255, w[1] = s >>> 8 & 255, t.check = R(t.check, w, 2, 0)), s = 0, f = 0;
           } else t.head && (t.head.extra = null);
           t.mode = yn;
         case yn:
@@ -2191,46 +2189,46 @@ const so = (e) => {
           }
           for (; t.have < 19; )
             t.lens[ie[t.have++]] = 0;
-          if (t.lencode = t.lendyn, t.lenbits = 7, y = { bits: t.lenbits }, w = Ae(Xa, t.lens, 0, 19, t.lencode, 0, t.work, y), t.lenbits = y.bits, w) {
+          if (t.lencode = t.lendyn, t.lenbits = 7, v = { bits: t.lenbits }, m = Ae(Xa, t.lens, 0, 19, t.lencode, 0, t.work, v), t.lenbits = v.bits, m) {
             e.msg = "invalid code lengths set", t.mode = O;
             break;
           }
           t.have = 0, t.mode = Tn;
         case Tn:
           for (; t.have < t.nlen + t.ndist; ) {
-            for (; k = t.lencode[s & (1 << t.lenbits) - 1], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(v <= f); ) {
+            for (; k = t.lencode[s & (1 << t.lenbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
               if (l === 0)
                 break e;
               l--, s += i[r++] << f, f += 8;
             }
             if (C < 16)
-              s >>>= v, f -= v, t.lens[t.have++] = C;
+              s >>>= y, f -= y, t.lens[t.have++] = C;
             else {
               if (C === 16) {
-                for (I = v + 2; f < I; ) {
+                for (I = y + 2; f < I; ) {
                   if (l === 0)
                     break e;
                   l--, s += i[r++] << f, f += 8;
                 }
-                if (s >>>= v, f -= v, t.have === 0) {
+                if (s >>>= 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;
               } else if (C === 17) {
-                for (I = v + 3; f < I; ) {
+                for (I = y + 3; f < I; ) {
                   if (l === 0)
                     break e;
                   l--, s += i[r++] << f, f += 8;
                 }
-                s >>>= v, f -= v, b = 0, h = 3 + (s & 7), s >>>= 3, f -= 3;
+                s >>>= y, f -= y, b = 0, h = 3 + (s & 7), s >>>= 3, f -= 3;
               } else {
-                for (I = v + 7; f < I; ) {
+                for (I = y + 7; f < I; ) {
                   if (l === 0)
                     break e;
                   l--, s += i[r++] << f, f += 8;
                 }
-                s >>>= v, f -= v, b = 0, h = 11 + (s & 127), s >>>= 7, f -= 7;
+                s >>>= y, f -= y, b = 0, h = 11 + (s & 127), s >>>= 7, f -= 7;
               }
               if (t.have + h > t.nlen + t.ndist) {
                 e.msg = "invalid bit length repeat", t.mode = O;
@@ -2246,11 +2244,11 @@ const so = (e) => {
             e.msg = "invalid code -- missing end-of-block", t.mode = O;
             break;
           }
-          if (t.lenbits = 9, y = { bits: t.lenbits }, w = Ae(gi, t.lens, 0, t.nlen, t.lencode, 0, t.work, y), t.lenbits = y.bits, w) {
+          if (t.lenbits = 9, v = { bits: t.lenbits }, m = Ae(gi, t.lens, 0, t.nlen, t.lencode, 0, t.work, v), t.lenbits = v.bits, m) {
             e.msg = "invalid literal/lengths set", t.mode = O;
             break;
           }
-          if (t.distbits = 6, t.distcode = t.distdyn, y = { bits: t.distbits }, w = Ae(wi, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, y), t.distbits = y.bits, w) {
+          if (t.distbits = 6, t.distcode = t.distdyn, v = { bits: t.distbits }, m = Ae(wi, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, v), t.distbits = v.bits, m) {
             e.msg = "invalid distances set", t.mode = O;
             break;
           }
@@ -2263,20 +2261,20 @@ const so = (e) => {
             e.next_out = o, e.avail_out = u, e.next_in = r, e.avail_in = l, t.hold = s, t.bits = f, Ha(e, c), o = e.next_out, a = e.output, u = e.avail_out, r = e.next_in, i = e.input, l = e.avail_in, s = t.hold, f = t.bits, t.mode === K && (t.back = -1);
             break;
           }
-          for (t.back = 0; k = t.lencode[s & (1 << t.lenbits) - 1], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(v <= f); ) {
+          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)
               break e;
             l--, s += i[r++] << f, f += 8;
           }
           if (E && !(E & 240)) {
-            for (d = v, $ = E, S = C; k = t.lencode[S + ((s & (1 << d + $) - 1) >> d)], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(d + v <= f); ) {
+            for (p = y, $ = E, N = C; k = t.lencode[N + ((s & (1 << p + $) - 1) >> p)], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(p + y <= f); ) {
               if (l === 0)
                 break e;
               l--, s += i[r++] << f, f += 8;
             }
-            s >>>= d, f -= d, t.back += d;
+            s >>>= p, f -= p, t.back += p;
           }
-          if (s >>>= v, f -= v, t.back += v, t.length = C, E === 0) {
+          if (s >>>= y, f -= y, t.back += y, t.length = C, E === 0) {
             t.mode = Bn;
             break;
           }
@@ -2300,20 +2298,20 @@ const so = (e) => {
           }
           t.was = t.length, t.mode = On;
         case On:
-          for (; k = t.distcode[s & (1 << t.distbits) - 1], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(v <= f); ) {
+          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;
             l--, s += i[r++] << f, f += 8;
           }
           if (!(E & 240)) {
-            for (d = v, $ = E, S = C; k = t.distcode[S + ((s & (1 << d + $) - 1) >> d)], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(d + v <= f); ) {
+            for (p = y, $ = E, N = C; k = t.distcode[N + ((s & (1 << p + $) - 1) >> p)], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(p + y <= f); ) {
               if (l === 0)
                 break e;
               l--, s += i[r++] << f, f += 8;
             }
-            s >>>= d, f -= d, t.back += d;
+            s >>>= p, f -= p, t.back += p;
           }
-          if (s >>>= v, f -= v, t.back += v, E & 64) {
+          if (s >>>= y, f -= y, t.back += y, E & 64) {
             e.msg = "invalid distance code", t.mode = O;
             break;
           }
@@ -2340,12 +2338,12 @@ const so = (e) => {
               e.msg = "invalid distance too far back", t.mode = O;
               break;
             }
-            h > t.wnext ? (h -= t.wnext, _ = t.wsize - h) : _ = t.wnext - h, h > t.length && (h = t.length), g = t.window;
+            h > t.wnext ? (h -= t.wnext, d = t.wsize - h) : d = t.wnext - h, h > t.length && (h = t.length), g = t.window;
           } else
-            g = a, _ = o - t.offset, h = t.length;
+            g = a, d = o - t.offset, h = t.length;
           h > u && (h = u), u -= h, t.length -= h;
           do
-            a[o++] = g[_++];
+            a[o++] = g[d++];
           while (--h);
           t.length === 0 && (t.mode = Qe);
           break;
@@ -2384,10 +2382,10 @@ const so = (e) => {
           }
           t.mode = Dn;
         case Dn:
-          w = Ja;
+          m = Ja;
           break e;
         case O:
-          w = mi;
+          m = mi;
           break e;
         case vi:
           return yi;
@@ -2395,8 +2393,8 @@ const so = (e) => {
         default:
           return P;
       }
-  return e.next_out = o, e.avail_out = u, e.next_in = r, 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), p -= e.avail_in, c -= e.avail_out, e.total_in += p, 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, a, c, e.next_out - c) : Ue(t.check, a, 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), (p === 0 && c === 0 || n === pn) && w === ue && (w = eo), w;
+  return e.next_out = o, e.avail_out = u, e.next_in = r, 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), _ -= e.avail_in, c -= e.avail_out, e.total_in += _, 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, a, c, e.next_out - c) : Ue(t.check, a, 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), (_ === 0 && c === 0 || n === pn) && m === ue && (m = eo), m;
 }, fo = (e) => {
   if (he(e))
     return P;
@@ -2539,36 +2537,36 @@ function Ct(e, n, t, i) {
   return e < i && n >= t;
 }
 function Ho(e) {
-  const n = e ? "big" : "little", t = new N().endianess(n).uint32("chromId").uint32("start").uint32("end").uint32("validCnt").floatle("minScore").floatle("maxScore").floatle("sumData").floatle("sumSqData").saveOffset("offset"), i = new N().endianess(n).uint8("isLeaf").skip(1).uint16("cnt").choice({
+  const n = e ? "big" : "little", t = new S().endianess(n).uint32("chromId").uint32("start").uint32("end").uint32("validCnt").floatle("minScore").floatle("maxScore").floatle("sumData").floatle("sumSqData").saveOffset("offset"), i = new S().endianess(n).uint8("isLeaf").skip(1).uint16("cnt").choice({
     tag: "isLeaf",
     choices: {
-      1: new N().endianess(n).array("blocksToFetch", {
+      1: new S().endianess(n).array("blocksToFetch", {
         length: "cnt",
-        type: new N().endianess(n).uint32("startChrom").uint32("startBase").uint32("endChrom").uint32("endBase").uint64("blockOffset").uint64("blockSize").saveOffset("offset")
+        type: new S().endianess(n).uint32("startChrom").uint32("startBase").uint32("endChrom").uint32("endBase").uint64("blockOffset").uint64("blockSize").saveOffset("offset")
       }),
-      0: new N().array("recurOffsets", {
+      0: new S().array("recurOffsets", {
         length: "cnt",
-        type: new N().endianess(n).uint32("startChrom").uint32("startBase").uint32("endChrom").uint32("endBase").uint64("blockOffset").saveOffset("offset")
+        type: new S().endianess(n).uint32("startChrom").uint32("startBase").uint32("endChrom").uint32("endBase").uint64("blockOffset").saveOffset("offset")
       })
     }
-  }), a = new N().endianess(n).uint32("chromId").int32("start").int32("end").string("rest", {
+  }), a = new S().endianess(n).uint32("chromId").int32("start").int32("end").string("rest", {
     zeroTerminated: !0
   }).saveOffset("offset");
   return {
-    bigWigParser: new N().endianess(n).skip(4).int32("blockStart").skip(4).uint32("itemStep").uint32("itemSpan").uint8("blockType").skip(1).uint16("itemCount").choice({
+    bigWigParser: new S().endianess(n).skip(4).int32("blockStart").skip(4).uint32("itemStep").uint32("itemSpan").uint8("blockType").skip(1).uint16("itemCount").choice({
       tag: "blockType",
       choices: {
-        [Mo]: new N().array("items", {
+        [Mo]: new S().array("items", {
           length: "itemCount",
-          type: new N().floatle("score")
+          type: new S().floatle("score")
         }),
-        [xo]: new N().array("items", {
+        [xo]: new S().array("items", {
           length: "itemCount",
-          type: new N().endianess(n).int32("start").floatle("score")
+          type: new S().endianess(n).int32("start").floatle("score")
         }),
-        [Zo]: new N().array("items", {
+        [Zo]: new S().array("items", {
           length: "itemCount",
-          type: new N().endianess(n).int32("start").int32("end").floatle("score")
+          type: new S().endianess(n).int32("start").int32("end").floatle("score")
         })
       }
     }),
@@ -2582,7 +2580,7 @@ class Ti {
     if (this.bbi = n, this.refsByName = t, this.cirTreeOffset = i, this.isBigEndian = a, this.isCompressed = r, this.blockType = o, this.featureCache = new Gn({
       cache: new Yn({ maxSize: 1e3 }),
       fill: async (u, s) => {
-        const f = Number(u.length), p = Number(u.offset), { buffer: c } = await this.bbi.read(J.Buffer.alloc(f), 0, f, p, {
+        const f = Number(u.length), _ = Number(u.offset), { buffer: c } = await this.bbi.read(J.Buffer.alloc(f), 0, f, _, {
           signal: s
         });
         return c;
@@ -2596,53 +2594,53 @@ class Ti {
     try {
       const { refsByName: o, bbi: l, cirTreeOffset: u, isBigEndian: s } = this, f = o[n];
       f === void 0 && a.complete();
-      const p = { chrId: f, start: t, end: i };
+      const _ = { chrId: f, start: t, end: i };
       this.cirTreePromise || (this.cirTreePromise = l.read(J.Buffer.alloc(48), 0, 48, Number(u), r));
       const { buffer: c } = await this.cirTreePromise, h = s ? c.readUInt32BE(4) : c.readUInt32LE(4);
-      let _ = [], g = 0;
-      const k = (d, $, S) => {
+      let d = [], g = 0;
+      const k = (p, $, N) => {
         try {
-          const b = d.subarray($), w = this.leafParser.parse(b);
-          if (w.blocksToFetch && (_ = _.concat(w.blocksToFetch.filter((m) => v(m)).map((m) => ({
-            offset: m.blockOffset,
-            length: m.blockSize
-          })))), w.recurOffsets) {
-            const m = w.recurOffsets.filter((y) => v(y)).map((y) => Number(y.blockOffset));
-            m.length > 0 && C(m, S + 1);
+          const b = p.subarray($), m = this.leafParser.parse(b);
+          if (m.blocksToFetch && (d = d.concat(m.blocksToFetch.filter((w) => y(w)).map((w) => ({
+            offset: w.blockOffset,
+            length: w.blockSize
+          })))), m.recurOffsets) {
+            const w = m.recurOffsets.filter((v) => y(v)).map((v) => Number(v.blockOffset));
+            w.length > 0 && C(w, N + 1);
           }
         } catch (b) {
           a.error(b);
         }
-      }, v = (d) => {
-        const { startChrom: $, startBase: S, endChrom: b, endBase: w } = d;
-        return ($ < f || $ === f && S <= i) && (b > f || b === f && w >= t);
-      }, E = async (d, $, S) => {
+      }, y = (p) => {
+        const { startChrom: $, startBase: N, endChrom: b, endBase: m } = p;
+        return ($ < f || $ === f && N <= i) && (b > f || b === f && m >= t);
+      }, E = async (p, $, N) => {
         try {
-          const b = $.max - $.min, w = $.min, m = await this.featureCache.get(`${b}_${w}`, { length: b, offset: w }, r == null ? void 0 : r.signal);
-          for (const y of d)
-            $.contains(y) && (k(m, y - w, S), g -= 1, g === 0 && this.readFeatures(a, _, {
+          const b = $.max - $.min, m = $.min, w = await this.featureCache.get(`${b}_${m}`, { length: b, offset: m }, r == null ? void 0 : r.signal);
+          for (const v of p)
+            $.contains(v) && (k(w, v - m, N), g -= 1, g === 0 && this.readFeatures(a, d, {
               ...r,
-              request: p
+              request: _
             }).catch((I) => a.error(I)));
         } catch (b) {
           a.error(b);
         }
-      }, C = (d, $) => {
+      }, C = (p, $) => {
         try {
-          g += d.length;
-          const S = 4 + Number(h) * 32;
+          g += p.length;
+          const N = 4 + Number(h) * 32;
           let b = new pe([
-            { min: d[0], max: d[0] + S }
+            { min: p[0], max: p[0] + N }
           ]);
-          for (let w = 1; w < d.length; w += 1) {
-            const m = new pe([
-              { min: d[w], max: d[w] + S }
+          for (let m = 1; m < p.length; m += 1) {
+            const w = new pe([
+              { min: p[m], max: p[m] + N }
             ]);
-            b = b.union(m);
+            b = b.union(w);
           }
-          b.getRanges().map((w) => E(d, w, $));
-        } catch (S) {
-          a.error(S);
+          b.getRanges().map((m) => E(p, m, $));
+        } catch (N) {
+          a.error(N);
         }
       };
       return C([Number(u) + 48], 1);
@@ -2663,7 +2661,7 @@ class Ti {
       r += 4;
       const f = o.getUint32(r, !0);
       r += 4;
-      const p = o.getFloat32(r, !0);
+      const _ = o.getFloat32(r, !0);
       r += 4;
       const c = o.getFloat32(r, !0);
       r += 4;
@@ -2672,7 +2670,7 @@ class Ti {
         start: u,
         end: s,
         maxScore: c,
-        minScore: p,
+        minScore: _,
         summary: !0,
         score: h / (f || 1)
       });
@@ -2700,36 +2698,36 @@ class Ti {
     o += 4;
     const f = r.getUint8(o);
     o += 2;
-    const p = r.getUint16(o, !0);
+    const _ = r.getUint16(o, !0);
     o += 2;
-    const c = new Array(p);
+    const c = new Array(_);
     switch (f) {
       case 1: {
-        for (let h = 0; h < p; h++) {
-          const _ = r.getInt32(o, !0);
+        for (let h = 0; h < _; h++) {
+          const d = r.getInt32(o, !0);
           o += 4;
           const g = r.getInt32(o, !0);
           o += 4;
           const k = r.getFloat32(o, !0);
-          o += 4, c[h] = { start: _, end: g, score: k };
+          o += 4, c[h] = { start: d, end: g, score: k };
         }
         break;
       }
       case 2: {
-        for (let h = 0; h < p; h++) {
-          const _ = r.getInt32(o, !0);
+        for (let h = 0; h < _; h++) {
+          const d = r.getInt32(o, !0);
           o += 4;
           const g = r.getFloat32(o, !0);
-          o += 4, c[h] = { score: g, start: _, end: _ + s };
+          o += 4, c[h] = { score: g, start: d, end: d + s };
         }
         break;
       }
       case 3: {
-        for (let h = 0; h < p; h++) {
-          const _ = r.getFloat32(o, !0);
+        for (let h = 0; h < _; h++) {
+          const d = r.getFloat32(o, !0);
           o += 4;
           const g = l + h * u;
-          c[h] = { score: _, start: g, end: g + s };
+          c[h] = { score: d, start: g, end: g + s };
         }
         break;
       }
@@ -2741,21 +2739,21 @@ class Ti {
       const { blockType: a, isCompressed: r } = this, { signal: o, request: l } = i, u = Po(t);
       et(o), await Promise.all(u.map(async (s) => {
         et(o);
-        const { length: f, offset: p } = s, c = await this.featureCache.get(`${f}_${p}`, s, o);
+        const { length: f, offset: _ } = s, c = await this.featureCache.get(`${f}_${_}`, s, o);
         for (const h of s.blocks) {
           et(o);
-          let _ = Number(h.offset) - Number(s.offset), g = c;
-          switch (r && (g = Fo(c.subarray(_)), _ = 0), et(o), a) {
+          let d = Number(h.offset) - Number(s.offset), g = c;
+          switch (r && (g = Fo(c.subarray(d)), d = 0), et(o), a) {
             case "summary": {
-              n.next(this.parseSummaryBlock(g, _, l));
+              n.next(this.parseSummaryBlock(g, d, l));
               break;
             }
             case "bigwig": {
-              n.next(this.parseBigWigBlock(g, _, l));
+              n.next(this.parseBigWigBlock(g, d, l));
               break;
             }
             case "bigbed": {
-              n.next(this.parseBigBedBlock(g, _, Number(h.offset) * 256, l));
+              n.next(this.parseBigBedBlock(g, d, Number(h.offset) * 256, l));
               break;
             }
             default:
@@ -2794,15 +2792,15 @@ function jo(e, n, t, i) {
     function l(f) {
       try {
         s(i.next(f));
-      } catch (p) {
-        o(p);
+      } catch (_) {
+        o(_);
       }
     }
     function u(f) {
       try {
         s(i.throw(f));
-      } catch (p) {
-        o(p);
+      } catch (_) {
+        o(_);
       }
     }
     function s(f) {
@@ -2815,8 +2813,8 @@ function Ai(e, n) {
   var t = { label: 0, sent: function() {
     if (r[0] & 1) throw r[1];
     return r[1];
-  }, trys: [], ops: [] }, i, a, r, o;
-  return o = { next: l(0), throw: l(1), return: l(2) }, typeof Symbol == "function" && (o[Symbol.iterator] = function() {
+  }, trys: [], ops: [] }, i, a, r, o = Object.create((typeof Iterator == "function" ? Iterator : Object).prototype);
+  return o.next = l(0), o.throw = l(1), o.return = l(2), typeof Symbol == "function" && (o[Symbol.iterator] = function() {
     return this;
   }), o;
   function l(s) {
@@ -2909,34 +2907,39 @@ function be(e) {
 function Go(e, n, t) {
   if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
   var i = t.apply(e, n || []), a, r = [];
-  return a = {}, o("next"), o("throw"), o("return"), a[Symbol.asyncIterator] = function() {
+  return a = Object.create((typeof AsyncIterator == "function" ? AsyncIterator : Object).prototype), l("next"), l("throw"), l("return", o), a[Symbol.asyncIterator] = function() {
     return this;
   }, a;
-  function o(c) {
-    i[c] && (a[c] = function(h) {
-      return new Promise(function(_, g) {
-        r.push([c, h, _, g]) > 1 || l(c, h);
+  function o(h) {
+    return function(d) {
+      return Promise.resolve(d).then(h, _);
+    };
+  }
+  function l(h, d) {
+    i[h] && (a[h] = function(g) {
+      return new Promise(function(k, y) {
+        r.push([h, g, k, y]) > 1 || u(h, g);
       });
-    });
+    }, d && (a[h] = d(a[h])));
   }
-  function l(c, h) {
+  function u(h, d) {
     try {
-      u(i[c](h));
-    } catch (_) {
-      p(r[0][3], _);
+      s(i[h](d));
+    } catch (g) {
+      c(r[0][3], g);
     }
   }
-  function u(c) {
-    c.value instanceof be ? Promise.resolve(c.value.v).then(s, f) : p(r[0][2], c);
+  function s(h) {
+    h.value instanceof be ? Promise.resolve(h.value.v).then(f, _) : c(r[0][2], h);
   }
-  function s(c) {
-    l("next", c);
+  function f(h) {
+    u("next", h);
   }
-  function f(c) {
-    l("throw", c);
+  function _(h) {
+    u("throw", h);
   }
-  function p(c, h) {
-    c(h), r.shift(), r.length && l(r[0][0], r[0][1]);
+  function c(h, d) {
+    h(d), r.shift(), r.length && u(r[0][0], r[0][1]);
   }
 }
 function Yo(e) {
@@ -3016,14 +3019,14 @@ var Wt = function() {
         } catch (g) {
           r = g instanceof St ? g.errors : [g];
         }
-      var p = this._finalizers;
-      if (p) {
+      var _ = this._finalizers;
+      if (_) {
         this._finalizers = null;
         try {
-          for (var c = Le(p), h = c.next(); !h.done; h = c.next()) {
-            var _ = h.value;
+          for (var c = Le(_), h = c.next(); !h.done; h = c.next()) {
+            var d = h.value;
             try {
-              Zn(_);
+              Zn(d);
             } catch (g) {
               r = r ?? [], g instanceof St ? r = Pt(Pt([], Lt(r)), Lt(g.errors)) : r.push(g);
             }
@@ -3657,26 +3660,26 @@ function Ji(e, n) {
   });
 }
 function $s(e, n, t, i, a, r, o, l) {
-  var u = [], s = 0, f = 0, p = !1, c = function() {
-    p && !u.length && !s && n.complete();
+  var u = [], s = 0, f = 0, _ = !1, c = function() {
+    _ && !u.length && !s && n.complete();
   }, h = function(g) {
-    return s < i ? _(g) : u.push(g);
-  }, _ = function(g) {
+    return s < i ? d(g) : u.push(g);
+  }, d = function(g) {
     s++;
     var k = !1;
-    Ee(t(g, f++)).subscribe(Pe(n, function(v) {
-      n.next(v);
+    Ee(t(g, f++)).subscribe(Pe(n, function(y) {
+      n.next(y);
     }, function() {
       k = !0;
     }, void 0, function() {
       if (k)
         try {
           s--;
-          for (var v = function() {
+          for (var y = function() {
             var E = u.shift();
-            o || _(E);
+            o || d(E);
           }; u.length && s < i; )
-            v();
+            y();
           c();
         } catch (E) {
           n.error(E);
@@ -3684,7 +3687,7 @@ function $s(e, n, t, i, a, r, o, l) {
     }));
   };
   return e.subscribe(Pe(n, h, function() {
-    p = !0, c();
+    _ = !0, c();
   })), function() {
   };
 }
@@ -3710,8 +3713,8 @@ function Ss(e, n, t, i, a) {
   return function(r, o) {
     var l = t, u = n, s = 0;
     r.subscribe(Pe(o, function(f) {
-      var p = s++;
-      u = l ? e(u, f, p) : (l = !0, f);
+      var _ = s++;
+      u = l ? e(u, f, _) : (l = !0, f);
     }, function() {
       l && o.next(u), o.complete();
     }));
@@ -3733,10 +3736,10 @@ function Ts(e) {
   return new TextDecoder().decode(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", {
+  const n = e ? "big" : "little", t = new S().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")
-  }), i = new N().endianess(n).uint64("basesCovered").doublele("scoreMin").doublele("scoreMax").doublele("scoreSum").doublele("scoreSumSquares"), a = new N().endianess(n).uint32("magic").uint32("blockSize").uint32("keySize").uint32("valSize").uint64("itemCount"), r = new N().endianess(n).uint8("isLeafNode").skip(1).uint16("cnt").saveOffset("offset");
+    type: new S().endianess(n).uint32("reductionLevel").uint32("reserved").uint64("dataOffset").uint64("indexOffset")
+  }), i = new S().endianess(n).uint64("basesCovered").doublele("scoreMin").doublele("scoreMax").doublele("scoreSum").doublele("scoreSumSquares"), a = new S().endianess(n).uint32("magic").uint32("blockSize").uint32("keySize").uint32("valSize").uint64("itemCount"), r = new S().endianess(n).uint8("isLeafNode").skip(1).uint16("cnt").saveOffset("offset");
   return {
     chromTreeParser: a,
     totalSummaryParser: i,
@@ -3745,10 +3748,6 @@ function jn(e) {
   };
 }
 class tr {
-  /* fetch and parse header information from a bigwig or bigbed file
-   * @param abortSignal - abort the operation, can be null
-   * @return a Header object
-   */
   getHeader(n) {
     return this.headerP || (this.headerP = this._getHeader(n).catch((t) => {
       throw this.headerP = void 0, t;
@@ -3790,8 +3789,8 @@ class tr {
     if (o.totalSummaryOffset > t - 8 * 5)
       return this._getMainHeader(n, t * 2);
     if (o.totalSummaryOffset) {
-      const f = i.subarray(Number(o.totalSummaryOffset)), p = r.totalSummaryParser.parse(f);
-      o.totalSummary = { ...p, basesCovered: Number(p.basesCovered) };
+      const f = i.subarray(Number(o.totalSummaryOffset)), _ = r.totalSummaryParser.parse(f);
+      o.totalSummary = { ..._, basesCovered: Number(_.basesCovered) };
     }
     return { ...o, isBigEndian: a };
   }
@@ -3810,25 +3809,25 @@ class tr {
     const u = Number(n.chromTreeOffset);
     for (; l % 4 !== 0; )
       l += 1;
-    const s = l - u, { buffer: f } = await this.bbi.read(J.Buffer.alloc(s), 0, s, Number(u), t), p = jn(i), { keySize: c } = p.chromTreeParser.parse(f), h = new N().endianess(a).string("key", { stripNull: !0, length: c }).uint32("refId").uint32("refSize").saveOffset("offset"), _ = new N().endianess(a).skip(c).uint64("childOffset").saveOffset("offset"), g = 32, k = async (v) => {
-      let E = v;
+    const s = l - u, { buffer: f } = await this.bbi.read(J.Buffer.alloc(s), 0, s, Number(u), t), _ = jn(i), { keySize: c } = _.chromTreeParser.parse(f), h = new S().endianess(a).string("key", { stripNull: !0, length: c }).uint32("refId").uint32("refSize").saveOffset("offset"), d = new S().endianess(a).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");
-      const C = p.isLeafNode.parse(f.subarray(E)), { isLeafNode: d, cnt: $ } = C;
-      if (E += C.offset, d)
-        for (let S = 0; S < $; S += 1) {
+      const C = _.isLeafNode.parse(f.subarray(E)), { isLeafNode: p, cnt: $ } = C;
+      if (E += C.offset, p)
+        for (let N = 0; N < $; N += 1) {
           const b = h.parse(f.subarray(E));
           E += b.offset;
-          const { key: w, refId: m, refSize: y } = b, I = { name: w, id: m, length: y };
-          o[this.renameRefSeqs(w)] = m, r[m] = I;
+          const { key: m, refId: w, refSize: v } = b, I = { name: m, id: w, length: v };
+          o[this.renameRefSeqs(m)] = w, r[w] = I;
         }
       else {
-        const S = [];
+        const N = [];
         for (let b = 0; b < $; b += 1) {
-          const w = _.parse(f.subarray(E)), { childOffset: m } = w;
-          E += w.offset, S.push(k(Number(m) - Number(u)));
+          const m = d.parse(f.subarray(E)), { childOffset: w } = m;
+          E += m.offset, N.push(k(Number(w) - Number(u)));
         }
-        await Promise.all(S);
+        await Promise.all(N);
       }
     };
     return await k(g), {
@@ -3858,7 +3857,7 @@ class tr {
     let o;
     const { basesPerSpan: l, scale: u } = a || {};
     return l ? o = await this.getView(1 / l, a) : u ? o = await this.getView(u, a) : o = await this.getView(1, a), new Z((s) => {
-      o.readWigData(r, t, i, s, a);
+      o.readWigData(r, t, i, s, a).catch((f) => s.error(f));
     });
   }
   async getFeatures(n, t, i, a) {
@@ -3871,16 +3870,18 @@ class Fs extends tr {
    * Retrieves a BlockView of a specific zoomLevel
    *
    * @param scale - number
-   * @param opts - An object containing basesPerSpan (e.g. pixels per basepair) or scale used to infer the zoomLevel to use
+   *
+   * @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: a, fileSize: r, isBigEndian: o, uncompressBufSize: l } = await this.getHeader(t), u = 1 / n;
     let s = i.length;
     r || (s -= 1);
     for (let f = s; f >= 0; f -= 1) {
-      const p = i[f];
-      if (p && p.reductionLevel <= 2 * u) {
-        const c = Number(p.indexOffset);
+      const _ = i[f];
+      if (_ && _.reductionLevel <= 2 * u) {
+        const c = Number(_.indexOffset);
         return new Ti(this.bbi, a, c, o, l > 0, "summary");
       }
     }
@@ -3913,12 +3914,12 @@ class Ls 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: a } = await this.bbi.read(J.Buffer.alloc(64), 0, 64, Number(t)), r = i ? "big" : "little", o = new N().endianess(r).uint16("size").uint16("count").uint64("offset").parse(a), { count: l, offset: u } = o;
+    const { extHeaderOffset: t, isBigEndian: i } = await this.getHeader(n), { buffer: a } = await this.bbi.read(J.Buffer.alloc(64), 0, 64, Number(t)), r = i ? "big" : "little", o = new S().endianess(r).uint16("size").uint16("count").uint64("offset").parse(a), { count: l, offset: u } = o;
     if (l === 0)
       return [];
-    const s = 20, f = s * l, { buffer: p } = await this.bbi.read(J.Buffer.alloc(f), 0, f, Number(u)), c = new N().endianess(r).int16("type").int16("fieldcount").uint64("offset").skip(4).int16("field"), h = [];
-    for (let _ = 0; _ < l; _ += 1)
-      h.push(c.parse(p.subarray(_ * s)));
+    const s = 20, f = s * l, { buffer: _ } = await this.bbi.read(J.Buffer.alloc(f), 0, f, Number(u)), c = new S().endianess(r).int16("type").int16("fieldcount").uint64("offset").skip(4).int16("field"), h = [];
+    for (let d = 0; d < l; d += 1)
+      h.push(c.parse(_.subarray(d * s)));
     return h;
   }
   /*
@@ -3934,41 +3935,41 @@ class Ls extends tr {
     if (a.length === 0)
       return [];
     const r = a.map(async (o) => {
-      const { offset: l, field: u } = o, { buffer: s } = await this.bbi.read(J.Buffer.alloc(32), 0, 32, Number(l), t), f = i ? "big" : "little", p = new N().endianess(f).int32("magic").int32("blockSize").int32("keySize").int32("valSize").uint64("itemCount"), { blockSize: c, keySize: h, valSize: _ } = p.parse(s), g = new N().endianess(f).int8("nodeType").skip(1).int16("cnt").choice({
+      const { offset: l, field: u } = o, { buffer: s } = await this.bbi.read(J.Buffer.alloc(32), 0, 32, Number(l), t), f = i ? "big" : "little", _ = new S().endianess(f).int32("magic").int32("blockSize").int32("keySize").int32("valSize").uint64("itemCount"), { blockSize: c, keySize: h, valSize: d } = _.parse(s), g = new S().endianess(f).int8("nodeType").skip(1).int16("cnt").choice({
         tag: "nodeType",
         choices: {
-          0: new N().array("leafkeys", {
+          0: new S().array("leafkeys", {
             length: "cnt",
-            type: new N().endianess(f).string("key", { length: h, stripNull: !0 }).uint64("offset")
+            type: new S().endianess(f).string("key", { length: h, stripNull: !0 }).uint64("offset")
           }),
-          1: new N().array("keys", {
+          1: new S().array("keys", {
             length: "cnt",
-            type: new N().endianess(f).string("key", { length: h, stripNull: !0 }).uint64("offset").uint32("length").uint32("reserved")
+            type: new S().endianess(f).string("key", { length: h, stripNull: !0 }).uint64("offset").uint32("length").uint32("reserved")
           })
         }
       }), k = async (E) => {
-        const C = Number(E), d = 4 + c * (h + _), { buffer: $ } = await this.bbi.read(J.Buffer.alloc(d), 0, d, C, t), S = g.parse($);
-        if (S.leafkeys) {
+        const C = Number(E), p = 4 + c * (h + d), { buffer: $ } = await this.bbi.read(J.Buffer.alloc(p), 0, p, C, t), N = g.parse($);
+        if (N.leafkeys) {
           let b;
-          for (let w = 0; w < S.leafkeys.length; w += 1) {
-            const { key: m } = S.leafkeys[w];
+          for (const { key: m, offset: w } of N.leafkeys) {
             if (n.localeCompare(m) < 0 && b)
               return k(b);
-            b = S.leafkeys[w].offset;
+            b = w;
           }
           return k(b);
         }
-        for (let b = 0; b < S.keys.length; b += 1)
-          if (S.keys[b].key === n)
-            return { ...S.keys[b], field: u };
+        for (const b of N.keys)
+          if (b.key === n)
+            return { ...b, field: u };
       };
       return k(Number(l) + 32);
     });
     return As(await Promise.all(r));
   }
   /*
-   * retrieve the features from the bigbed data that were found through the lookup of the extraIndex
-   * note that there can be multiple extraIndex, see the BigBed specification and the -extraIndex argument to bedToBigBed
+   * retrieve the features from the bigbed data that were found through the
+   * lookup of the extraIndex note that there can be multiple extraIndex, see
+   * the BigBed specification and the -extraIndex argument to bedToBigBed
    *
    * @param name - the name to search for
    * @param opts - a SearchOptions argument with optional signal
@@ -3979,7 +3980,7 @@ class Ls extends tr {
     if (i.length === 0)
       return [];
     const a = await this.getUnzoomedView(t), r = i.map((l) => new Z((u) => {
-      a.readFeatures(u, [l], t);
+      a.readFeatures(u, [l], t).catch((s) => u.error(s));
     }).pipe(er((u, s) => u.concat(s)), Ji((u) => {
       for (const s of u)
         s.field = l.field;