@sjcrh/proteinpaint-client 2.198.0 → 2.200.0

package/dist/chunk-R6NM2HSH.js

@@ -0,0 +1,556 @@
+import {
+  isDictionaryType
+} from "./chunk-7JRDJNLR.js";
+import {
+  dtcnv,
+  dtfusionrna,
+  dtsnvindel,
+  mclasscnvAmp,
+  mclasscnvHomozygousDel,
+  mclasscnvgain,
+  mclasscnvloh,
+  mclasscnvloss
+} from "./chunk-6PNPHACF.js";
+
+// plots/matrix/matrix.sort.js
+function getSampleSorter(self, settings, rows, opts = {}) {
+  const s = settings;
+  validateSettings(s);
+  if (self.config.chartType == "hierCluster" && self.config.settings.hierCluster.clusterSamples) {
+    return self.hcSampleSorter;
+  }
+  if (s.sortSamplesBy == "asListed") {
+    return (a, b) => {
+      return self.asListedSampleOrder.indexOf(a.sample) - self.asListedSampleOrder.indexOf(b.sample);
+    };
+  }
+  if (s.sortSamplesBy == "name") {
+    return sortSamplesByName;
+  }
+  const activeOption = s.sortOptions[s.sortSamplesBy];
+  if (!activeOption) throw `unsupported s.sortSamplesBy='${s.sortSamplesBy}'`;
+  self.selectedTermsToSortAgainst = self.termOrder.filter((t) => t.tw.sortSamples);
+  const selectedTerms = self.selectedTermsToSortAgainst.map((t) => t.tw).sort((a, b) => a.sortSamples.priority - b.sortSamples.priority);
+  const sorterTerms = [];
+  const sortPriority = activeOption.sortPriority;
+  if (sortPriority) {
+    for (const _tw of selectedTerms) {
+      const tw = structuredClone(_tw);
+      if (tw.sortSamples?.by) {
+        sorterTerms.push(Object.assign({}, tw));
+        continue;
+      }
+      for (const p of sortPriority) {
+        if (opts.skipSorter?.(p, tw)) continue;
+        const type = tw.term.type == "geneVariant" && tw.q.type != "values" ? "categorical" : tw.term.type;
+        if (!p.types.includes(type)) continue;
+        for (const tb of p.tiebreakers) {
+          const sortSamples = Object.assign(structuredClone(tw.sortSamples || {}), tb);
+          const sorter = Object.assign(structuredClone(tw), { sortSamples });
+          sorterTerms.push(sorter);
+        }
+      }
+    }
+  }
+  if (sortPriority) {
+    for (const p of sortPriority) {
+      for (const t of self.termOrder) {
+        if (selectedTerms.find((tw) => tw.$id === t.tw.$id)) continue;
+        if (opts.skipSorter?.(p, t.tw)) continue;
+        if (!p.types.includes(t.tw.term.type)) continue;
+        for (const tb of p.tiebreakers) {
+          sorterTerms.push(Object.assign({}, t.tw, { sortSamples: tb }));
+        }
+      }
+    }
+  } else {
+    const unSelectedDictTerms = self.app.vocabApi.vocab?.dslabel == "PNET" ? [] : self.termOrder.filter(
+      (t) => !t.tw.sortSamples && isDictionaryType(t.tw.term.type) && !selectedTerms.find((tw) => tw.$id === t.tw.$id)
+    ).map((t) => Object.assign({ sortSamples: { by: "values" } }, t.tw));
+    const unSelectedNonDictTerms = self.app.vocabApi.vocab?.dslabel == "PNET" ? [] : self.termOrder.filter(
+      (t) => !t.tw.sortSamples && !isDictionaryType(t.tw.term.type) && !selectedTerms.find((tw) => tw.$id === t.tw.$id)
+    ).map((t) => Object.assign({ sortSamples: { by: "hits" } }, t.tw));
+    sorterTerms.push(...unSelectedNonDictTerms, ...unSelectedDictTerms);
+  }
+  if (opts.tiebreaker) sorterTerms.push(opts.tiebreaker);
+  sorterTerms.push(...s.sortSamplesTieBreakers.map((st) => st));
+  const sampleSorters = [];
+  self.maxSampleSet = /* @__PURE__ */ new Set();
+  for (const st of sorterTerms) {
+    if (typeof st === "function") sampleSorters.push(st);
+    else if (st.$id == "sample") sampleSorters.push(sortSamplesByName);
+    else if (st.sortSamples.by == "hits") sampleSorters.push(getSortSamplesByHits(st, self, rows, s));
+    else if (st.term.type != "geneVariant") sampleSorters.push(getSortSamplesByValues(st, self, rows, s));
+    else if (st.sortSamples.by == "values") sampleSorters.push(getSortSamplesByValues(st, self, rows, s));
+    else if (st.sortSamples.by == "dt") sampleSorters.push(getSortSamplesByDt(st, self, rows, s));
+    else if (st.sortSamples.by == "class") sampleSorters.push(getSortSamplesByClass(st, self, rows, s));
+    else throw `unsupported sortSamplesBy entry by='${st.sortSamples.by}'`;
+  }
+  if (!sampleSorters.find((f) => f.$id === "sample")) {
+    sampleSorters.push(sortSamplesByName);
+  }
+  return (a, b) => {
+    for (const sorter of sampleSorters) {
+      const i = sorter(a, b);
+      if (i !== 0) return i;
+    }
+  };
+}
+function validateSettings(s) {
+  if (!s.sortOptions) s.sortOptions = "custom";
+  if (["selectedTerms", "class", "dt", "hits"].includes(s.sortSamplesBy)) s.sortSamplesBy = "custom";
+}
+function sortSamplesByName(a, b) {
+  if (a._ref_.label && b._ref_.label) {
+    return a._ref_.label < b._ref_.label ? -1 : a._ref_.label > b._ref_.label ? 1 : 0;
+  }
+  if (!a.sample && !b.sample && a.row.sample) {
+    return a.row.sample < b.row.sample ? -1 : a.row.sample > b.row.sample ? 1 : 0;
+  }
+  return a.sample < b.sample ? -1 : a.sample > b.sample ? 1 : 0;
+}
+function getSortSamplesByHits(st, self, rows, s) {
+  const { $id, sortSamples } = st;
+  const hits = {};
+  for (const row of rows) {
+    if (!hits[row.sample]) hits[row.sample] = 0;
+    if ($id in row) {
+      hits[row.sample] += row[$id].countedValues?.length || 0;
+    }
+  }
+  return (a, b) => hits[a.sample] == hits[b.sample] ? 0 : hits[a.sample] > hits[b.sample] ? -1 : 1;
+}
+function getSortSamplesByValues(st, self, rows, s) {
+  const { $id, sortSamples } = st;
+  const t = self.termOrder.find((t2) => t2.tw.$id === $id);
+  if (t.grp.type == "hierCluster") {
+    return (a, b) => {
+      if ($id in a && $id in b) {
+        return a[$id]?.values[0].value - b[$id]?.values[0].value;
+      }
+      if ($id in a) return -1;
+      if ($id in b) return 1;
+      return 0;
+    };
+  }
+  if (t.tw.term.type == "termCollection") {
+    return (a, b) => {
+      if ($id in a && $id in b) {
+        return a[$id]?.numerators_sum - b[$id]?.numerators_sum;
+      }
+      if ($id in a) return -1;
+      if ($id in b) return 1;
+      return 0;
+    };
+  }
+  if (t.tw.q?.mode == "continuous") {
+    return (a, b) => {
+      if ($id in a && $id in b) {
+        return a[$id]?.value - b[$id]?.value;
+      }
+      if ($id in a) return -1;
+      if ($id in b) return 1;
+      return 0;
+    };
+  }
+  const values = [];
+  if (t?.term?.values) {
+    for (const v of term.values) {
+      values.push(v.key);
+    }
+    values.sort((a, b) => term.values[a].order < term.values[a].order ? -1 : 1);
+  } else if (t?.ref?.bins) {
+    values.push(...t.ref.bins.map((b) => b.name));
+  } else if (t.tw.q?.type == "predefined-groupset" || t.tw.q?.type == "custom-groupset") {
+    const groupset = t.tw.q.type == "predefined-groupset" ? t.tw.term.groupsetting.lst[t.tw.q.predefined_groupset_idx] : t.tw.q.customset;
+    if (!groupset) throw "groupset missing";
+    const grpNames = groupset.groups.filter((group) => !group.uncomputable).map((group) => group.name);
+    values.push(...grpNames);
+  } else {
+    for (const row of rows) {
+      if (!($id in row)) continue;
+      const v = row[$id].override?.key || row[$id].key;
+      if (values.indexOf(v) == -1) values.push(v);
+    }
+  }
+  return (a, b) => {
+    if (!a[$id] && !b[$id]) return 0;
+    if (!a[$id]) return b[$id].override ? -1 : 1;
+    if (!b[$id]) return a[$id].override ? 1 : -1;
+    if (a[$id].override && b[$id].override) {
+      const ak = "order" in a[$id].override ? a[$id].override.order : values.indexOf(a[$id].override.key);
+      const bk = "order" in b[$id].override ? b[$id].override.order : values.indexOf(b[$id].override.key);
+      return ak - bk;
+    }
+    if (!a[$id].override && !b[$id].override) {
+      return values.indexOf(a[$id].key) - values.indexOf(b[$id].key);
+    }
+    if (!a[$id].override) return -1;
+    if (!b[$id].override) return 1;
+    return 0;
+  };
+}
+function getSortSamplesByDt(st, self, rows, s) {
+  const { $id, sortSamples, term: term2 } = st;
+  const order = sortSamples.order;
+  const nextRound = order.length + 1;
+  const dt = /* @__PURE__ */ new Map();
+  function setSortIndex(row) {
+    if (!($id in row)) {
+      dt.set(row.sample, nextRound);
+      return;
+    }
+    if (sortSamples.filter && !findMatchingValue(row[$id].values, sortSamples.filter.values)) {
+      dt.set(row.sample, nextRound);
+      return;
+    }
+    const indices = row[$id].values.map((v) => order.indexOf(v.dt)).filter((i) => i !== -1);
+    dt.set(row.sample, indices.length ? Math.min(...indices) : nextRound);
+  }
+  return (a, b) => {
+    if (!dt.has(a.sample)) setSortIndex(a);
+    if (!dt.has(b.sample)) setSortIndex(b);
+    return dt.get(a.sample) - dt.get(b.sample);
+  };
+}
+function getSortSamplesByClass(st, self, rows, s) {
+  const { $id, sortSamples } = st;
+  if (sortSamples.disabled) return () => 0;
+  const m = self.config.settings.matrix;
+  const includeSSM = m.showMatrixMutation != "none" && !m.allMatrixMutationHidden;
+  const includeCNV = m.showMatrixCNV != "none" && !m.allMatrixCNVHidden;
+  const order = sortSamples.order.filter(
+    includeSSM && includeCNV ? (v) => !m.hiddenVariants.includes(v) : !includeSSM && !includeCNV ? () => false : includeSSM ? (v) => m.mutationClasses.includes(v) && !m.hiddenVariants.includes(v) : includeCNV ? (v) => v.startsWith("CNV_") && !m.hiddenVariants.includes(v) : (v) => !v.startsWith("CNV_")
+  );
+  if (!order.length && sortSamples.ignoreEmptyFilteredOrder) return () => 0;
+  const nextRound = "z";
+  const cls = /* @__PURE__ */ new Map();
+  function setSortIndex(row) {
+    if (!($id in row)) {
+      cls.set(row.sample, nextRound);
+      return;
+    }
+    const values = row[$id].renderedValues || row[$id].filteredValues || row[$id].values;
+    if (sortSamples.filter && !findMatchingValue(values, sortSamples.filter.values)) {
+      cls.set(row.sample, nextRound);
+      return;
+    }
+    const vals = values.map((v) => v.class);
+    if (!order.find((mcls) => vals.includes(mcls))) {
+      cls.set(row.sample, nextRound);
+      return;
+    } else if (!sortSamples.isOrdered) {
+      cls.set(row.sample, "1");
+    } else {
+      const str = order.map((mcls) => vals.includes(mcls) ? "1" : "x");
+      cls.set(row.sample, str);
+    }
+  }
+  return (a, b) => {
+    if (!cls.has(a.sample)) setSortIndex(a);
+    if (!cls.has(b.sample)) setSortIndex(b);
+    const ca = cls.get(a.sample);
+    const cb = cls.get(b.sample);
+    return ca < cb ? -1 : ca > cb ? 1 : 0;
+  };
+}
+function findMatchingValue(annoValues, filterValues) {
+  for (const v of annoValues) {
+    for (const f of filterValues) {
+      if ((!f.dt || v.dt === f.dt) && (!f.mclassLst || f.mclassLst.includes(v.class)) && (!f.class || f.class === v.class) && (!f.origin || v.origin === f.origin)) {
+        return true;
+      }
+    }
+  }
+}
+function getTermSorter(self, s, grp) {
+  if (grp?.type == "hierCluster") return self.hcTermSorter;
+  if (s.sortTermsBy == "asListed") {
+    return (a, b) => a.index - b.index;
+  }
+  if (s.sortTermsBy != "sampleCount") {
+    throw `unsupported s.sortTermsBy='${s.sortTermsBy}'`;
+  }
+  return (a, b) => {
+    if (self.app.vocabApi.termdbConfig?.matrix?.sortDictTermsFirst) {
+      if (a.tw?.term?.id && !b.tw?.term?.id) return -1;
+      if (!a.tw?.term?.id && b.tw?.term?.id) return 1;
+    }
+    if (b.counts.samples !== a.counts.samples) return b.counts.samples - a.counts.samples;
+    if (b.counts.hits !== a.counts.hits) return b.counts.hits - a.counts.hits;
+    return a.index - b.index;
+  };
+}
+function getSortOptions(termdbConfig, controlLabels = {}, matrixSettings) {
+  const s = matrixSettings || termdbConfig?.matrix?.settings || {};
+  const l = Object.assign({ sample: "sample" }, controlLabels, s.controlLabels || {});
+  const sortOptions = {};
+  if (s.sortPriority) {
+    const order = 1;
+    Object.values(sortOptions).forEach((d) => {
+      if (d.order >= order) d.order += 1;
+    });
+    sortOptions.custom = {
+      label: s.sortPriority.label || "Custom sort",
+      value: "custom",
+      order,
+      sortPriority: s.sortPriority
+    };
+  }
+  const cnvClasses = [mclasscnvAmp, mclasscnvHomozygousDel, mclasscnvgain, mclasscnvloss, mclasscnvloh];
+  const proteinChangingClasses = (s.proteinChangingMutations || []).filter(
+    (mcls) => !s.truncatingMutations.includes(mcls)
+  );
+  const sortedClasses = ["Fuserna", ...s.truncatingMutations || [], ...cnvClasses, ...proteinChangingClasses];
+  sortOptions.a = s.sortOptions?.a ? reshapeSortPriority(s.sortOptions.a, l) : {
+    //label: l.Mutation + ' categories', //'CNV+SSM > SSM-only > CNV-only',
+    // altLabels: {
+    // 	mutationOnly: 'SSM',
+    // 	cnvOnly: 'CNV',
+    // },
+    value: "a",
+    order: 1,
+    // this is used for list order as a sorter option in a dropdown
+    sortPriority: [
+      {
+        label: `For each gene mutation, sort ${l.samples} by matching data`,
+        types: ["geneVariant"],
+        tiebreakers: [
+          {
+            skip: !s.mutationClasses.includes("Fuserna"),
+            // not visible, cannot be enabled
+            label: `${l.Samples} with Fusion RNASeq > without`,
+            filter: {
+              values: [
+                {
+                  dt: dtfusionrna
+                }
+              ]
+            },
+            by: "class",
+            isOrdered: false,
+            order: [
+              "Fuserna"
+              /*'WT', 'Blank'*/
+            ]
+          },
+          {
+            label: `${l.Samples} with truncating mutations > without`,
+            filter: {
+              values: [
+                {
+                  dt: dtsnvindel
+                }
+              ]
+            },
+            by: "class",
+            isOrdered: false,
+            order: [
+              ...s.truncatingMutations
+              // // truncating
+              // 'F', // FRAMESHIFT
+              // 'N', // NONSENSE
+              // 'L', // SPLICE
+              // 'P', // SPLICE_REGION
+              // // indel
+              // 'D', // PROTEINDEL
+              // 'I', // PROTEININS
+              // 'ProteinAltering',
+              // // point
+              // 'M' // MISSENSE
+            ],
+            // do not have the option to add unused protein-changing mutations,
+            // because the "truncating" label for this tiebreaker will not make sense
+            notUsed: []
+          },
+          {
+            label: `${l.Samples} with CNV data > without`,
+            mayToggle: true,
+            filter: {
+              values: [
+                {
+                  dt: dtcnv
+                }
+              ]
+            },
+            by: "class",
+            isOrdered: true,
+            disabled: true,
+            // visible, can be enabled
+            order: cnvClasses
+          },
+          {
+            disabled: false,
+            mayToggle: true,
+            label: `${l.Samples} with protein-changing mutations > without`,
+            filter: {
+              values: [
+                {
+                  dt: dtsnvindel
+                }
+              ]
+            },
+            by: "class",
+            isOrdered: false,
+            // by default, do not include truncating mutations here since they may
+            // already be used in the tiebreaker with truncating mutations
+            order: proteinChangingClasses,
+            notUsed: s.truncatingMutations
+          },
+          {
+            disabled: false,
+            mayToggle: true,
+            label: `${l.Samples} with other classification > without`,
+            filter: {
+              values: [
+                {
+                  dt: dtsnvindel
+                }
+              ]
+            },
+            by: "class",
+            isOrdered: false,
+            order: s.mutationClasses.filter((cls) => !sortedClasses.includes(cls) && cls != "Blank"),
+            notUsed: []
+          }
+        ]
+      },
+      {
+        label: `For each dictionary variable, sort ${l.samples} by matching data`,
+        types: ["categorical", "integer", "float", "survival"],
+        tiebreakers: [
+          {
+            label: "Values",
+            by: "values"
+          }
+        ]
+      }
+    ]
+  };
+  sortOptions.name = {
+    label: `By ${l.sample} name, ID, or label`,
+    value: "name",
+    order: Object.values(sortOptions).length
+  };
+  return sortOptions;
+}
+function getSampleGroupSorter(self) {
+  const s = self.settings.matrix;
+  if (s.sortSampleGrpsBy == "hits")
+    return (a, b) => {
+      if (a.lst.length && !b.lst.length) return -1;
+      if (!a.lst.length && b.lst.length) return 1;
+      return b.totalCountedValues - a.totalCountedValues;
+    };
+  if (s.sortSampleGrpsBy == "sampleCount")
+    return (a, b) => {
+      if (a.lst.length && !b.lst.length) return -1;
+      if (!a.lst.length && b.lst.length) return 1;
+      if (a.lst.length == b.lst.length) {
+        return defaultSorter(a, b);
+      }
+      return b.lst.length - a.lst.length;
+    };
+  if (!self.config.divideBy?.$id) return defaultSorter;
+  const ref = self.data.refs.byTermId[self.config.divideBy.$id];
+  if (ref && !ref.keyOrder) ref.keyOrder = ref.bins ? ref.bins.map((b) => b.name) : [];
+  const predefinedKeyOrder = self.data.refs.byTermId[self.config.divideBy.$id]?.keyOrder;
+  if (!predefinedKeyOrder) return defaultSorter;
+  return (a, b) => {
+    a.order = predefinedKeyOrder.indexOf(a.id);
+    if (a.order == -1) delete a.order;
+    b.order = predefinedKeyOrder.indexOf(b.id);
+    if (b.order == -1) delete b.order;
+    if ("order" in a && "order" in b) return a.order - b.order;
+    if ("order" in a) return -1;
+    if ("order" in b) return 1;
+    if (a.tw?.term?.values?.[a.id]?.order && b.tw?.term?.values?.[b.id]?.order) {
+      return a.tw.term.values[a.id].order - b.tw.term.values[b.id].order;
+    }
+    return defaultSorter(a, b);
+  };
+}
+function defaultSorter(a, b) {
+  return a.name < b.name ? -1 : 1;
+}
+function getMclassSorter(self) {
+  const s = self.settings.matrix;
+  const activeOption = s.sortOptions[s.sortSamplesBy].sortPriority ? s.sortOptions[s.sortSamplesBy] : s.sortOptions.a;
+  const mclassPriority = [];
+  activeOption.sortPriority.forEach((obj) => {
+    if (obj.types.includes("geneVariant")) {
+      obj.tiebreakers.forEach((tiebreaker) => {
+        if (tiebreaker.by == "class" && tiebreaker.order) {
+          mclassPriority.push(...tiebreaker.order.filter((t) => t !== "WT" && t !== "Blank"));
+        }
+      });
+    }
+  });
+  const sorter = (a, b) => {
+    const ai = mclassPriority.indexOf(a.class);
+    const bi = mclassPriority.indexOf(b.class);
+    return ai == -1 && bi == -1 ? 0 : mclassPriority.indexOf(a.class) == -1 ? 1 : mclassPriority.indexOf(b.class) == -1 ? -1 : mclassPriority.indexOf(a.class) - mclassPriority.indexOf(b.class);
+  };
+  return sorter;
+}
+function reshapeSortPriority(sortOption, labels) {
+  const l = labels;
+  let geneVariantsEntry;
+  for (const sp of sortOption.sortPriority) {
+    if (sp.types.includes("categorical")) {
+      if (!sp.label) sp.label = `For each dictionary variable, sort ${l.samples} by matching data`;
+      continue;
+    }
+    if (!sp.types?.includes("geneVariant")) continue;
+    if (!geneVariantsEntry) {
+      geneVariantsEntry = sp;
+      if (!sp.label) sp.label = `For each gene mutation, sort ${l.samples} by matching data`;
+    } else {
+      geneVariantsEntry.tiebreakers.push(...sp.tiebreakers);
+      sp.toBeDeleted = true;
+    }
+  }
+  for (const tb of geneVariantsEntry.tiebreakers) {
+    const origClone = structuredClone(tb);
+    if (tb.filter?.values?.find((v) => v.dt == dtfusionrna)) {
+      const defaults = {
+        label: `${l.Samples} with Fusion RNASeq > without`,
+        isOrdered: true,
+        disabled: false,
+        mayToggle: true
+      };
+      Object.assign(tb, defaults, origClone);
+    } else if (tb.filter?.values?.find((v) => v.dt == dtsnvindel)) {
+      const label = tb.order.includes(mclasscnvgain) || tb.order.includes(mclasscnvloss) ? `${l.Samples} with SSM + CNV > SSM only` : `${l.Samples} with mutations`;
+      const defaults = {
+        label,
+        isOrdered: true,
+        disabled: false,
+        mayToggle: true
+      };
+      Object.assign(tb, defaults, origClone);
+    } else if (tb.order.length == 2 && tb.order.includes(mclasscnvgain) && tb.order.includes(mclasscnvloss)) {
+      const defaults = {
+        label: `${l.Samples} with CNV only > without`,
+        filter: { values: [{ dt: dtcnv }] },
+        by: "class",
+        isOrdered: true,
+        disabled: false,
+        mayToggle: true
+      };
+      Object.assign(tb, defaults, origClone);
+    }
+  }
+  sortOption.sortPriority = sortOption.sortPriority.filter((sp) => !sp.toBeDeleted);
+  return sortOption;
+}
+
+export {
+  getSampleSorter,
+  getTermSorter,
+  getSortOptions,
+  getSampleGroupSorter,
+  getMclassSorter,
+  reshapeSortPriority
+};
+//# sourceMappingURL=chunk-R6NM2HSH.js.map

package/dist/chunk-R6NM2HSH.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../plots/matrix/matrix.sort.js"],
+  "sourcesContent": ["import { isDictionaryType } from '#shared/terms.js'\nimport {\n\tdtsnvindel,\n\tdtfusionrna,\n\tdtcnv,\n\tmclasscnvgain,\n\tmclasscnvloss,\n\tmclasscnvAmp,\n\tmclasscnvHomozygousDel,\n\tmclasscnvloh\n} from '#shared/common.js'\n\nexport function getSampleSorter(self, settings, rows, opts = {}) {\n\tconst s = settings\n\tvalidateSettings(s)\n\tif (self.config.chartType == 'hierCluster' && self.config.settings.hierCluster.clusterSamples) {\n\t\treturn self.hcSampleSorter\n\t}\n\n\tif (s.sortSamplesBy == 'asListed') {\n\t\treturn (a, b) => {\n\t\t\treturn self.asListedSampleOrder.indexOf(a.sample) - self.asListedSampleOrder.indexOf(b.sample)\n\t\t}\n\t}\n\n\tif (s.sortSamplesBy == 'name') {\n\t\t//no additional logic required\n\t\treturn sortSamplesByName\n\t}\n\n\tconst activeOption = s.sortOptions[s.sortSamplesBy]\n\tif (!activeOption) throw `unsupported s.sortSamplesBy='${s.sortSamplesBy}'`\n\n\tself.selectedTermsToSortAgainst = self.termOrder.filter(t => t.tw.sortSamples) // sortSamples property indicates a term is selected\n\tconst selectedTerms = self.selectedTermsToSortAgainst\n\t\t.map(t => t.tw)\n\t\t.sort((a, b) => a.sortSamples.priority - b.sortSamples.priority)\n\n\tconst sorterTerms = []\n\n\tconst sortPriority = activeOption.sortPriority\n\tif (sortPriority) {\n\t\tfor (const _tw of selectedTerms) {\n\t\t\tconst tw = structuredClone(_tw)\n\t\t\tif (tw.sortSamples?.by) {\n\t\t\t\tsorterTerms.push(Object.assign({}, tw))\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tfor (const p of sortPriority) {\n\t\t\t\tif (opts.skipSorter?.(p, tw)) continue\n\t\t\t\tconst type = tw.term.type == 'geneVariant' && tw.q.type != 'values' ? 'categorical' : tw.term.type\n\t\t\t\tif (!p.types.includes(type)) continue\n\t\t\t\tfor (const tb of p.tiebreakers) {\n\t\t\t\t\tconst sortSamples = Object.assign(structuredClone(tw.sortSamples || {}), tb)\n\t\t\t\t\tconst sorter = Object.assign(structuredClone(tw), { sortSamples })\n\t\t\t\t\tsorterTerms.push(sorter)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// now apply sort priority as specified in the\n\t// ds.matrix.settings sortPriority, if applicable\n\tif (sortPriority) {\n\t\tfor (const p of sortPriority) {\n\t\t\tfor (const t of self.termOrder) {\n\t\t\t\t// skip the selectedTerms that were already processed above\n\t\t\t\tif (selectedTerms.find(tw => tw.$id === t.tw.$id)) continue\n\t\t\t\tif (opts.skipSorter?.(p, t.tw)) continue\n\t\t\t\tif (!p.types.includes(t.tw.term.type)) continue\n\t\t\t\tfor (const tb of p.tiebreakers) {\n\t\t\t\t\tsorterTerms.push(Object.assign({}, t.tw, { sortSamples: tb }))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// !!! QUICK FIX:\n\t\t// make sure to not affect the publised PNET matrix figure\n\t\tconst unSelectedDictTerms =\n\t\t\tself.app.vocabApi.vocab?.dslabel == 'PNET'\n\t\t\t\t? []\n\t\t\t\t: self.termOrder\n\t\t\t\t\t\t// sort against only dictionary terms in this tie-breaker\n\t\t\t\t\t\t.filter(\n\t\t\t\t\t\t\tt =>\n\t\t\t\t\t\t\t\t!t.tw.sortSamples && isDictionaryType(t.tw.term.type) && !selectedTerms.find(tw => tw.$id === t.tw.$id)\n\t\t\t\t\t\t)\n\t\t\t\t\t\t.map(t => Object.assign({ sortSamples: { by: 'values' } }, t.tw))\n\n\t\tconst unSelectedNonDictTerms =\n\t\t\tself.app.vocabApi.vocab?.dslabel == 'PNET'\n\t\t\t\t? []\n\t\t\t\t: self.termOrder\n\t\t\t\t\t\t// sort against only non-dictionary terms in this tie-breaker\n\t\t\t\t\t\t.filter(\n\t\t\t\t\t\t\tt =>\n\t\t\t\t\t\t\t\t!t.tw.sortSamples && !isDictionaryType(t.tw.term.type) && !selectedTerms.find(tw => tw.$id === t.tw.$id)\n\t\t\t\t\t\t)\n\t\t\t\t\t\t.map(t => Object.assign({ sortSamples: { by: 'hits' } }, t.tw))\n\n\t\tsorterTerms.push(...unSelectedNonDictTerms, ...unSelectedDictTerms)\n\t}\n\tif (opts.tiebreaker) sorterTerms.push(opts.tiebreaker)\n\tsorterTerms.push(...s.sortSamplesTieBreakers.map(st => st))\n\n\tconst sampleSorters = []\n\tself.maxSampleSet = new Set()\n\tfor (const st of sorterTerms) {\n\t\tif (typeof st === 'function') sampleSorters.push(st)\n\t\telse if (st.$id == 'sample') sampleSorters.push(sortSamplesByName)\n\t\telse if (st.sortSamples.by == 'hits') sampleSorters.push(getSortSamplesByHits(st, self, rows, s))\n\t\telse if (st.term.type != 'geneVariant') sampleSorters.push(getSortSamplesByValues(st, self, rows, s))\n\t\telse if (st.sortSamples.by == 'values') sampleSorters.push(getSortSamplesByValues(st, self, rows, s))\n\t\telse if (st.sortSamples.by == 'dt') sampleSorters.push(getSortSamplesByDt(st, self, rows, s))\n\t\telse if (st.sortSamples.by == 'class') sampleSorters.push(getSortSamplesByClass(st, self, rows, s))\n\t\telse throw `unsupported sortSamplesBy entry by='${st.sortSamples.by}'`\n\t}\n\n\t// default to always use sortSamplesByName as a tie-breaker\n\tif (!sampleSorters.find(f => f.$id === 'sample')) {\n\t\tsampleSorters.push(sortSamplesByName)\n\t}\n\n\treturn (a, b) => {\n\t\tfor (const sorter of sampleSorters) {\n\t\t\tconst i = sorter(a, b)\n\t\t\tif (i !== 0) return i\n\t\t}\n\t}\n}\n\nfunction validateSettings(s) {\n\tif (!s.sortOptions) s.sortOptions = 'custom'\n\tif (['selectedTerms', 'class', 'dt', 'hits'].includes(s.sortSamplesBy)) s.sortSamplesBy = 'custom'\n}\n\nfunction sortSamplesByName(a, b) {\n\tif (a._ref_.label && b._ref_.label) {\n\t\treturn a._ref_.label < b._ref_.label ? -1 : a._ref_.label > b._ref_.label ? 1 : 0\n\t}\n\tif (!a.sample && !b.sample && a.row.sample) {\n\t\treturn a.row.sample < b.row.sample ? -1 : a.row.sample > b.row.sample ? 1 : 0\n\t}\n\treturn a.sample < b.sample ? -1 : a.sample > b.sample ? 1 : 0\n}\n\nfunction getSortSamplesByHits(st, self, rows, s) {\n\tconst { $id, sortSamples } = st\n\tconst hits = {}\n\tfor (const row of rows) {\n\t\tif (!hits[row.sample]) hits[row.sample] = 0\n\t\tif ($id in row) {\n\t\t\thits[row.sample] += row[$id].countedValues?.length || 0\n\t\t}\n\t}\n\treturn (a, b) => (hits[a.sample] == hits[b.sample] ? 0 : hits[a.sample] > hits[b.sample] ? -1 : 1)\n}\n\nfunction getSortSamplesByValues(st, self, rows, s) {\n\tconst { $id, sortSamples } = st\n\tconst t = self.termOrder.find(t => t.tw.$id === $id)\n\n\tif (t.grp.type == 'hierCluster') {\n\t\treturn (a, b) => {\n\t\t\tif ($id in a && $id in b) {\n\t\t\t\t// may need to support other term types\n\t\t\t\treturn a[$id]?.values[0].value - b[$id]?.values[0].value\n\t\t\t}\n\t\t\tif ($id in a) return -1\n\t\t\tif ($id in b) return 1\n\t\t\treturn 0\n\t\t}\n\t}\n\n\tif (t.tw.term.type == 'termCollection') {\n\t\t//TODO: add more sorting logic when more termCollection types defined\n\t\treturn (a, b) => {\n\t\t\tif ($id in a && $id in b) {\n\t\t\t\treturn a[$id]?.numerators_sum - b[$id]?.numerators_sum\n\t\t\t}\n\t\t\tif ($id in a) return -1\n\t\t\tif ($id in b) return 1\n\t\t\treturn 0\n\t\t}\n\t}\n\n\tif (t.tw.q?.mode == 'continuous') {\n\t\treturn (a, b) => {\n\t\t\tif ($id in a && $id in b) {\n\t\t\t\treturn a[$id]?.value - b[$id]?.value\n\t\t\t}\n\t\t\tif ($id in a) return -1\n\t\t\tif ($id in b) return 1\n\t\t\treturn 0\n\t\t}\n\t}\n\n\tconst values = []\n\tif (t?.term?.values) {\n\t\tfor (const v of term.values) {\n\t\t\tvalues.push(v.key)\n\t\t}\n\t\tvalues.sort((a, b) => (term.values[a].order < term.values[a].order ? -1 : 1))\n\t} else if (t?.ref?.bins) {\n\t\tvalues.push(...t.ref.bins.map(b => b.name))\n\t} else if (t.tw.q?.type == 'predefined-groupset' || t.tw.q?.type == 'custom-groupset') {\n\t\tconst groupset =\n\t\t\tt.tw.q.type == 'predefined-groupset'\n\t\t\t\t? t.tw.term.groupsetting.lst[t.tw.q.predefined_groupset_idx]\n\t\t\t\t: t.tw.q.customset\n\t\tif (!groupset) throw 'groupset missing'\n\t\tconst grpNames = groupset.groups.filter(group => !group.uncomputable).map(group => group.name)\n\t\tvalues.push(...grpNames)\n\t} else {\n\t\tfor (const row of rows) {\n\t\t\tif (!($id in row)) continue\n\t\t\tconst v = row[$id].override?.key || row[$id].key\n\t\t\tif (values.indexOf(v) == -1) values.push(v)\n\t\t}\n\t}\n\n\treturn (a, b) => {\n\t\tif (!a[$id] && !b[$id]) return 0\n\t\tif (!a[$id]) return b[$id].override ? -1 : 1\n\t\tif (!b[$id]) return a[$id].override ? 1 : -1\n\t\tif (a[$id].override && b[$id].override) {\n\t\t\tconst ak = 'order' in a[$id].override ? a[$id].override.order : values.indexOf(a[$id].override.key)\n\t\t\tconst bk = 'order' in b[$id].override ? b[$id].override.order : values.indexOf(b[$id].override.key)\n\t\t\treturn ak - bk\n\t\t}\n\t\tif (!a[$id].override && !b[$id].override) {\n\t\t\treturn values.indexOf(a[$id].key) - values.indexOf(b[$id].key)\n\t\t}\n\t\tif (!a[$id].override) return -1\n\t\tif (!b[$id].override) return 1\n\t\treturn 0\n\t}\n}\n\nfunction getSortSamplesByDt(st, self, rows, s) {\n\tconst { $id, sortSamples, term } = st\n\tconst order = sortSamples.order\n\tconst nextRound = order.length + 1\n\t// benchmark:\n\t// - fastest by 100+ ms: using Map and not pre-sorting\n\t// - ok: using {} as a tracker and either pre-sorting or not\n\t// - slowest: using Map and pre-sorting\n\tconst dt = new Map()\n\n\tfunction setSortIndex(row) {\n\t\tif (!($id in row)) {\n\t\t\tdt.set(row.sample, nextRound)\n\t\t\treturn\n\t\t}\n\t\tif (sortSamples.filter && !findMatchingValue(row[$id].values, sortSamples.filter.values)) {\n\t\t\tdt.set(row.sample, nextRound)\n\t\t\treturn\n\t\t}\n\t\tconst indices = row[$id].values.map(v => order.indexOf(v.dt)).filter(i => i !== -1)\n\t\tdt.set(row.sample, indices.length ? Math.min(...indices) : nextRound)\n\t}\n\n\treturn (a, b) => {\n\t\tif (!dt.has(a.sample)) setSortIndex(a)\n\t\tif (!dt.has(b.sample)) setSortIndex(b)\n\t\treturn dt.get(a.sample) - dt.get(b.sample)\n\t}\n\n\t// rows.forEach(setSortIndex)\n\t// return (a, b) => dt.get(a.sample) - dt.get(b.sample)\n}\n\nfunction getSortSamplesByClass(st, self, rows, s) {\n\tconst { $id, sortSamples } = st\n\tif (sortSamples.disabled) return () => 0\n\n\tconst m = self.config.settings.matrix\n\tconst includeSSM = m.showMatrixMutation != 'none' && !m.allMatrixMutationHidden\n\tconst includeCNV = m.showMatrixCNV != 'none' && !m.allMatrixCNVHidden\n\tconst order = sortSamples.order.filter(\n\t\tincludeSSM && includeCNV\n\t\t\t? v => !m.hiddenVariants.includes(v)\n\t\t\t: !includeSSM && !includeCNV\n\t\t\t? () => false\n\t\t\t: includeSSM\n\t\t\t? v => m.mutationClasses.includes(v) && !m.hiddenVariants.includes(v)\n\t\t\t: includeCNV\n\t\t\t? v => v.startsWith('CNV_') && !m.hiddenVariants.includes(v)\n\t\t\t: v => !v.startsWith('CNV_')\n\t)\n\n\tif (!order.length && sortSamples.ignoreEmptyFilteredOrder) return () => 0\n\n\tconst nextRound = 'z' // this string will cause a sample to be sorted last in a tiebreaker round\n\t// benchmark:\n\t// - fastest by 100+ ms: using Map and not pre-sorting\n\t// - ok: using {} as a tracker and either pre-sorting or not\n\t// - slowest: using Map and pre-sorting\n\tconst cls = new Map()\n\t// Example idea:\n\t//\n\t// sortPriority order = [mclasscnvgain, mclasscnvloss, 'F', 'N', 'L', 'P']\n\t// if sample.values has a matching mclass in order, map to '1', otherwise map to 'x'\n\t//\n\t// sample1.values: [mclasscnvgain, 'F']       => '1x1xxx'  // first sample by string order\n\t// sample2.values: [mclasscnvgain, 'P']       => '1xxxx1'\n\t// sample3.values: [mclasscnvloss, 'F', 'L'] => 'x11x1x'\n\t// sample4.values: ['F', 'N']             => 'xx11xx'\n\t// sample5.values: ['noncoding]           => 'z'       // next round of tiebreakers\n\n\tfunction setSortIndex(row) {\n\t\tif (!($id in row)) {\n\t\t\t// there is no value to index, force the sorting to the next round of tiebreakers\n\t\t\tcls.set(row.sample, nextRound)\n\t\t\treturn\n\t\t}\n\t\tconst values = row[$id].renderedValues || row[$id].filteredValues || row[$id].values\n\t\tif (sortSamples.filter && !findMatchingValue(values, sortSamples.filter.values)) {\n\t\t\t// there is no matching values, force the sorting to the next round of tiebreakers\n\t\t\tcls.set(row.sample, nextRound)\n\t\t\treturn\n\t\t}\n\n\t\tconst vals = values.map(v => v.class)\n\t\tif (!order.find(mcls => vals.includes(mcls))) {\n\t\t\t// there is no matching values, force the sorting to the next round of tiebreakers\n\t\t\tcls.set(row.sample, nextRound)\n\t\t\treturn\n\t\t} else if (!sortSamples.isOrdered) {\n\t\t\tcls.set(row.sample, '1')\n\t\t} else {\n\t\t\t// each sample will be mapped to a sortable string (for ease of sorting comparison),\n\t\t\t// derived from concatenating an array of characters equivalent to indicate\n\t\t\t// natching or not matching an ordered mclass\n\t\t\tconst str = order.map(mcls => (vals.includes(mcls) ? '1' : 'x'))\n\t\t\tcls.set(row.sample, str)\n\t\t}\n\t}\n\n\t// not calling setSortIndex in advance based on the benchmark notes above\n\t// rows.forEach(setSortIndex)\n\treturn (a, b) => {\n\t\tif (!cls.has(a.sample)) setSortIndex(a)\n\t\tif (!cls.has(b.sample)) setSortIndex(b)\n\t\tconst ca = cls.get(a.sample)\n\t\tconst cb = cls.get(b.sample)\n\t\treturn ca < cb ? -1 : ca > cb ? 1 : 0\n\t}\n}\n\nfunction findMatchingValue(annoValues, filterValues) {\n\tfor (const v of annoValues) {\n\t\tfor (const f of filterValues) {\n\t\t\tif (\n\t\t\t\t(!f.dt || v.dt === f.dt) &&\n\t\t\t\t(!f.mclassLst || f.mclassLst.includes(v.class)) &&\n\t\t\t\t(!f.class || f.class === v.class) &&\n\t\t\t\t(!f.origin || v.origin === f.origin)\n\t\t\t) {\n\t\t\t\treturn true\n\t\t\t}\n\t\t}\n\t}\n}\n\nexport function getTermSorter(self, s, grp) {\n\tif (grp?.type == 'hierCluster') return self.hcTermSorter\n\n\tif (s.sortTermsBy == 'asListed') {\n\t\t//no additional logic required\n\t\treturn (a, b) => a.index - b.index\n\t}\n\n\tif (s.sortTermsBy != 'sampleCount') {\n\t\tthrow `unsupported s.sortTermsBy='${s.sortTermsBy}'`\n\t}\n\n\treturn (a, b) => {\n\t\t// opt-in: put dictionary terms above non-dictionary terms. must stay off by default so the\n\t\t// published PNET matrix figure is unaffected\n\t\tif (self.app.vocabApi.termdbConfig?.matrix?.sortDictTermsFirst) {\n\t\t\tif (a.tw?.term?.id && !b.tw?.term?.id) return -1\n\t\t\tif (!a.tw?.term?.id && b.tw?.term?.id) return 1\n\t\t}\n\n\t\tif (b.counts.samples !== a.counts.samples) return b.counts.samples - a.counts.samples\n\t\tif (b.counts.hits !== a.counts.hits) return b.counts.hits - a.counts.hits\n\t\treturn a.index - b.index\n\t}\n}\n\nexport function getSortOptions(termdbConfig, controlLabels = {}, matrixSettings) {\n\tconst s = matrixSettings || termdbConfig?.matrix?.settings || {}\n\tconst l = Object.assign({ sample: 'sample' }, controlLabels, s.controlLabels || {})\n\n\tconst sortOptions = {}\n\tif (s.sortPriority) {\n\t\tconst order = 1\n\t\tObject.values(sortOptions).forEach(d => {\n\t\t\tif (d.order >= order) d.order += 1\n\t\t})\n\t\tsortOptions.custom = {\n\t\t\tlabel: s.sortPriority.label || 'Custom sort',\n\t\t\tvalue: 'custom',\n\t\t\torder,\n\t\t\tsortPriority: s.sortPriority\n\t\t}\n\t}\n\n\tconst cnvClasses = [mclasscnvAmp, mclasscnvHomozygousDel, mclasscnvgain, mclasscnvloss, mclasscnvloh]\n\tconst proteinChangingClasses = (s.proteinChangingMutations || []).filter(\n\t\tmcls => !s.truncatingMutations.includes(mcls)\n\t)\n\tconst sortedClasses = ['Fuserna', ...(s.truncatingMutations || []), ...cnvClasses, ...proteinChangingClasses]\n\n\t// Similar to Oncoprint sorting\n\tsortOptions.a = s.sortOptions?.a\n\t\t? reshapeSortPriority(s.sortOptions.a, l)\n\t\t: {\n\t\t\t\t//label: l.Mutation + ' categories', //'CNV+SSM > SSM-only > CNV-only',\n\t\t\t\t// altLabels: {\n\t\t\t\t// \tmutationOnly: 'SSM',\n\t\t\t\t// \tcnvOnly: 'CNV',\n\t\t\t\t// },\n\t\t\t\tvalue: 'a',\n\t\t\t\torder: 1, // this is used for list order as a sorter option in a dropdown\n\t\t\t\tsortPriority: [\n\t\t\t\t\t{\n\t\t\t\t\t\tlabel: `For each gene mutation, sort ${l.samples} by matching data`,\n\t\t\t\t\t\ttypes: ['geneVariant'],\n\t\t\t\t\t\ttiebreakers: [\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tskip: !s.mutationClasses.includes('Fuserna'), // not visible, cannot be enabled\n\t\t\t\t\t\t\t\tlabel: `${l.Samples} with Fusion RNASeq > without`,\n\t\t\t\t\t\t\t\tfilter: {\n\t\t\t\t\t\t\t\t\tvalues: [\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tdt: dtfusionrna\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t]\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\tby: 'class',\n\t\t\t\t\t\t\t\tisOrdered: false,\n\t\t\t\t\t\t\t\torder: ['Fuserna' /*'WT', 'Blank'*/]\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tlabel: `${l.Samples} with truncating mutations > without`,\n\t\t\t\t\t\t\t\tfilter: {\n\t\t\t\t\t\t\t\t\tvalues: [\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tdt: dtsnvindel\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t]\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\tby: 'class',\n\t\t\t\t\t\t\t\tisOrdered: false,\n\t\t\t\t\t\t\t\torder: [\n\t\t\t\t\t\t\t\t\t...s.truncatingMutations\n\t\t\t\t\t\t\t\t\t// // truncating\n\t\t\t\t\t\t\t\t\t// 'F', // FRAMESHIFT\n\t\t\t\t\t\t\t\t\t// 'N', // NONSENSE\n\t\t\t\t\t\t\t\t\t// 'L', // SPLICE\n\t\t\t\t\t\t\t\t\t// 'P', // SPLICE_REGION\n\n\t\t\t\t\t\t\t\t\t// // indel\n\t\t\t\t\t\t\t\t\t// 'D', // PROTEINDEL\n\t\t\t\t\t\t\t\t\t// 'I', // PROTEININS\n\t\t\t\t\t\t\t\t\t// 'ProteinAltering',\n\n\t\t\t\t\t\t\t\t\t// // point\n\t\t\t\t\t\t\t\t\t// 'M' // MISSENSE\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t// do not have the option to add unused protein-changing mutations,\n\t\t\t\t\t\t\t\t// because the \"truncating\" label for this tiebreaker will not make sense\n\t\t\t\t\t\t\t\tnotUsed: []\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tlabel: `${l.Samples} with CNV data > without`,\n\t\t\t\t\t\t\t\tmayToggle: true,\n\t\t\t\t\t\t\t\tfilter: {\n\t\t\t\t\t\t\t\t\tvalues: [\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tdt: dtcnv\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t]\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\tby: 'class',\n\t\t\t\t\t\t\t\tisOrdered: true,\n\t\t\t\t\t\t\t\tdisabled: true, // visible, can be enabled\n\t\t\t\t\t\t\t\torder: cnvClasses\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tdisabled: false,\n\t\t\t\t\t\t\t\tmayToggle: true,\n\t\t\t\t\t\t\t\tlabel: `${l.Samples} with protein-changing mutations > without`,\n\t\t\t\t\t\t\t\tfilter: {\n\t\t\t\t\t\t\t\t\tvalues: [\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tdt: dtsnvindel\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t]\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\tby: 'class',\n\t\t\t\t\t\t\t\tisOrdered: false,\n\t\t\t\t\t\t\t\t// by default, do not include truncating mutations here since they may\n\t\t\t\t\t\t\t\t// already be used in the tiebreaker with truncating mutations\n\t\t\t\t\t\t\t\torder: proteinChangingClasses,\n\t\t\t\t\t\t\t\tnotUsed: s.truncatingMutations\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tdisabled: false,\n\t\t\t\t\t\t\t\tmayToggle: true,\n\t\t\t\t\t\t\t\tlabel: `${l.Samples} with other classification > without`,\n\t\t\t\t\t\t\t\tfilter: {\n\t\t\t\t\t\t\t\t\tvalues: [\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tdt: dtsnvindel\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t]\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\tby: 'class',\n\t\t\t\t\t\t\t\tisOrdered: false,\n\t\t\t\t\t\t\t\torder: s.mutationClasses.filter(cls => !sortedClasses.includes(cls) && cls != 'Blank'),\n\t\t\t\t\t\t\t\tnotUsed: []\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t]\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tlabel: `For each dictionary variable, sort ${l.samples} by matching data`,\n\t\t\t\t\t\ttypes: ['categorical', 'integer', 'float', 'survival'],\n\t\t\t\t\t\ttiebreakers: [\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tlabel: 'Values',\n\t\t\t\t\t\t\t\tby: 'values'\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t]\n\t\t\t\t\t}\n\t\t\t\t]\n\t\t  }\n\n\t// legacy support for testing, do not display in a control UI\n\tsortOptions.name = {\n\t\tlabel: `By ${l.sample} name, ID, or label`,\n\t\tvalue: 'name',\n\t\torder: Object.values(sortOptions).length\n\t}\n\treturn sortOptions\n}\n\nexport function getSampleGroupSorter(self) {\n\tconst s = self.settings.matrix\n\tif (s.sortSampleGrpsBy == 'hits')\n\t\treturn (a, b) => {\n\t\t\tif (a.lst.length && !b.lst.length) return -1\n\t\t\tif (!a.lst.length && b.lst.length) return 1\n\t\t\treturn b.totalCountedValues - a.totalCountedValues\n\t\t}\n\tif (s.sortSampleGrpsBy == 'sampleCount')\n\t\treturn (a, b) => {\n\t\t\tif (a.lst.length && !b.lst.length) return -1\n\t\t\tif (!a.lst.length && b.lst.length) return 1\n\t\t\tif (a.lst.length == b.lst.length) {\n\t\t\t\treturn defaultSorter(a, b)\n\t\t\t}\n\t\t\treturn b.lst.length - a.lst.length\n\t\t}\n\n\tif (!self.config.divideBy?.$id) return defaultSorter\n\tconst ref = self.data.refs.byTermId[self.config.divideBy.$id]\n\tif (ref && !ref.keyOrder) ref.keyOrder = ref.bins ? ref.bins.map(b => b.name) : []\n\n\tconst predefinedKeyOrder = self.data.refs.byTermId[self.config.divideBy.$id]?.keyOrder\n\tif (!predefinedKeyOrder) return defaultSorter\n\treturn (a, b) => {\n\t\t// NOTE: should not reorder by isExcluded, in order to maintain the assigned legend item order, colors, etc\n\t\t//if (a.isExcluded && !b.isExcluded) return 1\n\t\t//if (!a.isExcluded && b.isExcluded) return -1\n\t\ta.order = predefinedKeyOrder.indexOf(a.id)\n\t\tif (a.order == -1) delete a.order\n\t\tb.order = predefinedKeyOrder.indexOf(b.id)\n\t\tif (b.order == -1) delete b.order\n\t\tif ('order' in a && 'order' in b) return a.order - b.order\n\t\tif ('order' in a) return -1\n\t\tif ('order' in b) return 1\n\t\tif (a.tw?.term?.values?.[a.id]?.order && b.tw?.term?.values?.[b.id]?.order) {\n\t\t\t// when the term has order defined\n\t\t\treturn a.tw.term.values[a.id].order - b.tw.term.values[b.id].order\n\t\t}\n\t\treturn defaultSorter(a, b)\n\t}\n}\n\nfunction defaultSorter(a, b) {\n\treturn a.name < b.name ? -1 : 1\n}\n\nexport function getMclassSorter(self) {\n\tconst s = self.settings.matrix\n\t// subsequent code does not work when s.sortSamplesBy == 'name', but a mclass sorter function\n\t// may still be needed for non-matrix-column-sorting use cases such as for legend entries.\n\t// In that case, use a default sorting option that is known to sort by mutation classes\n\tconst activeOption = s.sortOptions[s.sortSamplesBy].sortPriority ? s.sortOptions[s.sortSamplesBy] : s.sortOptions.a\n\tconst mclassPriority = []\n\tactiveOption.sortPriority.forEach(obj => {\n\t\tif (obj.types.includes('geneVariant')) {\n\t\t\t// Extract 'order' arrays from each tiebreaker and filter 'WT' and 'Blank'\n\t\t\tobj.tiebreakers.forEach(tiebreaker => {\n\t\t\t\tif (tiebreaker.by == 'class' && tiebreaker.order) {\n\t\t\t\t\tmclassPriority.push(...tiebreaker.order.filter(t => t !== 'WT' && t !== 'Blank'))\n\t\t\t\t}\n\t\t\t})\n\t\t}\n\t})\n\n\tconst sorter = (a, b) => {\n\t\tconst ai = mclassPriority.indexOf(a.class)\n\t\tconst bi = mclassPriority.indexOf(b.class)\n\t\treturn ai == -1 && bi == -1\n\t\t\t? 0\n\t\t\t: mclassPriority.indexOf(a.class) == -1\n\t\t\t? 1\n\t\t\t: mclassPriority.indexOf(b.class) == -1\n\t\t\t? -1\n\t\t\t: mclassPriority.indexOf(a.class) - mclassPriority.indexOf(b.class)\n\t}\n\treturn sorter\n}\n\n// to support saved sessions before the advanced sorter UI was developed and released:\n// combine all geneVariant sortPriority entries into one and apply default labels + flags\n// where applicable\nexport function reshapeSortPriority(sortOption, labels) {\n\tconst l = labels\n\tlet geneVariantsEntry\n\tfor (const sp of sortOption.sortPriority) {\n\t\tif (sp.types.includes('categorical')) {\n\t\t\tif (!sp.label) sp.label = `For each dictionary variable, sort ${l.samples} by matching data`\n\t\t\tcontinue\n\t\t}\n\t\tif (!sp.types?.includes('geneVariant')) continue\n\t\tif (!geneVariantsEntry) {\n\t\t\tgeneVariantsEntry = sp\n\t\t\tif (!sp.label) sp.label = `For each gene mutation, sort ${l.samples} by matching data`\n\t\t} else {\n\t\t\tgeneVariantsEntry.tiebreakers.push(...sp.tiebreakers)\n\t\t\tsp.toBeDeleted = true\n\t\t}\n\t}\n\n\tfor (const tb of geneVariantsEntry.tiebreakers) {\n\t\t//if (tb.by != 'class') continue\n\t\t// Using `Object.assign(tb, defaults, tb)` would copy `tb` back over the defaults (including undefined values); clone first.\n\t\t// The pattern `Object.assign(tb, defaults, origClone)` fills in defaults while preserving any existing keys from the original tiebreaker.\n\t\tconst origClone = structuredClone(tb)\n\t\tif (tb.filter?.values?.find(v => v.dt == dtfusionrna)) {\n\t\t\tconst defaults = {\n\t\t\t\tlabel: `${l.Samples} with Fusion RNASeq > without`,\n\t\t\t\tisOrdered: true,\n\t\t\t\tdisabled: false,\n\t\t\t\tmayToggle: true\n\t\t\t}\n\t\t\tObject.assign(tb, defaults, origClone)\n\t\t} else if (tb.filter?.values?.find(v => v.dt == dtsnvindel)) {\n\t\t\tconst label =\n\t\t\t\ttb.order.includes(mclasscnvgain) || tb.order.includes(mclasscnvloss)\n\t\t\t\t\t? `${l.Samples} with SSM + CNV > SSM only`\n\t\t\t\t\t: `${l.Samples} with mutations`\n\t\t\tconst defaults = {\n\t\t\t\tlabel,\n\t\t\t\tisOrdered: true,\n\t\t\t\tdisabled: false,\n\t\t\t\tmayToggle: true\n\t\t\t}\n\t\t\tObject.assign(tb, defaults, origClone)\n\t\t} else if (tb.order.length == 2 && tb.order.includes(mclasscnvgain) && tb.order.includes(mclasscnvloss)) {\n\t\t\tconst defaults = {\n\t\t\t\tlabel: `${l.Samples} with CNV only > without`,\n\t\t\t\tfilter: { values: [{ dt: dtcnv }] },\n\t\t\t\tby: 'class',\n\t\t\t\tisOrdered: true,\n\t\t\t\tdisabled: false,\n\t\t\t\tmayToggle: true\n\t\t\t}\n\t\t\tObject.assign(tb, defaults, origClone)\n\t\t}\n\t}\n\n\tsortOption.sortPriority = sortOption.sortPriority.filter(sp => !sp.toBeDeleted)\n\treturn sortOption\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;AAYO,SAAS,gBAAgB,MAAM,UAAU,MAAM,OAAO,CAAC,GAAG;AAChE,QAAM,IAAI;AACV,mBAAiB,CAAC;AAClB,MAAI,KAAK,OAAO,aAAa,iBAAiB,KAAK,OAAO,SAAS,YAAY,gBAAgB;AAC9F,WAAO,KAAK;AAAA,EACb;AAEA,MAAI,EAAE,iBAAiB,YAAY;AAClC,WAAO,CAAC,GAAG,MAAM;AAChB,aAAO,KAAK,oBAAoB,QAAQ,EAAE,MAAM,IAAI,KAAK,oBAAoB,QAAQ,EAAE,MAAM;AAAA,IAC9F;AAAA,EACD;AAEA,MAAI,EAAE,iBAAiB,QAAQ;AAE9B,WAAO;AAAA,EACR;AAEA,QAAM,eAAe,EAAE,YAAY,EAAE,aAAa;AAClD,MAAI,CAAC,aAAc,OAAM,gCAAgC,EAAE,aAAa;AAExE,OAAK,6BAA6B,KAAK,UAAU,OAAO,OAAK,EAAE,GAAG,WAAW;AAC7E,QAAM,gBAAgB,KAAK,2BACzB,IAAI,OAAK,EAAE,EAAE,EACb,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,WAAW,EAAE,YAAY,QAAQ;AAEhE,QAAM,cAAc,CAAC;AAErB,QAAM,eAAe,aAAa;AAClC,MAAI,cAAc;AACjB,eAAW,OAAO,eAAe;AAChC,YAAM,KAAK,gBAAgB,GAAG;AAC9B,UAAI,GAAG,aAAa,IAAI;AACvB,oBAAY,KAAK,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC;AACtC;AAAA,MACD;AACA,iBAAW,KAAK,cAAc;AAC7B,YAAI,KAAK,aAAa,GAAG,EAAE,EAAG;AAC9B,cAAM,OAAO,GAAG,KAAK,QAAQ,iBAAiB,GAAG,EAAE,QAAQ,WAAW,gBAAgB,GAAG,KAAK;AAC9F,YAAI,CAAC,EAAE,MAAM,SAAS,IAAI,EAAG;AAC7B,mBAAW,MAAM,EAAE,aAAa;AAC/B,gBAAM,cAAc,OAAO,OAAO,gBAAgB,GAAG,eAAe,CAAC,CAAC,GAAG,EAAE;AAC3E,gBAAM,SAAS,OAAO,OAAO,gBAAgB,EAAE,GAAG,EAAE,YAAY,CAAC;AACjE,sBAAY,KAAK,MAAM;AAAA,QACxB;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAIA,MAAI,cAAc;AACjB,eAAW,KAAK,cAAc;AAC7B,iBAAW,KAAK,KAAK,WAAW;AAE/B,YAAI,cAAc,KAAK,QAAM,GAAG,QAAQ,EAAE,GAAG,GAAG,EAAG;AACnD,YAAI,KAAK,aAAa,GAAG,EAAE,EAAE,EAAG;AAChC,YAAI,CAAC,EAAE,MAAM,SAAS,EAAE,GAAG,KAAK,IAAI,EAAG;AACvC,mBAAW,MAAM,EAAE,aAAa;AAC/B,sBAAY,KAAK,OAAO,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,aAAa,GAAG,CAAC,CAAC;AAAA,QAC9D;AAAA,MACD;AAAA,IACD;AAAA,EACD,OAAO;AAGN,UAAM,sBACL,KAAK,IAAI,SAAS,OAAO,WAAW,SACjC,CAAC,IACD,KAAK,UAEJ;AAAA,MACA,OACC,CAAC,EAAE,GAAG,eAAe,iBAAiB,EAAE,GAAG,KAAK,IAAI,KAAK,CAAC,cAAc,KAAK,QAAM,GAAG,QAAQ,EAAE,GAAG,GAAG;AAAA,IACxG,EACC,IAAI,OAAK,OAAO,OAAO,EAAE,aAAa,EAAE,IAAI,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC;AAEpE,UAAM,yBACL,KAAK,IAAI,SAAS,OAAO,WAAW,SACjC,CAAC,IACD,KAAK,UAEJ;AAAA,MACA,OACC,CAAC,EAAE,GAAG,eAAe,CAAC,iBAAiB,EAAE,GAAG,KAAK,IAAI,KAAK,CAAC,cAAc,KAAK,QAAM,GAAG,QAAQ,EAAE,GAAG,GAAG;AAAA,IACzG,EACC,IAAI,OAAK,OAAO,OAAO,EAAE,aAAa,EAAE,IAAI,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;AAElE,gBAAY,KAAK,GAAG,wBAAwB,GAAG,mBAAmB;AAAA,EACnE;AACA,MAAI,KAAK,WAAY,aAAY,KAAK,KAAK,UAAU;AACrD,cAAY,KAAK,GAAG,EAAE,uBAAuB,IAAI,QAAM,EAAE,CAAC;AAE1D,QAAM,gBAAgB,CAAC;AACvB,OAAK,eAAe,oBAAI,IAAI;AAC5B,aAAW,MAAM,aAAa;AAC7B,QAAI,OAAO,OAAO,WAAY,eAAc,KAAK,EAAE;AAAA,aAC1C,GAAG,OAAO,SAAU,eAAc,KAAK,iBAAiB;AAAA,aACxD,GAAG,YAAY,MAAM,OAAQ,eAAc,KAAK,qBAAqB,IAAI,MAAM,MAAM,CAAC,CAAC;AAAA,aACvF,GAAG,KAAK,QAAQ,cAAe,eAAc,KAAK,uBAAuB,IAAI,MAAM,MAAM,CAAC,CAAC;AAAA,aAC3F,GAAG,YAAY,MAAM,SAAU,eAAc,KAAK,uBAAuB,IAAI,MAAM,MAAM,CAAC,CAAC;AAAA,aAC3F,GAAG,YAAY,MAAM,KAAM,eAAc,KAAK,mBAAmB,IAAI,MAAM,MAAM,CAAC,CAAC;AAAA,aACnF,GAAG,YAAY,MAAM,QAAS,eAAc,KAAK,sBAAsB,IAAI,MAAM,MAAM,CAAC,CAAC;AAAA,QAC7F,OAAM,uCAAuC,GAAG,YAAY,EAAE;AAAA,EACpE;AAGA,MAAI,CAAC,cAAc,KAAK,OAAK,EAAE,QAAQ,QAAQ,GAAG;AACjD,kBAAc,KAAK,iBAAiB;AAAA,EACrC;AAEA,SAAO,CAAC,GAAG,MAAM;AAChB,eAAW,UAAU,eAAe;AACnC,YAAM,IAAI,OAAO,GAAG,CAAC;AACrB,UAAI,MAAM,EAAG,QAAO;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,iBAAiB,GAAG;AAC5B,MAAI,CAAC,EAAE,YAAa,GAAE,cAAc;AACpC,MAAI,CAAC,iBAAiB,SAAS,MAAM,MAAM,EAAE,SAAS,EAAE,aAAa,EAAG,GAAE,gBAAgB;AAC3F;AAEA,SAAS,kBAAkB,GAAG,GAAG;AAChC,MAAI,EAAE,MAAM,SAAS,EAAE,MAAM,OAAO;AACnC,WAAO,EAAE,MAAM,QAAQ,EAAE,MAAM,QAAQ,KAAK,EAAE,MAAM,QAAQ,EAAE,MAAM,QAAQ,IAAI;AAAA,EACjF;AACA,MAAI,CAAC,EAAE,UAAU,CAAC,EAAE,UAAU,EAAE,IAAI,QAAQ;AAC3C,WAAO,EAAE,IAAI,SAAS,EAAE,IAAI,SAAS,KAAK,EAAE,IAAI,SAAS,EAAE,IAAI,SAAS,IAAI;AAAA,EAC7E;AACA,SAAO,EAAE,SAAS,EAAE,SAAS,KAAK,EAAE,SAAS,EAAE,SAAS,IAAI;AAC7D;AAEA,SAAS,qBAAqB,IAAI,MAAM,MAAM,GAAG;AAChD,QAAM,EAAE,KAAK,YAAY,IAAI;AAC7B,QAAM,OAAO,CAAC;AACd,aAAW,OAAO,MAAM;AACvB,QAAI,CAAC,KAAK,IAAI,MAAM,EAAG,MAAK,IAAI,MAAM,IAAI;AAC1C,QAAI,OAAO,KAAK;AACf,WAAK,IAAI,MAAM,KAAK,IAAI,GAAG,EAAE,eAAe,UAAU;AAAA,IACvD;AAAA,EACD;AACA,SAAO,CAAC,GAAG,MAAO,KAAK,EAAE,MAAM,KAAK,KAAK,EAAE,MAAM,IAAI,IAAI,KAAK,EAAE,MAAM,IAAI,KAAK,EAAE,MAAM,IAAI,KAAK;AACjG;AAEA,SAAS,uBAAuB,IAAI,MAAM,MAAM,GAAG;AAClD,QAAM,EAAE,KAAK,YAAY,IAAI;AAC7B,QAAM,IAAI,KAAK,UAAU,KAAK,CAAAA,OAAKA,GAAE,GAAG,QAAQ,GAAG;AAEnD,MAAI,EAAE,IAAI,QAAQ,eAAe;AAChC,WAAO,CAAC,GAAG,MAAM;AAChB,UAAI,OAAO,KAAK,OAAO,GAAG;AAEzB,eAAO,EAAE,GAAG,GAAG,OAAO,CAAC,EAAE,QAAQ,EAAE,GAAG,GAAG,OAAO,CAAC,EAAE;AAAA,MACpD;AACA,UAAI,OAAO,EAAG,QAAO;AACrB,UAAI,OAAO,EAAG,QAAO;AACrB,aAAO;AAAA,IACR;AAAA,EACD;AAEA,MAAI,EAAE,GAAG,KAAK,QAAQ,kBAAkB;AAEvC,WAAO,CAAC,GAAG,MAAM;AAChB,UAAI,OAAO,KAAK,OAAO,GAAG;AACzB,eAAO,EAAE,GAAG,GAAG,iBAAiB,EAAE,GAAG,GAAG;AAAA,MACzC;AACA,UAAI,OAAO,EAAG,QAAO;AACrB,UAAI,OAAO,EAAG,QAAO;AACrB,aAAO;AAAA,IACR;AAAA,EACD;AAEA,MAAI,EAAE,GAAG,GAAG,QAAQ,cAAc;AACjC,WAAO,CAAC,GAAG,MAAM;AAChB,UAAI,OAAO,KAAK,OAAO,GAAG;AACzB,eAAO,EAAE,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG;AAAA,MAChC;AACA,UAAI,OAAO,EAAG,QAAO;AACrB,UAAI,OAAO,EAAG,QAAO;AACrB,aAAO;AAAA,IACR;AAAA,EACD;AAEA,QAAM,SAAS,CAAC;AAChB,MAAI,GAAG,MAAM,QAAQ;AACpB,eAAW,KAAK,KAAK,QAAQ;AAC5B,aAAO,KAAK,EAAE,GAAG;AAAA,IAClB;AACA,WAAO,KAAK,CAAC,GAAG,MAAO,KAAK,OAAO,CAAC,EAAE,QAAQ,KAAK,OAAO,CAAC,EAAE,QAAQ,KAAK,CAAE;AAAA,EAC7E,WAAW,GAAG,KAAK,MAAM;AACxB,WAAO,KAAK,GAAG,EAAE,IAAI,KAAK,IAAI,OAAK,EAAE,IAAI,CAAC;AAAA,EAC3C,WAAW,EAAE,GAAG,GAAG,QAAQ,yBAAyB,EAAE,GAAG,GAAG,QAAQ,mBAAmB;AACtF,UAAM,WACL,EAAE,GAAG,EAAE,QAAQ,wBACZ,EAAE,GAAG,KAAK,aAAa,IAAI,EAAE,GAAG,EAAE,uBAAuB,IACzD,EAAE,GAAG,EAAE;AACX,QAAI,CAAC,SAAU,OAAM;AACrB,UAAM,WAAW,SAAS,OAAO,OAAO,WAAS,CAAC,MAAM,YAAY,EAAE,IAAI,WAAS,MAAM,IAAI;AAC7F,WAAO,KAAK,GAAG,QAAQ;AAAA,EACxB,OAAO;AACN,eAAW,OAAO,MAAM;AACvB,UAAI,EAAE,OAAO,KAAM;AACnB,YAAM,IAAI,IAAI,GAAG,EAAE,UAAU,OAAO,IAAI,GAAG,EAAE;AAC7C,UAAI,OAAO,QAAQ,CAAC,KAAK,GAAI,QAAO,KAAK,CAAC;AAAA,IAC3C;AAAA,EACD;AAEA,SAAO,CAAC,GAAG,MAAM;AAChB,QAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,EAAG,QAAO;AAC/B,QAAI,CAAC,EAAE,GAAG,EAAG,QAAO,EAAE,GAAG,EAAE,WAAW,KAAK;AAC3C,QAAI,CAAC,EAAE,GAAG,EAAG,QAAO,EAAE,GAAG,EAAE,WAAW,IAAI;AAC1C,QAAI,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,UAAU;AACvC,YAAM,KAAK,WAAW,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,SAAS,QAAQ,OAAO,QAAQ,EAAE,GAAG,EAAE,SAAS,GAAG;AAClG,YAAM,KAAK,WAAW,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,SAAS,QAAQ,OAAO,QAAQ,EAAE,GAAG,EAAE,SAAS,GAAG;AAClG,aAAO,KAAK;AAAA,IACb;AACA,QAAI,CAAC,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,GAAG,EAAE,UAAU;AACzC,aAAO,OAAO,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG,EAAE,GAAG;AAAA,IAC9D;AACA,QAAI,CAAC,EAAE,GAAG,EAAE,SAAU,QAAO;AAC7B,QAAI,CAAC,EAAE,GAAG,EAAE,SAAU,QAAO;AAC7B,WAAO;AAAA,EACR;AACD;AAEA,SAAS,mBAAmB,IAAI,MAAM,MAAM,GAAG;AAC9C,QAAM,EAAE,KAAK,aAAa,MAAAC,MAAK,IAAI;AACnC,QAAM,QAAQ,YAAY;AAC1B,QAAM,YAAY,MAAM,SAAS;AAKjC,QAAM,KAAK,oBAAI,IAAI;AAEnB,WAAS,aAAa,KAAK;AAC1B,QAAI,EAAE,OAAO,MAAM;AAClB,SAAG,IAAI,IAAI,QAAQ,SAAS;AAC5B;AAAA,IACD;AACA,QAAI,YAAY,UAAU,CAAC,kBAAkB,IAAI,GAAG,EAAE,QAAQ,YAAY,OAAO,MAAM,GAAG;AACzF,SAAG,IAAI,IAAI,QAAQ,SAAS;AAC5B;AAAA,IACD;AACA,UAAM,UAAU,IAAI,GAAG,EAAE,OAAO,IAAI,OAAK,MAAM,QAAQ,EAAE,EAAE,CAAC,EAAE,OAAO,OAAK,MAAM,EAAE;AAClF,OAAG,IAAI,IAAI,QAAQ,QAAQ,SAAS,KAAK,IAAI,GAAG,OAAO,IAAI,SAAS;AAAA,EACrE;AAEA,SAAO,CAAC,GAAG,MAAM;AAChB,QAAI,CAAC,GAAG,IAAI,EAAE,MAAM,EAAG,cAAa,CAAC;AACrC,QAAI,CAAC,GAAG,IAAI,EAAE,MAAM,EAAG,cAAa,CAAC;AACrC,WAAO,GAAG,IAAI,EAAE,MAAM,IAAI,GAAG,IAAI,EAAE,MAAM;AAAA,EAC1C;AAID;AAEA,SAAS,sBAAsB,IAAI,MAAM,MAAM,GAAG;AACjD,QAAM,EAAE,KAAK,YAAY,IAAI;AAC7B,MAAI,YAAY,SAAU,QAAO,MAAM;AAEvC,QAAM,IAAI,KAAK,OAAO,SAAS;AAC/B,QAAM,aAAa,EAAE,sBAAsB,UAAU,CAAC,EAAE;AACxD,QAAM,aAAa,EAAE,iBAAiB,UAAU,CAAC,EAAE;AACnD,QAAM,QAAQ,YAAY,MAAM;AAAA,IAC/B,cAAc,aACX,OAAK,CAAC,EAAE,eAAe,SAAS,CAAC,IACjC,CAAC,cAAc,CAAC,aAChB,MAAM,QACN,aACA,OAAK,EAAE,gBAAgB,SAAS,CAAC,KAAK,CAAC,EAAE,eAAe,SAAS,CAAC,IAClE,aACA,OAAK,EAAE,WAAW,MAAM,KAAK,CAAC,EAAE,eAAe,SAAS,CAAC,IACzD,OAAK,CAAC,EAAE,WAAW,MAAM;AAAA,EAC7B;AAEA,MAAI,CAAC,MAAM,UAAU,YAAY,yBAA0B,QAAO,MAAM;AAExE,QAAM,YAAY;AAKlB,QAAM,MAAM,oBAAI,IAAI;AAYpB,WAAS,aAAa,KAAK;AAC1B,QAAI,EAAE,OAAO,MAAM;AAElB,UAAI,IAAI,IAAI,QAAQ,SAAS;AAC7B;AAAA,IACD;AACA,UAAM,SAAS,IAAI,GAAG,EAAE,kBAAkB,IAAI,GAAG,EAAE,kBAAkB,IAAI,GAAG,EAAE;AAC9E,QAAI,YAAY,UAAU,CAAC,kBAAkB,QAAQ,YAAY,OAAO,MAAM,GAAG;AAEhF,UAAI,IAAI,IAAI,QAAQ,SAAS;AAC7B;AAAA,IACD;AAEA,UAAM,OAAO,OAAO,IAAI,OAAK,EAAE,KAAK;AACpC,QAAI,CAAC,MAAM,KAAK,UAAQ,KAAK,SAAS,IAAI,CAAC,GAAG;AAE7C,UAAI,IAAI,IAAI,QAAQ,SAAS;AAC7B;AAAA,IACD,WAAW,CAAC,YAAY,WAAW;AAClC,UAAI,IAAI,IAAI,QAAQ,GAAG;AAAA,IACxB,OAAO;AAIN,YAAM,MAAM,MAAM,IAAI,UAAS,KAAK,SAAS,IAAI,IAAI,MAAM,GAAI;AAC/D,UAAI,IAAI,IAAI,QAAQ,GAAG;AAAA,IACxB;AAAA,EACD;AAIA,SAAO,CAAC,GAAG,MAAM;AAChB,QAAI,CAAC,IAAI,IAAI,EAAE,MAAM,EAAG,cAAa,CAAC;AACtC,QAAI,CAAC,IAAI,IAAI,EAAE,MAAM,EAAG,cAAa,CAAC;AACtC,UAAM,KAAK,IAAI,IAAI,EAAE,MAAM;AAC3B,UAAM,KAAK,IAAI,IAAI,EAAE,MAAM;AAC3B,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AAAA,EACrC;AACD;AAEA,SAAS,kBAAkB,YAAY,cAAc;AACpD,aAAW,KAAK,YAAY;AAC3B,eAAW,KAAK,cAAc;AAC7B,WACE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,QACpB,CAAC,EAAE,aAAa,EAAE,UAAU,SAAS,EAAE,KAAK,OAC5C,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,WAC1B,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,SAC5B;AACD,eAAO;AAAA,MACR;AAAA,IACD;AAAA,EACD;AACD;AAEO,SAAS,cAAc,MAAM,GAAG,KAAK;AAC3C,MAAI,KAAK,QAAQ,cAAe,QAAO,KAAK;AAE5C,MAAI,EAAE,eAAe,YAAY;AAEhC,WAAO,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE;AAAA,EAC9B;AAEA,MAAI,EAAE,eAAe,eAAe;AACnC,UAAM,8BAA8B,EAAE,WAAW;AAAA,EAClD;AAEA,SAAO,CAAC,GAAG,MAAM;AAGhB,QAAI,KAAK,IAAI,SAAS,cAAc,QAAQ,oBAAoB;AAC/D,UAAI,EAAE,IAAI,MAAM,MAAM,CAAC,EAAE,IAAI,MAAM,GAAI,QAAO;AAC9C,UAAI,CAAC,EAAE,IAAI,MAAM,MAAM,EAAE,IAAI,MAAM,GAAI,QAAO;AAAA,IAC/C;AAEA,QAAI,EAAE,OAAO,YAAY,EAAE,OAAO,QAAS,QAAO,EAAE,OAAO,UAAU,EAAE,OAAO;AAC9E,QAAI,EAAE,OAAO,SAAS,EAAE,OAAO,KAAM,QAAO,EAAE,OAAO,OAAO,EAAE,OAAO;AACrE,WAAO,EAAE,QAAQ,EAAE;AAAA,EACpB;AACD;AAEO,SAAS,eAAe,cAAc,gBAAgB,CAAC,GAAG,gBAAgB;AAChF,QAAM,IAAI,kBAAkB,cAAc,QAAQ,YAAY,CAAC;AAC/D,QAAM,IAAI,OAAO,OAAO,EAAE,QAAQ,SAAS,GAAG,eAAe,EAAE,iBAAiB,CAAC,CAAC;AAElF,QAAM,cAAc,CAAC;AACrB,MAAI,EAAE,cAAc;AACnB,UAAM,QAAQ;AACd,WAAO,OAAO,WAAW,EAAE,QAAQ,OAAK;AACvC,UAAI,EAAE,SAAS,MAAO,GAAE,SAAS;AAAA,IAClC,CAAC;AACD,gBAAY,SAAS;AAAA,MACpB,OAAO,EAAE,aAAa,SAAS;AAAA,MAC/B,OAAO;AAAA,MACP;AAAA,MACA,cAAc,EAAE;AAAA,IACjB;AAAA,EACD;AAEA,QAAM,aAAa,CAAC,cAAc,wBAAwB,eAAe,eAAe,YAAY;AACpG,QAAM,0BAA0B,EAAE,4BAA4B,CAAC,GAAG;AAAA,IACjE,UAAQ,CAAC,EAAE,oBAAoB,SAAS,IAAI;AAAA,EAC7C;AACA,QAAM,gBAAgB,CAAC,WAAW,GAAI,EAAE,uBAAuB,CAAC,GAAI,GAAG,YAAY,GAAG,sBAAsB;AAG5G,cAAY,IAAI,EAAE,aAAa,IAC5B,oBAAoB,EAAE,YAAY,GAAG,CAAC,IACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,OAAO;AAAA,IACP,OAAO;AAAA;AAAA,IACP,cAAc;AAAA,MACb;AAAA,QACC,OAAO,gCAAgC,EAAE,OAAO;AAAA,QAChD,OAAO,CAAC,aAAa;AAAA,QACrB,aAAa;AAAA,UACZ;AAAA,YACC,MAAM,CAAC,EAAE,gBAAgB,SAAS,SAAS;AAAA;AAAA,YAC3C,OAAO,GAAG,EAAE,OAAO;AAAA,YACnB,QAAQ;AAAA,cACP,QAAQ;AAAA,gBACP;AAAA,kBACC,IAAI;AAAA,gBACL;AAAA,cACD;AAAA,YACD;AAAA,YACA,IAAI;AAAA,YACJ,WAAW;AAAA,YACX,OAAO;AAAA,cAAC;AAAA;AAAA,YAA2B;AAAA,UACpC;AAAA,UACA;AAAA,YACC,OAAO,GAAG,EAAE,OAAO;AAAA,YACnB,QAAQ;AAAA,cACP,QAAQ;AAAA,gBACP;AAAA,kBACC,IAAI;AAAA,gBACL;AAAA,cACD;AAAA,YACD;AAAA,YACA,IAAI;AAAA,YACJ,WAAW;AAAA,YACX,OAAO;AAAA,cACN,GAAG,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAcN;AAAA;AAAA;AAAA,YAGA,SAAS,CAAC;AAAA,UACX;AAAA,UACA;AAAA,YACC,OAAO,GAAG,EAAE,OAAO;AAAA,YACnB,WAAW;AAAA,YACX,QAAQ;AAAA,cACP,QAAQ;AAAA,gBACP;AAAA,kBACC,IAAI;AAAA,gBACL;AAAA,cACD;AAAA,YACD;AAAA,YACA,IAAI;AAAA,YACJ,WAAW;AAAA,YACX,UAAU;AAAA;AAAA,YACV,OAAO;AAAA,UACR;AAAA,UACA;AAAA,YACC,UAAU;AAAA,YACV,WAAW;AAAA,YACX,OAAO,GAAG,EAAE,OAAO;AAAA,YACnB,QAAQ;AAAA,cACP,QAAQ;AAAA,gBACP;AAAA,kBACC,IAAI;AAAA,gBACL;AAAA,cACD;AAAA,YACD;AAAA,YACA,IAAI;AAAA,YACJ,WAAW;AAAA;AAAA;AAAA,YAGX,OAAO;AAAA,YACP,SAAS,EAAE;AAAA,UACZ;AAAA,UACA;AAAA,YACC,UAAU;AAAA,YACV,WAAW;AAAA,YACX,OAAO,GAAG,EAAE,OAAO;AAAA,YACnB,QAAQ;AAAA,cACP,QAAQ;AAAA,gBACP;AAAA,kBACC,IAAI;AAAA,gBACL;AAAA,cACD;AAAA,YACD;AAAA,YACA,IAAI;AAAA,YACJ,WAAW;AAAA,YACX,OAAO,EAAE,gBAAgB,OAAO,SAAO,CAAC,cAAc,SAAS,GAAG,KAAK,OAAO,OAAO;AAAA,YACrF,SAAS,CAAC;AAAA,UACX;AAAA,QACD;AAAA,MACD;AAAA,MACA;AAAA,QACC,OAAO,sCAAsC,EAAE,OAAO;AAAA,QACtD,OAAO,CAAC,eAAe,WAAW,SAAS,UAAU;AAAA,QACrD,aAAa;AAAA,UACZ;AAAA,YACC,OAAO;AAAA,YACP,IAAI;AAAA,UACL;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,EACA;AAGH,cAAY,OAAO;AAAA,IAClB,OAAO,MAAM,EAAE,MAAM;AAAA,IACrB,OAAO;AAAA,IACP,OAAO,OAAO,OAAO,WAAW,EAAE;AAAA,EACnC;AACA,SAAO;AACR;AAEO,SAAS,qBAAqB,MAAM;AAC1C,QAAM,IAAI,KAAK,SAAS;AACxB,MAAI,EAAE,oBAAoB;AACzB,WAAO,CAAC,GAAG,MAAM;AAChB,UAAI,EAAE,IAAI,UAAU,CAAC,EAAE,IAAI,OAAQ,QAAO;AAC1C,UAAI,CAAC,EAAE,IAAI,UAAU,EAAE,IAAI,OAAQ,QAAO;AAC1C,aAAO,EAAE,qBAAqB,EAAE;AAAA,IACjC;AACD,MAAI,EAAE,oBAAoB;AACzB,WAAO,CAAC,GAAG,MAAM;AAChB,UAAI,EAAE,IAAI,UAAU,CAAC,EAAE,IAAI,OAAQ,QAAO;AAC1C,UAAI,CAAC,EAAE,IAAI,UAAU,EAAE,IAAI,OAAQ,QAAO;AAC1C,UAAI,EAAE,IAAI,UAAU,EAAE,IAAI,QAAQ;AACjC,eAAO,cAAc,GAAG,CAAC;AAAA,MAC1B;AACA,aAAO,EAAE,IAAI,SAAS,EAAE,IAAI;AAAA,IAC7B;AAED,MAAI,CAAC,KAAK,OAAO,UAAU,IAAK,QAAO;AACvC,QAAM,MAAM,KAAK,KAAK,KAAK,SAAS,KAAK,OAAO,SAAS,GAAG;AAC5D,MAAI,OAAO,CAAC,IAAI,SAAU,KAAI,WAAW,IAAI,OAAO,IAAI,KAAK,IAAI,OAAK,EAAE,IAAI,IAAI,CAAC;AAEjF,QAAM,qBAAqB,KAAK,KAAK,KAAK,SAAS,KAAK,OAAO,SAAS,GAAG,GAAG;AAC9E,MAAI,CAAC,mBAAoB,QAAO;AAChC,SAAO,CAAC,GAAG,MAAM;AAIhB,MAAE,QAAQ,mBAAmB,QAAQ,EAAE,EAAE;AACzC,QAAI,EAAE,SAAS,GAAI,QAAO,EAAE;AAC5B,MAAE,QAAQ,mBAAmB,QAAQ,EAAE,EAAE;AACzC,QAAI,EAAE,SAAS,GAAI,QAAO,EAAE;AAC5B,QAAI,WAAW,KAAK,WAAW,EAAG,QAAO,EAAE,QAAQ,EAAE;AACrD,QAAI,WAAW,EAAG,QAAO;AACzB,QAAI,WAAW,EAAG,QAAO;AACzB,QAAI,EAAE,IAAI,MAAM,SAAS,EAAE,EAAE,GAAG,SAAS,EAAE,IAAI,MAAM,SAAS,EAAE,EAAE,GAAG,OAAO;AAE3E,aAAO,EAAE,GAAG,KAAK,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,KAAK,OAAO,EAAE,EAAE,EAAE;AAAA,IAC9D;AACA,WAAO,cAAc,GAAG,CAAC;AAAA,EAC1B;AACD;AAEA,SAAS,cAAc,GAAG,GAAG;AAC5B,SAAO,EAAE,OAAO,EAAE,OAAO,KAAK;AAC/B;AAEO,SAAS,gBAAgB,MAAM;AACrC,QAAM,IAAI,KAAK,SAAS;AAIxB,QAAM,eAAe,EAAE,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,YAAY,EAAE,aAAa,IAAI,EAAE,YAAY;AAClH,QAAM,iBAAiB,CAAC;AACxB,eAAa,aAAa,QAAQ,SAAO;AACxC,QAAI,IAAI,MAAM,SAAS,aAAa,GAAG;AAEtC,UAAI,YAAY,QAAQ,gBAAc;AACrC,YAAI,WAAW,MAAM,WAAW,WAAW,OAAO;AACjD,yBAAe,KAAK,GAAG,WAAW,MAAM,OAAO,OAAK,MAAM,QAAQ,MAAM,OAAO,CAAC;AAAA,QACjF;AAAA,MACD,CAAC;AAAA,IACF;AAAA,EACD,CAAC;AAED,QAAM,SAAS,CAAC,GAAG,MAAM;AACxB,UAAM,KAAK,eAAe,QAAQ,EAAE,KAAK;AACzC,UAAM,KAAK,eAAe,QAAQ,EAAE,KAAK;AACzC,WAAO,MAAM,MAAM,MAAM,KACtB,IACA,eAAe,QAAQ,EAAE,KAAK,KAAK,KACnC,IACA,eAAe,QAAQ,EAAE,KAAK,KAAK,KACnC,KACA,eAAe,QAAQ,EAAE,KAAK,IAAI,eAAe,QAAQ,EAAE,KAAK;AAAA,EACpE;AACA,SAAO;AACR;AAKO,SAAS,oBAAoB,YAAY,QAAQ;AACvD,QAAM,IAAI;AACV,MAAI;AACJ,aAAW,MAAM,WAAW,cAAc;AACzC,QAAI,GAAG,MAAM,SAAS,aAAa,GAAG;AACrC,UAAI,CAAC,GAAG,MAAO,IAAG,QAAQ,sCAAsC,EAAE,OAAO;AACzE;AAAA,IACD;AACA,QAAI,CAAC,GAAG,OAAO,SAAS,aAAa,EAAG;AACxC,QAAI,CAAC,mBAAmB;AACvB,0BAAoB;AACpB,UAAI,CAAC,GAAG,MAAO,IAAG,QAAQ,gCAAgC,EAAE,OAAO;AAAA,IACpE,OAAO;AACN,wBAAkB,YAAY,KAAK,GAAG,GAAG,WAAW;AACpD,SAAG,cAAc;AAAA,IAClB;AAAA,EACD;AAEA,aAAW,MAAM,kBAAkB,aAAa;AAI/C,UAAM,YAAY,gBAAgB,EAAE;AACpC,QAAI,GAAG,QAAQ,QAAQ,KAAK,OAAK,EAAE,MAAM,WAAW,GAAG;AACtD,YAAM,WAAW;AAAA,QAChB,OAAO,GAAG,EAAE,OAAO;AAAA,QACnB,WAAW;AAAA,QACX,UAAU;AAAA,QACV,WAAW;AAAA,MACZ;AACA,aAAO,OAAO,IAAI,UAAU,SAAS;AAAA,IACtC,WAAW,GAAG,QAAQ,QAAQ,KAAK,OAAK,EAAE,MAAM,UAAU,GAAG;AAC5D,YAAM,QACL,GAAG,MAAM,SAAS,aAAa,KAAK,GAAG,MAAM,SAAS,aAAa,IAChE,GAAG,EAAE,OAAO,+BACZ,GAAG,EAAE,OAAO;AAChB,YAAM,WAAW;AAAA,QAChB;AAAA,QACA,WAAW;AAAA,QACX,UAAU;AAAA,QACV,WAAW;AAAA,MACZ;AACA,aAAO,OAAO,IAAI,UAAU,SAAS;AAAA,IACtC,WAAW,GAAG,MAAM,UAAU,KAAK,GAAG,MAAM,SAAS,aAAa,KAAK,GAAG,MAAM,SAAS,aAAa,GAAG;AACxG,YAAM,WAAW;AAAA,QAChB,OAAO,GAAG,EAAE,OAAO;AAAA,QACnB,QAAQ,EAAE,QAAQ,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE;AAAA,QAClC,IAAI;AAAA,QACJ,WAAW;AAAA,QACX,UAAU;AAAA,QACV,WAAW;AAAA,MACZ;AACA,aAAO,OAAO,IAAI,UAAU,SAAS;AAAA,IACtC;AAAA,EACD;AAEA,aAAW,eAAe,WAAW,aAAa,OAAO,QAAM,CAAC,GAAG,WAAW;AAC9E,SAAO;AACR;",
+  "names": ["t", "term"]
+}