@tscircuit/capacity-autorouter 0.0.798 → 0.0.800

package/dist/index.d.ts

@@ -1147,16 +1147,6 @@ type Node = {
 declare class SingleRouteCandidatePriorityQueue<T extends Node = Node> {
     private heap;
     constructor(nodes: T[]);
-    private getLeftChildIndex;
-    private getRightChildIndex;
-    private getParentIndex;
-    private hasLeftChild;
-    private hasRightChild;
-    private hasParent;
-    private leftChild;
-    private rightChild;
-    private parent;
-    private swap;
     dequeue(): T | null;
     peek(): T | null;
     enqueue(item: T): void;
@@ -1218,7 +1208,15 @@ declare class SingleHighDensityRouteSolver extends BaseSolver {
     VIA_PENALTY_FACTOR: number;
     CELL_SIZE_FACTOR: number;
     NEARBY_SEGMENT_CLEARANCE: number;
-    exploredNodes: Set<string>;
+    exploredNodes: Set<number>;
+    viasInPathByNode: WeakMap<Node, {
+        x: number;
+        y: number;
+    }[]>;
+    gridMinXIndex: number;
+    gridMinYIndex: number;
+    gridWidth: number;
+    gridHeight: number;
     candidates: SingleRouteCandidatePriorityQueue;
     connectionName: string;
     rootConnectionName?: string;
@@ -1229,12 +1227,19 @@ declare class SingleHighDensityRouteSolver extends BaseSolver {
     connMap?: ConnectivityMap;
     obstacleSegments: IndexedObstacleSegment[];
     obstacleSegmentIndex: Flatbush | null;
+    obstacleSegmentsByLayer: Map<number, IndexedObstacleSegment[]>;
+    obstacleSegmentIndexByLayer: Map<number, Flatbush>;
     obstacleVias: IndexedObstacleVia[];
     obstacleViaIndex: Flatbush | null;
     /** For debugging/animating the exploration */
-    debug_exploredNodesOrdered: string[];
-    debug_nodesTooCloseToObstacle: Set<string>;
-    debug_nodePathToParentIntersectsObstacle: Set<string>;
+    debug_exploredNodesOrdered: Array<{
+        key: number;
+        x: number;
+        y: number;
+        z: number;
+    }>;
+    debug_nodesTooCloseToObstacle: Set<number>;
+    debug_nodePathToParentIntersectsObstacle: Set<number>;
     debugEnabled: boolean;
     initialNodeGridOffset: {
         x: number;
@@ -1271,17 +1276,20 @@ declare class SingleHighDensityRouteSolver extends BaseSolver {
         hyperParameters?: Partial<HighDensityHyperParameters>;
         connMap?: ConnectivityMap;
         nearbySegmentClearance?: number;
+        captureSearchDebug?: boolean;
     });
     handleSimpleCases(): void;
     get viaPenaltyDistance(): number;
-    isNodeTooCloseToObstacle(node: Node, margin?: number, isVia?: boolean): boolean;
+    isNodeTooCloseToObstacle(node: Node, margin?: number, isVia?: boolean, planarObstacleQuery?: PlanarObstacleQuery): boolean;
     isNodeTooCloseToEdge(node: Node, isVia?: boolean): boolean;
-    doesPathToParentIntersectObstacle(node: Node): boolean;
+    doesPathToParentIntersectObstacle(node: Node, planarObstacleQuery?: PlanarObstacleQuery): boolean;
+    getPlanarObstacleQuery(node: Node): PlanarObstacleQuery | undefined;
     buildObstacleIndexes(): void;
     computeH(node: Node): number;
     computeG(node: Node): number;
     computeF(g: number, h: number): number;
-    getNodeKey(node: Node): string;
+    setNodeCosts(node: Node): void;
+    getNodeKey(node: Node): number;
     getNeighbors(node: Node): Node[];
     getNodePath(node: Node): Node[];
     getViasInNodePath(node: Node): {
@@ -1289,7 +1297,7 @@ declare class SingleHighDensityRouteSolver extends BaseSolver {
         y: number;
     }[];
     setSolvedPath(node: Node): void;
-    computeProgress(currentNode: Node, goalDist: number, isOnLayer: boolean): number;
+    computeProgress(currentNode?: Node, goalDist?: number, isOnLayer?: boolean): number;
     _step(): void;
     visualize(): GraphicsObject;
 }
@@ -1305,12 +1313,20 @@ type IndexedObstacleSegment = {
         y: number;
         z: number;
     };
+    minX: number;
+    minY: number;
+    maxX: number;
+    maxY: number;
     connectedToCurrentConnection: boolean;
 };
 type IndexedObstacleVia = {
     x: number;
     y: number;
 };
+type PlanarObstacleQuery = {
+    segments: IndexedObstacleSegment[];
+    segmentIds: number[];
+};
 
 type ConnectionPoint = {
     x: number;
@@ -1340,6 +1356,7 @@ declare class IntraNodeRouteSolver extends BaseSolver {
     viaDiameter: number;
     traceWidth: number;
     obstacleMargin: number;
+    captureSearchDebug: boolean;
     rerouteAttemptsByConnection: Map<string, number>;
     POSTROUTE_VIA_TRACE_CLEARANCE: number;
     MAX_POSTROUTE_REPAIR_ATTEMPTS: number;
@@ -1355,6 +1372,7 @@ declare class IntraNodeRouteSolver extends BaseSolver {
         viaDiameter?: number;
         traceWidth?: number;
         obstacleMargin?: number;
+        captureSearchDebug?: boolean;
         obstacles?: Obstacle[];
         layerCount?: number;
     });
@@ -1878,6 +1896,7 @@ declare class HighDensitySolver extends BaseSolver {
     preserveTerminalPcbPortIds: boolean;
     growShrinkMaxInnerIterationsPerGrowthAttempt?: number;
     growShrinkFallbackToInvalidGeometryOnFailure: boolean;
+    captureSearchDebug: boolean;
     failedSolvers: HighDensityIntraNodeSolver[];
     activeSubSolver: HighDensityIntraNodeSolver | null;
     connMap?: ConnectivityMap;
@@ -1891,7 +1910,7 @@ declare class HighDensitySolver extends BaseSolver {
         nodePf: number | null;
         error?: string;
     }>;
-    constructor({ nodePortPoints, colorMap, connMap, viaDiameter, traceWidth, obstacleMargin, effort, nodePfById, obstacles, layerCount, useGrowShrinkHighDensityIntraNodeSolver, preserveTerminalPcbPortIds, growShrinkMaxInnerIterationsPerGrowthAttempt, growShrinkFallbackToInvalidGeometryOnFailure, }: {
+    constructor({ nodePortPoints, colorMap, connMap, viaDiameter, traceWidth, obstacleMargin, effort, nodePfById, obstacles, layerCount, useGrowShrinkHighDensityIntraNodeSolver, preserveTerminalPcbPortIds, growShrinkMaxInnerIterationsPerGrowthAttempt, growShrinkFallbackToInvalidGeometryOnFailure, captureSearchDebug, }: {
         nodePortPoints: NodeWithPortPoints[];
         colorMap?: Record<string, string>;
         connMap?: ConnectivityMap;
@@ -1905,6 +1924,7 @@ declare class HighDensitySolver extends BaseSolver {
         preserveTerminalPcbPortIds?: boolean;
         growShrinkMaxInnerIterationsPerGrowthAttempt?: number;
         growShrinkFallbackToInvalidGeometryOnFailure?: boolean;
+        captureSearchDebug?: boolean;
         nodePfById?: Map<CapacityMeshNodeId, number | null> | Record<string, number | null>;
     });
     private getSolvedNodeSolverType;
@@ -5041,6 +5061,14 @@ type ChangedPreloadedTraceSection = {
 declare class TinyHypergraphPortPointPathingSolver extends BaseSolver {
     private params;
     private tinyPipelineSolver;
+    private primaryTinyPipelineSolver?;
+    private alternativeTinyPipelineSolver?;
+    private alternativeTinyPipelineInput?;
+    private candidatePortfolioPhase;
+    private primaryCandidateSummary?;
+    private alternativeCandidateSummary?;
+    private alternativeCandidateEvaluated;
+    private selectedCandidate;
     private duplicateCongestedPortReport?;
     private duplicateCongestedPortError?;
     private duplicatedPortCount;
@@ -5050,8 +5078,18 @@ declare class TinyHypergraphPortPointPathingSolver extends BaseSolver {
     private rootConnectionNameByConnectionId;
     constructor(params: HgPortPointPathingSolverParams);
     getSolverName(): string;
+    private summarizePipelineCandidate;
+    private shouldEvaluateAlternative;
+    private shouldSelectAlternative;
+    private finishCandidatePortfolio;
     getSolveGraphBenchmarkMetrics(): {
         routeCount: number;
+        traceDensityCandidateEvaluated: boolean;
+        traceDensityCandidateSelected: boolean;
+        downstreamNodePfSum: number | undefined;
+        downstreamNodePfSquaredSum: number | undefined;
+        downstreamNodePfMax: number | undefined;
+        downstreamSquaredNodePortPointCount: number | undefined;
         iterations: number;
         timeMs: number;
         ripCount: any;
@@ -5069,6 +5107,8 @@ declare class TinyHypergraphPortPointPathingSolver extends BaseSolver {
         bestSolvedSquaredRegionSegmentCount: any;
         finalMaxRegionSegmentCount: number;
         finalSquaredRegionSegmentCount: number;
+        finalSegmentCount: number | undefined;
+        finalLayerChangeCount: number | undefined;
         warmupFullRipAttempts: any;
         complexityAwareSelection: any;
         targetReached: any;
@@ -7378,7 +7418,7 @@ declare class SingleHighDensityRouteWithJumpersSolver extends BaseSolver {
     getNeighbors(node: JumperNode): JumperNode[];
     getNodePath(node: JumperNode): JumperNode[];
     setSolvedPath(node: JumperNode): void;
-    computeProgress(currentNode: JumperNode, goalDist: number): number;
+    computeProgress(currentNode?: JumperNode, goalDist?: number): number;
     _step(): void;
     /**
      * Draw the two pads of an 0603 jumper