Struct TArr 

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

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<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, rhs: TArr<Vr, Ar>) -> Self::Output

Performs the + operation.

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

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

where V: Div<Rhs>, A: Div<Rhs>, Rhs: Copy,

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

The resulting type after applying the / operator.

fn div(self, rhs: Rhs) -> Self::Output

Performs the / operation.

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

#[doc(hidden)] fn assert_receiver_is_total_eq(&self)

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

where A: FoldAdd, FoldSum<A>: Add<V>,

type Output = <<A as FoldAdd>::Output as Add<V>>::Output

The type of the result of the sum

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

where A: FoldMul, FoldProd<A>: Mul<V>,

type Output = <<A as FoldMul>::Output as Mul<V>>::Output

The type of the result of the product

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

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

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

where A: Len, Length<A>: Add<B1>, Sum<Length<A>, B1>: 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) -> Self::Output

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

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

where V: Mul<Rhs>, A: Mul<Rhs>, Rhs: Copy,

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

The resulting type after applying the * operator.

fn mul(self, rhs: Rhs) -> Self::Output

Performs the * operation.

impl<V, A, U> Mul<TArr<V, A>> for NInt<U>

where U: Unsigned + NonZero, NInt<U>: Mul<A> + Mul<V>,

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

The resulting type after applying the * operator.

fn mul(self, rhs: TArr<V, A>) -> Self::Output

Performs the * operation.

impl<V, A, U> Mul<TArr<V, A>> for PInt<U>

where U: Unsigned + NonZero, PInt<U>: Mul<A> + Mul<V>,

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

The resulting type after applying the * operator.

fn mul(self, rhs: TArr<V, A>) -> Self::Output

Performs the * operation.

impl<V, A> Mul<TArr<V, A>> for Z0

where Z0: Mul<A>,

type Output = TArr<Z0, <Z0 as Mul<A>>::Output>

The resulting type after applying the * operator.

fn mul(self, rhs: TArr<V, A>) -> Self::Output

Performs the * operation.

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

where V: Neg, A: Neg,

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

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

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

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

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

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

where V: PartialDiv<Rhs>, A: PartialDiv<Rhs>, Rhs: Copy,

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: Rhs) -> Self::Output

Method for performing the division

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

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

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

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

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

#[doc(hidden)] fn __chaining_lt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

If self == other, returns ControlFlow::Continue(()). Otherwise, returns ControlFlow::Break(self < other).

#[doc(hidden)] fn __chaining_le(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for <= instead of <.

#[doc(hidden)] fn __chaining_gt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for > instead of <.

#[doc(hidden)] fn __chaining_ge(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for >= instead of <.

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

where V: Rem<Rhs>, A: Rem<Rhs>, Rhs: Copy,

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

The resulting type after applying the % operator.

fn rem(self, rhs: Rhs) -> Self::Output

Performs the % operation.

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

where Vl: Sub<Vr>, Al: Sub<Ar>,

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

The resulting type after applying the - operator.

fn sub(self, rhs: TArr<Vr, Ar>) -> Self::Output

Performs the - operation.

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

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

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