pub struct FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>where
Sc: Score,{ /* private fields */ }Implementations§
Source§impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>where
S: 'static,
A: Clone + 'static,
B: Clone + 'static,
C: Clone + 'static,
K: Eq + Hash + Clone,
CK: Eq + Hash + Clone,
EA: Fn(&S) -> &[A],
EB: Fn(&S) -> &[B],
KA: Fn(&A) -> K,
KB: Fn(&B) -> K,
Flatten: Fn(&B) -> &[C],
CKeyFn: Fn(&C) -> CK,
ALookup: Fn(&A) -> CK,
F: Fn(&S, &A, &C) -> bool,
W: Fn(&A, &C) -> Sc,
Sc: Score,
impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>where
S: 'static,
A: Clone + 'static,
B: Clone + 'static,
C: Clone + 'static,
K: Eq + Hash + Clone,
CK: Eq + Hash + Clone,
EA: Fn(&S) -> &[A],
EB: Fn(&S) -> &[B],
KA: Fn(&A) -> K,
KB: Fn(&B) -> K,
Flatten: Fn(&B) -> &[C],
CKeyFn: Fn(&C) -> CK,
ALookup: Fn(&A) -> CK,
F: Fn(&S, &A, &C) -> bool,
W: Fn(&A, &C) -> Sc,
Sc: Score,
pub fn new( constraint_ref: ConstraintRef, impact_type: ImpactType, extractor_a: EA, extractor_b: EB, key_a: KA, key_b: KB, flatten: Flatten, c_key_fn: CKeyFn, a_lookup_fn: ALookup, filter: F, weight: W, is_hard: bool, ) -> Self
Trait Implementations§
Source§impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc: Score> Debug for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>
impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc: Score> Debug for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>
Source§impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> IncrementalConstraint<S, Sc> for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>where
S: Send + Sync + 'static,
A: Clone + Send + Sync + 'static,
B: Clone + Send + Sync + 'static,
C: Clone + Send + Sync + 'static,
K: Eq + Hash + Clone + Send + Sync,
CK: Eq + Hash + Clone + Send + Sync,
EA: Fn(&S) -> &[A] + Send + Sync,
EB: Fn(&S) -> &[B] + Send + Sync,
KA: Fn(&A) -> K + Send + Sync,
KB: Fn(&B) -> K + Send + Sync,
Flatten: Fn(&B) -> &[C] + Send + Sync,
CKeyFn: Fn(&C) -> CK + Send + Sync,
ALookup: Fn(&A) -> CK + Send + Sync,
F: Fn(&S, &A, &C) -> bool + Send + Sync,
W: Fn(&A, &C) -> Sc + Send + Sync,
Sc: Score,
impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> IncrementalConstraint<S, Sc> for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>where
S: Send + Sync + 'static,
A: Clone + Send + Sync + 'static,
B: Clone + Send + Sync + 'static,
C: Clone + Send + Sync + 'static,
K: Eq + Hash + Clone + Send + Sync,
CK: Eq + Hash + Clone + Send + Sync,
EA: Fn(&S) -> &[A] + Send + Sync,
EB: Fn(&S) -> &[B] + Send + Sync,
KA: Fn(&A) -> K + Send + Sync,
KB: Fn(&B) -> K + Send + Sync,
Flatten: Fn(&B) -> &[C] + Send + Sync,
CKeyFn: Fn(&C) -> CK + Send + Sync,
ALookup: Fn(&A) -> CK + Send + Sync,
F: Fn(&S, &A, &C) -> bool + Send + Sync,
W: Fn(&A, &C) -> 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, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> Freeze for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>
impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> RefUnwindSafe for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>where
EA: RefUnwindSafe,
EB: RefUnwindSafe,
KA: RefUnwindSafe,
KB: RefUnwindSafe,
Flatten: RefUnwindSafe,
CKeyFn: RefUnwindSafe,
ALookup: RefUnwindSafe,
F: RefUnwindSafe,
W: RefUnwindSafe,
Sc: RefUnwindSafe,
K: RefUnwindSafe,
CK: RefUnwindSafe,
C: RefUnwindSafe,
impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> Send for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>
impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> Sync for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>
impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> Unpin for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>
impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> UnsafeUnpin for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>where
EA: UnsafeUnpin,
EB: UnsafeUnpin,
KA: UnsafeUnpin,
KB: UnsafeUnpin,
Flatten: UnsafeUnpin,
CKeyFn: UnsafeUnpin,
ALookup: UnsafeUnpin,
F: UnsafeUnpin,
W: UnsafeUnpin,
impl<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc> UnwindSafe for FlattenedBiConstraint<S, A, B, C, K, CK, EA, EB, KA, KB, Flatten, CKeyFn, ALookup, F, W, Sc>where
EA: UnwindSafe,
EB: UnwindSafe,
KA: UnwindSafe,
KB: UnwindSafe,
Flatten: UnwindSafe,
CKeyFn: UnwindSafe,
ALookup: UnwindSafe,
F: UnwindSafe,
W: UnwindSafe,
Sc: UnwindSafe,
K: UnwindSafe,
CK: UnwindSafe,
C: 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