@sjcrh/proteinpaint-shared 2.186.0 → 2.188.0

package/dist/src/filter.js

@@ -0,0 +1,194 @@
+function getFilteredSamples(sampleAnno, filter) {
+  setDatasetAnnotations(filter);
+  const samples = /* @__PURE__ */ new Set();
+  for (const anno of sampleAnno) {
+    if (samples.has(anno.sample)) continue;
+    const data = anno.s || anno.data;
+    if (data && sample_match_termvaluesetting(data, filter)) {
+      samples.add(anno.sample);
+    }
+  }
+  return samples;
+}
+function sample_match_termvaluesetting(row, filter, _term = null, sample = null) {
+  const lst = filter.type == "tvslst" ? filter.lst : [filter];
+  let numberofmatchedterms = 0;
+  for (const item of lst) {
+    if ("type" in item && item.type == "tvslst") {
+      if (sample_match_termvaluesetting(row, item, _term, sample)) {
+        numberofmatchedterms++;
+      }
+    } else {
+      const itemCopy = JSON.parse(JSON.stringify(item));
+      const t = itemCopy.tvs;
+      if (_term && t.term) {
+        if (!(_term.name == t.term.name && _term.type == t.term.type)) {
+          numberofmatchedterms++;
+          continue;
+        }
+      }
+      let samplevalue;
+      if (_term && !t.term) {
+        if (t.term$type && t.term$type !== _term.type) {
+          numberofmatchedterms++;
+          continue;
+        }
+        t.term = _term;
+        samplevalue = typeof row === "object" && t.term.id in row ? row[t.term.id] : row;
+      } else if (sample && t.term.$id) {
+        samplevalue = sample[t.term.$id].value;
+      } else {
+        samplevalue = t.term.id in row ? row[t.term.id] : row;
+      }
+      setDatasetAnnotations(itemCopy);
+      let thistermmatch;
+      if (t.term.type == "categorical") {
+        if (samplevalue === void 0) continue;
+        thistermmatch = t.valueset.has(samplevalue);
+      } else if (t.term.type == "integer" || t.term.type == "float") {
+        if (samplevalue === void 0) continue;
+        for (const range of t.ranges) {
+          if ("value" in range) {
+            thistermmatch = samplevalue === range.value;
+            if (thistermmatch) break;
+          } else if (samplevalue == range.name) {
+            thistermmatch = true;
+            break;
+          } else {
+            if (t.term.values) {
+              const v = t.term.values[samplevalue.toString()];
+              if (v && v.uncomputable) {
+                continue;
+              }
+            }
+            let left, right;
+            if (range.startunbounded) {
+              left = true;
+            } else if ("start" in range) {
+              if (range.startinclusive) {
+                left = samplevalue >= range.start;
+              } else {
+                left = samplevalue > range.start;
+              }
+            }
+            if (range.stopunbounded) {
+              right = true;
+            } else if ("stop" in range) {
+              if (range.stopinclusive) {
+                right = samplevalue <= range.stop;
+              } else {
+                right = samplevalue < range.stop;
+              }
+            }
+            thistermmatch = left && right;
+          }
+          if (thistermmatch) break;
+        }
+      } else if (t.term.type == "condition") {
+        const key = getPrecomputedKey(t);
+        const anno = samplevalue && samplevalue[key];
+        if (anno) {
+          thistermmatch = Array.isArray(anno) ? t.values.find((d) => anno.includes(d.key)) : t.values.find((d) => d.key == anno);
+        }
+      } else if (t.term.type == "geneVariant") {
+        const svalues = samplevalue.values || [samplevalue];
+        for (const sv of svalues) {
+          thistermmatch = t.values.find(
+            (v) => v.dt == sv.dt && (!v.origin || sv.origin == v.origin) && (!v.mclasslst || v.mclasslst.includes(sv.class))
+          ) && true;
+          if (thistermmatch) break;
+        }
+      } else {
+        throw "unknown term type [sample_match_termvaluesetting() shared/utils/src/filter.ts]";
+      }
+      if (t.isnot) {
+        thistermmatch = !thistermmatch;
+      }
+      if (thistermmatch) numberofmatchedterms++;
+    }
+    if (filter.join == "or") {
+      if (numberofmatchedterms && filter.in) return true;
+      if (!numberofmatchedterms && !filter.in) return true;
+    }
+  }
+  if (!("in" in filter)) filter.in = true;
+  return filter.in == (numberofmatchedterms == lst.length);
+}
+function setDatasetAnnotations(item, ds = null) {
+  if (item.type == "tvslst") {
+    for (const subitem of item.lst) {
+      setDatasetAnnotations(subitem, ds);
+    }
+  } else {
+    if (ds && typeof ds.setAnnoByTermId == "function") {
+      ds.setAnnoByTermId(item.tvs.term.id);
+    }
+    if (item.tvs.term.type == "categorical") {
+      const tvsAny = item.tvs;
+      tvsAny.valueset = new Set(tvsAny.values.map((i) => i.key));
+    }
+  }
+}
+function getPrecomputedKey(q) {
+  const precomputedKey = q.bar_by_children && q.value_by_max_grade ? "childrenAtMaxGrade" : q.bar_by_children && q.value_by_most_recent ? "childrenAtMostRecent" : q.bar_by_children && q.value_by_computable_grade ? "children" : q.bar_by_grade && q.value_by_max_grade ? "maxGrade" : q.bar_by_grade && q.value_by_most_recent ? "mostRecentGrades" : q.bar_by_grade && q.value_by_computable_grade ? "computableGrades" : "";
+  if (!precomputedKey) throw `unknown condition term bar_by_* and/or value_by_*`;
+  return precomputedKey;
+}
+function filterJoin(lst) {
+  if (!lst || lst.length == 0) return;
+  let f = JSON.parse(JSON.stringify(lst[0]));
+  if (lst.length == 1) return f;
+  if (f.lst.length < 2) {
+    if (f.join !== "") throw 'filter.join must be an empty string "" when filter.lst.length < 2';
+    f.join = "and";
+  } else if (f.join == "or") {
+    f = {
+      type: "tvslst",
+      join: "and",
+      in: true,
+      lst: [f]
+    };
+  } else if (f.join != "and") {
+    throw 'filter.join must be either "and" or "or" when .lst length > 1';
+  }
+  for (let i = 1; i < lst.length; i++) {
+    const f2 = JSON.parse(JSON.stringify(lst[i]));
+    if (f2.join == "or") f.lst.push(f2);
+    else f.lst.push(...f2.lst);
+  }
+  if (f.lst.length == 1 && f.lst[0].type == "tvs") {
+    f.join = "";
+  }
+  return f;
+}
+function getWrappedTvslst(lst = [], join = "", $id = null) {
+  const filter = {
+    type: "tvslst",
+    in: true,
+    join,
+    lst
+  };
+  if ($id !== null) filter.$id = $id;
+  return filter;
+}
+function validateTermCollectionTvs(lst1, lst2) {
+  if (!Array.isArray(lst1)) throw new Error("numerator not array");
+  if (!Array.isArray(lst2)) throw new Error("denominator not array");
+  if (lst1.length == 0) throw new Error("numerator empty");
+  if (lst2.length == 0) throw new Error("denominator empty");
+  if (lst1.length > lst2.length) throw new Error("numerator longer than denominator");
+  for (const s of lst1) {
+    if (typeof s != "string") throw new Error("one of numerator not string");
+    if (!s) throw new Error("empty string in numerator");
+    if (!lst2.includes(s)) throw new Error("one of numerator not in denominator");
+  }
+}
+export {
+  filterJoin,
+  getFilteredSamples,
+  getWrappedTvslst,
+  sample_match_termvaluesetting,
+  setDatasetAnnotations,
+  validateTermCollectionTvs
+};
+//# sourceMappingURL=filter.js.map

package/dist/src/filter.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/filter.ts"],
+  "sourcesContent": ["import type { Filter, Tvs } from '#types'\n\n/**\n * Sample annotation structure\n */\nexport interface SampleAnnotation {\n\tsample: string | number\n\ts?: Record<string, any>\n\tdata?: Record<string, any>\n}\n\n/**\n * Dataset with annotation functionality\n */\nexport interface Dataset {\n\tsetAnnoByTermId?: (termId: string) => void\n}\n\n/**\n * Filters an array of sample annotations and returns a Set of matching sample names\n * @param sampleAnno Array of sample annotations\n * @param filter Nested filter structure as used in the termdbapp\n * @returns Set of sample names that match the filter\n */\nexport function getFilteredSamples(sampleAnno: SampleAnnotation[], filter: Filter): Set<string | number> {\n\tsetDatasetAnnotations(filter)\n\n\tconst samples = new Set<string | number>()\n\tfor (const anno of sampleAnno) {\n\t\tif (samples.has(anno.sample)) continue\n\t\tconst data = anno.s || anno.data\n\t\tif (data && sample_match_termvaluesetting(data, filter)) {\n\t\t\tsamples.add(anno.sample)\n\t\t}\n\t}\n\treturn samples\n}\n\n/**\n * Given a value from a sample's annotation of a term, return true if a value matches the filter\n * @param row Sample annotation data\n * @param filter Filter structure or single tvs item\n * @param _term Optional term to filter by\n * @param sample Optional sample data\n * @returns True if the sample matches the filter\n */\nexport function sample_match_termvaluesetting(\n\trow: any,\n\tfilter: Filter,\n\t_term: any = null,\n\tsample: any = null\n): boolean {\n\tconst lst = filter.type == 'tvslst' ? filter.lst : [filter]\n\tlet numberofmatchedterms = 0\n\n\t/* for AND, require all terms to match */\n\tfor (const item of lst) {\n\t\tif ('type' in item && item.type == 'tvslst') {\n\t\t\tif (sample_match_termvaluesetting(row, item, _term, sample)) {\n\t\t\t\tnumberofmatchedterms++\n\t\t\t}\n\t\t} else {\n\t\t\tconst itemCopy = JSON.parse(JSON.stringify(item))\n\t\t\tconst t = itemCopy.tvs\n\n\t\t\tif (_term && t.term) {\n\t\t\t\tif (!(_term.name == t.term.name && _term.type == t.term.type)) {\n\t\t\t\t\t// for an filter from \"this.config.legendValueFilter\", if the filter is not for the tw\n\t\t\t\t\t// (not the same type and name), ignore the filter.\n\t\t\t\t\tnumberofmatchedterms++\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlet samplevalue\n\t\t\tif (_term && !t.term) {\n\t\t\t\tif (t.term$type && t.term$type !== _term.type) {\n\t\t\t\t\t//when the filter is not for the term being tested, ignore the filter\n\t\t\t\t\tnumberofmatchedterms++\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tt.term = _term\n\t\t\t\tsamplevalue = typeof row === 'object' && t.term.id in row ? row[t.term.id] : row\n\t\t\t} else if (sample && t.term.$id) {\n\t\t\t\tsamplevalue = sample[t.term.$id].value\n\t\t\t} else {\n\t\t\t\tsamplevalue = t.term.id in row ? row[t.term.id] : row\n\t\t\t}\n\t\t\tsetDatasetAnnotations(itemCopy)\n\t\t\tlet thistermmatch\n\n\t\t\tif (t.term.type == 'categorical') {\n\t\t\t\tif (samplevalue === undefined) continue // this sample has no anno for this term, do not count\n\t\t\t\tthistermmatch = t.valueset.has(samplevalue)\n\t\t\t} else if (t.term.type == 'integer' || t.term.type == 'float') {\n\t\t\t\tif (samplevalue === undefined) continue // this sample has no anno for this term, do not count\n\t\t\t\tfor (const range of t.ranges) {\n\t\t\t\t\tif ('value' in range) {\n\t\t\t\t\t\tthistermmatch = samplevalue === range.value\n\t\t\t\t\t\tif (thistermmatch) break\n\t\t\t\t\t} else if (samplevalue == range.name) {\n\t\t\t\t\t\tthistermmatch = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// actual range\n\t\t\t\t\t\tif (t.term.values) {\n\t\t\t\t\t\t\tconst v = t.term.values[samplevalue.toString()]\n\t\t\t\t\t\t\tif (v && v.uncomputable) {\n\t\t\t\t\t\t\t\tcontinue\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlet left, right\n\t\t\t\t\t\tif (range.startunbounded) {\n\t\t\t\t\t\t\tleft = true\n\t\t\t\t\t\t} else if ('start' in range) {\n\t\t\t\t\t\t\tif (range.startinclusive) {\n\t\t\t\t\t\t\t\tleft = samplevalue >= range.start\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tleft = samplevalue > range.start\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (range.stopunbounded) {\n\t\t\t\t\t\t\tright = true\n\t\t\t\t\t\t} else if ('stop' in range) {\n\t\t\t\t\t\t\tif (range.stopinclusive) {\n\t\t\t\t\t\t\t\tright = samplevalue <= range.stop\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tright = samplevalue < range.stop\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tthistermmatch = left && right\n\t\t\t\t\t}\n\t\t\t\t\tif (thistermmatch) break\n\t\t\t\t}\n\t\t\t} else if (t.term.type == 'condition') {\n\t\t\t\tconst key = getPrecomputedKey(t)\n\t\t\t\tconst anno = samplevalue && samplevalue[key]\n\t\t\t\tif (anno) {\n\t\t\t\t\tthistermmatch = Array.isArray(anno)\n\t\t\t\t\t\t? t.values.find((d: any) => anno.includes(d.key))\n\t\t\t\t\t\t: t.values.find((d: any) => d.key == anno)\n\t\t\t\t}\n\t\t\t} else if (t.term.type == 'geneVariant') {\n\t\t\t\t/*\n\t\t\t\tsamplevalue.values here can be an array or only one of the entries \n\t\t\t\t[\n\t\t\t\t\t{ dt: 1, class: 'WT', _SAMPLEID_: 21, origin: 'germline' },\n\t\t\t\t\t{ dt: 1, class: 'WT', _SAMPLEID_: 21, origin: 'somatic' },\n\t\t\t\t\t{ dt: 2, class: 'Blank', _SAMPLEID_: 21 },\n\t\t\t\t\t{ dt: 4, class: 'WT', _SAMPLEID_: 21 }\n\t\t\t\t]\n\t\t\t\t*/\n\t\t\t\t/* tvs.values is an array that stores classes (for each available dt) that have/haven't been crossed out by the user at this round of edit-and-apply, e.g.\n          [\n            {dt: 1, mclassLst: ['WT'], mclassExcludeLst: ['Blank'], origin: 'germline'}\n            {dt: 1, mclassLst: ['Blank', 'WT', 'M'], mclassExcludeLst:[], origin:'somatic'},\n            {dt: 2, mclassLst: ['Blank', 'WT'], mclassExcludeLst:[]}\n            {dt: 4, mclassLst: ['WT', 'CNV_loss'], mclassExcludeLst:[]}\n          ]\n        */\n\t\t\t\tconst svalues = samplevalue.values || [samplevalue]\n\t\t\t\tfor (const sv of svalues) {\n\t\t\t\t\tthistermmatch =\n\t\t\t\t\t\tt.values.find(\n\t\t\t\t\t\t\t(v: any) =>\n\t\t\t\t\t\t\t\tv.dt == sv.dt &&\n\t\t\t\t\t\t\t\t(!v.origin || sv.origin == v.origin) &&\n\t\t\t\t\t\t\t\t(!v.mclasslst || v.mclasslst.includes(sv.class))\n\t\t\t\t\t\t) && true\n\t\t\t\t\tif (thistermmatch) break\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tthrow 'unknown term type [sample_match_termvaluesetting() shared/utils/src/filter.ts]'\n\t\t\t}\n\n\t\t\tif (t.isnot) {\n\t\t\t\tthistermmatch = !thistermmatch\n\t\t\t}\n\t\t\tif (thistermmatch) numberofmatchedterms++\n\t\t}\n\n\t\t// if one tvslst is matched with an \"or\" (Set UNION), then sample is okay\n\t\tif (filter.join == 'or') {\n\t\t\tif (numberofmatchedterms && filter.in) return true\n\t\t\tif (!numberofmatchedterms && !filter.in) return true\n\t\t}\n\t}\n\t// for join=\"and\" (Set intersection)\n\tif (!('in' in filter)) (filter as any).in = true // casting to any avoids tsc err despite it's typed!\n\treturn filter.in == (numberofmatchedterms == lst.length)\n}\n\n/**\n * Recursively processes filter items and sets dataset annotations\n * @param item Filter item to process\n * @param ds Optional dataset with annotation functionality\n */\nexport function setDatasetAnnotations(item: Filter | { type: 'tvs'; tvs: Tvs }, ds: Dataset | null = null): void {\n\tif (item.type == 'tvslst') {\n\t\tfor (const subitem of item.lst) {\n\t\t\tsetDatasetAnnotations(subitem, ds)\n\t\t}\n\t} else {\n\t\tif (ds && typeof ds.setAnnoByTermId == 'function') {\n\t\t\tds.setAnnoByTermId(item.tvs.term.id)\n\t\t}\n\t\tif (item.tvs.term.type == 'categorical') {\n\t\t\tconst tvsAny = item.tvs as any\n\t\t\ttvsAny.valueset = new Set(tvsAny.values.map((i: any) => i.key))\n\t\t}\n\t}\n}\n\n/**\n * Gets the precomputed key for a condition term based on bar_by and value_by settings\n */\nfunction getPrecomputedKey(q: any): string {\n\tconst precomputedKey =\n\t\tq.bar_by_children && q.value_by_max_grade\n\t\t\t? 'childrenAtMaxGrade'\n\t\t\t: q.bar_by_children && q.value_by_most_recent\n\t\t\t? 'childrenAtMostRecent'\n\t\t\t: q.bar_by_children && q.value_by_computable_grade\n\t\t\t? 'children'\n\t\t\t: q.bar_by_grade && q.value_by_max_grade\n\t\t\t? 'maxGrade'\n\t\t\t: q.bar_by_grade && q.value_by_most_recent\n\t\t\t? 'mostRecentGrades'\n\t\t\t: q.bar_by_grade && q.value_by_computable_grade\n\t\t\t? 'computableGrades'\n\t\t\t: ''\n\tif (!precomputedKey) throw `unknown condition term bar_by_* and/or value_by_*`\n\treturn precomputedKey\n}\n\n/**\n * Joins a list of filters into the first filter with \"and\", returns joined filter\n * Used by caller app to join hidden filters into a visible filter\n * @param lst List of filters to join\n * @returns The joined filter\n */\nexport function filterJoin(lst: Filter[]): Filter | undefined {\n\tif (!lst || lst.length == 0) return\n\tlet f = JSON.parse(JSON.stringify(lst[0]))\n\tif (lst.length == 1) return f\n\t// more than 1 item, will join\n\tif (f.lst.length < 2) {\n\t\tif (f.join !== '') throw 'filter.join must be an empty string \"\" when filter.lst.length < 2'\n\t\tf.join = 'and'\n\t} else if (f.join == 'or') {\n\t\t// f is \"or\", wrap it with another root layer of \"and\"\n\t\tf = {\n\t\t\ttype: 'tvslst',\n\t\t\tjoin: 'and',\n\t\t\tin: true,\n\t\t\tlst: [f]\n\t\t}\n\t} else if (f.join != 'and') {\n\t\tthrow 'filter.join must be either \"and\" or \"or\" when .lst length > 1'\n\t}\n\t// now, f.join should be \"and\"\n\t// if the argument lst[0].join == \"and\",\n\t// then the f.in boolean value is reused\n\tfor (let i = 1; i < lst.length; i++) {\n\t\tconst f2 = JSON.parse(JSON.stringify(lst[i]))\n\t\tif (f2.join == 'or') f.lst.push(f2)\n\t\telse f.lst.push(...f2.lst)\n\t}\n\t// if f ends up single-tvs item (from joining single tvs to empty filter), need to set join to '' per filter spec\n\tif (f.lst.length == 1 && f.lst[0].type == 'tvs') {\n\t\tf.join = ''\n\t}\n\treturn f\n}\n\n/**\n * Creates a wrapped tvslst (term value settings list) filter object\n * @param lst List of filter items\n * @param join Join operation (and/or)\n * @param $id Optional filter ID\n * @returns Wrapped filter object\n */\nexport function getWrappedTvslst(lst: Filter['lst'] = [], join: string = '', $id: string | null = null): Filter {\n\tconst filter: Filter = {\n\t\ttype: 'tvslst',\n\t\tin: true,\n\t\tjoin,\n\t\tlst\n\t}\n\tif ($id !== null) filter.$id = $id\n\treturn filter\n}\n\n/**\n * Validates numerator and denominator term collections\n * @param lst1 Numerator list of term ids\n * @param lst2 Denominator list of term ids\n * @throws Error if validation fails\n */\nexport function validateTermCollectionTvs(lst1: any[], lst2: any[]): void {\n\t// lst1/lst2: numerator and denominator. both are lists of term ids\n\tif (!Array.isArray(lst1)) throw new Error('numerator not array')\n\tif (!Array.isArray(lst2)) throw new Error('denominator not array')\n\tif (lst1.length == 0) throw new Error('numerator empty')\n\tif (lst2.length == 0) throw new Error('denominator empty')\n\tif (lst1.length > lst2.length) throw new Error('numerator longer than denominator')\n\tfor (const s of lst1) {\n\t\tif (typeof s != 'string') throw new Error('one of numerator not string')\n\t\tif (!s) throw new Error('empty string in numerator')\n\t\tif (!lst2.includes(s)) throw new Error('one of numerator not in denominator')\n\t}\n}\n"],
+  "mappings": "AAwBO,SAAS,mBAAmB,YAAgC,QAAsC;AACxG,wBAAsB,MAAM;AAE5B,QAAM,UAAU,oBAAI,IAAqB;AACzC,aAAW,QAAQ,YAAY;AAC9B,QAAI,QAAQ,IAAI,KAAK,MAAM,EAAG;AAC9B,UAAM,OAAO,KAAK,KAAK,KAAK;AAC5B,QAAI,QAAQ,8BAA8B,MAAM,MAAM,GAAG;AACxD,cAAQ,IAAI,KAAK,MAAM;AAAA,IACxB;AAAA,EACD;AACA,SAAO;AACR;AAUO,SAAS,8BACf,KACA,QACA,QAAa,MACb,SAAc,MACJ;AACV,QAAM,MAAM,OAAO,QAAQ,WAAW,OAAO,MAAM,CAAC,MAAM;AAC1D,MAAI,uBAAuB;AAG3B,aAAW,QAAQ,KAAK;AACvB,QAAI,UAAU,QAAQ,KAAK,QAAQ,UAAU;AAC5C,UAAI,8BAA8B,KAAK,MAAM,OAAO,MAAM,GAAG;AAC5D;AAAA,MACD;AAAA,IACD,OAAO;AACN,YAAM,WAAW,KAAK,MAAM,KAAK,UAAU,IAAI,CAAC;AAChD,YAAM,IAAI,SAAS;AAEnB,UAAI,SAAS,EAAE,MAAM;AACpB,YAAI,EAAE,MAAM,QAAQ,EAAE,KAAK,QAAQ,MAAM,QAAQ,EAAE,KAAK,OAAO;AAG9D;AACA;AAAA,QACD;AAAA,MACD;AAEA,UAAI;AACJ,UAAI,SAAS,CAAC,EAAE,MAAM;AACrB,YAAI,EAAE,aAAa,EAAE,cAAc,MAAM,MAAM;AAE9C;AACA;AAAA,QACD;AACA,UAAE,OAAO;AACT,sBAAc,OAAO,QAAQ,YAAY,EAAE,KAAK,MAAM,MAAM,IAAI,EAAE,KAAK,EAAE,IAAI;AAAA,MAC9E,WAAW,UAAU,EAAE,KAAK,KAAK;AAChC,sBAAc,OAAO,EAAE,KAAK,GAAG,EAAE;AAAA,MAClC,OAAO;AACN,sBAAc,EAAE,KAAK,MAAM,MAAM,IAAI,EAAE,KAAK,EAAE,IAAI;AAAA,MACnD;AACA,4BAAsB,QAAQ;AAC9B,UAAI;AAEJ,UAAI,EAAE,KAAK,QAAQ,eAAe;AACjC,YAAI,gBAAgB,OAAW;AAC/B,wBAAgB,EAAE,SAAS,IAAI,WAAW;AAAA,MAC3C,WAAW,EAAE,KAAK,QAAQ,aAAa,EAAE,KAAK,QAAQ,SAAS;AAC9D,YAAI,gBAAgB,OAAW;AAC/B,mBAAW,SAAS,EAAE,QAAQ;AAC7B,cAAI,WAAW,OAAO;AACrB,4BAAgB,gBAAgB,MAAM;AACtC,gBAAI,cAAe;AAAA,UACpB,WAAW,eAAe,MAAM,MAAM;AACrC,4BAAgB;AAChB;AAAA,UACD,OAAO;AAEN,gBAAI,EAAE,KAAK,QAAQ;AAClB,oBAAM,IAAI,EAAE,KAAK,OAAO,YAAY,SAAS,CAAC;AAC9C,kBAAI,KAAK,EAAE,cAAc;AACxB;AAAA,cACD;AAAA,YACD;AACA,gBAAI,MAAM;AACV,gBAAI,MAAM,gBAAgB;AACzB,qBAAO;AAAA,YACR,WAAW,WAAW,OAAO;AAC5B,kBAAI,MAAM,gBAAgB;AACzB,uBAAO,eAAe,MAAM;AAAA,cAC7B,OAAO;AACN,uBAAO,cAAc,MAAM;AAAA,cAC5B;AAAA,YACD;AACA,gBAAI,MAAM,eAAe;AACxB,sBAAQ;AAAA,YACT,WAAW,UAAU,OAAO;AAC3B,kBAAI,MAAM,eAAe;AACxB,wBAAQ,eAAe,MAAM;AAAA,cAC9B,OAAO;AACN,wBAAQ,cAAc,MAAM;AAAA,cAC7B;AAAA,YACD;AACA,4BAAgB,QAAQ;AAAA,UACzB;AACA,cAAI,cAAe;AAAA,QACpB;AAAA,MACD,WAAW,EAAE,KAAK,QAAQ,aAAa;AACtC,cAAM,MAAM,kBAAkB,CAAC;AAC/B,cAAM,OAAO,eAAe,YAAY,GAAG;AAC3C,YAAI,MAAM;AACT,0BAAgB,MAAM,QAAQ,IAAI,IAC/B,EAAE,OAAO,KAAK,CAAC,MAAW,KAAK,SAAS,EAAE,GAAG,CAAC,IAC9C,EAAE,OAAO,KAAK,CAAC,MAAW,EAAE,OAAO,IAAI;AAAA,QAC3C;AAAA,MACD,WAAW,EAAE,KAAK,QAAQ,eAAe;AAkBxC,cAAM,UAAU,YAAY,UAAU,CAAC,WAAW;AAClD,mBAAW,MAAM,SAAS;AACzB,0BACC,EAAE,OAAO;AAAA,YACR,CAAC,MACA,EAAE,MAAM,GAAG,OACV,CAAC,EAAE,UAAU,GAAG,UAAU,EAAE,YAC5B,CAAC,EAAE,aAAa,EAAE,UAAU,SAAS,GAAG,KAAK;AAAA,UAChD,KAAK;AACN,cAAI,cAAe;AAAA,QACpB;AAAA,MACD,OAAO;AACN,cAAM;AAAA,MACP;AAEA,UAAI,EAAE,OAAO;AACZ,wBAAgB,CAAC;AAAA,MAClB;AACA,UAAI,cAAe;AAAA,IACpB;AAGA,QAAI,OAAO,QAAQ,MAAM;AACxB,UAAI,wBAAwB,OAAO,GAAI,QAAO;AAC9C,UAAI,CAAC,wBAAwB,CAAC,OAAO,GAAI,QAAO;AAAA,IACjD;AAAA,EACD;AAEA,MAAI,EAAE,QAAQ,QAAS,CAAC,OAAe,KAAK;AAC5C,SAAO,OAAO,OAAO,wBAAwB,IAAI;AAClD;AAOO,SAAS,sBAAsB,MAA0C,KAAqB,MAAY;AAChH,MAAI,KAAK,QAAQ,UAAU;AAC1B,eAAW,WAAW,KAAK,KAAK;AAC/B,4BAAsB,SAAS,EAAE;AAAA,IAClC;AAAA,EACD,OAAO;AACN,QAAI,MAAM,OAAO,GAAG,mBAAmB,YAAY;AAClD,SAAG,gBAAgB,KAAK,IAAI,KAAK,EAAE;AAAA,IACpC;AACA,QAAI,KAAK,IAAI,KAAK,QAAQ,eAAe;AACxC,YAAM,SAAS,KAAK;AACpB,aAAO,WAAW,IAAI,IAAI,OAAO,OAAO,IAAI,CAAC,MAAW,EAAE,GAAG,CAAC;AAAA,IAC/D;AAAA,EACD;AACD;AAKA,SAAS,kBAAkB,GAAgB;AAC1C,QAAM,iBACL,EAAE,mBAAmB,EAAE,qBACpB,uBACA,EAAE,mBAAmB,EAAE,uBACvB,yBACA,EAAE,mBAAmB,EAAE,4BACvB,aACA,EAAE,gBAAgB,EAAE,qBACpB,aACA,EAAE,gBAAgB,EAAE,uBACpB,qBACA,EAAE,gBAAgB,EAAE,4BACpB,qBACA;AACJ,MAAI,CAAC,eAAgB,OAAM;AAC3B,SAAO;AACR;AAQO,SAAS,WAAW,KAAmC;AAC7D,MAAI,CAAC,OAAO,IAAI,UAAU,EAAG;AAC7B,MAAI,IAAI,KAAK,MAAM,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC;AACzC,MAAI,IAAI,UAAU,EAAG,QAAO;AAE5B,MAAI,EAAE,IAAI,SAAS,GAAG;AACrB,QAAI,EAAE,SAAS,GAAI,OAAM;AACzB,MAAE,OAAO;AAAA,EACV,WAAW,EAAE,QAAQ,MAAM;AAE1B,QAAI;AAAA,MACH,MAAM;AAAA,MACN,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,KAAK,CAAC,CAAC;AAAA,IACR;AAAA,EACD,WAAW,EAAE,QAAQ,OAAO;AAC3B,UAAM;AAAA,EACP;AAIA,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACpC,UAAM,KAAK,KAAK,MAAM,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC;AAC5C,QAAI,GAAG,QAAQ,KAAM,GAAE,IAAI,KAAK,EAAE;AAAA,QAC7B,GAAE,IAAI,KAAK,GAAG,GAAG,GAAG;AAAA,EAC1B;AAEA,MAAI,EAAE,IAAI,UAAU,KAAK,EAAE,IAAI,CAAC,EAAE,QAAQ,OAAO;AAChD,MAAE,OAAO;AAAA,EACV;AACA,SAAO;AACR;AASO,SAAS,iBAAiB,MAAqB,CAAC,GAAG,OAAe,IAAI,MAAqB,MAAc;AAC/G,QAAM,SAAiB;AAAA,IACtB,MAAM;AAAA,IACN,IAAI;AAAA,IACJ;AAAA,IACA;AAAA,EACD;AACA,MAAI,QAAQ,KAAM,QAAO,MAAM;AAC/B,SAAO;AACR;AAQO,SAAS,0BAA0B,MAAa,MAAmB;AAEzE,MAAI,CAAC,MAAM,QAAQ,IAAI,EAAG,OAAM,IAAI,MAAM,qBAAqB;AAC/D,MAAI,CAAC,MAAM,QAAQ,IAAI,EAAG,OAAM,IAAI,MAAM,uBAAuB;AACjE,MAAI,KAAK,UAAU,EAAG,OAAM,IAAI,MAAM,iBAAiB;AACvD,MAAI,KAAK,UAAU,EAAG,OAAM,IAAI,MAAM,mBAAmB;AACzD,MAAI,KAAK,SAAS,KAAK,OAAQ,OAAM,IAAI,MAAM,mCAAmC;AAClF,aAAW,KAAK,MAAM;AACrB,QAAI,OAAO,KAAK,SAAU,OAAM,IAAI,MAAM,6BAA6B;AACvE,QAAI,CAAC,EAAG,OAAM,IAAI,MAAM,2BAA2B;AACnD,QAAI,CAAC,KAAK,SAAS,CAAC,EAAG,OAAM,IAAI,MAAM,qCAAqC;AAAA,EAC7E;AACD;",
+  "names": []
+}

package/dist/src/hash.js

@@ -0,0 +1,20 @@
+const encoder = new TextEncoder();
+async function hash(message) {
+  const msgUint8 = encoder.encode(message);
+  const hashBuffer = await crypto.subtle.digest("SHA-1", msgUint8);
+  const hashArray = Array.from(new Uint8Array(hashBuffer));
+  const hashHex = hashArray.map((b) => b.toString(16).padStart(2, "0")).join("");
+  return hexToBase64(hashHex).replace("=", "-");
+}
+function hexToBase64(hexStr) {
+  return btoa(
+    [...hexStr].reduce(
+      (acc, _, i) => acc += !(i - 1 & 1) ? String.fromCharCode(parseInt(hexStr.substring(i - 1, i + 1), 16)) : "",
+      ""
+    )
+  );
+}
+export {
+  hash
+};
+//# sourceMappingURL=hash.js.map

package/dist/src/hash.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/hash.js"],
+  "sourcesContent": ["const encoder = new TextEncoder()\n\nexport async function hash(message) {\n\tconst msgUint8 = encoder.encode(message) // encode as (utf-8) Uint8Array\n\tconst hashBuffer = await crypto.subtle.digest('SHA-1', msgUint8) // hash the message\n\tconst hashArray = Array.from(new Uint8Array(hashBuffer)) // convert buffer to byte array\n\tconst hashHex = hashArray.map(b => b.toString(16).padStart(2, '0')).join('') // convert bytes to hex string\n\treturn hexToBase64(hashHex).replace('=', '-') // shorten from 40 to 28 chars\n}\n\nfunction hexToBase64(hexStr) {\n\treturn btoa(\n\t\t[...hexStr].reduce(\n\t\t\t(acc, _, i) => (acc += !((i - 1) & 1) ? String.fromCharCode(parseInt(hexStr.substring(i - 1, i + 1), 16)) : ''),\n\t\t\t''\n\t\t)\n\t)\n}\n"],
+  "mappings": "AAAA,MAAM,UAAU,IAAI,YAAY;AAEhC,eAAsB,KAAK,SAAS;AACnC,QAAM,WAAW,QAAQ,OAAO,OAAO;AACvC,QAAM,aAAa,MAAM,OAAO,OAAO,OAAO,SAAS,QAAQ;AAC/D,QAAM,YAAY,MAAM,KAAK,IAAI,WAAW,UAAU,CAAC;AACvD,QAAM,UAAU,UAAU,IAAI,OAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE;AAC3E,SAAO,YAAY,OAAO,EAAE,QAAQ,KAAK,GAAG;AAC7C;AAEA,SAAS,YAAY,QAAQ;AAC5B,SAAO;AAAA,IACN,CAAC,GAAG,MAAM,EAAE;AAAA,MACX,CAAC,KAAK,GAAG,MAAO,OAAO,EAAG,IAAI,IAAK,KAAK,OAAO,aAAa,SAAS,OAAO,UAAU,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI;AAAA,MAC5G;AAAA,IACD;AAAA,EACD;AACD;",
+  "names": []
+}

package/dist/src/helpers.js

@@ -0,0 +1,66 @@
+function isNumeric(n) {
+  const v = typeof n != "string" || n === "" ? n : Number(n);
+  const f = parseFloat(n);
+  return !isNaN(f) && Number.isFinite(v) && v === f;
+}
+function isStrictNumeric(n) {
+  return typeof n === "number" && Number.isFinite(n);
+}
+function convertUnits(v, fromUnit, toUnit, scaleFactor, compact) {
+  if (scaleFactor >= 1) {
+    const toUnitV2 = Math.floor(v * scaleFactor);
+    if (compact) return `${toUnitV2}${toUnit.charAt(0)}`;
+    return `${toUnitV2} ${toUnitV2 > 1 ? toUnit + "s" : ""}`;
+  }
+  const toUnitV = Math.floor(v * scaleFactor);
+  const fromUnitV = Math.ceil(v % (1 / scaleFactor));
+  if (fromUnitV == 0) {
+    if (compact) return `${toUnitV}${toUnit.charAt(0)}`;
+    return `${toUnitV} ${toUnitV > 1 ? toUnit + "s" : ""}`;
+  }
+  if (compact) return `${toUnitV}${toUnit.charAt(0)}${fromUnitV}${fromUnit.charAt(0)}`;
+  return `${toUnitV} ${toUnitV > 1 ? toUnit + "s" : toUnit} ${fromUnitV} ${fromUnitV > 1 ? fromUnit + "s" : fromUnit}`;
+}
+function deepEqual(x, y) {
+  if (x === y) {
+    return true;
+  } else if (typeof x == "object" && x != null && typeof y == "object" && y != null) {
+    if (Object.keys(x).length != Object.keys(y).length) {
+      return false;
+    }
+    for (var prop in x) {
+      if (y.hasOwnProperty(prop)) {
+        if (!deepEqual(x[prop], y[prop])) return false;
+      } else {
+        return false;
+      }
+    }
+    return true;
+  } else return false;
+}
+function deepFreeze(obj) {
+  Object.freeze(obj);
+  for (const value of Object.values(obj)) {
+    if (value !== null && typeof value == "object") deepFreeze(value);
+  }
+  return obj;
+}
+class CustomError extends Error {
+  level = "";
+  // '' | 'warn'
+  constructor(message, opts = {}) {
+    super(message);
+    if (opts.name) this.name = opts.name;
+    if (opts.code) this.code = opts.code;
+    if (opts.level) this.level = opts.level;
+  }
+}
+export {
+  CustomError,
+  convertUnits,
+  deepEqual,
+  deepFreeze,
+  isNumeric,
+  isStrictNumeric
+};
+//# sourceMappingURL=helpers.js.map

package/dist/src/helpers.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/helpers.js"],
+  "sourcesContent": ["/*\nthis is a helper file with a collection of functions to be used in backend and client side code. Here is a list.\n\n1. isNumeric(n)\n2. strictNumeric(n) \n2. convertUnits\n3. TODO - move computepercentile, roundValue, etc here?\n*/\n\n// checks whether given argument n is Numeric, with option to cast from string\nexport function isNumeric(n) {\n\tconst v = typeof n != 'string' || n === '' ? n : Number(n)\n\tconst f = parseFloat(n)\n\treturn !isNaN(f) && Number.isFinite(v) && v === f\n}\n\n// like isNumeric but does not cast from string\nexport function isStrictNumeric(n) {\n\treturn typeof n === 'number' && Number.isFinite(n)\n}\n\n// converts a value from a unit to another unit\nexport function convertUnits(v, fromUnit, toUnit, scaleFactor, compact) {\n\t// do floor() on toUnit\n\t// do ceil() on fromUnit, in case v is decimal (from violin range selection) and to keep showing integer fromUnit\n\tif (scaleFactor >= 1) {\n\t\tconst toUnitV = Math.floor(v * scaleFactor)\n\t\tif (compact) return `${toUnitV}${toUnit.charAt(0)}`\n\t\treturn `${toUnitV} ${toUnitV > 1 ? toUnit + 's' : ''}`\n\t}\n\tconst toUnitV = Math.floor(v * scaleFactor)\n\tconst fromUnitV = Math.ceil(v % (1 / scaleFactor))\n\n\tif (fromUnitV == 0) {\n\t\tif (compact) return `${toUnitV}${toUnit.charAt(0)}`\n\t\treturn `${toUnitV} ${toUnitV > 1 ? toUnit + 's' : ''}`\n\t}\n\n\tif (compact) return `${toUnitV}${toUnit.charAt(0)}${fromUnitV}${fromUnit.charAt(0)}`\n\treturn `${toUnitV} ${toUnitV > 1 ? toUnit + 's' : toUnit} ${fromUnitV} ${fromUnitV > 1 ? fromUnit + 's' : fromUnit}`\n}\n\nexport function deepEqual(x, y) {\n\tif (x === y) {\n\t\treturn true\n\t} else if (typeof x == 'object' && x != null && typeof y == 'object' && y != null) {\n\t\tif (Object.keys(x).length != Object.keys(y).length) {\n\t\t\treturn false\n\t\t}\n\n\t\tfor (var prop in x) {\n\t\t\tif (y.hasOwnProperty(prop)) {\n\t\t\t\tif (!deepEqual(x[prop], y[prop])) return false\n\t\t\t} else {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\t} else return false\n}\n\nexport function deepFreeze(obj) {\n\tObject.freeze(obj)\n\t// not using for..in loop, in order to not descend into inherited props/methods\n\tfor (const value of Object.values(obj)) {\n\t\tif (value !== null && typeof value == 'object') deepFreeze(value)\n\t}\n\treturn obj\n}\n\nexport class CustomError extends Error {\n\tlevel = '' // '' | 'warn'\n\n\tconstructor(message, opts = {}) {\n\t\tsuper(message)\n\t\tif (opts.name) this.name = opts.name\n\t\tif (opts.code) this.code = opts.code\n\t\tif (opts.level) this.level = opts.level\n\t}\n}\n"],
+  "mappings": "AAUO,SAAS,UAAU,GAAG;AAC5B,QAAM,IAAI,OAAO,KAAK,YAAY,MAAM,KAAK,IAAI,OAAO,CAAC;AACzD,QAAM,IAAI,WAAW,CAAC;AACtB,SAAO,CAAC,MAAM,CAAC,KAAK,OAAO,SAAS,CAAC,KAAK,MAAM;AACjD;AAGO,SAAS,gBAAgB,GAAG;AAClC,SAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC;AAClD;AAGO,SAAS,aAAa,GAAG,UAAU,QAAQ,aAAa,SAAS;AAGvE,MAAI,eAAe,GAAG;AACrB,UAAMA,WAAU,KAAK,MAAM,IAAI,WAAW;AAC1C,QAAI,QAAS,QAAO,GAAGA,QAAO,GAAG,OAAO,OAAO,CAAC,CAAC;AACjD,WAAO,GAAGA,QAAO,IAAIA,WAAU,IAAI,SAAS,MAAM,EAAE;AAAA,EACrD;AACA,QAAM,UAAU,KAAK,MAAM,IAAI,WAAW;AAC1C,QAAM,YAAY,KAAK,KAAK,KAAK,IAAI,YAAY;AAEjD,MAAI,aAAa,GAAG;AACnB,QAAI,QAAS,QAAO,GAAG,OAAO,GAAG,OAAO,OAAO,CAAC,CAAC;AACjD,WAAO,GAAG,OAAO,IAAI,UAAU,IAAI,SAAS,MAAM,EAAE;AAAA,EACrD;AAEA,MAAI,QAAS,QAAO,GAAG,OAAO,GAAG,OAAO,OAAO,CAAC,CAAC,GAAG,SAAS,GAAG,SAAS,OAAO,CAAC,CAAC;AAClF,SAAO,GAAG,OAAO,IAAI,UAAU,IAAI,SAAS,MAAM,MAAM,IAAI,SAAS,IAAI,YAAY,IAAI,WAAW,MAAM,QAAQ;AACnH;AAEO,SAAS,UAAU,GAAG,GAAG;AAC/B,MAAI,MAAM,GAAG;AACZ,WAAO;AAAA,EACR,WAAW,OAAO,KAAK,YAAY,KAAK,QAAQ,OAAO,KAAK,YAAY,KAAK,MAAM;AAClF,QAAI,OAAO,KAAK,CAAC,EAAE,UAAU,OAAO,KAAK,CAAC,EAAE,QAAQ;AACnD,aAAO;AAAA,IACR;AAEA,aAAS,QAAQ,GAAG;AACnB,UAAI,EAAE,eAAe,IAAI,GAAG;AAC3B,YAAI,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC,EAAG,QAAO;AAAA,MAC1C,OAAO;AACN,eAAO;AAAA,MACR;AAAA,IACD;AACA,WAAO;AAAA,EACR,MAAO,QAAO;AACf;AAEO,SAAS,WAAW,KAAK;AAC/B,SAAO,OAAO,GAAG;AAEjB,aAAW,SAAS,OAAO,OAAO,GAAG,GAAG;AACvC,QAAI,UAAU,QAAQ,OAAO,SAAS,SAAU,YAAW,KAAK;AAAA,EACjE;AACA,SAAO;AACR;AAEO,MAAM,oBAAoB,MAAM;AAAA,EACtC,QAAQ;AAAA;AAAA,EAER,YAAY,SAAS,OAAO,CAAC,GAAG;AAC/B,UAAM,OAAO;AACb,QAAI,KAAK,KAAM,MAAK,OAAO,KAAK;AAChC,QAAI,KAAK,KAAM,MAAK,OAAO,KAAK;AAChC,QAAI,KAAK,MAAO,MAAK,QAAQ,KAAK;AAAA,EACnC;AACD;",
+  "names": ["toUnitV"]
+}

package/dist/src/index.d.ts

@@ -0,0 +1,26 @@
+export * from '../constants/AiHisto.js';
+export * from './aiHisto.js';
+export * from './bulk.js';
+export * from './clustering.js';
+export * from './common.js';
+export * from './compute.percentile.js';
+export * from './fetch-helpers.js';
+export * from './fileSize.js';
+export * from './filter.js';
+export * from './hash.js';
+export * from './helpers.js';
+export * from './joinUrl.js';
+export * from './mds3tk.js';
+export * from './roundValue.js';
+export * from './termdb.bins.js';
+export * from './termdb.initbinconfig.js';
+export * from './termdb.usecase.js';
+export * from './terms.js';
+export * from './time.js';
+export * from './tree.js';
+export * from './urljson.js';
+export * from './vcf.ann.js';
+export * from './vcf.csq.js';
+export * from './vcf.info.js';
+export * from './vcf.js';
+export * from './vcf.type.js';

package/dist/src/index.js

@@ -0,0 +1,27 @@
+export * from "../constants/AiHisto.js";
+export * from "./aiHisto.js";
+export * from "./bulk.js";
+export * from "./clustering.js";
+export * from "./common.js";
+export * from "./compute.percentile.js";
+export * from "./fetch-helpers.js";
+export * from "./fileSize.js";
+export * from "./filter.js";
+export * from "./hash.js";
+export * from "./helpers.js";
+export * from "./joinUrl.js";
+export * from "./mds3tk.js";
+export * from "./roundValue.js";
+export * from "./termdb.bins.js";
+export * from "./termdb.initbinconfig.js";
+export * from "./termdb.usecase.js";
+export * from "./terms.js";
+export * from "./time.js";
+export * from "./tree.js";
+export * from "./urljson.js";
+export * from "./vcf.ann.js";
+export * from "./vcf.csq.js";
+export * from "./vcf.info.js";
+export * from "./vcf.js";
+export * from "./vcf.type.js";
+//# sourceMappingURL=index.js.map

package/dist/src/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/index.ts"],
+  "sourcesContent": ["// IMPORTANT: import .js extension, even though the actual code files are .ts\nexport * from '../constants/AiHisto.js'\n\n// please list in alphanumeric order for readability\nexport * from './aiHisto.js'\nexport * from './bulk.js'\nexport * from './clustering.js'\nexport * from './common.js'\nexport * from './compute.percentile.js'\nexport * from './fetch-helpers.js'\nexport * from './fileSize.js'\nexport * from './filter.js'\nexport * from './hash.js'\nexport * from './helpers.js'\nexport * from './joinUrl.js'\nexport * from './mds3tk.js'\nexport * from './roundValue.js'\nexport * from './termdb.bins.js'\nexport * from './termdb.initbinconfig.js'\nexport * from './termdb.usecase.js'\nexport * from './terms.js'\nexport * from './time.js'\nexport * from './tree.js'\nexport * from './urljson.js'\nexport * from './vcf.ann.js'\nexport * from './vcf.csq.js'\nexport * from './vcf.info.js'\nexport * from './vcf.js'\nexport * from './vcf.type.js'\n"],
+  "mappings": "AACA,cAAc;AAGd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;",
+  "names": []
+}

package/dist/src/joinUrl.d.ts

@@ -0,0 +1 @@
+export declare function joinUrl(p1: string, ...p2: string[]): string;

package/dist/src/joinUrl.js

@@ -0,0 +1,17 @@
+function joinUrl(p1, ...p2) {
+  if (typeof p1 != "string") throw `first argument must be string type`;
+  if (!p1) throw "blank string not allowed";
+  if (p1.indexOf("?") != -1) throw "search string not allowed";
+  let url = p1;
+  for (const p of p2) {
+    if (typeof p != "string") throw `all arguments must be string type`;
+    if (!p) throw "blank string not allowed";
+    if (url.slice(-1) != "/") url += "/";
+    url += p.startsWith("/") ? p.substring(1) : p;
+  }
+  return url;
+}
+export {
+  joinUrl
+};
+//# sourceMappingURL=joinUrl.js.map

package/dist/src/joinUrl.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/joinUrl.ts"],
+  "sourcesContent": ["/*\njoins two parts of url into one\npart 1 must be https://domain, with optional \"path\" or \"path/\", must not include search value e.g. ?k=v\npart 2 must be a path of \"path\" or \"/path\"\n\nthe function is simple and doesn't support rest parameter.\nwhen you have 3 pieces to join, do joinUrl( joinUrl(p1,p2), p3)\n\ncannot do below:\n- path.join() normalizes double-slash '://' to ':/' single-slash\n  also cannot use path on client\n- url.resolve() replaces the path string after the domain, instead of appending to it\n\nTODO: also handle './' and '../' path segments to match the path.join() behavior in nodejs,\n      for consistency in expected function signatures/behavior (except for the '://' issue)\n*/\nexport function joinUrl(p1: string, ...p2: string[]): string {\n\t// p1 and p2 both shouldn't be blank string. if so, return null to alert\n\tif (typeof p1 != 'string') throw `first argument must be string type`\n\tif (!p1) throw 'blank string not allowed'\n\tif (p1.indexOf('?') != -1) throw 'search string not allowed' // search string not allowed in p1. if usecase arises can support it\n\n\tlet url = p1\n\tfor(const p of p2) {\n\t\tif (typeof p != 'string') throw `all arguments must be string type`\n\t\tif (!p) throw 'blank string not allowed'\n\t\tif (url.slice(-1) != '/') url += '/'\n\t\turl += p.startsWith('/') ? p.substring(1) : p\n\t}\n\t\n\treturn url\n}\n"],
+  "mappings": "AAgBO,SAAS,QAAQ,OAAe,IAAsB;AAE5D,MAAI,OAAO,MAAM,SAAU,OAAM;AACjC,MAAI,CAAC,GAAI,OAAM;AACf,MAAI,GAAG,QAAQ,GAAG,KAAK,GAAI,OAAM;AAEjC,MAAI,MAAM;AACV,aAAU,KAAK,IAAI;AAClB,QAAI,OAAO,KAAK,SAAU,OAAM;AAChC,QAAI,CAAC,EAAG,OAAM;AACd,QAAI,IAAI,MAAM,EAAE,KAAK,IAAK,QAAO;AACjC,WAAO,EAAE,WAAW,GAAG,IAAI,EAAE,UAAU,CAAC,IAAI;AAAA,EAC7C;AAEA,SAAO;AACR;",
+  "names": []
+}

package/dist/src/mds3tk.js

@@ -0,0 +1,64 @@
+import { dtcnv, dtsnvindel, dtsv, dtfusionrna } from "./common.js";
+const ssmIdFieldsSeparator = "__";
+function summarize_mclass(mlst) {
+  const m2c = /* @__PURE__ */ new Map();
+  const cnvs = [];
+  for (const m of mlst) {
+    if (m.dt == dtcnv) {
+      cnvs.push(m);
+      continue;
+    }
+    const key = m.class || m.dt;
+    m2c.set(key, 1 + (m2c.get(key) || 0));
+  }
+  if (cnvs.length) {
+    if (Number.isFinite(cnvs[0].value)) {
+      m2c.set(dtcnv, cnvs.length);
+    } else {
+      for (const c of cnvs) {
+        if (!c.class) continue;
+        m2c.set(c.class, 1 + (m2c.get(c.class) || 0));
+      }
+    }
+  }
+  return [...m2c].sort((i, j) => j[1] - i[1]);
+}
+function guessSsmid(ssmid) {
+  const l = ssmid.split(ssmIdFieldsSeparator);
+  if (l.length == 4) {
+    const [chr, tmp, ref, alt] = l;
+    const pos = Number(tmp);
+    if (Number.isNaN(pos)) throw "ssmid snvindel pos not integer";
+    return { dt: dtsnvindel, l: [chr, pos, ref, alt] };
+  }
+  if (l.length == 5) {
+    const [chr, _start, _stop, _class, _value] = l;
+    const start = Number(_start), stop = Number(_stop), value = _value == "" ? null : Number(_value);
+    if (Number.isNaN(start) || Number.isNaN(stop)) throw "ssmid cnv start/stop not integer";
+    return { dt: dtcnv, l: [chr, start, stop, _class, value] };
+  }
+  if (l.length == 6) {
+    if (l[3] == "+" || l[3] == "-") {
+      const [_dt, chr2, _pos, strand, _pi, _mname] = l;
+      const mname = decodeURIComponent(_mname);
+      const dt = Number(_dt);
+      if (dt != dtsv && dt != dtfusionrna) throw "ssmid dt not sv/fusion";
+      const pos = Number(_pos);
+      if (Number.isNaN(pos)) throw "ssmid svfusion position not integer";
+      const pairlstIdx = Number(_pi);
+      if (Number.isNaN(pairlstIdx)) throw "ssmid pairlstIdx not integer";
+      return { dt, l: [dt, chr2, pos, strand, pairlstIdx, mname] };
+    }
+    const [chr, _start, _stop, _class, _value, sample] = l;
+    const start = Number(_start), stop = Number(_stop), value = _value == "" ? null : Number(_value);
+    if (Number.isNaN(start) || Number.isNaN(stop)) throw "ssmid cnv start/stop not integer";
+    return { dt: dtcnv, l: [chr, start, stop, _class, value, sample] };
+  }
+  throw "unknown ssmid";
+}
+export {
+  guessSsmid,
+  ssmIdFieldsSeparator,
+  summarize_mclass
+};
+//# sourceMappingURL=mds3tk.js.map

package/dist/src/mds3tk.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/mds3tk.js"],
+  "sourcesContent": ["import { dtcnv, dtsnvindel, dtsv, dtfusionrna } from './common.js'\n\n// this script should contain mds3 track-related stuff shared between client and backend\n\n/*\nthe separator is used to join essential bits of a variant obj into a string as the \"ssm_id\", aims to uniquely identify a variant irrespective of sample\nthis is to mimic the GDC \"ssm_id\" which is a random id, with below benefits:\n- consistent way to pass request body for both gdc and non-gdc\n- uniform identification of ssm/cnv/sv in non-gdc backend code\n- uniform identification of all variants in client\n\nssm: chr + pos + ref + alt\ncnv:  chr + start + stop + class\nsvfusion: dt + chr + pos + strand + pairlstidx + mname\n\nthe separator must avoid conflicting with characters from gene names, and can be changed based on needs\n*/\nexport const ssmIdFieldsSeparator = '__'\n\n/*\ninput: array of mixture of ssm, svfusion and cnv\n\noutput: sorted array. each element: [ class/dt, count of m ]\n*/\nexport function summarize_mclass(mlst) {\n\tconst m2c = new Map() // k: mclass, v: {}\n\tconst cnvs = []\n\tfor (const m of mlst) {\n\t\tif (m.dt == dtcnv) {\n\t\t\tcnvs.push(m)\n\t\t\tcontinue // process cnv later\n\t\t}\n\t\t// snvindel has m.class=str, svfusion has only dt=int\n\t\tconst key = m.class || m.dt\n\t\tm2c.set(key, 1 + (m2c.get(key) || 0))\n\t}\n\n\tif (cnvs.length) {\n\t\tif (Number.isFinite(cnvs[0].value)) {\n\t\t\t// first cnv uses numeric value (assumes all the same). record by dt\n\t\t\tm2c.set(dtcnv, cnvs.length)\n\t\t} else {\n\t\t\t// cnv not numeric and uses class; record by each class\n\t\t\tfor (const c of cnvs) {\n\t\t\t\tif (!c.class) continue // should not happen\n\t\t\t\tm2c.set(c.class, 1 + (m2c.get(c.class) || 0))\n\t\t\t}\n\t\t}\n\t}\n\treturn [...m2c].sort((i, j) => j[1] - i[1])\n}\n\n/*\nssmid is not specific for ssm, it covers all alterations\ngdc ssm are identified by a specific uuid, thus the design\n*/\nexport function guessSsmid(ssmid) {\n\tconst l = ssmid.split(ssmIdFieldsSeparator)\n\tif (l.length == 4) {\n\t\tconst [chr, tmp, ref, alt] = l\n\t\tconst pos = Number(tmp)\n\t\tif (Number.isNaN(pos)) throw 'ssmid snvindel pos not integer'\n\t\treturn { dt: dtsnvindel, l: [chr, pos, ref, alt] }\n\t}\n\tif (l.length == 5) {\n\t\t// cnv. if type=cat, _value is blank string\n\t\tconst [chr, _start, _stop, _class, _value] = l\n\t\tconst start = Number(_start),\n\t\t\tstop = Number(_stop),\n\t\t\tvalue = _value == '' ? null : Number(_value)\n\t\tif (Number.isNaN(start) || Number.isNaN(stop)) throw 'ssmid cnv start/stop not integer'\n\t\treturn { dt: dtcnv, l: [chr, start, stop, _class, value] }\n\t}\n\tif (l.length == 6) {\n\t\tif (l[3] == '+' || l[3] == '-') {\n\t\t\t// sv/fusion\n\t\t\tconst [_dt, chr, _pos, strand, _pi, _mname] = l\n\n\t\t\t// mname is encoded in case it contains comma (and is same as ssmIdFieldsSeparator)\n\t\t\tconst mname = decodeURIComponent(_mname)\n\t\t\tconst dt = Number(_dt)\n\t\t\tif (dt != dtsv && dt != dtfusionrna) throw 'ssmid dt not sv/fusion'\n\t\t\tconst pos = Number(_pos)\n\t\t\tif (Number.isNaN(pos)) throw 'ssmid svfusion position not integer'\n\t\t\tconst pairlstIdx = Number(_pi)\n\t\t\tif (Number.isNaN(pairlstIdx)) throw 'ssmid pairlstIdx not integer'\n\t\t\treturn { dt, l: [dt, chr, pos, strand, pairlstIdx, mname] }\n\t\t}\n\t\t// cnv with sample\n\t\tconst [chr, _start, _stop, _class, _value, sample] = l\n\t\tconst start = Number(_start),\n\t\t\tstop = Number(_stop),\n\t\t\tvalue = _value == '' ? null : Number(_value) // if cnv not using value, must avoid `Number('')=0`\n\t\tif (Number.isNaN(start) || Number.isNaN(stop)) throw 'ssmid cnv start/stop not integer'\n\t\treturn { dt: dtcnv, l: [chr, start, stop, _class, value, sample] }\n\t}\n\tthrow 'unknown ssmid'\n}\n"],
+  "mappings": "AAAA,SAAS,OAAO,YAAY,MAAM,mBAAmB;AAiB9C,MAAM,uBAAuB;AAO7B,SAAS,iBAAiB,MAAM;AACtC,QAAM,MAAM,oBAAI,IAAI;AACpB,QAAM,OAAO,CAAC;AACd,aAAW,KAAK,MAAM;AACrB,QAAI,EAAE,MAAM,OAAO;AAClB,WAAK,KAAK,CAAC;AACX;AAAA,IACD;AAEA,UAAM,MAAM,EAAE,SAAS,EAAE;AACzB,QAAI,IAAI,KAAK,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE;AAAA,EACrC;AAEA,MAAI,KAAK,QAAQ;AAChB,QAAI,OAAO,SAAS,KAAK,CAAC,EAAE,KAAK,GAAG;AAEnC,UAAI,IAAI,OAAO,KAAK,MAAM;AAAA,IAC3B,OAAO;AAEN,iBAAW,KAAK,MAAM;AACrB,YAAI,CAAC,EAAE,MAAO;AACd,YAAI,IAAI,EAAE,OAAO,KAAK,IAAI,IAAI,EAAE,KAAK,KAAK,EAAE;AAAA,MAC7C;AAAA,IACD;AAAA,EACD;AACA,SAAO,CAAC,GAAG,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAC3C;AAMO,SAAS,WAAW,OAAO;AACjC,QAAM,IAAI,MAAM,MAAM,oBAAoB;AAC1C,MAAI,EAAE,UAAU,GAAG;AAClB,UAAM,CAAC,KAAK,KAAK,KAAK,GAAG,IAAI;AAC7B,UAAM,MAAM,OAAO,GAAG;AACtB,QAAI,OAAO,MAAM,GAAG,EAAG,OAAM;AAC7B,WAAO,EAAE,IAAI,YAAY,GAAG,CAAC,KAAK,KAAK,KAAK,GAAG,EAAE;AAAA,EAClD;AACA,MAAI,EAAE,UAAU,GAAG;AAElB,UAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,MAAM,IAAI;AAC7C,UAAM,QAAQ,OAAO,MAAM,GAC1B,OAAO,OAAO,KAAK,GACnB,QAAQ,UAAU,KAAK,OAAO,OAAO,MAAM;AAC5C,QAAI,OAAO,MAAM,KAAK,KAAK,OAAO,MAAM,IAAI,EAAG,OAAM;AACrD,WAAO,EAAE,IAAI,OAAO,GAAG,CAAC,KAAK,OAAO,MAAM,QAAQ,KAAK,EAAE;AAAA,EAC1D;AACA,MAAI,EAAE,UAAU,GAAG;AAClB,QAAI,EAAE,CAAC,KAAK,OAAO,EAAE,CAAC,KAAK,KAAK;AAE/B,YAAM,CAAC,KAAKA,MAAK,MAAM,QAAQ,KAAK,MAAM,IAAI;AAG9C,YAAM,QAAQ,mBAAmB,MAAM;AACvC,YAAM,KAAK,OAAO,GAAG;AACrB,UAAI,MAAM,QAAQ,MAAM,YAAa,OAAM;AAC3C,YAAM,MAAM,OAAO,IAAI;AACvB,UAAI,OAAO,MAAM,GAAG,EAAG,OAAM;AAC7B,YAAM,aAAa,OAAO,GAAG;AAC7B,UAAI,OAAO,MAAM,UAAU,EAAG,OAAM;AACpC,aAAO,EAAE,IAAI,GAAG,CAAC,IAAIA,MAAK,KAAK,QAAQ,YAAY,KAAK,EAAE;AAAA,IAC3D;AAEA,UAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,QAAQ,MAAM,IAAI;AACrD,UAAM,QAAQ,OAAO,MAAM,GAC1B,OAAO,OAAO,KAAK,GACnB,QAAQ,UAAU,KAAK,OAAO,OAAO,MAAM;AAC5C,QAAI,OAAO,MAAM,KAAK,KAAK,OAAO,MAAM,IAAI,EAAG,OAAM;AACrD,WAAO,EAAE,IAAI,OAAO,GAAG,CAAC,KAAK,OAAO,MAAM,QAAQ,OAAO,MAAM,EAAE;AAAA,EAClE;AACA,QAAM;AACP;",
+  "names": ["chr"]
+}

package/dist/src/roundValue.js

@@ -0,0 +1,57 @@
+function roundValue(value, digits) {
+  const v = Number(value);
+  if (Number.isInteger(v)) return v;
+  if (Math.abs(v) < 1) return Number(v.toPrecision(digits));
+  return Number(v.toFixed(digits));
+}
+function roundValueAuto(value, format = false, defaultDigits = 2) {
+  if (!value && value != 0) return value;
+  const dp = decimalPlacesUntilFirstNonZero(value);
+  const digits = Math.abs(value) > 1 ? defaultDigits : dp > 0 ? dp + 1 : defaultDigits;
+  if (format) return formatValue(value, digits);
+  return roundValue(value, digits);
+}
+function decimalPlacesUntilFirstNonZero(number) {
+  const numberStr = number.toString();
+  const decimalIndex = numberStr.indexOf(".");
+  if (decimalIndex === -1 || decimalIndex === numberStr.length - 1) {
+    return 0;
+  }
+  let decimalPlaces = 0;
+  for (let i = decimalIndex + 1; i < numberStr.length; i++) {
+    if (numberStr[i] === "0") {
+      decimalPlaces++;
+    } else if (numberStr[i] >= "1" && numberStr[i] <= "9") {
+      break;
+    }
+  }
+  return decimalPlaces;
+}
+function roundValue2(value) {
+  if (!Number.isFinite(value)) return value;
+  if (Number.isInteger(value)) return value;
+  const abs = Math.abs(value);
+  if (abs > 100) return Math.round(value);
+  if (abs > 10) return Number(value.toFixed(1));
+  if (abs > 1) return Number(value.toFixed(2));
+  if (abs > 0.1) return Number(value.toFixed(3));
+  if (abs > 0.01) return Number(value.toFixed(4));
+  return value;
+}
+function formatValue(value, digits) {
+  const v = Number(value);
+  if (Number.isInteger(v)) return v;
+  const abs = Math.abs(v);
+  if (abs < 1 || abs > 9999) {
+    return abs > 9999 ? v.toPrecision(digits) : Number(v.toPrecision(digits));
+  }
+  return Number(v.toFixed(digits));
+}
+export {
+  decimalPlacesUntilFirstNonZero,
+  formatValue,
+  roundValue,
+  roundValue2,
+  roundValueAuto
+};
+//# sourceMappingURL=roundValue.js.map

package/dist/src/roundValue.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/roundValue.js"],
+  "sourcesContent": ["/*\nround a value to specified digits\n    - if value is integer, value is returned\n    - if value is a fractional float, round to precision\n    - if value is not a fractional float, round to decimal point\n    - TODO: handle scientific notation\nvalue: given value\ndigits: number of digits to round to\n*/\n\nexport function roundValue(value, digits) {\n\tconst v = Number(value)\n\tif (Number.isInteger(v)) return v\n\tif (Math.abs(v) < 1) return Number(v.toPrecision(digits))\n\treturn Number(v.toFixed(digits))\n}\n\n/** Rounds numbers to the appropriate decimal point\n * if format is true, returns either a number or string in\n * scientific notation.\n *\n * TODO: Review digit logic.\n */\n\nexport function roundValueAuto(value, format = false, defaultDigits = 2) {\n\tif (!value && value != 0) return value\n\tconst dp = decimalPlacesUntilFirstNonZero(value)\n\tconst digits = Math.abs(value) > 1 ? defaultDigits : dp > 0 ? dp + 1 : defaultDigits\n\tif (format) return formatValue(value, digits)\n\treturn roundValue(value, digits)\n}\n\nexport function decimalPlacesUntilFirstNonZero(number) {\n\t// Convert number to string\n\tconst numberStr = number.toString()\n\n\t// Find the position of the decimal point\n\tconst decimalIndex = numberStr.indexOf('.')\n\n\t// If decimal point is not found or number is an integer, return 0\n\tif (decimalIndex === -1 || decimalIndex === numberStr.length - 1) {\n\t\treturn 0\n\t}\n\n\t// Iterate through characters after the decimal point\n\tlet decimalPlaces = 0\n\tfor (let i = decimalIndex + 1; i < numberStr.length; i++) {\n\t\t// Increment the count of decimal places until a non-zero digit is found\n\t\tif (numberStr[i] === '0') {\n\t\t\tdecimalPlaces++\n\t\t} else if (numberStr[i] >= '1' && numberStr[i] <= '9') {\n\t\t\tbreak\n\t\t}\n\t}\n\n\treturn decimalPlaces\n}\n\n/* \nsimple logic to return a number close to original while rounding up decimals.\nsupplements roundValueAuto which rounds 12345 to 1.2e4 which is only suitable for human quick glance but not subsequent computing\n\nTODO:\n10000 and 10001 to 1e4\n0.00001 to 1e-5\n1.00001 to 1\n*/\nexport function roundValue2(value) {\n\tif (!Number.isFinite(value)) return value // not a number\n\tif (Number.isInteger(value)) return value // is integer, do not convert\n\tconst abs = Math.abs(value)\n\tif (abs > 100) return Math.round(value) // 12345.1234 to 12345 (compared to 1.2e4 from roundValueAuto)\n\tif (abs > 10) return Number(value.toFixed(1)) // 99.1234 to 99.1\n\tif (abs > 1) return Number(value.toFixed(2)) // 9.1234 to 9.12\n\tif (abs > 0.1) return Number(value.toFixed(3)) // 0.12345 to 0.123\n\tif (abs > 0.01) return Number(value.toFixed(4)) // 0.012345 to 0.0123\n\treturn value // as is\n}\n\n/** Use to return displayed values in scientific notation\n * Do not use for values intended for calculation later.\n */\nexport function formatValue(value, digits) {\n\tconst v = Number(value)\n\tif (Number.isInteger(v)) return v\n\tconst abs = Math.abs(v)\n\tif (abs < 1 || abs > 9999) {\n\t\t//Number() reverts positive values less than 10^21 to a whole number\n\t\t//To return the value in scientific notation, use toPrecision without Number()\n\t\treturn abs > 9999 ? v.toPrecision(digits) : Number(v.toPrecision(digits))\n\t}\n\treturn Number(v.toFixed(digits))\n}\n"],
+  "mappings": "AAUO,SAAS,WAAW,OAAO,QAAQ;AACzC,QAAM,IAAI,OAAO,KAAK;AACtB,MAAI,OAAO,UAAU,CAAC,EAAG,QAAO;AAChC,MAAI,KAAK,IAAI,CAAC,IAAI,EAAG,QAAO,OAAO,EAAE,YAAY,MAAM,CAAC;AACxD,SAAO,OAAO,EAAE,QAAQ,MAAM,CAAC;AAChC;AASO,SAAS,eAAe,OAAO,SAAS,OAAO,gBAAgB,GAAG;AACxE,MAAI,CAAC,SAAS,SAAS,EAAG,QAAO;AACjC,QAAM,KAAK,+BAA+B,KAAK;AAC/C,QAAM,SAAS,KAAK,IAAI,KAAK,IAAI,IAAI,gBAAgB,KAAK,IAAI,KAAK,IAAI;AACvE,MAAI,OAAQ,QAAO,YAAY,OAAO,MAAM;AAC5C,SAAO,WAAW,OAAO,MAAM;AAChC;AAEO,SAAS,+BAA+B,QAAQ;AAEtD,QAAM,YAAY,OAAO,SAAS;AAGlC,QAAM,eAAe,UAAU,QAAQ,GAAG;AAG1C,MAAI,iBAAiB,MAAM,iBAAiB,UAAU,SAAS,GAAG;AACjE,WAAO;AAAA,EACR;AAGA,MAAI,gBAAgB;AACpB,WAAS,IAAI,eAAe,GAAG,IAAI,UAAU,QAAQ,KAAK;AAEzD,QAAI,UAAU,CAAC,MAAM,KAAK;AACzB;AAAA,IACD,WAAW,UAAU,CAAC,KAAK,OAAO,UAAU,CAAC,KAAK,KAAK;AACtD;AAAA,IACD;AAAA,EACD;AAEA,SAAO;AACR;AAWO,SAAS,YAAY,OAAO;AAClC,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,MAAI,OAAO,UAAU,KAAK,EAAG,QAAO;AACpC,QAAM,MAAM,KAAK,IAAI,KAAK;AAC1B,MAAI,MAAM,IAAK,QAAO,KAAK,MAAM,KAAK;AACtC,MAAI,MAAM,GAAI,QAAO,OAAO,MAAM,QAAQ,CAAC,CAAC;AAC5C,MAAI,MAAM,EAAG,QAAO,OAAO,MAAM,QAAQ,CAAC,CAAC;AAC3C,MAAI,MAAM,IAAK,QAAO,OAAO,MAAM,QAAQ,CAAC,CAAC;AAC7C,MAAI,MAAM,KAAM,QAAO,OAAO,MAAM,QAAQ,CAAC,CAAC;AAC9C,SAAO;AACR;AAKO,SAAS,YAAY,OAAO,QAAQ;AAC1C,QAAM,IAAI,OAAO,KAAK;AACtB,MAAI,OAAO,UAAU,CAAC,EAAG,QAAO;AAChC,QAAM,MAAM,KAAK,IAAI,CAAC;AACtB,MAAI,MAAM,KAAK,MAAM,MAAM;AAG1B,WAAO,MAAM,OAAO,EAAE,YAAY,MAAM,IAAI,OAAO,EAAE,YAAY,MAAM,CAAC;AAAA,EACzE;AACA,SAAO,OAAO,EAAE,QAAQ,MAAM,CAAC;AAChC;",
+  "names": []
+}