pub struct Zip5<T0, T1, T2, T3, T4>(pub T0, pub T1, pub T2, pub T3, pub T4)
where
Self: Computation;
Tuple Fields§
§0: T0
§1: T1
§2: T2
§3: T3
§4: T4
Trait Implementations§
Source§impl<T0: Clone, T1: Clone, T2: Clone, T3: Clone, T4: Clone> Clone for Zip5<T0, T1, T2, T3, T4>where
Self: Computation,
impl<T0: Clone, T1: Clone, T2: Clone, T3: Clone, T4: Clone> Clone for Zip5<T0, T1, T2, T3, T4>where
Self: Computation,
Source§impl<T0, T1, T2, T3, T4> Computation for Zip5<T0, T1, T2, T3, T4>
impl<T0, T1, T2, T3, T4> Computation for Zip5<T0, T1, T2, T3, T4>
type Dim = (<T0 as Computation>::Dim, <T1 as Computation>::Dim, <T2 as Computation>::Dim, <T3 as Computation>::Dim, <T4 as Computation>::Dim)
type Item = (<T0 as Computation>::Item, <T1 as Computation>::Item, <T2 as Computation>::Item, <T3 as Computation>::Item, <T4 as Computation>::Item)
fn add<Rhs>(self, rhs: Rhs) -> Add<Self, Rhs>
fn sub<Rhs>(self, rhs: Rhs) -> Sub<Self, Rhs>
fn mul<Rhs>(self, rhs: Rhs) -> Mul<Self, Rhs>
fn div<Rhs>(self, rhs: Rhs) -> Div<Self, Rhs>
fn pow<Rhs>(self, rhs: Rhs) -> Pow<Self, Rhs>
fn neg(self) -> Neg<Self>
fn abs(self) -> Abs<Self>
fn sin(self) -> Sin<Self>
fn cos(self) -> Cos<Self>
fn tan(self) -> Tan<Self>
fn asin(self) -> Asin<Self>
fn acos(self) -> Acos<Self>
fn atan(self) -> Atan<Self>
fn eq<Rhs>(self, rhs: Rhs) -> Eq<Self, Rhs>
fn ne<Rhs>(self, rhs: Rhs) -> Ne<Self, Rhs>
fn lt<Rhs>(self, rhs: Rhs) -> Lt<Self, Rhs>
fn le<Rhs>(self, rhs: Rhs) -> Le<Self, Rhs>
fn gt<Rhs>(self, rhs: Rhs) -> Gt<Self, Rhs>
fn ge<Rhs>(self, rhs: Rhs) -> Ge<Self, Rhs>
fn enumerate<F>(self, f: Function<(Name, Name), F>) -> Enumerate<Self, F>
fn zip<Rhs>(self, rhs: Rhs) -> Zip<Self, Rhs>
Source§fn black_box<F, FDim, FItem>(self, f: F) -> BlackBox<Self, F, FDim, FItem>
fn black_box<F, FDim, FItem>(self, f: F) -> BlackBox<Self, F, FDim, FItem>
Run the given regular function
F
. Read morefn if_<ArgNames, P, FTrue, FFalse>( self, arg_names: ArgNames, predicate: P, f_true: FTrue, f_false: FFalse, ) -> If<Self, ArgNames, P, FTrue, FFalse>
fn loop_while<ArgNames, F, P>( self, arg_names: ArgNames, f: F, predicate: P, ) -> LoopWhile<Self, ArgNames, F, P>
fn then<ArgNames, F>(self, f: Function<ArgNames, F>) -> Then<Self, ArgNames, F>
Source§fn identity_matrix<T>(self) -> IdentityMatrix<Self, T>
fn identity_matrix<T>(self) -> IdentityMatrix<Self, T>
Source§fn scalar_product<Rhs>(self, rhs: Rhs) -> ScalarProduct<Self, Rhs>
fn scalar_product<Rhs>(self, rhs: Rhs) -> ScalarProduct<Self, Rhs>
Multiply and sum the elements of two vectors. Read more
Source§impl<T0, T1, T2, T3, T4> ComputationFn for Zip5<T0, T1, T2, T3, T4>where
Self: Computation,
T0: ComputationFn,
T1: ComputationFn,
T2: ComputationFn,
T3: ComputationFn,
T4: ComputationFn,
Zip5<T0::Filled, T1::Filled, T2::Filled, T3::Filled, T4::Filled>: Computation,
impl<T0, T1, T2, T3, T4> ComputationFn for Zip5<T0, T1, T2, T3, T4>where
Self: Computation,
T0: ComputationFn,
T1: ComputationFn,
T2: ComputationFn,
T3: ComputationFn,
T4: ComputationFn,
Zip5<T0::Filled, T1::Filled, T2::Filled, T3::Filled, T4::Filled>: Computation,
type Filled = Zip5<<T0 as ComputationFn>::Filled, <T1 as ComputationFn>::Filled, <T2 as ComputationFn>::Filled, <T3 as ComputationFn>::Filled, <T4 as ComputationFn>::Filled>
Source§fn fill(self, named_args: NamedArgs) -> Self::Filled
fn fill(self, named_args: NamedArgs) -> Self::Filled
Fill arguments will values,
replacing
Arg
s with Val
s.fn arg_names(&self) -> Names
Source§impl<T0: Debug, T1: Debug, T2: Debug, T3: Debug, T4: Debug> Debug for Zip5<T0, T1, T2, T3, T4>where
Self: Computation,
impl<T0: Debug, T1: Debug, T2: Debug, T3: Debug, T4: Debug> Debug for Zip5<T0, T1, T2, T3, T4>where
Self: Computation,
impl<T0: Copy, T1: Copy, T2: Copy, T3: Copy, T4: Copy> Copy for Zip5<T0, T1, T2, T3, T4>where
Self: Computation,
Auto Trait Implementations§
impl<T0, T1, T2, T3, T4> Freeze for Zip5<T0, T1, T2, T3, T4>
impl<T0, T1, T2, T3, T4> RefUnwindSafe for Zip5<T0, T1, T2, T3, T4>where
T0: RefUnwindSafe,
T1: RefUnwindSafe,
T2: RefUnwindSafe,
T3: RefUnwindSafe,
T4: RefUnwindSafe,
impl<T0, T1, T2, T3, T4> Send for Zip5<T0, T1, T2, T3, T4>
impl<T0, T1, T2, T3, T4> Sync for Zip5<T0, T1, T2, T3, T4>
impl<T0, T1, T2, T3, T4> Unpin for Zip5<T0, T1, T2, T3, T4>
impl<T0, T1, T2, T3, T4> UnwindSafe for Zip5<T0, T1, T2, T3, T4>
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.