@tscircuit/capacity-autorouter 0.0.155 → 0.0.157

package/dist/index.d.ts

@@ -93,12 +93,16 @@ interface CapacityMeshNode {
     _targetConnectionName?: string;
     _strawNode?: boolean;
     _strawParentCapacityMeshNodeId?: CapacityMeshNodeId;
+    _isVirtualOffboard?: boolean;
+    _offboardNetName?: string;
     _adjacentNodeIds?: CapacityMeshNodeId[];
     _parent?: CapacityMeshNode;
 }
 interface CapacityMeshEdge {
     capacityMeshEdgeId: string;
     nodeIds: [CapacityMeshNodeId, CapacityMeshNodeId];
+    isOffboardEdge?: boolean;
+    offboardNetName?: string;
 }
 
 type CapacityPathId = string;
@@ -106,6 +110,10 @@ interface CapacityPath {
     capacityPathId: CapacityPathId;
     connectionName: string;
     nodeIds: CapacityMeshNodeId[];
+    /** True if this path was created by splitting at an offboard edge */
+    isFragmentedPath?: boolean;
+    /** MST pair connection name before fragmentation */
+    mstPairConnectionName?: string;
 }
 
 declare class BaseSolver {
@@ -1990,6 +1998,52 @@ declare class UselessViaRemovalSolver extends BaseSolver {
     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.
@@ -2076,6 +2130,7 @@ declare class AutoroutingPipelineSolver extends BaseSolver {
     deadEndSolver?: DeadEndSolver;
     uselessViaRemovalSolver1?: UselessViaRemovalSolver;
     uselessViaRemovalSolver2?: UselessViaRemovalSolver;
+    sameNetViaMerger?: SameNetViaMergerSolver;
     multiSimplifiedPathSolver1?: MultiSimplifiedPathSolver;
     multiSimplifiedPathSolver2?: MultiSimplifiedPathSolver;
     viaDiameter: number;
@@ -2089,7 +2144,7 @@ declare class AutoroutingPipelineSolver extends BaseSolver {
     capacityNodes: CapacityMeshNode[] | null;
     capacityEdges: CapacityMeshEdge[] | null;
     cacheProvider: CacheProvider | null;
-    pipelineDef: (PipelineStep$1<typeof NetToPointPairsSolver2_OffBoardConnection> | PipelineStep$1<typeof CapacityMeshNodeSolver2_NodeUnderObstacle> | PipelineStep$1<typeof SingleLayerNodeMergerSolver> | 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>)[];
+    pipelineDef: (PipelineStep$1<typeof NetToPointPairsSolver2_OffBoardConnection> | PipelineStep$1<typeof CapacityMeshNodeSolver2_NodeUnderObstacle> | PipelineStep$1<typeof SingleLayerNodeMergerSolver> | 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>)[];
     constructor(srj: SimpleRouteJson, opts?: CapacityMeshSolverOptions$1);
     currentPipelineStepIndex: number;
     _step(): void;
@@ -2441,6 +2496,83 @@ declare class HyperAssignableViaCapacityPathingSolver extends HyperParameterSupe
     generateSolver(hyperParameters: HyperParameterOverrides): AssignableViaCapacityPathingSolver_DirectiveSubOptimal;
 }
 
+/**
+ * Creates offboard edges between assignable via obstacles that share
+ * the same `offBoardConnectsTo` net name. These obstacles represent off-board
+ * connection points (like edge connectors) that are logically connected
+ * through external wiring.
+ *
+ * The solver finds all capacity nodes with `_assignedViaObstacle.offBoardConnectsTo`,
+ * groups them by net name, and creates zero-cost offboard edges between
+ * matching nodes. This allows the pathing solver to route through these virtual
+ * connections as if the obstacles were directly connected.
+ */
+declare class OffboardCapacityNodeSolver extends BaseSolver {
+    capacityNodes: CapacityMeshNode[];
+    capacityEdges: CapacityMeshEdge[];
+    enhancedEdges: CapacityMeshEdge[];
+    private animationState;
+    private assignableNodes;
+    private shownNodes;
+    private pendingEdges;
+    private createdEdges;
+    private nextEdgeId;
+    private nodeMap;
+    constructor(solverParams: {
+        capacityNodes: CapacityMeshNode[];
+        capacityEdges: CapacityMeshEdge[];
+    });
+    private initializeAssignableNodes;
+    private initializePendingEdges;
+    _step(): void;
+    private createOffboardEdge;
+    visualize(): GraphicsObject;
+    getVirtualOffboardNodes(): CapacityMeshNode[];
+    getOffboardEdges(): CapacityMeshEdge[];
+}
+
+/**
+ * Splits capacity paths at offboard edges into separate fragments.
+ * When a path crosses an offboard edge (created by OffboardCapacityNodeSolver),
+ * this solver breaks it into independent path segments.
+ *
+ * Each fragment becomes a separate connection with its own `connectionName`
+ * (e.g., `AD_NET_frag_0`, `AD_NET_frag_1`). The solver also creates new
+ * `SimpleRouteConnection` entries with appropriate `pointsToConnect` - the
+ * original pad location plus a synthetic point at the offboard node.
+ *
+ * This enables downstream solvers to route each fragment independently,
+ * treating them as separate traces that terminate at off-board connection points.
+ */
+declare class OffboardPathFragmentSolver extends BaseSolver {
+    private inputPaths;
+    private capacityEdges;
+    private originalConnections;
+    fragmentedPaths: CapacityPath[];
+    fragmentedConnections: SimpleRouteConnection[];
+    fragmentedOriginalConnectionNames: Set<string>;
+    private nextFragmentId;
+    private animationState;
+    private currentPath;
+    private currentFragments;
+    private currentFragmentIndex;
+    private nodeMap;
+    constructor({ capacityPaths, capacityEdges, capacityNodes, connections, }: {
+        capacityPaths: CapacityPath[];
+        capacityEdges: CapacityMeshEdge[];
+        capacityNodes: CapacityMeshNode[];
+        connections: SimpleRouteConnection[];
+    });
+    _step(): void;
+    private createFragmentConnections;
+    private splitPath;
+    getFragmentedPaths(): CapacityPath[];
+    getFragmentedConnections(): SimpleRouteConnection[];
+    getFragmentedOriginalConnectionNames(): Set<string>;
+    visualize(): GraphicsObject;
+    private drawPath;
+}
+
 interface CapacityMeshSolverOptions {
     capacityDepth?: number;
     targetMinCapacity?: number;
@@ -2472,6 +2604,8 @@ declare class AssignableViaAutoroutingPipelineSolver extends BaseSolver {
     highDensityStitchSolver?: MultipleHighDensityRouteStitchSolver;
     singleLayerNodeMerger?: SingleLayerNodeMergerSolver_OnlyMergeTargets;
     mergeAssignableViaNodes?: AssignableViaNodeMergerSolver;
+    offboardCapacityNodeSolver?: OffboardCapacityNodeSolver;
+    offboardPathFragmentSolver?: OffboardPathFragmentSolver;
     strawSolver?: StrawSolver;
     deadEndSolver?: DeadEndSolver;
     uselessViaRemovalSolver1?: UselessViaRemovalSolver;
@@ -2487,7 +2621,7 @@ declare class AssignableViaAutoroutingPipelineSolver extends BaseSolver {
     capacityNodes: CapacityMeshNode[] | null;
     capacityEdges: CapacityMeshEdge[] | null;
     cacheProvider: CacheProvider | null;
-    pipelineDef: (PipelineStep<typeof NetToPointPairsSolver> | PipelineStep<typeof CapacityMeshNodeSolver_OnlyTraverseLayersInAssignableObstacles> | PipelineStep<typeof AssignableViaNodeMergerSolver> | PipelineStep<typeof SingleLayerNodeMergerSolver_OnlyMergeTargets> | PipelineStep<typeof CapacityMeshEdgeSolver2_NodeTreeOptimization> | PipelineStep<typeof DeadEndSolver> | PipelineStep<typeof HyperAssignableViaCapacityPathingSolver> | PipelineStep<typeof CapacityEdgeToPortSegmentSolver> | PipelineStep<typeof CapacitySegmentToPointSolver> | PipelineStep<typeof UnravelMultiSectionSolver> | PipelineStep<typeof HighDensitySolver> | PipelineStep<typeof MultipleHighDensityRouteStitchSolver> | PipelineStep<typeof UselessViaRemovalSolver> | PipelineStep<typeof MultiSimplifiedPathSolver>)[];
+    pipelineDef: (PipelineStep<typeof NetToPointPairsSolver> | PipelineStep<typeof CapacityMeshNodeSolver_OnlyTraverseLayersInAssignableObstacles> | PipelineStep<typeof AssignableViaNodeMergerSolver> | PipelineStep<typeof SingleLayerNodeMergerSolver_OnlyMergeTargets> | PipelineStep<typeof CapacityMeshEdgeSolver2_NodeTreeOptimization> | PipelineStep<typeof OffboardCapacityNodeSolver> | PipelineStep<typeof DeadEndSolver> | PipelineStep<typeof HyperAssignableViaCapacityPathingSolver> | PipelineStep<typeof OffboardPathFragmentSolver> | 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;