Struct SubListChangeMove 

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

A move that relocates a contiguous sublist from one 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::SubListChangeMove;
use solverforge_core::domain::PlanningSolution;
use solverforge_core::score::SoftScore;

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

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

impl PlanningSolution for Solution {
    type Score = SoftScore;
    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 sublist_remove(s: &mut Solution, entity_idx: usize, start: usize, end: usize) -> Vec<i32> {
    s.vehicles.get_mut(entity_idx)
        .map(|v| v.visits.drain(start..end).collect())
        .unwrap_or_default()
}
fn sublist_insert(s: &mut Solution, entity_idx: usize, pos: usize, items: Vec<i32>) {
    if let Some(v) = s.vehicles.get_mut(entity_idx) {
        for (i, item) in items.into_iter().enumerate() {
            v.visits.insert(pos + i, item);
        }
    }
}

// Move elements [1..3) from vehicle 0 to vehicle 1 at position 0
let m = SubListChangeMove::<Solution, i32>::new(
    0, 1, 3,  // source: entity 0, range [1, 3)
    1, 0,     // dest: entity 1, position 0
    list_len, sublist_remove, sublist_insert,
    "visits", 0,
);

Implementations

impl<S, V> SubListChangeMove<S, V>

pub fn new( source_entity_index: usize, source_start: usize, source_end: usize, dest_entity_index: usize, dest_position: usize, list_len: fn(&S, usize) -> usize, sublist_remove: fn(&mut S, usize, usize, usize) -> Vec<V>, sublist_insert: fn(&mut S, usize, usize, Vec<V>), variable_name: &'static str, descriptor_index: usize, ) -> Self

pub fn source_entity_index(&self) -> usize

pub fn source_start(&self) -> usize

pub fn source_end(&self) -> usize

pub fn sublist_len(&self) -> usize

pub fn dest_entity_index(&self) -> usize

pub fn dest_position(&self) -> usize

pub fn is_intra_list(&self) -> bool

Trait Implementations

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

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

Formats the value using the given formatter.

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

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

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

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

fn descriptor_index(&self) -> usize

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

fn variable_name(&self) -> &str

impl<S, V, ES> MoveSelector<S, SubListChangeMove<S, V>> for SubListChangeMoveSelector<S, V, ES>

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

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

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

fn is_never_ending(&self) -> bool

impl<S, V> Copy for SubListChangeMove<S, V>