Struct tuple::T11

pub struct T11<A, B, C, D, E, F, G, H, I, J, K>(pub A, pub B, pub C, pub D, pub E, pub F, pub G, pub H, pub I, pub J, pub K);

Methods

impl<T> T11<T, T, T, T, T, T, T, T, T, T, T>

fn map<F, O>(self, f: F) -> T11<O, O, O, O, O, O, O, O, O, O, O> where F: Fn(T) -> O

apply function f to each element and return the resulting tuple

Trait Implementations

impl<A, B, C, D, E, F, G, H, I, J, K> Clone for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Clone,
        B: Clone,
        C: Clone,
        D: Clone,
        E: Clone,
        F: Clone,
        G: Clone,
        H: Clone,
        I: Clone,
        J: Clone,
        K: Clone

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A, B, C, D, E, F, G, H, I, J, K> Copy for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Copy,
        B: Copy,
        C: Copy,
        D: Copy,
        E: Copy,
        F: Copy,
        G: Copy,
        H: Copy,
        I: Copy,
        J: Copy,
        K: Copy

impl<A, B, C, D, E, F, G, H, I, J, K> PartialEq for T11<A, B, C, D, E, F, G, H, I, J, K> where A: PartialEq,
        B: PartialEq,
        C: PartialEq,
        D: PartialEq,
        E: PartialEq,
        F: PartialEq,
        G: PartialEq,
        H: PartialEq,
        I: PartialEq,
        J: PartialEq,
        K: PartialEq

fn eq(&self, other: &Self) -> bool

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

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

This method tests for !=.

impl<A, B, C, D, E, F, G, H, I, J, K> Eq for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Eq,
        B: Eq,
        C: Eq,
        D: Eq,
        E: Eq,
        F: Eq,
        G: Eq,
        H: Eq,
        I: Eq,
        J: Eq,
        K: Eq

impl<A, B, C, D, E, F, G, H, I, J, K> Debug for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Debug,
        B: Debug,
        C: Debug,
        D: Debug,
        E: Debug,
        F: Debug,
        G: Debug,
        H: Debug,
        I: Debug,
        J: Debug,
        K: Debug

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

Formats the value using the given formatter.

impl<A, B, C, D, E, F, G, H, I, J, K> From<u16> for T11<A, B, C, D, E, F, G, H, I, J, K> where A: From<u16>,
        B: From<u16>,
        C: From<u16>,
        D: From<u16>,
        E: From<u16>,
        F: From<u16>,
        G: From<u16>,
        H: From<u16>,
        I: From<u16>,
        J: From<u16>,
        K: From<u16>

fn from(value: u16) -> Self

Performs the conversion.

impl<A, B, C, D, E, F, G, H, I, J, K> Iterator for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Iterator,
        B: Iterator,
        C: Iterator,
        D: Iterator,
        E: Iterator,
        F: Iterator,
        G: Iterator,
        H: Iterator,
        I: Iterator,
        J: Iterator,
        K: Iterator

type Item = T11<A::Item, B::Item, C::Item, D::Item, E::Item, F::Item, G::Item, H::Item, I::Item, J::Item, K::Item>

The type of the elements being iterated over.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

'Zips up' two iterators into a single iterator of pairs.

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

Takes a closure and creates an iterator which calls that closure on each element.

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use peek to look at the next element of the iterator without consuming it.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

Creates an iterator that [skip]s elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

Creates an iterator that yields elements based on a predicate.

fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields its first n elements.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

Creates an iterator that works like map, but flattens nested structure.

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first [None].

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

Do something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it.

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

Transforms an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B) where B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool

Consumes an iterator, creating two collections from it.

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

An iterator adaptor that applies a function, producing a single, final value.

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

Searches for an element of an iterator that satisfies a predicate.

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

Searches for an element in an iterator, returning its index.

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool,
        Self: ExactSizeIterator + DoubleEndedIterator

Searches for an element in an iterator from the right, returning its index.

fn max(self) -> Option<Self::Item> where Self::Item: Ord

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item> where Self::Item: Ord

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering

Returns the element that gives the minimum value with respect to the specified comparison function.

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

Reverses an iterator's direction.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>,
        FromB: Default + Extend<B>,
        Self: Iterator<Item=(A, B)>

Converts an iterator of pairs into a pair of containers.

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

Creates an iterator which [clone]s all of its elements.

fn cycle(self) -> Cycle<Self> where Self: Clone

Repeats an iterator endlessly.

fn sum<S>(self) -> S where S: Sum<Self::Item>

Sums the elements of an iterator.

fn product<P>(self) -> P where P: Product<Self::Item>

Iterates over the entire iterator, multiplying all the elements

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord

Lexicographically compares the elements of this Iterator with those of another.

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>

Lexicographically compares the elements of this Iterator with those of another.

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>

Determines if the elements of this Iterator are equal to those of another.

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>

Determines if the elements of this Iterator are unequal to those of another.

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

impl<A, B, C, D, E, F, G, H, I, J, K> Add for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Add,
        B: Add,
        C: Add,
        D: Add,
        E: Add,
        F: Add,
        G: Add,
        H: Add,
        I: Add,
        J: Add,
        K: Add

type Output = T11<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output>

The resulting type after applying the + operator

fn add(self, rhs: Self) -> Self::Output

The method for the + operator

impl<T> Add<T> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: Add + Clone

type Output = T11<T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output>

The resulting type after applying the + operator

fn add(self, rhs: T) -> Self::Output

The method for the + operator

impl<A, B, C, D, E, F, G, H, I, J, K> AddAssign for T11<A, B, C, D, E, F, G, H, I, J, K> where A: AddAssign,
        B: AddAssign,
        C: AddAssign,
        D: AddAssign,
        E: AddAssign,
        F: AddAssign,
        G: AddAssign,
        H: AddAssign,
        I: AddAssign,
        J: AddAssign,
        K: AddAssign

fn add_assign(&mut self, rhs: Self)

The method for the += operator

impl<T> AddAssign<T> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: AddAssign + Clone

fn add_assign(&mut self, rhs: T)

The method for the += operator

impl<A, B, C, D, E, F, G, H, I, J, K> Sub for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Sub,
        B: Sub,
        C: Sub,
        D: Sub,
        E: Sub,
        F: Sub,
        G: Sub,
        H: Sub,
        I: Sub,
        J: Sub,
        K: Sub

type Output = T11<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output>

The resulting type after applying the - operator

fn sub(self, rhs: Self) -> Self::Output

The method for the - operator

impl<T> Sub<T> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: Sub + Clone

type Output = T11<T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output>

The resulting type after applying the - operator

fn sub(self, rhs: T) -> Self::Output

The method for the - operator

impl<A, B, C, D, E, F, G, H, I, J, K> SubAssign for T11<A, B, C, D, E, F, G, H, I, J, K> where A: SubAssign,
        B: SubAssign,
        C: SubAssign,
        D: SubAssign,
        E: SubAssign,
        F: SubAssign,
        G: SubAssign,
        H: SubAssign,
        I: SubAssign,
        J: SubAssign,
        K: SubAssign

fn sub_assign(&mut self, rhs: Self)

The method for the -= operator

impl<T> SubAssign<T> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: SubAssign + Clone

fn sub_assign(&mut self, rhs: T)

The method for the -= operator

impl<A, B, C, D, E, F, G, H, I, J, K> Mul for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Mul,
        B: Mul,
        C: Mul,
        D: Mul,
        E: Mul,
        F: Mul,
        G: Mul,
        H: Mul,
        I: Mul,
        J: Mul,
        K: Mul

type Output = T11<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output>

The resulting type after applying the * operator

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

The method for the * operator

impl<T> Mul<T> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: Mul + Clone

type Output = T11<T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output>

The resulting type after applying the * operator

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

The method for the * operator

impl<A, B, C, D, E, F, G, H, I, J, K> MulAssign for T11<A, B, C, D, E, F, G, H, I, J, K> where A: MulAssign,
        B: MulAssign,
        C: MulAssign,
        D: MulAssign,
        E: MulAssign,
        F: MulAssign,
        G: MulAssign,
        H: MulAssign,
        I: MulAssign,
        J: MulAssign,
        K: MulAssign

fn mul_assign(&mut self, rhs: Self)

The method for the *= operator

impl<T> MulAssign<T> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: MulAssign + Clone

fn mul_assign(&mut self, rhs: T)

The method for the *= operator

impl<A, B, C, D, E, F, G, H, I, J, K> Div for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Div,
        B: Div,
        C: Div,
        D: Div,
        E: Div,
        F: Div,
        G: Div,
        H: Div,
        I: Div,
        J: Div,
        K: Div

type Output = T11<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output>

The resulting type after applying the / operator

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

The method for the / operator

impl<T> Div<T> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: Div + Clone

type Output = T11<T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output, T::Output>

The resulting type after applying the / operator

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

The method for the / operator

impl<A, B, C, D, E, F, G, H, I, J, K> DivAssign for T11<A, B, C, D, E, F, G, H, I, J, K> where A: DivAssign,
        B: DivAssign,
        C: DivAssign,
        D: DivAssign,
        E: DivAssign,
        F: DivAssign,
        G: DivAssign,
        H: DivAssign,
        I: DivAssign,
        J: DivAssign,
        K: DivAssign

fn div_assign(&mut self, rhs: Self)

The method for the /= operator

impl<T> DivAssign<T> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: DivAssign + Clone

fn div_assign(&mut self, rhs: T)

The method for the /= operator

impl<A, B, C, D, E, F, G, H, I, J, K> Neg for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Neg,
        B: Neg,
        C: Neg,
        D: Neg,
        E: Neg,
        F: Neg,
        G: Neg,
        H: Neg,
        I: Neg,
        J: Neg,
        K: Neg

type Output = T11<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output>

The resulting type after applying the - operator

fn neg(self) -> Self::Output

The method for the unary - operator

impl<T> Index<usize> for T11<T, T, T, T, T, T, T, T, T, T, T>

type Output = T

The returned type after indexing

fn index(&self, index: usize) -> &T

The method for the indexing (container[index]) operation

impl<T> IndexMut<usize> for T11<T, T, T, T, T, T, T, T, T, T, T>

fn index_mut(&mut self, index: usize) -> &mut T

The method for the mutable indexing (container[index]) operation

impl<A, B, C, D, E, F, G, H, I, J, K> From<(A, B, C, D, E, F, G, H, I, J, K)> for T11<A, B, C, D, E, F, G, H, I, J, K>

fn from(t: (A, B, C, D, E, F, G, H, I, J, K)) -> Self

Performs the conversion.

impl<A, B, C, D, E, F, G, H, I, J, K> Into<(A, B, C, D, E, F, G, H, I, J, K)> for T11<A, B, C, D, E, F, G, H, I, J, K>

fn into(self) -> (A, B, C, D, E, F, G, H, I, J, K)

Performs the conversion.

impl<T> From<[T; 11]> for T11<T, T, T, T, T, T, T, T, T, T, T>

fn from(t: [T; 11]) -> Self

Performs the conversion.

impl<T> Into<[T; 11]> for T11<T, T, T, T, T, T, T, T, T, T, T>

fn into(self) -> [T; 11]

Performs the conversion.

impl<'a, T> TryFrom<&'a [T]> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: Clone

type Error = ConvertError

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

The type returned in the event of a conversion error.

fn try_from(slice: &'a [T]) -> Result<Self, ConvertError>

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

Performs the conversion.

impl<A, B, C, D, E, F, G, H, I, J, K> Zero for T11<A, B, C, D, E, F, G, H, I, J, K> where A: Zero,
        B: Zero,
        C: Zero,
        D: Zero,
        E: Zero,
        F: Zero,
        G: Zero,
        H: Zero,
        I: Zero,
        J: Zero,
        K: Zero

fn zero() -> Self

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

impl<T> TupleElements for T11<T, T, T, T, T, T, T, T, T, T, T>

type Element = T

const N: usize

N: usize = 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 0

fn elements(&self) -> Elements<&Self>

returns an Iterator over references to the elements of the tuple

fn elements_mut(&mut self) -> Elements<&mut Self>

returns an Iterator over mutable references to elements of the tuple

fn get(&self, index: usize) -> Option<&T>

attempt to access the n-th element

fn get_mut(&mut self, index: usize) -> Option<&mut T>

attempt to access the n-th element mutablbly. This function shall not return the same data for two different indices.

impl<T> Splat<T> for T11<T, T, T, T, T, T, T, T, T, T, T> where T: Clone

fn splat(t: T) -> Self

impl<A, B, C, D, E, F, G, H, I, J, K> OpRotateLeft for T11<A, B, C, D, E, F, G, H, I, J, K>

type Output = T11<B, C, D, E, F, G, H, I, J, K, A>

fn rot_l(self) -> Self::Output

rotate left. The previously first element is now the first.

impl<A, B, C, D, E, F, G, H, I, J, K> OpRotateRight for T11<A, B, C, D, E, F, G, H, I, J, K>

type Output = T11<K, A, B, C, D, E, F, G, H, I, J>

fn rot_r(self) -> Self::Output

rotate right. The previously last element is now the last.

impl<A, B, C, D, E, F, G, H, I, J, K> OpReverse for T11<A, B, C, D, E, F, G, H, I, J, K>

type Output = T11<K, J, I, H, G, F, E, D, C, B, A>

fn reverse(self) -> Self::Output

reverse the elements.