@tscircuit/capacity-autorouter 0.0.48 → 0.0.50

package/dist/index.d.ts

@@ -125,7 +125,7 @@ declare class CapacityMeshEdgeSolver extends BaseSolver {
 }
 
 type BucketCoordinate$1 = `${number}x${number}`;
-declare class ObstacleTree {
+declare class ObstacleSpatialHashIndex {
     obstacles: Obstacle[];
     buckets: Map<BucketCoordinate$1, [Obstacle, number][]>;
     CELL_SIZE: number;
@@ -181,7 +181,7 @@ declare class CapacityMeshNodeSolver extends BaseSolver {
     MAX_DEPTH: number;
     targets: Target[];
     targetTree: TargetTree;
-    obstacleTree: ObstacleTree;
+    obstacleTree: ObstacleSpatialHashIndex;
     constructor(srj: SimpleRouteJson, opts?: CapacityMeshNodeSolverOptions$1);
     computeTargets(): Target[];
     _nextNodeCounter: number;
@@ -385,7 +385,7 @@ type NodeWithPortPoints = {
  *
  * z must be an integer
  */
-type HighDensityIntraNodeRoute = {
+type HighDensityIntraNodeRoute$1 = {
     connectionName: string;
     traceThickness: number;
     viaDiameter: number;
@@ -399,7 +399,7 @@ type HighDensityIntraNodeRoute = {
         y: number;
     }>;
 };
-type HighDensityRoute = HighDensityIntraNodeRoute;
+type HighDensityRoute$1 = HighDensityIntraNodeRoute$1;
 
 interface SegmentWithAssignedPoints extends NodePortSegment {
     assignedPoints?: {
@@ -511,7 +511,7 @@ type FutureConnection = {
     }[];
 };
 declare class SingleHighDensityRouteSolver extends BaseSolver {
-    obstacleRoutes: HighDensityIntraNodeRoute[];
+    obstacleRoutes: HighDensityIntraNodeRoute$1[];
     bounds: {
         minX: number;
         maxX: number;
@@ -550,7 +550,7 @@ declare class SingleHighDensityRouteSolver extends BaseSolver {
     exploredNodes: Set<string>;
     candidates: SingleRouteCandidatePriorityQueue;
     connectionName: string;
-    solvedPath: HighDensityIntraNodeRoute | null;
+    solvedPath: HighDensityIntraNodeRoute$1 | null;
     futureConnections: FutureConnection[];
     hyperParameters: Partial<HighDensityHyperParameters>;
     connMap?: ConnectivityMap;
@@ -561,7 +561,7 @@ declare class SingleHighDensityRouteSolver extends BaseSolver {
     debugEnabled: boolean;
     constructor(opts: {
         connectionName: string;
-        obstacleRoutes: HighDensityIntraNodeRoute[];
+        obstacleRoutes: HighDensityIntraNodeRoute$1[];
         minDistBetweenEnteringPoints: number;
         bounds: {
             minX: number;
@@ -620,7 +620,7 @@ declare class IntraNodeRouteSolver extends BaseSolver {
         }[];
     }[];
     totalConnections: number;
-    solvedRoutes: HighDensityIntraNodeRoute[];
+    solvedRoutes: HighDensityIntraNodeRoute$1[];
     failedSubSolvers: SingleHighDensityRouteSolver[];
     hyperParameters: Partial<HighDensityHyperParameters>;
     minDistBetweenEnteringPoints: number;
@@ -675,14 +675,14 @@ declare class HyperParameterSupervisorSolver<T extends BaseSolver> extends BaseS
     visualize(): GraphicsObject;
 }
 
-type Point$1 = {
+type Point$2 = {
     x: number;
     y: number;
     z?: number;
 };
 type Route = {
-    startPort: Point$1;
-    endPort: Point$1;
+    startPort: Point$2;
+    endPort: Point$2;
     connectionName: string;
 };
 declare class TwoCrossingRoutesHighDensitySolver extends BaseSolver {
@@ -693,10 +693,10 @@ declare class TwoCrossingRoutesHighDensitySolver extends BaseSolver {
     obstacleMargin: number;
     layerCount: number;
     debugViaPositions: {
-        via1: Point$1;
-        via2: Point$1;
+        via1: Point$2;
+        via2: Point$2;
     }[];
-    solvedRoutes: HighDensityIntraNodeRoute[];
+    solvedRoutes: HighDensityIntraNodeRoute$1[];
     bounds: {
         minX: number;
         maxX: number;
@@ -748,12 +748,12 @@ declare class TwoCrossingRoutesHighDensitySolver extends BaseSolver {
     /**
      * Get the solved routes
      */
-    getSolvedRoutes(): HighDensityIntraNodeRoute[];
+    getSolvedRoutes(): HighDensityIntraNodeRoute$1[];
 }
 
 declare class HyperSingleIntraNodeSolver extends HyperParameterSupervisorSolver<IntraNodeRouteSolver | TwoCrossingRoutesHighDensitySolver> {
     constructorParams: ConstructorParameters<typeof IntraNodeRouteSolver>[0];
-    solvedRoutes: HighDensityIntraNodeRoute[];
+    solvedRoutes: HighDensityIntraNodeRoute$1[];
     nodeWithPortPoints: NodeWithPortPoints;
     constructor(opts: ConstructorParameters<typeof IntraNodeRouteSolver>[0]);
     getCombinationDefs(): string[][];
@@ -811,7 +811,7 @@ declare class HyperSingleIntraNodeSolver extends HyperParameterSupervisorSolver<
 
 declare class HighDensitySolver extends BaseSolver {
     unsolvedNodePortPoints: NodeWithPortPoints[];
-    routes: HighDensityIntraNodeRoute[];
+    routes: HighDensityIntraNodeRoute$1[];
     colorMap: Record<string, string>;
     readonly defaultViaDiameter = 0.6;
     readonly defaultTraceThickness = 0.15;
@@ -1008,8 +1008,8 @@ declare class NetToPointPairsSolver extends BaseSolver {
 }
 
 declare class SingleHighDensityRouteStitchSolver extends BaseSolver {
-    mergedHdRoute: HighDensityIntraNodeRoute;
-    remainingHdRoutes: HighDensityIntraNodeRoute[];
+    mergedHdRoute: HighDensityIntraNodeRoute$1;
+    remainingHdRoutes: HighDensityIntraNodeRoute$1[];
     start: {
         x: number;
         y: number;
@@ -1022,7 +1022,7 @@ declare class SingleHighDensityRouteStitchSolver extends BaseSolver {
     };
     constructor(opts: {
         connectionName?: string;
-        hdRoutes: HighDensityIntraNodeRoute[];
+        hdRoutes: HighDensityIntraNodeRoute$1[];
         start: {
             x: number;
             y: number;
@@ -1040,7 +1040,7 @@ declare class SingleHighDensityRouteStitchSolver extends BaseSolver {
 
 type UnsolvedRoute = {
     connectionName: string;
-    hdRoutes: HighDensityIntraNodeRoute[];
+    hdRoutes: HighDensityIntraNodeRoute$1[];
     start: {
         x: number;
         y: number;
@@ -1055,10 +1055,10 @@ type UnsolvedRoute = {
 declare class MultipleHighDensityRouteStitchSolver extends BaseSolver {
     unsolvedRoutes: UnsolvedRoute[];
     activeSolver: SingleHighDensityRouteStitchSolver | null;
-    mergedHdRoutes: HighDensityIntraNodeRoute[];
+    mergedHdRoutes: HighDensityIntraNodeRoute$1[];
     constructor(opts: {
         connections: SimpleRouteConnection[];
-        hdRoutes: HighDensityIntraNodeRoute[];
+        hdRoutes: HighDensityIntraNodeRoute$1[];
         layerCount: number;
     });
     _step(): void;
@@ -1371,51 +1371,51 @@ declare class SingleLayerNodeMergerSolver extends BaseSolver {
     visualize(): GraphicsObject;
 }
 
-interface Point {
+interface Point$1 {
     x: number;
     y: number;
     z: number;
 }
 declare class SingleSimplifiedPathSolver extends BaseSolver {
-    newRoute: HighDensityIntraNodeRoute["route"];
-    newVias: HighDensityIntraNodeRoute["vias"];
+    newRoute: HighDensityIntraNodeRoute$1["route"];
+    newVias: HighDensityIntraNodeRoute$1["vias"];
     headIndex: number;
     tailIndex: number;
-    inputRoute: HighDensityIntraNodeRoute;
-    otherHdRoutes: HighDensityIntraNodeRoute[];
+    inputRoute: HighDensityIntraNodeRoute$1;
+    otherHdRoutes: HighDensityIntraNodeRoute$1[];
     obstacles: Obstacle[];
     connMap: ConnectivityMap;
     colorMap: Record<string, string>;
     constructor(params: {
-        inputRoute: HighDensityIntraNodeRoute;
-        otherHdRoutes: HighDensityIntraNodeRoute[];
+        inputRoute: HighDensityIntraNodeRoute$1;
+        otherHdRoutes: HighDensityIntraNodeRoute$1[];
         obstacles: Obstacle[];
         connMap: ConnectivityMap;
         colorMap: Record<string, string>;
     });
     getConstructorParams(): {
-        inputRoute: HighDensityIntraNodeRoute;
-        otherHdRoutes: HighDensityIntraNodeRoute[];
+        inputRoute: HighDensityIntraNodeRoute$1;
+        otherHdRoutes: HighDensityIntraNodeRoute$1[];
         obstacles: Obstacle[];
         connMap: Record<string, string[]>;
         colorMap: Record<string, string>;
     };
-    get simplifiedRoute(): HighDensityIntraNodeRoute;
-    isValidPath(pointsInRoute: Point[]): boolean;
+    get simplifiedRoute(): HighDensityIntraNodeRoute$1;
+    isValidPath(pointsInRoute: Point$1[]): boolean;
     _step(): void;
     getVisualsForNewRouteAndObstacles(): Required<GraphicsObject>;
 }
 
 declare class MultiSimplifiedPathSolver extends BaseSolver {
-    simplifiedHdRoutes: HighDensityIntraNodeRoute[];
+    simplifiedHdRoutes: HighDensityIntraNodeRoute$1[];
     currentUnsimplifiedHdRouteIndex: number;
     activeSubSolver: SingleSimplifiedPathSolver | null;
-    unsimplifiedHdRoutes: HighDensityIntraNodeRoute[];
+    unsimplifiedHdRoutes: HighDensityIntraNodeRoute$1[];
     obstacles: Obstacle[];
     connMap: ConnectivityMap;
     colorMap: Record<string, string>;
     constructor(params: {
-        unsimplifiedHdRoutes: HighDensityIntraNodeRoute[];
+        unsimplifiedHdRoutes: HighDensityIntraNodeRoute$1[];
         obstacles: Obstacle[];
         connMap?: ConnectivityMap;
         colorMap?: Record<string, string>;
@@ -1428,6 +1428,111 @@ declare class CapacityMeshEdgeSolver2_NodeTreeOptimization extends CapacityMeshE
     step(): void;
 }
 
+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;
+    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 CapacityMeshSolverOptions {
     capacityDepth?: number;
     targetMinCapacity?: number;
@@ -1455,6 +1560,7 @@ declare class AutoroutingPipelineSolver extends BaseSolver {
     highDensityStitchSolver?: MultipleHighDensityRouteStitchSolver;
     singleLayerNodeMerger?: SingleLayerNodeMergerSolver;
     strawSolver?: StrawSolver;
+    uselessViaRemovalSolver?: UselessViaRemovalSolver;
     multiSimplifiedPathSolver?: MultiSimplifiedPathSolver;
     startTimeOfPhase: Record<string, number>;
     endTimeOfPhase: Record<string, number>;
@@ -1463,7 +1569,7 @@ declare class AutoroutingPipelineSolver extends BaseSolver {
     connMap: ConnectivityMap;
     srjWithPointPairs?: SimpleRouteJson;
     capacityNodes: CapacityMeshNode[] | null;
-    pipelineDef: (PipelineStep<typeof NetToPointPairsSolver> | PipelineStep<typeof CapacityMeshNodeSolver2_NodeUnderObstacle> | PipelineStep<typeof SingleLayerNodeMergerSolver> | PipelineStep<typeof StrawSolver> | PipelineStep<typeof CapacityMeshEdgeSolver2_NodeTreeOptimization> | PipelineStep<typeof CapacityPathingSolver5> | PipelineStep<typeof CapacityEdgeToPortSegmentSolver> | PipelineStep<typeof CapacitySegmentToPointSolver> | PipelineStep<typeof UnravelMultiSectionSolver> | PipelineStep<typeof HighDensitySolver> | PipelineStep<typeof MultipleHighDensityRouteStitchSolver> | PipelineStep<typeof MultiSimplifiedPathSolver>)[];
+    pipelineDef: (PipelineStep<typeof NetToPointPairsSolver> | PipelineStep<typeof CapacityMeshNodeSolver2_NodeUnderObstacle> | PipelineStep<typeof SingleLayerNodeMergerSolver> | PipelineStep<typeof StrawSolver> | PipelineStep<typeof CapacityMeshEdgeSolver2_NodeTreeOptimization> | PipelineStep<typeof CapacityPathingSolver5> | PipelineStep<typeof CapacityEdgeToPortSegmentSolver> | PipelineStep<typeof CapacitySegmentToPointSolver> | PipelineStep<typeof UnravelMultiSectionSolver> | PipelineStep<typeof HighDensitySolver> | PipelineStep<typeof MultipleHighDensityRouteStitchSolver> | PipelineStep<typeof UselessViaRemovalSolver> | PipelineStep<typeof MultiSimplifiedPathSolver>)[];
     constructor(srj: SimpleRouteJson, opts?: CapacityMeshSolverOptions);
     currentPipelineStepIndex: number;
     _step(): void;
@@ -1486,7 +1592,7 @@ declare class AutoroutingPipelineSolver extends BaseSolver {
      * @returns The original connection name (e.g. "connection1")
      */
     private getOriginalConnectionName;
-    _getOutputHdRoutes(): HighDensityRoute[];
+    _getOutputHdRoutes(): HighDensityRoute$1[];
     /**
      * Returns the SimpleRouteJson with routes converted to SimplifiedPcbTraces
      */