Skip to main content

Quad

Struct Quad 

Source
pub struct Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc>
where Sc: Score, P1: CompileCondition<Plan: IndexedPlan>, P2: CompileCondition<Plan: IndexedPlan>, P3: CompileCondition<Plan: IndexedPlan>,
{ /* private fields */ }

Implementations§

Source§

impl<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc> Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc>
where S: Send + Sync + 'static, A: Clone + Send + Sync + 'static, B: Clone + Send + Sync + 'static, C: Clone + Send + Sync + 'static, D: Clone + Send + Sync + 'static, EA: 'static, EB: 'static, EC: 'static, ED: 'static, P1: CompileCondition<Plan: IndexedPlan> + 'static, P2: CompileCondition<Plan: IndexedPlan> + 'static, P3: CompileCondition<Plan: IndexedPlan> + 'static, 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>, F: QuadFilter<S, A, B, C, D>, Sc: Score + 'static,

Source

pub fn filter<P>( self, predicate: P, ) -> Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, AndQuadFilter<F, FnQuadFilter<impl Fn(&S, &A, &B, &C, &D, usize, usize, usize, usize) -> bool + Send + Sync>>, Sc>
where P: Fn(&A, &B, &C, &D) -> bool + Send + Sync,

Source

pub fn join<E, EE, P4>( self, target: (EE, P4), ) -> Penta<S, A, B, C, D, E, EA, EB, EC, ED, EE, P1, P2, P3, P4, QuadAsPentaFilter<F, A, B, C, D>, Sc>
where E: Clone + Send + Sync + 'static, EE: CollectionExtract<S, Item = E> + 'static, P4: CompileCondition + 'static, for<'a> P4::Plan: IndexedPlan + ExecutablePlan<Pair<Pair<Pair<Leaf<'a, A>, Leaf<'a, B>>, Leaf<'a, C>>, Leaf<'a, D>>, Leaf<'a, E>>, 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, View<'a> = Pair<Pair<Pair<Leaf<'a, A>, Leaf<'a, B>>, Leaf<'a, C>>, Leaf<'a, D>>>, for<'a> JoinNode<S, 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>, CollectionNode<S, EE>, <P4 as CompileCondition>::Plan>: Operator<S>,

Source

pub fn penalize<W>( self, weight: W, ) -> QuadBuilder<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, impl Fn(&A, &B, &C, &D) -> Sc + Send + Sync, Sc>
where W: for<'w> ConstraintWeight<(&'w A, &'w B, &'w C, &'w D), Sc> + Send + Sync,

Source

pub fn reward<W>( self, weight: W, ) -> QuadBuilder<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, impl Fn(&A, &B, &C, &D) -> Sc + Send + Sync, Sc>
where W: for<'w> ConstraintWeight<(&'w A, &'w B, &'w C, &'w D), Sc> + Send + Sync,

Auto Trait Implementations§

§

impl<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc> Freeze for Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc>
where 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>: Freeze, F: Freeze, PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> D, fn() -> Sc)>: Freeze,

§

impl<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc> RefUnwindSafe for Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc>
where 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>: RefUnwindSafe, F: RefUnwindSafe, PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> D, fn() -> Sc)>: RefUnwindSafe,

§

impl<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc> Send for Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc>
where 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>: Send, F: Send, PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> D, fn() -> Sc)>: Send,

§

impl<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc> Sync for Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc>
where 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>: Sync, F: Sync, PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> D, fn() -> Sc)>: Sync,

§

impl<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc> Unpin for Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc>
where 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>: Unpin, F: Unpin, PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> D, fn() -> Sc)>: Unpin,

§

impl<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc> UnsafeUnpin for Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc>
where 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>: UnsafeUnpin, F: UnsafeUnpin, PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> D, fn() -> Sc)>: UnsafeUnpin,

§

impl<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc> UnwindSafe for Quad<S, A, B, C, D, EA, EB, EC, ED, P1, P2, P3, F, Sc>
where 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>: UnwindSafe, F: UnwindSafe, PhantomData<(fn() -> S, fn() -> A, fn() -> B, fn() -> C, fn() -> D, 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<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.