Struct IfExistsUniConstraint 

pub struct IfExistsUniConstraint<S, A, B, K, EA, EB, KA, KB, FA, W, Sc>
where
    Sc: Score,
{ /* private fields */ }

Implementations

impl<S, A, B, K, EA, EB, KA, KB, FA, W, Sc> IfExistsUniConstraint<S, A, B, K, EA, EB, KA, KB, FA, W, Sc>

where S: 'static, A: Clone + 'static, B: Clone + 'static, K: Eq + Hash + Clone, EA: Fn(&S) -> &[A], EB: Fn(&S) -> Vec<B>, KA: Fn(&A) -> K, KB: Fn(&B) -> K, FA: Fn(&S, &A) -> bool, W: Fn(&A) -> Sc, Sc: Score,

pub fn new( constraint_ref: ConstraintRef, impact_type: ImpactType, mode: ExistenceMode, extractor_a: EA, extractor_b: EB, key_a: KA, key_b: KB, filter_a: FA, weight: W, is_hard: bool, ) -> Self

Trait Implementations

impl<S, A, B, K, EA, EB, KA, KB, FA, W, Sc: Score> Debug for IfExistsUniConstraint<S, A, B, K, EA, EB, KA, KB, FA, W, Sc>

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

Formats the value using the given formatter.

impl<S, A, B, K, EA, EB, KA, KB, FA, W, Sc> IncrementalConstraint<S, Sc> for IfExistsUniConstraint<S, A, B, K, EA, EB, KA, KB, FA, W, Sc>

where S: Send + Sync + 'static, A: Clone + Send + Sync + 'static, B: Clone + Send + Sync + 'static, K: Eq + Hash + Clone + Send + Sync, EA: Fn(&S) -> &[A] + Send + Sync, EB: Fn(&S) -> Vec<B> + Send + Sync, KA: Fn(&A) -> K + Send + Sync, KB: Fn(&B) -> K + Send + Sync, FA: Fn(&S, &A) -> bool + Send + Sync, W: Fn(&A) -> 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