@tscircuit/capacity-autorouter 0.0.29 → 0.0.31

package/dist/index.d.ts

@@ -75,6 +75,7 @@ interface CapacityMeshNode {
     _targetConnectionName?: string;
     _strawNode?: boolean;
     _strawParentCapacityMeshNodeId?: CapacityMeshNodeId;
+    _adjacentNodeIds?: CapacityMeshNodeId[];
     _parent?: CapacityMeshNode;
 }
 interface CapacityMeshEdge {
@@ -112,16 +113,55 @@ declare class CapacityMeshEdgeSolver extends BaseSolver {
     constructor(nodes: CapacityMeshNode[]);
     getNextCapacityMeshEdgeId(): string;
     step(): void;
-    private doNodesHaveSharedLayer;
+    handleTargetNodes(): void;
+    doNodesHaveSharedLayer(node1: CapacityMeshNode, node2: CapacityMeshNode): boolean;
     visualize(): GraphicsObject;
 }
 
+type BucketCoordinate$1 = `${number}x${number}`;
+declare class ObstacleTree {
+    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[];
+}
+
+interface Target$1 {
+    x: number;
+    y: number;
+    bounds: {
+        minX: number;
+        minY: number;
+        maxX: number;
+        maxY: number;
+    };
+    connectionName: string;
+    availableZ: number[];
+}
+type BucketCoordinate = `${number}x${number}`;
+declare class TargetTree {
+    targets: Target$1[];
+    buckets: Map<BucketCoordinate, [Target$1, number][]>;
+    CELL_SIZE: number;
+    constructor(targets: Target$1[]);
+    getBucketKey(x: number, y: number): BucketCoordinate;
+    getTargetsInArea(centerX: number, centerY: number, width: number, height: number): Target$1[];
+}
+
 interface CapacityMeshNodeSolverOptions$1 {
     capacityDepth?: number;
 }
 interface Target {
     x: number;
     y: number;
+    bounds: {
+        minX: number;
+        minY: number;
+        maxX: number;
+        maxY: number;
+    };
     connectionName: string;
     availableZ: number[];
 }
@@ -134,7 +174,10 @@ declare class CapacityMeshNodeSolver extends BaseSolver {
     layerCount: number;
     MAX_DEPTH: number;
     targets: Target[];
+    targetTree: TargetTree;
+    obstacleTree: ObstacleTree;
     constructor(srj: SimpleRouteJson, opts?: CapacityMeshNodeSolverOptions$1);
+    computeTargets(): Target[];
     _nextNodeCounter: number;
     getNextNodeId(): string;
     getCapacityFromDepth(depth: number): number;
@@ -963,6 +1006,11 @@ interface UnravelSection {
     segmentPairsInNode: Map<CapacityMeshNodeId, Array<[SegmentPointId, SegmentPointId]>>;
     segmentPointsInNode: Map<CapacityMeshNodeId, SegmentPointId[]>;
     segmentPointsInSegment: Map<SegmentId, SegmentPointId[]>;
+    originalPointMap: Map<SegmentPointId, {
+        x: number;
+        y: number;
+        z: number;
+    }>;
 }
 interface UnravelChangeLayerOperation {
     type: "change_layer";
@@ -1011,6 +1059,12 @@ type UnravelCandidate = {
     f: number;
 };
 
+type SegmentPointMapAndReverseMaps = {
+    segmentPointMap: SegmentPointMap;
+    nodeToSegmentPointMap: Map<CapacityMeshNodeId, SegmentPointId[]>;
+    segmentToSegmentPointMap: Map<SegmentId, SegmentPointId[]>;
+};
+
 /**
  * The UntangleSectionSolver optimizes a section of connected capacity nodes
  * with their deduplicated segments.
@@ -1066,8 +1120,10 @@ declare class UnravelSectionSolver extends BaseSolver {
         nodeIdToSegmentIds: Map<CapacityMeshNodeId, CapacityMeshNodeId[]>;
         segmentIdToNodeIds: Map<CapacityMeshNodeId, CapacityMeshNodeId[]>;
         segmentPointMap?: SegmentPointMap;
+        nodeToSegmentPointMap?: Map<CapacityMeshNodeId, SegmentPointId[]>;
+        segmentToSegmentPointMap?: Map<SegmentId, SegmentPointId[]>;
     });
-    createUnravelSection(segmentPointMap?: SegmentPointMap): UnravelSection;
+    createUnravelSection(largeSpMaps?: SegmentPointMapAndReverseMaps): UnravelSection;
     createInitialCandidate(): UnravelCandidate;
     get nextCandidate(): UnravelCandidate | null;
     getPointInCandidate(candidate: UnravelCandidate, segmentPointId: SegmentPointId): {
@@ -1083,7 +1139,7 @@ declare class UnravelSectionSolver extends BaseSolver {
         operationsPerformed: number;
         operation: UnravelOperation;
     }): number;
-    getNeighborByApplyingOperation(currentCandidate: UnravelCandidate, operation: UnravelOperation): UnravelCandidate;
+    getUnexploredNeighborByApplyingOperation(currentCandidate: UnravelCandidate, operation: UnravelOperation): UnravelCandidate | null;
     getNeighborOperationsForCandidate(candidate: UnravelCandidate): UnravelOperation[];
     getNeighbors(candidate: UnravelCandidate): UnravelCandidate[];
     _step(): void;
@@ -1096,6 +1152,8 @@ declare class UnravelMultiSectionSolver extends BaseSolver {
     dedupedSegments: SegmentWithAssignedPoints[];
     nodeIdToSegmentIds: Map<CapacityMeshNodeId, CapacityMeshNodeId[]>;
     segmentIdToNodeIds: Map<CapacityMeshNodeId, CapacityMeshNodeId[]>;
+    nodeToSegmentPointMap: Map<CapacityMeshNodeId, SegmentPointId[]>;
+    segmentToSegmentPointMap: Map<SegmentId, SegmentPointId[]>;
     colorMap: Record<string, string>;
     tunedNodeCapacityMap: Map<CapacityMeshNodeId, number>;
     MAX_NODE_ATTEMPTS: number;
@@ -1186,9 +1244,12 @@ declare class SingleLayerNodeMergerSolver extends BaseSolver {
     absorbedNodeIds: Set<CapacityMeshNodeId>;
     nextBatchNodeIds: CapacityMeshNodeId[];
     batchHadModifications: boolean;
+    hasComputedAdjacentNodeIds: boolean;
     newNodes: CapacityMeshNode[];
     constructor(nodes: CapacityMeshNode[]);
+    computeAdjacentNodeIdsForFirstBatch(nodes: CapacityMeshNode[]): void;
     getAdjacentSameLayerUnprocessedNodes(rootNode: CapacityMeshNode): CapacityMeshNode[];
+    getAdjacentSameLayerUnprocessedNodes2(rootNode: CapacityMeshNode): CapacityMeshNode[];
     _step(): void;
     visualize(): GraphicsObject;
 }
@@ -1239,6 +1300,10 @@ declare class MultiSimplifiedPathSolver extends BaseSolver {
     visualize(): GraphicsObject;
 }
 
+declare class CapacityMeshEdgeSolver2_NodeTreeOptimization extends CapacityMeshEdgeSolver {
+    step(): void;
+}
+
 interface CapacityMeshSolverOptions {
     capacityDepth?: number;
     targetMinCapacity?: number;
@@ -1274,7 +1339,7 @@ declare class CapacityMeshSolver 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 CapacityMeshEdgeSolver> | 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 MultiSimplifiedPathSolver>)[];
     constructor(srj: SimpleRouteJson, opts?: CapacityMeshSolverOptions);
     currentPipelineStepIndex: number;
     _step(): void;