@tscircuit/capacity-autorouter 0.0.54 → 0.0.55

package/dist/index.d.ts

@@ -127,14 +127,24 @@ declare class CapacityMeshEdgeSolver extends BaseSolver {
     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 {
@@ -973,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;
 }