pub struct IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>where
Sc: Score,{ /* private fields */ }Expand description
Zero-erasure incremental bi-constraint for self-joins.
All function types are concrete generics - no trait objects, no Arc. Uses key-based indexing: entities are grouped by join key for O(k) lookups.
Implementations§
Source§impl<S, A, K, E, KE, F, W, Sc> IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
impl<S, A, K, E, KE, F, W, Sc> IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
pub fn new( constraint_ref: ConstraintRef, impact_type: ImpactType, extractor: E, key_extractor: KE, filter: F, weight: W, is_hard: bool, ) -> Self
Trait Implementations§
Source§impl<S, A, K, E, KE, F, W, Sc: Score> Debug for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
impl<S, A, K, E, KE, F, W, Sc: Score> Debug for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
Source§impl<S, A, K, E, KE, F, W, Sc> IncrementalConstraint<S, Sc> for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
impl<S, A, K, E, KE, F, W, Sc> IncrementalConstraint<S, Sc> for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
Source§fn match_count(&self, solution: &S) -> usize
fn match_count(&self, solution: &S) -> usize
Returns the number of matches for this constraint.
Source§fn initialize(&mut self, solution: &S) -> Sc
fn initialize(&mut self, solution: &S) -> Sc
Initializes internal state by inserting all entities. Read more
Source§fn on_insert(&mut self, solution: &S, entity_index: usize) -> Sc
fn on_insert(&mut self, solution: &S, entity_index: usize) -> Sc
Called when an entity is inserted or its variable changes. Read more
Source§fn on_retract(&mut self, solution: &S, entity_index: usize) -> Sc
fn on_retract(&mut self, solution: &S, entity_index: usize) -> Sc
Called when an entity is retracted or before its variable changes. Read more
Source§fn constraint_ref(&self) -> ConstraintRef
fn constraint_ref(&self) -> ConstraintRef
Returns the constraint reference (package + name). Read more
Source§fn get_matches(&self, solution: &S) -> Vec<DetailedConstraintMatch<Sc>>
fn get_matches(&self, solution: &S) -> Vec<DetailedConstraintMatch<Sc>>
Returns detailed matches with entity justifications. Read more
Auto Trait Implementations§
impl<S, A, K, E, KE, F, W, Sc> Freeze for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
impl<S, A, K, E, KE, F, W, Sc> RefUnwindSafe for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>where
E: RefUnwindSafe,
KE: RefUnwindSafe,
F: RefUnwindSafe,
W: RefUnwindSafe,
S: RefUnwindSafe,
A: RefUnwindSafe,
Sc: RefUnwindSafe,
K: RefUnwindSafe,
impl<S, A, K, E, KE, F, W, Sc> Send for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
impl<S, A, K, E, KE, F, W, Sc> Sync for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
impl<S, A, K, E, KE, F, W, Sc> Unpin for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>
impl<S, A, K, E, KE, F, W, Sc> UnwindSafe for IncrementalBiConstraint<S, A, K, E, KE, F, W, Sc>where
E: UnwindSafe,
KE: UnwindSafe,
F: UnwindSafe,
W: UnwindSafe,
K: UnwindSafe,
S: UnwindSafe,
A: 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