@genome-spy/app 0.57.0 → 0.58.0

package/dist/index-DTcHjAHp.js

@@ -0,0 +1,505 @@
+import { g as Ft } from "./_commonjsHelpers-DjF3Plf2.js";
+var X, Ie;
+function Dt() {
+  if (Ie) return X;
+  Ie = 1;
+  function C(n, y) {
+    function t() {
+      this.constructor = n;
+    }
+    t.prototype = y.prototype, n.prototype = new t();
+  }
+  function d(n, y, t, m) {
+    this.message = n, this.expected = y, this.found = t, this.location = m, this.name = "SyntaxError", typeof Error.captureStackTrace == "function" && Error.captureStackTrace(this, d);
+  }
+  C(d, Error), d.buildMessage = function(n, y) {
+    var t = {
+      literal: function(u) {
+        return '"' + A(u.text) + '"';
+      },
+      class: function(u) {
+        var h = "", b;
+        for (b = 0; b < u.parts.length; b++)
+          h += u.parts[b] instanceof Array ? q(u.parts[b][0]) + "-" + q(u.parts[b][1]) : q(u.parts[b]);
+        return "[" + (u.inverted ? "^" : "") + h + "]";
+      },
+      any: function(u) {
+        return "any character";
+      },
+      end: function(u) {
+        return "end of input";
+      },
+      other: function(u) {
+        return u.description;
+      }
+    };
+    function m(u) {
+      return u.charCodeAt(0).toString(16).toUpperCase();
+    }
+    function A(u) {
+      return u.replace(/\\/g, "\\\\").replace(/"/g, '\\"').replace(/\0/g, "\\0").replace(/\t/g, "\\t").replace(/\n/g, "\\n").replace(/\r/g, "\\r").replace(/[\x00-\x0F]/g, function(h) {
+        return "\\x0" + m(h);
+      }).replace(/[\x10-\x1F\x7F-\x9F]/g, function(h) {
+        return "\\x" + m(h);
+      });
+    }
+    function q(u) {
+      return u.replace(/\\/g, "\\\\").replace(/\]/g, "\\]").replace(/\^/g, "\\^").replace(/-/g, "\\-").replace(/\0/g, "\\0").replace(/\t/g, "\\t").replace(/\n/g, "\\n").replace(/\r/g, "\\r").replace(/[\x00-\x0F]/g, function(h) {
+        return "\\x0" + m(h);
+      }).replace(/[\x10-\x1F\x7F-\x9F]/g, function(h) {
+        return "\\x" + m(h);
+      });
+    }
+    function $(u) {
+      return t[u.type](u);
+    }
+    function I(u) {
+      var h = new Array(u.length), b, B;
+      for (b = 0; b < u.length; b++)
+        h[b] = $(u[b]);
+      if (h.sort(), h.length > 0) {
+        for (b = 1, B = 1; b < h.length; b++)
+          h[b - 1] !== h[b] && (h[B] = h[b], B++);
+        h.length = B;
+      }
+      switch (h.length) {
+        case 1:
+          return h[0];
+        case 2:
+          return h[0] + " or " + h[1];
+        default:
+          return h.slice(0, -1).join(", ") + ", or " + h[h.length - 1];
+      }
+    }
+    function P(u) {
+      return u ? '"' + A(u) + '"' : "end of input";
+    }
+    return "Expected " + I(n) + " but " + P(y) + " found.";
+  };
+  function E(n, y) {
+    y = y !== void 0 ? y : {};
+    var t = {}, m = { declaration: De }, A = De, q = "(", $ = g("(", !1), I = ")", P = g(")", !1), u = function(e, o, i, s) {
+      return { type: e, name: o, comment: i, fields: s };
+    }, h = "simple", b = g("simple", !1), B = "object", Ge = g("object", !1), J = "table", _e = g("table", !1), _ = "auto", K = g("auto", !1), ee = "primary", Me = g("primary", !1), te = "index", je = g("index", !1), re = "unique", Le = g("unique", !1), M = function(e, o) {
+      return o;
+    }, Oe = function(e, o) {
+      return e.name && o.unshift(e), o;
+    }, Ue = "#", Ve = g("#", !1), U = ";", V = g(";", !1), Ze = function(e, o, i) {
+      return { type: e, name: o, comment: i };
+    }, Qe = "[", We = g("[", !1), Xe = "]", Ye = g("]", !1), He = function(e, o, i, s) {
+      return { type: e, size: o, name: i, comment: s };
+    }, Je = function(e, o, i, s) {
+      return { type: e, vals: o, name: i, comment: s };
+    }, oe = ",", ie = g(",", !1), Ke = function(e, o) {
+      return o.unshift(e), o;
+    }, se = "int", et = g("int", !1), ne = "uint", tt = g("uint", !1), ae = "short", rt = g("short", !1), ce = "ushort", ot = g("ushort", !1), fe = "byte", it = g("byte", !1), le = "ubyte", st = g("ubyte", !1), ue = "float", nt = g("float", !1), he = "char", at = g("char", !1), me = "string", ct = g("string", !1), ge = "lstring", ft = g("lstring", !1), pe = "enum", lt = g("enum", !1), de = "double", ut = g("double", !1), be = "bigint", ht = g("bigint", !1), Se = "set", mt = g("set", !1), gt = function(e, o) {
+      return e + " " + o;
+    }, pt = /^[a-zA-Z_]/, dt = G([["a", "z"], ["A", "Z"], "_"], !1, !1), $e = /^[a-zA-Z0-9_]/, ye = G([["a", "z"], ["A", "Z"], ["0", "9"], "_"], !1, !1), bt = function(e) {
+      return qe();
+    }, Ee = /^[^\n\r]/, ke = G([`
+`, "\r"], !0, !1), St = function(e) {
+      return e.join("").replace(/^"/, "").replace(/"$/, "");
+    }, $t = xe("integer"), Ce = /^[0-9]/, Ae = G([["0", "9"]], !1, !1), yt = function() {
+      return parseInt(qe(), 10);
+    }, Et = xe("whitespace"), we = /^[ \t\n\r]/, ve = G([" ", "	", `
+`, "\r"], !1, !1), r = 0, k = 0, j = [{ line: 1, column: 1 }], x = 0, Z = [], c = 0, L;
+    if ("startRule" in y) {
+      if (!(y.startRule in m))
+        throw new Error(`Can't start parsing from rule "` + y.startRule + '".');
+      A = m[y.startRule];
+    }
+    function qe() {
+      return n.substring(k, r);
+    }
+    function g(e, o) {
+      return { type: "literal", text: e, ignoreCase: o };
+    }
+    function G(e, o, i) {
+      return { type: "class", parts: e, inverted: o, ignoreCase: i };
+    }
+    function kt() {
+      return { type: "end" };
+    }
+    function xe(e) {
+      return { type: "other", description: e };
+    }
+    function Ne(e) {
+      var o = j[e], i;
+      if (o)
+        return o;
+      for (i = e - 1; !j[i]; )
+        i--;
+      for (o = j[i], o = {
+        line: o.line,
+        column: o.column
+      }; i < e; )
+        n.charCodeAt(i) === 10 ? (o.line++, o.column = 1) : o.column++, i++;
+      return j[e] = o, o;
+    }
+    function Fe(e, o) {
+      var i = Ne(e), s = Ne(o);
+      return {
+        start: {
+          offset: e,
+          line: i.line,
+          column: i.column
+        },
+        end: {
+          offset: o,
+          line: s.line,
+          column: s.column
+        }
+      };
+    }
+    function f(e) {
+      r < x || (r > x && (x = r, Z = []), Z.push(e));
+    }
+    function Ct(e, o, i) {
+      return new d(d.buildMessage(e, o), e, o, i);
+    }
+    function De() {
+      var e, o, i, s, a, p, S, w, R, N, T, F, z, D;
+      return e = r, o = l(), o !== t ? (i = Re(), i !== t ? (s = l(), s !== t ? (a = Te(), a !== t ? (p = l(), p !== t ? (S = O(), S !== t ? (w = l(), w !== t ? (n.charCodeAt(r) === 40 ? (R = q, r++) : (R = t, c === 0 && f($)), R !== t ? (N = l(), N !== t ? (T = At(), T !== t ? (F = l(), F !== t ? (n.charCodeAt(r) === 41 ? (z = I, r++) : (z = t, c === 0 && f(P)), z !== t ? (D = l(), D !== t ? (k = e, o = u(i, a, S, T), e = o) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t), e;
+    }
+    function Re() {
+      var e;
+      return n.substr(r, 6) === h ? (e = h, r += 6) : (e = t, c === 0 && f(b)), e === t && (n.substr(r, 6) === B ? (e = B, r += 6) : (e = t, c === 0 && f(Ge)), e === t && (n.substr(r, 5) === J ? (e = J, r += 5) : (e = t, c === 0 && f(_e)))), e;
+    }
+    function Te() {
+      var e, o, i, s;
+      return e = v(), e === t && (e = r, o = v(), o !== t ? (i = ze(), i !== t ? (o = [o, i], e = o) : (r = e, e = t)) : (r = e, e = t), e === t && (e = r, o = v(), o !== t ? (n.substr(r, 4) === _ ? (i = _, r += 4) : (i = t, c === 0 && f(K)), i !== t ? (o = [o, i], e = o) : (r = e, e = t)) : (r = e, e = t), e === t && (e = r, o = v(), o !== t ? (i = ze(), i !== t ? (n.substr(r, 4) === _ ? (s = _, r += 4) : (s = t, c === 0 && f(K)), s !== t ? (o = [o, i, s], e = o) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)))), e;
+    }
+    function ze() {
+      var e;
+      return n.substr(r, 7) === ee ? (e = ee, r += 7) : (e = t, c === 0 && f(Me)), e === t && (n.substr(r, 5) === te ? (e = te, r += 5) : (e = t, c === 0 && f(je)), e === t && (n.substr(r, 6) === re ? (e = re, r += 6) : (e = t, c === 0 && f(Le)))), e;
+    }
+    function O() {
+      var e;
+      return e = Be(), e === t && (e = l()), e;
+    }
+    function At() {
+      var e, o, i, s, a, p, S;
+      if (e = r, o = Q(), o !== t)
+        if (i = l(), i !== t) {
+          for (s = [], a = r, p = l(), p !== t ? (S = Q(), S !== t ? (k = a, p = M(o, S), a = p) : (r = a, a = t)) : (r = a, a = t); a !== t; )
+            s.push(a), a = r, p = l(), p !== t ? (S = Q(), S !== t ? (k = a, p = M(o, S), a = p) : (r = a, a = t)) : (r = a, a = t);
+          s !== t ? (a = l(), a !== t ? (k = e, o = Oe(o, s), e = o) : (r = e, e = t)) : (r = e, e = t);
+        } else
+          r = e, e = t;
+      else
+        r = e, e = t;
+      return e;
+    }
+    function wt() {
+      var e;
+      return n.charCodeAt(r) === 35 ? (e = Ue, r++) : (e = t, c === 0 && f(Ve)), e;
+    }
+    function vt() {
+      var e, o, i, s, a;
+      return e = r, o = l(), o !== t ? (i = wt(), i !== t ? (s = Be(), s !== t ? (a = l(), a !== t ? (o = [o, i, s, a], e = o) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t), e;
+    }
+    function Q() {
+      var e, o, i, s, a, p, S, w, R, N, T, F, z, D;
+      return e = r, o = W(), o !== t ? (i = l(), i !== t ? (s = v(), s !== t ? (a = l(), a !== t ? (n.charCodeAt(r) === 59 ? (p = U, r++) : (p = t, c === 0 && f(V)), p !== t ? (S = l(), S !== t ? (w = O(), w !== t ? (k = e, o = Ze(o, s, w), e = o) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t), e === t && (e = r, o = W(), o !== t ? (i = l(), i !== t ? (n.charCodeAt(r) === 91 ? (s = Qe, r++) : (s = t, c === 0 && f(We)), s !== t ? (a = l(), a !== t ? (p = xt(), p !== t ? (S = l(), S !== t ? (n.charCodeAt(r) === 93 ? (w = Xe, r++) : (w = t, c === 0 && f(Ye)), w !== t ? (R = l(), R !== t ? (N = v(), N !== t ? (T = l(), T !== t ? (n.charCodeAt(r) === 59 ? (F = U, r++) : (F = t, c === 0 && f(V)), F !== t ? (z = l(), z !== t ? (D = O(), D !== t ? (k = e, o = He(o, p, N, D), e = o) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t), e === t && (e = r, o = W(), o !== t ? (i = l(), i !== t ? (n.charCodeAt(r) === 40 ? (s = q, r++) : (s = t, c === 0 && f($)), s !== t ? (a = l(), a !== t ? (p = qt(), p !== t ? (S = l(), S !== t ? (n.charCodeAt(r) === 41 ? (w = I, r++) : (w = t, c === 0 && f(P)), w !== t ? (R = l(), R !== t ? (N = v(), N !== t ? (T = l(), T !== t ? (n.charCodeAt(r) === 59 ? (F = U, r++) : (F = t, c === 0 && f(V)), F !== t ? (z = l(), z !== t ? (D = O(), D !== t ? (k = e, o = Je(o, p, N, D), e = o) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t), e === t && (e = vt()))), e;
+    }
+    function qt() {
+      var e, o, i, s, a, p, S;
+      if (e = r, o = v(), o !== t) {
+        for (i = [], s = r, n.charCodeAt(r) === 44 ? (a = oe, r++) : (a = t, c === 0 && f(ie)), a !== t ? (p = l(), p !== t ? (S = v(), S !== t ? (k = s, a = M(o, S), s = a) : (r = s, s = t)) : (r = s, s = t)) : (r = s, s = t); s !== t; )
+          i.push(s), s = r, n.charCodeAt(r) === 44 ? (a = oe, r++) : (a = t, c === 0 && f(ie)), a !== t ? (p = l(), p !== t ? (S = v(), S !== t ? (k = s, a = M(o, S), s = a) : (r = s, s = t)) : (r = s, s = t)) : (r = s, s = t);
+        i !== t ? (k = e, o = Ke(o, i), e = o) : (r = e, e = t);
+      } else
+        r = e, e = t;
+      return e;
+    }
+    function W() {
+      var e, o, i, s;
+      return n.substr(r, 3) === se ? (e = se, r += 3) : (e = t, c === 0 && f(et)), e === t && (n.substr(r, 4) === ne ? (e = ne, r += 4) : (e = t, c === 0 && f(tt)), e === t && (n.substr(r, 5) === ae ? (e = ae, r += 5) : (e = t, c === 0 && f(rt)), e === t && (n.substr(r, 6) === ce ? (e = ce, r += 6) : (e = t, c === 0 && f(ot)), e === t && (n.substr(r, 4) === fe ? (e = fe, r += 4) : (e = t, c === 0 && f(it)), e === t && (n.substr(r, 5) === le ? (e = le, r += 5) : (e = t, c === 0 && f(st)), e === t && (n.substr(r, 5) === ue ? (e = ue, r += 5) : (e = t, c === 0 && f(nt)), e === t && (n.substr(r, 4) === he ? (e = he, r += 4) : (e = t, c === 0 && f(at)), e === t && (n.substr(r, 6) === me ? (e = me, r += 6) : (e = t, c === 0 && f(ct)), e === t && (n.substr(r, 7) === ge ? (e = ge, r += 7) : (e = t, c === 0 && f(ft)), e === t && (n.substr(r, 4) === pe ? (e = pe, r += 4) : (e = t, c === 0 && f(lt)), e === t && (n.substr(r, 6) === de ? (e = de, r += 6) : (e = t, c === 0 && f(ut)), e === t && (n.substr(r, 6) === be ? (e = be, r += 6) : (e = t, c === 0 && f(ht)), e === t && (n.substr(r, 3) === Se ? (e = Se, r += 3) : (e = t, c === 0 && f(mt)), e === t && (e = r, o = Re(), o !== t ? (i = l(), i !== t ? (s = Te(), s !== t ? (k = e, o = gt(o, s), e = o) : (r = e, e = t)) : (r = e, e = t)) : (r = e, e = t))))))))))))))), e;
+    }
+    function xt() {
+      var e;
+      return e = Nt(), e === t && (e = v()), e;
+    }
+    function v() {
+      var e, o, i, s, a;
+      if (e = r, o = r, pt.test(n.charAt(r)) ? (i = n.charAt(r), r++) : (i = t, c === 0 && f(dt)), i !== t) {
+        for (s = [], $e.test(n.charAt(r)) ? (a = n.charAt(r), r++) : (a = t, c === 0 && f(ye)); a !== t; )
+          s.push(a), $e.test(n.charAt(r)) ? (a = n.charAt(r), r++) : (a = t, c === 0 && f(ye));
+        s !== t ? (i = [i, s], o = i) : (r = o, o = t);
+      } else
+        r = o, o = t;
+      return o !== t && (k = e, o = bt()), e = o, e;
+    }
+    function Be() {
+      var e, o, i;
+      for (e = r, o = [], Ee.test(n.charAt(r)) ? (i = n.charAt(r), r++) : (i = t, c === 0 && f(ke)); i !== t; )
+        o.push(i), Ee.test(n.charAt(r)) ? (i = n.charAt(r), r++) : (i = t, c === 0 && f(ke));
+      return o !== t && (k = e, o = St(o)), e = o, e;
+    }
+    function Nt() {
+      var e, o, i, s;
+      if (c++, e = r, o = l(), o !== t) {
+        if (i = [], Ce.test(n.charAt(r)) ? (s = n.charAt(r), r++) : (s = t, c === 0 && f(Ae)), s !== t)
+          for (; s !== t; )
+            i.push(s), Ce.test(n.charAt(r)) ? (s = n.charAt(r), r++) : (s = t, c === 0 && f(Ae));
+        else
+          i = t;
+        i !== t ? (k = e, o = yt(), e = o) : (r = e, e = t);
+      } else
+        r = e, e = t;
+      return c--, e === t && (o = t, c === 0 && f($t)), e;
+    }
+    function l() {
+      var e, o;
+      for (c++, e = [], we.test(n.charAt(r)) ? (o = n.charAt(r), r++) : (o = t, c === 0 && f(ve)); o !== t; )
+        e.push(o), we.test(n.charAt(r)) ? (o = n.charAt(r), r++) : (o = t, c === 0 && f(ve));
+      return c--, e === t && (o = t, c === 0 && f(Et)), e;
+    }
+    if (L = A(), L !== t && r === n.length)
+      return L;
+    throw L !== t && r < n.length && f(kt()), Ct(Z, x < n.length ? n.charAt(x) : null, x < n.length ? Fe(x, x + 1) : Fe(x, x));
+  }
+  return X = {
+    SyntaxError: d,
+    parse: E
+  }, X;
+}
+var Pe = Dt();
+const Rt = /* @__PURE__ */ Ft(Pe), Tt = `table bigChain
+"bigChain pairwise alignment"
+    (
+    string chrom;       "Reference sequence chromosome or scaffold"
+    uint   chromStart;  "Start position in chromosome"
+    uint   chromEnd;    "End position in chromosome"
+    string name;        "Name or ID of item, ideally both human readable and unique"
+    uint score;         "Score (0-1000)"
+    char[1] strand;     "+ or - for strand"
+    uint tSize;         "size of target sequence"
+    string qName;       "name of query sequence"
+    uint qSize;         "size of query sequence"
+    uint qStart;        "start of alignment on query sequence"
+    uint qEnd;          "end of alignment on query sequence"
+    uint chainScore;    "score from chain"
+    )`, zt = `table bigGenePred
+"bigGenePred gene models"
+   (
+   string chrom;       "Reference sequence chromosome or scaffold"
+   uint   chromStart;  "Start position in chromosome"
+   uint   chromEnd;    "End position in chromosome"
+   string name;        "Name or ID of item, ideally both human readable and unique"
+   uint score;         "Score (0-1000)"
+   char[1] strand;     "+ or - for strand"
+   uint thickStart;    "Start of where display should be thick (start codon)"
+   uint thickEnd;      "End of where display should be thick (stop codon)"
+   uint reserved;       "RGB value (use R,G,B string in input file)"
+   int blockCount;     "Number of blocks"
+   int[blockCount] blockSizes; "Comma separated list of block sizes"
+   int[blockCount] chromStarts; "Start positions relative to chromStart"
+   string name2;       "Alternative/human readable name"
+   string cdsStartStat; "Status of CDS start annotation (none, unknown, incomplete, or complete)"
+   string cdsEndStat;   "Status of CDS end annotation (none, unknown, incomplete, or complete)"
+   int[blockCount] exonFrames; "Exon frame {0,1,2}, or -1 if no frame for exon"
+   string type;        "Transcript type"
+   string geneName;    "Primary identifier for gene"
+   string geneName2;   "Alternative/human readable gene name"
+   string geneType;    "Gene type"
+   )`, Bt = `table interact
+"interaction between two regions"
+    (
+    string chrom;        "Chromosome (or contig, scaffold, etc.). For interchromosomal, use 2 records"
+    uint chromStart;     "Start position of lower region. For interchromosomal, set to chromStart of this region"
+    uint chromEnd;       "End position of upper region. For interchromosomal, set to chromEnd of this region"
+    string name;         "Name of item, for display.  Usually 'sourceName/targetName/exp' or empty"
+    uint score;          "Score (0-1000)"
+    double value;        "Strength of interaction or other data value. Typically basis for score"
+    string exp;          "Experiment name (metadata for filtering). Use . if not applicable"
+    string color;        "Item color.  Specified as r,g,b or hexadecimal #RRGGBB or html color name, as in //www.w3.org/TR/css3-color/#html4. Use 0 and spectrum setting to shade by score"
+    string sourceChrom;  "Chromosome of source region (directional) or lower region. For non-directional interchromosomal, chrom of this region."
+    uint sourceStart;    "Start position in chromosome of source/lower/this region"
+    uint sourceEnd;      "End position in chromosome of source/lower/this region"
+    string sourceName;   "Identifier of source/lower/this region"
+    string sourceStrand; "Orientation of source/lower/this region: + or -.  Use . if not applicable"
+    string targetChrom;  "Chromosome of target region (directional) or upper region. For non-directional interchromosomal, chrom of other region"
+    uint targetStart;    "Start position in chromosome of target/upper/this region"
+    uint targetEnd;      "End position in chromosome of target/upper/this region"
+    string targetName;   "Identifier of target/upper/this region"
+    string targetStrand; "Orientation of target/upper/this region: + or -.  Use . if not applicable"
+
+    )`, It = `table bigLink
+"bigLink pairwise alignment"
+    (
+    string chrom;       "Reference sequence chromosome or scaffold"
+    uint   chromStart;  "Start position in chromosome"
+    uint   chromEnd;    "End position in chromosome"
+    string name;        "Name or ID of item, ideally both human readable and unique"
+    uint qStart;        "start of alignment on query sequence"
+    )`, Pt = `table bedMaf
+"Bed3 with MAF block"
+    (
+    string chrom;      "Reference sequence chromosome or scaffold"
+    uint   chromStart; "Start position in chromosome"
+    uint   chromEnd;   "End position in chromosome"
+    lstring mafBlock;   "MAF block"
+    )`, Gt = `table bigNarrowPeak
+"BED6+4 Peaks of signal enrichment based on pooled, normalized (interpreted) data."
+(
+    string chrom;        "Reference sequence chromosome or scaffold"
+    uint   chromStart;   "Start position in chromosome"
+    uint   chromEnd;     "End position in chromosome"
+    string name;	 "Name given to a region (preferably unique). Use . if no name is assigned"
+    uint   score;        "Indicates how dark the peak will be displayed in the browser (0-1000) "
+    char[1]  strand;     "+ or - or . for unknown"
+    float  signalValue;  "Measurement of average enrichment for the region"
+    float  pValue;       "Statistical significance of signal value (-log10). Set to -1 if not used."
+    float  qValue;       "Statistical significance with multiple-test correction applied (FDR -log10). Set to -1 if not used."
+    int   peak;         "Point-source called for this peak; 0-based offset from chromStart. Set to -1 if no point-source called."
+)`, _t = `table bigPsl
+"bigPsl pairwise alignment"
+    (
+    string chrom;       "Reference sequence chromosome or scaffold"
+    uint   chromStart;  "Start position in chromosome"
+    uint   chromEnd;    "End position in chromosome"
+    string name;        "Name or ID of item, ideally both human readable and unique"
+    uint score;         "Score (0-1000)"
+    char[1] strand;     "+ or - indicates whether the query aligns to the + or - strand on the reference"
+    uint thickStart;    "Start of where display should be thick (start codon)"
+    uint thickEnd;      "End of where display should be thick (stop codon)"
+    uint reserved;       "RGB value (use R,G,B string in input file)"
+    int blockCount;     "Number of blocks"
+    int[blockCount] blockSizes; "Comma separated list of block sizes"
+    int[blockCount] chromStarts; "Start positions relative to chromStart"
+
+    uint    oChromStart;"Start position in other chromosome"
+    uint    oChromEnd;  "End position in other chromosome"
+    char[1] oStrand;    "+ or -, - means that psl was reversed into BED-compatible coordinates"
+    uint    oChromSize; "Size of other chromosome."
+    int[blockCount] oChromStarts; "Start positions relative to oChromStart or from oChromStart+oChromSize depending on strand"
+
+    lstring  oSequence;  "Sequence on other chrom (or empty)"
+    string   oCDS;       "CDS in NCBI format"
+
+    uint    chromSize;"Size of target chromosome"
+
+    uint match;        "Number of bases matched."
+    uint misMatch; " Number of bases that don't match "
+    uint repMatch; " Number of bases that match but are part of repeats "
+    uint nCount;   " Number of 'N' bases "
+    uint seqType;    "0=empty, 1=nucleotide, 2=amino_acid"
+    )`, Mt = `table defaultBedSchema
+"BED12"
+    (
+    string chrom;      "The name of the chromosome (e.g. chr3, chrY, chr2_random) or scaffold (e.g. scaffold10671)."
+    uint   chromStart; "The starting position of the feature in the chromosome or scaffold. The first base in a chromosome is numbered 0."
+    uint   chromEnd;   "The ending position of the feature in the chromosome or scaffold. The chromEnd base is not included in the display of the feature. For example, the first 100 bases of a chromosome are defined as chromStart=0, chromEnd=100, and span the bases numbered 0-99."
+    string   name;   "Defines the name of the BED line."
+    float   score;   "Feature score, doesn't care about the 0-1000 limit as in bed"
+    char   strand;   "Defines the strand. Either '.' (=no strand) or '+' or '-'"
+    uint thickStart; "The starting position at which the feature is drawn thickly (for example, the start codon in gene displays). When there is no thick part, thickStart and thickEnd are usually set to the chromStart position."
+    uint thickEnd; "The ending position at which the feature is drawn thickly (for example the stop codon in gene displays)."
+    string itemRgb; "An RGB value of the form R,G,B (e.g. 255,0,0). "
+    uint blockCount; " The number of blocks (exons) in the BED line."
+    uint[blockCount] blockSizes; " A comma-separated list of the block sizes. The number of items in this list should correspond to blockCount."
+    uint[blockCount] blockStarts; "A comma-separated list of block starts. All of the blockStart positions should be calculated relative to chromStart. The number of items in this list should correspond to blockCount."
+    )`, jt = `table mafFrames
+"codon frame assignment for MAF components"
+    (
+    string chrom;      "Reference sequence chromosome or scaffold"
+    uint   chromStart; "Start range in chromosome"
+    uint   chromEnd;   "End range in chromosome"
+    string src;        "Name of sequence source in MAF"
+    ubyte frame;       "frame (0,1,2) for first base(+) or last bast(-)"
+    char[1] strand;    "+ or -"
+    string name;       "Name of gene used to define frame"
+    int    prevFramePos;  "target position of the previous base (in transcription direction) that continues this frame, or -1 if none, or frame not contiguous"
+    int    nextFramePos;  "target position of the next base (in transcription direction) that continues this frame, or -1 if none, or frame not contiguous"
+    ubyte  isExonStart;  "does this start the CDS portion of an exon?"
+    ubyte  isExonEnd;    "does this end the CDS portion of an exon?"
+    )`, Lt = `table mafSummary
+"Positions and scores for alignment blocks"
+    (
+    string chrom;      "Reference sequence chromosome or scaffold"
+    uint   chromStart; "Start position in chromosome"
+    uint   chromEnd;   "End position in chromosome"
+    string src;        "Sequence name or database of alignment"
+    float  score;      "Floating point score."
+    char[1] leftStatus;  "Gap/break annotation for preceding block"
+    char[1] rightStatus; "Gap/break annotation for following block"
+    )`, Ot = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  bigChain: Tt,
+  bigGenePred: zt,
+  bigInteract: Bt,
+  bigLink: It,
+  bigMaf: Pt,
+  bigNarrowPeak: Gt,
+  bigPsl: _t,
+  defaultBedSchema: Mt,
+  mafFrames: jt,
+  mafSummary: Lt
+}, Symbol.toStringTag, { value: "Module" })), Y = Object.fromEntries(Object.entries(Ot).map(([C, d]) => [
+  C,
+  Pe.parse(d.trim())
+]));
+function H(C) {
+  const d = /* @__PURE__ */ new Set(["uint", "int", "float", "long"]);
+  return {
+    ...C,
+    fields: C.fields.map((E) => ({
+      ...E,
+      isArray: E.size && E.type !== "char",
+      arrayIsNumeric: E.size && d.has(E.type),
+      isNumeric: !E.size && d.has(E.type)
+    })).filter((E) => !!E.name)
+  };
+}
+const Ut = { ".": 0, "-": -1, "+": 1 };
+function Vt(C) {
+  var d;
+  return C.length >= 12 && !Number.isNaN(parseInt(C[9], 10)) && ((d = C[10]) === null || d === void 0 ? void 0 : d.split(",").filter((E) => !!E).length) === parseInt(C[9], 10);
+}
+class Qt {
+  constructor(d = {}) {
+    if (d.autoSql)
+      this.autoSql = H(Rt.parse(d.autoSql));
+    else if (d.type) {
+      if (!Y[d.type])
+        throw new Error("Type not found");
+      this.autoSql = H(Y[d.type]);
+    } else
+      this.autoSql = H(Y.defaultBedSchema), this.attemptDefaultBed = !0;
+  }
+  /*
+   * parses a line of text as a BED line with the loaded autoSql schema
+   *
+   * @param line - a BED line as tab delimited text or array
+   * @param opts - supply opts.uniqueId
+   * @return a object representing a feature
+   */
+  parseLine(d, E = {}) {
+    const { autoSql: n } = this, { uniqueId: y } = E, t = Array.isArray(d) ? d : d.split("	");
+    let m = {};
+    if (!this.attemptDefaultBed || this.attemptDefaultBed && Vt(t))
+      for (let A = 0; A < n.fields.length; A++) {
+        const q = n.fields[A];
+        let $ = t[A];
+        const { isNumeric: I, isArray: P, arrayIsNumeric: u, name: h } = q;
+        if ($ == null)
+          break;
+        if ($ !== ".") {
+          if (I) {
+            const b = Number($);
+            $ = Number.isNaN(b) ? $ : b;
+          } else P && ($ = $.split(","), $[$.length - 1] === "" && $.pop(), u && ($ = $.map(Number)));
+          m[h] = $;
+        }
+      }
+    else {
+      const A = ["chrom", "chromStart", "chromEnd", "name"];
+      m = Object.fromEntries(t.map((q, $) => [A[$] || "field" + $, q])), m.chromStart = +m.chromStart, m.chromEnd = +m.chromEnd, Number.isNaN(Number.parseFloat(m.field4)) || (m.score = +m.field4, delete m.field4), (m.field5 === "+" || m.field5 === "-") && (m.strand = m.field5, delete m.field5);
+    }
+    return y && (m.uniqueId = y), m.strand = Ut[m.strand] || 0, m.chrom = decodeURIComponent(m.chrom), m;
+  }
+}
+export {
+  Qt as default
+};

package/dist/{index-CfEH2hsw.js → index-Dec7VcMU.js}

@@ -1,8 +1,8 @@
-import { A as J, L as K } from "./index-C159nEYc.js";
-import { b as Q } from "./index-DluFz_0j.js";
+import { A as J, L as K } from "./index-CCJIjehY.js";
+import { b as Q } from "./index-BftNdA0O.js";
 import { L as B } from "./__vite-browser-external-C--ziKoh.js";
-import { R as A } from "./remoteFile-DwSeXAZ0.js";
-import { u as z, L as H, a as Z } from "./long-DM5IWGqg.js";
+import { R as A } from "./remoteFile-BuaqFGWk.js";
+import { u as $, L as H, a as Z } from "./long-BviWyoZx.js";
 function j(o) {
   if (o.greaterThan(Number.MAX_SAFE_INTEGER) || o.lessThan(Number.MIN_SAFE_INTEGER))
     throw new Error("integer overflow");
@@ -108,7 +108,7 @@ class k extends W {
   }
   // fetch and parse the index
   async _parse(e = {}) {
-    const t = await this.filehandle.readFile(e), n = await z(t);
+    const t = await this.filehandle.readFile(e), n = await $(t);
     if (L(e.signal), n.readUInt32LE(0) !== ne)
       throw new Error("Not a TBI file");
     const i = n.readInt32LE(4), a = n.readInt32LE(8), r = a & 65536 ? "zero-based-half-open" : "1-based-closed", d = {
@@ -129,14 +129,14 @@ class k extends W {
         const y = n.readInt32LE(h);
         h += 4;
         const S = {};
-        let v;
-        for (let C = 0; C < y; C += 1) {
+        let E;
+        for (let v = 0; v < y; v += 1) {
           const _ = n.readUInt32LE(h);
           if (h += 4, _ > f + 1)
             throw new Error("tabix index contains too many bins, please use a CSI index");
           if (_ === f + 1) {
             const N = n.readInt32LE(h);
-            h += 4, N === 2 && (v = this.parsePseudoBin(n, h)), h += 16 * N;
+            h += 4, N === 2 && (E = this.parsePseudoBin(n, h)), h += 16 * N;
           } else {
             const N = n.readInt32LE(h);
             h += 4;
@@ -151,9 +151,9 @@ class k extends W {
         const P = n.readInt32LE(h);
         h += 4;
         const R = new Array(P);
-        for (let C = 0; C < P; C += 1)
-          R[C] = T(n, h), h += 8, g = this._findFirstData(g, R[C]);
-        return { binIndex: S, linearIndex: R, stats: v };
+        for (let v = 0; v < P; v += 1)
+          R[v] = T(n, h), h += 8, g = this._findFirstData(g, R[v]);
+        return { binIndex: S, linearIndex: R, stats: E };
       }),
       metaChar: w,
       maxBinNumber: f,
@@ -264,7 +264,7 @@ class M extends W {
   }
   // fetch and parse the index
   async _parse(e = {}) {
-    const t = await z(await this.filehandle.readFile(e));
+    const t = await $(await this.filehandle.readFile(e));
     let n;
     if (t.readUInt32LE(0) === re)
       n = 1;
@@ -298,8 +298,8 @@ class M extends W {
           l += 16;
           const x = new Array(p);
           for (let h = 0; h < p; h += 1) {
-            const g = T(t, l), E = T(t, l + 8);
-            l += 16, x[h] = new D(g, E, m);
+            const g = T(t, l), C = T(t, l + 8);
+            l += 16, x[h] = new D(g, C, m);
           }
           f[m] = x;
         }
@@ -354,7 +354,7 @@ class M extends W {
     return r;
   }
 }
-const $ = typeof TextDecoder < "u" ? new TextDecoder("utf8") : void 0;
+const z = typeof TextDecoder < "u" ? new TextDecoder("utf8") : void 0;
 function oe(o) {
   return new Promise((e) => setTimeout(e, o));
 }
@@ -468,20 +468,20 @@ class ue {
       L(r);
       let h = 0, g = 0;
       for (; h < b.length; ) {
-        const E = b.indexOf(`
+        const C = b.indexOf(`
 `, h);
-        if (E === -1)
+        if (C === -1)
           break;
-        const y = b.slice(h, E), S = (a = $ == null ? void 0 : $.decode(y)) !== null && a !== void 0 ? a : y.toString();
+        const y = b.slice(h, C), S = (a = z == null ? void 0 : z.decode(y)) !== null && a !== void 0 ? a : y.toString();
         if (x) {
           for (; h + w.minv.dataPosition >= x[g++]; )
             ;
           g--;
         }
-        const { startCoordinate: v, overlaps: P } = this.checkLine(l, e, u, c, S);
-        if (m !== void 0 && v !== void 0 && m > v)
-          throw new Error(`Lines not sorted by start coordinate (${m} > ${v}), this file is not usable with Tabix.`);
-        if (m = v, P)
+        const { startCoordinate: E, overlaps: P } = this.checkLine(l, e, u, c, S);
+        if (m !== void 0 && E !== void 0 && m > E)
+          throw new Error(`Lines not sorted by start coordinate (${m} > ${E}), this file is not usable with Tabix.`);
+        if (m = E, P)
           d(
             S.trim(),
             // cpositions[pos] refers to actual file offset of a bgzip block boundaries
@@ -494,9 +494,9 @@ class ue {
             // (1 << 8) these uncompressed offsets get a unique space
             p[g] * 256 + (h - x[g]) + w.minv.dataPosition + 1
           );
-        else if (v !== void 0 && v >= c)
+        else if (E !== void 0 && E >= c)
           return;
-        this.yieldTime && I - Date.now() > this.yieldTime && (I = Date.now(), L(r), await oe(1)), h = E + 1;
+        this.yieldTime && I - Date.now() > this.yieldTime && (I = Date.now(), L(r), await oe(1)), h = C + 1;
       }
     }
   }
@@ -510,7 +510,7 @@ class ue {
   async getHeaderBuffer(e = {}) {
     const { firstDataLine: t, metaChar: n, maxBlockSize: i } = await this.getMetadata(e);
     L(e.signal);
-    const a = ((t == null ? void 0 : t.blockPosition) || 0) + i, r = await this._readRegion(0, a, e), s = await z(r);
+    const a = ((t == null ? void 0 : t.blockPosition) || 0) + i, r = await this._readRegion(0, a, e), s = await $(r);
     if (n) {
       let d = -1;
       const l = 10, u = n.charCodeAt(0);