pub struct Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
Acc: Accumulator<V, R>,
Sc: Score,{ /* private fields */ }Implementations§
Source§impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
S: 'static,
A: Clone + 'static,
B: Clone + 'static,
K: Clone + Eq + Hash,
EA: CollectionExtract<S, Item = A>,
EB: CollectionExtract<S, Item = B>,
KA: Fn(&A) -> Option<K>,
KB: Fn(&B) -> K,
C: for<'i> Collector<&'i A, Value = V, Result = R, Accumulator = Acc>,
Acc: Accumulator<V, R>,
D: Fn(&B) -> R,
W: Fn(&K, &R) -> Sc,
Sc: Score,
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
S: 'static,
A: Clone + 'static,
B: Clone + 'static,
K: Clone + Eq + Hash,
EA: CollectionExtract<S, Item = A>,
EB: CollectionExtract<S, Item = B>,
KA: Fn(&A) -> Option<K>,
KB: Fn(&B) -> K,
C: for<'i> Collector<&'i A, Value = V, Result = R, Accumulator = Acc>,
Acc: Accumulator<V, R>,
D: Fn(&B) -> R,
W: Fn(&K, &R) -> Sc,
Sc: Score,
pub fn new( constraint_ref: ConstraintRef, impact_type: ImpactType, extractor_a: EA, extractor_b: EB, key_a: KA, key_b: KB, collector: C, default_fn: D, weight_fn: W, is_hard: bool, ) -> Self
Trait Implementations§
Source§impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> Debug for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
C: for<'i> Collector<&'i A, Value = V, Result = R, Accumulator = Acc>,
Acc: Accumulator<V, R>,
Sc: Score,
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> Debug for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
C: for<'i> Collector<&'i A, Value = V, Result = R, Accumulator = Acc>,
Acc: Accumulator<V, R>,
Sc: Score,
Source§impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> IncrementalConstraint<S, Sc> for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
S: Send + Sync + 'static,
A: Clone + Send + Sync + 'static,
B: Clone + Send + Sync + 'static,
K: Clone + Eq + Hash + Send + Sync,
EA: CollectionExtract<S, Item = A>,
EB: CollectionExtract<S, Item = B>,
KA: Fn(&A) -> Option<K> + Send + Sync,
KB: Fn(&B) -> K + Send + Sync,
C: for<'i> Collector<&'i A, Value = V, Result = R, Accumulator = Acc> + Send + Sync,
V: Send + Sync,
R: Send + Sync,
Acc: Accumulator<V, R> + Send + Sync,
D: Fn(&B) -> R + Send + Sync,
W: Fn(&K, &R) -> Sc + Send + Sync,
Sc: Score,
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> IncrementalConstraint<S, Sc> for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
S: Send + Sync + 'static,
A: Clone + Send + Sync + 'static,
B: Clone + Send + Sync + 'static,
K: Clone + Eq + Hash + Send + Sync,
EA: CollectionExtract<S, Item = A>,
EB: CollectionExtract<S, Item = B>,
KA: Fn(&A) -> Option<K> + Send + Sync,
KB: Fn(&B) -> K + Send + Sync,
C: for<'i> Collector<&'i A, Value = V, Result = R, Accumulator = Acc> + Send + Sync,
V: Send + Sync,
R: Send + Sync,
Acc: Accumulator<V, R> + Send + Sync,
D: Fn(&B) -> R + Send + Sync,
W: Fn(&K, &R) -> 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<'a>( &'a self, _solution: &S, ) -> Vec<DetailedConstraintMatch<'a, Sc>>
fn weight(&self) -> Sc
Auto Trait Implementations§
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> Freeze for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
EA: Freeze,
EB: Freeze,
KA: Freeze,
KB: Freeze,
C: Freeze,
D: Freeze,
W: Freeze,
HashMap<K, GroupState<Acc>>: Freeze,
HashMap<usize, K>: Freeze,
HashMap<usize, <Acc as Accumulator<V, R>>::Retraction>: Freeze,
HashMap<K, Vec<usize>>: Freeze,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> V, fn() -> R, fn() -> Acc, fn() -> Sc)>: Freeze,
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> RefUnwindSafe for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
EA: RefUnwindSafe,
EB: RefUnwindSafe,
KA: RefUnwindSafe,
KB: RefUnwindSafe,
C: RefUnwindSafe,
D: RefUnwindSafe,
W: RefUnwindSafe,
HashMap<K, GroupState<Acc>>: RefUnwindSafe,
HashMap<usize, K>: RefUnwindSafe,
HashMap<usize, <Acc as Accumulator<V, R>>::Retraction>: RefUnwindSafe,
HashMap<K, Vec<usize>>: RefUnwindSafe,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> V, fn() -> R, fn() -> Acc, fn() -> Sc)>: RefUnwindSafe,
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> Send for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
EA: Send,
EB: Send,
KA: Send,
KB: Send,
C: Send,
D: Send,
W: Send,
HashMap<K, GroupState<Acc>>: Send,
HashMap<usize, K>: Send,
HashMap<usize, <Acc as Accumulator<V, R>>::Retraction>: Send,
HashMap<K, Vec<usize>>: Send,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> V, fn() -> R, fn() -> Acc, fn() -> Sc)>: Send,
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> Sync for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
EA: Sync,
EB: Sync,
KA: Sync,
KB: Sync,
C: Sync,
D: Sync,
W: Sync,
HashMap<K, GroupState<Acc>>: Sync,
HashMap<usize, K>: Sync,
HashMap<usize, <Acc as Accumulator<V, R>>::Retraction>: Sync,
HashMap<K, Vec<usize>>: Sync,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> V, fn() -> R, fn() -> Acc, fn() -> Sc)>: Sync,
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> Unpin for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
EA: Unpin,
EB: Unpin,
KA: Unpin,
KB: Unpin,
C: Unpin,
D: Unpin,
W: Unpin,
HashMap<K, GroupState<Acc>>: Unpin,
HashMap<usize, K>: Unpin,
HashMap<usize, <Acc as Accumulator<V, R>>::Retraction>: Unpin,
HashMap<K, Vec<usize>>: Unpin,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> V, fn() -> R, fn() -> Acc, fn() -> Sc)>: Unpin,
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> UnsafeUnpin for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
EA: UnsafeUnpin,
EB: UnsafeUnpin,
KA: UnsafeUnpin,
KB: UnsafeUnpin,
C: UnsafeUnpin,
D: UnsafeUnpin,
W: UnsafeUnpin,
HashMap<K, GroupState<Acc>>: UnsafeUnpin,
HashMap<usize, K>: UnsafeUnpin,
HashMap<usize, <Acc as Accumulator<V, R>>::Retraction>: UnsafeUnpin,
HashMap<K, Vec<usize>>: UnsafeUnpin,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> V, fn() -> R, fn() -> Acc, fn() -> Sc)>: UnsafeUnpin,
impl<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc> UnwindSafe for Grouped<S, A, B, K, EA, EB, KA, KB, C, V, R, Acc, D, W, Sc>where
EA: UnwindSafe,
EB: UnwindSafe,
KA: UnwindSafe,
KB: UnwindSafe,
C: UnwindSafe,
D: UnwindSafe,
W: UnwindSafe,
HashMap<K, GroupState<Acc>>: UnwindSafe,
HashMap<usize, K>: UnwindSafe,
HashMap<usize, <Acc as Accumulator<V, R>>::Retraction>: UnwindSafe,
HashMap<K, Vec<usize>>: UnwindSafe,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> V, fn() -> R, fn() -> Acc, fn() -> 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