schematex 0.4.3 → 0.5.0

package/dist/{chunk-VITE3MZQ.cjs → chunk-QTNPMIO2.cjs}

@@ -824,15 +824,27 @@ function isFullWidth(code) {
   if (code >= 131072 && code <= 196607) return true;
   return false;
 }
-function measureLabelWidth(label) {
+function labelLines(label) {
+  return String(label).split(/<br\s*\/?>|\n/i).map((line2) => line2.replace(/<\/?[bi]>/gi, ""));
+}
+function measureLineWidth(line2) {
   let w = 0;
-  for (const ch of label) {
+  for (const ch of line2) {
     const code = ch.codePointAt(0) ?? 0;
     if (isFullWidth(code)) w += FC_CONST.cjkCharWidth;
     else w += FC_CONST.charWidth;
   }
   return w;
 }
+function measureLabelWidth(label) {
+  const lines = labelLines(label);
+  let max = 0;
+  for (const line2 of lines) {
+    const w = measureLineWidth(line2);
+    if (w > max) max = w;
+  }
+  return max;
+}
 function greedyFAS(nodeIds, edges) {
   const outAdj = /* @__PURE__ */ new Map();
   const inAdj = /* @__PURE__ */ new Map();
@@ -1265,6 +1277,85 @@ function laneBasedXCoords(layerNodes, pathOf, nodeSpacingX, segments) {
   }
   return result;
 }
+function enforceSequentialClusterLayers(ast, layerMap, edges) {
+  const sgParent = /* @__PURE__ */ new Map();
+  for (const sg of ast.subgraphs) {
+    for (const childSg of sg.subgraphs) sgParent.set(childSg, sg.id);
+    if (!sgParent.has(sg.id)) sgParent.set(sg.id, void 0);
+  }
+  const topLevel = ast.subgraphs.filter((sg) => !sgParent.get(sg.id));
+  if (topLevel.length < 2) return;
+  const collect = (sgId) => {
+    const sg = ast.subgraphs.find((s) => s.id === sgId);
+    if (!sg) return [];
+    const ids = [...sg.children];
+    for (const childSgId of sg.subgraphs) ids.push(...collect(childSgId));
+    return ids;
+  };
+  const adjOut = /* @__PURE__ */ new Map();
+  for (const e of edges) {
+    if (!adjOut.has(e.from)) adjOut.set(e.from, []);
+    adjOut.get(e.from).push(e.to);
+  }
+  const hasForwardEdge = (srcSgId, dstSgId) => {
+    const srcIds = new Set(collect(srcSgId));
+    const dstIds = new Set(collect(dstSgId));
+    for (const id of srcIds) {
+      for (const t of adjOut.get(id) ?? []) {
+        if (dstIds.has(t)) return true;
+      }
+    }
+    return false;
+  };
+  const chains = [];
+  let cur = [];
+  for (let i = 0; i < topLevel.length; i++) {
+    const sg = topLevel[i];
+    if (i === 0 || !hasForwardEdge(topLevel[i - 1].id, sg.id)) {
+      if (cur.length > 1) chains.push(cur);
+      cur = [sg.id];
+    } else {
+      cur.push(sg.id);
+    }
+  }
+  if (cur.length > 1) chains.push(cur);
+  if (chains.length === 0) return;
+  for (const chain of chains) {
+    let prevMax = -Infinity;
+    for (const clusterId of chain) {
+      const ids = collect(clusterId);
+      if (ids.length === 0) continue;
+      let curMin = Infinity;
+      let curMax = -Infinity;
+      for (const id of ids) {
+        const l = layerMap.get(id) ?? 0;
+        if (l < curMin) curMin = l;
+        if (l > curMax) curMax = l;
+      }
+      const requiredMin = prevMax === -Infinity ? curMin : prevMax + 1;
+      if (curMin < requiredMin) {
+        const shift = requiredMin - curMin;
+        const toShift = new Set(ids);
+        const queue = [...ids];
+        while (queue.length > 0) {
+          const u = queue.shift();
+          for (const t of adjOut.get(u) ?? []) {
+            if (!toShift.has(t)) {
+              toShift.add(t);
+              queue.push(t);
+            }
+          }
+        }
+        for (const id of toShift) {
+          layerMap.set(id, (layerMap.get(id) ?? 0) + shift);
+        }
+        prevMax = curMax + shift;
+      } else {
+        prevMax = curMax;
+      }
+    }
+  }
+}
 function hasOverlappingTopLevelClusters(ast, layerMap, sgParent) {
   const topLevel = ast.subgraphs.filter((sg) => !sgParent.get(sg.id));
   if (topLevel.length < 2) return false;
@@ -1301,7 +1392,9 @@ function layoutFlowchart(ast) {
       Math.ceil(rawTextW) + FC_CONST.labelHPad * 2
     );
     let shapeW = Math.max(FC_CONST.minNodeWidth, labelW);
-    let shapeH = FC_CONST.nodeHeight;
+    const nLines = labelLines(n.label).length;
+    const multilineH = nLines > 1 ? FC_CONST.nodeHeight + (nLines - 1) * 14 : FC_CONST.nodeHeight;
+    let shapeH = multilineH;
     if (n.shape === "diamond") {
       shapeW = Math.max(shapeW, labelW * 1.4);
       shapeH = Math.max(shapeH, 52);
@@ -1358,6 +1451,7 @@ function layoutFlowchart(ast) {
     };
   });
   const layerMap = longestPathLayers(allIds, ledges);
+  enforceSequentialClusterLayers(ast, layerMap, ledges);
   let dummyCounter = 0;
   const dummies = [];
   const { updatedEdges } = insertDummies(ledges, layerMap, () => {
@@ -2150,5 +2244,5 @@ exports.layoutFlowchart = layoutFlowchart;
 exports.parseFlowchart = parseFlowchart;
 exports.renderFlowchart = renderFlowchart;
 exports.renderFlowchartAST = renderFlowchartAST;
-//# sourceMappingURL=chunk-VITE3MZQ.cjs.map
-//# sourceMappingURL=chunk-VITE3MZQ.cjs.map
+//# sourceMappingURL=chunk-QTNPMIO2.cjs.map
+//# sourceMappingURL=chunk-QTNPMIO2.cjs.map