@cardenelabs/cdl 0.114.0 → 0.116.0

package/dist/react.cjs

@@ -4701,6 +4701,8 @@ var PAD_TOP = 40;
 var PAD_RIGHT = 24;
 var PAD_BOTTOM = 40;
 var PAD_LEFT = 24;
+var \u7BB1\u306E\u6700\u5927\u5E45 = 140;
+var \u7BB1\u306E\u6700\u5927\u9AD8\u3055 = 38;
 var \u6728\u306E\u679D\u306E\u592A\u3055 = (\u6BB5) => Math.max(1.1, 2.6 - \u6BB5 * 0.45);
 function \u6728\u306E\u4E2D\u8EAB(node, stateValues = {}) {
   const treeNodes = resolveTreeData(node.treeData ?? [], stateValues);
@@ -4904,14 +4906,36 @@ function computeTreeLayout(treeNodes, canvasW, canvasH) {
   );
   const depthGap = canvasH / Math.max(maxDepth + 1, 1);
   const slotW = canvasW / totalLeaves;
-  const nodeH = Math.min(38, depthGap * 0.7);
-  const nodeW = Math.min(140, slotW * 0.85);
+  const nodeH = Math.min(\u7BB1\u306E\u6700\u5927\u9AD8\u3055, depthGap * 0.7);
+  const nodeW = Math.min(\u7BB1\u306E\u6700\u5927\u5E45, slotW * 0.85);
   const \u7BB1\u306E\u5E45 = (n, depth) => {
     const \u6750\u6599 = \u6728\u306E\u884C({ ...n, depth });
     const \u540D\u524D = \u6750\u6599[0];
     const \u8981\u308B = measureTextWidth(\u540D\u524D.text, { fontSize: \u540D\u524D.fontSize}) + (nodeW - \u4F7F\u3048\u308B\u5E45(nodeW));
     return Math.min(Math.max(\u8981\u308B, nodeW), slotW * 0.92);
   };
+  const \u8449\u306E\u4E26\u3073 = [];
+  const \u6BB5\u306E\u8868 = /* @__PURE__ */ new Map();
+  const \u5E45\u306E\u8868 = /* @__PURE__ */ new Map();
+  {
+    const \u898B\u305F = /* @__PURE__ */ new Set();
+    const \u4E0B\u898B = (n, depth) => {
+      \u898B\u305F.add(n.id);
+      \u6BB5\u306E\u8868.set(n.id, depth);
+      \u5E45\u306E\u8868.set(n.id, \u7BB1\u306E\u5E45(n, depth));
+      const kids = (childrenOf.get(n.id) ?? []).filter((k) => !\u898B\u305F.has(k.id));
+      if (kids.length === 0) {
+        \u8449\u306E\u4E26\u3073.push(n.id);
+        return;
+      }
+      for (const k of kids) \u4E0B\u898B(k, depth + 1);
+    };
+    for (const r of roots) if (!\u898B\u305F.has(r.id)) \u4E0B\u898B(r, 0);
+  }
+  const \u8449\u306E\u6570 = Math.max(\u8449\u306E\u4E26\u3073.length, 1);
+  const \u6BB5\u306E\u9699\u9593 = depthGap - nodeH;
+  const \u8449\u306E\u9593\u9694 = Math.min(slotW, nodeW + \u6BB5\u306E\u9699\u9593);
+  const \u8449\u306Ex = (i) => canvasW / 2 - (\u8449\u306E\u6570 - 1) * \u8449\u306E\u9593\u9694 / 2 + i * \u8449\u306E\u9593\u9694;
   const posOf = /* @__PURE__ */ new Map();
   const nodes = [];
   const placed = /* @__PURE__ */ new Set();
@@ -4921,7 +4945,7 @@ function computeTreeLayout(treeNodes, canvasW, canvasH) {
     const kids = (childrenOf.get(n.id) ?? []).filter((k) => !placed.has(k.id));
     let x;
     if (kids.length === 0) {
-      x = leafCursor * slotW + slotW / 2;
+      x = \u8449\u306Ex(leafCursor);
       leafCursor += 1;
     } else {
       const xs = kids.map((k) => place(k, depth + 1));
@@ -4935,7 +4959,7 @@ function computeTreeLayout(treeNodes, canvasW, canvasH) {
       ...n.subtitle !== void 0 ? { subtitle: n.subtitle } : {},
       x,
       y,
-      w: \u7BB1\u306E\u5E45(n, depth),
+      w: \u5E45\u306E\u8868.get(n.id) ?? \u7BB1\u306E\u5E45(n, depth),
       h: nodeH,
       depth,
       ...n.unresolved ? { unresolved: true } : {}