Struct LocalSearchPhase 

pub struct LocalSearchPhase<S, M, Source, A, Fo>
where
    S: PlanningSolution,
    M: Move<S>,
    Source: MoveCursorSource<S, M>,
    A: Acceptor<S>,
    Fo: LocalSearchForager<S, M>,
{ /* private fields */ }

Local search phase that improves an existing solution.

This phase iteratively:

1. Streams candidate moves through a cursor-owned store
2. Evaluates each move by stable candidate ID
3. Accepts/rejects based on the acceptor
4. Releases losers immediately and transfers ownership of the selected move

Type Parameters

• S - The planning solution type
• M - The move type
• Source - The phase cursor-source type
• A - The acceptor type
• Fo - The forager type

Zero-Clone Design

Uses ID-based online foraging. Stock foragers retain only the current winner’s CandidateId and score. The cursor releases rejected and replaced candidates, then transfers the selected move by value without cloning it.

Implementations

impl<S, M, MS, A, Fo> LocalSearchPhase<S, M, SelectorCursorSource<MS>, A, Fo>

where S: PlanningSolution, M: Move<S> + 'static, MS: MoveSelector<S, M>, A: Acceptor<S>, Fo: LocalSearchForager<S, M>,

pub fn new( move_selector: MS, acceptor: A, forager: Fo, step_limit: Option<u64>, ) -> Self

Builds a local-search phase from an ordinary move selector.

The selector is adapted to the shared phase cursor-source contract; no second local-search loop or cursor-opening path is introduced.

Trait Implementations

impl<S, M, Source, A, Fo> CustomSearchPhase<S> for LocalSearchPhase<S, M, Source, A, Fo>

where S: PlanningSolution, M: Move<S>, Source: MoveCursorSource<S, M> + Debug + Send, A: Acceptor<S> + Debug, Fo: LocalSearchForager<S, M> + Debug,

fn solve<D, ProgressCb>( &mut self, solver_scope: &mut SolverScope<'_, S, D, ProgressCb>, )

where D: Director<S>, ProgressCb: ProgressCallback<S>,

fn phase_type_name(&self) -> &'static str

fn on_solver_terminal<D, ProgressCb>( &mut self, solver_scope: &mut SolverScope<'_, S, D, ProgressCb>, )

where D: Director<S>, ProgressCb: ProgressCallback<S>,

Runs once at the enclosing solver’s terminal boundary.

impl<S, M, Source, A, Fo> Debug for LocalSearchPhase<S, M, Source, A, Fo>

where S: PlanningSolution, M: Move<S>, Source: MoveCursorSource<S, M> + Debug, A: Acceptor<S> + Debug, Fo: LocalSearchForager<S, M> + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<S, D, BestCb, M, Source, A, Fo> Phase<S, D, BestCb> for LocalSearchPhase<S, M, Source, A, Fo>

where S: PlanningSolution, D: Director<S>, BestCb: ProgressCallback<S>, M: Move<S>, Source: MoveCursorSource<S, M> + Debug + Send, A: Acceptor<S>, Fo: LocalSearchForager<S, M>,

fn solve(&mut self, solver_scope: &mut SolverScope<'_, S, D, BestCb>)

fn phase_type_name(&self) -> &'static str

fn on_solver_terminal( &mut self, _solver_scope: &mut SolverScope<'_, S, D, BestCb>, )

Runs once when the enclosing solver reaches its terminal boundary.

fn candidate_trace_plan(&self) -> CandidateTracePhasePlan

Returns the exact resolved-plan provenance this phase can prove.