Struct ListChangeMove 

pub struct ListChangeMove<S, V> { /* private fields */ }

A move that relocates an element from one list position to another.

Supports both intra-list moves (within same entity) and inter-list moves (between different entities). Uses typed function pointers for zero-erasure.

Type Parameters

• S - The planning solution type
• V - The list element value type

Example

use solverforge_solver::heuristic::r#move::ListChangeMove;
use solverforge_core::domain::PlanningSolution;
use solverforge_core::score::SimpleScore;

#[derive(Clone, Debug)]
struct Vehicle { id: usize, visits: Vec<i32> }

#[derive(Clone, Debug)]
struct Solution { vehicles: Vec<Vehicle>, score: Option<SimpleScore> }

impl PlanningSolution for Solution {
    type Score = SimpleScore;
    fn score(&self) -> Option<Self::Score> { self.score }
    fn set_score(&mut self, score: Option<Self::Score>) { self.score = score; }
}

fn list_len(s: &Solution, entity_idx: usize) -> usize {
    s.vehicles.get(entity_idx).map_or(0, |v| v.visits.len())
}
fn list_remove(s: &mut Solution, entity_idx: usize, pos: usize) -> Option<i32> {
    s.vehicles.get_mut(entity_idx).map(|v| v.visits.remove(pos))
}
fn list_insert(s: &mut Solution, entity_idx: usize, pos: usize, val: i32) {
    if let Some(v) = s.vehicles.get_mut(entity_idx) { v.visits.insert(pos, val); }
}

// Move element from vehicle 0 position 2 to vehicle 1 position 0
let m = ListChangeMove::<Solution, i32>::new(
    0, 2, 1, 0,
    list_len, list_remove, list_insert,
    "visits", 0,
);

Implementations

impl<S, V> ListChangeMove<S, V>

pub fn new( source_entity_index: usize, source_position: usize, dest_entity_index: usize, dest_position: usize, list_len: fn(&S, usize) -> usize, list_remove: fn(&mut S, usize, usize) -> Option<V>, list_insert: fn(&mut S, usize, usize, V), variable_name: &'static str, descriptor_index: usize, ) -> Self

Creates a new list change move with typed function pointers.

Arguments

• source_entity_index - Entity index to remove from
• source_position - Position in source list
• dest_entity_index - Entity index to insert into
• dest_position - Position in destination list
• list_len - Function to get list length
• list_remove - Function to remove element at position
• list_insert - Function to insert element at position
• variable_name - Name of the list variable
• descriptor_index - Entity descriptor index

pub fn source_entity_index(&self) -> usize

Returns the source entity index.

pub fn source_position(&self) -> usize

Returns the source position.

pub fn dest_entity_index(&self) -> usize

Returns the destination entity index.

pub fn dest_position(&self) -> usize

Returns the destination position.

pub fn is_intra_list(&self) -> bool

Returns true if this is an intra-list move (same entity).

Trait Implementations

impl<S, V> Clone for ListChangeMove<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 ListChangeMove<S, V>

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

Formats the value using the given formatter.

impl<S, V> Move<S> for ListChangeMove<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, ListChangeMove<S, V>> for ListChangeMoveSelector<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, ) -> Box<dyn Iterator<Item = ListChangeMove<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> Copy for ListChangeMove<S, V>