duaer-spec 0.27.1 → 0.27.2

package/bin/live-archify.mjs

@@ -355,17 +355,19 @@ export function repairArchitectureGeometry(ir) {
       e.label = truncateToUnits(String(e.label).trim(), MAX_EDGE_LABEL_UNITS);
       if (!e.label) delete e.label;
     }
-    if (e.label && e.labelAt == null) {
+    if (e.label && e.labelAt == null && e.labelDx == null && e.labelDy == null) {
       // Pull labels above the edge so they clear horizontally adjacent boxes.
-      e.labelDy = -28;
+      e.labelDy = -36;
     }
   }
   return ir;
 }
 
 /**
- * Detour long same-row edges that would pass through unrelated components.
- * Archify clean-flow rejects those as edge-through-node.
+ * Detour edges that would pass through unrelated components.
+ * Same-row long edges prefer a bottom/top via under/over the floor.
+ * Diagonal / stacked edges pick a corridor whose segments stay clear
+ * of unrelated boxes (Archify clean-flow edge-through-node).
  * @param {object} ir
  */
 export function routeCrossingEdges(ir) {
@@ -375,11 +377,15 @@ export function routeCrossingEdges(ir) {
   if (components.length < 3 || !connections.length) return ir;
 
   const byId = new Map();
+  let maxRight = 0;
+  let minLeft = Infinity;
+  let floorY = 0;
+  let ceilY = Infinity;
   for (const c of components) {
     if (!c?.id || !hasFinitePos(c)) continue;
     const w = hasFiniteSize(c) ? c.size[0] : 140;
     const h = hasFiniteSize(c) ? c.size[1] : 64;
-    byId.set(c.id, {
+    const box = {
       id: c.id,
       x: c.pos[0],
       y: c.pos[1],
@@ -389,48 +395,396 @@ export function routeCrossingEdges(ir) {
       cy: c.pos[1] + h / 2,
       bottom: c.pos[1] + h,
       top: c.pos[1],
-    });
+      right: c.pos[0] + w,
+      left: c.pos[0],
+    };
+    byId.set(c.id, box);
+    maxRight = Math.max(maxRight, box.right);
+    minLeft = Math.min(minLeft, box.left);
+    floorY = Math.max(floorY, box.bottom);
+    ceilY = Math.min(ceilY, box.top);
   }
   if (byId.size < 3) return ir;
 
-  let floorY = 0;
-  for (const b of byId.values()) floorY = Math.max(floorY, b.bottom);
+  const CLEAR = 8;
+
+  /** Axis-aligned segment vs box with clearance (Archify uses ~2px). */
+  function segHitsBox(x1, y1, x2, y2, box) {
+    const minX = Math.min(x1, x2);
+    const maxX = Math.max(x1, x2);
+    const minY = Math.min(y1, y2);
+    const maxY = Math.max(y1, y2);
+    return (
+      maxX >= box.left - CLEAR &&
+      minX <= box.right + CLEAR &&
+      maxY >= box.top - CLEAR &&
+      minY <= box.bottom + CLEAR
+    );
+  }
+
+  function pathClear(pts, skipA, skipB) {
+    for (let i = 0; i < pts.length - 1; i++) {
+      const [x1, y1] = pts[i];
+      const [x2, y2] = pts[i + 1];
+      for (const other of byId.values()) {
+        if (other.id === skipA || other.id === skipB) continue;
+        if (segHitsBox(x1, y1, x2, y2, other)) return false;
+      }
+    }
+    return true;
+  }
+
+  /** Port point on a box side. */
+  function port(box, side) {
+    switch (side) {
+      case "left":
+        return [box.left, box.cy];
+      case "right":
+        return [box.right, box.cy];
+      case "top":
+        return [box.cx, box.top];
+      case "bottom":
+        return [box.cx, box.bottom];
+      default:
+        return [box.cx, box.cy];
+    }
+  }
+
+  function tryRoute(a, b, fromSide, toSide, via) {
+    const pts = [port(a, fromSide), ...via, port(b, toSide)];
+    if (!pathClear(pts, a.id, b.id)) return null;
+    return { fromSide, toSide, via };
+  }
+
+  /** Vertical gutters between sorted unique column centers. */
+  function gutterXs() {
+    const cols = [...byId.values()]
+      .map((b) => b.cx)
+      .sort((x, y) => x - y);
+    const uniq = [];
+    for (const x of cols) {
+      if (!uniq.length || Math.abs(uniq[uniq.length - 1] - x) > 40) uniq.push(x);
+    }
+    const gutters = [Math.round(minLeft - 56), Math.round(maxRight + 56)];
+    for (let i = 0; i < uniq.length - 1; i++) {
+      const leftBoxes = [...byId.values()].filter((b) => Math.abs(b.cx - uniq[i]) < 48);
+      const rightBoxes = [...byId.values()].filter(
+        (b) => Math.abs(b.cx - uniq[i + 1]) < 48,
+      );
+      const rightEdge = Math.max(...leftBoxes.map((b) => b.right));
+      const leftEdge = Math.min(...rightBoxes.map((b) => b.left));
+      if (leftEdge - rightEdge > 40) {
+        gutters.push(Math.round((rightEdge + leftEdge) / 2));
+      }
+    }
+    return gutters;
+  }
+
   let detourIndex = 0;
 
   for (const e of connections) {
     if (!e || typeof e !== "object") continue;
-    if (Array.isArray(e.via) && e.via.length) continue;
     const a = byId.get(e.from);
     const b = byId.get(e.to);
     if (!a || !b) continue;
-    const span = Math.abs(a.cx - b.cx);
-    if (span < 160) continue;
 
-    const minX = Math.min(a.cx, b.cx);
-    const maxX = Math.max(a.cx, b.cx);
-    const bandTop = Math.min(a.top, b.top) - 12;
-    const bandBot = Math.max(a.bottom, b.bottom) + 12;
+    const horizSpan = Math.abs(a.cx - b.cx);
+    const vertSpan = Math.abs(a.cy - b.cy);
+    if (horizSpan < 40 && vertSpan < 80) continue;
+
+    const boxMinX = Math.min(a.left, b.left);
+    const boxMaxX = Math.max(a.right, b.right);
+    const boxMinY = Math.min(a.top, b.top);
+    const boxMaxY = Math.max(a.bottom, b.bottom);
+
     let blocked = false;
     for (const other of byId.values()) {
       if (other.id === a.id || other.id === b.id) continue;
-      if (other.x + other.w <= minX + 12 || other.x >= maxX - 12) continue;
-      if (other.y < bandBot && other.y + other.h > bandTop) {
+      const inBox =
+        other.right > boxMinX + 8 &&
+        other.left < boxMaxX - 8 &&
+        other.bottom > boxMinY + 8 &&
+        other.top < boxMaxY - 8;
+      if (inBox) {
         blocked = true;
         break;
       }
     }
+
+    if (!blocked && Array.isArray(e.via) && e.via.length) {
+      const viaY = Number(e.via[0]?.[1]);
+      if (
+        Number.isFinite(viaY) &&
+        (e.fromSide === "bottom" || e.toSide === "bottom")
+      ) {
+        for (const other of byId.values()) {
+          if (other.id === a.id || other.id === b.id) continue;
+          const underA =
+            Math.abs(other.cx - a.cx) < 48 &&
+            other.top >= a.bottom - 4 &&
+            other.top < viaY;
+          const underB =
+            Math.abs(other.cx - b.cx) < 48 &&
+            other.top >= b.bottom - 4 &&
+            other.top < viaY;
+          if (underA || underB) {
+            blocked = true;
+            break;
+          }
+        }
+      }
+    }
+
     if (!blocked) continue;
 
-    const viaY = floorY + 48 + detourIndex * 28;
+    const sameRow = vertSpan < 80 && horizSpan >= 160;
+    const candidates = [];
+
+    if (sameRow) {
+      const viaYBot = floorY + 48 + detourIndex * 28;
+      const viaYTop = ceilY - 48 - detourIndex * 28;
+      candidates.push(
+        tryRoute(a, b, "bottom", "bottom", [
+          [Math.round(a.cx), Math.round(viaYBot)],
+          [Math.round(b.cx), Math.round(viaYBot)],
+        ]),
+      );
+      candidates.push(
+        tryRoute(a, b, "top", "top", [
+          [Math.round(a.cx), Math.round(viaYTop)],
+          [Math.round(b.cx), Math.round(viaYTop)],
+        ]),
+      );
+      // Side corridors for same-row when floor/ceil are blocked
+      for (const side of ["right", "left"]) {
+        const viaX =
+          side === "right"
+            ? Math.round(maxRight + 56 + detourIndex * 36)
+            : Math.round(minLeft - 56 - detourIndex * 36);
+        candidates.push(
+          tryRoute(a, b, side, side, [
+            [viaX, Math.round(a.cy)],
+            [viaX, Math.round(b.cy)],
+          ]),
+        );
+      }
+    } else {
+      const gutters = gutterXs();
+      const ceil = ceilY - 48 - detourIndex * 20;
+      const floor = floorY + 48 + detourIndex * 20;
+      for (const gx of gutters) {
+        // Approach destination from the gutter side
+        const toSide = b.cx < gx ? "right" : "left";
+        const fromSide = a.cx < gx ? "right" : "left";
+        // Top wrap into gutter then into target
+        candidates.push(
+          tryRoute(a, b, "top", toSide, [
+            [Math.round(a.cx), Math.round(ceil)],
+            [Math.round(gx), Math.round(ceil)],
+            [Math.round(gx), Math.round(b.cy)],
+          ]),
+        );
+        candidates.push(
+          tryRoute(a, b, fromSide, toSide, [
+            [Math.round(gx), Math.round(a.cy)],
+            [Math.round(gx), Math.round(b.cy)],
+          ]),
+        );
+        candidates.push(
+          tryRoute(a, b, fromSide, "bottom", [
+            [Math.round(gx), Math.round(a.cy)],
+            [Math.round(gx), Math.round(floor)],
+            [Math.round(b.cx), Math.round(floor)],
+          ]),
+        );
+        candidates.push(
+          tryRoute(a, b, "bottom", toSide, [
+            [Math.round(a.cx), Math.round(floor)],
+            [Math.round(gx), Math.round(floor)],
+            [Math.round(gx), Math.round(b.cy)],
+          ]),
+        );
+      }
+      // Prefer right outer when mid is leftish (matches stacked fixtures)
+      const preferRight =
+        (a.cx + b.cx) / 2 <= (minLeft + maxRight) / 2 + (maxRight - minLeft) * 0.1;
+      const orderedSides = preferRight ? ["right", "left"] : ["left", "right"];
+      for (const side of orderedSides) {
+        const viaX =
+          side === "right"
+            ? Math.round(maxRight + 56 + detourIndex * 36)
+            : Math.round(minLeft - 56 - detourIndex * 36);
+        candidates.push(
+          tryRoute(a, b, side, side, [
+            [viaX, Math.round(a.cy)],
+            [viaX, Math.round(b.cy)],
+          ]),
+        );
+      }
+    }
+
+    const chosen = candidates.find(Boolean);
+    if (!chosen) continue;
+
     detourIndex += 1;
-    e.fromSide = "bottom";
-    e.toSide = "bottom";
-    e.via = [
-      [Math.round(a.cx), Math.round(viaY)],
-      [Math.round(b.cx), Math.round(viaY)],
-    ];
-    if (e.label && e.labelAt == null && e.labelDy == null) {
-      e.labelDy = -28;
+    e.fromSide = chosen.fromSide;
+    e.toSide = chosen.toSide;
+    e.via = chosen.via;
+    if (e.label && e.labelAt == null) {
+      // Final placement is repaired by repairEdgeLabelPlacement; leave
+      // bottom/top vias unmarked so that helper can pin labelAt on the via.
+      if (chosen.fromSide === "bottom" || chosen.toSide === "bottom") {
+        delete e.labelDx;
+        delete e.labelDy;
+      } else if (chosen.fromSide === "top" || chosen.toSide === "top") {
+        delete e.labelDx;
+        delete e.labelDy;
+      } else {
+        e.labelDx = chosen.fromSide === "right" ? -36 : 36;
+        delete e.labelDy;
+      }
+    }
+  }
+  return ir;
+}
+
+/**
+ * Keep edge labels off component boxes.
+ * Bottom vias must place the label *below* the via (labelDy > 0) — a negative
+ * dy pulls the label up into nodes that sit above the detour.
+ * Vertical stacked edges get labelAt in the inter-box gap.
+ * @param {object} ir
+ */
+export function repairEdgeLabelPlacement(ir) {
+  if (!ir || typeof ir !== "object") return ir;
+  const components = Array.isArray(ir.components) ? ir.components : [];
+  const connections = Array.isArray(ir.connections) ? ir.connections : [];
+  const boxes = [];
+  const byId = new Map();
+  for (const c of components) {
+    if (!c?.id || !hasFinitePos(c)) continue;
+    const w = hasFiniteSize(c) ? c.size[0] : 140;
+    const h = hasFiniteSize(c) ? c.size[1] : 64;
+    const box = {
+      id: c.id,
+      cx: c.pos[0] + w / 2,
+      cy: c.pos[1] + h / 2,
+      left: c.pos[0],
+      right: c.pos[0] + w,
+      top: c.pos[1],
+      bottom: c.pos[1] + h,
+    };
+    byId.set(c.id, box);
+    boxes.push(box);
+  }
+
+  const LABEL_W = 36;
+  const LABEL_H = 16;
+
+  function overlapsAny(lx, ly) {
+    const left = lx - LABEL_W / 2;
+    const right = lx + LABEL_W / 2;
+    const top = ly - LABEL_H / 2;
+    const bottom = ly + LABEL_H / 2;
+    for (const box of boxes) {
+      if (
+        right > box.left &&
+        left < box.right &&
+        bottom > box.top &&
+        top < box.bottom
+      ) {
+        return box;
+      }
+    }
+    return null;
+  }
+
+  function edgeMid(e, a, b) {
+    if (Array.isArray(e.via) && e.via.length >= 2) {
+      const first = e.via[0];
+      const last = e.via[e.via.length - 1];
+      return [
+        (Number(first[0]) + Number(last[0])) / 2,
+        (Number(first[1]) + Number(last[1])) / 2,
+      ];
+    }
+    return [(a.cx + b.cx) / 2, (a.cy + b.cy) / 2];
+  }
+
+  for (const e of connections) {
+    if (!e?.label) continue;
+    const a = byId.get(e.from);
+    const b = byId.get(e.to);
+    if (!a || !b) continue;
+
+    const via = Array.isArray(e.via) ? e.via : null;
+    const bottomVia =
+      via &&
+      via.length >= 2 &&
+      (e.fromSide === "bottom" || e.toSide === "bottom");
+    const topVia =
+      via &&
+      via.length >= 2 &&
+      (e.fromSide === "top" || e.toSide === "top") &&
+      !bottomVia;
+
+    if (bottomVia) {
+      // Stay under the floor detour — never pull up into co-row / mid-row boxes
+      const midX = (Number(via[0][0]) + Number(via[via.length - 1][0])) / 2;
+      const viaY = Number(via[0][1]);
+      e.labelAt = [Math.round(midX), Math.round(viaY + 18)];
+      delete e.labelDx;
+      delete e.labelDy;
+      continue;
+    }
+    if (topVia) {
+      const midX = (Number(via[0][0]) + Number(via[via.length - 1][0])) / 2;
+      const viaY = Number(via[0][1]);
+      e.labelAt = [Math.round(midX), Math.round(viaY - 18)];
+      delete e.labelDx;
+      delete e.labelDy;
+      continue;
+    }
+
+    if (e.labelAt != null) {
+      const hit = overlapsAny(e.labelAt[0], e.labelAt[1]);
+      if (!hit) continue;
+      // Nudge below the overlapping box
+      e.labelAt = [Math.round(hit.cx), Math.round(hit.bottom + 18)];
+      continue;
+    }
+
+    const horizSpan = Math.abs(a.cx - b.cx);
+    const vertSpan = Math.abs(a.cy - b.cy);
+    if (vertSpan >= 60 && horizSpan < 80) {
+      const upper = a.cy <= b.cy ? a : b;
+      const lower = a.cy <= b.cy ? b : a;
+      const gapY = (upper.bottom + lower.top) / 2;
+      e.labelAt = [Math.round(a.cx + 56), Math.round(gapY)];
+      delete e.labelDx;
+      delete e.labelDy;
+      continue;
+    }
+
+    if (e.labelDy == null && e.labelDx == null) {
+      e.labelDy = -36;
+    }
+
+    // If the offset mid still lands on a box, pin labelAt clear of it
+    const [mx, my] = edgeMid(e, a, b);
+    const lx = mx + (Number(e.labelDx) || 0);
+    const ly = my + (Number(e.labelDy) || 0);
+    const hit = overlapsAny(lx, ly);
+    if (hit) {
+      const below = hit.bottom + 18;
+      const above = hit.top - 18;
+      const preferBelow = Math.abs(below - ly) <= Math.abs(above - ly);
+      e.labelAt = [
+        Math.round(hit.cx),
+        Math.round(preferBelow ? below : above),
+      ];
+      delete e.labelDx;
+      delete e.labelDy;
     }
   }
   return ir;
@@ -477,6 +831,7 @@ export function layoutArchitectureIr(raw) {
     }
     repairArchitectureGeometry(ir);
     routeCrossingEdges(ir);
+    repairEdgeLabelPlacement(ir);
     recomputeViewBox(ir);
     return ir;
   }
@@ -546,6 +901,7 @@ export function layoutArchitectureIr(raw) {
   }
   repairArchitectureGeometry(ir);
   routeCrossingEdges(ir);
+  repairEdgeLabelPlacement(ir);
   const maxX = originX + (layers.length || 1) * colW + 80;
   ir.meta.viewBox = [
     Math.max(320, maxX),

package/bin/live-deliverables.mjs

@@ -221,6 +221,7 @@ function cardBlock(card, labels) {
     [labels.envChecklist, c.envChecklist, "list"],
     [labels.dataPrecheck, c.dataPrecheck, "list"],
     [labels.externalDeps, c.externalDeps, "list"],
+    [labels.perfBudget, c.perfBudget, "list"],
   ].filter(([, v]) => String(v || "").trim());
   if (!rows.length) return `<p class="empty">${esc(labels.emptyCard)}</p>`;
   return `<dl class="card-dl">${rows
@@ -584,6 +585,7 @@ function labelsFor(lang) {
       envChecklist: "Environment checklist",
       dataPrecheck: "Data precheck",
       externalDeps: "External dependencies",
+      perfBudget: "Performance budget",
       baseline: "Baseline sign-off",
       statusDone: "Ready",
       statusPartial: "In progress",
@@ -623,6 +625,7 @@ function labelsFor(lang) {
       envChecklist: "環境チェック",
       dataPrecheck: "データ事前検査",
       externalDeps: "外部依存",
+      perfBudget: "性能予算",
       baseline: "ベースライン署名",
       statusDone: "完了",
       statusPartial: "進行中",
@@ -661,6 +664,7 @@ function labelsFor(lang) {
     envChecklist: "环境检查",
     dataPrecheck: "数据预检",
     externalDeps: "外部依赖",
+    perfBudget: "性能预算",
     baseline: "基线签署",
     statusDone: "已产出",
     statusPartial: "进行中",

package/bin/live-modules.mjs

@@ -25,6 +25,10 @@ import {
   externalDepsNeedsTask,
   missingExternalDeps,
 } from "../web/live-dev/external-deps.mjs";
+import {
+  missingPerfBudget,
+  perfBudgetNeedsTask,
+} from "../web/live-dev/perf-budget.mjs";
 
 function clipCard(card) {
   if (!card || typeof card !== "object") {
@@ -40,6 +44,7 @@ function clipCard(card) {
       envChecklist: "",
       dataPrecheck: "",
       externalDeps: "",
+      perfBudget: "",
     };
   }
   return {
@@ -54,6 +59,7 @@ function clipCard(card) {
     envChecklist: String(card.envChecklist || "").slice(0, 4000),
     dataPrecheck: String(card.dataPrecheck || "").slice(0, 4000),
     externalDeps: String(card.externalDeps || "").slice(0, 4000),
+    perfBudget: String(card.perfBudget || "").slice(0, 4000),
   };
 }
 
@@ -426,6 +432,17 @@ export function buildTaskPoolFromModules(modules, { deployNeeded = false, deploy
       });
       beforeImpl = [ext.id];
     }
+    if (perfBudgetNeedsTask(m.card?.perfBudget)) {
+      const perfGap = missingPerfBudget(m.card?.perfBudget);
+      const perfNote = perfGap.length ? `; still missing ${perfGap.join("/")}` : "";
+      const perf = push({
+        moduleId: m.id,
+        title: `FDE-08: perf budget «${m.title}» — LCP, INP, bundle, virtual list, weak net, large data${perfNote}`,
+        dependsOn: beforeImpl,
+        role: EMPLOYEE_ROLES.VERIFY_L3,
+      });
+      beforeImpl = [perf.id];
+    }
     const impl = push({
       moduleId: m.id,
       title: `Implement module «${m.title}»: ${truncate(m.card.goal, 100)}`,

package/bin/live-project-chat.mjs

@@ -40,6 +40,7 @@ function clipCard(card) {
       envChecklist: "",
       dataPrecheck: "",
       externalDeps: "",
+      perfBudget: "",
     };
   }
   return {
@@ -54,6 +55,7 @@ function clipCard(card) {
     envChecklist: String(card.envChecklist || "").slice(0, 4000),
     dataPrecheck: String(card.dataPrecheck || "").slice(0, 4000),
     externalDeps: String(card.externalDeps || "").slice(0, 4000),
+    perfBudget: String(card.perfBudget || "").slice(0, 4000),
   };
 }
 

package/bin/live-repo-path.mjs

@@ -4,7 +4,7 @@
 
 import { existsSync, mkdirSync, statSync } from "node:fs";
 import { homedir } from "node:os";
-import { basename, isAbsolute, join, parse, resolve } from "node:path";
+import { basename, isAbsolute, parse, resolve } from "node:path";
 
 /**
  * @param {string} repoPath
@@ -53,9 +53,98 @@ export function resolveProductRepoPath(repoPath, opts = {}) {
   return resolve(parent, raw);
 }
 
+/**
+ * Create mode: only a single short folder name under the product parent.
+ * Absolute paths and nested paths are refused so parent + name stay one story.
+ * @param {string} folderName
+ * @param {{ projectsRoot?: string, home?: string }} [opts]
+ */
+export function resolveCreateProductRepoPath(folderName, opts = {}) {
+  const raw = String(folderName || "")
+    .trim()
+    .replace(/[\\/]+$/, "");
+  if (!raw) {
+    const e = new Error("请填写要新建的目录短名");
+    e.code = "EMPTY_PATH";
+    throw e;
+  }
+  if (isAbsolute(raw) || /[\\/]/.test(raw) || raw === "." || raw === "..") {
+    const e = new Error(
+      "新建只能填目录短名（如 my-app），不要填绝对路径。目录将建在产品父目录下；已有项目请从下方列表打开或点「浏览…」",
+    );
+    e.code = "NEED_SHORT_NAME";
+    throw e;
+  }
+  const projectsRoot = String(opts.projectsRoot || "").trim();
+  if (!projectsRoot) {
+    const e = new Error("新建前请先选择产品父目录");
+    e.code = "NEED_PROJECTS_ROOT";
+    throw e;
+  }
+  return resolveProductRepoPath(raw, opts);
+}
+
+/**
+ * Create mode must not reuse an on-disk folder (would clobber the prior project).
+ * @param {string} absPath
+ */
+export function assertProductDirFreeForCreate(absPath) {
+  const abs = resolve(String(absPath || ""));
+  if (!abs) {
+    const e = new Error("请填写仓库绝对路径，或项目名（需先设置产品父目录）");
+    e.code = "EMPTY_PATH";
+    throw e;
+  }
+  if (existsSync(abs)) {
+    const e = new Error(
+      `项目目录已存在：${abs}。请换一个目录名，或从「已有项目」打开。`,
+    );
+    e.code = "PATH_EXISTS";
+    e.path = abs;
+    throw e;
+  }
+  return abs;
+}
+
+/**
+ * Create mode must not reuse a registered project path or display title.
+ * @param {{ path: string, title?: string }} want
+ * @param {Array<{ path?: string, title?: string, name?: string }>} repos
+ */
+export function assertProjectIdentityFreeForCreate(want, repos = []) {
+  const abs = resolve(String(want?.path || ""));
+  const title = String(want?.title || "")
+    .trim()
+    .toLowerCase();
+  const list = Array.isArray(repos) ? repos : [];
+  for (const r of list) {
+    const p = resolve(String(r?.path || ""));
+    if (p && abs && p === abs) {
+      const e = new Error(
+        `项目已存在：${abs}。请换一个目录名，或从「已有项目」打开。`,
+      );
+      e.code = "PROJECT_EXISTS";
+      e.path = abs;
+      throw e;
+    }
+    const other = String(r?.title || r?.name || "")
+      .trim()
+      .toLowerCase();
+    if (title && other && title === other) {
+      const e = new Error(
+        `已有同名项目「${r.title || r.name}」。请换一个项目名称，或从「已有项目」打开。`,
+      );
+      e.code = "TITLE_EXISTS";
+      e.path = p || undefined;
+      throw e;
+    }
+  }
+  return abs;
+}
+
 /**
  * Create missing directory (recursive). Refuses FS root and $HOME itself.
- * @returns {{ path: string, created: boolean }}
+ * @returns {{ path: string, created: boolean, name?: string }}
  */
 export function ensureProductDir(absPath, opts = {}) {
   const abs = resolve(String(absPath || ""));

package/docs/agent/e2e-test-plan.md

@@ -180,6 +180,11 @@ the table for their app.
 | E2E-208 | FDE-03: environment checklist needs DNS, TLS, CORS, auth, and third-party reachability passed, or a no-customer opt-out; a failed probe blocks confirm; kickoff adds a probe task before implement | `npm test` + `npm run test:live` |
 | E2E-209 | FDE-06: data precheck needs a field mapping, an import failure list, and an export, or a no-import opt-out; kickoff adds the precheck before implement | `npm test` + `npm run test:live` |
 | E2E-210 | FDE-05: external dependencies need a blocker, SLA, backup mock, and parallel path, or a no-dependency opt-out; kickoff adds the board before implement | `npm test` + `npm run test:live` |
+| E2E-211 | FDE-08: performance budget needs LCP, INP, bundle size, virtualized long lists, a weak-network check, and a large-data check, or a no-page-performance opt-out; a vague speed line fails; kickoff adds the budget before implement | `npm test` + `npm run test:live` |
+| E2E-212 | Creating a new project refuses when the target directory already exists; open from the project list still works | `npm test` + `npm run test:live` |
+| E2E-213 | Create project accepts only a short folder name under the parent; absolute paths, duplicate folders, and duplicate titles are refused | `npm test` + `npm run test:live` |
+| E2E-214 | Architecture edges that would cross unrelated boxes get a clear corridor via; vertical labels use gap `labelAt`; Archify render succeeds | `npm test` |
+| E2E-215 | Bottom-via edge labels stay under the floor (`labelAt` on via) so they do not overlap mid-row boxes (e.g. 改稿 / artifact) | `npm test` |
 
 | E2E-156 | Accepted chat bubble preview URL is a clickable `<a>` (http(s) or /api/…) | `npm test` + `npm run test:live` |
 | E2E-157 | `http://host/api/result/…` chat links render as one clean `<a>` (no nested HTML garble) | `npm test` |