Struct BestScoreForager 

pub struct BestScoreForager<S>
where
    S: PlanningSolution,
{ /* private fields */ }

A forager that evaluates all accepted moves and picks the best.

Unlike AcceptedCountForager(N), this forager never quits early — it always evaluates the full move space before selecting the best score.

Implementations

impl<S> BestScoreForager<S>

where S: PlanningSolution,

pub fn new() -> Self

Creates a new best-score forager.

Trait Implementations

impl<S> Clone for BestScoreForager<S>

where S: PlanningSolution,

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S> Debug for BestScoreForager<S>

where S: PlanningSolution,

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

Formats the value using the given formatter.

impl<S> Default for BestScoreForager<S>

where S: PlanningSolution,

fn default() -> Self

Returns the “default value” for a type.

impl<S, M> LocalSearchForager<S, M> for BestScoreForager<S>

where S: PlanningSolution, M: Move<S>,

fn step_started(&mut self, _best_score: S::Score, _last_step_score: S::Score)

Called at the start of each step to reset state.

fn add_move_index(&mut self, index: usize, score: S::Score)

Adds an accepted move index to the forager.

fn is_quit_early(&self) -> bool

Returns true if the forager has collected enough moves and wants to stop evaluating more.

fn pick_move_index(&mut self) -> Option<(usize, S::Score)>

Picks the best move index from those collected.