@weng-lab/genomebrowser-ui 0.1.3 → 0.1.5

package/dist/genomebrowser-ui.es.js

@@ -37,19 +37,19 @@ function Ys() {
   if (je) return $;
   je = 1;
   var s = Symbol.for("react.transitional.element"), e = Symbol.for("react.fragment");
-  function a(i, o, t) {
+  function a(i, o, l) {
     var c = null;
-    if (t !== void 0 && (c = "" + t), o.key !== void 0 && (c = "" + o.key), "key" in o) {
-      t = {};
+    if (l !== void 0 && (c = "" + l), o.key !== void 0 && (c = "" + o.key), "key" in o) {
+      l = {};
       for (var n in o)
-        n !== "key" && (t[n] = o[n]);
-    } else t = o;
-    return o = t.ref, {
+        n !== "key" && (l[n] = o[n]);
+    } else l = o;
+    return o = l.ref, {
       $$typeof: s,
       type: i,
       key: c,
       ref: o !== void 0 ? o : null,
-      props: t
+      props: l
     };
   }
   return $.Fragment = e, $.jsx = a, $.jsxs = a, $;
@@ -145,7 +145,7 @@ function zs() {
       var d = j.A;
       return d === null ? null : d.getOwner();
     }
-    function t() {
+    function l() {
       return Error("react-stack-top-frame");
     }
     function c(d) {
@@ -167,7 +167,7 @@ function zs() {
         configurable: !0
       });
     }
-    function l() {
+    function t() {
       var d = s(this.type);
       return Re[d] || (Re[d] = !0, console.error(
         "Accessing element.ref was removed in React 19. ref is now a regular prop. It will be removed from the JSX Element type in a future release."
@@ -183,7 +183,7 @@ function zs() {
         _owner: b
       }, (D !== void 0 ? D : null) !== null ? Object.defineProperty(d, "ref", {
         enumerable: !1,
-        get: l
+        get: t
       }) : Object.defineProperty(d, "ref", { enumerable: !1, value: null }), d._store = {}, Object.defineProperty(d._store, "validated", {
         configurable: !1,
         enumerable: !1,
@@ -270,8 +270,8 @@ React keys must be passed directly to JSX without using spread:
     };
     var z, Re = {}, be = m.react_stack_bottom_frame.bind(
       m,
-      t
-    )(), De = k(i(t)), We = {};
+      l
+    )(), De = k(i(l)), We = {};
     q.Fragment = u, q.jsx = function(d, _, A) {
       var b = 1e4 > j.recentlyCreatedOwnerStacks++;
       return F(
@@ -306,10 +306,10 @@ function qs({
   labelTooltip: a,
   toolbarSlot: i,
   toolbarStyle: o,
-  toolbarIconColor: t,
+  toolbarIconColor: l,
   ...c
 }) {
-  const [n, l] = Te.useState(!1), r = Te.useRef(null), F = t ?? "inherit";
+  const [n, t] = Te.useState(!1), r = Te.useRef(null), F = l ?? "inherit";
   return /* @__PURE__ */ C.jsxs(hs, { style: { ...o }, children: [
     typeof s != "string" && s,
     /* @__PURE__ */ C.jsxs(
@@ -367,7 +367,7 @@ function qs({
         "aria-controls": "export-menu",
         "aria-haspopup": "true",
         "aria-expanded": n ? "true" : void 0,
-        onClick: () => l(!0),
+        onClick: () => t(!0),
         children: /* @__PURE__ */ C.jsx(Ms, { fontSize: "small", htmlColor: F })
       }
     ) }),
@@ -377,7 +377,7 @@ function qs({
         id: "export-menu",
         anchorEl: r.current,
         open: n,
-        onClose: () => l(!1),
+        onClose: () => t(!1),
         anchorOrigin: { vertical: "bottom", horizontal: "right" },
         transformOrigin: { vertical: "top", horizontal: "right" },
         slotProps: {
@@ -391,7 +391,7 @@ function qs({
             {
               options: { ...c.printOptions },
               render: /* @__PURE__ */ C.jsx(pe, {}),
-              onClick: () => l(!1),
+              onClick: () => t(!1),
               children: "Print"
             }
           ),
@@ -403,7 +403,7 @@ function qs({
                 ...c.csvOptions
               },
               render: /* @__PURE__ */ C.jsx(pe, {}),
-              onClick: () => l(!1),
+              onClick: () => t(!1),
               children: "Download as CSV"
             }
           ),
@@ -412,7 +412,7 @@ function qs({
             {
               options: { ...c.excelOptions },
               render: /* @__PURE__ */ C.jsx(pe, {}),
-              onClick: () => l(!1),
+              onClick: () => t(!1),
               children: "Download as Excel"
             }
           )
@@ -480,7 +480,7 @@ class ra {
   }
 }
 function es(s) {
-  let e = null, a = null, i = null, o = 1, t = null;
+  let e = null, a = null, i = null, o = 1, l = null;
   if (M(s) || P(s))
     i = s, e = Be(s), a = ye(s);
   else {
@@ -489,9 +489,9 @@ function es(s) {
     const c = s.name;
     if (i = c, Me.call(s, "weight") && (o = s.weight, o <= 0))
       throw new Error(ca(c));
-    e = Be(c), a = ye(c), t = s.getFn;
+    e = Be(c), a = ye(c), l = s.getFn;
   }
-  return { path: e, id: a, weight: o, src: i, getFn: t };
+  return { path: e, id: a, weight: o, src: i, getFn: l };
 }
 function Be(s) {
   return P(s) ? s : s.split(".");
@@ -501,13 +501,13 @@ function ye(s) {
 }
 function da(s, e) {
   let a = [], i = !1;
-  const o = (t, c, n) => {
-    if (I(t))
+  const o = (l, c, n) => {
+    if (I(l))
       if (!c[n])
-        a.push(t);
+        a.push(l);
       else {
-        let l = c[n];
-        const r = t[l];
+        let t = c[n];
+        const r = l[t];
         if (!I(r))
           return;
         if (n === c.length - 1 && (M(r) || ze(r) || aa(r)))
@@ -585,11 +585,11 @@ function ma(s = 1, e = 3) {
   const a = /* @__PURE__ */ new Map(), i = Math.pow(10, e);
   return {
     get(o) {
-      const t = o.match(Na).length;
-      if (a.has(t))
-        return a.get(t);
-      const c = 1 / Math.pow(t, 0.5 * s), n = parseFloat(Math.round(c * i) / i);
-      return a.set(t, n), n;
+      const l = o.match(Na).length;
+      if (a.has(l))
+        return a.get(l);
+      const c = 1 / Math.pow(l, 0.5 * s), n = parseFloat(Math.round(c * i) / i);
+      return a.set(l, n), n;
     },
     clear() {
       a.clear();
@@ -650,14 +650,14 @@ class Se {
   }
   _addObject(e, a) {
     let i = { i: a, $: {} };
-    this.keys.forEach((o, t) => {
+    this.keys.forEach((o, l) => {
       let c = o.getFn ? o.getFn(e) : this.getFn(e, o.path);
       if (I(c)) {
         if (P(c)) {
           let n = [];
-          const l = [{ nestedArrIndex: -1, value: c }];
-          for (; l.length; ) {
-            const { nestedArrIndex: r, value: F } = l.pop();
+          const t = [{ nestedArrIndex: -1, value: c }];
+          for (; t.length; ) {
+            const { nestedArrIndex: r, value: F } = t.pop();
             if (I(F))
               if (M(F) && !Ne(F)) {
                 let E = {
@@ -667,19 +667,19 @@ class Se {
                 };
                 n.push(E);
               } else P(F) && F.forEach((E, p) => {
-                l.push({
+                t.push({
                   nestedArrIndex: p,
                   value: E
                 });
               });
           }
-          i.$[t] = n;
+          i.$[l] = n;
         } else if (M(c) && !Ne(c)) {
           let n = {
             v: c,
             n: this.norm.get(c)
           };
-          i.$[t] = n;
+          i.$[l] = n;
         }
       }
     }), this.records.push(i);
@@ -696,45 +696,45 @@ function ss(s, e, { getFn: a = N.getFn, fieldNormWeight: i = N.fieldNormWeight }
   return o.setKeys(s.map(es)), o.setSources(e), o.create(), o;
 }
 function _a(s, { getFn: e = N.getFn, fieldNormWeight: a = N.fieldNormWeight } = {}) {
-  const { keys: i, records: o } = s, t = new Se({ getFn: e, fieldNormWeight: a });
-  return t.setKeys(i), t.setIndexRecords(o), t;
+  const { keys: i, records: o } = s, l = new Se({ getFn: e, fieldNormWeight: a });
+  return l.setKeys(i), l.setIndexRecords(o), l;
 }
 function le(s, {
   errors: e = 0,
   currentLocation: a = 0,
   expectedLocation: i = 0,
   distance: o = N.distance,
-  ignoreLocation: t = N.ignoreLocation
+  ignoreLocation: l = N.ignoreLocation
 } = {}) {
   const c = e / s.length;
-  if (t)
+  if (l)
     return c;
   const n = Math.abs(i - a);
   return o ? c + n / o : n ? 1 : c;
 }
 function ya(s = [], e = N.minMatchCharLength) {
-  let a = [], i = -1, o = -1, t = 0;
-  for (let c = s.length; t < c; t += 1) {
-    let n = s[t];
-    n && i === -1 ? i = t : !n && i !== -1 && (o = t - 1, o - i + 1 >= e && a.push([i, o]), i = -1);
+  let a = [], i = -1, o = -1, l = 0;
+  for (let c = s.length; l < c; l += 1) {
+    let n = s[l];
+    n && i === -1 ? i = l : !n && i !== -1 && (o = l - 1, o - i + 1 >= e && a.push([i, o]), i = -1);
   }
-  return s[t - 1] && t - i >= e && a.push([i, t - 1]), a;
+  return s[l - 1] && l - i >= e && a.push([i, l - 1]), a;
 }
 const K = 32;
 function ga(s, e, a, {
   location: i = N.location,
   distance: o = N.distance,
-  threshold: t = N.threshold,
+  threshold: l = N.threshold,
   findAllMatches: c = N.findAllMatches,
   minMatchCharLength: n = N.minMatchCharLength,
-  includeMatches: l = N.includeMatches,
+  includeMatches: t = N.includeMatches,
   ignoreLocation: r = N.ignoreLocation
 } = {}) {
   if (e.length > K)
     throw new Error(ta(K));
   const F = e.length, E = s.length, p = Math.max(0, Math.min(i, E));
-  let m = t, y = p;
-  const w = n > 1 || l, u = w ? Array(E) : [];
+  let m = l, y = p;
+  const w = n > 1 || t, u = w ? Array(E) : [];
   let R;
   for (; (R = s.indexOf(e, y)) > -1; ) {
     let W = le(e, {
@@ -796,7 +796,7 @@ function ga(s, e, a, {
   };
   if (w) {
     const W = ya(u, n);
-    W.length ? l && (S.indices = W) : S.isMatch = !1;
+    W.length ? t && (S.indices = W) : S.isMatch = !1;
   }
   return S;
 }
@@ -814,10 +814,10 @@ class as {
     location: a = N.location,
     threshold: i = N.threshold,
     distance: o = N.distance,
-    includeMatches: t = N.includeMatches,
+    includeMatches: l = N.includeMatches,
     findAllMatches: c = N.findAllMatches,
     minMatchCharLength: n = N.minMatchCharLength,
-    isCaseSensitive: l = N.isCaseSensitive,
+    isCaseSensitive: t = N.isCaseSensitive,
     ignoreDiacritics: r = N.ignoreDiacritics,
     ignoreLocation: F = N.ignoreLocation
   } = {}) {
@@ -825,13 +825,13 @@ class as {
       location: a,
       threshold: i,
       distance: o,
-      includeMatches: t,
+      includeMatches: l,
       findAllMatches: c,
       minMatchCharLength: n,
-      isCaseSensitive: l,
+      isCaseSensitive: t,
       ignoreDiacritics: r,
       ignoreLocation: F
-    }, e = l ? e : e.toLowerCase(), e = r ? ne(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length)
+    }, e = t ? e : e.toLowerCase(), e = r ? ne(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length)
       return;
     const E = (m, y) => {
       this.chunks.push({
@@ -862,20 +862,20 @@ class as {
       return o && (w.indices = [[0, e.length - 1]]), w;
     }
     const {
-      location: t,
+      location: l,
       distance: c,
       threshold: n,
-      findAllMatches: l,
+      findAllMatches: t,
       minMatchCharLength: r,
       ignoreLocation: F
     } = this.options;
     let E = [], p = 0, m = !1;
     this.chunks.forEach(({ pattern: w, alphabet: u, startIndex: R }) => {
       const { isMatch: g, score: f, indices: x } = ga(e, w, u, {
-        location: t + R,
+        location: l + R,
         distance: c,
         threshold: n,
-        findAllMatches: l,
+        findAllMatches: t,
         minMatchCharLength: r,
         includeMatches: o,
         ignoreLocation: F
@@ -1043,10 +1043,10 @@ class is extends v {
     location: a = N.location,
     threshold: i = N.threshold,
     distance: o = N.distance,
-    includeMatches: t = N.includeMatches,
+    includeMatches: l = N.includeMatches,
     findAllMatches: c = N.findAllMatches,
     minMatchCharLength: n = N.minMatchCharLength,
-    isCaseSensitive: l = N.isCaseSensitive,
+    isCaseSensitive: t = N.isCaseSensitive,
     ignoreDiacritics: r = N.ignoreDiacritics,
     ignoreLocation: F = N.ignoreLocation
   } = {}) {
@@ -1054,10 +1054,10 @@ class is extends v {
       location: a,
       threshold: i,
       distance: o,
-      includeMatches: t,
+      includeMatches: l,
       findAllMatches: c,
       minMatchCharLength: n,
-      isCaseSensitive: l,
+      isCaseSensitive: t,
       ignoreDiacritics: r,
       ignoreLocation: F
     });
@@ -1090,9 +1090,9 @@ class os extends v {
   }
   search(e) {
     let a = 0, i;
-    const o = [], t = this.pattern.length;
+    const o = [], l = this.pattern.length;
     for (; (i = e.indexOf(this.pattern, a)) > -1; )
-      a = i + t, o.push([i, a - 1]);
+      a = i + l, o.push([i, a - 1]);
     const c = !!o.length;
     return {
       isMatch: c,
@@ -1113,16 +1113,16 @@ const ge = [
 ], ke = ge.length, ba = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, Da = "|";
 function Wa(s, e = {}) {
   return s.split(Da).map((a) => {
-    let i = a.trim().split(ba).filter((t) => t && !!t.trim()), o = [];
-    for (let t = 0, c = i.length; t < c; t += 1) {
-      const n = i[t];
-      let l = !1, r = -1;
-      for (; !l && ++r < ke; ) {
+    let i = a.trim().split(ba).filter((l) => l && !!l.trim()), o = [];
+    for (let l = 0, c = i.length; l < c; l += 1) {
+      const n = i[l];
+      let t = !1, r = -1;
+      for (; !t && ++r < ke; ) {
         const F = ge[r];
         let E = F.isMultiMatch(n);
-        E && (o.push(new F(E, e)), l = !0);
+        E && (o.push(new F(E, e)), t = !0);
       }
-      if (!l)
+      if (!t)
         for (r = -1; ++r < ke; ) {
           const F = ge[r];
           let E = F.isSingleMatch(n);
@@ -1141,10 +1141,10 @@ class Oa {
     isCaseSensitive: a = N.isCaseSensitive,
     ignoreDiacritics: i = N.ignoreDiacritics,
     includeMatches: o = N.includeMatches,
-    minMatchCharLength: t = N.minMatchCharLength,
+    minMatchCharLength: l = N.minMatchCharLength,
     ignoreLocation: c = N.ignoreLocation,
     findAllMatches: n = N.findAllMatches,
-    location: l = N.location,
+    location: t = N.location,
     threshold: r = N.threshold,
     distance: F = N.distance
   } = {}) {
@@ -1152,10 +1152,10 @@ class Oa {
       isCaseSensitive: a,
       ignoreDiacritics: i,
       includeMatches: o,
-      minMatchCharLength: t,
+      minMatchCharLength: l,
       findAllMatches: n,
       ignoreLocation: c,
-      location: l,
+      location: t,
       threshold: r,
       distance: F
     }, e = a ? e : e.toLowerCase(), e = i ? ne(e) : e, this.pattern = e, this.query = Wa(this.pattern, this.options);
@@ -1170,28 +1170,28 @@ class Oa {
         isMatch: !1,
         score: 1
       };
-    const { includeMatches: i, isCaseSensitive: o, ignoreDiacritics: t } = this.options;
-    e = o ? e : e.toLowerCase(), e = t ? ne(e) : e;
-    let c = 0, n = [], l = 0;
+    const { includeMatches: i, isCaseSensitive: o, ignoreDiacritics: l } = this.options;
+    e = o ? e : e.toLowerCase(), e = l ? ne(e) : e;
+    let c = 0, n = [], t = 0;
     for (let r = 0, F = a.length; r < F; r += 1) {
       const E = a[r];
       n.length = 0, c = 0;
       for (let p = 0, m = E.length; p < m; p += 1) {
         const y = E[p], { isMatch: w, indices: u, score: R } = y.search(e);
         if (w) {
-          if (c += 1, l += R, i) {
+          if (c += 1, t += R, i) {
             const g = y.constructor.type;
             Ta.has(g) ? n = [...n, ...u] : n.push(u);
           }
         } else {
-          l = 0, c = 0, n.length = 0;
+          t = 0, c = 0, n.length = 0;
           break;
         }
       }
       if (c) {
         let p = {
           isMatch: !0,
-          score: l / c
+          score: t / c
         };
         return i && (p.indices = n), p;
       }
@@ -1227,26 +1227,26 @@ const ce = {
 });
 function ls(s, e, { auto: a = !0 } = {}) {
   const i = (o) => {
-    let t = Object.keys(o);
+    let l = Object.keys(o);
     const c = ja(o);
-    if (!c && t.length > 1 && !Ae(o))
+    if (!c && l.length > 1 && !Ae(o))
       return i(ve(o));
     if (Ia(o)) {
-      const l = c ? o[fe.PATH] : t[0], r = c ? o[fe.PATTERN] : o[l];
+      const t = c ? o[fe.PATH] : l[0], r = c ? o[fe.PATTERN] : o[t];
       if (!M(r))
-        throw new Error(la(l));
+        throw new Error(la(t));
       const F = {
-        keyId: ye(l),
+        keyId: ye(t),
         pattern: r
       };
       return a && (F.searcher = ue(r, e)), F;
     }
     let n = {
       children: [],
-      operator: t[0]
+      operator: l[0]
     };
-    return t.forEach((l) => {
-      const r = o[l];
+    return l.forEach((t) => {
+      const r = o[t];
       P(r) && r.forEach((F) => {
         n.children.push(i(F));
       });
@@ -1257,11 +1257,11 @@ function ls(s, e, { auto: a = !0 } = {}) {
 function La(s, { ignoreFieldNorm: e = N.ignoreFieldNorm }) {
   s.forEach((a) => {
     let i = 1;
-    a.matches.forEach(({ key: o, norm: t, score: c }) => {
+    a.matches.forEach(({ key: o, norm: l, score: c }) => {
       const n = o ? o.weight : null;
       i *= Math.pow(
         c === 0 && n ? Number.EPSILON : c,
-        (n || 1) * (e ? 1 : t)
+        (n || 1) * (e ? 1 : l)
       );
     }), a.score = i;
   });
@@ -1271,10 +1271,10 @@ function Ma(s, e) {
   e.matches = [], I(a) && a.forEach((i) => {
     if (!I(i.indices) || !i.indices.length)
       return;
-    const { indices: o, value: t } = i;
+    const { indices: o, value: l } = i;
     let c = {
       indices: o,
-      value: t
+      value: l
     };
     i.key && (c.key = i.key.src), i.idx > -1 && (c.refIndex = i.idx), e.matches.push(c);
   });
@@ -1287,13 +1287,13 @@ function Pa(s, e, {
   includeScore: i = N.includeScore
 } = {}) {
   const o = [];
-  return a && o.push(Ma), i && o.push(Ba), s.map((t) => {
-    const { idx: c } = t, n = {
+  return a && o.push(Ma), i && o.push(Ba), s.map((l) => {
+    const { idx: c } = l, n = {
       item: e[c],
       refIndex: c
     };
-    return o.length && o.forEach((l) => {
-      l(t, n);
+    return o.length && o.forEach((t) => {
+      t(l, n);
     }), n;
   });
 }
@@ -1315,8 +1315,8 @@ class V {
   remove(e = () => !1) {
     const a = [];
     for (let i = 0, o = this._docs.length; i < o; i += 1) {
-      const t = this._docs[i];
-      e(t, i) && (this.removeAt(i), i -= 1, o -= 1, a.push(t));
+      const l = this._docs[i];
+      e(l, i) && (this.removeAt(i), i -= 1, o -= 1, a.push(l));
     }
     return a;
   }
@@ -1330,106 +1330,106 @@ class V {
     const {
       includeMatches: i,
       includeScore: o,
-      shouldSort: t,
+      shouldSort: l,
       sortFn: c,
       ignoreFieldNorm: n
     } = this.options;
-    let l = M(e) ? M(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e);
-    return La(l, { ignoreFieldNorm: n }), t && l.sort(c), ze(a) && a > -1 && (l = l.slice(0, a)), Pa(l, this._docs, {
+    let t = M(e) ? M(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e);
+    return La(t, { ignoreFieldNorm: n }), l && t.sort(c), ze(a) && a > -1 && (t = t.slice(0, a)), Pa(t, this._docs, {
       includeMatches: i,
       includeScore: o
     });
   }
   _searchStringList(e) {
     const a = ue(e, this.options), { records: i } = this._myIndex, o = [];
-    return i.forEach(({ v: t, i: c, n }) => {
-      if (!I(t))
+    return i.forEach(({ v: l, i: c, n }) => {
+      if (!I(l))
         return;
-      const { isMatch: l, score: r, indices: F } = a.searchIn(t);
-      l && o.push({
-        item: t,
+      const { isMatch: t, score: r, indices: F } = a.searchIn(l);
+      t && o.push({
+        item: l,
         idx: c,
-        matches: [{ score: r, value: t, norm: n, indices: F }]
+        matches: [{ score: r, value: l, norm: n, indices: F }]
       });
     }), o;
   }
   _searchLogical(e) {
-    const a = ls(e, this.options), i = (n, l, r) => {
+    const a = ls(e, this.options), i = (n, t, r) => {
       if (!n.children) {
         const { keyId: E, searcher: p } = n, m = this._findMatches({
           key: this._keyStore.get(E),
-          value: this._myIndex.getValueForItemAtKeyId(l, E),
+          value: this._myIndex.getValueForItemAtKeyId(t, E),
           searcher: p
         });
         return m && m.length ? [
           {
             idx: r,
-            item: l,
+            item: t,
             matches: m
           }
         ] : [];
       }
       const F = [];
       for (let E = 0, p = n.children.length; E < p; E += 1) {
-        const m = n.children[E], y = i(m, l, r);
+        const m = n.children[E], y = i(m, t, r);
         if (y.length)
           F.push(...y);
         else if (n.operator === ce.AND)
           return [];
       }
       return F;
-    }, o = this._myIndex.records, t = {}, c = [];
-    return o.forEach(({ $: n, i: l }) => {
+    }, o = this._myIndex.records, l = {}, c = [];
+    return o.forEach(({ $: n, i: t }) => {
       if (I(n)) {
-        let r = i(a, n, l);
-        r.length && (t[l] || (t[l] = { idx: l, item: n, matches: [] }, c.push(t[l])), r.forEach(({ matches: F }) => {
-          t[l].matches.push(...F);
+        let r = i(a, n, t);
+        r.length && (l[t] || (l[t] = { idx: t, item: n, matches: [] }, c.push(l[t])), r.forEach(({ matches: F }) => {
+          l[t].matches.push(...F);
         }));
       }
     }), c;
   }
   _searchObjectList(e) {
-    const a = ue(e, this.options), { keys: i, records: o } = this._myIndex, t = [];
+    const a = ue(e, this.options), { keys: i, records: o } = this._myIndex, l = [];
     return o.forEach(({ $: c, i: n }) => {
       if (!I(c))
         return;
-      let l = [];
+      let t = [];
       i.forEach((r, F) => {
-        l.push(
+        t.push(
           ...this._findMatches({
             key: r,
             value: c[F],
             searcher: a
           })
         );
-      }), l.length && t.push({
+      }), t.length && l.push({
         idx: n,
         item: c,
-        matches: l
+        matches: t
       });
-    }), t;
+    }), l;
   }
   _findMatches({ key: e, value: a, searcher: i }) {
     if (!I(a))
       return [];
     let o = [];
     if (P(a))
-      a.forEach(({ v: t, i: c, n }) => {
-        if (!I(t))
+      a.forEach(({ v: l, i: c, n }) => {
+        if (!I(l))
           return;
-        const { isMatch: l, score: r, indices: F } = i.searchIn(t);
-        l && o.push({
+        const { isMatch: t, score: r, indices: F } = i.searchIn(l);
+        t && o.push({
           score: r,
           key: e,
-          value: t,
+          value: l,
           idx: c,
           norm: n,
           indices: F
         });
       });
     else {
-      const { v: t, n: c } = a, { isMatch: n, score: l, indices: r } = i.searchIn(t);
-      n && o.push({ score: l, key: e, value: t, norm: c, indices: r });
+      const { v: l, n: c } = a, { isMatch: n, score: t, indices: r } = i.searchIn(l);
+      n && o.push({ score: t, key: e, value: l, norm: c, indices: r });
     }
     return o;
   }
@@ -1468,24 +1468,24 @@ function Ga(s, e) {
   let a = [];
   return ns(ts, "tracks").forEach((o) => {
     var c;
-    const t = ((c = o.assays) == null ? void 0 : c.filter((n) => n.assay === s.toLowerCase())) || [];
-    t.length > 0 && o.ontology === e.toLowerCase() && a.push({
+    const l = ((c = o.assays) == null ? void 0 : c.filter((n) => n.assay === s.toLowerCase())) || [];
+    l.length > 0 && o.ontology === e.toLowerCase() && a.push({
       ...o,
-      assays: t
+      assays: l
     });
   }), a;
 }
 function cs(s) {
-  const { ontology: e, lifeStage: a, sampleType: i, displayname: o } = s, { assay: t, experimentAccession: c, fileAccession: n, url: l } = s.assays[0];
+  const { ontology: e, lifeStage: a, sampleType: i, displayname: o } = s, { assay: l, experimentAccession: c, fileAccession: n, url: t } = s.assays[0];
   return {
     ontology: U(e),
     lifeStage: U(a),
     sampleType: U(i),
     displayname: U(o),
-    assay: va(t),
+    assay: va(l),
     experimentAccession: c,
     fileAccession: n,
-    url: l
+    url: t
   };
 }
 function Ka({
@@ -1568,65 +1568,65 @@ const ee = [
   te.map((s) => [s.experimentAccession, s])
 );
 function Ge(s, e, a) {
-  const i = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map();
+  const i = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Map();
   let c = 1;
-  return s.reduce((l, r) => {
+  return s.reduce((t, r) => {
     const F = a.get(r);
-    return F && l.push(F), l;
-  }, []).forEach((l) => {
-    let r = i.get(l.assay);
+    return F && t.push(F), t;
+  }, []).forEach((t) => {
+    let r = i.get(t.assay);
     r || (r = {
-      id: l.assay,
+      id: t.assay,
       isAssayItem: !0,
-      label: l.assay,
+      label: t.assay,
       icon: "removeable",
       children: [],
       allExpAccessions: []
-    }, i.set(l.assay, r), e.children.push(r));
-    let F = o.get(l.ontology + l.assay);
+    }, i.set(t.assay, r), e.children.push(r));
+    let F = o.get(t.ontology + t.assay);
     F || (F = {
-      id: l.ontology + "_" + c++,
+      id: t.ontology + "_" + c++,
       isAssayItem: !1,
-      label: l.ontology,
+      label: t.ontology,
       icon: "removeable",
       children: [],
       allExpAccessions: []
-    }, r.children.push(F), o.set(l.ontology + l.assay, F));
+    }, r.children.push(F), o.set(t.ontology + t.assay, F));
     const E = {
-      id: l.displayname + "_" + c++,
+      id: t.displayname + "_" + c++,
       isAssayItem: !1,
-      label: l.displayname,
+      label: t.displayname,
       icon: "removeable",
       children: [],
       allExpAccessions: []
     };
     F.children.push(E);
-    let p = t.get(l.displayname + l.experimentAccession);
+    let p = l.get(t.displayname + t.experimentAccession);
     p || (p = {
-      id: l.experimentAccession,
+      id: t.experimentAccession,
       isAssayItem: !1,
-      label: l.experimentAccession,
-      icon: l.assay,
+      label: t.experimentAccession,
+      icon: t.assay,
       children: []
-    }, t.set(l.displayname + l.assay, p), E.children.push(p)), r.allExpAccessions.push(l.experimentAccession), F.allExpAccessions.push(l.experimentAccession), E.allExpAccessions.push(l.experimentAccession), e.allRowInfo.push(l);
-  }), e.children.sort((l, r) => ee.indexOf(l.id) - ee.indexOf(r.id)), [e];
+    }, l.set(t.displayname + t.assay, p), E.children.push(p)), r.allExpAccessions.push(t.experimentAccession), F.allExpAccessions.push(t.experimentAccession), E.allExpAccessions.push(t.experimentAccession), e.allRowInfo.push(t);
+  }), e.children.sort((t, r) => ee.indexOf(t.id) - ee.indexOf(r.id)), [e];
 }
 function Ke(s, e, a) {
-  const i = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map();
-  return s.reduce((n, l) => {
-    const r = a.get(l);
+  const i = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Map();
+  return s.reduce((n, t) => {
+    const r = a.get(t);
     return r && n.push(r), n;
   }, []).forEach((n) => {
     if (!n)
       return;
-    let l = i.get(n.ontology);
-    l || (l = {
+    let t = i.get(n.ontology);
+    t || (t = {
       id: n.ontology,
       label: n.ontology,
       icon: "removeable",
       children: [],
       allExpAccessions: []
-    }, i.set(n.ontology, l), e.children.push(l));
+    }, i.set(n.ontology, t), e.children.push(t));
     let r = o.get(n.displayname);
     r || (r = {
       id: n.displayname,
@@ -1634,15 +1634,15 @@ function Ke(s, e, a) {
       icon: "removeable",
       children: [],
       allExpAccessions: []
-    }, l.children.push(r), o.set(n.displayname, r));
-    let F = t.get(n.displayname + n.assay);
+    }, t.children.push(r), o.set(n.displayname, r));
+    let F = l.get(n.displayname + n.assay);
     F || (F = {
       id: n.experimentAccession,
       label: n.experimentAccession,
       icon: n.assay,
       children: []
-    }, t.set(n.displayname + n.assay, F), r.children.push(F)), l.allExpAccessions.push(n.experimentAccession), r.allExpAccessions.push(n.experimentAccession), e.allRowInfo.push(n);
-  }), e.children.sort((n, l) => se.indexOf(n.id) - se.indexOf(l.id)), [e];
+    }, l.set(n.displayname + n.assay, F), r.children.push(F)), t.allExpAccessions.push(n.experimentAccession), r.allExpAccessions.push(n.experimentAccession), e.allRowInfo.push(n);
+  }), e.children.sort((n, t) => se.indexOf(n.id) - se.indexOf(t.id)), [e];
 }
 function Ha({
   treeItems: s,
@@ -1651,8 +1651,8 @@ function Ha({
   threshold: i,
   limit: o = 10
 }) {
-  const t = s[0].allRowInfo ?? [];
-  return new V(t, {
+  const l = s[0].allRowInfo ?? [];
+  return new V(l, {
     includeScore: !0,
     shouldSort: !0,
     threshold: i,
@@ -1694,12 +1694,12 @@ const Ua = he("li")(({ theme: s }) => ({
   color: "black",
   fontFamily: "inherit"
 });
-function Xa({ icon: s, children: e, ...a }) {
-  const i = a.isAssayItem ? "subtitle2" : "body2", o = a.isAssayItem ? "bold" : 500;
+function Xa({ icon: s, children: e, isAssayItem: a, ...i }) {
+  const o = a ? "subtitle2" : "body2", l = a ? "bold" : 500;
   return /* @__PURE__ */ C.jsxs(
     Us,
     {
-      ...a,
+      ...i,
       sx: {
         display: "flex",
         alignItems: "center"
@@ -1715,8 +1715,8 @@ function Xa({ icon: s, children: e, ...a }) {
           }
         ),
         /* @__PURE__ */ C.jsxs(re, { direction: "row", spacing: 2, alignItems: "center", children: [
-          a.isAssayItem && de(a.id),
-          /* @__PURE__ */ C.jsx(Va, { fontWeight: o, variant: i, children: e })
+          a && de(i.id),
+          /* @__PURE__ */ C.jsx(Va, { fontWeight: l, variant: o, children: e })
         ] })
       ]
     }
@@ -1764,7 +1764,7 @@ const Ja = he("div")(({ theme: s }) => ({
       return de(s);
   }
 }, Qa = H.forwardRef(function(e, a) {
-  const { id: i, itemId: o, label: t, disabled: c, children: n, onRemove: l, ...r } = e, {
+  const { id: i, itemId: o, label: l, disabled: c, children: n, onRemove: t, ...r } = e, {
     getContextProviderProps: F,
     getRootProps: E,
     getContentProps: p,
@@ -1773,8 +1773,8 @@ const Ja = he("div")(({ theme: s }) => ({
     getLabelProps: w,
     getGroupTransitionProps: u,
     status: R
-  } = Zs({ id: i, itemId: o, children: n, label: t, disabled: c, rootRef: a }), g = Js(o), f = Za(g.icon), x = (G) => {
-    G.stopPropagation(), l == null || l(g);
+  } = Zs({ id: i, itemId: o, children: n, label: l, disabled: c, rootRef: a }), g = Js(o), f = Za(g.icon), x = (G) => {
+    G.stopPropagation(), t == null || t(g);
   };
   return /* @__PURE__ */ C.jsx(Xs, { ...F(), children: /* @__PURE__ */ C.jsxs(Ua, { ...E(r), children: [
     /* @__PURE__ */ C.jsxs(Ja, { ...p(), children: [
@@ -1919,10 +1919,10 @@ function ei(s) {
     labelTooltip: a,
     downloadFileName: i,
     toolbarSlot: o,
-    toolbarStyle: t,
+    toolbarStyle: l,
     toolbarIconColor: c,
     sortedAssay: n,
-    handleSelection: l,
+    handleSelection: t,
     rows: r,
     selectedTracks: F
   } = s, E = me(() => {
@@ -1931,7 +1931,7 @@ function ei(s) {
       downloadFileName: i,
       labelTooltip: a,
       toolbarSlot: o,
-      toolbarStyle: t,
+      toolbarStyle: l,
       toolbarIconColor: c
     };
     return (f) => /* @__PURE__ */ C.jsx(qs, { ...f, ...g });
@@ -1956,7 +1956,7 @@ function ei(s) {
       rowGroupingModel: m,
       groupingColDef: { leafField: "displayname", display: "flex" },
       columnVisibilityModel: { displayname: !1 },
-      onRowSelectionModelChange: l,
+      onRowSelectionModelChange: t,
       rowSelectionPropagation: { descendants: !0 },
       rowSelectionModel: { type: "include", ids: new Set(F.keys()) },
       slots: {
@@ -1990,18 +1990,18 @@ function si({
   activeTracks: a,
   isSearchResult: i
 }) {
-  const o = s((c) => c.removeIds), t = (c) => {
+  const o = s((c) => c.removeIds), l = (c) => {
     const n = c.allExpAccessions;
     if (n && n.length) {
-      const l = new Set(n);
+      const t = new Set(n);
       n.forEach((r) => {
         const F = Q.get(r);
-        F && (l.add(`auto-generated-row-ontology/${F.ontology}`), l.add(
+        F && (t.add(`auto-generated-row-ontology/${F.ontology}`), t.add(
           `auto-generated-row-ontology/${F.ontology}-assay/${F.assay}`
-        ), l.add(`auto-generated-row-assay/${F.assay}`), l.add(
+        ), t.add(`auto-generated-row-assay/${F.assay}`), t.add(
           `auto-generated-row-assay/${F.assay}-ontology/${F.ontology}`
         ));
-      }), o(l);
+      }), o(t);
     }
   };
   return /* @__PURE__ */ C.jsxs(
@@ -2070,7 +2070,7 @@ function si({
                 slots: { item: Qa },
                 slotProps: {
                   item: {
-                    onRemove: t
+                    onRemove: l
                   }
                 },
                 sx: {
@@ -2088,7 +2088,7 @@ function si({
   );
 }
 function Wi({ store: s }) {
-  const [e, a] = Z(!1), [i, o] = Z(!1), [t, c] = Z(""), [n, l] = Z(!1), r = s((S) => S.selectedTracks), F = s((S) => S.setSelected), E = s((S) => S.clear), p = s((S) => S.maxTracks), m = me(
+  const [e, a] = Z(!1), [i, o] = Z(!1), [l, c] = Z(""), [n, t] = Z(!1), r = s((S) => S.selectedTracks), F = s((S) => S.setSelected), E = s((S) => S.clear), p = s((S) => S.maxTracks), m = me(
     () => new Set(r.keys()),
     [r]
   ), y = me(() => i ? Ge(
@@ -2124,8 +2124,8 @@ function Wi({ store: s }) {
     }
   ]);
   Ze(() => {
-    t === "" && (g(y), u(te), l(!1));
-  }, [y, t]);
+    l === "" && (g(y), u(te), t(!1));
+  }, [y, l]);
   const f = () => {
     o(!i);
   }, x = (S) => {
@@ -2179,7 +2179,7 @@ function Wi({ store: s }) {
       },
       Q
     );
-    u(T), l(!0), g(Y);
+    u(T), t(!0), g(Y);
   }, G = (S) => {
     const W = (S && S.ids) ?? /* @__PURE__ */ new Set(), O = /* @__PURE__ */ new Map();
     if (W.forEach((T) => {
@@ -2265,7 +2265,7 @@ const Xe = (s) => {
       const p = e;
       e = F ?? (typeof E != "object" || E === null) ? E : Object.assign({}, e, E), a.forEach((m) => m(e, p));
     }
-  }, o = () => e, n = { setState: i, getState: o, getInitialState: () => l, subscribe: (r) => (a.add(r), () => a.delete(r)) }, l = e = s(i, o, n);
+  }, o = () => e, n = { setState: i, getState: o, getInitialState: () => t, subscribe: (r) => (a.add(r), () => a.delete(r)) }, t = e = s(i, o, n);
   return n;
 }, ai = ((s) => s ? Xe(s) : Xe), ii = (s) => s;
 function oi(s, e = ii) {
@@ -2280,21 +2280,21 @@ const Je = (s) => {
   const e = ai(s), a = (i) => oi(e, i);
   return Object.assign(a, e), a;
 }, li = ((s) => s ? Je(s) : Je);
-function Ti() {
-  return li((s, e) => ({
+function Ti(s) {
+  return li((e, a) => ({
     maxTracks: 30,
-    selectedTracks: /* @__PURE__ */ new Map(),
-    selectedIds: () => new Set(e().selectedTracks.keys()),
-    setSelected: (a) => s(() => ({
-      selectedTracks: new Map(a)
+    selectedTracks: s ? new Map(s) : /* @__PURE__ */ new Map(),
+    selectedIds: () => new Set(a().selectedTracks.keys()),
+    setSelected: (i) => e(() => ({
+      selectedTracks: new Map(i)
     })),
-    removeIds: (a) => s((i) => {
-      const o = new Map(i.selectedTracks);
-      return a.forEach((t) => {
-        o.delete(t);
-      }), { selectedTracks: o };
+    removeIds: (i) => e((o) => {
+      const l = new Map(o.selectedTracks);
+      return i.forEach((c) => {
+        l.delete(c);
+      }), { selectedTracks: l };
     }),
-    clear: () => s(() => ({ selectedTracks: /* @__PURE__ */ new Map() }))
+    clear: () => e(() => ({ selectedTracks: /* @__PURE__ */ new Map() }))
   }));
 }
 export {