@tscircuit/capacity-autorouter 0.0.205 → 0.0.207

package/dist/index.d.ts

@@ -29,7 +29,9 @@ type ConnectionPoint = SingleLayerConnectionPoint | MultiLayerConnectionPoint;
 interface SimpleRouteJson {
     layerCount: number;
     minTraceWidth: number;
+    nominalTraceWidth?: number;
     minViaDiameter?: number;
+    defaultObstacleMargin?: number;
     obstacles: Obstacle[];
     connections: Array<SimpleRouteConnection>;
     bounds: {
@@ -1448,7 +1450,8 @@ declare class PortPointPathingSolver extends BaseSolver {
      *  - memoryPfMap to bias away from historically high Pf regions
      */
     computeH(point: InputPortPoint, currentNodeId: CapacityMeshNodeId, endGoalNodeId: CapacityMeshNodeId, currentZ: number, distanceTraveled: number, hasTouchedOffBoardNode?: boolean): number;
-    getAvailableExitPortPoints(nodeId: CapacityMeshNodeId): InputPortPoint[];
+    getVisitedPortPointKey(portPointId: string, hasTouchedOffBoardNode?: boolean): string;
+    getAvailableExitPortPoints(nodeId: CapacityMeshNodeId, hasTouchedOffBoardNode?: boolean): InputPortPoint[];
     /**
      * Get available port points to exit from a node, but *do not* return all.
      *
@@ -1457,8 +1460,8 @@ declare class PortPointPathingSolver extends BaseSolver {
      * - If that centermost port point is already assigned, also return some next-closest
      *   unassigned offsets as backups.
      */
-    getAvailableExitPortPointsWithOmissions(nodeId: CapacityMeshNodeId, _endGoalNodeId: CapacityMeshNodeId): InputPortPoint[];
-    getAvailableExitPortPointsForOffboardConnection(nodeId: CapacityMeshNodeId): (InputPortPoint & {
+    getAvailableExitPortPointsWithOmissions(nodeId: CapacityMeshNodeId, _endGoalNodeId: CapacityMeshNodeId, hasTouchedOffBoardNode?: boolean): InputPortPoint[];
+    getAvailableExitPortPointsForOffboardConnection(nodeId: CapacityMeshNodeId, hasTouchedOffBoardNode?: boolean): (InputPortPoint & {
         throughNodeId: CapacityMeshNodeId;
     })[];
     canTravelThroughObstacle(node: InputNodeWithPortPoints, connectionName: string, rootConnectionName: string): boolean;
@@ -2774,7 +2777,7 @@ interface Point$1 {
     y: number;
     z: number;
 }
-type Point2D$2 = {
+type Point2D$3 = {
     x: number;
     y: number;
 };
@@ -2819,26 +2822,26 @@ declare class HighDensityRouteSpatialIndex {
      * @param margin The minimum required clearance distance from the query point.
      * @returns An array of conflicting routes and their minimum distance to the point.
      */
-    getConflictingRoutesNearPoint(point: Point2D$2, margin: number): Array<{
+    getConflictingRoutesNearPoint(point: Point2D$3, margin: number): Array<{
         conflictingRoute: HighDensityRoute;
         distance: number;
     }>;
 }
 
-interface Point2D$1 {
+interface Point2D$2 {
     x: number;
     y: number;
 }
 interface Segment {
-    start: Point2D$1;
-    end: Point2D$1;
+    start: Point2D$2;
+    end: Point2D$2;
 }
 
-interface Point2D {
+interface Point2D$1 {
     x: number;
     y: number;
 }
-interface Point3D extends Point2D {
+interface Point3D$1 extends Point2D$1 {
     z: number;
 }
 interface TraceKeepoutSolverInput {
@@ -2847,7 +2850,6 @@ interface TraceKeepoutSolverInput {
     connMap: ConnectivityMap;
     colorMap: Record<string, string>;
     keepoutRadiusSchedule?: number[];
-    smoothDistance?: number;
     srj?: Pick<SimpleRouteJson, "outline" | "bounds">;
 }
 /**
@@ -2864,7 +2866,6 @@ declare class TraceKeepoutSolver extends BaseSolver {
     originalHdRoutes: HighDensityRoute$1[];
     hdRoutes: HighDensityRoute$1[];
     redrawnHdRoutes: HighDensityRoute$1[];
-    smoothDistance: number;
     KEEPOUT_RADIUS_SCHEDULE: number[];
     currentScheduleIndex: number;
     currentKeepoutRadius: number;
@@ -2872,18 +2873,20 @@ declare class TraceKeepoutSolver extends BaseSolver {
     smoothedCursorRoutes: HighDensityRoute$1[];
     processedRoutes: HighDensityRoute$1[];
     currentTrace: HighDensityRoute$1 | null;
-    cursorPosition: Point3D | null;
-    lastCursorPosition: Point3D | null;
-    drawPosition: Point2D | null;
+    cursorPosition: Point3D$1 | null;
+    lastCursorPosition: Point3D$1 | null;
+    drawPosition: Point2D$1 | null;
     currentTraceSegmentIndex: number;
     currentTraceSegmentT: number;
-    recordedDrawPositions: Point3D[];
+    recordedDrawPositions: Point3D$1[];
     lastCollidingSegments: Segment[];
     obstacleSHI: ObstacleSpatialHashIndex;
     hdRouteSHI: HighDensityRouteSpatialIndex;
     boardOutlineRoutes: HighDensityRoute$1[];
     constructor(input: TraceKeepoutSolverInput);
+    getSmoothDistance(): number;
     _step(): void;
+    getStepDistance(): number;
     /**
      * Steps the cursor forward by CURSOR_STEP_DISTANCE along the trace
      * Returns false if we've reached the end of the trace
@@ -2916,6 +2919,85 @@ declare class TraceKeepoutSolver extends BaseSolver {
     getRedrawnHdRoutes(): HighDensityRoute$1[];
 }
 
+interface Point2D {
+    x: number;
+    y: number;
+}
+interface Point3D extends Point2D {
+    z: number;
+}
+interface TraceWidthSolverInput {
+    hdRoutes: HighDensityRoute$1[];
+    obstacles?: Obstacle[];
+    connMap?: ConnectivityMap;
+    colorMap?: Record<string, string>;
+    nominalTraceWidth?: number;
+    minTraceWidth: number;
+    obstacleMargin?: number;
+}
+/**
+ * TraceWidthSolver determines the optimal trace width for each route.
+ * It uses a TRACE_WIDTH_SCHEDULE to try progressively narrower widths:
+ * [nominalTraceWidth, (nominalTraceWidth + minTraceWidth)/2, minTraceWidth]
+ *
+ * For each trace, it walks along with a cursor checking clearance.
+ * If clearance is insufficient for the current width, it tries the next
+ * narrower width in the schedule.
+ *
+ * nominalTraceWidth defaults to minTraceWidth * 2 if not specified.
+ */
+declare class TraceWidthSolver extends BaseSolver {
+    hdRoutes: HighDensityRoute$1[];
+    hdRoutesWithWidths: HighDensityRoute$1[];
+    nominalTraceWidth: number;
+    minTraceWidth: number;
+    obstacleMargin: number;
+    TRACE_WIDTH_SCHEDULE: number[];
+    unprocessedRoutes: HighDensityRoute$1[];
+    processedRoutes: HighDensityRoute$1[];
+    currentTrace: HighDensityRoute$1 | null;
+    cursorPosition: Point3D | null;
+    currentTraceSegmentIndex: number;
+    currentTraceSegmentT: number;
+    currentScheduleIndex: number;
+    currentTargetWidth: number;
+    hasInsufficientClearance: boolean;
+    currentWalkMinClearance: number;
+    bestMinClearance: number;
+    bestWidth: number;
+    lastCollidingObstacles: Obstacle[];
+    lastCollidingRoutes: HighDensityRoute$1[];
+    lastClearance: number;
+    obstacles: Obstacle[];
+    obstacleSHI?: ObstacleSpatialHashIndex;
+    hdRouteSHI: HighDensityRouteSpatialIndex;
+    connMap?: ConnectivityMap;
+    colorMap?: Record<string, string>;
+    constructor(input: TraceWidthSolverInput);
+    _step(): void;
+    /**
+     * Initializes/resets the cursor for processing a trace
+     */
+    private initializeCursor;
+    /**
+     * Steps the cursor forward by CURSOR_STEP_DISTANCE along the trace
+     * Returns false if we've reached the end of the trace
+     */
+    private stepCursorForward;
+    /**
+     * Gets the minimum clearance at a given position from obstacles and other traces
+     * Also updates lastCollidingObstacles and lastCollidingRoutes for visualization
+     */
+    private getClearanceAtPosition;
+    /**
+     * Finalizes the current trace with the given width
+     */
+    private finalizeCurrentTrace;
+    visualize(): GraphicsObject;
+    /** Returns the routes with determined widths. This is the primary output of the solver. */
+    getHdRoutesWithWidths(): HighDensityRoute$1[];
+}
+
 interface OffboardPortPoint {
     portPointId: string;
     x: number;
@@ -3076,6 +3158,7 @@ declare class AssignableAutoroutingPipeline2 extends BaseSolver {
     deadEndSolver?: DeadEndSolver;
     traceSimplificationSolver?: TraceSimplificationSolver;
     traceKeepoutSolver?: TraceKeepoutSolver;
+    traceWidthSolver?: TraceWidthSolver;
     availableSegmentPointSolver?: AvailableSegmentPointSolver;
     portPointPathingSolver?: PortPointPathingSolver;
     multiSectionPortPointOptimizer?: MultiSectionPortPointOptimizer;
@@ -3090,7 +3173,7 @@ declare class AssignableAutoroutingPipeline2 extends BaseSolver {
     capacityNodes: CapacityMeshNode[] | null;
     capacityEdges: CapacityMeshEdge[] | null;
     cacheProvider: CacheProvider | null;
-    pipelineDef: (PipelineStep$1<typeof NetToPointPairsSolver> | PipelineStep$1<typeof RectDiffPipeline> | PipelineStep$1<typeof RelateNodesToOffBoardConnectionsSolver> | PipelineStep$1<typeof CapacityMeshEdgeSolver2_NodeTreeOptimization> | PipelineStep$1<typeof AvailableSegmentPointSolver> | PipelineStep$1<typeof HyperPortPointPathingSolver> | PipelineStep$1<typeof SimpleHighDensitySolver> | PipelineStep$1<typeof MultipleHighDensityRouteStitchSolver> | PipelineStep$1<typeof TraceSimplificationSolver> | PipelineStep$1<typeof TraceKeepoutSolver>)[];
+    pipelineDef: (PipelineStep$1<typeof NetToPointPairsSolver> | PipelineStep$1<typeof RectDiffPipeline> | PipelineStep$1<typeof RelateNodesToOffBoardConnectionsSolver> | PipelineStep$1<typeof CapacityMeshEdgeSolver2_NodeTreeOptimization> | PipelineStep$1<typeof AvailableSegmentPointSolver> | PipelineStep$1<typeof HyperPortPointPathingSolver> | PipelineStep$1<typeof SimpleHighDensitySolver> | PipelineStep$1<typeof MultipleHighDensityRouteStitchSolver> | PipelineStep$1<typeof TraceSimplificationSolver> | PipelineStep$1<typeof TraceKeepoutSolver> | PipelineStep$1<typeof TraceWidthSolver>)[];
     constructor(srj: SimpleRouteJson, opts?: CapacityMeshSolverOptions$1);
     getConstructorParams(): readonly [SimpleRouteJson, CapacityMeshSolverOptions$1];
     currentPipelineStepIndex: number;