Skip to main content

Grouped

Struct Grouped 

Source
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,

Source

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,

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
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,

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 name(&self) -> &str

Source§

fn is_hard(&self) -> bool

Source§

fn constraint_ref(&self) -> &ConstraintRef

Source§

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

Source§

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> 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 = !

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

fn try_from(value: U) -> Result<T, !>

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.