@weng-lab/visualization 2.6.0-beta.0 → 2.6.0

package/dist/visualization.es84.js

@@ -1,65 +1,68 @@
-import m from "./visualization.es230.js";
-import c from "./visualization.es231.js";
-import s from "./visualization.es232.js";
-import u from "./visualization.es233.js";
-import l from "./visualization.es234.js";
-import _ from "./visualization.es235.js";
-import y from "./visualization.es236.js";
-import v from "./visualization.es237.js";
-import g from "./visualization.es238.js";
-import A from "./visualization.es239.js";
-import w from "./visualization.es240.js";
-import B from "./visualization.es241.js";
-import b from "./visualization.es242.js";
-function d(e, o) {
-  e instanceof Map ? (e = [void 0, e], o === void 0 && (o = j)) : o === void 0 && (o = C);
-  for (var f = new i(e), r, h = [f], a, t, n, p; r = h.pop(); )
-    if ((t = o(r.data)) && (p = (t = Array.from(t)).length))
-      for (r.children = t, n = p - 1; n >= 0; --n)
-        h.push(a = t[n] = new i(t[n])), a.parent = r, a.depth = r.depth + 1;
-  return f.eachBefore(D);
+import { jsx as b, jsxs as p, Fragment as W } from "react/jsx-runtime";
+import { c as S } from "react/compiler-runtime";
+import { TreeLink as g } from "./visualization.es129.js";
+import { memo as E } from "react";
+import { LeafLinkExtension as M } from "./visualization.es130.js";
+import { LeafNodeLabel as v } from "./visualization.es131.js";
+const F = E((x) => {
+  const e = S(39), {
+    node: o,
+    dimmed: m,
+    useBranchLengths: n,
+    leafFontFamily: d,
+    leafFontSize: c,
+    onNodeMouseMove: k,
+    onNodeMouseLeave: h,
+    onBranchClick: L
+  } = x;
+  let a;
+  e[0] !== o || e[1] !== k ? (a = (N) => k(N, o), e[0] = o, e[1] = k, e[2] = a) : a = e[2];
+  let t;
+  e[3] !== o || e[4] !== h ? (t = (N) => h(N, o), e[3] = o, e[4] = h, e[5] = t) : t = e[5];
+  let i;
+  e[6] !== o || e[7] !== L ? (i = () => L(o.leaves().map(P)), e[6] = o, e[7] = L, e[8] = i) : i = e[8];
+  const s = m ? 0.2 : 1;
+  let f;
+  e[9] === /* @__PURE__ */ Symbol.for("react.memo_cache_sentinel") ? (f = {
+    transition: "opacity 0.2s ease-in"
+  }, e[9] = f) : f = e[9];
+  let r;
+  e[10] !== o.baseLinkPath || e[11] !== o.color || e[12] !== o.linkStrokeWidth || e[13] !== o.scaledLinkPath || e[14] !== n ? (r = /* @__PURE__ */ b(g, { scaledLinkPath: o.scaledLinkPath, baseLinkPath: o.baseLinkPath, color: o.color, strokeWidth: o.linkStrokeWidth, useBranchLengths: n }), e[10] = o.baseLinkPath, e[11] = o.color, e[12] = o.linkStrokeWidth, e[13] = o.scaledLinkPath, e[14] = n, e[15] = r) : r = e[15];
+  let l;
+  e[16] !== d || e[17] !== c || e[18] !== o.baseLeafLinkExtension || e[19] !== o.baseNodeX || e[20] !== o.baseNodeY || e[21] !== o.children || e[22] !== o.color || e[23] !== o.label || e[24] !== o.labelStrokeWidth || e[25] !== o.lightenedLinkExtColor || e[26] !== o.linkStrokeWidth || e[27] !== o.scaledLeafLinkExtension || e[28] !== o.x || e[29] !== n ? (l = !o.children && /* @__PURE__ */ p(W, { children: [
+    /* @__PURE__ */ b(M, { useBranchLengths: n, color: o.lightenedLinkExtColor, baseLeafLinkExtension: o.baseLeafLinkExtension, scaledLeafLinkExtension: o.scaledLeafLinkExtension, strokeWidth: o.linkStrokeWidth }),
+    /* @__PURE__ */ b(v, { nodeX: o.x, strokeWidth: o.labelStrokeWidth, baseNodeX: o.baseNodeX, baseNodeY: o.baseNodeY, label: o.label, color: o.color, fontSize: c, fontFamily: d })
+  ] }), e[16] = d, e[17] = c, e[18] = o.baseLeafLinkExtension, e[19] = o.baseNodeX, e[20] = o.baseNodeY, e[21] = o.children, e[22] = o.color, e[23] = o.label, e[24] = o.labelStrokeWidth, e[25] = o.lightenedLinkExtColor, e[26] = o.linkStrokeWidth, e[27] = o.scaledLeafLinkExtension, e[28] = o.x, e[29] = n, e[30] = l) : l = e[30];
+  let u;
+  return e[31] !== o.data.id || e[32] !== a || e[33] !== t || e[34] !== i || e[35] !== s || e[36] !== r || e[37] !== l ? (u = /* @__PURE__ */ p("g", { onMouseMove: a, onMouseLeave: t, onClick: i, id: o.data.id, opacity: s, style: f, children: [
+    r,
+    l
+  ] }), e[31] = o.data.id, e[32] = a, e[33] = t, e[34] = i, e[35] = s, e[36] = r, e[37] = l, e[38] = u) : u = e[38], u;
+}), T = E(function(e) {
+  const o = S(11), {
+    node: m,
+    hovered: n,
+    useBranchLengths: d,
+    onNodeMouseMove: c,
+    onNodeMouseLeave: k,
+    onBranchClick: h,
+    leafFontSize: L,
+    leafFontFamily: a
+  } = e;
+  let t;
+  o[0] !== n || o[1] !== a || o[2] !== L || o[3] !== m || o[4] !== h || o[5] !== k || o[6] !== c || o[7] !== d ? (t = m.descendants()?.map((s, f) => {
+    if (!s.parent)
+      return;
+    const r = !!n.length && !n.some((l) => s.descendantIds?.has(l) || s.ancestorIds?.has(l));
+    return /* @__PURE__ */ b(F, { node: s, dimmed: r, useBranchLengths: d, leafFontSize: L, leafFontFamily: a, onBranchClick: h, onNodeMouseMove: c, onNodeMouseLeave: k }, f);
+  }), o[0] = n, o[1] = a, o[2] = L, o[3] = m, o[4] = h, o[5] = k, o[6] = c, o[7] = d, o[8] = t) : t = o[8];
+  let i;
+  return o[9] !== t ? (i = /* @__PURE__ */ b("g", { id: "tree-root", children: t }), o[9] = t, o[10] = i) : i = o[10], i;
+});
+function P(x) {
+  return x.data.id;
 }
-function k() {
-  return d(this).eachBefore(x);
-}
-function C(e) {
-  return e.children;
-}
-function j(e) {
-  return Array.isArray(e) ? e[1] : null;
-}
-function x(e) {
-  e.data.value !== void 0 && (e.value = e.data.value), e.data = e.data.data;
-}
-function D(e) {
-  var o = 0;
-  do
-    e.height = o;
-  while ((e = e.parent) && e.height < ++o);
-}
-function i(e) {
-  this.data = e, this.depth = this.height = 0, this.parent = null;
-}
-i.prototype = d.prototype = {
-  constructor: i,
-  count: m,
-  each: c,
-  eachAfter: u,
-  eachBefore: s,
-  find: l,
-  sum: _,
-  sort: y,
-  path: v,
-  ancestors: g,
-  descendants: A,
-  leaves: w,
-  links: B,
-  copy: k,
-  [Symbol.iterator]: b
-};
 export {
-  i as Node,
-  D as computeHeight,
-  d as default
+  T as RenderTree
 };
 //# sourceMappingURL=visualization.es84.js.map

package/dist/visualization.es84.js.map

@@ -1 +1 @@
-{"version":3,"file":"visualization.es84.js","sources":["../../../node_modules/.pnpm/d3-hierarchy@3.1.2/node_modules/d3-hierarchy/src/hierarchy/index.js"],"sourcesContent":["import node_count from \"./count.js\";\nimport node_each from \"./each.js\";\nimport node_eachBefore from \"./eachBefore.js\";\nimport node_eachAfter from \"./eachAfter.js\";\nimport node_find from \"./find.js\";\nimport node_sum from \"./sum.js\";\nimport node_sort from \"./sort.js\";\nimport node_path from \"./path.js\";\nimport node_ancestors from \"./ancestors.js\";\nimport node_descendants from \"./descendants.js\";\nimport node_leaves from \"./leaves.js\";\nimport node_links from \"./links.js\";\nimport node_iterator from \"./iterator.js\";\n\nexport default function hierarchy(data, children) {\n  if (data instanceof Map) {\n    data = [undefined, data];\n    if (children === undefined) children = mapChildren;\n  } else if (children === undefined) {\n    children = objectChildren;\n  }\n\n  var root = new Node(data),\n      node,\n      nodes = [root],\n      child,\n      childs,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if ((childs = children(node.data)) && (n = (childs = Array.from(childs)).length)) {\n      node.children = childs;\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = childs[i] = new Node(childs[i]));\n        child.parent = node;\n        child.depth = node.depth + 1;\n      }\n    }\n  }\n\n  return root.eachBefore(computeHeight);\n}\n\nfunction node_copy() {\n  return hierarchy(this).eachBefore(copyData);\n}\n\nfunction objectChildren(d) {\n  return d.children;\n}\n\nfunction mapChildren(d) {\n  return Array.isArray(d) ? d[1] : null;\n}\n\nfunction copyData(node) {\n  if (node.data.value !== undefined) node.value = node.data.value;\n  node.data = node.data.data;\n}\n\nexport function computeHeight(node) {\n  var height = 0;\n  do node.height = height;\n  while ((node = node.parent) && (node.height < ++height));\n}\n\nexport function Node(data) {\n  this.data = data;\n  this.depth =\n  this.height = 0;\n  this.parent = null;\n}\n\nNode.prototype = hierarchy.prototype = {\n  constructor: Node,\n  count: node_count,\n  each: node_each,\n  eachAfter: node_eachAfter,\n  eachBefore: node_eachBefore,\n  find: node_find,\n  sum: node_sum,\n  sort: node_sort,\n  path: node_path,\n  ancestors: node_ancestors,\n  descendants: node_descendants,\n  leaves: node_leaves,\n  links: node_links,\n  copy: node_copy,\n  [Symbol.iterator]: node_iterator\n};\n"],"names":["hierarchy","data","children","mapChildren","objectChildren","root","Node","node","nodes","child","childs","i","n","computeHeight","node_copy","copyData","d","height","node_count","node_each","node_eachAfter","node_eachBefore","node_find","node_sum","node_sort","node_path","node_ancestors","node_descendants","node_leaves","node_links","node_iterator"],"mappings":";;;;;;;;;;;;;AAce,SAASA,EAAUC,GAAMC,GAAU;AAChD,EAAID,aAAgB,OAClBA,IAAO,CAAC,QAAWA,CAAI,GACnBC,MAAa,WAAWA,IAAWC,MAC9BD,MAAa,WACtBA,IAAWE;AAWb,WARIC,IAAO,IAAIC,EAAKL,CAAI,GACpBM,GACAC,IAAQ,CAACH,CAAI,GACbI,GACAC,GACAC,GACAC,GAEGL,IAAOC,EAAM;AAClB,SAAKE,IAASR,EAASK,EAAK,IAAI,OAAOK,KAAKF,IAAS,MAAM,KAAKA,CAAM,GAAG;AAEvE,WADAH,EAAK,WAAWG,GACXC,IAAIC,IAAI,GAAGD,KAAK,GAAG,EAAEA;AACxB,QAAAH,EAAM,KAAKC,IAAQC,EAAOC,CAAC,IAAI,IAAIL,EAAKI,EAAOC,CAAC,CAAC,CAAC,GAClDF,EAAM,SAASF,GACfE,EAAM,QAAQF,EAAK,QAAQ;AAKjC,SAAOF,EAAK,WAAWQ,CAAa;AACtC;AAEA,SAASC,IAAY;AACnB,SAAOd,EAAU,IAAI,EAAE,WAAWe,CAAQ;AAC5C;AAEA,SAASX,EAAeY,GAAG;AACzB,SAAOA,EAAE;AACX;AAEA,SAASb,EAAYa,GAAG;AACtB,SAAO,MAAM,QAAQA,CAAC,IAAIA,EAAE,CAAC,IAAI;AACnC;AAEA,SAASD,EAASR,GAAM;AACtB,EAAIA,EAAK,KAAK,UAAU,WAAWA,EAAK,QAAQA,EAAK,KAAK,QAC1DA,EAAK,OAAOA,EAAK,KAAK;AACxB;AAEO,SAASM,EAAcN,GAAM;AAClC,MAAIU,IAAS;AACb;AAAG,IAAAV,EAAK,SAASU;AAAA,UACTV,IAAOA,EAAK,WAAYA,EAAK,SAAS,EAAEU;AAClD;AAEO,SAASX,EAAKL,GAAM;AACzB,OAAK,OAAOA,GACZ,KAAK,QACL,KAAK,SAAS,GACd,KAAK,SAAS;AAChB;AAEAK,EAAK,YAAYN,EAAU,YAAY;AAAA,EACrC,aAAaM;AAAA,EACb,OAAOY;AAAA,EACP,MAAMC;AAAA,EACN,WAAWC;AAAA,EACX,YAAYC;AAAA,EACZ,MAAMC;AAAA,EACN,KAAKC;AAAA,EACL,MAAMC;AAAA,EACN,MAAMC;AAAA,EACN,WAAWC;AAAA,EACX,aAAaC;AAAA,EACb,QAAQC;AAAA,EACR,OAAOC;AAAA,EACP,MAAMf;AAAA,EACN,CAAC,OAAO,QAAQ,GAAGgB;AACrB;","x_google_ignoreList":[0]}
+{"version":3,"file":"visualization.es84.js","sources":["../src/components/PhyloTree/RenderTree.tsx"],"sourcesContent":["import { PhyloTreeProps, TreeNode } from \"./types\";\nimport { TreeLink } from \"./TreeLink\";\nimport { memo } from \"react\";\nimport { LeafLinkExtension } from \"./LeafLinkExtension\";\nimport { LeafNodeLabel } from \"./LeafNodeLabel\";\n\ntype Shared = {\n  node: TreeNode;\n  useBranchLengths: boolean;\n  leafFontSize: PhyloTreeProps[\"leafFontSize\"];\n  leafFontFamily: PhyloTreeProps[\"leafFontFamily\"];\n  onNodeMouseMove: (event: React.MouseEvent, node: TreeNode) => void;\n  onNodeMouseLeave: (event: React.MouseEvent, node: TreeNode) => void;\n  onBranchClick: (leafIds: string[]) => void;\n};\n\nexport type RenderTreeProps = Shared & {\n  hovered: string[];\n};\n\nexport type RenderChildProps = Shared & {\n  dimmed: boolean;\n};\n\nconst ChildNode = memo(\n  ({ node, dimmed, useBranchLengths, leafFontFamily, leafFontSize, onNodeMouseMove, onNodeMouseLeave, onBranchClick }: RenderChildProps) => {\n    return (\n      <g\n        onMouseMove={(e: React.MouseEvent) => onNodeMouseMove(e, node)}\n        onMouseLeave={(e: React.MouseEvent) => onNodeMouseLeave(e, node)}\n        onClick={() => onBranchClick(node.leaves().map(x => x.data.id))}\n        id={node.data.id}\n        opacity={dimmed ? 0.2 : 1}\n        style={{ transition: \"opacity 0.2s ease-in\" }}\n      >\n        <TreeLink\n          scaledLinkPath={node.scaledLinkPath}\n          baseLinkPath={node.baseLinkPath}\n          color={node.color}\n          strokeWidth={node.linkStrokeWidth}\n          useBranchLengths={useBranchLengths}\n          />\n        {!node.children && (\n          <>\n            <LeafLinkExtension\n              useBranchLengths={useBranchLengths}\n              color={node.lightenedLinkExtColor}\n              baseLeafLinkExtension={node.baseLeafLinkExtension}\n              scaledLeafLinkExtension={node.scaledLeafLinkExtension}\n              strokeWidth={node.linkStrokeWidth}\n            />\n            <LeafNodeLabel\n              nodeX={node.x}\n              strokeWidth={node.labelStrokeWidth}\n              baseNodeX={node.baseNodeX}\n              baseNodeY={node.baseNodeY}\n              label={node.label}\n              color={node.color}\n              fontSize={leafFontSize}\n              fontFamily={leafFontFamily}\n            />\n          </>\n        )}\n      </g>\n    );\n  }\n);\n\nexport const RenderTree = memo(function RenderTree({\n  node,\n  hovered,\n  useBranchLengths,\n  onNodeMouseMove,\n  onNodeMouseLeave,\n  onBranchClick,\n  leafFontSize,\n  leafFontFamily,\n}: RenderTreeProps) {\n  return (\n    <g id={\"tree-root\"}>\n      {/* no root node rendered (since root does not need to display link to parent) */}\n      {node.descendants()?.map((child, i) => {\n        if (!child.parent) return;\n        //This is done to elimate a .ancestors() and .descendants() traversal on every rerender\n        const dimmed = !!hovered.length && !(hovered.some(id => child.descendantIds?.has(id) || child.ancestorIds?.has(id)));\n\n        return (\n          <ChildNode\n            key={i}\n            node={child}\n            dimmed={dimmed}\n            useBranchLengths={useBranchLengths}\n            leafFontSize={leafFontSize}\n            leafFontFamily={leafFontFamily}\n            onBranchClick={onBranchClick}\n            onNodeMouseMove={onNodeMouseMove}\n            onNodeMouseLeave={onNodeMouseLeave}\n          />\n        );\n      })}\n    </g>\n  );\n}, );\n"],"names":["ChildNode","memo","t0","$","_c","node","dimmed","useBranchLengths","leafFontFamily","leafFontSize","onNodeMouseMove","onNodeMouseLeave","onBranchClick","t1","e","t2","e_0","t3","leaves","map","_temp","t4","t5","Symbol","for","transition","t6","baseLinkPath","color","linkStrokeWidth","scaledLinkPath","TreeLink","t7","baseLeafLinkExtension","baseNodeX","baseNodeY","children","label","labelStrokeWidth","lightenedLinkExtColor","scaledLeafLinkExtension","x","jsxs","Fragment","jsx","LeafLinkExtension","LeafNodeLabel","t8","data","id","RenderTree","hovered","descendants","child","i","parent","length","some","descendantIds","has","ancestorIds"],"mappings":";;;;;;AAwBA,MAAMA,IAAYC,EAChBC,CAAAA,MAAA;AAAA,QAAAC,IAAAC,EAAA,EAAA,GAAC;AAAA,IAAAC,MAAAA;AAAAA,IAAAC,QAAAA;AAAAA,IAAAC,kBAAAA;AAAAA,IAAAC,gBAAAA;AAAAA,IAAAC,cAAAA;AAAAA,IAAAC,iBAAAA;AAAAA,IAAAC,kBAAAA;AAAAA,IAAAC,eAAAA;AAAAA,EAAAA,IAAAV;AAAoI,MAAAW;AAAA,EAAAV,EAAA,CAAA,MAAAE,KAAAF,SAAAO,KAGlHG,IAAAC,CAAAA,MAAyBJ,EAAgBI,GAAGT,CAAI,GAACF,OAAAE,GAAAF,OAAAO,GAAAP,OAAAU,KAAAA,IAAAV,EAAA,CAAA;AAAA,MAAAY;AAAA,EAAAZ,EAAA,CAAA,MAAAE,KAAAF,SAAAQ,KAChDI,IAAAC,CAAAA,MAAyBL,EAAiBG,GAAGT,CAAI,GAACF,OAAAE,GAAAF,OAAAQ,GAAAR,OAAAY,KAAAA,IAAAZ,EAAA,CAAA;AAAA,MAAAc;AAAA,EAAAd,EAAA,CAAA,MAAAE,KAAAF,SAAAS,KACvDK,IAAAA,MAAML,EAAcP,EAAIa,SAASC,IAAKC,CAAc,CAAC,GAACjB,OAAAE,GAAAF,OAAAS,GAAAT,OAAAc,KAAAA,IAAAd,EAAA,CAAA;AAEtD,QAAAkB,IAAAf,IAAA,MAAA;AAAgB,MAAAgB;AAAA,EAAAnB,EAAA,CAAA,MAAAoB,uBAAAC,IAAA,2BAAA,KAClBF,IAAA;AAAA,IAAAG,YAAc;AAAA,EAAA,GAAwBtB,OAAAmB,KAAAA,IAAAnB,EAAA,CAAA;AAAA,MAAAuB;AAAA,EAAAvB,EAAA,EAAA,MAAAE,EAAAsB,gBAAAxB,EAAA,EAAA,MAAAE,EAAAuB,SAAAzB,UAAAE,EAAAwB,mBAAA1B,EAAA,EAAA,MAAAE,EAAAyB,kBAAA3B,EAAA,EAAA,MAAAI,KAE7CmB,sBAACK,GAAA,EACiB,gBAAA1B,EAAIyB,gBACN,cAAAzB,EAAIsB,cACX,OAAAtB,EAAIuB,OACE,aAAAvB,EAAIwB,iBACCtB,kBAAAA,GAAgB,GAChCJ,EAAA,EAAA,IAAAE,EAAAsB,cAAAxB,EAAA,EAAA,IAAAE,EAAAuB,OAAAzB,EAAA,EAAA,IAAAE,EAAAwB,iBAAA1B,EAAA,EAAA,IAAAE,EAAAyB,gBAAA3B,QAAAI,GAAAJ,QAAAuB,KAAAA,IAAAvB,EAAA,EAAA;AAAA,MAAA6B;AAAA,EAAA7B,EAAA,EAAA,MAAAK,KAAAL,UAAAM,KAAAN,EAAA,EAAA,MAAAE,EAAA4B,yBAAA9B,UAAAE,EAAA6B,aAAA/B,EAAA,EAAA,MAAAE,EAAA8B,aAAAhC,EAAA,EAAA,MAAAE,EAAA+B,YAAAjC,EAAA,EAAA,MAAAE,EAAAuB,SAAAzB,EAAA,EAAA,MAAAE,EAAAgC,SAAAlC,UAAAE,EAAAiC,oBAAAnC,EAAA,EAAA,MAAAE,EAAAkC,yBAAApC,EAAA,EAAA,MAAAE,EAAAwB,mBAAA1B,EAAA,EAAA,MAAAE,EAAAmC,2BAAArC,EAAA,EAAA,MAAAE,EAAAoC,KAAAtC,UAAAI,KACHyB,IAAA,CAAC3B,EAAI+B,YAAL,gBAAAM,EAAAC,GAAA,EAEG,UAAA;AAAA,IAAA,gBAAAC,EAACC,GAAA,EACmBtC,kBAAAA,GACX,OAAAF,EAAIkC,uBACY,uBAAAlC,EAAI4B,uBACF,yBAAA5B,EAAImC,yBAChB,aAAAnC,EAAIwB,iBAAgB;AAAA,IAEnC,gBAAAe,EAACE,KACQ,OAAAzC,EAAIoC,GACE,aAAApC,EAAIiC,kBACN,WAAAjC,EAAI6B,WACJ,WAAA7B,EAAI8B,WACR,OAAA9B,EAAIgC,OACJ,OAAAhC,EAAIuB,OACDnB,UAAAA,GACED,YAAAA,EAAAA,CAAc;AAAA,EAAA,GAC1B,GAELL,QAAAK,GAAAL,QAAAM,GAAAN,EAAA,EAAA,IAAAE,EAAA4B,uBAAA9B,EAAA,EAAA,IAAAE,EAAA6B,WAAA/B,EAAA,EAAA,IAAAE,EAAA8B,WAAAhC,EAAA,EAAA,IAAAE,EAAA+B,UAAAjC,EAAA,EAAA,IAAAE,EAAAuB,OAAAzB,EAAA,EAAA,IAAAE,EAAAgC,OAAAlC,EAAA,EAAA,IAAAE,EAAAiC,kBAAAnC,EAAA,EAAA,IAAAE,EAAAkC,uBAAApC,EAAA,EAAA,IAAAE,EAAAwB,iBAAA1B,EAAA,EAAA,IAAAE,EAAAmC,yBAAArC,EAAA,EAAA,IAAAE,EAAAoC,GAAAtC,QAAAI,GAAAJ,QAAA6B,KAAAA,IAAA7B,EAAA,EAAA;AAAA,MAAA4C;AAAA,SAAA5C,EAAA,EAAA,MAAAE,EAAA2C,KAAAC,MAAA9C,EAAA,EAAA,MAAAU,KAAAV,EAAA,EAAA,MAAAY,KAAAZ,EAAA,EAAA,MAAAc,KAAAd,EAAA,EAAA,MAAAkB,KAAAlB,EAAA,EAAA,MAAAuB,KAAAvB,UAAA6B,KAnCHe,IAAA,gBAAAL,EAAA,KAAA,EACe,aAAA7B,GACC,cAAAE,GACL,SAAAE,GACL,IAAAZ,EAAI2C,KAAKC,IACJ,SAAA5B,GACF,OAAAC,GAEPI,UAAAA;AAAAA,IAAAA;AAAAA,IAOCM;AAAAA,EAAAA,GAqBH,GAAI7B,EAAA,EAAA,IAAAE,EAAA2C,KAAAC,IAAA9C,QAAAU,GAAAV,QAAAY,GAAAZ,QAAAc,GAAAd,QAAAkB,GAAAlB,QAAAuB,GAAAvB,QAAA6B,GAAA7B,QAAA4C,KAAAA,IAAA5C,EAAA,EAAA,GApCJ4C;AAoCI,CAGV,GAEaG,IAAajD,EAAK,SAAAC,GAAA;AAAA,QAAAC,IAAAC,EAAA,EAAA,GAAoB;AAAA,IAAAC,MAAAA;AAAAA,IAAA8C,SAAAA;AAAAA,IAAA5C,kBAAAA;AAAAA,IAAAG,iBAAAA;AAAAA,IAAAC,kBAAAA;AAAAA,IAAAC,eAAAA;AAAAA,IAAAH,cAAAA;AAAAA,IAAAD,gBAAAA;AAAAA,EAAAA,IAAAN;AASjC,MAAAW;AAAA,EAAAV,EAAA,CAAA,MAAAgD,KAAAhD,EAAA,CAAA,MAAAK,KAAAL,EAAA,CAAA,MAAAM,KAAAN,EAAA,CAAA,MAAAE,KAAAF,EAAA,CAAA,MAAAS,KAAAT,EAAA,CAAA,MAAAQ,KAAAR,EAAA,CAAA,MAAAO,KAAAP,SAAAI,KAIXM,IAAAR,EAAI+C,YAAAA,GAAmBjC,IAAC,CAAAkC,GAAAC,MAAA;AACvB,QAAI,CAACD,EAAKE;AAAO;AAEjB,UAAAjD,IAAe,CAAC,CAAC6C,EAAOK,UAAT,CAAsBL,EAAOM,KAAMR,CAAAA,MAAMI,EAAKK,eAAmBC,IAACV,CAAgC,KAAzBI,EAAKO,aAAiBD,IAACV,CAAE,CAAC;AAAG,WAGnH,gBAAAL,EAAC5C,GAAA,EAEOqD,SACE/C,QAAAA,GACUC,kBAAAA,GACJE,cAAAA,GACED,gBAAAA,GACDI,eAAAA,GACEF,iBAAAA,GACCC,kBAAAA,EAAAA,GARb2C,CAQ6B;AAAA,EAClC,CAEL,GAACnD,OAAAgD,GAAAhD,OAAAK,GAAAL,OAAAM,GAAAN,OAAAE,GAAAF,OAAAS,GAAAT,OAAAQ,GAAAR,OAAAO,GAAAP,OAAAI,GAAAJ,OAAAU,KAAAA,IAAAV,EAAA,CAAA;AAAA,MAAAY;AAAA,SAAAZ,SAAAU,KApBJE,IAAA,gBAAA6B,EAAA,KAAA,EAAO,IAAA,aAEJ/B,UAAAA,GAmBH,GAAIV,OAAAU,GAAAV,QAAAY,KAAAA,IAAAZ,EAAA,EAAA,GArBJY;AAqBI,CAEL;AA7ED,SAAAK,EAAAqB,GAAA;AAAA,SAK0DA,EAACO,KAAKC;AAAG;"}

package/dist/visualization.es85.js

@@ -1,7 +1,65 @@
-function u(n, l) {
-  return n == null || l == null ? NaN : n < l ? -1 : n > l ? 1 : n >= l ? 0 : NaN;
+import m from "./visualization.es232.js";
+import c from "./visualization.es233.js";
+import s from "./visualization.es234.js";
+import u from "./visualization.es235.js";
+import l from "./visualization.es236.js";
+import _ from "./visualization.es237.js";
+import y from "./visualization.es238.js";
+import v from "./visualization.es239.js";
+import g from "./visualization.es240.js";
+import A from "./visualization.es241.js";
+import w from "./visualization.es242.js";
+import B from "./visualization.es243.js";
+import b from "./visualization.es244.js";
+function d(e, o) {
+  e instanceof Map ? (e = [void 0, e], o === void 0 && (o = j)) : o === void 0 && (o = C);
+  for (var f = new i(e), r, h = [f], a, t, n, p; r = h.pop(); )
+    if ((t = o(r.data)) && (p = (t = Array.from(t)).length))
+      for (r.children = t, n = p - 1; n >= 0; --n)
+        h.push(a = t[n] = new i(t[n])), a.parent = r, a.depth = r.depth + 1;
+  return f.eachBefore(D);
 }
+function k() {
+  return d(this).eachBefore(x);
+}
+function C(e) {
+  return e.children;
+}
+function j(e) {
+  return Array.isArray(e) ? e[1] : null;
+}
+function x(e) {
+  e.data.value !== void 0 && (e.value = e.data.value), e.data = e.data.data;
+}
+function D(e) {
+  var o = 0;
+  do
+    e.height = o;
+  while ((e = e.parent) && e.height < ++o);
+}
+function i(e) {
+  this.data = e, this.depth = this.height = 0, this.parent = null;
+}
+i.prototype = d.prototype = {
+  constructor: i,
+  count: m,
+  each: c,
+  eachAfter: u,
+  eachBefore: s,
+  find: l,
+  sum: _,
+  sort: y,
+  path: v,
+  ancestors: g,
+  descendants: A,
+  leaves: w,
+  links: B,
+  copy: k,
+  [Symbol.iterator]: b
+};
 export {
-  u as default
+  i as Node,
+  D as computeHeight,
+  d as default
 };
 //# sourceMappingURL=visualization.es85.js.map

package/dist/visualization.es85.js.map

@@ -1 +1 @@
-{"version":3,"file":"visualization.es85.js","sources":["../../../node_modules/.pnpm/d3-array@3.2.1/node_modules/d3-array/src/ascending.js"],"sourcesContent":["export default function ascending(a, b) {\n  return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n"],"names":["ascending","a","b"],"mappings":"AAAe,SAASA,EAAUC,GAAGC,GAAG;AACtC,SAAOD,KAAK,QAAQC,KAAK,OAAO,MAAMD,IAAIC,IAAI,KAAKD,IAAIC,IAAI,IAAID,KAAKC,IAAI,IAAI;AAC9E;","x_google_ignoreList":[0]}
+{"version":3,"file":"visualization.es85.js","sources":["../../../node_modules/.pnpm/d3-hierarchy@3.1.2/node_modules/d3-hierarchy/src/hierarchy/index.js"],"sourcesContent":["import node_count from \"./count.js\";\nimport node_each from \"./each.js\";\nimport node_eachBefore from \"./eachBefore.js\";\nimport node_eachAfter from \"./eachAfter.js\";\nimport node_find from \"./find.js\";\nimport node_sum from \"./sum.js\";\nimport node_sort from \"./sort.js\";\nimport node_path from \"./path.js\";\nimport node_ancestors from \"./ancestors.js\";\nimport node_descendants from \"./descendants.js\";\nimport node_leaves from \"./leaves.js\";\nimport node_links from \"./links.js\";\nimport node_iterator from \"./iterator.js\";\n\nexport default function hierarchy(data, children) {\n  if (data instanceof Map) {\n    data = [undefined, data];\n    if (children === undefined) children = mapChildren;\n  } else if (children === undefined) {\n    children = objectChildren;\n  }\n\n  var root = new Node(data),\n      node,\n      nodes = [root],\n      child,\n      childs,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if ((childs = children(node.data)) && (n = (childs = Array.from(childs)).length)) {\n      node.children = childs;\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = childs[i] = new Node(childs[i]));\n        child.parent = node;\n        child.depth = node.depth + 1;\n      }\n    }\n  }\n\n  return root.eachBefore(computeHeight);\n}\n\nfunction node_copy() {\n  return hierarchy(this).eachBefore(copyData);\n}\n\nfunction objectChildren(d) {\n  return d.children;\n}\n\nfunction mapChildren(d) {\n  return Array.isArray(d) ? d[1] : null;\n}\n\nfunction copyData(node) {\n  if (node.data.value !== undefined) node.value = node.data.value;\n  node.data = node.data.data;\n}\n\nexport function computeHeight(node) {\n  var height = 0;\n  do node.height = height;\n  while ((node = node.parent) && (node.height < ++height));\n}\n\nexport function Node(data) {\n  this.data = data;\n  this.depth =\n  this.height = 0;\n  this.parent = null;\n}\n\nNode.prototype = hierarchy.prototype = {\n  constructor: Node,\n  count: node_count,\n  each: node_each,\n  eachAfter: node_eachAfter,\n  eachBefore: node_eachBefore,\n  find: node_find,\n  sum: node_sum,\n  sort: node_sort,\n  path: node_path,\n  ancestors: node_ancestors,\n  descendants: node_descendants,\n  leaves: node_leaves,\n  links: node_links,\n  copy: node_copy,\n  [Symbol.iterator]: node_iterator\n};\n"],"names":["hierarchy","data","children","mapChildren","objectChildren","root","Node","node","nodes","child","childs","i","n","computeHeight","node_copy","copyData","d","height","node_count","node_each","node_eachAfter","node_eachBefore","node_find","node_sum","node_sort","node_path","node_ancestors","node_descendants","node_leaves","node_links","node_iterator"],"mappings":";;;;;;;;;;;;;AAce,SAASA,EAAUC,GAAMC,GAAU;AAChD,EAAID,aAAgB,OAClBA,IAAO,CAAC,QAAWA,CAAI,GACnBC,MAAa,WAAWA,IAAWC,MAC9BD,MAAa,WACtBA,IAAWE;AAWb,WARIC,IAAO,IAAIC,EAAKL,CAAI,GACpBM,GACAC,IAAQ,CAACH,CAAI,GACbI,GACAC,GACAC,GACAC,GAEGL,IAAOC,EAAM;AAClB,SAAKE,IAASR,EAASK,EAAK,IAAI,OAAOK,KAAKF,IAAS,MAAM,KAAKA,CAAM,GAAG;AAEvE,WADAH,EAAK,WAAWG,GACXC,IAAIC,IAAI,GAAGD,KAAK,GAAG,EAAEA;AACxB,QAAAH,EAAM,KAAKC,IAAQC,EAAOC,CAAC,IAAI,IAAIL,EAAKI,EAAOC,CAAC,CAAC,CAAC,GAClDF,EAAM,SAASF,GACfE,EAAM,QAAQF,EAAK,QAAQ;AAKjC,SAAOF,EAAK,WAAWQ,CAAa;AACtC;AAEA,SAASC,IAAY;AACnB,SAAOd,EAAU,IAAI,EAAE,WAAWe,CAAQ;AAC5C;AAEA,SAASX,EAAeY,GAAG;AACzB,SAAOA,EAAE;AACX;AAEA,SAASb,EAAYa,GAAG;AACtB,SAAO,MAAM,QAAQA,CAAC,IAAIA,EAAE,CAAC,IAAI;AACnC;AAEA,SAASD,EAASR,GAAM;AACtB,EAAIA,EAAK,KAAK,UAAU,WAAWA,EAAK,QAAQA,EAAK,KAAK,QAC1DA,EAAK,OAAOA,EAAK,KAAK;AACxB;AAEO,SAASM,EAAcN,GAAM;AAClC,MAAIU,IAAS;AACb;AAAG,IAAAV,EAAK,SAASU;AAAA,UACTV,IAAOA,EAAK,WAAYA,EAAK,SAAS,EAAEU;AAClD;AAEO,SAASX,EAAKL,GAAM;AACzB,OAAK,OAAOA,GACZ,KAAK,QACL,KAAK,SAAS,GACd,KAAK,SAAS;AAChB;AAEAK,EAAK,YAAYN,EAAU,YAAY;AAAA,EACrC,aAAaM;AAAA,EACb,OAAOY;AAAA,EACP,MAAMC;AAAA,EACN,WAAWC;AAAA,EACX,YAAYC;AAAA,EACZ,MAAMC;AAAA,EACN,KAAKC;AAAA,EACL,MAAMC;AAAA,EACN,MAAMC;AAAA,EACN,WAAWC;AAAA,EACX,aAAaC;AAAA,EACb,QAAQC;AAAA,EACR,OAAOC;AAAA,EACP,MAAMf;AAAA,EACN,CAAC,OAAO,QAAQ,GAAGgB;AACrB;","x_google_ignoreList":[0]}

package/dist/visualization.es86.js

@@ -1,50 +1,7 @@
-function g(e, n) {
-  return e.parent === n.parent ? 1 : 2;
-}
-function m(e) {
-  return e.reduce(p, 0) / e.length;
-}
-function p(e, n) {
-  return e + n.x;
-}
-function v(e) {
-  return 1 + e.reduce(z, 0);
-}
-function z(e, n) {
-  return Math.max(e, n.y);
-}
-function R(e) {
-  for (var n; n = e.children; ) e = n[0];
-  return e;
-}
-function S(e) {
-  for (var n; n = e.children; ) e = n[n.length - 1];
-  return e;
-}
-function w() {
-  var e = g, n = 1, a = 1, i = !1;
-  function u(t) {
-    var c, s = 0;
-    t.eachAfter(function(r) {
-      var h = r.children;
-      h ? (r.x = m(h), r.y = v(h)) : (r.x = c ? s += e(r, c) : 0, r.y = 0, c = r);
-    });
-    var f = R(t), l = S(t), x = f.x - e(f, l) / 2, y = l.x + e(l, f) / 2;
-    return t.eachAfter(i ? function(r) {
-      r.x = (r.x - t.x) * n, r.y = (t.y - r.y) * a;
-    } : function(r) {
-      r.x = (r.x - x) / (y - x) * n, r.y = (1 - (t.y ? r.y / t.y : 1)) * a;
-    });
-  }
-  return u.separation = function(t) {
-    return arguments.length ? (e = t, u) : e;
-  }, u.size = function(t) {
-    return arguments.length ? (i = !1, n = +t[0], a = +t[1], u) : i ? null : [n, a];
-  }, u.nodeSize = function(t) {
-    return arguments.length ? (i = !0, n = +t[0], a = +t[1], u) : i ? [n, a] : null;
-  }, u;
+function u(n, l) {
+  return n == null || l == null ? NaN : n < l ? -1 : n > l ? 1 : n >= l ? 0 : NaN;
 }
 export {
-  w as default
+  u as default
 };
 //# sourceMappingURL=visualization.es86.js.map

package/dist/visualization.es86.js.map

@@ -1 +1 @@
-{"version":3,"file":"visualization.es86.js","sources":["../../../node_modules/.pnpm/d3-hierarchy@3.1.2/node_modules/d3-hierarchy/src/cluster.js"],"sourcesContent":["function defaultSeparation(a, b) {\n  return a.parent === b.parent ? 1 : 2;\n}\n\nfunction meanX(children) {\n  return children.reduce(meanXReduce, 0) / children.length;\n}\n\nfunction meanXReduce(x, c) {\n  return x + c.x;\n}\n\nfunction maxY(children) {\n  return 1 + children.reduce(maxYReduce, 0);\n}\n\nfunction maxYReduce(y, c) {\n  return Math.max(y, c.y);\n}\n\nfunction leafLeft(node) {\n  var children;\n  while (children = node.children) node = children[0];\n  return node;\n}\n\nfunction leafRight(node) {\n  var children;\n  while (children = node.children) node = children[children.length - 1];\n  return node;\n}\n\nexport default function() {\n  var separation = defaultSeparation,\n      dx = 1,\n      dy = 1,\n      nodeSize = false;\n\n  function cluster(root) {\n    var previousNode,\n        x = 0;\n\n    // First walk, computing the initial x & y values.\n    root.eachAfter(function(node) {\n      var children = node.children;\n      if (children) {\n        node.x = meanX(children);\n        node.y = maxY(children);\n      } else {\n        node.x = previousNode ? x += separation(node, previousNode) : 0;\n        node.y = 0;\n        previousNode = node;\n      }\n    });\n\n    var left = leafLeft(root),\n        right = leafRight(root),\n        x0 = left.x - separation(left, right) / 2,\n        x1 = right.x + separation(right, left) / 2;\n\n    // Second walk, normalizing x & y to the desired size.\n    return root.eachAfter(nodeSize ? function(node) {\n      node.x = (node.x - root.x) * dx;\n      node.y = (root.y - node.y) * dy;\n    } : function(node) {\n      node.x = (node.x - x0) / (x1 - x0) * dx;\n      node.y = (1 - (root.y ? node.y / root.y : 1)) * dy;\n    });\n  }\n\n  cluster.separation = function(x) {\n    return arguments.length ? (separation = x, cluster) : separation;\n  };\n\n  cluster.size = function(x) {\n    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? null : [dx, dy]);\n  };\n\n  cluster.nodeSize = function(x) {\n    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? [dx, dy] : null);\n  };\n\n  return cluster;\n}\n"],"names":["defaultSeparation","a","b","meanX","children","meanXReduce","x","c","maxY","maxYReduce","y","leafLeft","node","leafRight","d3cluster","separation","dx","dy","nodeSize","cluster","root","previousNode","left","right","x0","x1"],"mappings":"AAAA,SAASA,EAAkBC,GAAGC,GAAG;AAC/B,SAAOD,EAAE,WAAWC,EAAE,SAAS,IAAI;AACrC;AAEA,SAASC,EAAMC,GAAU;AACvB,SAAOA,EAAS,OAAOC,GAAa,CAAC,IAAID,EAAS;AACpD;AAEA,SAASC,EAAYC,GAAGC,GAAG;AACzB,SAAOD,IAAIC,EAAE;AACf;AAEA,SAASC,EAAKJ,GAAU;AACtB,SAAO,IAAIA,EAAS,OAAOK,GAAY,CAAC;AAC1C;AAEA,SAASA,EAAWC,GAAGH,GAAG;AACxB,SAAO,KAAK,IAAIG,GAAGH,EAAE,CAAC;AACxB;AAEA,SAASI,EAASC,GAAM;AAEtB,WADIR,GACGA,IAAWQ,EAAK,WAAU,CAAAA,IAAOR,EAAS,CAAC;AAClD,SAAOQ;AACT;AAEA,SAASC,EAAUD,GAAM;AAEvB,WADIR,GACGA,IAAWQ,EAAK,WAAU,CAAAA,IAAOR,EAASA,EAAS,SAAS,CAAC;AACpE,SAAOQ;AACT;AAEe,SAAAE,IAAW;AACxB,MAAIC,IAAaf,GACbgB,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASC,EAAQC,GAAM;AACrB,QAAIC,GACAf,IAAI;AAGR,IAAAc,EAAK,UAAU,SAASR,GAAM;AAC5B,UAAIR,IAAWQ,EAAK;AACpB,MAAIR,KACFQ,EAAK,IAAIT,EAAMC,CAAQ,GACvBQ,EAAK,IAAIJ,EAAKJ,CAAQ,MAEtBQ,EAAK,IAAIS,IAAef,KAAKS,EAAWH,GAAMS,CAAY,IAAI,GAC9DT,EAAK,IAAI,GACTS,IAAeT;AAAA,IAEnB,CAAC;AAED,QAAIU,IAAOX,EAASS,CAAI,GACpBG,IAAQV,EAAUO,CAAI,GACtBI,IAAKF,EAAK,IAAIP,EAAWO,GAAMC,CAAK,IAAI,GACxCE,IAAKF,EAAM,IAAIR,EAAWQ,GAAOD,CAAI,IAAI;AAG7C,WAAOF,EAAK,UAAUF,IAAW,SAASN,GAAM;AAC9C,MAAAA,EAAK,KAAKA,EAAK,IAAIQ,EAAK,KAAKJ,GAC7BJ,EAAK,KAAKQ,EAAK,IAAIR,EAAK,KAAKK;AAAA,IAC/B,IAAI,SAASL,GAAM;AACjB,MAAAA,EAAK,KAAKA,EAAK,IAAIY,MAAOC,IAAKD,KAAMR,GACrCJ,EAAK,KAAK,KAAKQ,EAAK,IAAIR,EAAK,IAAIQ,EAAK,IAAI,MAAMH;AAAA,IAClD,CAAC;AAAA,EACH;AAEA,SAAAE,EAAQ,aAAa,SAASb,GAAG;AAC/B,WAAO,UAAU,UAAUS,IAAaT,GAAGa,KAAWJ;AAAA,EACxD,GAEAI,EAAQ,OAAO,SAASb,GAAG;AACzB,WAAO,UAAU,UAAUY,IAAW,IAAOF,IAAK,CAACV,EAAE,CAAC,GAAGW,IAAK,CAACX,EAAE,CAAC,GAAGa,KAAYD,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EAC5G,GAEAE,EAAQ,WAAW,SAASb,GAAG;AAC7B,WAAO,UAAU,UAAUY,IAAW,IAAMF,IAAK,CAACV,EAAE,CAAC,GAAGW,IAAK,CAACX,EAAE,CAAC,GAAGa,KAAYD,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EACxG,GAEOE;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"visualization.es86.js","sources":["../../../node_modules/.pnpm/d3-array@3.2.1/node_modules/d3-array/src/ascending.js"],"sourcesContent":["export default function ascending(a, b) {\n  return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n"],"names":["ascending","a","b"],"mappings":"AAAe,SAASA,EAAUC,GAAGC,GAAG;AACtC,SAAOD,KAAK,QAAQC,KAAK,OAAO,MAAMD,IAAIC,IAAI,KAAKD,IAAIC,IAAI,IAAID,KAAKC,IAAI,IAAI;AAC9E;","x_google_ignoreList":[0]}

package/dist/visualization.es87.js

@@ -1,7 +1,50 @@
-function n(a, t) {
-  return [(t = +t) * Math.cos(a -= Math.PI / 2), t * Math.sin(a)];
+function g(e, n) {
+  return e.parent === n.parent ? 1 : 2;
+}
+function m(e) {
+  return e.reduce(p, 0) / e.length;
+}
+function p(e, n) {
+  return e + n.x;
+}
+function v(e) {
+  return 1 + e.reduce(z, 0);
+}
+function z(e, n) {
+  return Math.max(e, n.y);
+}
+function R(e) {
+  for (var n; n = e.children; ) e = n[0];
+  return e;
+}
+function S(e) {
+  for (var n; n = e.children; ) e = n[n.length - 1];
+  return e;
+}
+function w() {
+  var e = g, n = 1, a = 1, i = !1;
+  function u(t) {
+    var c, s = 0;
+    t.eachAfter(function(r) {
+      var h = r.children;
+      h ? (r.x = m(h), r.y = v(h)) : (r.x = c ? s += e(r, c) : 0, r.y = 0, c = r);
+    });
+    var f = R(t), l = S(t), x = f.x - e(f, l) / 2, y = l.x + e(l, f) / 2;
+    return t.eachAfter(i ? function(r) {
+      r.x = (r.x - t.x) * n, r.y = (t.y - r.y) * a;
+    } : function(r) {
+      r.x = (r.x - x) / (y - x) * n, r.y = (1 - (t.y ? r.y / t.y : 1)) * a;
+    });
+  }
+  return u.separation = function(t) {
+    return arguments.length ? (e = t, u) : e;
+  }, u.size = function(t) {
+    return arguments.length ? (i = !1, n = +t[0], a = +t[1], u) : i ? null : [n, a];
+  }, u.nodeSize = function(t) {
+    return arguments.length ? (i = !0, n = +t[0], a = +t[1], u) : i ? [n, a] : null;
+  }, u;
 }
 export {
-  n as default
+  w as default
 };
 //# sourceMappingURL=visualization.es87.js.map

package/dist/visualization.es87.js.map

@@ -1 +1 @@
-{"version":3,"file":"visualization.es87.js","sources":["../../../node_modules/.pnpm/d3-shape@3.2.0/node_modules/d3-shape/src/pointRadial.js"],"sourcesContent":["export default function(x, y) {\n  return [(y = +y) * Math.cos(x -= Math.PI / 2), y * Math.sin(x)];\n}\n"],"names":["pointRadial","x","y"],"mappings":"AAAe,SAAAA,EAASC,GAAGC,GAAG;AAC5B,SAAO,EAAEA,IAAI,CAACA,KAAK,KAAK,IAAID,KAAK,KAAK,KAAK,CAAC,GAAGC,IAAI,KAAK,IAAID,CAAC,CAAC;AAChE;","x_google_ignoreList":[0]}
+{"version":3,"file":"visualization.es87.js","sources":["../../../node_modules/.pnpm/d3-hierarchy@3.1.2/node_modules/d3-hierarchy/src/cluster.js"],"sourcesContent":["function defaultSeparation(a, b) {\n  return a.parent === b.parent ? 1 : 2;\n}\n\nfunction meanX(children) {\n  return children.reduce(meanXReduce, 0) / children.length;\n}\n\nfunction meanXReduce(x, c) {\n  return x + c.x;\n}\n\nfunction maxY(children) {\n  return 1 + children.reduce(maxYReduce, 0);\n}\n\nfunction maxYReduce(y, c) {\n  return Math.max(y, c.y);\n}\n\nfunction leafLeft(node) {\n  var children;\n  while (children = node.children) node = children[0];\n  return node;\n}\n\nfunction leafRight(node) {\n  var children;\n  while (children = node.children) node = children[children.length - 1];\n  return node;\n}\n\nexport default function() {\n  var separation = defaultSeparation,\n      dx = 1,\n      dy = 1,\n      nodeSize = false;\n\n  function cluster(root) {\n    var previousNode,\n        x = 0;\n\n    // First walk, computing the initial x & y values.\n    root.eachAfter(function(node) {\n      var children = node.children;\n      if (children) {\n        node.x = meanX(children);\n        node.y = maxY(children);\n      } else {\n        node.x = previousNode ? x += separation(node, previousNode) : 0;\n        node.y = 0;\n        previousNode = node;\n      }\n    });\n\n    var left = leafLeft(root),\n        right = leafRight(root),\n        x0 = left.x - separation(left, right) / 2,\n        x1 = right.x + separation(right, left) / 2;\n\n    // Second walk, normalizing x & y to the desired size.\n    return root.eachAfter(nodeSize ? function(node) {\n      node.x = (node.x - root.x) * dx;\n      node.y = (root.y - node.y) * dy;\n    } : function(node) {\n      node.x = (node.x - x0) / (x1 - x0) * dx;\n      node.y = (1 - (root.y ? node.y / root.y : 1)) * dy;\n    });\n  }\n\n  cluster.separation = function(x) {\n    return arguments.length ? (separation = x, cluster) : separation;\n  };\n\n  cluster.size = function(x) {\n    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? null : [dx, dy]);\n  };\n\n  cluster.nodeSize = function(x) {\n    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? [dx, dy] : null);\n  };\n\n  return cluster;\n}\n"],"names":["defaultSeparation","a","b","meanX","children","meanXReduce","x","c","maxY","maxYReduce","y","leafLeft","node","leafRight","d3cluster","separation","dx","dy","nodeSize","cluster","root","previousNode","left","right","x0","x1"],"mappings":"AAAA,SAASA,EAAkBC,GAAGC,GAAG;AAC/B,SAAOD,EAAE,WAAWC,EAAE,SAAS,IAAI;AACrC;AAEA,SAASC,EAAMC,GAAU;AACvB,SAAOA,EAAS,OAAOC,GAAa,CAAC,IAAID,EAAS;AACpD;AAEA,SAASC,EAAYC,GAAGC,GAAG;AACzB,SAAOD,IAAIC,EAAE;AACf;AAEA,SAASC,EAAKJ,GAAU;AACtB,SAAO,IAAIA,EAAS,OAAOK,GAAY,CAAC;AAC1C;AAEA,SAASA,EAAWC,GAAGH,GAAG;AACxB,SAAO,KAAK,IAAIG,GAAGH,EAAE,CAAC;AACxB;AAEA,SAASI,EAASC,GAAM;AAEtB,WADIR,GACGA,IAAWQ,EAAK,WAAU,CAAAA,IAAOR,EAAS,CAAC;AAClD,SAAOQ;AACT;AAEA,SAASC,EAAUD,GAAM;AAEvB,WADIR,GACGA,IAAWQ,EAAK,WAAU,CAAAA,IAAOR,EAASA,EAAS,SAAS,CAAC;AACpE,SAAOQ;AACT;AAEe,SAAAE,IAAW;AACxB,MAAIC,IAAaf,GACbgB,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASC,EAAQC,GAAM;AACrB,QAAIC,GACAf,IAAI;AAGR,IAAAc,EAAK,UAAU,SAASR,GAAM;AAC5B,UAAIR,IAAWQ,EAAK;AACpB,MAAIR,KACFQ,EAAK,IAAIT,EAAMC,CAAQ,GACvBQ,EAAK,IAAIJ,EAAKJ,CAAQ,MAEtBQ,EAAK,IAAIS,IAAef,KAAKS,EAAWH,GAAMS,CAAY,IAAI,GAC9DT,EAAK,IAAI,GACTS,IAAeT;AAAA,IAEnB,CAAC;AAED,QAAIU,IAAOX,EAASS,CAAI,GACpBG,IAAQV,EAAUO,CAAI,GACtBI,IAAKF,EAAK,IAAIP,EAAWO,GAAMC,CAAK,IAAI,GACxCE,IAAKF,EAAM,IAAIR,EAAWQ,GAAOD,CAAI,IAAI;AAG7C,WAAOF,EAAK,UAAUF,IAAW,SAASN,GAAM;AAC9C,MAAAA,EAAK,KAAKA,EAAK,IAAIQ,EAAK,KAAKJ,GAC7BJ,EAAK,KAAKQ,EAAK,IAAIR,EAAK,KAAKK;AAAA,IAC/B,IAAI,SAASL,GAAM;AACjB,MAAAA,EAAK,KAAKA,EAAK,IAAIY,MAAOC,IAAKD,KAAMR,GACrCJ,EAAK,KAAK,KAAKQ,EAAK,IAAIR,EAAK,IAAIQ,EAAK,IAAI,MAAMH;AAAA,IAClD,CAAC;AAAA,EACH;AAEA,SAAAE,EAAQ,aAAa,SAASb,GAAG;AAC/B,WAAO,UAAU,UAAUS,IAAaT,GAAGa,KAAWJ;AAAA,EACxD,GAEAI,EAAQ,OAAO,SAASb,GAAG;AACzB,WAAO,UAAU,UAAUY,IAAW,IAAOF,IAAK,CAACV,EAAE,CAAC,GAAGW,IAAK,CAACX,EAAE,CAAC,GAAGa,KAAYD,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EAC5G,GAEAE,EAAQ,WAAW,SAASb,GAAG;AAC7B,WAAO,UAAU,UAAUY,IAAW,IAAMF,IAAK,CAACV,EAAE,CAAC,GAAGW,IAAK,CAACX,EAAE,CAAC,GAAGa,KAAYD,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EACxG,GAEOE;AACT;","x_google_ignoreList":[0]}