Skip to main content

CrossGroupedConstraint

Struct CrossGroupedConstraint 

Source
pub struct CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>
where Acc: Accumulator<V, R>, Sc: Score,
{ /* private fields */ }

Implementations§

Source§

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc> CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>
where S: Send + Sync + 'static, A: Send + Sync + 'static, B: Send + Sync + 'static, JK: Eq + Hash + Send + Sync + 'static, GK: Eq + Hash + Send + Sync + 'static, EA: CollectionExtract<S, Item = A> + Send + Sync, EB: CollectionExtract<S, Item = B> + Send + Sync, KA: Fn(&A) -> JK + Send + Sync, KB: Fn(&B) -> JK + Send + Sync, F: Fn(&S, &A, &B, usize, usize) -> bool + Send + Sync, GF: Fn(&A, &B) -> GK + Send + Sync, C: for<'i> Collector<(&'i A, &'i B), Value = V, Result = R, Accumulator = Acc> + Send + Sync, V: Send + Sync + 'static, R: Send + Sync + 'static, Acc: Accumulator<V, R> + Send + Sync + 'static, W: Fn(&GK, &R) -> Sc + Send + Sync, Sc: Score + 'static,

Source

pub fn new( constraint_ref: ConstraintRef, impact_type: ImpactType, extractor_a: EA, extractor_b: EB, key_a: KA, key_b: KB, filter: F, group_key_fn: GF, collector: C, weight_fn: W, is_hard: bool, ) -> Self

Source

pub fn penalize<W2>( self, weight: W2, ) -> CrossGroupedConstraintSetBuilder<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, GroupedTerminalScorer<GK, R, W, Sc>, impl Fn(&GK, &R) -> Sc + Send + Sync, Sc>
where W2: for<'w> ConstraintWeight<(&'w GK, &'w R), Sc> + Send + Sync,

Source

pub fn reward<W2>( self, weight: W2, ) -> CrossGroupedConstraintSetBuilder<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, GroupedTerminalScorer<GK, R, W, Sc>, impl Fn(&GK, &R) -> Sc + Send + Sync, Sc>
where W2: for<'w> ConstraintWeight<(&'w GK, &'w R), Sc> + Send + Sync,

Trait Implementations§

Source§

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc> IncrementalConstraint<S, Sc> for CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>
where S: Send + Sync + 'static, A: Send + Sync + 'static, B: Send + Sync + 'static, JK: Eq + Hash + Send + Sync + 'static, GK: Eq + Hash + Send + Sync + 'static, EA: CollectionExtract<S, Item = A> + Send + Sync, EB: CollectionExtract<S, Item = B> + Send + Sync, KA: Fn(&A) -> JK + Send + Sync, KB: Fn(&B) -> JK + Send + Sync, F: Fn(&S, &A, &B, usize, usize) -> bool + Send + Sync, GF: Fn(&A, &B) -> GK + Send + Sync, C: for<'i> Collector<(&'i A, &'i B), Value = V, Result = R, Accumulator = Acc> + Send + Sync, V: Send + Sync + 'static, R: Send + Sync + 'static, Acc: Accumulator<V, R> + Send + Sync + 'static, W: Fn(&GK, &R) -> Sc + Send + Sync, Sc: Score + 'static,

Source§

fn evaluate(&self, solution: &S) -> Sc

Source§

fn match_count(&self, solution: &S) -> usize

Source§

fn initialize(&mut self, solution: &S) -> Sc

Source§

fn on_insert( &mut self, solution: &S, entity_index: usize, descriptor_index: usize, ) -> Sc

Source§

fn on_retract( &mut self, solution: &S, entity_index: usize, descriptor_index: usize, ) -> Sc

Source§

fn reset(&mut self)

Source§

fn constraint_ref(&self) -> &ConstraintRef

Source§

fn is_hard(&self) -> bool

Source§

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

Source§

fn weight(&self) -> Sc

Source§

fn name(&self) -> &str

Auto Trait Implementations§

§

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc> Freeze for CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>
where Sc: Freeze, EA: Freeze, EB: Freeze, KA: Freeze, KB: Freeze, F: Freeze, GF: Freeze, C: Freeze, W: Freeze,

§

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc> RefUnwindSafe for CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>

§

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc> Send for CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>
where EA: Send, EB: Send, KA: Send, KB: Send, F: Send, GF: Send, C: Send, W: Send, JK: Send, GK: Send,

§

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc> Sync for CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>
where EA: Sync, EB: Sync, KA: Sync, KB: Sync, F: Sync, GF: Sync, C: Sync, W: Sync, JK: Sync, GK: Sync,

§

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc> Unpin for CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>
where Sc: Unpin, EA: Unpin, EB: Unpin, KA: Unpin, KB: Unpin, F: Unpin, GF: Unpin, C: Unpin, W: Unpin, <Acc as Accumulator<V, R>>::Retraction: Unpin, GK: Unpin, Acc: Unpin, JK: Unpin,

§

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc> UnsafeUnpin for CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>

§

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc> UnwindSafe for CrossGroupedConstraint<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc, W, Sc>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<S, Sc, C> ConstraintSet<S, Sc> for C
where S: Send + Sync, Sc: Score, C: IncrementalConstraint<S, Sc>,

Source§

fn evaluate_all(&self, solution: &S) -> Sc

Source§

fn constraint_count(&self) -> usize

Source§

fn constraint_metadata_entries(&self) -> Vec<ConstraintMetadata<'_>>

Source§

fn evaluate_each<'a>(&'a self, solution: &S) -> Vec<ConstraintResult<'a, Sc>>

Source§

fn evaluate_detailed<'a>( &'a self, solution: &S, ) -> Vec<ConstraintAnalysis<'a, Sc>>

Source§

fn initialize_all(&mut self, solution: &S) -> Sc

Source§

fn on_insert_all( &mut self, solution: &S, entity_index: usize, descriptor_index: usize, ) -> Sc

Source§

fn on_retract_all( &mut self, solution: &S, entity_index: usize, descriptor_index: usize, ) -> Sc

Source§

fn reset_all(&mut self)

Source§

fn constraint_metadata(&self) -> Vec<ConstraintMetadata<'_>>

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.