Struct IncrementalBiConstraint 

pub struct IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
where
    Sc: Score,
{ /* private fields */ }

Implementations

impl<S, A, K, E, KE, F, W, Sc> IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>

where S: 'static, A: Clone + 'static, K: Eq + Hash + Clone, E: Fn(&S) -> &[A], KE: Fn(&S, &A, usize) -> K, F: Fn(&S, &A, &A, usize, usize) -> bool, W: Fn(&S, usize, usize) -> Sc, Sc: Score,

pub fn new( constraint_ref: ConstraintRef, impact_type: ImpactType, extractor: E, key_extractor: KE, filter: F, weight: W, is_hard: bool, ) -> Self

Trait Implementations

impl<S, A, K, E, KE, F, W, Sc: Score> Debug for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<S, A, K, E, KE, F, W, Sc> IncrementalConstraint<S, Sc> for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>

where S: Send + Sync + 'static, A: Clone + Debug + Send + Sync + 'static, K: Eq + Hash + Clone + Send + Sync, E: Fn(&S) -> &[A] + Send + Sync, KE: Fn(&S, &A, usize) -> K + Send + Sync, F: Fn(&S, &A, &A, usize, usize) -> bool + Send + Sync, W: Fn(&S, usize, usize) -> Sc + Send + Sync, Sc: Score,

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

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

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

fn on_insert( &mut self, solution: &S, entity_index: usize, _descriptor_index: usize, ) -> Sc

fn on_retract( &mut self, solution: &S, entity_index: usize, _descriptor_index: usize, ) -> Sc

fn reset(&mut self)

fn name(&self) -> &str

fn is_hard(&self) -> bool

fn constraint_ref(&self) -> ConstraintRef

fn get_matches(&self, solution: &S) -> Vec<DetailedConstraintMatch<Sc>>

fn weight(&self) -> Sc