pub struct ListCheapestInsertionPhase<S, E>{ /* private fields */ }Expand description
List construction phase using the canonical cheapest-insertion kernel.
The source key is mandatory. It is the one identity used to bind declarations, resolve assigned values, retain trace positions, and map precedence successors; the phase never falls back to payload equality or hashing.
Implementations§
Source§impl<S, E> ListCheapestInsertionPhase<S, E>
impl<S, E> ListCheapestInsertionPhase<S, E>
Sourcepub fn new(
element_count: fn(&S) -> usize,
get_assigned: fn(&S) -> Vec<E>,
entity_count: fn(&S) -> usize,
list_len: fn(&S, usize) -> usize,
list_insert: fn(&mut S, usize, usize, E),
list_remove: fn(&mut S, usize, usize) -> E,
index_to_element: fn(&S, usize) -> E,
element_source_key: fn(&S, &E) -> usize,
descriptor_index: usize,
) -> Self
pub fn new( element_count: fn(&S) -> usize, get_assigned: fn(&S) -> Vec<E>, entity_count: fn(&S) -> usize, list_len: fn(&S, usize) -> usize, list_insert: fn(&mut S, usize, usize, E), list_remove: fn(&mut S, usize, usize) -> E, index_to_element: fn(&S, usize) -> E, element_source_key: fn(&S, &E) -> usize, descriptor_index: usize, ) -> Self
Creates a cheapest-insertion phase over an explicitly keyed source.
pub fn with_element_owner_fn( self, element_owner_fn: Option<fn(&S, &E) -> Option<usize>>, ) -> Self
pub fn with_element_order_key( self, element_order_key: Option<fn(&S, E) -> i64>, ) -> Self
pub fn with_precedence_hooks( self, duration_fn: Option<fn(&S, E) -> usize>, successors_fn: Option<fn(&S, E, &mut Vec<E>)>, ) -> Self
Trait Implementations§
Source§impl<S, E> Debug for ListCheapestInsertionPhase<S, E>
impl<S, E> Debug for ListCheapestInsertionPhase<S, E>
Source§impl<S, E, D, BestCb> Phase<S, D, BestCb> for ListCheapestInsertionPhase<S, E>where
S: PlanningSolution,
S::Score: Copy + Ord,
E: Copy + Send + Sync + 'static,
D: Director<S>,
BestCb: ProgressCallback<S>,
impl<S, E, D, BestCb> Phase<S, D, BestCb> for ListCheapestInsertionPhase<S, E>where
S: PlanningSolution,
S::Score: Copy + Ord,
E: Copy + Send + Sync + 'static,
D: Director<S>,
BestCb: ProgressCallback<S>,
fn solve(&mut self, solver_scope: &mut SolverScope<'_, S, D, BestCb>)
fn phase_type_name(&self) -> &'static str
Source§fn on_solver_terminal(
&mut self,
_solver_scope: &mut SolverScope<'_, S, D, BestCb>,
)
fn on_solver_terminal( &mut self, _solver_scope: &mut SolverScope<'_, S, D, BestCb>, )
Runs once when the enclosing solver reaches its terminal boundary. Read more
Source§fn candidate_trace_plan(&self) -> CandidateTracePhasePlan
fn candidate_trace_plan(&self) -> CandidateTracePhasePlan
Returns the exact resolved-plan provenance this phase can prove. Read more
Auto Trait Implementations§
impl<S, E> Freeze for ListCheapestInsertionPhase<S, E>
impl<S, E> RefUnwindSafe for ListCheapestInsertionPhase<S, E>
impl<S, E> Send for ListCheapestInsertionPhase<S, E>
impl<S, E> Sync for ListCheapestInsertionPhase<S, E>
impl<S, E> Unpin for ListCheapestInsertionPhase<S, E>
impl<S, E> UnsafeUnpin for ListCheapestInsertionPhase<S, E>
impl<S, E> UnwindSafe for ListCheapestInsertionPhase<S, E>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more