footprint-explainable-ui 0.25.1 → 0.25.3

package/dist/index.cjs

@@ -3520,6 +3520,16 @@ function createDagreTraceLayout(options = {}) {
   return (graph) => dagreTraceLayout(graph, options);
 }
 
+// src/components/FlowchartView/_internal/devWarn.ts
+function isDevModeEnv() {
+  const proc = globalThis.process;
+  return proc?.env?.NODE_ENV !== "production";
+}
+function devWarn(messageFn, ...extras) {
+  if (!isDevModeEnv()) return;
+  console.warn(messageFn(), ...extras);
+}
+
 // src/components/FlowchartView/_internal/snapLinearSuccessors.ts
 function snapLinearSuccessors(graph, options = {}) {
   if (graph.nodes.length === 0) return graph;
@@ -3621,36 +3631,79 @@ function centerForkParents(graph, options = {}) {
     }
     return minX <= maxX ? Math.max(minX, Math.min(maxX, desiredX)) : x0;
   };
+  const evenFanKids = (forkCenter, kids) => {
+    if (kids.length < 2) return;
+    const sorted = [...kids].sort((a, b) => centerX(a) - centerX(b));
+    let gap = 0;
+    for (let i = 0; i < sorted.length - 1; i++) {
+      gap = Math.max(gap, width.get(sorted[i]) / 2 + nodeSep + width.get(sorted[i + 1]) / 2);
+    }
+    const mid = (sorted.length - 1) / 2;
+    for (let i = 0; i < sorted.length; i++) {
+      workingX.set(sorted[i], forkCenter + (i - mid) * gap - width.get(sorted[i]) / 2);
+    }
+  };
   const order = [...graph.nodes].sort(
     (a, b) => b.position.y - a.position.y || a.position.x - b.position.x || a.id.localeCompare(b.id)
   );
   for (const n of order) {
-    if ((outDegree.get(n.id) ?? 0) < 2) continue;
-    if ((inDegree.get(n.id) ?? 0) > 1) continue;
-    const kids = (childrenOf.get(n.id) ?? []).filter(
+    const outD = outDegree.get(n.id) ?? 0;
+    const inD = inDegree.get(n.id) ?? 0;
+    const isFork = outD >= 2 && inD <= 1;
+    const isMerge = inD >= 2 && outD <= 1;
+    if (!isFork && !isMerge) continue;
+    const kin = ((isFork ? childrenOf.get(n.id) : predsOf.get(n.id)) ?? []).filter(
       (k) => byId.get(k)?.parentId === n.parentId
       // same compound only
     );
-    if (kids.length < 2) continue;
-    const centers = kids.map(centerX);
+    if (kin.length < 2) continue;
+    const centers = kin.map(centerX);
     const wN = width.get(n.id);
     const span = (Math.min(...centers) + Math.max(...centers)) / 2;
     workingX.set(n.id, clampX(n.id, span - wN / 2));
+    if (isFork) {
+      const succSets = kin.map((k) => childrenOf.get(k) ?? []);
+      const isDiamond = kin.length >= 2 && succSets[0].some((s) => succSets.every((ss) => ss.includes(s)));
+      if (isDiamond) evenFanKids(centerX(n.id), kin);
+    }
+    const stepOf = isFork ? predsOf : childrenOf;
     let curId = n.id;
     const walked = /* @__PURE__ */ new Set([curId]);
     for (; ; ) {
-      const ps = predsOf.get(curId);
-      if (!ps || ps.length !== 1) break;
-      const p = ps[0];
-      if (walked.has(p)) break;
-      if ((outDegree.get(p) ?? 0) !== 1) break;
-      if ((inDegree.get(p) ?? 0) > 1) break;
-      if (byId.get(p)?.parentId !== byId.get(curId)?.parentId) break;
-      workingX.set(p, clampX(p, centerX(curId) - width.get(p) / 2));
-      walked.add(p);
-      curId = p;
+      const nexts = stepOf.get(curId);
+      if (!nexts || nexts.length !== 1) break;
+      const m = nexts[0];
+      if (walked.has(m)) break;
+      if ((outDegree.get(m) ?? 0) > 1) break;
+      if ((inDegree.get(m) ?? 0) > 1) break;
+      if (byId.get(m)?.parentId !== byId.get(curId)?.parentId) break;
+      workingX.set(m, clampX(m, centerX(curId) - width.get(m) / 2));
+      walked.add(m);
+      curId = m;
     }
   }
+  for (const n of order) {
+    const outD = outDegree.get(n.id) ?? 0;
+    const inD = inDegree.get(n.id) ?? 0;
+    if (!(outD >= 2 && inD <= 1)) continue;
+    const kids = (childrenOf.get(n.id) ?? []).filter(
+      (k) => byId.get(k)?.parentId === n.parentId
+    );
+    if (kids.length < 2) continue;
+    const succSets = kids.map((k) => childrenOf.get(k) ?? []);
+    const isDiamond = succSets[0].some((s) => succSets.every((ss) => ss.includes(s)));
+    if (isDiamond) continue;
+    const ps = predsOf.get(n.id);
+    if (!ps || ps.length !== 1) continue;
+    const pred = ps[0];
+    if ((outDegree.get(pred) ?? 0) !== 1) continue;
+    if (byId.get(pred)?.parentId !== byId.get(n.id)?.parentId) continue;
+    const before = centerX(n.id);
+    workingX.set(n.id, clampX(n.id, centerX(pred) - width.get(n.id) / 2));
+    const delta = centerX(n.id) - before;
+    if (delta === 0) continue;
+    for (const k of kids) workingX.set(k, clampX(k, workingX.get(k) + delta));
+  }
   const nodes = graph.nodes.map(
     (n) => workingX.get(n.id) === n.position.x ? n : { ...n, position: { x: workingX.get(n.id), y: n.position.y } }
   );
@@ -4965,6 +5018,13 @@ function TracedFlow({
   style
 }) {
   const layout = layoutProp ?? dagreTraceLayout;
+  (0, import_react25.useEffect)(() => {
+    if (layoutProp === dagreTraceLayout) {
+      devWarn(
+        () => "[footprint-explainable-ui] <TracedFlow layout={dagreTraceLayout}> bypasses the built-in measure-then-layout pipeline (content-exact sizing, fork/merge centering, straight spines). OMIT the `layout` prop to use it \u2014 passing the raw dagreTraceLayout silently forfeits every layout improvement eui ships."
+      );
+    }
+  }, [layoutProp]);
   const colors = (0, import_react25.useMemo)(
     () => ({ ...DEFAULT_COLORS, ...colorOverrides ?? {} }),
     [colorOverrides]