use std::fmt::Debug;
use solverforge_core::domain::PlanningSolution;
use super::Acceptor;
pub struct ValueTabuAcceptor {
value_tabu_size: usize,
value_tabu_list: Vec<u64>,
current_step_values: Vec<u64>,
}
impl Debug for ValueTabuAcceptor {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
f.debug_struct("ValueTabuAcceptor")
.field("value_tabu_size", &self.value_tabu_size)
.field("tabu_list_len", &self.value_tabu_list.len())
.finish()
}
}
impl Clone for ValueTabuAcceptor {
fn clone(&self) -> Self {
Self {
value_tabu_size: self.value_tabu_size,
value_tabu_list: self.value_tabu_list.clone(),
current_step_values: self.current_step_values.clone(),
}
}
}
impl ValueTabuAcceptor {
pub fn new(value_tabu_size: usize) -> Self {
assert!(value_tabu_size > 0, "value_tabu_size must be > 0, got 0");
Self {
value_tabu_size,
value_tabu_list: Vec::with_capacity(value_tabu_size),
current_step_values: Vec::new(),
}
}
pub fn record_value_assignment(&mut self, value_hash: u64) {
self.current_step_values.push(value_hash);
}
pub fn is_value_tabu(&self, value_hash: u64) -> bool {
self.value_tabu_list.contains(&value_hash)
}
}
impl Default for ValueTabuAcceptor {
fn default() -> Self {
Self::new(7)
}
}
impl<S: PlanningSolution> Acceptor<S> for ValueTabuAcceptor {
fn is_accepted(&mut self, last_step_score: &S::Score, move_score: &S::Score) -> bool {
if move_score > last_step_score {
return true;
}
if move_score >= last_step_score {
return true;
}
false
}
fn phase_started(&mut self, _initial_score: &S::Score) {
self.value_tabu_list.clear();
self.current_step_values.clear();
}
fn phase_ended(&mut self) {
self.value_tabu_list.clear();
}
fn step_started(&mut self) {
self.current_step_values.clear();
}
fn step_ended(&mut self, _step_score: &S::Score) {
for value_hash in &self.current_step_values {
if self.value_tabu_list.len() >= self.value_tabu_size {
self.value_tabu_list.remove(0);
}
self.value_tabu_list.push(*value_hash);
}
self.current_step_values.clear();
}
}
#[cfg(test)]
#[path = "value_tabu_tests.rs"]
mod tests;