@genome-spy/app 0.53.0 → 0.54.0

package/dist/{index-BywMLhhd.js → index-COovE1Oo.js}

@@ -1,7 +1,7 @@
-import { b as J } from "./index-B5cesONJ.js";
-import { _ as Gn, L as Yn } from "./index-uO0O4Uv-.js";
+import { b as J } from "./index-B6haPltu.js";
+import { _ as Gn, L as Yn } from "./index-BhtH2nrr.js";
 import { L as nr } from "./__vite-browser-external-C--ziKoh.js";
-import { R as ir } from "./remoteFile-BkTxwFub.js";
+import { R as ir } from "./remoteFile-DuIsnepi.js";
 const st = BigInt(32);
 function rr(e, n, t) {
   const i = +!!t, a = +!t;
@@ -481,8 +481,7 @@ class N {
     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;
-    } else
-      this.type === "seek" ? n = this.options.length : this.type === "nest" ? n = this.options.type.sizeOf() : this.type || (n = 0);
+    } 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;
   }
   // Follow the parser chain till the root and start parsing from there
@@ -625,8 +624,7 @@ class N {
     } else if (this.options.length) {
       const l = n.generateOption(this.options.length);
       n.pushCode(r ? `${t} = Array.from(buffer.subarray(offset, offset + ${l}), ${o}).join('');` : `${t} = new TextDecoder('${a}').decode(buffer.subarray(offset, offset + ${l}));`), n.pushCode(`offset += ${l};`);
-    } else
-      this.options.zeroTerminated ? (n.pushCode(`var ${i} = offset;`), n.pushCode("while(dataView.getUint8(offset++) !== 0);"), n.pushCode(r ? `${t} = Array.from(buffer.subarray(${i}, offset - 1), ${o}).join('');` : `${t} = new TextDecoder('${a}').decode(buffer.subarray(${i}, offset - 1));`)) : this.options.greedy && (n.pushCode(`var ${i} = offset;`), n.pushCode("while(buffer.length > offset++);"), n.pushCode(r ? `${t} = Array.from(buffer.subarray(${i}, offset), ${o}).join('');` : `${t} = new TextDecoder('${a}').decode(buffer.subarray(${i}, offset));`));
+    } else this.options.zeroTerminated ? (n.pushCode(`var ${i} = offset;`), n.pushCode("while(dataView.getUint8(offset++) !== 0);"), n.pushCode(r ? `${t} = Array.from(buffer.subarray(${i}, offset - 1), ${o}).join('');` : `${t} = new TextDecoder('${a}').decode(buffer.subarray(${i}, offset - 1));`)) : this.options.greedy && (n.pushCode(`var ${i} = offset;`), n.pushCode("while(buffer.length > offset++);"), n.pushCode(r ? `${t} = Array.from(buffer.subarray(${i}, offset), ${o}).join('');` : `${t} = new TextDecoder('${a}').decode(buffer.subarray(${i}, offset));`));
     this.options.stripNull && n.pushCode(`${t} = ${t}.replace(/\\x00+$/g, '')`);
   }
   generateBuffer(n) {
@@ -678,8 +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 N && (n.pushPath(t), i.generate(n), n.popPath(t));
   }
   generateChoice(n) {
     const t = n.generateOption(this.options.tag), i = n.generateVariable(this.varName);
@@ -984,8 +981,7 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
         do
           j(e, r, e.bl_tree);
         while (--l !== 0);
-      else
-        r !== 0 ? (r !== a && (j(e, r, e.bl_tree), l--), j(e, Xn, e.bl_tree), D(e, l - 3, 2)) : l <= 10 ? (j(e, qn, e.bl_tree), D(e, l - 3, 3)) : (j(e, Jn, e.bl_tree), D(e, l - 11, 7));
+      else r !== 0 ? (r !== a && (j(e, r, e.bl_tree), l--), j(e, Xn, e.bl_tree), D(e, l - 3, 2)) : l <= 10 ? (j(e, qn, e.bl_tree), D(e, l - 3, 3)) : (j(e, Jn, e.bl_tree), D(e, l - 11, 7));
       l = 0, a = r, o === 0 ? (u = 138, s = 3) : r === o ? (u = 6, s = 3) : (u = 7, s = 4);
     }
 }, vr = (e) => {
@@ -1623,8 +1619,7 @@ Gt.prototype.push = function(e, n) {
       this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0;
       continue;
     }
-    if (t.avail_in === 0)
-      break;
+    if (t.avail_in === 0) break;
   }
   return !0;
 };
@@ -2055,8 +2050,7 @@ const so = (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;
-          } else
-            t.head && (t.head.extra = null);
+          } else t.head && (t.head.extra = null);
           t.mode = yn;
         case yn:
           if (t.flags & 1024 && (h = t.length, h > l && (h = l), h && (t.head && (b = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
@@ -2081,8 +2075,7 @@ const so = (e) => {
             while (b && h < l);
             if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, r)), l -= h, r += h, b)
               break e;
-          } else
-            t.head && (t.head.name = null);
+          } else t.head && (t.head.name = null);
           t.length = 0, t.mode = kn;
         case kn:
           if (t.flags & 4096) {
@@ -2094,8 +2087,7 @@ const so = (e) => {
             while (b && h < l);
             if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, r)), l -= h, r += h, b)
               break e;
-          } else
-            t.head && (t.head.comment = null);
+          } else t.head && (t.head.comment = null);
           t.mode = $n;
         case $n:
           if (t.flags & 512) {
@@ -2466,8 +2458,7 @@ function He(e) {
 He.prototype.push = function(e, n) {
   const t = this.strm, i = this.options.chunkSize, a = this.options.dictionary;
   let r, o, l;
-  if (this.ended)
-    return !1;
+  if (this.ended) return !1;
   for (n === ~~n ? o = n : o = n === !0 ? So : Co, Ii.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
     for (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), r = X.inflate(t, o), r === Et && a && (r = X.inflateSetDictionary(t, a), r === Fe ? r = X.inflate(t, o) : r === Ln && (r = Et)); t.avail_in > 0 && r === $t && t.state.wrap > 0 && e[t.next_in] !== 0; )
       X.inflateReset(t), r = X.inflate(t, o);
@@ -2487,8 +2478,7 @@ He.prototype.push = function(e, n) {
     if (!(r === Fe && l === 0)) {
       if (r === $t)
         return r = X.inflateEnd(this.strm), this.onEnd(r), this.ended = !0, !0;
-      if (t.avail_in === 0)
-        break;
+      if (t.avail_in === 0) break;
     }
   }
   return !0;
@@ -2501,8 +2491,7 @@ He.prototype.onEnd = function(e) {
 };
 function Yt(e, n) {
   const t = new He(n);
-  if (t.push(e), t.err)
-    throw t.msg || ge[t.err];
+  if (t.push(e), t.err) throw t.msg || ge[t.err];
   return t.result;
 }
 function To(e, n) {
@@ -2783,8 +2772,7 @@ var Ft = function(e, n) {
   return Ft = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(t, i) {
     t.__proto__ = i;
   } || function(t, i) {
-    for (var a in i)
-      Object.prototype.hasOwnProperty.call(i, a) && (t[a] = i[a]);
+    for (var a in i) Object.prototype.hasOwnProperty.call(i, a) && (t[a] = i[a]);
   }, Ft(e, n);
 };
 function Kt(e, n) {
@@ -2825,8 +2813,7 @@ function jo(e, n, t, i) {
 }
 function Ai(e, n) {
   var t = { label: 0, sent: function() {
-    if (r[0] & 1)
-      throw r[1];
+    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() {
@@ -2838,100 +2825,89 @@ function Ai(e, n) {
     };
   }
   function u(s) {
-    if (i)
-      throw new TypeError("Generator is already executing.");
-    for (; o && (o = 0, s[0] && (t = 0)), t; )
-      try {
-        if (i = 1, a && (r = s[0] & 2 ? a.return : s[0] ? a.throw || ((r = a.return) && r.call(a), 0) : a.next) && !(r = r.call(a, s[1])).done)
-          return r;
-        switch (a = 0, r && (s = [s[0] & 2, r.value]), s[0]) {
-          case 0:
-          case 1:
-            r = s;
-            break;
-          case 4:
-            return t.label++, { value: s[1], done: !1 };
-          case 5:
-            t.label++, a = s[1], s = [0];
-            continue;
-          case 7:
-            s = t.ops.pop(), t.trys.pop();
-            continue;
-          default:
-            if (r = t.trys, !(r = r.length > 0 && r[r.length - 1]) && (s[0] === 6 || s[0] === 2)) {
-              t = 0;
-              continue;
-            }
-            if (s[0] === 3 && (!r || s[1] > r[0] && s[1] < r[3])) {
-              t.label = s[1];
-              break;
-            }
-            if (s[0] === 6 && t.label < r[1]) {
-              t.label = r[1], r = s;
-              break;
-            }
-            if (r && t.label < r[2]) {
-              t.label = r[2], t.ops.push(s);
-              break;
-            }
-            r[2] && t.ops.pop(), t.trys.pop();
+    if (i) throw new TypeError("Generator is already executing.");
+    for (; o && (o = 0, s[0] && (t = 0)), t; ) try {
+      if (i = 1, a && (r = s[0] & 2 ? a.return : s[0] ? a.throw || ((r = a.return) && r.call(a), 0) : a.next) && !(r = r.call(a, s[1])).done) return r;
+      switch (a = 0, r && (s = [s[0] & 2, r.value]), s[0]) {
+        case 0:
+        case 1:
+          r = s;
+          break;
+        case 4:
+          return t.label++, { value: s[1], done: !1 };
+        case 5:
+          t.label++, a = s[1], s = [0];
+          continue;
+        case 7:
+          s = t.ops.pop(), t.trys.pop();
+          continue;
+        default:
+          if (r = t.trys, !(r = r.length > 0 && r[r.length - 1]) && (s[0] === 6 || s[0] === 2)) {
+            t = 0;
             continue;
-        }
-        s = n.call(e, t);
-      } catch (f) {
-        s = [6, f], a = 0;
-      } finally {
-        i = r = 0;
+          }
+          if (s[0] === 3 && (!r || s[1] > r[0] && s[1] < r[3])) {
+            t.label = s[1];
+            break;
+          }
+          if (s[0] === 6 && t.label < r[1]) {
+            t.label = r[1], r = s;
+            break;
+          }
+          if (r && t.label < r[2]) {
+            t.label = r[2], t.ops.push(s);
+            break;
+          }
+          r[2] && t.ops.pop(), t.trys.pop();
+          continue;
       }
-    if (s[0] & 5)
-      throw s[1];
+      s = n.call(e, t);
+    } catch (f) {
+      s = [6, f], a = 0;
+    } finally {
+      i = r = 0;
+    }
+    if (s[0] & 5) throw s[1];
     return { value: s[0] ? s[1] : void 0, done: !0 };
   }
 }
 function Le(e) {
   var n = typeof Symbol == "function" && Symbol.iterator, t = n && e[n], i = 0;
-  if (t)
-    return t.call(e);
-  if (e && typeof e.length == "number")
-    return {
-      next: function() {
-        return e && i >= e.length && (e = void 0), { value: e && e[i++], done: !e };
-      }
-    };
+  if (t) return t.call(e);
+  if (e && typeof e.length == "number") return {
+    next: function() {
+      return e && i >= e.length && (e = void 0), { value: e && e[i++], done: !e };
+    }
+  };
   throw new TypeError(n ? "Object is not iterable." : "Symbol.iterator is not defined.");
 }
 function Lt(e, n) {
   var t = typeof Symbol == "function" && e[Symbol.iterator];
-  if (!t)
-    return e;
+  if (!t) return e;
   var i = t.call(e), a, r = [], o;
   try {
-    for (; (n === void 0 || n-- > 0) && !(a = i.next()).done; )
-      r.push(a.value);
+    for (; (n === void 0 || n-- > 0) && !(a = i.next()).done; ) r.push(a.value);
   } catch (l) {
     o = { error: l };
   } finally {
     try {
       a && !a.done && (t = i.return) && t.call(i);
     } finally {
-      if (o)
-        throw o.error;
+      if (o) throw o.error;
     }
   }
   return r;
 }
 function Pt(e, n, t) {
-  if (t || arguments.length === 2)
-    for (var i = 0, a = n.length, r; i < a; i++)
-      (r || !(i in n)) && (r || (r = Array.prototype.slice.call(n, 0, i)), r[i] = n[i]);
+  if (t || arguments.length === 2) for (var i = 0, a = n.length, r; i < a; i++)
+    (r || !(i in n)) && (r || (r = Array.prototype.slice.call(n, 0, i)), r[i] = n[i]);
   return e.concat(r || Array.prototype.slice.call(n));
 }
 function be(e) {
   return this instanceof be ? (this.v = e, this) : new be(e);
 }
 function Go(e, n, t) {
-  if (!Symbol.asyncIterator)
-    throw new TypeError("Symbol.asyncIterator is not defined.");
+  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 this;
@@ -2964,8 +2940,7 @@ function Go(e, n, t) {
   }
 }
 function Yo(e) {
-  if (!Symbol.asyncIterator)
-    throw new TypeError("Symbol.asyncIterator is not defined.");
+  if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
   var n = e[Symbol.asyncIterator], t;
   return n ? n.call(e) : (e = typeof Le == "function" ? Le(e) : e[Symbol.iterator](), t = {}, i("next"), i("throw"), i("return"), t[Symbol.asyncIterator] = function() {
     return this;
@@ -3029,8 +3004,7 @@ var Wt = function() {
             try {
               u && !u.done && (t = l.return) && t.call(l);
             } finally {
-              if (n)
-                throw n.error;
+              if (n) throw n.error;
             }
           }
         else
@@ -3060,8 +3034,7 @@ var Wt = function() {
           try {
             h && !h.done && (a = c.return) && a.call(c);
           } finally {
-            if (i)
-              throw i.error;
+            if (i) throw i.error;
           }
         }
       }
@@ -3500,8 +3473,7 @@ function cs(e) {
       try {
         r && !r.done && (i = a.return) && i.call(a);
       } finally {
-        if (t)
-          throw t.error;
+        if (t) throw t.error;
       }
     }
     n.complete();
@@ -3528,8 +3500,7 @@ function ps(e, n) {
         case 1:
           return [4, t.next()];
         case 2:
-          if (i = u.sent(), !!i.done)
-            return [3, 4];
+          if (i = u.sent(), !!i.done) return [3, 4];
           if (o = i.value, n.next(o), n.closed)
             return [2];
           u.label = 3;
@@ -3546,8 +3517,7 @@ function ps(e, n) {
         case 8:
           return [3, 10];
         case 9:
-          if (a)
-            throw a.error;
+          if (a) throw a.error;
           return [7];
         case 10:
           return [7];

package/dist/{index-BJLu48Hz.js → index-CjesiOz_.js}

@@ -1,6 +1,6 @@
 import { L as g } from "./__vite-browser-external-C--ziKoh.js";
-import { b as m } from "./index-B5cesONJ.js";
-import { L as E, u as _ } from "./long-D4tVjLLz.js";
+import { b as m } from "./index-B6haPltu.js";
+import { L as E, u as _ } from "./long-BXK3UEks.js";
 const w = 1;
 class I {
   constructor({ filehandle: e, path: t }) {

package/dist/{index-oqw_s02W.js → index-HGQZ77IK.js}

@@ -1,6 +1,6 @@
 import { L as d } from "./__vite-browser-external-C--ziKoh.js";
-import { R as b } from "./remoteFile-BkTxwFub.js";
-import { b as i } from "./index-B5cesONJ.js";
+import { R as b } from "./remoteFile-DuIsnepi.js";
+import { b as i } from "./index-B6haPltu.js";
 function a(o) {
   const r = new FileReader();
   return new Promise((n, e) => {