Struct AcceptedCountForager 

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

A forager that collects a limited number of accepted moves.

Once the limit is reached, it quits early. It picks the best move among those collected.

Implementations

impl<S> AcceptedCountForager<S>

where S: PlanningSolution,

pub fn new(accepted_count_limit: usize) -> Self

Creates a new forager with the given limit.

Arguments

• accepted_count_limit - Stop after collecting this many accepted moves

Trait Implementations

impl<S> Clone for AcceptedCountForager<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 AcceptedCountForager<S>

where S: PlanningSolution,

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

Formats the value using the given formatter.

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

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

fn step_started(&mut self)

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.