pub struct IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>where
Sc: Score,{ /* private fields */ }Implementations§
Source§impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>where
S: 'static,
A: Clone + 'static,
P: Clone + 'static,
B: Clone + 'static,
K: Eq + Hash + Clone,
EA: TrackedCollectionExtract<S, Item = A>,
EP: TrackedCollectionExtract<S, Item = P>,
KA: Fn(&A) -> K,
KB: Fn(&B) -> K,
FA: UniFilter<S, A>,
FP: UniFilter<S, P>,
Flatten: FlattenExtract<P, Item = B>,
W: Fn(&A) -> Sc,
Sc: Score,
impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>where
S: 'static,
A: Clone + 'static,
P: Clone + 'static,
B: Clone + 'static,
K: Eq + Hash + Clone,
EA: TrackedCollectionExtract<S, Item = A>,
EP: TrackedCollectionExtract<S, Item = P>,
KA: Fn(&A) -> K,
KB: Fn(&B) -> K,
FA: UniFilter<S, A>,
FP: UniFilter<S, P>,
Flatten: FlattenExtract<P, Item = B>,
W: Fn(&A) -> Sc,
Sc: Score,
pub fn new( constraint_ref: ConstraintRef, impact_type: ImpactType, mode: ExistenceMode, extractor_a: EA, extractor_parent: EP, key_a: KA, key_b: KB, filter_a: FA, filter_parent: FP, flatten: Flatten, weight: W, is_hard: bool, ) -> Self
Trait Implementations§
Source§impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> IncrementalConstraint<S, Sc> for IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>where
S: Send + Sync + 'static,
A: Clone + Send + Sync + 'static,
P: Clone + Send + Sync + 'static,
B: Clone + Send + Sync + 'static,
K: Eq + Hash + Clone + Send + Sync,
EA: TrackedCollectionExtract<S, Item = A> + Send + Sync,
EP: TrackedCollectionExtract<S, Item = P> + Send + Sync,
KA: Fn(&A) -> K + Send + Sync,
KB: Fn(&B) -> K + Send + Sync,
FA: UniFilter<S, A> + Send + Sync,
FP: UniFilter<S, P> + Send + Sync,
Flatten: FlattenExtract<P, Item = B> + Send + Sync,
W: Fn(&A) -> Sc + Send + Sync,
Sc: Score,
impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> IncrementalConstraint<S, Sc> for IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>where
S: Send + Sync + 'static,
A: Clone + Send + Sync + 'static,
P: Clone + Send + Sync + 'static,
B: Clone + Send + Sync + 'static,
K: Eq + Hash + Clone + Send + Sync,
EA: TrackedCollectionExtract<S, Item = A> + Send + Sync,
EP: TrackedCollectionExtract<S, Item = P> + Send + Sync,
KA: Fn(&A) -> K + Send + Sync,
KB: Fn(&B) -> K + Send + Sync,
FA: UniFilter<S, A> + Send + Sync,
FP: UniFilter<S, P> + Send + Sync,
Flatten: FlattenExtract<P, Item = B> + 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
Auto Trait Implementations§
impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> Freeze for IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>
impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> RefUnwindSafe for IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>where
EA: RefUnwindSafe,
EP: RefUnwindSafe,
KA: RefUnwindSafe,
KB: RefUnwindSafe,
FA: RefUnwindSafe,
FP: RefUnwindSafe,
Flatten: RefUnwindSafe,
W: RefUnwindSafe,
Sc: RefUnwindSafe,
K: RefUnwindSafe,
impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> Send for IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>
impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> Sync for IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>
impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> Unpin for IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>
impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> UnsafeUnpin for IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>where
EA: UnsafeUnpin,
EP: UnsafeUnpin,
KA: UnsafeUnpin,
KB: UnsafeUnpin,
FA: UnsafeUnpin,
FP: UnsafeUnpin,
Flatten: UnsafeUnpin,
W: UnsafeUnpin,
impl<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc> UnwindSafe for IncrementalExistsConstraint<S, A, P, B, K, EA, EP, KA, KB, FA, FP, Flatten, W, Sc>where
EA: UnwindSafe,
EP: UnwindSafe,
KA: UnwindSafe,
KB: UnwindSafe,
FA: UnwindSafe,
FP: UnwindSafe,
Flatten: UnwindSafe,
W: UnwindSafe,
K: UnwindSafe,
Sc: UnwindSafe,
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