pub struct Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
Sc: Score,
P1: CompileCondition<Plan: IndexedPlan>,
P2: CompileCondition<Plan: IndexedPlan>,{ /* private fields */ }Implementations§
Source§impl<S, A, B, C, EA, EB, EC, P1, P2, F, Sc> Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
S: Send + Sync + 'static,
A: Clone + Send + Sync + 'static,
B: Clone + Send + Sync + 'static,
C: Clone + Send + Sync + 'static,
EA: 'static,
EB: 'static,
EC: 'static,
P1: CompileCondition<Plan: IndexedPlan> + 'static,
P2: CompileCondition<Plan: IndexedPlan> + 'static,
for<'a> <P1 as CompileCondition>::Plan: ExecutablePlan<Leaf<'a, A>, Leaf<'a, B>>,
for<'a> <P2 as CompileCondition>::Plan: ExecutablePlan<Pair<Leaf<'a, A>, Leaf<'a, B>>, Leaf<'a, C>>,
JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>: Operator<S>,
JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: Operator<S>,
F: TriFilter<S, A, B, C>,
Sc: Score + 'static,
impl<S, A, B, C, EA, EB, EC, P1, P2, F, Sc> Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
S: Send + Sync + 'static,
A: Clone + Send + Sync + 'static,
B: Clone + Send + Sync + 'static,
C: Clone + Send + Sync + 'static,
EA: 'static,
EB: 'static,
EC: 'static,
P1: CompileCondition<Plan: IndexedPlan> + 'static,
P2: CompileCondition<Plan: IndexedPlan> + 'static,
for<'a> <P1 as CompileCondition>::Plan: ExecutablePlan<Leaf<'a, A>, Leaf<'a, B>>,
for<'a> <P2 as CompileCondition>::Plan: ExecutablePlan<Pair<Leaf<'a, A>, Leaf<'a, B>>, Leaf<'a, C>>,
JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>: Operator<S>,
JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: Operator<S>,
F: TriFilter<S, A, B, C>,
Sc: Score + 'static,
pub fn filter<P>( self, predicate: P, ) -> Tri<S, A, B, C, EA, EB, EC, P1, P2, AndTriFilter<F, FnTriFilter<impl Fn(&S, &A, &B, &C, usize, usize, usize) -> bool + Send + Sync>>, Sc>
pub fn join<D, ED, P3>(
self,
target: (ED, P3),
) -> Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, TriAsQuadFilter<F, A, B, C>, Sc>where
D: Clone + Send + Sync + 'static,
ED: CollectionExtract<S, Item = D> + 'static,
P3: CompileCondition + 'static,
for<'a> P3::Plan: IndexedPlan + ExecutablePlan<Pair<Pair<Leaf<'a, A>, Leaf<'a, B>>, Leaf<'a, C>>, Leaf<'a, D>>,
for<'a> JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: Operator<S, View<'a> = Pair<Pair<Leaf<'a, A>, Leaf<'a, B>>, Leaf<'a, C>>>,
for<'a> JoinNode<S, JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>, CollectionNode<S, ED>, <P3 as CompileCondition>::Plan>: Operator<S>,
pub fn penalize<W>( self, weight: W, ) -> Builder<S, A, B, C, EA, EB, EC, P1, P2, F, impl Fn(&A, &B, &C) -> Sc + Send + Sync, Sc>
pub fn reward<W>( self, weight: W, ) -> Builder<S, A, B, C, EA, EB, EC, P1, P2, F, impl Fn(&A, &B, &C) -> Sc + Send + Sync, Sc>
Auto Trait Implementations§
impl<S, A, B, C, EA, EB, EC, P1, P2, F, Sc> Freeze for Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: Freeze,
F: Freeze,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> Sc)>: Freeze,
impl<S, A, B, C, EA, EB, EC, P1, P2, F, Sc> RefUnwindSafe for Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: RefUnwindSafe,
F: RefUnwindSafe,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> Sc)>: RefUnwindSafe,
impl<S, A, B, C, EA, EB, EC, P1, P2, F, Sc> Send for Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: Send,
F: Send,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> Sc)>: Send,
impl<S, A, B, C, EA, EB, EC, P1, P2, F, Sc> Sync for Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: Sync,
F: Sync,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> Sc)>: Sync,
impl<S, A, B, C, EA, EB, EC, P1, P2, F, Sc> Unpin for Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: Unpin,
F: Unpin,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> Sc)>: Unpin,
impl<S, A, B, C, EA, EB, EC, P1, P2, F, Sc> UnsafeUnpin for Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: UnsafeUnpin,
F: UnsafeUnpin,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> Sc)>: UnsafeUnpin,
impl<S, A, B, C, EA, EB, EC, P1, P2, F, Sc> UnwindSafe for Tri<S, A, B, C, EA, EB, EC, P1, P2, F, Sc>where
JoinNode<S, JoinNode<S, CollectionNode<S, EA>, CollectionNode<S, EB>, <P1 as CompileCondition>::Plan>, CollectionNode<S, EC>, <P2 as CompileCondition>::Plan>: UnwindSafe,
F: UnwindSafe,
PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, 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