@weng-lab/visualization 2.4.0-beta.3 → 2.4.0-beta.4

package/dist/visualization.es75.js

@@ -1,46 +1,34 @@
-import { createElement as B } from "react";
-import I from "./visualization.es129.js";
-import L from "./visualization.es235.js";
-import i from "./visualization.es236.js";
-import { jsx as t, Fragment as j } from "react/jsx-runtime";
-import v from "./visualization.es237.js";
-import h from "./visualization.es36.js";
-function H(N) {
-  let {
-    top: x,
-    left: O,
-    className: R,
-    root: T,
-    tile: r,
-    size: d,
-    round: n,
-    padding: o,
-    paddingInner: p,
-    paddingOuter: a,
-    paddingTop: m,
-    paddingRight: f,
-    paddingBottom: g,
-    paddingLeft: c,
-    children: s,
-    nodeComponent: l = L
-  } = N;
-  const e = v();
-  r && e.tile(r), d && e.size(d), n && e.round(n), o && i(e.padding, o), p && i(e.paddingInner, p), a && i(e.paddingOuter, a), m && i(e.paddingTop, m), f && i(e.paddingRight, f), g && i(e.paddingBottom, g), c && i(e.paddingLeft, c);
-  const u = e(T);
-  return s ? /* @__PURE__ */ t(j, {
-    children: s(u)
-  }) : /* @__PURE__ */ t(h, {
-    top: x,
-    left: O,
-    className: I("visx-treemap", R),
-    children: l && u.descendants().map((b, z) => /* @__PURE__ */ t(h, {
-      children: /* @__PURE__ */ B(l, {
-        node: b
-      })
-    }, `treemap-node-${z}`))
-  });
+import S from "./visualization.es73.js";
+import g from "./visualization.es71.js";
+var k = (1 + Math.sqrt(5)) / 2;
+function D(w, d, i, a, l, f) {
+  for (var p = [], t = d.children, v, u, q = 0, r = 0, M = t.length, m, c, o = d.value, e, h, s, V, R, b, n; q < M; ) {
+    m = l - i, c = f - a;
+    do
+      e = t[r++].value;
+    while (!e && r < M);
+    for (h = s = e, b = Math.max(c / m, m / c) / (o * w), n = e * e * b, R = Math.max(s / n, n / h); r < M; ++r) {
+      if (e += u = t[r].value, u < h && (h = u), u > s && (s = u), n = e * e * b, V = Math.max(s / n, n / h), V > R) {
+        e -= u;
+        break;
+      }
+      R = V;
+    }
+    p.push(v = { value: e, dice: m < c, children: t.slice(q, r) }), v.dice ? S(v, i, a, l, o ? a += c * e / o : f) : g(v, i, a, o ? i += m * e / o : l, f), o -= e, q = r;
+  }
+  return p;
 }
+const A = (function w(d) {
+  function i(a, l, f, p, t) {
+    D(d, a, l, f, p, t);
+  }
+  return i.ratio = function(a) {
+    return w((a = +a) > 1 ? a : 1);
+  }, i;
+})(k);
 export {
-  H as default
+  A as default,
+  k as phi,
+  D as squarifyRatio
 };
 //# sourceMappingURL=visualization.es75.js.map

package/dist/visualization.es75.js.map

@@ -1 +1 @@
-{"version":3,"file":"visualization.es75.js","sources":["../../../node_modules/.pnpm/@visx+hierarchy@4.0.0_@types+react@19.2.14_react@19.2.4/node_modules/@visx/hierarchy/esm/hierarchies/Treemap.js"],"sourcesContent":["import { createElement } from 'react';\nimport cx from 'classnames';\nimport { Group } from '@visx/group';\nimport { treemap as d3treemap } from 'd3-hierarchy';\nimport HierarchyDefaultRectNode from \"../HierarchyDefaultRectNode.js\";\nimport setNumberOrNumberAccessor from \"../utils/setNumOrNumAccessor.js\";\nimport { Fragment as _Fragment, jsx as _jsx } from \"react/jsx-runtime\";\nexport default function Treemap(_ref) {\n  let {\n    top,\n    left,\n    className,\n    root,\n    tile,\n    size,\n    round,\n    padding,\n    paddingInner,\n    paddingOuter,\n    paddingTop,\n    paddingRight,\n    paddingBottom,\n    paddingLeft,\n    children,\n    nodeComponent = HierarchyDefaultRectNode\n  } = _ref;\n  const treemap = d3treemap();\n  if (tile) treemap.tile(tile);\n  if (size) treemap.size(size);\n  if (round) treemap.round(round);\n  if (padding) setNumberOrNumberAccessor(treemap.padding, padding);\n  if (paddingInner) setNumberOrNumberAccessor(treemap.paddingInner, paddingInner);\n  if (paddingOuter) setNumberOrNumberAccessor(treemap.paddingOuter, paddingOuter);\n  if (paddingTop) setNumberOrNumberAccessor(treemap.paddingTop, paddingTop);\n  if (paddingRight) setNumberOrNumberAccessor(treemap.paddingRight, paddingRight);\n  if (paddingBottom) setNumberOrNumberAccessor(treemap.paddingBottom, paddingBottom);\n  if (paddingLeft) setNumberOrNumberAccessor(treemap.paddingLeft, paddingLeft);\n  const data = treemap(root);\n  if (children) return /*#__PURE__*/_jsx(_Fragment, {\n    children: children(data)\n  });\n  return /*#__PURE__*/_jsx(Group, {\n    top: top,\n    left: left,\n    className: cx('visx-treemap', className),\n    children: nodeComponent && data.descendants().map((node, i) => /*#__PURE__*/_jsx(Group, {\n      children: /*#__PURE__*/createElement(nodeComponent, {\n        node\n      })\n    }, `treemap-node-${i}`))\n  });\n}"],"names":["Treemap","_ref","top","left","className","root","tile","size","round","padding","paddingInner","paddingOuter","paddingTop","paddingRight","paddingBottom","paddingLeft","children","nodeComponent","HierarchyDefaultRectNode","treemap","d3treemap","setNumberOrNumberAccessor","data","_jsx","_Fragment","Group","cx","node","i","createElement"],"mappings":";;;;;;;AAOe,SAASA,EAAQC,GAAM;AACpC,MAAI;AAAA,IACF,KAAAC;AAAA,IACA,MAAAC;AAAA,IACA,WAAAC;AAAA,IACA,MAAAC;AAAA,IACA,MAAAC;AAAA,IACA,MAAAC;AAAA,IACA,OAAAC;AAAA,IACA,SAAAC;AAAA,IACA,cAAAC;AAAA,IACA,cAAAC;AAAA,IACA,YAAAC;AAAA,IACA,cAAAC;AAAA,IACA,eAAAC;AAAA,IACA,aAAAC;AAAA,IACA,UAAAC;AAAA,IACA,eAAAC,IAAgBC;AAAA,EACpB,IAAMjB;AACJ,QAAMkB,IAAUC,EAAS;AACzB,EAAId,KAAMa,EAAQ,KAAKb,CAAI,GACvBC,KAAMY,EAAQ,KAAKZ,CAAI,GACvBC,KAAOW,EAAQ,MAAMX,CAAK,GAC1BC,KAASY,EAA0BF,EAAQ,SAASV,CAAO,GAC3DC,KAAcW,EAA0BF,EAAQ,cAAcT,CAAY,GAC1EC,KAAcU,EAA0BF,EAAQ,cAAcR,CAAY,GAC1EC,KAAYS,EAA0BF,EAAQ,YAAYP,CAAU,GACpEC,KAAcQ,EAA0BF,EAAQ,cAAcN,CAAY,GAC1EC,KAAeO,EAA0BF,EAAQ,eAAeL,CAAa,GAC7EC,KAAaM,EAA0BF,EAAQ,aAAaJ,CAAW;AAC3E,QAAMO,IAAOH,EAAQd,CAAI;AACzB,SAAIW,IAA8BO,gBAAAA,EAAKC,GAAW;AAAA,IAChD,UAAUR,EAASM,CAAI;AAAA,EAC3B,CAAG,IACmBC,gBAAAA,EAAKE,GAAO;AAAA,IAC9B,KAAKvB;AAAA,IACL,MAAMC;AAAA,IACN,WAAWuB,EAAG,gBAAgBtB,CAAS;AAAA,IACvC,UAAUa,KAAiBK,EAAK,YAAW,EAAG,IAAI,CAACK,GAAMC,MAAmBL,gBAAAA,EAAKE,GAAO;AAAA,MACtF,UAAuB,gBAAAI,EAAcZ,GAAe;AAAA,QAClD,MAAAU;AAAA,MACR,CAAO;AAAA,IACP,GAAO,gBAAgBC,CAAC,EAAE,CAAC;AAAA,EAC3B,CAAG;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"visualization.es75.js","sources":["../../../node_modules/.pnpm/d3-hierarchy@1.1.9/node_modules/d3-hierarchy/src/treemap/squarify.js"],"sourcesContent":["import treemapDice from \"./dice.js\";\nimport treemapSlice from \"./slice.js\";\n\nexport var phi = (1 + Math.sqrt(5)) / 2;\n\nexport function squarifyRatio(ratio, parent, x0, y0, x1, y1) {\n  var rows = [],\n      nodes = parent.children,\n      row,\n      nodeValue,\n      i0 = 0,\n      i1 = 0,\n      n = nodes.length,\n      dx, dy,\n      value = parent.value,\n      sumValue,\n      minValue,\n      maxValue,\n      newRatio,\n      minRatio,\n      alpha,\n      beta;\n\n  while (i0 < n) {\n    dx = x1 - x0, dy = y1 - y0;\n\n    // Find the next non-empty node.\n    do sumValue = nodes[i1++].value; while (!sumValue && i1 < n);\n    minValue = maxValue = sumValue;\n    alpha = Math.max(dy / dx, dx / dy) / (value * ratio);\n    beta = sumValue * sumValue * alpha;\n    minRatio = Math.max(maxValue / beta, beta / minValue);\n\n    // Keep adding nodes while the aspect ratio maintains or improves.\n    for (; i1 < n; ++i1) {\n      sumValue += nodeValue = nodes[i1].value;\n      if (nodeValue < minValue) minValue = nodeValue;\n      if (nodeValue > maxValue) maxValue = nodeValue;\n      beta = sumValue * sumValue * alpha;\n      newRatio = Math.max(maxValue / beta, beta / minValue);\n      if (newRatio > minRatio) { sumValue -= nodeValue; break; }\n      minRatio = newRatio;\n    }\n\n    // Position and record the row orientation.\n    rows.push(row = {value: sumValue, dice: dx < dy, children: nodes.slice(i0, i1)});\n    if (row.dice) treemapDice(row, x0, y0, x1, value ? y0 += dy * sumValue / value : y1);\n    else treemapSlice(row, x0, y0, value ? x0 += dx * sumValue / value : x1, y1);\n    value -= sumValue, i0 = i1;\n  }\n\n  return rows;\n}\n\nexport default (function custom(ratio) {\n\n  function squarify(parent, x0, y0, x1, y1) {\n    squarifyRatio(ratio, parent, x0, y0, x1, y1);\n  }\n\n  squarify.ratio = function(x) {\n    return custom((x = +x) > 1 ? x : 1);\n  };\n\n  return squarify;\n})(phi);\n"],"names":["phi","squarifyRatio","ratio","parent","x0","y0","x1","y1","rows","nodes","row","nodeValue","i0","i1","n","dx","dy","value","sumValue","minValue","maxValue","newRatio","minRatio","alpha","beta","treemapDice","treemapSlice","treemapSquarify","custom","squarify","x"],"mappings":";;AAGU,IAACA,KAAO,IAAI,KAAK,KAAK,CAAC,KAAK;AAE/B,SAASC,EAAcC,GAAOC,GAAQC,GAAIC,GAAIC,GAAIC,GAAI;AAkB3D,WAjBIC,IAAO,CAAA,GACPC,IAAQN,EAAO,UACfO,GACAC,GACAC,IAAK,GACLC,IAAK,GACLC,IAAIL,EAAM,QACVM,GAAIC,GACJC,IAAQd,EAAO,OACfe,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAEGZ,IAAKE,KAAG;AACb,IAAAC,IAAKT,IAAKF,GAAIY,IAAKT,IAAKF;AAGxB;AAAG,MAAAa,IAAWT,EAAMI,GAAI,EAAE;AAAA,WAAc,CAACK,KAAYL,IAAKC;AAO1D,SANAK,IAAWC,IAAWF,GACtBK,IAAQ,KAAK,IAAIP,IAAKD,GAAIA,IAAKC,CAAE,KAAKC,IAAQf,IAC9CsB,IAAON,IAAWA,IAAWK,GAC7BD,IAAW,KAAK,IAAIF,IAAWI,GAAMA,IAAOL,CAAQ,GAG7CN,IAAKC,GAAG,EAAED,GAAI;AAMnB,UALAK,KAAYP,IAAYF,EAAMI,CAAE,EAAE,OAC9BF,IAAYQ,MAAUA,IAAWR,IACjCA,IAAYS,MAAUA,IAAWT,IACrCa,IAAON,IAAWA,IAAWK,GAC7BF,IAAW,KAAK,IAAID,IAAWI,GAAMA,IAAOL,CAAQ,GAChDE,IAAWC,GAAU;AAAE,QAAAJ,KAAYP;AAAW;AAAA,MAAO;AACzD,MAAAW,IAAWD;AAAA,IACb;AAGA,IAAAb,EAAK,KAAKE,IAAM,EAAC,OAAOQ,GAAU,MAAMH,IAAKC,GAAI,UAAUP,EAAM,MAAMG,GAAIC,CAAE,EAAC,CAAC,GAC3EH,EAAI,OAAMe,EAAYf,GAAKN,GAAIC,GAAIC,GAAIW,IAAQZ,KAAMW,IAAKE,IAAWD,IAAQV,CAAE,IAC9EmB,EAAahB,GAAKN,GAAIC,GAAIY,IAAQb,KAAMW,IAAKG,IAAWD,IAAQX,GAAIC,CAAE,GAC3EU,KAASC,GAAUN,IAAKC;AAAA,EAC1B;AAEA,SAAOL;AACT;AAEA,MAAAmB,KAAgB,SAASC,EAAO1B,GAAO;AAErC,WAAS2B,EAAS1B,GAAQC,GAAIC,GAAIC,GAAIC,GAAI;AACxC,IAAAN,EAAcC,GAAOC,GAAQC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC7C;AAEA,SAAAsB,EAAS,QAAQ,SAASC,GAAG;AAC3B,WAAOF,GAAQE,IAAI,CAACA,KAAK,IAAIA,IAAI,CAAC;AAAA,EACpC,GAEOD;AACT,GAAG7B,CAAG;","x_google_ignoreList":[0]}