use std::fmt;
use std::sync::Arc;
use crate::domain::{EntityClassId, SolutionDescriptor, VariableId};
use crate::score::Score;
mod backend;
mod resolution;
use backend::{BackendListAccess, BackendScalarAccess};
use resolution::{resolve_dynamic_descriptor_indexes, DynamicVariableKind};
mod assignment;
pub use assignment::{
DynamicScalarAssignmentMetadata, DynamicScalarAssignmentMetadataCapabilities,
};
mod list_slot;
pub use list_slot::DynamicListVariableSlot;
mod scalar_slot;
pub use scalar_slot::DynamicScalarVariableSlot;
pub trait DynamicModelBackend: Clone + Send + Sync + 'static {
type Score: Score;
fn entity_count(&self, entity: EntityClassId) -> usize;
fn get_scalar(&self, entity: EntityClassId, row: usize, variable: VariableId) -> Option<usize>;
fn set_scalar(
&mut self,
entity: EntityClassId,
row: usize,
variable: VariableId,
value: Option<usize>,
);
fn list_len(&self, entity: EntityClassId, row: usize, variable: VariableId) -> usize;
fn list_get(
&self,
entity: EntityClassId,
row: usize,
variable: VariableId,
pos: usize,
) -> Option<usize>;
fn list_insert(
&mut self,
entity: EntityClassId,
row: usize,
variable: VariableId,
pos: usize,
value: usize,
);
fn list_remove(
&mut self,
entity: EntityClassId,
row: usize,
variable: VariableId,
pos: usize,
) -> Option<usize>;
fn candidate_values(&self, entity: EntityClassId, row: usize, variable: VariableId)
-> &[usize];
fn scalar_value_is_legal(
&self,
entity: EntityClassId,
row: usize,
variable: VariableId,
value: usize,
) -> bool;
fn list_element_count(&self, _entity: EntityClassId, _variable: VariableId) -> usize {
0
}
fn list_element(
&self,
_entity: EntityClassId,
_variable: VariableId,
element_index: usize,
) -> Option<usize> {
Some(element_index)
}
fn list_assigned_elements(&self, _entity: EntityClassId, _variable: VariableId) -> Vec<usize> {
Vec::new()
}
}
pub trait DynamicScalarAccess<S>: Send + Sync {
fn entity_class(&self) -> EntityClassId;
fn variable(&self) -> VariableId;
fn entity_count(&self, solution: &S) -> usize;
fn get(&self, solution: &S, row: usize) -> Option<usize>;
fn set(&self, solution: &mut S, row: usize, value: Option<usize>);
fn candidate_values<'a>(&self, solution: &'a S, row: usize) -> &'a [usize];
fn value_is_legal(&self, solution: &S, row: usize, value: usize) -> bool;
fn has_nearby_value_candidates(&self) -> bool {
false
}
fn visit_nearby_value_candidates(
&self,
_solution: &S,
_row: usize,
_limit: usize,
_visit: &mut dyn FnMut(usize),
) -> bool {
false
}
fn nearby_value_distance(&self, _solution: &S, _row: usize, _candidate: usize) -> Option<f64> {
None
}
fn has_nearby_entity_candidates(&self) -> bool {
false
}
fn visit_nearby_entity_candidates(
&self,
_solution: &S,
_left_row: usize,
_limit: usize,
_visit: &mut dyn FnMut(usize),
) -> bool {
false
}
fn nearby_entity_distance(
&self,
_solution: &S,
_left_row: usize,
_right_row: usize,
) -> Option<f64> {
None
}
}
#[derive(Debug, Clone, Copy, Default, PartialEq, Eq)]
pub struct DynamicListAccessCapabilities {
pub set: bool,
pub replace: bool,
pub reverse: bool,
pub sublist: bool,
}
pub trait DynamicListAccess<S>: Send + Sync {
fn entity_class(&self) -> EntityClassId;
fn variable(&self) -> VariableId;
fn entity_count(&self, solution: &S) -> usize;
fn element_count(&self, solution: &S) -> usize;
fn element(&self, solution: &S, element_index: usize) -> Option<usize>;
fn assigned_elements(&self, solution: &S) -> Vec<usize>;
fn len(&self, solution: &S, row: usize) -> usize;
fn get(&self, solution: &S, row: usize, pos: usize) -> Option<usize>;
fn insert(&self, solution: &mut S, row: usize, pos: usize, value: usize);
fn remove(&self, solution: &mut S, row: usize, pos: usize) -> Option<usize>;
fn capabilities(&self) -> DynamicListAccessCapabilities {
DynamicListAccessCapabilities::default()
}
fn set(&self, _solution: &mut S, _row: usize, _pos: usize, _value: usize) -> bool {
false
}
fn replace(&self, _solution: &mut S, _row: usize, _values: Vec<usize>) -> bool {
false
}
fn reverse(&self, _solution: &mut S, _row: usize, _start: usize, _end: usize) -> bool {
false
}
fn sublist_remove(
&self,
_solution: &mut S,
_row: usize,
_start: usize,
_end: usize,
) -> Option<Vec<usize>> {
None
}
fn sublist_insert(
&self,
_solution: &mut S,
_row: usize,
_pos: usize,
_values: Vec<usize>,
) -> bool {
false
}
}
#[derive(Debug, Clone, Copy, Default, PartialEq, Eq)]
pub struct DynamicListMetadataCapabilities {
pub element_owner: bool,
pub construction_order_key: bool,
pub precedence_duration: bool,
pub precedence_successors: bool,
pub cross_position_distance: bool,
pub intra_position_distance: bool,
pub route: bool,
pub savings: bool,
}
pub trait DynamicListMetadata<S>: Send + Sync {
fn entity_class(&self) -> EntityClassId;
fn variable(&self) -> VariableId;
fn capabilities(&self) -> DynamicListMetadataCapabilities;
fn element_owner(&self, solution: &S, element: usize) -> Option<usize>;
fn construction_order_key(&self, solution: &S, element: usize) -> Option<i64>;
fn precedence_duration(&self, solution: &S, element: usize) -> Option<usize>;
fn extend_precedence_successors(
&self,
solution: &S,
element: usize,
successors: &mut Vec<usize>,
) -> bool;
fn cross_position_distance(
&self,
solution: &S,
from_entity: usize,
from_position: usize,
to_entity: usize,
to_position: usize,
) -> Option<f64>;
fn intra_position_distance(
&self,
solution: &S,
entity: usize,
from_position: usize,
to_position: usize,
) -> Option<f64>;
fn route_depot(&self, solution: &S, entity: usize) -> Option<usize>;
fn route_distance(&self, solution: &S, entity: usize, from: usize, to: usize) -> Option<i64>;
fn route_feasible(&self, solution: &S, entity: usize, route: &[usize]) -> Option<bool>;
fn savings_depot(&self, solution: &S, entity: usize) -> Option<usize>;
fn savings_metric_class(&self, solution: &S, entity: usize) -> Option<usize>;
fn savings_distance(&self, solution: &S, entity: usize, from: usize, to: usize) -> Option<i64>;
fn savings_feasible(&self, solution: &S, entity: usize, route: &[usize]) -> Option<bool>;
}