Struct ListPrecedenceMakespanConstraint 

pub struct ListPrecedenceMakespanConstraint<S> { /* private fields */ }

Implementations

impl<S> ListPrecedenceMakespanConstraint<S>

pub fn new( constraint_ref: ConstraintRef, list_descriptor_index: usize, node_count: fn(&S) -> usize, node_duration: fn(&S, usize) -> usize, fixed_successors: fn(&S, usize, &mut Vec<usize>), list_owner_count: fn(&S) -> usize, list_len: fn(&S, usize) -> usize, list_get: fn(&S, usize, usize) -> Option<usize>, ) -> ListPrecedenceMakespanConstraint<S>

pub fn with_expected_owner( self, expected_owner: Option<fn(&S, usize) -> Option<usize>>, ) -> ListPrecedenceMakespanConstraint<S>

Trait Implementations

impl<S> IncrementalConstraint<S, HardSoftScore> for ListPrecedenceMakespanConstraint<S>

where S: Send + Sync,

fn evaluate(&self, solution: &S) -> HardSoftScore

fn match_count(&self, solution: &S) -> usize

fn initialize(&mut self, solution: &S) -> HardSoftScore

fn on_insert( &mut self, solution: &S, entity_index: usize, descriptor_index: usize, ) -> HardSoftScore

fn on_retract( &mut self, _solution: &S, entity_index: usize, descriptor_index: usize, ) -> HardSoftScore

fn reset(&mut self)

fn constraint_ref(&self) -> &ConstraintRef

fn is_hard(&self) -> bool

fn weight(&self) -> HardSoftScore

fn name(&self) -> &str

fn get_matches<'a>( &'a self, _solution: &S, ) -> Vec<DetailedConstraintMatch<'a, Sc>>