Struct diffgeom::typenum::TArr

pub struct TArr<V, A> { /* fields omitted */ }

TArr is a type that acts as an array of types. It is defined similarly to UInt, only its values can be more than bits, and it is designed to act as an array. So you can only add two if they have the same number of elements, for example.

This array is only really designed to contain Integer types. If you use it with others, you may find it lacking functionality.

Trait Implementations

impl<V, A> Clone for TArr<V, A> where
    A: Clone,
    V: Clone, 

fn clone(&self) -> TArr<V, A>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Al, Vl, Ar, Vr> Add<TArr<Vr, Ar>> for TArr<Vl, Al> where
    Al: Add<Ar>,
    Vl: Add<Vr>, 

type Output = TArr<<Vl as Add<Vr>>::Output, <Al as Add<Ar>>::Output>

The resulting type after applying the + operator

fn add(self, TArr<Vr, Ar>) -> <TArr<Vl, Al> as Add<TArr<Vr, Ar>>>::Output

The method for the + operator

impl<V, A> Debug for TArr<V, A> where
    A: Debug,
    V: Debug, 

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

impl<V, A> Neg for TArr<V, A> where
    A: Neg,
    V: Neg, 

type Output = TArr<<V as Neg>::Output, <A as Neg>::Output>

fn neg(self) -> <TArr<V, A> as Neg>::Output

impl<V, A> Eq for TArr<V, A> where
    A: Eq,
    V: Eq, 

impl<V, A> Len for TArr<V, A> where
    A: Len,
    <A as Len>::Output: Add<B1>,
    <<A as Len>::Output as Add<B1>>::Output: Unsigned, 

Size of a TypeArray

type Output = <<A as Len>::Output as Add<B1>>::Output

The length as a type-level unsigned integer.

fn len(&self) -> <TArr<V, A> as Len>::Output

This function isn't used in this crate, but may be useful for others.

impl<V, A, Rhs> Rem<Rhs> for TArr<V, A> where
    A: Rem<Rhs>,
    V: Rem<Rhs>, 

type Output = TArr<<V as Rem<Rhs>>::Output, <A as Rem<Rhs>>::Output>

fn rem(self, Rhs) -> <TArr<V, A> as Rem<Rhs>>::Output

impl<V, A> TypeArray for TArr<V, A>

impl<V, A, Rhs> Mul<Rhs> for TArr<V, A> where
    A: Mul<Rhs>,
    V: Mul<Rhs>, 

type Output = TArr<<V as Mul<Rhs>>::Output, <A as Mul<Rhs>>::Output>

The resulting type after applying the * operator

fn mul(self, Rhs) -> <TArr<V, A> as Mul<Rhs>>::Output

The method for the * operator

impl<V, A, Rhs> Div<Rhs> for TArr<V, A> where
    A: Div<Rhs>,
    V: Div<Rhs>, 

type Output = TArr<<V as Div<Rhs>>::Output, <A as Div<Rhs>>::Output>

The resulting type after applying the / operator

fn div(self, Rhs) -> <TArr<V, A> as Div<Rhs>>::Output

The method for the / operator

impl<V, A> PartialOrd<TArr<V, A>> for TArr<V, A> where
    A: PartialOrd<A>,
    V: PartialOrd<V>, 

fn partial_cmp(&self, __arg_0: &TArr<V, A>) -> Option<Ordering>

fn lt(&self, __arg_0: &TArr<V, A>) -> bool

fn le(&self, __arg_0: &TArr<V, A>) -> bool

fn gt(&self, __arg_0: &TArr<V, A>) -> bool

fn ge(&self, __arg_0: &TArr<V, A>) -> bool

impl<V, A> Hash for TArr<V, A> where
    A: Hash,
    V: Hash, 

fn hash<__HVA>(&self, __arg_0: &mut __HVA) where
    __HVA: Hasher, 

impl<V, A> PartialEq<TArr<V, A>> for TArr<V, A> where
    A: PartialEq<A>,
    V: PartialEq<V>, 

fn eq(&self, __arg_0: &TArr<V, A>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &TArr<V, A>) -> bool

This method tests for !=.

impl<V, A, Rhs> PartialDiv<Rhs> for TArr<V, A> where
    A: PartialDiv<Rhs>,
    V: PartialDiv<Rhs>, 

type Output = TArr<<V as PartialDiv<Rhs>>::Output, <A as PartialDiv<Rhs>>::Output>

The type of the result of the division

fn partial_div(self, Rhs) -> <TArr<V, A> as PartialDiv<Rhs>>::Output

Method for performing the division

impl<Vl, Al, Vr, Ar> Sub<TArr<Vr, Ar>> for TArr<Vl, Al> where
    Al: Sub<Ar>,
    Vl: Sub<Vr>, 

type Output = TArr<<Vl as Sub<Vr>>::Output, <Al as Sub<Ar>>::Output>

The resulting type after applying the - operator

fn sub(self, TArr<Vr, Ar>) -> <TArr<Vl, Al> as Sub<TArr<Vr, Ar>>>::Output

The method for the - operator

impl<V, A> Ord for TArr<V, A> where
    A: Ord,
    V: Ord, 

fn cmp(&self, __arg_0: &TArr<V, A>) -> Ordering

impl<V, A> Copy for TArr<V, A> where
    A: Copy,
    V: Copy,