@willcgage/module-schematic 0.90.0 → 0.91.0

package/dist/index.d.cts

@@ -2597,6 +2597,10 @@ interface GraphWalk {
     turnouts: GraphTurnout[];
     /** Every reason this walk is not the whole layout. */
     warnings: string[];
+    /** Turnouts whose diverging route reaches nothing — the ids, not just the
+     * sentence, so a caller can act on it (and say it ONCE) instead of matching
+     * on prose. */
+    danglingDiverges: string[];
 }
 /**
  * Walk the graph from an endplate and read the topology off it.

package/dist/index.d.ts

@@ -2597,6 +2597,10 @@ interface GraphWalk {
     turnouts: GraphTurnout[];
     /** Every reason this walk is not the whole layout. */
     warnings: string[];
+    /** Turnouts whose diverging route reaches nothing — the ids, not just the
+     * sentence, so a caller can act on it (and say it ONCE) instead of matching
+     * on prose. */
+    danglingDiverges: string[];
 }
 /**
  * Walk the graph from an endplate and read the topology off it.

package/dist/index.js

@@ -2408,6 +2408,7 @@ function snapPiece(moving, others, library = BUILT_IN_TRACK_PARTS, withinInches
     to: best.t.key
   };
 }
+var danglingDivergeWarning = (id) => `the route diverging at ${id} is not connected to anything`;
 function walkTrackGraph(graph, pieces, startAt, library = BUILT_IN_TRACK_PARTS) {
   const byKey = new Map(graph.joints.map((j) => [j.key, j]));
   const pieceById = new Map(pieces.map((p) => [p.id, p]));
@@ -2428,6 +2429,7 @@ function walkTrackGraph(graph, pieces, startAt, library = BUILT_IN_TRACK_PARTS)
   const routes = [];
   const turnouts = [];
   const warnings = [];
+  const danglingDiverges = [];
   const queued = /* @__PURE__ */ new Set();
   const pending = [];
   const walk = (startKey, startPos, id, bornAt) => {
@@ -2518,7 +2520,8 @@ function walkTrackGraph(graph, pieces, startAt, library = BUILT_IN_TRACK_PARTS)
     const b = pending.shift();
     const start = link.get(b.joint);
     if (!start) {
-      warnings.push(`the route diverging at ${b.from} is not connected to anything`);
+      warnings.push(danglingDivergeWarning(b.from));
+      danglingDiverges.push(b.from);
       continue;
     }
     const already = routes.find((r2) => r2.pieces.includes(byKey.get(start).piece));
@@ -2539,7 +2542,7 @@ function walkTrackGraph(graph, pieces, startAt, library = BUILT_IN_TRACK_PARTS)
     if (!reached.has(p.id) && !graph.unplaceable.some((u) => u.piece === p.id))
       warnings.push(`${p.id} is not reachable from the endplate \u2014 nothing connects it`);
   for (const c of graph.conflicts) warnings.push(c.reason);
-  return { routes, turnouts, warnings };
+  return { routes, turnouts, warnings, danglingDiverges };
 }
 function resolveGraphAnchor(anchor, walk, pieces, library = BUILT_IN_TRACK_PARTS) {
   const piece = pieces.find((p) => p.id === anchor.piece);
@@ -2560,7 +2563,8 @@ function graphToDoc(pieces, input) {
   const library = input.library ?? BUILT_IN_TRACK_PARTS;
   const graph = buildTrackGraph(pieces, library);
   const walk = walkTrackGraph(graph, pieces, input.startAt, library);
-  const warnings = [...walk.warnings];
+  const dangling = new Set(walk.danglingDiverges.map(danglingDivergeWarning));
+  const warnings = walk.warnings.filter((w) => !dangling.has(w));
   const round = (n) => Math.round(n * 100) / 100;
   const base = input.base ?? {};
   const endplates = base.endplates && base.endplates.length ? base.endplates : [{ id: "A", label: "West" }, { id: "B", label: "East" }];