@genome-spy/app 0.69.0 → 0.70.0

package/dist/{index-DHay3ip-.js → index-BUsSzlHg.js}

@@ -1,71 +1,68 @@
-var Ne = Object.defineProperty;
-var Le = (t, r, e) => r in t ? Ne(t, r, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[r] = e;
-var E = (t, r, e) => Le(t, typeof r != "symbol" ? r + "" : r, e);
-import { RemoteFile as Me, LocalFile as He } from "./browser-BRemItdO.js";
-import { A as le } from "./AbortablePromiseCache-CcuMrnn7.js";
-import { i as $e } from "./inflate-GtwLkvSP.js";
-function je(t) {
+import { RemoteFile as Re, LocalFile as De } from "./browser-0iNU5Wit.js";
+import { A as ue } from "./AbortablePromiseCache-Dj0vzLnp.js";
+import { i as Ne } from "./inflate-GtwLkvSP.js";
+function Le(t) {
   return t && t.__esModule && Object.prototype.hasOwnProperty.call(t, "default") ? t.default : t;
 }
-const he = BigInt(32);
-function Ge(t, r, e) {
+const fe = BigInt(32);
+function Me(t, r, e) {
   const n = +!!e, i = +!e;
-  return BigInt(t.getInt32(r, e) * i + t.getInt32(r + 4, e) * n) << he | BigInt(t.getUint32(r, e) * n + t.getUint32(r + 4, e) * i);
+  return BigInt(t.getInt32(r, e) * i + t.getInt32(r + 4, e) * n) << fe | BigInt(t.getUint32(r, e) * n + t.getUint32(r + 4, e) * i);
 }
-function We(t, r, e) {
+function He(t, r, e) {
   const n = t.getUint32(r, e), i = t.getUint32(r + 4, e), o = +!!e, s = +!e;
-  return BigInt(n * s + i * o) << he | BigInt(n * o + i * s);
+  return BigInt(n * s + i * o) << fe | BigInt(n * o + i * s);
 }
 "getBigInt64" in DataView || (DataView.prototype.getBigInt64 = function(t, r) {
-  return Ge(this, t, r);
+  return Me(this, t, r);
 });
 "getBigUint64" in DataView || (DataView.prototype.getBigUint64 = function(t, r) {
-  return We(this, t, r);
+  return He(this, t, r);
 });
-var K = function(t, r) {
-  return K = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(e, n) {
+var J = function(t, r) {
+  return J = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(e, n) {
     e.__proto__ = n;
   } || function(e, n) {
     for (var i in n) Object.prototype.hasOwnProperty.call(n, i) && (e[i] = n[i]);
-  }, K(t, r);
+  }, J(t, r);
 };
-function te(t, r) {
+function X(t, r) {
   if (typeof r != "function" && r !== null)
     throw new TypeError("Class extends value " + String(r) + " is not a constructor or null");
-  K(t, r);
+  J(t, r);
   function e() {
     this.constructor = t;
   }
   t.prototype = r === null ? Object.create(r) : (e.prototype = r.prototype, new e());
 }
-function qe(t, r, e, n) {
+function $e(t, r, e, n) {
   function i(o) {
     return o instanceof e ? o : new e(function(s) {
       s(o);
     });
   }
   return new (e || (e = Promise))(function(o, s) {
-    function u(d) {
+    function u(h) {
       try {
-        c(n.next(d));
-      } catch (y) {
-        s(y);
+        c(n.next(h));
+      } catch (d) {
+        s(d);
       }
     }
-    function a(d) {
+    function a(h) {
       try {
-        c(n.throw(d));
-      } catch (y) {
-        s(y);
+        c(n.throw(h));
+      } catch (d) {
+        s(d);
       }
     }
-    function c(d) {
-      d.done ? o(d.value) : i(d.value).then(u, a);
+    function c(h) {
+      h.done ? o(h.value) : i(h.value).then(u, a);
     }
     c((n = n.apply(t, r || [])).next());
   });
 }
-function de(t, r) {
+function le(t, r) {
   var e = { label: 0, sent: function() {
     if (o[0] & 1) throw o[1];
     return o[1];
@@ -74,8 +71,8 @@ function de(t, r) {
     return this;
   }), s;
   function u(c) {
-    return function(d) {
-      return a([c, d]);
+    return function(h) {
+      return a([c, h]);
     };
   }
   function a(c) {
@@ -116,8 +113,8 @@ function de(t, r) {
           continue;
       }
       c = r.call(t, e);
-    } catch (d) {
-      c = [6, d], i = 0;
+    } catch (h) {
+      c = [6, h], i = 0;
     } finally {
       n = o = 0;
     }
@@ -125,7 +122,7 @@ function de(t, r) {
     return { value: c[0] ? c[1] : void 0, done: !0 };
   }
 }
-function M(t) {
+function N(t) {
   var r = typeof Symbol == "function" && Symbol.iterator, e = r && t[r], n = 0;
   if (e) return e.call(t);
   if (t && typeof t.length == "number") return {
@@ -135,7 +132,7 @@ function M(t) {
   };
   throw new TypeError(r ? "Object is not iterable." : "Symbol.iterator is not defined.");
 }
-function X(t, r) {
+function Z(t, r) {
   var e = typeof Symbol == "function" && t[Symbol.iterator];
   if (!e) return t;
   var n = e.call(t), i, o = [], s;
@@ -152,15 +149,15 @@ function X(t, r) {
   }
   return o;
 }
-function ee(t, r, e) {
+function K(t, r, e) {
   if (e || arguments.length === 2) for (var n = 0, i = r.length, o; n < i; n++)
     (o || !(n in r)) && (o || (o = Array.prototype.slice.call(r, 0, n)), o[n] = r[n]);
   return t.concat(o || Array.prototype.slice.call(r));
 }
-function R(t) {
-  return this instanceof R ? (this.v = t, this) : new R(t);
+function z(t) {
+  return this instanceof z ? (this.v = t, this) : new z(t);
 }
-function Ye(t, r, e) {
+function je(t, r, e) {
   if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
   var n = e.apply(t, r || []), i, o = [];
   return i = Object.create((typeof AsyncIterator == "function" ? AsyncIterator : Object).prototype), u("next"), u("throw"), u("return", s), i[Symbol.asyncIterator] = function() {
@@ -168,13 +165,13 @@ function Ye(t, r, e) {
   }, i;
   function s(f) {
     return function(m) {
-      return Promise.resolve(m).then(f, y);
+      return Promise.resolve(m).then(f, d);
     };
   }
   function u(f, m) {
     n[f] && (i[f] = function(l) {
-      return new Promise(function(v, b) {
-        o.push([f, l, v, b]) > 1 || a(f, l);
+      return new Promise(function(B, w) {
+        o.push([f, l, B, w]) > 1 || a(f, l);
       });
     }, m && (i[f] = m(i[f])));
   }
@@ -182,26 +179,26 @@ function Ye(t, r, e) {
     try {
       c(n[f](m));
     } catch (l) {
-      g(o[0][3], l);
+      b(o[0][3], l);
     }
   }
   function c(f) {
-    f.value instanceof R ? Promise.resolve(f.value.v).then(d, y) : g(o[0][2], f);
+    f.value instanceof z ? Promise.resolve(f.value.v).then(h, d) : b(o[0][2], f);
   }
-  function d(f) {
+  function h(f) {
     a("next", f);
   }
-  function y(f) {
+  function d(f) {
     a("throw", f);
   }
-  function g(f, m) {
+  function b(f, m) {
     f(m), o.shift(), o.length && a(o[0][0], o[0][1]);
   }
 }
-function Qe(t) {
+function Ge(t) {
   if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
   var r = t[Symbol.asyncIterator], e;
-  return r ? r.call(t) : (t = typeof M == "function" ? M(t) : t[Symbol.iterator](), e = {}, n("next"), n("throw"), n("return"), e[Symbol.asyncIterator] = function() {
+  return r ? r.call(t) : (t = typeof N == "function" ? N(t) : t[Symbol.iterator](), e = {}, n("next"), n("throw"), n("return"), e[Symbol.asyncIterator] = function() {
     return this;
   }, e);
   function n(o) {
@@ -220,13 +217,13 @@ function Qe(t) {
 function O(t) {
   return typeof t == "function";
 }
-function me(t) {
+function he(t) {
   var r = function(n) {
     Error.call(n), n.stack = new Error().stack;
   }, e = t(r);
   return e.prototype = Object.create(Error.prototype), e.prototype.constructor = e, e;
 }
-var Y = me(function(t) {
+var q = he(function(t) {
   return function(e) {
     t(this), this.message = e ? e.length + ` errors occurred during unsubscription:
 ` + e.map(function(n, i) {
@@ -235,13 +232,13 @@ var Y = me(function(t) {
   `) : "", this.name = "UnsubscriptionError", this.errors = e;
   };
 });
-function oe(t, r) {
+function ne(t, r) {
   if (t) {
     var e = t.indexOf(r);
     0 <= e && t.splice(e, 1);
   }
 }
-var re = (function() {
+var ee = (function() {
   function t(r) {
     this.initialTeardown = r, this.closed = !1, this._parentage = null, this._finalizers = null;
   }
@@ -253,7 +250,7 @@ var re = (function() {
       if (s)
         if (this._parentage = null, Array.isArray(s))
           try {
-            for (var u = M(s), a = u.next(); !a.done; a = u.next()) {
+            for (var u = N(s), a = u.next(); !a.done; a = u.next()) {
               var c = a.value;
               c.remove(this);
             }
@@ -268,43 +265,43 @@ var re = (function() {
           }
         else
           s.remove(this);
-      var d = this.initialTeardown;
-      if (O(d))
+      var h = this.initialTeardown;
+      if (O(h))
         try {
-          d();
+          h();
         } catch (l) {
-          o = l instanceof Y ? l.errors : [l];
+          o = l instanceof q ? l.errors : [l];
         }
-      var y = this._finalizers;
-      if (y) {
+      var d = this._finalizers;
+      if (d) {
         this._finalizers = null;
         try {
-          for (var g = M(y), f = g.next(); !f.done; f = g.next()) {
+          for (var b = N(d), f = b.next(); !f.done; f = b.next()) {
             var m = f.value;
             try {
-              se(m);
+              ie(m);
             } catch (l) {
-              o = o ?? [], l instanceof Y ? o = ee(ee([], X(o)), X(l.errors)) : o.push(l);
+              o = o ?? [], l instanceof q ? o = K(K([], Z(o)), Z(l.errors)) : o.push(l);
             }
           }
         } catch (l) {
           n = { error: l };
         } finally {
           try {
-            f && !f.done && (i = g.return) && i.call(g);
+            f && !f.done && (i = b.return) && i.call(b);
           } finally {
             if (n) throw n.error;
           }
         }
       }
       if (o)
-        throw new Y(o);
+        throw new q(o);
     }
   }, t.prototype.add = function(r) {
     var e;
     if (r && r !== this)
       if (this.closed)
-        se(r);
+        ie(r);
       else {
         if (r instanceof t) {
           if (r.closed || r._hasParent(this))
@@ -321,53 +318,53 @@ var re = (function() {
     this._parentage = Array.isArray(e) ? (e.push(r), e) : e ? [e, r] : r;
   }, t.prototype._removeParent = function(r) {
     var e = this._parentage;
-    e === r ? this._parentage = null : Array.isArray(e) && oe(e, r);
+    e === r ? this._parentage = null : Array.isArray(e) && ne(e, r);
   }, t.prototype.remove = function(r) {
     var e = this._finalizers;
-    e && oe(e, r), r instanceof t && r._removeParent(this);
+    e && ne(e, r), r instanceof t && r._removeParent(this);
   }, t.EMPTY = (function() {
     var r = new t();
     return r.closed = !0, r;
   })(), t;
 })();
-re.EMPTY;
-function ge(t) {
-  return t instanceof re || t && "closed" in t && O(t.remove) && O(t.add) && O(t.unsubscribe);
+ee.EMPTY;
+function de(t) {
+  return t instanceof ee || t && "closed" in t && O(t.remove) && O(t.add) && O(t.unsubscribe);
 }
-function se(t) {
+function ie(t) {
   O(t) ? t() : t.unsubscribe();
 }
-var Je = {
+var We = {
   Promise: void 0
-}, Ze = {
+}, qe = {
   setTimeout: function(t, r) {
     for (var e = [], n = 2; n < arguments.length; n++)
       e[n - 2] = arguments[n];
-    return setTimeout.apply(void 0, ee([t, r], X(e)));
+    return setTimeout.apply(void 0, K([t, r], Z(e)));
   },
   clearTimeout: function(t) {
     return clearTimeout(t);
   },
   delegate: void 0
 };
-function ye(t) {
-  Ze.setTimeout(function() {
+function me(t) {
+  qe.setTimeout(function() {
     throw t;
   });
 }
-function ce() {
+function oe() {
 }
-function Ke(t) {
+function Ye(t) {
   t();
 }
-var ne = (function(t) {
-  te(r, t);
+var te = (function(t) {
+  X(r, t);
   function r(e) {
     var n = t.call(this) || this;
-    return n.isStopped = !1, e ? (n.destination = e, ge(e) && e.add(n)) : n.destination = tt, n;
+    return n.isStopped = !1, e ? (n.destination = e, de(e) && e.add(n)) : n.destination = Ze, n;
   }
   return r.create = function(e, n, i) {
-    return new G(e, n, i);
+    return new $(e, n, i);
   }, r.prototype.next = function(e) {
     this.isStopped || this._next(e);
   }, r.prototype.error = function(e) {
@@ -391,7 +388,7 @@ var ne = (function(t) {
       this.unsubscribe();
     }
   }, r;
-})(re), Xe = (function() {
+})(ee), Qe = (function() {
   function t(r) {
     this.partialObserver = r;
   }
@@ -401,7 +398,7 @@ var ne = (function(t) {
       try {
         e.next(r);
       } catch (n) {
-        $(n);
+        M(n);
       }
   }, t.prototype.error = function(r) {
     var e = this.partialObserver;
@@ -409,56 +406,56 @@ var ne = (function(t) {
       try {
         e.error(r);
       } catch (n) {
-        $(n);
+        M(n);
       }
     else
-      $(r);
+      M(r);
   }, t.prototype.complete = function() {
     var r = this.partialObserver;
     if (r.complete)
       try {
         r.complete();
       } catch (e) {
-        $(e);
+        M(e);
       }
   }, t;
-})(), G = (function(t) {
-  te(r, t);
+})(), $ = (function(t) {
+  X(r, t);
   function r(e, n, i) {
     var o = t.call(this) || this, s;
     return O(e) || !e ? s = {
       next: e ?? void 0,
       error: n ?? void 0,
       complete: i ?? void 0
-    } : s = e, o.destination = new Xe(s), o;
+    } : s = e, o.destination = new Qe(s), o;
   }
   return r;
-})(ne);
-function $(t) {
-  ye(t);
+})(te);
+function M(t) {
+  me(t);
 }
-function et(t) {
+function Je(t) {
   throw t;
 }
-var tt = {
+var Ze = {
   closed: !0,
-  next: ce,
-  error: et,
-  complete: ce
-}, ie = (function() {
+  next: oe,
+  error: Je,
+  complete: oe
+}, re = (function() {
   return typeof Symbol == "function" && Symbol.observable || "@@observable";
 })();
-function be(t) {
+function ge(t) {
   return t;
 }
-function rt(t) {
-  return t.length === 0 ? be : t.length === 1 ? t[0] : function(e) {
+function Ke(t) {
+  return t.length === 0 ? ge : t.length === 1 ? t[0] : function(e) {
     return t.reduce(function(n, i) {
       return i(n);
     }, e);
   };
 }
-var P = (function() {
+var _ = (function() {
   function t(r) {
     r && (this._subscribe = r);
   }
@@ -466,8 +463,8 @@ var P = (function() {
     var e = new t();
     return e.source = this, e.operator = r, e;
   }, t.prototype.subscribe = function(r, e, n) {
-    var i = this, o = it(r) ? r : new G(r, e, n);
-    return Ke(function() {
+    var i = this, o = et(r) ? r : new $(r, e, n);
+    return Ye(function() {
       var s = i, u = s.operator, a = s.source;
       o.add(u ? u.call(o, a) : a ? i._subscribe(o) : i._trySubscribe(o));
     }), o;
@@ -479,8 +476,8 @@ var P = (function() {
     }
   }, t.prototype.forEach = function(r, e) {
     var n = this;
-    return e = ae(e), new e(function(i, o) {
-      var s = new G({
+    return e = se(e), new e(function(i, o) {
+      var s = new $({
         next: function(u) {
           try {
             r(u);
@@ -496,15 +493,15 @@ var P = (function() {
   }, t.prototype._subscribe = function(r) {
     var e;
     return (e = this.source) === null || e === void 0 ? void 0 : e.subscribe(r);
-  }, t.prototype[ie] = function() {
+  }, t.prototype[re] = function() {
     return this;
   }, t.prototype.pipe = function() {
     for (var r = [], e = 0; e < arguments.length; e++)
       r[e] = arguments[e];
-    return rt(r)(this);
+    return Ke(r)(this);
   }, t.prototype.toPromise = function(r) {
     var e = this;
-    return r = ae(r), new r(function(n, i) {
+    return r = se(r), new r(function(n, i) {
       var o;
       e.subscribe(function(s) {
         return o = s;
@@ -518,22 +515,22 @@ var P = (function() {
     return new t(r);
   }, t;
 })();
-function ae(t) {
+function se(t) {
   var r;
-  return (r = t ?? Je.Promise) !== null && r !== void 0 ? r : Promise;
+  return (r = t ?? We.Promise) !== null && r !== void 0 ? r : Promise;
 }
-function nt(t) {
+function Xe(t) {
   return t && O(t.next) && O(t.error) && O(t.complete);
 }
-function it(t) {
-  return t && t instanceof ne || nt(t) && ge(t);
+function et(t) {
+  return t && t instanceof te || Xe(t) && de(t);
 }
-function ot(t) {
-  return O(t == null ? void 0 : t.lift);
+function tt(t) {
+  return O(t?.lift);
 }
-function N(t) {
+function R(t) {
   return function(r) {
-    if (ot(r))
+    if (tt(r))
       return r.lift(function(e) {
         try {
           return t(e, this);
@@ -544,24 +541,24 @@ function N(t) {
     throw new TypeError("Unable to lift unknown Observable type");
   };
 }
-function H(t, r, e, n, i) {
-  return new st(t, r, e, n, i);
+function L(t, r, e, n, i) {
+  return new rt(t, r, e, n, i);
 }
-var st = (function(t) {
-  te(r, t);
+var rt = (function(t) {
+  X(r, t);
   function r(e, n, i, o, s, u) {
     var a = t.call(this, e) || this;
     return a.onFinalize = s, a.shouldUnsubscribe = u, a._next = n ? function(c) {
       try {
         n(c);
-      } catch (d) {
-        e.error(d);
+      } catch (h) {
+        e.error(h);
       }
     } : t.prototype._next, a._error = o ? function(c) {
       try {
         o(c);
-      } catch (d) {
-        e.error(d);
+      } catch (h) {
+        e.error(h);
       } finally {
         this.unsubscribe();
       }
@@ -582,60 +579,60 @@ var st = (function(t) {
       t.prototype.unsubscribe.call(this), !n && ((e = this.onFinalize) === null || e === void 0 || e.call(this));
     }
   }, r;
-})(ne), ct = new P(function(t) {
+})(te), nt = new _(function(t) {
   return t.complete();
 });
-function at(t) {
+function it(t) {
   return t && O(t.schedule);
 }
-function pe(t) {
+function ye(t) {
   return t[t.length - 1];
 }
-function ut(t) {
-  return at(pe(t)) ? t.pop() : void 0;
+function ot(t) {
+  return it(ye(t)) ? t.pop() : void 0;
 }
-function ft(t, r) {
-  return typeof pe(t) == "number" ? t.pop() : r;
+function st(t, r) {
+  return typeof ye(t) == "number" ? t.pop() : r;
 }
-var we = (function(t) {
+var be = (function(t) {
   return t && typeof t.length == "number" && typeof t != "function";
 });
-function ve(t) {
-  return O(t == null ? void 0 : t.then);
+function pe(t) {
+  return O(t?.then);
 }
-function Se(t) {
-  return O(t[ie]);
+function we(t) {
+  return O(t[re]);
 }
-function xe(t) {
-  return Symbol.asyncIterator && O(t == null ? void 0 : t[Symbol.asyncIterator]);
+function ve(t) {
+  return Symbol.asyncIterator && O(t?.[Symbol.asyncIterator]);
 }
-function Ie(t) {
+function Se(t) {
   return new TypeError("You provided " + (t !== null && typeof t == "object" ? "an invalid object" : "'" + t + "'") + " where a stream was expected. You can provide an Observable, Promise, ReadableStream, Array, AsyncIterable, or Iterable.");
 }
-function lt() {
+function ct() {
   return typeof Symbol != "function" || !Symbol.iterator ? "@@iterator" : Symbol.iterator;
 }
-var Be = lt();
-function Ue(t) {
-  return O(t == null ? void 0 : t[Be]);
+var xe = ct();
+function Ie(t) {
+  return O(t?.[xe]);
 }
-function Oe(t) {
-  return Ye(this, arguments, function() {
+function Be(t) {
+  return je(this, arguments, function() {
     var e, n, i, o;
-    return de(this, function(s) {
+    return le(this, function(s) {
       switch (s.label) {
         case 0:
           e = t.getReader(), s.label = 1;
         case 1:
           s.trys.push([1, , 9, 10]), s.label = 2;
         case 2:
-          return [4, R(e.read())];
+          return [4, z(e.read())];
         case 3:
-          return n = s.sent(), i = n.value, o = n.done, o ? [4, R(void 0)] : [3, 5];
+          return n = s.sent(), i = n.value, o = n.done, o ? [4, z(void 0)] : [3, 5];
         case 4:
           return [2, s.sent()];
         case 5:
-          return [4, R(i)];
+          return [4, z(i)];
         case 6:
           return [4, s.sent()];
         case 7:
@@ -650,57 +647,57 @@ function Oe(t) {
     });
   });
 }
-function ke(t) {
-  return O(t == null ? void 0 : t.getReader);
+function Ue(t) {
+  return O(t?.getReader);
 }
-function L(t) {
-  if (t instanceof P)
+function D(t) {
+  if (t instanceof _)
     return t;
   if (t != null) {
-    if (Se(t))
-      return ht(t);
     if (we(t))
-      return dt(t);
+      return at(t);
+    if (be(t))
+      return ut(t);
+    if (pe(t))
+      return ft(t);
     if (ve(t))
-      return mt(t);
-    if (xe(t))
-      return Ee(t);
+      return Oe(t);
+    if (Ie(t))
+      return lt(t);
     if (Ue(t))
-      return gt(t);
-    if (ke(t))
-      return yt(t);
+      return ht(t);
   }
-  throw Ie(t);
+  throw Se(t);
 }
-function ht(t) {
-  return new P(function(r) {
-    var e = t[ie]();
+function at(t) {
+  return new _(function(r) {
+    var e = t[re]();
     if (O(e.subscribe))
       return e.subscribe(r);
     throw new TypeError("Provided object does not correctly implement Symbol.observable");
   });
 }
-function dt(t) {
-  return new P(function(r) {
+function ut(t) {
+  return new _(function(r) {
     for (var e = 0; e < t.length && !r.closed; e++)
       r.next(t[e]);
     r.complete();
   });
 }
-function mt(t) {
-  return new P(function(r) {
+function ft(t) {
+  return new _(function(r) {
     t.then(function(e) {
       r.closed || (r.next(e), r.complete());
     }, function(e) {
       return r.error(e);
-    }).then(null, ye);
+    }).then(null, me);
   });
 }
-function gt(t) {
-  return new P(function(r) {
+function lt(t) {
+  return new _(function(r) {
     var e, n;
     try {
-      for (var i = M(t), o = i.next(); !o.done; o = i.next()) {
+      for (var i = N(t), o = i.next(); !o.done; o = i.next()) {
         var s = o.value;
         if (r.next(s), r.closed)
           return;
@@ -717,24 +714,24 @@ function gt(t) {
     r.complete();
   });
 }
-function Ee(t) {
-  return new P(function(r) {
-    bt(t, r).catch(function(e) {
+function Oe(t) {
+  return new _(function(r) {
+    dt(t, r).catch(function(e) {
       return r.error(e);
     });
   });
 }
-function yt(t) {
-  return Ee(Oe(t));
+function ht(t) {
+  return Oe(Be(t));
 }
-function bt(t, r) {
+function dt(t, r) {
   var e, n, i, o;
-  return qe(this, void 0, void 0, function() {
+  return $e(this, void 0, void 0, function() {
     var s, u;
-    return de(this, function(a) {
+    return le(this, function(a) {
       switch (a.label) {
         case 0:
-          a.trys.push([0, 5, 6, 11]), e = Qe(t), a.label = 1;
+          a.trys.push([0, 5, 6, 11]), e = Ge(t), a.label = 1;
         case 1:
           return [4, e.next()];
         case 2:
@@ -765,7 +762,7 @@ function bt(t, r) {
     });
   });
 }
-function z(t, r, e, n, i) {
+function V(t, r, e, n, i) {
   n === void 0 && (n = 0), i === void 0 && (i = !1);
   var o = r.schedule(function() {
     e(), i ? t.add(this.schedule(null, n)) : this.unsubscribe();
@@ -773,49 +770,49 @@ function z(t, r, e, n, i) {
   if (t.add(o), !i)
     return o;
 }
-function Te(t, r) {
-  return r === void 0 && (r = 0), N(function(e, n) {
-    e.subscribe(H(n, function(i) {
-      return z(n, t, function() {
+function ke(t, r) {
+  return r === void 0 && (r = 0), R(function(e, n) {
+    e.subscribe(L(n, function(i) {
+      return V(n, t, function() {
         return n.next(i);
       }, r);
     }, function() {
-      return z(n, t, function() {
+      return V(n, t, function() {
         return n.complete();
       }, r);
     }, function(i) {
-      return z(n, t, function() {
+      return V(n, t, function() {
         return n.error(i);
       }, r);
     }));
   });
 }
-function _e(t, r) {
-  return r === void 0 && (r = 0), N(function(e, n) {
+function Ee(t, r) {
+  return r === void 0 && (r = 0), R(function(e, n) {
     n.add(t.schedule(function() {
       return e.subscribe(n);
     }, r));
   });
 }
-function pt(t, r) {
-  return L(t).pipe(_e(r), Te(r));
+function mt(t, r) {
+  return D(t).pipe(Ee(r), ke(r));
 }
-function wt(t, r) {
-  return L(t).pipe(_e(r), Te(r));
+function gt(t, r) {
+  return D(t).pipe(Ee(r), ke(r));
 }
-function vt(t, r) {
-  return new P(function(e) {
+function yt(t, r) {
+  return new _(function(e) {
     var n = 0;
     return r.schedule(function() {
       n === t.length ? e.complete() : (e.next(t[n++]), e.closed || this.schedule());
     });
   });
 }
-function St(t, r) {
-  return new P(function(e) {
+function bt(t, r) {
+  return new _(function(e) {
     var n;
-    return z(e, r, function() {
-      n = t[Be](), z(e, r, function() {
+    return V(e, r, function() {
+      n = t[xe](), V(e, r, function() {
         var i, o, s;
         try {
           i = n.next(), o = i.value, s = i.done;
@@ -826,17 +823,17 @@ function St(t, r) {
         s ? e.complete() : e.next(o);
       }, 0, !0);
     }), function() {
-      return O(n == null ? void 0 : n.return) && n.return();
+      return O(n?.return) && n.return();
     };
   });
 }
-function Ce(t, r) {
+function Te(t, r) {
   if (!t)
     throw new Error("Iterable cannot be null");
-  return new P(function(e) {
-    z(e, r, function() {
+  return new _(function(e) {
+    V(e, r, function() {
       var n = t[Symbol.asyncIterator]();
-      z(e, r, function() {
+      V(e, r, function() {
         n.next().then(function(i) {
           i.done ? e.complete() : e.next(i.value);
         });
@@ -844,132 +841,132 @@ function Ce(t, r) {
     });
   });
 }
-function xt(t, r) {
-  return Ce(Oe(t), r);
+function pt(t, r) {
+  return Te(Be(t), r);
 }
-function It(t, r) {
+function wt(t, r) {
   if (t != null) {
-    if (Se(t))
-      return pt(t, r);
     if (we(t))
-      return vt(t, r);
+      return mt(t, r);
+    if (be(t))
+      return yt(t, r);
+    if (pe(t))
+      return gt(t, r);
     if (ve(t))
-      return wt(t, r);
-    if (xe(t))
-      return Ce(t, r);
+      return Te(t, r);
+    if (Ie(t))
+      return bt(t, r);
     if (Ue(t))
-      return St(t, r);
-    if (ke(t))
-      return xt(t, r);
+      return pt(t, r);
   }
-  throw Ie(t);
+  throw Se(t);
 }
-function Bt(t, r) {
-  return r ? It(t, r) : L(t);
+function vt(t, r) {
+  return r ? wt(t, r) : D(t);
 }
-var Ut = me(function(t) {
+var St = he(function(t) {
   return function() {
     t(this), this.name = "EmptyError", this.message = "no elements in sequence";
   };
 });
-function Pe(t, r) {
+function _e(t, r) {
   return new Promise(function(e, n) {
-    var i = new G({
+    var i = new $({
       next: function(o) {
         e(o), i.unsubscribe();
       },
       error: n,
       complete: function() {
-        n(new Ut());
+        n(new St());
       }
     });
     t.subscribe(i);
   });
 }
-function Ve(t, r) {
-  return N(function(e, n) {
+function Ce(t, r) {
+  return R(function(e, n) {
     var i = 0;
-    e.subscribe(H(n, function(o) {
+    e.subscribe(L(n, function(o) {
       n.next(t.call(r, o, i++));
     }));
   });
 }
-function Ot(t, r, e, n, i, o, s, u) {
-  var a = [], c = 0, d = 0, y = !1, g = function() {
-    y && !a.length && !c && r.complete();
+function xt(t, r, e, n, i, o, s, u) {
+  var a = [], c = 0, h = 0, d = !1, b = function() {
+    d && !a.length && !c && r.complete();
   }, f = function(l) {
     return c < n ? m(l) : a.push(l);
   }, m = function(l) {
     c++;
-    var v = !1;
-    L(e(l, d++)).subscribe(H(r, function(b) {
-      r.next(b);
+    var B = !1;
+    D(e(l, h++)).subscribe(L(r, function(w) {
+      r.next(w);
     }, function() {
-      v = !0;
+      B = !0;
     }, void 0, function() {
-      if (v)
+      if (B)
         try {
           c--;
-          for (var b = function() {
+          for (var w = function() {
             var S = a.shift();
             s || m(S);
           }; a.length && c < n; )
-            b();
-          g();
+            w();
+          b();
         } catch (S) {
           r.error(S);
         }
     }));
   };
-  return t.subscribe(H(r, f, function() {
-    y = !0, g();
+  return t.subscribe(L(r, f, function() {
+    d = !0, b();
   })), function() {
   };
 }
-function Ae(t, r, e) {
-  return e === void 0 && (e = 1 / 0), O(r) ? Ae(function(n, i) {
-    return Ve(function(o, s) {
+function Pe(t, r, e) {
+  return e === void 0 && (e = 1 / 0), O(r) ? Pe(function(n, i) {
+    return Ce(function(o, s) {
       return r(n, o, i, s);
-    })(L(t(n, i)));
-  }, e) : (typeof r == "number" && (e = r), N(function(n, i) {
-    return Ot(n, i, t, e);
+    })(D(t(n, i)));
+  }, e) : (typeof r == "number" && (e = r), R(function(n, i) {
+    return xt(n, i, t, e);
   }));
 }
-function kt(t) {
-  return t === void 0 && (t = 1 / 0), Ae(be, t);
+function It(t) {
+  return t === void 0 && (t = 1 / 0), Pe(ge, t);
 }
-function Et() {
+function Bt() {
   for (var t = [], r = 0; r < arguments.length; r++)
     t[r] = arguments[r];
-  var e = ut(t), n = ft(t, 1 / 0), i = t;
-  return i.length ? i.length === 1 ? L(i[0]) : kt(n)(Bt(i, e)) : ct;
+  var e = ot(t), n = st(t, 1 / 0), i = t;
+  return i.length ? i.length === 1 ? D(i[0]) : It(n)(vt(i, e)) : nt;
 }
-function Tt(t, r, e, n, i) {
+function Ut(t, r, e, n, i) {
   return function(o, s) {
     var u = e, a = r, c = 0;
-    o.subscribe(H(s, function(d) {
-      var y = c++;
-      a = u ? t(a, d, y) : (u = !0, d);
+    o.subscribe(L(s, function(h) {
+      var d = c++;
+      a = u ? t(a, h, d) : (u = !0, h);
     }, (function() {
       u && s.next(a), s.complete();
     })));
   };
 }
-function ze(t, r) {
-  return N(Tt(t, r, arguments.length >= 2, !1, !0));
+function Ve(t, r) {
+  return R(Ut(t, r, arguments.length >= 2, !1, !0));
 }
-var _t = function(t, r) {
+var Ot = function(t, r) {
   return t.push(r), t;
 };
-function Ct() {
-  return N(function(t, r) {
-    ze(_t, [])(t).subscribe(r);
+function kt() {
+  return R(function(t, r) {
+    Ve(Ot, [])(t).subscribe(r);
   });
 }
-var Q, ue;
-function Pt() {
-  if (ue) return Q;
-  ue = 1;
+var Y, ce;
+function Et() {
+  if (ce) return Y;
+  ce = 1;
   class t {
     constructor(e = {}) {
       if (!(e.maxSize && e.maxSize > 0))
@@ -1029,13 +1026,13 @@ function Pt() {
       return this._size + e;
     }
   }
-  return Q = t, Q;
+  return Y = t, Y;
 }
-var Vt = Pt();
-const Fe = /* @__PURE__ */ je(Vt);
-class D {
+var Tt = Et();
+const Ae = /* @__PURE__ */ Le(Tt);
+class F {
+  ranges;
   constructor(r) {
-    E(this, "ranges");
     this.ranges = r;
   }
   get min() {
@@ -1054,7 +1051,7 @@ class D {
     return this.ranges.length > 1;
   }
   getRanges() {
-    return this.ranges.map((r) => new D([{ min: r.min, max: r.max }]));
+    return this.ranges.map((r) => new F([{ min: r.min, max: r.max }]));
   }
   toString() {
     return this.ranges.map((r) => `[${r.min}-${r.max}]`).join(",");
@@ -1063,21 +1060,20 @@ class D {
     const e = [...this.getRanges(), ...r.getRanges()].sort((o, s) => o.min < s.min ? -1 : o.min > s.min ? 1 : o.max < s.max ? -1 : s.max > o.max ? 1 : 0), n = [];
     let i = e[0];
     for (const o of e)
-      o.min > i.max + 1 ? (n.push(i), i = o) : o.max > i.max && (i = new D([{ min: i.min, max: o.max }]));
-    return n.push(i), n.length === 1 ? n[0] : new D(n);
+      o.min > i.max + 1 ? (n.push(i), i = o) : o.max > i.max && (i = new F([{ min: i.min, max: o.max }]));
+    return n.push(i), n.length === 1 ? n[0] : new F(n);
   }
 }
-function At(t) {
-  return $e(t.subarray(2), void 0);
+function _t(t) {
+  return Ne(t.subarray(2), void 0);
 }
-class zt extends Error {
-  constructor(e) {
-    super(e);
-    E(this, "code");
-    this.code = "ERR_ABORTED";
+class Ct extends Error {
+  code;
+  constructor(r) {
+    super(r), this.code = "ERR_ABORTED";
   }
 }
-function Ft(t) {
+function Pt(t) {
   t.sort((i, o) => i.offset - o.offset);
   const r = [];
   let e, n;
@@ -1089,30 +1085,30 @@ function Ft(t) {
     }), n = e.offset + e.length;
   return r;
 }
-function j(t) {
+function H(t) {
   if (t && t.aborted)
     if (typeof DOMException > "u") {
-      const r = new zt("aborted");
+      const r = new Ct("aborted");
       throw r.code = "ERR_ABORTED", r;
     } else
       throw new DOMException("aborted", "AbortError");
 }
-const J = typeof TextDecoder < "u" ? new TextDecoder("utf8") : void 0;
-function Z(t, r, e, n) {
+const Vt = typeof TextDecoder < "u" ? new TextDecoder("utf8") : void 0;
+function Q(t, r, e, n) {
   return t < n && r >= e;
 }
-class Re {
+class ze {
+  bbi;
+  refsByName;
+  cirTreeOffset;
+  isCompressed;
+  blockType;
+  cirTreePromise;
+  featureCache = new ue({
+    cache: new Ae({ maxSize: 1e3 }),
+    fill: async ({ length: r, offset: e }, n) => this.bbi.read(r, e, { signal: n })
+  });
   constructor(r, e, n, i, o) {
-    E(this, "bbi");
-    E(this, "refsByName");
-    E(this, "cirTreeOffset");
-    E(this, "isCompressed");
-    E(this, "blockType");
-    E(this, "cirTreePromise");
-    E(this, "featureCache", new le({
-      cache: new Fe({ maxSize: 1e3 }),
-      fill: async ({ length: r, offset: e }, n) => this.bbi.read(r, e, { signal: n })
-    }));
     if (this.bbi = r, this.refsByName = e, this.cirTreeOffset = n, this.isCompressed = i, this.blockType = o, !(n >= 0))
       throw new Error("invalid cirTreeOffset!");
   }
@@ -1122,111 +1118,111 @@ class Re {
       s === void 0 && i.complete();
       const u = { chrId: s, start: e, end: n };
       this.cirTreePromise || (this.cirTreePromise = this.bbi.read(48, this.cirTreeOffset, o));
-      const a = await this.cirTreePromise, d = new DataView(a.buffer).getUint32(4, !0);
-      let y = [], g = 0;
-      const f = (b, S, B) => {
+      const a = await this.cirTreePromise, h = new DataView(a.buffer).getUint32(4, !0);
+      let d = [], b = 0;
+      const f = (w, S, x) => {
         try {
-          const p = b.subarray(S), w = new DataView(p.buffer, p.byteOffset, p.length);
-          let h = 0;
-          const U = w.getUint8(h);
-          h += 2;
-          const T = w.getUint16(h, !0);
-          if (h += 2, U === 1) {
-            const _ = [];
+          const p = w.subarray(S), g = new DataView(p.buffer, p.byteOffset, p.length);
+          let y = 0;
+          const U = g.getUint8(y);
+          y += 2;
+          const T = g.getUint16(y, !0);
+          if (y += 2, U === 1) {
+            const k = [];
             for (let I = 0; I < T; I++) {
-              const k = w.getUint32(h, !0);
-              h += 4;
-              const C = w.getUint32(h, !0);
-              h += 4;
-              const V = w.getUint32(h, !0);
-              h += 4;
-              const A = w.getUint32(h, !0);
-              h += 4;
-              const W = Number(w.getBigUint64(h, !0));
-              h += 8;
-              const q = Number(w.getBigUint64(h, !0));
-              h += 8, _.push({
-                startChrom: k,
+              const E = g.getUint32(y, !0);
+              y += 4;
+              const C = g.getUint32(y, !0);
+              y += 4;
+              const P = g.getUint32(y, !0);
+              y += 4;
+              const j = g.getUint32(y, !0);
+              y += 4;
+              const G = Number(g.getBigUint64(y, !0));
+              y += 8;
+              const W = Number(g.getBigUint64(y, !0));
+              y += 8, k.push({
+                startChrom: E,
                 startBase: C,
-                endBase: A,
-                endChrom: V,
-                blockOffset: W,
-                blockSize: q,
-                offset: h
+                endBase: j,
+                endChrom: P,
+                blockOffset: G,
+                blockSize: W,
+                offset: y
               });
             }
-            y = y.concat(_.filter((I) => m(I)).map((I) => ({
+            d = d.concat(k.filter((I) => m(I)).map((I) => ({
               offset: I.blockOffset,
               length: I.blockSize
             })));
           } else if (U === 0) {
-            const _ = [];
-            for (let k = 0; k < T; k++) {
-              const C = w.getUint32(h, !0);
-              h += 4;
-              const V = w.getUint32(h, !0);
-              h += 4;
-              const A = w.getUint32(h, !0);
-              h += 4;
-              const W = w.getUint32(h, !0);
-              h += 4;
-              const q = Number(w.getBigUint64(h, !0));
-              h += 8, _.push({
+            const k = [];
+            for (let E = 0; E < T; E++) {
+              const C = g.getUint32(y, !0);
+              y += 4;
+              const P = g.getUint32(y, !0);
+              y += 4;
+              const j = g.getUint32(y, !0);
+              y += 4;
+              const G = g.getUint32(y, !0);
+              y += 4;
+              const W = Number(g.getBigUint64(y, !0));
+              y += 8, k.push({
                 startChrom: C,
-                startBase: V,
-                endChrom: A,
-                endBase: W,
-                blockOffset: q,
-                offset: h
+                startBase: P,
+                endChrom: j,
+                endBase: G,
+                blockOffset: W,
+                offset: y
               });
             }
-            const I = _.filter((k) => m(k)).map((k) => k.blockOffset);
-            I.length > 0 && v(I, B + 1);
+            const I = k.filter((E) => m(E)).map((E) => E.blockOffset);
+            I.length > 0 && B(I, x + 1);
           }
-        } catch (x) {
-          i.error(x);
+        } catch (v) {
+          i.error(v);
         }
-      }, m = (b) => {
-        const { startChrom: S, startBase: B, endChrom: x, endBase: p } = b;
-        return (S < s || S === s && B <= n) && (x > s || x === s && p >= e);
-      }, l = async (b, S, B) => {
+      }, m = (w) => {
+        const { startChrom: S, startBase: x, endChrom: v, endBase: p } = w;
+        return (S < s || S === s && x <= n) && (v > s || v === s && p >= e);
+      }, l = async (w, S, x) => {
         try {
-          const x = S.max - S.min, p = S.min, w = await this.featureCache.get(`${x}_${p}`, { length: x, offset: p }, o == null ? void 0 : o.signal);
-          for (const h of b)
-            S.contains(h) && (f(w, h - p, B), g -= 1, g === 0 && this.readFeatures(i, y, {
+          const v = S.max - S.min, p = S.min, g = await this.featureCache.get(`${v}_${p}`, { length: v, offset: p }, o?.signal);
+          for (const y of w)
+            S.contains(y) && (f(g, y - p, x), b -= 1, b === 0 && this.readFeatures(i, d, {
               ...o,
               request: u
             }).catch((U) => {
               i.error(U);
             }));
-        } catch (x) {
-          i.error(x);
+        } catch (v) {
+          i.error(v);
         }
-      }, v = (b, S) => {
+      }, B = (w, S) => {
         try {
-          g += b.length;
-          const B = 4 + d * 32;
-          let x = new D([
+          b += w.length;
+          const x = 4 + h * 32;
+          let v = new F([
             {
-              min: b[0],
-              max: b[0] + B
+              min: w[0],
+              max: w[0] + x
             }
           ]);
-          for (let p = 1; p < b.length; p += 1) {
-            const w = new D([
+          for (let p = 1; p < w.length; p += 1) {
+            const g = new F([
               {
-                min: b[p],
-                max: b[p] + B
+                min: w[p],
+                max: w[p] + x
               }
             ]);
-            x = x.union(w);
+            v = v.union(g);
           }
-          x.getRanges().map((p) => l(b, p, S));
-        } catch (B) {
-          i.error(B);
+          v.getRanges().map((p) => l(w, p, S));
+        } catch (x) {
+          i.error(x);
         }
       };
-      v([this.cirTreeOffset + 48], 1);
+      B([this.cirTreeOffset + 48], 1);
       return;
     } catch (s) {
       i.error(s);
@@ -1243,20 +1239,20 @@ class Re {
       o += 4;
       const c = s.getUint32(o, !0);
       o += 4;
-      const d = s.getUint32(o, !0);
+      const h = s.getUint32(o, !0);
       o += 4;
-      const y = s.getFloat32(o, !0);
+      const d = s.getFloat32(o, !0);
       o += 4;
-      const g = s.getFloat32(o, !0);
+      const b = s.getFloat32(o, !0);
       o += 4;
       const f = s.getFloat32(o, !0);
-      o += 4, o += 4, (!n || u === n.chrId && Z(a, c, n.start, n.end)) && i.push({
+      o += 4, o += 4, (!n || u === n.chrId && Q(a, c, n.start, n.end)) && i.push({
         start: a,
         end: c,
-        maxScore: g,
-        minScore: y,
+        maxScore: b,
+        minScore: d,
         summary: !0,
-        score: f / (d || 1)
+        score: f / (h || 1)
       });
     }
     return i;
@@ -1266,25 +1262,25 @@ class Re {
     let s = e;
     const u = r, a = new DataView(u.buffer, u.byteOffset, u.length);
     for (; s < r.byteLength; ) {
-      const c = s, d = a.getUint32(s, !0);
+      const c = s, h = a.getUint32(s, !0);
       s += 4;
-      const y = a.getInt32(s, !0);
+      const d = a.getInt32(s, !0);
       s += 4;
-      const g = a.getInt32(s, !0);
+      const b = a.getInt32(s, !0);
       s += 4;
       let f = s;
       for (; f < r.length && r[f] !== 0; f++)
         ;
-      const m = r.subarray(s, f), l = (J == null ? void 0 : J.decode(m)) ?? m.toString();
+      const m = r.subarray(s, f), l = Vt?.decode(m) ?? m.toString();
       s = f + 1, o.push({
-        chromId: d,
-        start: y,
-        end: g,
+        chromId: h,
+        start: d,
+        end: b,
         rest: l,
         uniqueId: `bb-${n + c}`
       });
     }
-    return i ? o.filter((c) => Z(c.start, c.end, i.start, i.end)) : o;
+    return i ? o.filter((c) => Q(c.start, c.end, i.start, i.end)) : o;
   }
   parseBigWigBlock(r, e, n) {
     const i = r.subarray(e), o = new DataView(i.buffer, i.byteOffset, i.length);
@@ -1296,33 +1292,33 @@ class Re {
     s += 4;
     const c = o.getUint32(s, !0);
     s += 4;
-    const d = o.getUint8(s);
+    const h = o.getUint8(s);
     s += 2;
-    const y = o.getUint16(s, !0);
+    const d = o.getUint16(s, !0);
     s += 2;
-    const g = new Array(y);
-    switch (d) {
+    const b = new Array(d);
+    switch (h) {
       case 1: {
-        for (let f = 0; f < y; f++) {
+        for (let f = 0; f < d; f++) {
           const m = o.getInt32(s, !0);
           s += 4;
           const l = o.getInt32(s, !0);
           s += 4;
-          const v = o.getFloat32(s, !0);
-          s += 4, g[f] = {
+          const B = o.getFloat32(s, !0);
+          s += 4, b[f] = {
             start: m,
             end: l,
-            score: v
+            score: B
           };
         }
         break;
       }
       case 2: {
-        for (let f = 0; f < y; f++) {
+        for (let f = 0; f < d; f++) {
           const m = o.getInt32(s, !0);
           s += 4;
           const l = o.getFloat32(s, !0);
-          s += 4, g[f] = {
+          s += 4, b[f] = {
             score: l,
             start: m,
             end: m + c
@@ -1331,11 +1327,11 @@ class Re {
         break;
       }
       case 3: {
-        for (let f = 0; f < y; f++) {
+        for (let f = 0; f < d; f++) {
           const m = o.getFloat32(s, !0);
           s += 4;
           const l = u + f * a;
-          g[f] = {
+          b[f] = {
             score: m,
             start: l,
             end: l + c
@@ -1344,18 +1340,18 @@ class Re {
         break;
       }
     }
-    return n ? g.filter((f) => Z(f.start, f.end, n.start, n.end)) : g;
+    return n ? b.filter((f) => Q(f.start, f.end, n.start, n.end)) : b;
   }
   async readFeatures(r, e, n = {}) {
     try {
-      const { blockType: i, isCompressed: o } = this, { signal: s, request: u } = n, a = Ft(e);
-      j(s), await Promise.all(a.map(async (c) => {
-        j(s);
-        const { length: d, offset: y } = c, g = await this.featureCache.get(`${d}_${y}`, c, s);
+      const { blockType: i, isCompressed: o } = this, { signal: s, request: u } = n, a = Pt(e);
+      H(s), await Promise.all(a.map(async (c) => {
+        H(s);
+        const { length: h, offset: d } = c, b = await this.featureCache.get(`${h}_${d}`, c, s);
         for (const f of c.blocks) {
-          j(s);
-          let m = g.subarray(f.offset - c.offset);
-          switch (o && (m = At(m)), j(s), i) {
+          H(s);
+          let m = b.subarray(f.offset - c.offset);
+          switch (o && (m = _t(m)), H(s), i) {
             case "summary": {
               r.next(this.parseSummaryBlock(m, 0, u));
               break;
@@ -1378,11 +1374,19 @@ class Re {
     }
   }
 }
-const Rt = -2003829722, fe = -2021002517;
-function F(t) {
+const At = -2003829722, ae = -2021002517;
+function A(t) {
   return new DataView(t.buffer, t.byteOffset, t.length);
 }
-class De {
+class Fe {
+  bbi;
+  headerP;
+  renameRefSeqs;
+  getHeader(r) {
+    return this.headerP || (this.headerP = this._getHeader(r).catch((e) => {
+      throw this.headerP = void 0, e;
+    })), this.headerP;
+  }
   /*
    * @param filehandle - a filehandle from generic-filehandle2
    *
@@ -1394,24 +1398,16 @@ class De {
    * sequences using a mapping function
    */
   constructor(r) {
-    E(this, "bbi");
-    E(this, "headerP");
-    E(this, "renameRefSeqs");
     const { filehandle: e, renameRefSeqs: n = (s) => s, path: i, url: o } = r;
     if (this.renameRefSeqs = n, e)
       this.bbi = e;
     else if (o)
-      this.bbi = new Me(o);
+      this.bbi = new Re(o);
     else if (i)
-      this.bbi = new He(i);
+      this.bbi = new De(i);
     else
       throw new Error("no file given");
   }
-  getHeader(r) {
-    return this.headerP || (this.headerP = this._getHeader(r).catch((e) => {
-      throw this.headerP = void 0, e;
-    })), this.headerP;
-  }
   async _getHeader(r) {
     const e = await this._getMainHeader(r), n = await this._readChromTree(e, r);
     return {
@@ -1420,8 +1416,8 @@ class De {
     };
   }
   async _getMainHeader(r, e = 2e3) {
-    const n = await this.bbi.read(e, 0, r), i = F(n), o = i.getInt32(0, !0);
-    if (o !== Rt && o !== fe)
+    const n = await this.bbi.read(e, 0, r), i = A(n), o = i.getInt32(0, !0);
+    if (o !== At && o !== ae)
       throw new Error("not a BigWig/BigBed file");
     let s = 0;
     const u = i.getInt32(s, !0);
@@ -1430,11 +1426,11 @@ class De {
     s += 2;
     const c = i.getUint16(s, !0);
     s += 2;
-    const d = Number(i.getBigUint64(s, !0));
+    const h = Number(i.getBigUint64(s, !0));
     s += 8;
-    const y = Number(i.getBigUint64(s, !0));
+    const d = Number(i.getBigUint64(s, !0));
     s += 8;
-    const g = Number(i.getBigUint64(s, !0));
+    const b = Number(i.getBigUint64(s, !0));
     s += 8;
     const f = i.getUint16(s, !0);
     s += 2;
@@ -1442,114 +1438,114 @@ class De {
     s += 2;
     const l = Number(i.getBigUint64(s, !0));
     s += 8;
-    const v = Number(i.getBigUint64(s, !0));
+    const B = Number(i.getBigUint64(s, !0));
     s += 8;
-    const b = i.getUint32(s, !0);
+    const w = i.getUint32(s, !0);
     s += 4;
     const S = Number(i.getBigUint64(s, !0));
     s += 8;
-    const B = [];
-    for (let h = 0; h < c; h++) {
+    const x = [];
+    for (let y = 0; y < c; y++) {
       const U = i.getUint32(s, !0);
       s += 4;
       const T = i.getUint32(s, !0);
       s += 4;
-      const _ = Number(i.getBigUint64(s, !0));
+      const k = Number(i.getBigUint64(s, !0));
       s += 8;
       const I = Number(i.getBigUint64(s, !0));
-      s += 8, B.push({
+      s += 8, x.push({
         reductionLevel: U,
         reserved: T,
-        dataOffset: _,
+        dataOffset: k,
         indexOffset: I
       });
     }
-    const x = u === fe ? "bigbed" : "bigwig";
-    if (l > e || v > e - 40)
+    const v = u === ae ? "bigbed" : "bigwig";
+    if (l > e || B > e - 40)
       return this._getMainHeader(r, e * 2);
     let p;
-    if (v) {
-      const h = n.subarray(v);
+    if (B) {
+      const y = n.subarray(B);
       let U = 0;
-      const T = F(h), _ = Number(T.getBigUint64(U, !0));
+      const T = A(y), k = Number(T.getBigUint64(U, !0));
       U += 8;
       const I = T.getFloat64(U, !0);
       U += 8;
-      const k = T.getFloat64(U, !0);
+      const E = T.getFloat64(U, !0);
       U += 8;
       const C = T.getFloat64(U, !0);
       U += 8;
-      const V = T.getFloat64(U, !0);
+      const P = T.getFloat64(U, !0);
       U += 8, p = {
         scoreMin: I,
-        scoreMax: k,
+        scoreMax: E,
         scoreSum: C,
-        scoreSumSquares: V,
-        basesCovered: _
+        scoreSumSquares: P,
+        basesCovered: k
       };
     } else
       throw new Error("no stats");
-    const w = new TextDecoder("utf8");
+    const g = new TextDecoder("utf8");
     return {
-      zoomLevels: B,
+      zoomLevels: x,
       magic: u,
       extHeaderOffset: S,
       numZoomLevels: c,
       fieldCount: f,
       totalSummary: p,
       definedFieldCount: m,
-      uncompressBufSize: b,
+      uncompressBufSize: w,
       asOffset: l,
-      chromTreeOffset: d,
-      totalSummaryOffset: v,
-      unzoomedDataOffset: y,
-      unzoomedIndexOffset: g,
-      fileType: x,
+      chromTreeOffset: h,
+      totalSummaryOffset: B,
+      unzoomedDataOffset: d,
+      unzoomedIndexOffset: b,
+      fileType: v,
       version: a,
-      autoSql: l ? w.decode(n.subarray(l, n.indexOf(0, l))) : ""
+      autoSql: l ? g.decode(n.subarray(l, n.indexOf(0, l))) : ""
     };
   }
   async _readChromTree(r, e) {
-    const n = [], i = {}, o = r.chromTreeOffset, s = F(await this.bbi.read(32, o, e));
+    const n = [], i = {}, o = r.chromTreeOffset, s = A(await this.bbi.read(32, o, e));
     let u = 0;
     u += 4, u += 4;
     const a = s.getUint32(u, !0);
     u += 4;
     const c = s.getUint32(u, !0);
     u += 4, u += 8;
-    const d = new TextDecoder("utf8"), y = async (g) => {
-      const f = await this.bbi.read(4, g), m = F(f);
+    const h = new TextDecoder("utf8"), d = async (b) => {
+      const f = await this.bbi.read(4, b), m = A(f);
       let l = 0;
-      const v = m.getUint8(l);
+      const B = m.getUint8(l);
       l += 1, l += 1;
-      const b = m.getUint16(l, !0);
-      if (l += 2, v) {
-        const S = await this.bbi.read(b * (a + c), g + l), B = F(S);
+      const w = m.getUint16(l, !0);
+      if (l += 2, B) {
+        const S = await this.bbi.read(w * (a + c), b + l), x = A(S);
         l = 0;
-        for (let x = 0; x < b; x++) {
-          const p = d.decode(S.subarray(l, l + a)).replaceAll("\0", "");
+        for (let v = 0; v < w; v++) {
+          const p = h.decode(S.subarray(l, l + a)).replaceAll("\0", "");
           l += a;
-          const w = B.getUint32(l, !0);
+          const g = x.getUint32(l, !0);
           l += 4;
-          const h = B.getUint32(l, !0);
-          l += 4, i[this.renameRefSeqs(p)] = w, n[w] = {
+          const y = x.getUint32(l, !0);
+          l += 4, i[this.renameRefSeqs(p)] = g, n[g] = {
             name: p,
-            id: w,
-            length: h
+            id: g,
+            length: y
           };
         }
       } else {
-        const S = [], B = F(await this.bbi.read(b * (a + 8), g + l));
+        const S = [], x = A(await this.bbi.read(w * (a + 8), b + l));
         l = 0;
-        for (let x = 0; x < b; x++) {
+        for (let v = 0; v < w; v++) {
           l += a;
-          const p = Number(B.getBigUint64(l, !0));
-          l += 8, S.push(y(p));
+          const p = Number(x.getBigUint64(l, !0));
+          l += 8, S.push(d(p));
         }
         await Promise.all(S);
       }
     };
-    return await y(o + 32), {
+    return await d(o + 32), {
       refsByName: i,
       refsByNumber: n
     };
@@ -1560,7 +1556,7 @@ class De {
    */
   async getUnzoomedView(r) {
     const { unzoomedIndexOffset: e, refsByName: n, uncompressBufSize: i, fileType: o } = await this.getHeader(r);
-    return new Re(this.bbi, n, e, i > 0, o);
+    return new ze(this.bbi, n, e, i > 0, o);
   }
   /**
    * Gets features from a BigWig file
@@ -1579,18 +1575,18 @@ class De {
     const o = this.renameRefSeqs(r);
     let s;
     const { basesPerSpan: u, scale: a } = i || {};
-    return u ? s = await this.getView(1 / u, i) : a ? s = await this.getView(a, i) : s = await this.getView(1, i), new P((c) => {
-      s.readWigData(o, e, n, c, i).catch((d) => {
-        c.error(d);
+    return u ? s = await this.getView(1 / u, i) : a ? s = await this.getView(a, i) : s = await this.getView(1, i), new _((c) => {
+      s.readWigData(o, e, n, c, i).catch((h) => {
+        c.error(h);
       });
     });
   }
   async getFeatures(r, e, n, i) {
     const o = await this.getFeatureStream(r, e, n, i);
-    return (await Pe(o.pipe(Ct()))).flat();
+    return (await _e(o.pipe(kt()))).flat();
   }
 }
-class $t extends De {
+class Nt extends Fe {
   /**
    * Retrieves a BlockView of a specific zoomLevel
    *
@@ -1604,31 +1600,28 @@ class $t extends De {
     for (let a = u; a >= 0; a -= 1) {
       const c = n[a];
       if (c && c.reductionLevel <= 2 * s)
-        return new Re(this.bbi, i, c.indexOffset, o > 0, "summary");
+        return new ze(this.bbi, i, c.indexOffset, o > 0, "summary");
     }
     return this.getUnzoomedView(e);
   }
 }
-function Dt(t) {
+function zt(t) {
   return t.filter((r) => !!r);
 }
-class jt extends De {
-  constructor() {
-    super(...arguments);
-    E(this, "readIndicesCache", new le({
-      cache: new Fe({ maxSize: 1 }),
-      fill: (e, n) => this._readIndices({ ...e, signal: n })
-    }));
-  }
-  readIndices(e = {}) {
-    const { signal: n, ...i } = e;
-    return this.readIndicesCache.get(JSON.stringify(i), e, n);
+class Lt extends Fe {
+  readIndicesCache = new ue({
+    cache: new Ae({ maxSize: 1 }),
+    fill: (r, e) => this._readIndices({ ...r, signal: e })
+  });
+  readIndices(r = {}) {
+    const { signal: e, ...n } = r;
+    return this.readIndicesCache.get(JSON.stringify(n), r, e);
   }
   /*
    * retrieve unzoomed view for any scale
    */
-  async getView(e, n) {
-    return this.getUnzoomedView(n);
+  async getView(r, e) {
+    return this.getUnzoomedView(e);
   }
   /*
    * parse the bigbed extraIndex fields
@@ -1637,34 +1630,34 @@ class jt extends De {
    * @return a Promise for an array of Index data structure since there can be
    * multiple extraIndexes in a bigbed, see bedToBigBed documentation
    */
-  async _readIndices(e) {
-    const { extHeaderOffset: n } = await this.getHeader(e), i = await this.bbi.read(64, n), o = new DataView(i.buffer, i.byteOffset, i.length);
-    let s = 0;
-    s += 2;
-    const u = o.getUint16(s, !0);
-    s += 2;
-    const a = Number(o.getBigUint64(s, !0));
-    if (s += 8, u === 0)
+  async _readIndices(r) {
+    const { extHeaderOffset: e } = await this.getHeader(r), n = await this.bbi.read(64, e), i = new DataView(n.buffer, n.byteOffset, n.length);
+    let o = 0;
+    o += 2;
+    const s = i.getUint16(o, !0);
+    o += 2;
+    const u = Number(i.getBigUint64(o, !0));
+    if (o += 8, s === 0)
       return [];
-    const c = 20, d = c * u, y = await this.bbi.read(d, a), g = [];
-    for (let f = 0; f < u; f += 1) {
-      const m = y.subarray(f * c), l = new DataView(m.buffer, m.byteOffset, m.length);
-      let v = 0;
-      const b = l.getInt16(v, !0);
-      v += 2;
-      const S = l.getInt16(v, !0);
-      v += 2;
-      const B = Number(l.getBigUint64(v, !0));
-      v += 12;
-      const x = l.getInt16(v, !0);
-      g.push({
-        type: b,
-        fieldcount: S,
-        offset: B,
+    const a = 20, c = a * s, h = await this.bbi.read(c, u), d = [];
+    for (let b = 0; b < s; b += 1) {
+      const f = h.subarray(b * a), m = new DataView(f.buffer, f.byteOffset, f.length);
+      let l = 0;
+      const B = m.getInt16(l, !0);
+      l += 2;
+      const w = m.getInt16(l, !0);
+      l += 2;
+      const S = Number(m.getBigUint64(l, !0));
+      l += 12;
+      const x = m.getInt16(l, !0);
+      d.push({
+        type: B,
+        fieldcount: w,
+        offset: S,
         field: x
       });
     }
-    return g;
+    return d;
   }
   /*
    * perform a search in the bigbed extraIndex to find which blocks in the
@@ -1676,74 +1669,74 @@ class jt extends De {
    *
    * @return a Promise for an array of bigbed block Loc entries
    */
-  async searchExtraIndexBlocks(e, n = {}) {
-    const i = await this.readIndices(n);
-    if (i.length === 0)
+  async searchExtraIndexBlocks(r, e = {}) {
+    const n = await this.readIndices(e);
+    if (n.length === 0)
       return [];
-    const o = new TextDecoder("utf8"), s = i.map(async (u) => {
-      const { offset: a, field: c } = u, d = await this.bbi.read(32, a, n), y = new DataView(d.buffer, d.byteOffset, d.length);
-      let g = 0;
-      g += 4;
-      const f = y.getInt32(g, !0);
-      g += 4;
-      const m = y.getInt32(g, !0);
-      g += 4;
-      const l = y.getInt32(g, !0);
-      g += 4, g += 8;
-      const v = async (b) => {
-        const S = b, B = 4 + f * (m + l), p = await this.bbi.read(B, S, n), w = new DataView(p.buffer, p.byteOffset, p.length);
-        let h = 0;
-        const U = w.getInt8(h);
-        h += 2;
-        const T = w.getInt16(h, !0);
-        h += 2;
-        const _ = [];
-        if (U === 0) {
-          const I = [];
-          for (let C = 0; C < T; C++) {
-            const V = o.decode(p.subarray(h, h + m)).replaceAll("\0", "");
-            h += m;
-            const A = Number(w.getBigUint64(h, !0));
-            h += 8, I.push({
-              key: V,
-              offset: A
+    const i = new TextDecoder("utf8"), o = n.map(async (s) => {
+      const { offset: u, field: a } = s, c = await this.bbi.read(32, u, e), h = new DataView(c.buffer, c.byteOffset, c.length);
+      let d = 0;
+      d += 4;
+      const b = h.getInt32(d, !0);
+      d += 4;
+      const f = h.getInt32(d, !0);
+      d += 4;
+      const m = h.getInt32(d, !0);
+      d += 4, d += 8;
+      const l = async (B) => {
+        const w = B, S = 4 + b * (f + m), v = await this.bbi.read(S, w, e), p = new DataView(v.buffer, v.byteOffset, v.length);
+        let g = 0;
+        const y = p.getInt8(g);
+        g += 2;
+        const U = p.getInt16(g, !0);
+        g += 2;
+        const T = [];
+        if (y === 0) {
+          const k = [];
+          for (let E = 0; E < U; E++) {
+            const C = i.decode(v.subarray(g, g + f)).replaceAll("\0", "");
+            g += f;
+            const P = Number(p.getBigUint64(g, !0));
+            g += 8, k.push({
+              key: C,
+              offset: P
             });
           }
-          let k = 0;
-          for (const { key: C, offset: V } of I) {
-            if (e.localeCompare(C) < 0 && k)
-              return v(k);
-            k = V;
+          let I = 0;
+          for (const { key: E, offset: C } of k) {
+            if (r.localeCompare(E) < 0 && I)
+              return l(I);
+            I = C;
           }
-          return v(k);
-        } else if (U === 1) {
-          for (let I = 0; I < T; I++) {
-            const k = o.decode(p.subarray(h, h + m)).replaceAll("\0", "");
-            h += m;
-            const C = Number(w.getBigUint64(h, !0));
-            h += 8;
-            const V = w.getUint32(h, !0);
-            h += 4;
-            const A = w.getUint32(h, !0);
-            h += 4, _.push({
-              key: k,
-              offset: C,
-              length: V,
-              reserved: A
+          return l(I);
+        } else if (y === 1) {
+          for (let k = 0; k < U; k++) {
+            const I = i.decode(v.subarray(g, g + f)).replaceAll("\0", "");
+            g += f;
+            const E = Number(p.getBigUint64(g, !0));
+            g += 8;
+            const C = p.getUint32(g, !0);
+            g += 4;
+            const P = p.getUint32(g, !0);
+            g += 4, T.push({
+              key: I,
+              offset: E,
+              length: C,
+              reserved: P
             });
           }
-          for (const I of _)
-            if (I.key === e)
+          for (const k of T)
+            if (k.key === r)
               return {
-                ...I,
-                field: c
+                ...k,
+                field: a
               };
           return;
         }
       };
-      return v(a + 32);
+      return l(u + 32);
     });
-    return Dt(await Promise.all(s));
+    return zt(await Promise.all(o));
   }
   /*
    * retrieve the features from the bigbed data that were found through the
@@ -1756,26 +1749,23 @@ class jt extends De {
    *
    * @return array of Feature
    */
-  async searchExtraIndex(e, n = {}) {
-    const i = await this.searchExtraIndexBlocks(e, n);
-    if (i.length === 0)
+  async searchExtraIndex(r, e = {}) {
+    const n = await this.searchExtraIndexBlocks(r, e);
+    if (n.length === 0)
       return [];
-    const o = await this.getUnzoomedView(n), s = i.map((a) => new P((c) => {
-      o.readFeatures(c, [a], n).catch((d) => {
-        c.error(d);
+    const i = await this.getUnzoomedView(e), o = n.map((u) => new _((a) => {
+      i.readFeatures(a, [u], e).catch((c) => {
+        a.error(c);
       });
-    }).pipe(ze((c, d) => c.concat(d)), Ve((c) => {
-      for (const d of c)
-        d.field = a.field;
-      return c;
+    }).pipe(Ve((a, c) => a.concat(c)), Ce((a) => {
+      for (const c of a)
+        c.field = u.field;
+      return a;
     })));
-    return (await Pe(Et(...s))).filter((a) => {
-      var c;
-      return ((c = a.rest) == null ? void 0 : c.split("	")[(a.field || 0) - 3]) === e;
-    });
+    return (await _e(Bt(...o))).filter((u) => u.rest?.split("	")[(u.field || 0) - 3] === r);
   }
 }
 export {
-  jt as BigBed,
-  $t as BigWig
+  Lt as BigBed,
+  Nt as BigWig
 };