@sjcrh/proteinpaint-client 2.187.0 → 2.188.0

package/dist/chunk-B43MTEYB.js

@@ -0,0 +1,84 @@
+// ../shared/utils/dist/src/tree.js
+var hardcode_root = "root";
+var hierarchy_spacer = "...";
+function stratinput(lst, levels) {
+  const lp = /* @__PURE__ */ Object.create(null);
+  const nodes = /* @__PURE__ */ Object.create(null);
+  const size = /* @__PURE__ */ Object.create(null);
+  for (const m of lst) {
+    for (const [i, lev] of levels.entries()) {
+      const thisv = getkey(m, i, levels);
+      const pav = getkey(m, i - 1, levels);
+      if (!m[lev.k]) {
+        if (i > 0) {
+          size[pav] += 1;
+        }
+        break;
+      }
+      lp[thisv] = pav;
+      if (!(thisv in size)) {
+        size[thisv] = 0;
+      }
+      if (!(thisv in nodes)) {
+        const n = {
+          lst: []
+        };
+        if (lev.full) {
+          n.full = m[lev.full];
+        }
+        n.id0 = levels[0].k;
+        n.v0 = m[levels[0].k];
+        if (i == 1) {
+          n.id1 = levels[1].k;
+          n.v1 = m[levels[1].k];
+        }
+        if (i == 2) {
+          n.id2 = levels[2].k;
+          n.v1 = m[levels[2].k];
+        }
+        nodes[thisv] = n;
+      }
+      nodes[thisv].lst.push(m);
+      if (i == levels.length - 1) {
+        size[thisv] += 1;
+      }
+    }
+  }
+  const nlst = [{ id: hardcode_root, name: hardcode_root }];
+  for (const chid in lp) {
+    const paid = lp[chid];
+    const n = nodes[chid];
+    const fields = chid.split(hierarchy_spacer);
+    nlst.push({
+      id: chid,
+      parentId: paid,
+      lst: n.lst,
+      value: size[chid],
+      name: fields[fields.length - 1],
+      // show this instead of chid
+      full: n.full,
+      id0: n.id0,
+      v0: n.v0,
+      id1: n.id1,
+      v1: n.v1,
+      id2: n.id2,
+      v2: n.v2
+    });
+  }
+  return nlst;
+}
+function getkey(m, i, levels) {
+  const klst = [hardcode_root];
+  for (let j = 0; j < i; j++) {
+    klst.push(m[levels[j].k]);
+  }
+  if (i >= 0) {
+    klst.push(m[levels[i].k]);
+  }
+  return klst.join(hierarchy_spacer);
+}
+
+export {
+  stratinput
+};
+//# sourceMappingURL=chunk-B43MTEYB.js.map

package/dist/chunk-B43MTEYB.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../shared/utils/src/tree.js"],
+  "sourcesContent": ["/*\ninput:\n1. list of leaf nodes, e.g. mutation cases, each with a set of key-value pairs\n2. levels of hierarchy in an ordered list\n   each item: { k, full }\n   \"k\" and \"full\" are two attribute keys\n\noutput:\na list of items, as input for d3-hierarchy.stratify\none item for each child-parent relationship in the hierarchy\n{\n\tid:\n\tparentId:\n\tlst:\n\tvalue:\n\tname:\n\tfull:\n\tid0:\n\tv0:\n\tid1:\n\tv1:\n\tid2:\n\tv2:\n}\n\nstrange issue: https://github.com/stjude/proteinpaint/commit/c36004d47d4374d2ade719c6ef9e2b848f0850dc\nusing Map for lp, nodes etc will cause memory issue, thus the use of simple objects\n\nto-do: verify this works after a reorg\n*/\n\nconst hardcode_root = 'root'\nconst hierarchy_spacer = '...'\n\nexport function stratinput(lst, levels) {\n\tconst lp = Object.create(null)\n\t// leaf to parent\n\t// k: HM...BALL...sub\n\t// v: HM...BALL\n\n\tconst nodes = Object.create(null)\n\t/*\n\tk: string id of node, e.g. HM...BALL\n\tv: node\n\t\t.full\n\t\t.lst[]\n\t\t\titems from input\n\t*/\n\n\tconst size = Object.create(null)\n\t// only increment size to leaf nodes, so that root.sum() will work\n\t// k: string id of a node, e.g. HM...BALL\n\t// v: number of items\n\n\tfor (const m of lst) {\n\t\tfor (const [i, lev] of levels.entries()) {\n\t\t\tconst thisv = getkey(m, i, levels)\n\t\t\tconst pav = getkey(m, i - 1, levels)\n\n\t\t\t// as mutations can come as {\"subtype\":\"\"}\n\t\t\t// in the sunburst chart at the subtype level, this mutation should not be counted\n\t\t\t// thus the test with !m[lev.k] rather than !(lev.k in m)\n\t\t\tif (!m[lev.k]) {\n\t\t\t\t// stop at this level\n\t\t\t\t// add count to prev level\n\t\t\t\tif (i > 0) {\n\t\t\t\t\tsize[pav] += 1\n\t\t\t\t}\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tlp[thisv] = pav\n\t\t\tif (!(thisv in size)) {\n\t\t\t\tsize[thisv] = 0\n\t\t\t}\n\t\t\tif (!(thisv in nodes)) {\n\t\t\t\tconst n = {\n\t\t\t\t\tlst: []\n\t\t\t\t}\n\t\t\t\tif (lev.full) {\n\t\t\t\t\tn.full = m[lev.full]\n\t\t\t\t}\n\n\t\t\t\tn.id0 = levels[0].k\n\t\t\t\tn.v0 = m[levels[0].k]\n\t\t\t\tif (i == 1) {\n\t\t\t\t\tn.id1 = levels[1].k\n\t\t\t\t\tn.v1 = m[levels[1].k]\n\t\t\t\t}\n\t\t\t\tif (i == 2) {\n\t\t\t\t\tn.id2 = levels[2].k\n\t\t\t\t\tn.v1 = m[levels[2].k]\n\t\t\t\t}\n\n\t\t\t\tnodes[thisv] = n\n\t\t\t}\n\t\t\tnodes[thisv].lst.push(m)\n\t\t\tif (i == levels.length - 1) {\n\t\t\t\tsize[thisv] += 1\n\t\t\t}\n\t\t}\n\t}\n\n\tconst nlst = [{ id: hardcode_root, name: hardcode_root }]\n\n\tfor (const chid in lp) {\n\t\tconst paid = lp[chid]\n\t\tconst n = nodes[chid]\n\t\tconst fields = chid.split(hierarchy_spacer)\n\t\tnlst.push({\n\t\t\tid: chid,\n\t\t\tparentId: paid,\n\t\t\tlst: n.lst,\n\t\t\tvalue: size[chid],\n\t\t\tname: fields[fields.length - 1], // show this instead of chid\n\t\t\tfull: n.full,\n\t\t\tid0: n.id0,\n\t\t\tv0: n.v0,\n\t\t\tid1: n.id1,\n\t\t\tv1: n.v1,\n\t\t\tid2: n.id2,\n\t\t\tv2: n.v2\n\t\t})\n\t}\n\treturn nlst\n}\n\nfunction getkey(m, i, levels) {\n\t// if i is 0, return 'root'\n\tconst klst = [hardcode_root]\n\tfor (let j = 0; j < i; j++) {\n\t\tklst.push(m[levels[j].k])\n\t}\n\tif (i >= 0) {\n\t\tklst.push(m[levels[i].k])\n\t}\n\treturn klst.join(hierarchy_spacer)\n}\n"],
+  "mappings": ";AA+BA,IAAM,gBAAgB;AACtB,IAAM,mBAAmB;AAElB,SAAS,WAAW,KAAK,QAAQ;AACvC,QAAM,KAAK,uBAAO,OAAO,IAAI;AAK7B,QAAM,QAAQ,uBAAO,OAAO,IAAI;AAShC,QAAM,OAAO,uBAAO,OAAO,IAAI;AAK/B,aAAW,KAAK,KAAK;AACpB,eAAW,CAAC,GAAG,GAAG,KAAK,OAAO,QAAQ,GAAG;AACxC,YAAM,QAAQ,OAAO,GAAG,GAAG,MAAM;AACjC,YAAM,MAAM,OAAO,GAAG,IAAI,GAAG,MAAM;AAKnC,UAAI,CAAC,EAAE,IAAI,CAAC,GAAG;AAGd,YAAI,IAAI,GAAG;AACV,eAAK,GAAG,KAAK;QACd;AACA;MACD;AAEA,SAAG,KAAK,IAAI;AACZ,UAAI,EAAE,SAAS,OAAO;AACrB,aAAK,KAAK,IAAI;MACf;AACA,UAAI,EAAE,SAAS,QAAQ;AACtB,cAAM,IAAI;UACT,KAAK,CAAC;QACP;AACA,YAAI,IAAI,MAAM;AACb,YAAE,OAAO,EAAE,IAAI,IAAI;QACpB;AAEA,UAAE,MAAM,OAAO,CAAC,EAAE;AAClB,UAAE,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;AACpB,YAAI,KAAK,GAAG;AACX,YAAE,MAAM,OAAO,CAAC,EAAE;AAClB,YAAE,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;QACrB;AACA,YAAI,KAAK,GAAG;AACX,YAAE,MAAM,OAAO,CAAC,EAAE;AAClB,YAAE,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;QACrB;AAEA,cAAM,KAAK,IAAI;MAChB;AACA,YAAM,KAAK,EAAE,IAAI,KAAK,CAAC;AACvB,UAAI,KAAK,OAAO,SAAS,GAAG;AAC3B,aAAK,KAAK,KAAK;MAChB;IACD;EACD;AAEA,QAAM,OAAO,CAAC,EAAE,IAAI,eAAe,MAAM,cAAc,CAAC;AAExD,aAAW,QAAQ,IAAI;AACtB,UAAM,OAAO,GAAG,IAAI;AACpB,UAAM,IAAI,MAAM,IAAI;AACpB,UAAM,SAAS,KAAK,MAAM,gBAAgB;AAC1C,SAAK,KAAK;MACT,IAAI;MACJ,UAAU;MACV,KAAK,EAAE;MACP,OAAO,KAAK,IAAI;MAChB,MAAM,OAAO,OAAO,SAAS,CAAC;;MAC9B,MAAM,EAAE;MACR,KAAK,EAAE;MACP,IAAI,EAAE;MACN,KAAK,EAAE;MACP,IAAI,EAAE;MACN,KAAK,EAAE;MACP,IAAI,EAAE;IACP,CAAC;EACF;AACA,SAAO;AACR;AAEA,SAAS,OAAO,GAAG,GAAG,QAAQ;AAE7B,QAAM,OAAO,CAAC,aAAa;AAC3B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,SAAK,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;EACzB;AACA,MAAI,KAAK,GAAG;AACX,SAAK,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;EACzB;AACA,SAAO,KAAK,KAAK,gBAAgB;AAClC;",
+  "names": []
+}