@tscircuit/schematic-trace-solver 0.0.45 → 0.0.47

package/.github/workflows/bun-formatcheck.yml

@@ -17,7 +17,7 @@ jobs:
       - name: Setup bun
         uses: oven-sh/setup-bun@v2
         with:
-          bun-version: latest
+          bun-version: 1.3.1
 
       - name: Install dependencies
         run: bun install

package/.github/workflows/bun-pver-release.yml

@@ -17,7 +17,7 @@ jobs:
       - name: Setup bun
         uses: oven-sh/setup-bun@v2
         with:
-          bun-version: latest
+          bun-version: 1.3.1
       - uses: actions/setup-node@v3
         with:
           node-version: 20

package/.github/workflows/bun-test.yml

@@ -19,7 +19,7 @@ jobs:
       - name: Setup bun
         uses: oven-sh/setup-bun@v2
         with:
-          bun-version: latest
+          bun-version: 1.3.1
 
       - name: Install dependencies
         run: bun install

package/.github/workflows/bun-typecheck.yml

@@ -17,7 +17,7 @@ jobs:
       - name: Setup bun
         uses: oven-sh/setup-bun@v2
         with:
-          bun-version: latest
+          bun-version: 1.3.1
 
       - name: Install dependencies
         run: bun i

package/dist/index.d.ts

@@ -396,13 +396,20 @@ interface LabelMergingSolverOutput {
 }
 /**
  * Merges multiple net labels into a single, larger label if they are on the
- * same side of the same chip, reducing schematic clutter.
+ * same side of the same chip and physically adjacent.
  */
 declare class MergedNetLabelObstacleSolver extends BaseSolver {
     private input;
     private output;
     private inputProblem;
     private traces;
+    private pipelineStep;
+    private filteredLabels;
+    private labelGroups;
+    private groupKeysToProcess;
+    private finalPlacements;
+    private mergedLabelNetIdMap;
+    private activeMergingGroupKey;
     constructor(solverInput: LabelMergingSolverInput);
     _step(): void;
     getOutput(): LabelMergingSolverOutput;
@@ -428,6 +435,7 @@ declare class SingleOverlapSolver extends BaseSolver {
     problem: InputProblem;
     obstacles: ReturnType<typeof getObstacleRects>;
     label: NetLabelPlacement;
+    _tried: number;
     constructor(solverInput: SingleOverlapSolverInput);
     _step(): void;
     visualize(): GraphicsObject;
@@ -436,8 +444,10 @@ declare class SingleOverlapSolver extends BaseSolver {
 interface OverlapCollectionSolverInput {
     inputProblem: InputProblem;
     traces: SolvedTracePath[];
-    netLabelPlacements: NetLabelPlacement[];
+    initialNetLabelPlacements: NetLabelPlacement[];
+    mergedNetLabelPlacements: NetLabelPlacement[];
     mergedLabelNetIdMap: Record<string, Set<string>>;
+    detourCounts: Map<string, number>;
 }
 /**
  * This is an internal solver that manages the step-by-step process of avoiding
@@ -445,20 +455,24 @@ interface OverlapCollectionSolverInput {
  */
 declare class OverlapAvoidanceStepSolver extends BaseSolver {
     inputProblem: InputProblem;
-    netLabelPlacements: NetLabelPlacement[];
+    initialNetLabelPlacements: NetLabelPlacement[];
+    mergedNetLabelPlacements: NetLabelPlacement[];
     mergedLabelNetIdMap: Record<string, Set<string>>;
     allTraces: SolvedTracePath[];
     modifiedTraces: SolvedTracePath[];
-    private detourCountByLabel;
     private readonly PADDING_BUFFER;
+    private detourCounts;
     activeSubSolver: SingleOverlapSolver | null;
     private overlapQueue;
     private recentlyFailed;
+    private currentlyProcessingOverlap;
+    private decomposedChildLabels;
     constructor(solverInput: OverlapCollectionSolverInput);
     _step(): void;
     getOutput(): {
         allTraces: SolvedTracePath[];
         modifiedTraces: SolvedTracePath[];
+        detourCounts: Map<string, number>;
     };
     visualize(): GraphicsObject;
 }
@@ -469,16 +483,28 @@ interface TraceLabelOverlapAvoidanceSolverInput {
     netLabelPlacements: NetLabelPlacement[];
 }
 /**
- * This solver is a pipeline that runs a series of sub-solvers to resolve
- * trace-label overlaps and clean up the resulting traces.
+ * Resolves overlaps between schematic traces and net labels using a two-phase,
+ * "fire-and-forget" dispatching strategy.
+ *
+ * This solver operates in two distinct phases:
+ *
+ * 1.  **Dispatch Phase**: Iterates through traces, identifying clean ones and dispatching
+ *     colliding ones to dedicated `OverlapAvoidanceStepSolver` instances.
+ *
+ * 2.  **Execution Phase**: Steps through all dispatched sub-solvers until they complete.
+ *
+ * The final output combines clean traces with results from sub-solvers. A final
+ * `MergedNetLabelObstacleSolver` ensures pipeline compatibility.
  */
 declare class TraceLabelOverlapAvoidanceSolver extends BaseSolver {
     inputProblem: InputProblem;
-    traces: SolvedTracePath[];
     netLabelPlacements: NetLabelPlacement[];
+    unprocessedTraces: SolvedTracePath[];
+    cleanTraces: SolvedTracePath[];
+    subSolvers: OverlapAvoidanceStepSolver[];
+    private phase;
+    detourCounts: Map<string, number>;
     labelMergingSolver?: MergedNetLabelObstacleSolver;
-    overlapAvoidanceSolver?: OverlapAvoidanceStepSolver;
-    pipelineStepIndex: number;
     constructor(solverInput: TraceLabelOverlapAvoidanceSolverInput);
     _step(): void;
     getOutput(): {