@tscircuit/capacity-autorouter 0.0.167 → 0.0.168

package/dist/index.d.ts

@@ -1634,81 +1634,6 @@ declare class SingleLayerNodeMergerSolver extends BaseSolver {
     visualize(): GraphicsObject;
 }
 
-interface Point$1 {
-    x: number;
-    y: number;
-    z: number;
-}
-declare class SingleSimplifiedPathSolver extends BaseSolver {
-    newRoute: HighDensityIntraNodeRoute$1["route"];
-    newVias: HighDensityIntraNodeRoute$1["vias"];
-    headIndex: number;
-    tailIndex: number;
-    inputRoute: HighDensityIntraNodeRoute$1;
-    otherHdRoutes: HighDensityIntraNodeRoute$1[];
-    obstacles: Obstacle[];
-    connMap: ConnectivityMap;
-    colorMap: Record<string, string>;
-    outline?: Array<{
-        x: number;
-        y: number;
-    }>;
-    constructor(params: {
-        inputRoute: HighDensityIntraNodeRoute$1;
-        otherHdRoutes: HighDensityIntraNodeRoute$1[];
-        obstacles: Obstacle[];
-        connMap: ConnectivityMap;
-        colorMap: Record<string, string>;
-        outline?: Array<{
-            x: number;
-            y: number;
-        }>;
-    });
-    getConstructorParams(): {
-        inputRoute: HighDensityIntraNodeRoute$1;
-        otherHdRoutes: HighDensityIntraNodeRoute$1[];
-        obstacles: Obstacle[];
-        connMap: Record<string, string[]>;
-        colorMap: Record<string, string>;
-        outline: {
-            x: number;
-            y: number;
-        }[] | undefined;
-    };
-    get simplifiedRoute(): HighDensityIntraNodeRoute$1;
-    isValidPath(pointsInRoute: Point$1[]): boolean;
-    _step(): void;
-    getVisualsForNewRouteAndObstacles(): GraphicsObject & Pick<Required<GraphicsObject>, "points" | "lines" | "rects" | "circles">;
-}
-
-declare class MultiSimplifiedPathSolver extends BaseSolver {
-    simplifiedHdRoutes: HighDensityIntraNodeRoute$1[];
-    currentUnsimplifiedHdRouteIndex: number;
-    activeSubSolver: SingleSimplifiedPathSolver | null;
-    unsimplifiedHdRoutes: HighDensityIntraNodeRoute$1[];
-    obstacles: Obstacle[];
-    connMap: ConnectivityMap;
-    colorMap: Record<string, string>;
-    outline?: Array<{
-        x: number;
-        y: number;
-    }>;
-    defaultViaDiameter: number;
-    constructor(params: {
-        unsimplifiedHdRoutes: HighDensityIntraNodeRoute$1[];
-        obstacles: Obstacle[];
-        connMap?: ConnectivityMap;
-        colorMap?: Record<string, string>;
-        outline?: Array<{
-            x: number;
-            y: number;
-        }>;
-        defaultViaDiameter?: number;
-    });
-    _step(): void;
-    visualize(): GraphicsObject;
-}
-
 declare class CapacityMeshEdgeSolver2_NodeTreeOptimization extends CapacityMeshEdgeSolver {
     nodes: CapacityMeshNode[];
     private nodeTree;
@@ -1736,182 +1661,6 @@ declare class DeadEndSolver extends BaseSolver {
     visualize(): GraphicsObject;
 }
 
-/**
- * ObstacleTree wraps different spatial index implementations:
- * - 'native': original spatial-hash grid
- * - 'rbush': dynamic R-tree via rbush
- * - 'flatbush': static index via flatbush
- */
-declare class ObstacleSpatialHashIndex {
-    private idx;
-    private storage;
-    constructor(implementation?: "native" | "rbush" | "flatbush", obstacles?: Obstacle[]);
-    insert(o: Obstacle): void;
-    search(bbox: {
-        minX: number;
-        minY: number;
-        maxX: number;
-        maxY: number;
-    }): Obstacle[];
-    searchArea(centerX: number, centerY: number, width: number, height: number): Obstacle[];
-}
-
-interface Point {
-    x: number;
-    y: number;
-    z: number;
-}
-type Point2D = {
-    x: number;
-    y: number;
-};
-type HighDensityIntraNodeRoute = {
-    connectionName: string;
-    traceThickness: number;
-    viaDiameter: number;
-    route: Array<{
-        x: number;
-        y: number;
-        z: number;
-    }>;
-    vias: Array<{
-        x: number;
-        y: number;
-    }>;
-};
-type HighDensityRoute = HighDensityIntraNodeRoute;
-declare class HighDensityRouteSpatialIndex {
-    private segmentBuckets;
-    private viaBuckets;
-    private routes;
-    private CELL_SIZE;
-    constructor(routes: HighDensityRoute[], cellSize?: number);
-    /**
-     * Finds routes that potentially conflict with a given line segment within a margin.
-     * Checks both segments and vias.
-     * @param segmentStart Start point of the query segment.
-     * @param segmentEnd End point of the query segment.
-     * @param margin The minimum required clearance distance from the query segment's centerline.
-     * @returns An array of conflicting routes and their minimum distance to the segment.
-     */
-    getConflictingRoutesForSegment(segmentStart: Point, // Keep Point for original Z data if needed elsewhere
-    segmentEnd: Point, margin: number): Array<{
-        conflictingRoute: HighDensityRoute;
-        distance: number;
-    }>;
-    /**
-     * Finds routes that pass near a given point within a margin.
-     * Checks both segments and vias.
-     * @param point The query point {x, y}. Z is ignored.
-     * @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, margin: number): Array<{
-        conflictingRoute: HighDensityRoute;
-        distance: number;
-    }>;
-}
-
-interface RouteSection {
-    startIndex: number;
-    endIndex: number;
-    z: number;
-    points: HighDensityRoute["route"];
-}
-declare class SingleRouteUselessViaRemovalSolver extends BaseSolver {
-    obstacleSHI: ObstacleSpatialHashIndex;
-    hdRouteSHI: HighDensityRouteSpatialIndex;
-    unsimplifiedRoute: HighDensityRoute;
-    routeSections: Array<RouteSection>;
-    currentSectionIndex: number;
-    TRACE_THICKNESS: number;
-    OBSTACLE_MARGIN: number;
-    constructor(params: {
-        obstacleSHI: ObstacleSpatialHashIndex;
-        hdRouteSHI: HighDensityRouteSpatialIndex;
-        unsimplifiedRoute: HighDensityRoute;
-    });
-    breakRouteIntoSections(route: HighDensityRoute): never[] | this["routeSections"];
-    _step(): void;
-    canSectionMoveToLayer({ currentSection, targetZ, }: {
-        currentSection: RouteSection;
-        targetZ: number;
-    }): boolean;
-    getConstructorParams(): {
-        obstacleSHI: ObstacleSpatialHashIndex;
-        hdRouteSHI: HighDensityRouteSpatialIndex;
-        unsimplifiedRoute: HighDensityIntraNodeRoute;
-    };
-    getOptimizedHdRoute(): HighDensityRoute;
-    visualize(): GraphicsObject;
-}
-
-interface UselessViaRemovalSolverInput {
-    unsimplifiedHdRoutes: HighDensityRoute$1[];
-    obstacles: Obstacle[];
-    colorMap: Record<string, string>;
-    layerCount: number;
-}
-declare class UselessViaRemovalSolver extends BaseSolver {
-    private input;
-    unsimplifiedHdRoutes: HighDensityRoute$1[];
-    optimizedHdRoutes: HighDensityRoute$1[];
-    unprocessedRoutes: HighDensityRoute$1[];
-    activeSubSolver?: SingleRouteUselessViaRemovalSolver | null | undefined;
-    obstacleSHI: ObstacleSpatialHashIndex | null;
-    hdRouteSHI: HighDensityRouteSpatialIndex | null;
-    constructor(input: UselessViaRemovalSolverInput);
-    _step(): void;
-    getOptimizedHdRoutes(): HighDensityRoute$1[] | null;
-    visualize(): GraphicsObject;
-}
-
-interface SameNetViaMergerSolverInput {
-    inputHdRoutes: HighDensityRoute$1[];
-    obstacles: Obstacle[];
-    colorMap: Record<string, string>;
-    layerCount: number;
-    connMap?: ConnectivityMap;
-    outline?: Array<{
-        x: number;
-        y: number;
-    }>;
-}
-type Via = {
-    x: number;
-    y: number;
-    diameter: number;
-    net: string;
-    routeIndex: number;
-    layers: number[];
-};
-declare class SameNetViaMergerSolver extends BaseSolver {
-    private input;
-    inputHdRoutes: HighDensityRoute$1[];
-    mergedViaHdRoutes: HighDensityRoute$1[];
-    unprocessedRoutes: HighDensityRoute$1[];
-    vias: Via[];
-    offendingVias: [Via, Via][];
-    currentViaRoutes: HighDensityIntraNodeRoute$1[];
-    connMap?: ConnectivityMap;
-    colorMap: Record<string, string>;
-    outline?: Array<{
-        x: number;
-        y: number;
-    }>;
-    obstacles: Obstacle[];
-    viasByNet: Map<string, Via[]>;
-    obstacleSHI: ObstacleSpatialHashIndex | null;
-    hdRouteSHI: HighDensityRouteSpatialIndex | null;
-    constructor(input: SameNetViaMergerSolverInput);
-    private rebuildVias;
-    private findNextOffendingPair;
-    private handleOffendingPair;
-    _step(): void;
-    getMergedViaHdRoutes(): HighDensityRoute$1[] | null;
-    visualize(): GraphicsObject;
-}
-
 /**
  * A Disjoint Set Union (DSU) or Union-Find data structure.
  * It tracks a collection of disjoint sets and can efficiently merge them.
@@ -1966,6 +1715,61 @@ declare class NetToPointPairsSolver2_OffBoardConnection extends NetToPointPairsS
     _step(): void;
 }
 
+/**
+ * TraceSimplificationSolver consolidates trace optimization by iteratively applying
+ * via removal, via merging, and path simplification phases. It reduces redundant vias
+ * and simplifies routing paths through configurable iterations.
+ *
+ * The solver operates in three alternating phases per iteration:
+ * 1. "via_removal" - Removes unnecessary vias from routes using UselessViaRemovalSolver
+ * 2. "via_merging" - Merges redundant vias on the same net using SameNetViaMergerSolver
+ * 3. "path_simplification" - Simplifies routing paths using MultiSimplifiedPathSolver
+ *
+ * Each iteration consists of all phases executed sequentially.
+ */
+declare class TraceSimplificationSolver extends BaseSolver {
+    private simplificationConfig;
+    /** The current state of high-density routes being progressively simplified */
+    private hdRoutes;
+    /** Current iteration count (0-indexed) */
+    private currentRun;
+    /** Total number of iterations to run (each iteration includes all phases) */
+    private totalIterations;
+    /** Current phase of simplification being executed */
+    private currentPhase;
+    /** Callback to extract results from the active sub-solver */
+    private extractResult;
+    /** Returns the simplified routes. This is the primary output of the solver. */
+    get simplifiedHdRoutes(): HighDensityRoute$1[];
+    /**
+     * Creates a new TraceSimplificationSolver
+     * @param simplificationConfig Configuration object containing:
+     *   - hdRoutes: Initial high-density routes to simplify
+     *   - obstacles: Board obstacles to avoid during simplification
+     *   - connMap: Connectivity map for routing validation
+     *   - colorMap: Mapping of net names to colors for visualization
+     *   - outline: Optional board outline boundary
+     *   - defaultViaDiameter: Default diameter for vias
+     *   - layerCount: Number of routing layers
+     *   - iterations: Number of complete simplification iterations (default: 2)
+     */
+    constructor(simplificationConfig: {
+        hdRoutes: HighDensityRoute$1[];
+        obstacles: Obstacle[];
+        connMap: ConnectivityMap;
+        colorMap: Record<string, string>;
+        outline?: Array<{
+            x: number;
+            y: number;
+        }>;
+        defaultViaDiameter: number;
+        layerCount: number;
+        iterations?: number;
+    });
+    _step(): void;
+    visualize(): GraphicsObject;
+}
+
 interface CapacityMeshSolverOptions$1 {
     capacityDepth?: number;
     targetMinCapacity?: number;
@@ -1996,11 +1800,7 @@ declare class AutoroutingPipelineSolver extends BaseSolver {
     singleLayerNodeMerger?: SingleLayerNodeMergerSolver;
     strawSolver?: StrawSolver;
     deadEndSolver?: DeadEndSolver;
-    uselessViaRemovalSolver1?: UselessViaRemovalSolver;
-    uselessViaRemovalSolver2?: UselessViaRemovalSolver;
-    sameNetViaMerger?: SameNetViaMergerSolver;
-    multiSimplifiedPathSolver1?: MultiSimplifiedPathSolver;
-    multiSimplifiedPathSolver2?: MultiSimplifiedPathSolver;
+    traceSimplificationSolver?: TraceSimplificationSolver;
     viaDiameter: number;
     minTraceWidth: number;
     startTimeOfPhase: Record<string, number>;
@@ -2012,7 +1812,7 @@ declare class AutoroutingPipelineSolver extends BaseSolver {
     capacityNodes: CapacityMeshNode[] | null;
     capacityEdges: CapacityMeshEdge[] | null;
     cacheProvider: CacheProvider | null;
-    pipelineDef: (PipelineStep$1<typeof NetToPointPairsSolver2_OffBoardConnection> | PipelineStep$1<typeof RectDiffSolver> | PipelineStep$1<typeof StrawSolver> | PipelineStep$1<typeof CapacityMeshEdgeSolver2_NodeTreeOptimization> | PipelineStep$1<typeof DeadEndSolver> | PipelineStep$1<typeof CapacityPathingGreedySolver> | PipelineStep$1<typeof CapacityPathingMultiSectionSolver> | PipelineStep$1<typeof CapacityEdgeToPortSegmentSolver> | PipelineStep$1<typeof CapacitySegmentToPointSolver> | PipelineStep$1<typeof UnravelMultiSectionSolver> | PipelineStep$1<typeof HighDensitySolver> | PipelineStep$1<typeof MultipleHighDensityRouteStitchSolver> | PipelineStep$1<typeof UselessViaRemovalSolver> | PipelineStep$1<typeof MultiSimplifiedPathSolver> | PipelineStep$1<typeof SameNetViaMergerSolver>)[];
+    pipelineDef: (PipelineStep$1<typeof NetToPointPairsSolver2_OffBoardConnection> | PipelineStep$1<typeof RectDiffSolver> | PipelineStep$1<typeof StrawSolver> | PipelineStep$1<typeof CapacityMeshEdgeSolver2_NodeTreeOptimization> | PipelineStep$1<typeof DeadEndSolver> | PipelineStep$1<typeof CapacityPathingGreedySolver> | PipelineStep$1<typeof CapacityPathingMultiSectionSolver> | PipelineStep$1<typeof CapacityEdgeToPortSegmentSolver> | PipelineStep$1<typeof CapacitySegmentToPointSolver> | PipelineStep$1<typeof UnravelMultiSectionSolver> | PipelineStep$1<typeof HighDensitySolver> | PipelineStep$1<typeof MultipleHighDensityRouteStitchSolver> | PipelineStep$1<typeof TraceSimplificationSolver>)[];
     constructor(srj: SimpleRouteJson, opts?: CapacityMeshSolverOptions$1);
     currentPipelineStepIndex: number;
     _step(): void;
@@ -2173,6 +1973,26 @@ declare function getGlobalLocalStorageCache(): LocalStorageCache;
 declare function getGlobalInMemoryCache(): InMemoryCache;
 declare function setupGlobalCaches(): void;
 
+/**
+ * ObstacleTree wraps different spatial index implementations:
+ * - 'native': original spatial-hash grid
+ * - 'rbush': dynamic R-tree via rbush
+ * - 'flatbush': static index via flatbush
+ */
+declare class ObstacleSpatialHashIndex {
+    private idx;
+    private storage;
+    constructor(implementation?: "native" | "rbush" | "flatbush", obstacles?: Obstacle[]);
+    insert(o: Obstacle): void;
+    search(bbox: {
+        minX: number;
+        minY: number;
+        maxX: number;
+        maxY: number;
+    }): Obstacle[];
+    searchArea(centerX: number, centerY: number, width: number, height: number): Obstacle[];
+}
+
 interface Target$1 {
     x: number;
     y: number;
@@ -2391,6 +2211,191 @@ declare class AssignableViaNodeMergerSolver extends BaseSolver {
     visualize(): GraphicsObject;
 }
 
+interface Point$1 {
+    x: number;
+    y: number;
+    z: number;
+}
+declare class SingleSimplifiedPathSolver extends BaseSolver {
+    newRoute: HighDensityIntraNodeRoute$1["route"];
+    newVias: HighDensityIntraNodeRoute$1["vias"];
+    headIndex: number;
+    tailIndex: number;
+    inputRoute: HighDensityIntraNodeRoute$1;
+    otherHdRoutes: HighDensityIntraNodeRoute$1[];
+    obstacles: Obstacle[];
+    connMap: ConnectivityMap;
+    colorMap: Record<string, string>;
+    outline?: Array<{
+        x: number;
+        y: number;
+    }>;
+    constructor(params: {
+        inputRoute: HighDensityIntraNodeRoute$1;
+        otherHdRoutes: HighDensityIntraNodeRoute$1[];
+        obstacles: Obstacle[];
+        connMap: ConnectivityMap;
+        colorMap: Record<string, string>;
+        outline?: Array<{
+            x: number;
+            y: number;
+        }>;
+    });
+    getConstructorParams(): {
+        inputRoute: HighDensityIntraNodeRoute$1;
+        otherHdRoutes: HighDensityIntraNodeRoute$1[];
+        obstacles: Obstacle[];
+        connMap: Record<string, string[]>;
+        colorMap: Record<string, string>;
+        outline: {
+            x: number;
+            y: number;
+        }[] | undefined;
+    };
+    get simplifiedRoute(): HighDensityIntraNodeRoute$1;
+    isValidPath(pointsInRoute: Point$1[]): boolean;
+    _step(): void;
+    getVisualsForNewRouteAndObstacles(): GraphicsObject & Pick<Required<GraphicsObject>, "points" | "lines" | "rects" | "circles">;
+}
+
+declare class MultiSimplifiedPathSolver extends BaseSolver {
+    simplifiedHdRoutes: HighDensityIntraNodeRoute$1[];
+    currentUnsimplifiedHdRouteIndex: number;
+    activeSubSolver: SingleSimplifiedPathSolver | null;
+    unsimplifiedHdRoutes: HighDensityIntraNodeRoute$1[];
+    obstacles: Obstacle[];
+    connMap: ConnectivityMap;
+    colorMap: Record<string, string>;
+    outline?: Array<{
+        x: number;
+        y: number;
+    }>;
+    defaultViaDiameter: number;
+    constructor(params: {
+        unsimplifiedHdRoutes: HighDensityIntraNodeRoute$1[];
+        obstacles: Obstacle[];
+        connMap?: ConnectivityMap;
+        colorMap?: Record<string, string>;
+        outline?: Array<{
+            x: number;
+            y: number;
+        }>;
+        defaultViaDiameter?: number;
+    });
+    _step(): void;
+    visualize(): GraphicsObject;
+}
+
+interface Point {
+    x: number;
+    y: number;
+    z: number;
+}
+type Point2D = {
+    x: number;
+    y: number;
+};
+type HighDensityIntraNodeRoute = {
+    connectionName: string;
+    traceThickness: number;
+    viaDiameter: number;
+    route: Array<{
+        x: number;
+        y: number;
+        z: number;
+    }>;
+    vias: Array<{
+        x: number;
+        y: number;
+    }>;
+};
+type HighDensityRoute = HighDensityIntraNodeRoute;
+declare class HighDensityRouteSpatialIndex {
+    private segmentBuckets;
+    private viaBuckets;
+    private routes;
+    private CELL_SIZE;
+    constructor(routes: HighDensityRoute[], cellSize?: number);
+    /**
+     * Finds routes that potentially conflict with a given line segment within a margin.
+     * Checks both segments and vias.
+     * @param segmentStart Start point of the query segment.
+     * @param segmentEnd End point of the query segment.
+     * @param margin The minimum required clearance distance from the query segment's centerline.
+     * @returns An array of conflicting routes and their minimum distance to the segment.
+     */
+    getConflictingRoutesForSegment(segmentStart: Point, // Keep Point for original Z data if needed elsewhere
+    segmentEnd: Point, margin: number): Array<{
+        conflictingRoute: HighDensityRoute;
+        distance: number;
+    }>;
+    /**
+     * Finds routes that pass near a given point within a margin.
+     * Checks both segments and vias.
+     * @param point The query point {x, y}. Z is ignored.
+     * @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, margin: number): Array<{
+        conflictingRoute: HighDensityRoute;
+        distance: number;
+    }>;
+}
+
+interface RouteSection {
+    startIndex: number;
+    endIndex: number;
+    z: number;
+    points: HighDensityRoute["route"];
+}
+declare class SingleRouteUselessViaRemovalSolver extends BaseSolver {
+    obstacleSHI: ObstacleSpatialHashIndex;
+    hdRouteSHI: HighDensityRouteSpatialIndex;
+    unsimplifiedRoute: HighDensityRoute;
+    routeSections: Array<RouteSection>;
+    currentSectionIndex: number;
+    TRACE_THICKNESS: number;
+    OBSTACLE_MARGIN: number;
+    constructor(params: {
+        obstacleSHI: ObstacleSpatialHashIndex;
+        hdRouteSHI: HighDensityRouteSpatialIndex;
+        unsimplifiedRoute: HighDensityRoute;
+    });
+    breakRouteIntoSections(route: HighDensityRoute): never[] | this["routeSections"];
+    _step(): void;
+    canSectionMoveToLayer({ currentSection, targetZ, }: {
+        currentSection: RouteSection;
+        targetZ: number;
+    }): boolean;
+    getConstructorParams(): {
+        obstacleSHI: ObstacleSpatialHashIndex;
+        hdRouteSHI: HighDensityRouteSpatialIndex;
+        unsimplifiedRoute: HighDensityIntraNodeRoute;
+    };
+    getOptimizedHdRoute(): HighDensityRoute;
+    visualize(): GraphicsObject;
+}
+
+interface UselessViaRemovalSolverInput {
+    unsimplifiedHdRoutes: HighDensityRoute$1[];
+    obstacles: Obstacle[];
+    colorMap: Record<string, string>;
+    layerCount: number;
+}
+declare class UselessViaRemovalSolver extends BaseSolver {
+    private input;
+    unsimplifiedHdRoutes: HighDensityRoute$1[];
+    optimizedHdRoutes: HighDensityRoute$1[];
+    unprocessedRoutes: HighDensityRoute$1[];
+    activeSubSolver?: SingleRouteUselessViaRemovalSolver | null | undefined;
+    obstacleSHI: ObstacleSpatialHashIndex | null;
+    hdRouteSHI: HighDensityRouteSpatialIndex | null;
+    constructor(input: UselessViaRemovalSolverInput);
+    _step(): void;
+    getOptimizedHdRoutes(): HighDensityRoute$1[] | null;
+    visualize(): GraphicsObject;
+}
+
 type Candidate = {
     prevCandidate: Candidate | null;
     node: CapacityMeshNode;