Struct DirectedBi 

pub struct DirectedBi<S, Out, K, Src, F, KL, KR, PF, W, Sc>
where
    Src: Source<S, Out>,
    Sc: Score,
{ /* private fields */ }

Implementations

impl<S, Out, K, Src, F, KL, KR, PF, W, Sc> DirectedBi<S, Out, K, Src, F, KL, KR, PF, W, Sc>

where S: Send + Sync + 'static, Out: Send + Sync + 'static, K: Eq + Hash + Send + Sync + 'static, Src: Source<S, Out>, F: UniFilter<S, Out>, KL: Fn(&Out) -> K + Send + Sync, KR: Fn(&Out) -> K + Send + Sync, PF: BiFilter<S, Out, Out>, W: Fn(&Out, &Out) -> Sc + Send + Sync, Sc: Score + 'static,

pub fn new( constraint_ref: ConstraintRef, impact_type: ImpactType, source: Src, filter: F, left_key_fn: KL, right_key_fn: KR, pair_filter: PF, weight: W, is_hard: bool, ) -> Self

Trait Implementations

impl<S, Out, K, Src, F, KL, KR, PF, W, Sc> IncrementalConstraint<S, Sc> for DirectedBi<S, Out, K, Src, F, KL, KR, PF, W, Sc>

where S: Send + Sync + 'static, Out: Send + Sync + 'static, K: Eq + Hash + Send + Sync + 'static, Src: Source<S, Out>, F: UniFilter<S, Out>, KL: Fn(&Out) -> K + Send + Sync, KR: Fn(&Out) -> K + Send + Sync, PF: BiFilter<S, Out, Out>, W: Fn(&Out, &Out) -> Sc + Send + Sync, Sc: Score + 'static,

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 constraint_ref(&self) -> &ConstraintRef

fn is_hard(&self) -> bool

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

fn weight(&self) -> Sc