Files
OpenNest/OpenNest.Engine/Strategies/PairsFillStrategy.cs
T
ajandClaude Opus 5.5 4b3d7d57aa feat(fill): fill the J-bar strip with whole-pair grids and grid-end inserts
Fill placed 30 J-shaped bars (30 x 7.5, 0.3 spacing) on a 48 x 96 sheet where
33 fit by hand. With pairs settled tight (07f30c12), two columns leave a 30.2"
strip, but the grid topped its last column up with single halves of pairs
and took that strip. The work that reached 33 was done on 2026-11-09 and left
uncommitted; this ports it onto master.

- PairFiller also tiles each pair grid with whole pairs only (FillLinear
  PartialCopies = false), after the others, and refills the strip it leaves;
  that grid wins only by placing more parts. Only fills without a quantity
  try it: in Auto Nest's capped fills it ended N26-2ER's sheet at 103.83
  instead of 103.08. The cutout lattice turns it off, since it crops its fill.
- GridEndInserter completes a strip's densest pair grid: it moves the grid
  to each corner, slides copies of its parts in from the open sides and fills
  the strip beyond. The J-bar strip takes three pairs stood on end, one more
  bar beside them and a pair underneath: 33 parts, as laid out by hand.

Corpus: the J-bar fill places 33 (baseline 30), N26-29X keeps 136, and
every auto-nest nest keeps its saved layout.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
2026-11-21 14:21:34 -05:00

55 lines
1.7 KiB
C#

using System.Collections.Generic;
using System.Threading;
using OpenNest.Engine.Fill;
namespace OpenNest.Engine.Strategies
{
public class PairsFillStrategy : IFillStrategy
{
private static readonly AsyncLocal<bool> active = new();
public string Name => "Pairs";
public NestPhase Phase => NestPhase.Pairs;
public int Order => 100;
public List<Part> Fill(FillContext context)
{
// Prevent recursive PairFiller — remnant fills within PairFiller
// create a new engine that runs the full pipeline, which would
// invoke PairsFillStrategy again, causing deep recursion.
if (active.Value)
return null;
if (context.PartType == PartType.Circle)
return null;
active.Value = true;
try
{
var comparer = context.Policy?.Comparer;
var dedup = GridDedup.GetOrCreate(context.SharedState);
var filler = new PairFiller(context.Plate, comparer, dedup)
{
StripeConvergence = StripeConvergenceCache.GetOrCreate(context.SharedState),
WholePairGrids = context.WholePairGrids,
};
var result = filler.Fill(
context.Item,
context.WorkArea,
context.Token,
context.ReportProgress
);
if (result.BestFits != null)
context.SharedState["BestFits"] = result.BestFits;
return result.Parts;
}
finally
{
active.Value = false;
}
}
}
}