use std::fmt::Debug;
use smallvec::{smallvec, SmallVec};
use solverforge_core::domain::PlanningSolution;
use solverforge_scoring::Director;
use super::metadata::{
encode_option_debug, encode_usize, ordered_coordinate_pair, scoped_move_identity,
MoveTabuScope, ScopedEntityTabuToken, TABU_OP_LIST_SWAP,
};
use super::{Move, MoveTabuSignature};
pub struct ListSwapMove<S, V> {
first_entity_index: usize,
first_position: usize,
second_entity_index: usize,
second_position: usize,
list_len: fn(&S, usize) -> usize,
list_get: fn(&S, usize, usize) -> Option<V>,
list_set: fn(&mut S, usize, usize, V),
variable_name: &'static str,
descriptor_index: usize,
indices: [usize; 2],
}
impl<S, V> Clone for ListSwapMove<S, V> {
fn clone(&self) -> Self {
*self
}
}
impl<S, V> Copy for ListSwapMove<S, V> {}
impl<S, V: Debug> Debug for ListSwapMove<S, V> {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
f.debug_struct("ListSwapMove")
.field("first_entity", &self.first_entity_index)
.field("first_position", &self.first_position)
.field("second_entity", &self.second_entity_index)
.field("second_position", &self.second_position)
.field("variable_name", &self.variable_name)
.finish()
}
}
impl<S, V> ListSwapMove<S, V> {
#[allow(clippy::too_many_arguments)]
pub fn new(
first_entity_index: usize,
first_position: usize,
second_entity_index: usize,
second_position: usize,
list_len: fn(&S, usize) -> usize,
list_get: fn(&S, usize, usize) -> Option<V>,
list_set: fn(&mut S, usize, usize, V),
variable_name: &'static str,
descriptor_index: usize,
) -> Self {
Self {
first_entity_index,
first_position,
second_entity_index,
second_position,
list_len,
list_get,
list_set,
variable_name,
descriptor_index,
indices: [first_entity_index, second_entity_index],
}
}
pub fn first_entity_index(&self) -> usize {
self.first_entity_index
}
pub fn first_position(&self) -> usize {
self.first_position
}
pub fn second_entity_index(&self) -> usize {
self.second_entity_index
}
pub fn second_position(&self) -> usize {
self.second_position
}
pub fn is_intra_list(&self) -> bool {
self.first_entity_index == self.second_entity_index
}
}
impl<S, V> Move<S> for ListSwapMove<S, V>
where
S: PlanningSolution,
V: Clone + PartialEq + Send + Sync + Debug + 'static,
{
fn is_doable<D: Director<S>>(&self, score_director: &D) -> bool {
let solution = score_director.working_solution();
let first_len = (self.list_len)(solution, self.first_entity_index);
if self.first_position >= first_len {
return false;
}
let second_len = (self.list_len)(solution, self.second_entity_index);
if self.second_position >= second_len {
return false;
}
if self.is_intra_list() && self.first_position == self.second_position {
return false;
}
let first_val = (self.list_get)(solution, self.first_entity_index, self.first_position);
let second_val = (self.list_get)(solution, self.second_entity_index, self.second_position);
first_val != second_val
}
fn do_move<D: Director<S>>(&self, score_director: &mut D) {
let first_val = (self.list_get)(
score_director.working_solution(),
self.first_entity_index,
self.first_position,
)
.expect("first position should be valid");
let second_val = (self.list_get)(
score_director.working_solution(),
self.second_entity_index,
self.second_position,
)
.expect("second position should be valid");
score_director.before_variable_changed(self.descriptor_index, self.first_entity_index);
if !self.is_intra_list() {
score_director.before_variable_changed(self.descriptor_index, self.second_entity_index);
}
(self.list_set)(
score_director.working_solution_mut(),
self.first_entity_index,
self.first_position,
second_val.clone(),
);
(self.list_set)(
score_director.working_solution_mut(),
self.second_entity_index,
self.second_position,
first_val.clone(),
);
score_director.after_variable_changed(self.descriptor_index, self.first_entity_index);
if !self.is_intra_list() {
score_director.after_variable_changed(self.descriptor_index, self.second_entity_index);
}
let list_set = self.list_set;
let first_entity = self.first_entity_index;
let first_pos = self.first_position;
let second_entity = self.second_entity_index;
let second_pos = self.second_position;
score_director.register_undo(Box::new(move |s: &mut S| {
list_set(s, first_entity, first_pos, first_val);
list_set(s, second_entity, second_pos, second_val);
}));
}
fn descriptor_index(&self) -> usize {
self.descriptor_index
}
fn entity_indices(&self) -> &[usize] {
if self.is_intra_list() {
&self.indices[0..1]
} else {
&self.indices
}
}
fn variable_name(&self) -> &str {
self.variable_name
}
fn tabu_signature<D: Director<S>>(&self, score_director: &D) -> MoveTabuSignature {
let first_val = (self.list_get)(
score_director.working_solution(),
self.first_entity_index,
self.first_position,
);
let second_val = (self.list_get)(
score_director.working_solution(),
self.second_entity_index,
self.second_position,
);
let first_id = encode_option_debug(first_val.as_ref());
let second_id = encode_option_debug(second_val.as_ref());
let first_entity_id = encode_usize(self.first_entity_index);
let second_entity_id = encode_usize(self.second_entity_index);
let scope = MoveTabuScope::new(self.descriptor_index, self.variable_name);
let mut entity_tokens: SmallVec<[ScopedEntityTabuToken; 2]> =
smallvec![scope.entity_token(first_entity_id)];
if !self.is_intra_list() {
entity_tokens.push(scope.entity_token(second_entity_id));
}
let coordinate_pair = ordered_coordinate_pair(
(first_entity_id, encode_usize(self.first_position)),
(second_entity_id, encode_usize(self.second_position)),
);
let move_id = scoped_move_identity(
scope,
TABU_OP_LIST_SWAP,
coordinate_pair
.into_iter()
.flat_map(|(entity_id, position)| [entity_id, position]),
);
MoveTabuSignature::new(scope, move_id.clone(), move_id)
.with_entity_tokens(entity_tokens)
.with_destination_value_tokens([
scope.value_token(second_id),
scope.value_token(first_id),
])
}
}