Struct SwapMoveCursor 

pub struct SwapMoveCursor<S, V>
where
    S: PlanningSolution,
    V: Clone + PartialEq + Send + Sync + Debug + 'static,
{ /* private fields */ }

Trait Implementations

impl<S, V> MoveCursor<S, SwapMove<S, V>> for SwapMoveCursor<S, V>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static,

fn next_candidate(&mut self, _solution: &S) -> Option<CandidateId>

Pulls the next candidate against the caller’s live working solution.

fn candidate( &self, id: CandidateId, ) -> Option<MoveCandidateRef<'_, S, SwapMove<S, V>>>

fn take_candidate(&mut self, id: CandidateId) -> SwapMove<S, V>

fn release_candidate(&mut self, id: CandidateId) -> bool

fn next_candidate_with_director<D: Director<S>>( &mut self, director: &mut D, ) -> Option<CandidateId>

Pulls the next candidate while lending the live director.

fn next_candidate_with_control<ShouldStop>( &mut self, solution: &S, should_stop: &mut ShouldStop, ) -> Option<CandidateId>

where ShouldStop: FnMut() -> bool,

Pulls the next candidate while allowing expensive cursor implementations to observe solve control between units of generation work. A None result may mean either exhaustion or requested interruption, so callers must recheck the same control signal before resolving an exhausted scan.

fn next_owned_candidate(&mut self, solution: &S) -> Option<M>

fn next_owned_candidate_matching( &mut self, solution: &S, predicate: for<'a> fn(MoveCandidateRef<'a, S, M>) -> bool, ) -> Option<M>

fn next_owned_candidate_inspected<T, F>( &mut self, solution: &S, inspect: F, ) -> Option<(M, T)>

where F: for<'a> FnMut(MoveCandidateRef<'a, S, M>) -> Option<T>,

fn apply_owned_candidate<D: Director<S>>( &mut self, id: CandidateId, score_director: &mut D, )

fn selector_index(&self, _id: CandidateId) -> Option<usize>