Enum ListMoveImpl 

pub enum ListMoveImpl<S, V> {
    ListChange(ListChangeMove<S, V>),
    ListSwap(ListSwapMove<S, V>),
    SubListChange(SubListChangeMove<S, V>),
    SubListSwap(SubListSwapMove<S, V>),
    ListReverse(ListReverseMove<S, V>),
    KOpt(KOptMove<S, V>),
    ListRuin(ListRuinMove<S, V>),
}

A monomorphized union of all list-variable move types.

Implements Move<S> by delegating to the inner variant. Enables combining ListChangeMoveSelector, ListSwapMoveSelector, SubListChangeMoveSelector, SubListSwapMoveSelector, ListReverseMoveSelector, KOptMoveSelector, and ListRuinMoveSelector without type erasure.

Example

use solverforge_solver::heuristic::r#move::ListMoveImpl;

Variants

ListChange(ListChangeMove<S, V>)

ListSwap(ListSwapMove<S, V>)

SubListChange(SubListChangeMove<S, V>)

SubListSwap(SubListSwapMove<S, V>)

ListReverse(ListReverseMove<S, V>)

KOpt(KOptMove<S, V>)

ListRuin(ListRuinMove<S, V>)

Trait Implementations

impl<S, V: Clone> Clone for ListMoveImpl<S, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S, V: Debug> Debug for ListMoveImpl<S, V>

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

Formats the value using the given formatter.

impl<S, V> Move<S> for ListMoveImpl<S, V>

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

fn is_doable<D: ScoreDirector<S>>(&self, score_director: &D) -> bool

Returns true if this move can be executed in the current state.

fn do_move<D: ScoreDirector<S>>(&self, score_director: &mut D)

Executes this move, modifying the working solution.

fn descriptor_index(&self) -> usize

Returns the descriptor index of the entity type this move affects.

fn entity_indices(&self) -> &[usize]

Returns the entity indices involved in this move.

fn variable_name(&self) -> &str

Returns the variable name this move affects.

impl<S, V, ES> MoveSelector<S, ListMoveImpl<S, V>> for ListMoveKOptSelector<S, V, ES>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static, ES: EntitySelector<S>,

fn iter_moves<'a, D: ScoreDirector<S>>( &'a self, score_director: &'a D, ) -> impl Iterator<Item = ListMoveImpl<S, V>> + 'a

Returns an iterator over typed moves.

fn size<D: ScoreDirector<S>>(&self, score_director: &D) -> usize

Returns the approximate number of moves.

fn is_never_ending(&self) -> bool

Returns true if this selector may return the same move multiple times.

impl<S, V, ES> MoveSelector<S, ListMoveImpl<S, V>> for ListMoveListChangeSelector<S, V, ES>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static, ES: EntitySelector<S>,

fn iter_moves<'a, D: ScoreDirector<S>>( &'a self, score_director: &'a D, ) -> impl Iterator<Item = ListMoveImpl<S, V>> + 'a

Returns an iterator over typed moves.

fn size<D: ScoreDirector<S>>(&self, score_director: &D) -> usize

Returns the approximate number of moves.

fn is_never_ending(&self) -> bool

Returns true if this selector may return the same move multiple times.

impl<S, V, ES> MoveSelector<S, ListMoveImpl<S, V>> for ListMoveListReverseSelector<S, V, ES>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static, ES: EntitySelector<S>,

fn iter_moves<'a, D: ScoreDirector<S>>( &'a self, score_director: &'a D, ) -> impl Iterator<Item = ListMoveImpl<S, V>> + 'a

Returns an iterator over typed moves.

fn size<D: ScoreDirector<S>>(&self, score_director: &D) -> usize

Returns the approximate number of moves.

fn is_never_ending(&self) -> bool

Returns true if this selector may return the same move multiple times.

impl<S, V> MoveSelector<S, ListMoveImpl<S, V>> for ListMoveListRuinSelector<S, V>

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

fn iter_moves<'a, D: ScoreDirector<S>>( &'a self, score_director: &'a D, ) -> impl Iterator<Item = ListMoveImpl<S, V>> + 'a

Returns an iterator over typed moves.

fn size<D: ScoreDirector<S>>(&self, score_director: &D) -> usize

Returns the approximate number of moves.

fn is_never_ending(&self) -> bool

Returns true if this selector may return the same move multiple times.

impl<S, V, ES> MoveSelector<S, ListMoveImpl<S, V>> for ListMoveListSwapSelector<S, V, ES>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static, ES: EntitySelector<S>,

fn iter_moves<'a, D: ScoreDirector<S>>( &'a self, score_director: &'a D, ) -> impl Iterator<Item = ListMoveImpl<S, V>> + 'a

Returns an iterator over typed moves.

fn size<D: ScoreDirector<S>>(&self, score_director: &D) -> usize

Returns the approximate number of moves.

fn is_never_ending(&self) -> bool

Returns true if this selector may return the same move multiple times.

impl<S, V, D, ES> MoveSelector<S, ListMoveImpl<S, V>> for ListMoveNearbyListChangeSelector<S, V, D, ES>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static, D: CrossEntityDistanceMeter<S>, ES: EntitySelector<S>,

fn iter_moves<'a, SD: ScoreDirector<S>>( &'a self, score_director: &'a SD, ) -> impl Iterator<Item = ListMoveImpl<S, V>> + 'a

Returns an iterator over typed moves.

fn size<SD: ScoreDirector<S>>(&self, score_director: &SD) -> usize

Returns the approximate number of moves.

fn is_never_ending(&self) -> bool

Returns true if this selector may return the same move multiple times.

impl<S, V, D, ES> MoveSelector<S, ListMoveImpl<S, V>> for ListMoveNearbyListSwapSelector<S, V, D, ES>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static, D: CrossEntityDistanceMeter<S>, ES: EntitySelector<S>,

fn iter_moves<'a, SD: ScoreDirector<S>>( &'a self, score_director: &'a SD, ) -> impl Iterator<Item = ListMoveImpl<S, V>> + 'a

Returns an iterator over typed moves.

fn size<SD: ScoreDirector<S>>(&self, score_director: &SD) -> usize

Returns the approximate number of moves.

fn is_never_ending(&self) -> bool

Returns true if this selector may return the same move multiple times.

impl<S, V, ES> MoveSelector<S, ListMoveImpl<S, V>> for ListMoveSubListChangeSelector<S, V, ES>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static, ES: EntitySelector<S>,

fn iter_moves<'a, D: ScoreDirector<S>>( &'a self, score_director: &'a D, ) -> impl Iterator<Item = ListMoveImpl<S, V>> + 'a

Returns an iterator over typed moves.

fn size<D: ScoreDirector<S>>(&self, score_director: &D) -> usize

Returns the approximate number of moves.

fn is_never_ending(&self) -> bool

Returns true if this selector may return the same move multiple times.

impl<S, V, ES> MoveSelector<S, ListMoveImpl<S, V>> for ListMoveSubListSwapSelector<S, V, ES>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static, ES: EntitySelector<S>,

fn iter_moves<'a, D: ScoreDirector<S>>( &'a self, score_director: &'a D, ) -> impl Iterator<Item = ListMoveImpl<S, V>> + 'a

Returns an iterator over typed moves.

fn size<D: ScoreDirector<S>>(&self, score_director: &D) -> usize

Returns the approximate number of moves.

fn is_never_ending(&self) -> bool

Returns true if this selector may return the same move multiple times.