@tscircuit/capacity-autorouter 0.0.53 → 0.0.55

package/dist/index.d.ts

@@ -117,22 +117,34 @@ declare class BaseSolver {
 declare class CapacityMeshEdgeSolver extends BaseSolver {
     nodes: CapacityMeshNode[];
     edges: Array<CapacityMeshEdge>;
+    /** Only used for visualization, dynamically instantiated if necessary */
+    nodeMap?: Map<CapacityMeshNodeId, CapacityMeshNode>;
     constructor(nodes: CapacityMeshNode[]);
     getNextCapacityMeshEdgeId(): string;
-    step(): void;
+    _step(): void;
     handleTargetNodes(): void;
     doNodesHaveSharedLayer(node1: CapacityMeshNode, node2: CapacityMeshNode): boolean;
     visualize(): GraphicsObject;
 }
 
-type BucketCoordinate$1 = `${number}x${number}`;
+/**
+ * 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 {
-    obstacles: Obstacle[];
-    buckets: Map<BucketCoordinate$1, [Obstacle, number][]>;
-    CELL_SIZE: number;
-    constructor(obstacles: Obstacle[]);
-    getBucketKey(x: number, y: number): BucketCoordinate$1;
-    getNodesInArea(centerX: number, centerY: number, width: number, height: number): Obstacle[];
+    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 {
@@ -297,6 +309,7 @@ type NodeWithPortPoints = {
     width: number;
     height: number;
     portPoints: PortPoint[];
+    availableZ?: number[];
 };
 /**
  * A path for a wire in high-density intra-node routing.
@@ -398,6 +411,8 @@ interface HighDensityHyperParameters {
     SHUFFLE_SEED: number;
     CELL_SIZE_FACTOR: number;
     FLIP_TRACE_ALIGNMENT_DIRECTION: boolean;
+    MULTI_HEAD_POLYLINE_SOLVER: boolean;
+    SEGMENTS_PER_POLYLINE: number;
 }
 
 type Node = {
@@ -409,9 +424,9 @@ type Node = {
     f: number;
     parent: Node | null;
 };
-declare class SingleRouteCandidatePriorityQueue {
+declare class SingleRouteCandidatePriorityQueue<T extends Node = Node> {
     private heap;
-    constructor(nodes: Node[]);
+    constructor(nodes: T[]);
     private getLeftChildIndex;
     private getRightChildIndex;
     private getParentIndex;
@@ -422,9 +437,9 @@ declare class SingleRouteCandidatePriorityQueue {
     private rightChild;
     private parent;
     private swap;
-    dequeue(): Node | null;
-    peek(): Node | null;
-    enqueue(item: Node): void;
+    dequeue(): T | null;
+    peek(): T | null;
+    enqueue(item: T): void;
     heapifyUp(): void;
     heapifyDown(): void;
 }
@@ -728,6 +743,12 @@ declare class HyperSingleIntraNodeSolver extends HyperParameterSupervisorSolver<
             CLOSED_FORM_TWO_TRACE_TRANSITION_CROSSING: boolean;
             CLOSED_FORM_TWO_TRACE_SAME_LAYER?: undefined;
         })[];
+    } | {
+        name: string;
+        possibleValues: {
+            MULTI_HEAD_POLYLINE_SOLVER: boolean;
+            SEGMENTS_PER_POLYLINE: number;
+        }[];
     })[];
     computeG(solver: IntraNodeRouteSolver): number;
     computeH(solver: IntraNodeRouteSolver): number;
@@ -962,6 +983,16 @@ declare class SingleHighDensityRouteStitchSolver extends BaseSolver {
         };
         colorMap?: Record<string, string>;
     });
+    /**
+     * Scan `remainingHdRoutes` and find a route that has **one** end that is not
+     * within `5e-6` of the start or end of any other route on the same layer.
+     * That “lonely” end marks one extremity of the whole chain, which we use as
+     * our starting segment. If no such route exists (e.g., the data form a loop),
+     * we simply return the first route so the solver can proceed.
+     */
+    getDisjointedRoute(): {
+        firstRoute: HighDensityIntraNodeRoute$1;
+    };
     _step(): void;
     visualize(): GraphicsObject;
 }
@@ -1050,6 +1081,7 @@ interface UnravelSection {
     mutableSegmentIds: Set<string>;
     immutableNodeIds: CapacityMeshNodeId[];
     segmentPointMap: SegmentPointMap;
+    mutableSegmentPointIds: Set<SegmentPointId>;
     segmentPairsInNode: Map<CapacityMeshNodeId, Array<[SegmentPointId, SegmentPointId]>>;
     segmentPointsInNode: Map<CapacityMeshNodeId, SegmentPointId[]>;
     segmentPointsInSegment: Map<SegmentId, SegmentPointId[]>;
@@ -1112,6 +1144,19 @@ type SegmentPointMapAndReverseMaps = {
     segmentToSegmentPointMap: Map<SegmentId, SegmentPointId[]>;
 };
 
+interface UnravelSectionSolverParams {
+    rootNodeId: CapacityMeshNodeId;
+    colorMap?: Record<string, string>;
+    MUTABLE_HOPS?: number;
+    nodeMap: Map<CapacityMeshNodeId, CapacityMeshNode>;
+    dedupedSegments: SegmentWithAssignedPoints[];
+    dedupedSegmentMap?: Map<SegmentId, SegmentWithAssignedPoints>;
+    nodeIdToSegmentIds: Map<CapacityMeshNodeId, CapacityMeshNodeId[]>;
+    segmentIdToNodeIds: Map<CapacityMeshNodeId, CapacityMeshNodeId[]>;
+    segmentPointMap?: SegmentPointMap;
+    nodeToSegmentPointMap?: Map<CapacityMeshNodeId, SegmentPointId[]>;
+    segmentToSegmentPointMap?: Map<SegmentId, SegmentPointId[]>;
+}
 /**
  * The UntangleSectionSolver optimizes a section of connected capacity nodes
  * with their deduplicated segments.
@@ -1158,19 +1203,9 @@ declare class UnravelSectionSolver extends BaseSolver {
     iterationsSinceImprovement: number;
     selectedCandidateIndex: number | "best" | "original" | null;
     queuedOrExploredCandidatePointModificationHashes: Set<string>;
-    constructor(params: {
-        rootNodeId: CapacityMeshNodeId;
-        colorMap?: Record<string, string>;
-        MUTABLE_HOPS?: number;
-        nodeMap: Map<CapacityMeshNodeId, CapacityMeshNode>;
-        dedupedSegments: SegmentWithAssignedPoints[];
-        dedupedSegmentMap?: Map<SegmentId, SegmentWithAssignedPoints>;
-        nodeIdToSegmentIds: Map<CapacityMeshNodeId, CapacityMeshNodeId[]>;
-        segmentIdToNodeIds: Map<CapacityMeshNodeId, CapacityMeshNodeId[]>;
-        segmentPointMap?: SegmentPointMap;
-        nodeToSegmentPointMap?: Map<CapacityMeshNodeId, SegmentPointId[]>;
-        segmentToSegmentPointMap?: Map<SegmentId, SegmentPointId[]>;
-    });
+    constructorParams: UnravelSectionSolverParams;
+    constructor(params: UnravelSectionSolverParams);
+    getConstructorParams(): UnravelSectionSolverParams;
     createUnravelSection(largeSpMaps?: SegmentPointMapAndReverseMaps): UnravelSection;
     createInitialCandidate(): UnravelCandidate;
     get nextCandidate(): UnravelCandidate | null;
@@ -1207,12 +1242,13 @@ declare class UnravelMultiSectionSolver extends BaseSolver {
     MAX_NODE_ATTEMPTS: number;
     MUTABLE_HOPS: number;
     ACCEPTABLE_PF: number;
+    MAX_ITERATIONS_WITHOUT_IMPROVEMENT: number;
     /**
      * Probability of failure for each node
      */
     nodePfMap: Map<CapacityMeshNodeId, number>;
     attemptsToFixNode: Map<CapacityMeshNodeId, number>;
-    activeSolver: UnravelSectionSolver | null;
+    activeSubSolver: UnravelSectionSolver | null;
     segmentPointMap: SegmentPointMap;
     constructor({ assignedSegments, colorMap, nodes, }: {
         assignedSegments: NodePortSegment[];
@@ -1256,6 +1292,7 @@ declare class CapacityPathingSolver extends BaseSolver {
     nodes: CapacityMeshNode[];
     edges: CapacityMeshEdge[];
     GREEDY_MULTIPLIER: number;
+    MAX_CANDIDATES_IN_MEMORY: number;
     nodeMap: Map<CapacityMeshNodeId, CapacityMeshNode>;
     nodeEdgeMap: Map<CapacityMeshNodeId, CapacityMeshEdge[]>;
     connectionNameToGoalNodeIds: Map<string, CapacityMeshNodeId[]>;
@@ -1354,8 +1391,6 @@ interface CapacityPathingSingleSectionPathingSolverParams {
 }
 declare class CapacityPathingSingleSectionPathingSolver extends BaseSolver {
     GREEDY_MULTIPLIER: number;
-    NEGATIVE_CAPACITY_PENALTY_FACTOR: number;
-    REDUCED_CAPACITY_PENALTY_FACTOR: number;
     sectionNodes: CapacityMeshNode[];
     sectionEdges: CapacityMeshEdge[];
     sectionConnectionTerminals: Array<{
@@ -1368,6 +1403,7 @@ declare class CapacityPathingSingleSectionPathingSolver extends BaseSolver {
     nodeEdgeMap: Map<CapacityMeshNodeId, CapacityMeshEdge[]>;
     colorMap: Record<string, string>;
     usedNodeCapacityMap: Map<CapacityMeshNodeId, number>;
+    MAX_CANDIDATES_IN_MEMORY: number;
     currentConnectionIndex: number;
     candidates?: Array<Candidate> | null;
     visitedNodes?: Set<CapacityMeshNodeId> | null;
@@ -1456,6 +1492,8 @@ declare class CapacityPathingMultiSectionSolver extends BaseSolver {
     nodeOptimizationAttemptCountMap: Map<CapacityMeshNodeId, number>;
     sectionSolver?: CapacityPathingSingleSectionSolver | null;
     MAX_ATTEMPTS_PER_NODE: number;
+    MINIMUM_PROBABILITY_OF_FAILURE_TO_OPTIMIZE: number;
+    MAX_EXPANSION_DEGREES: number;
     constructor(params: ConstructorParameters<typeof CapacityPathingSolver>[0]);
     _stepInitialization(): void;
     _getNextNodeToOptimize(): CapacityMeshNodeId | null;
@@ -1581,7 +1619,12 @@ declare class MultiSimplifiedPathSolver extends BaseSolver {
 }
 
 declare class CapacityMeshEdgeSolver2_NodeTreeOptimization extends CapacityMeshEdgeSolver {
-    step(): void;
+    nodes: CapacityMeshNode[];
+    private nodeTree;
+    private currentNodeIndex;
+    private edgeSet;
+    constructor(nodes: CapacityMeshNode[]);
+    _step(): void;
 }
 
 interface Point {
@@ -1732,7 +1775,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 UselessViaRemovalSolver> | PipelineStep<typeof MultiSimplifiedPathSolver>)[];
+    pipelineDef: (PipelineStep<typeof NetToPointPairsSolver> | PipelineStep<typeof CapacityMeshNodeSolver2_NodeUnderObstacle> | PipelineStep<typeof SingleLayerNodeMergerSolver> | PipelineStep<typeof StrawSolver> | PipelineStep<typeof CapacityMeshEdgeSolver2_NodeTreeOptimization> | PipelineStep<typeof CapacityPathingMultiSectionSolver> | 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;