Struct tuple::T6

pub struct T6<A, B, C, D, E, F>(pub A, pub B, pub C, pub D, pub E, pub F);

Methods

impl<'a, T> T6<T, T, T, T, T, T> where
    T: Clone, 

pub fn from_slice(slice: &'a [T]) -> Option<Self>

impl<A, B, C, D, E, F> T6<Option<A>, Option<B>, Option<C>, Option<D>, Option<E>, Option<F>>

pub fn collect(self) -> Option<T6<A, B, C, D, E, F>>

Trait Implementations

impl<A, B, C, D, E, F> Clone for T6<A, B, C, D, E, F> where
    A: Clone,
    B: Clone,
    C: Clone,
    D: Clone,
    E: Clone,
    F: 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> Copy for T6<A, B, C, D, E, F> where
    A: Copy,
    B: Copy,
    C: Copy,
    D: Copy,
    E: Copy,
    F: Copy, 

impl<A, B, C, D, E, F> PartialEq for T6<A, B, C, D, E, F> where
    A: PartialEq,
    B: PartialEq,
    C: PartialEq,
    D: PartialEq,
    E: PartialEq,
    F: 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> Eq for T6<A, B, C, D, E, F> where
    A: Eq,
    B: Eq,
    C: Eq,
    D: Eq,
    E: Eq,
    F: Eq, 

impl<A, B, C, D, E, F> Debug for T6<A, B, C, D, E, F> where
    A: Debug,
    B: Debug,
    C: Debug,
    D: Debug,
    E: Debug,
    F: Debug, 

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

Formats the value using the given formatter.

impl<A, B, C, D, E, F> Default for T6<A, B, C, D, E, F> where
    A: Default,
    B: Default,
    C: Default,
    D: Default,
    E: Default,
    F: Default, 

fn default() -> Self

Returns the "default value" for a type.

impl<A, B, C, D, E, F> From<u16> for T6<A, B, C, D, E, F> where
    A: From<u16>,
    B: From<u16>,
    C: From<u16>,
    D: From<u16>,
    E: From<u16>,
    F: From<u16>, 

fn from(value: u16) -> Self

Performs the conversion.

impl<A, B, C, D, E, F> Iterator for T6<A, B, C, D, E, F> where
    A: Iterator,
    B: Iterator,
    C: Iterator,
    D: Iterator,
    E: Iterator,
    F: Iterator, 

type Item = T6<A::Item, B::Item, C::Item, D::Item, E::Item, F::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 step_by(self, step: usize) -> StepBy<Self>

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

unstable replacement of Range::step_by

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::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 as IntoIterator>::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 for_each<F>(self, f: F) where
    F: FnMut(Self::Item), 

Calls a closure on each element of an iterator.

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 flatten(self) -> Flatten<Self> where
    Self::Item: IntoIterator, 

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

Creates an iterator that 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 try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, Self::Item) -> R,
    R: Try<Ok = B>, 

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

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R where
    F: FnMut(Self::Item) -> R,
    R: Try<Ok = ()>, 

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

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

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

An iterator method 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 as IntoIterator>::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 as IntoIterator>::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 as IntoIterator>::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 as IntoIterator>::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 as IntoIterator>::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 as IntoIterator>::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 as IntoIterator>::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> Add for T6<A, B, C, D, E, F> where
    A: Add,
    B: Add,
    C: Add,
    D: Add,
    E: Add,
    F: Add, 

type Output = T6<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output>

The resulting type after applying the + operator.

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

Performs the + operation.

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

type Output = T6<<T as Add>::Output, <T as Add>::Output, <T as Add>::Output, <T as Add>::Output, <T as Add>::Output, <T as Add>::Output>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<A, B, C, D, E, F> AddAssign for T6<A, B, C, D, E, F> where
    A: AddAssign,
    B: AddAssign,
    C: AddAssign,
    D: AddAssign,
    E: AddAssign,
    F: AddAssign, 

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

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

fn add_assign(&mut self, rhs: T)

Performs the += operation.

impl<A, B, C, D, E, F> Sub for T6<A, B, C, D, E, F> where
    A: Sub,
    B: Sub,
    C: Sub,
    D: Sub,
    E: Sub,
    F: Sub, 

type Output = T6<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output>

The resulting type after applying the - operator.

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

Performs the - operation.

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

type Output = T6<<T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output>

The resulting type after applying the - operator.

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

Performs the - operation.

impl<A, B, C, D, E, F> SubAssign for T6<A, B, C, D, E, F> where
    A: SubAssign,
    B: SubAssign,
    C: SubAssign,
    D: SubAssign,
    E: SubAssign,
    F: SubAssign, 

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

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

fn sub_assign(&mut self, rhs: T)

Performs the -= operation.

impl<A, B, C, D, E, F> Mul for T6<A, B, C, D, E, F> where
    A: Mul,
    B: Mul,
    C: Mul,
    D: Mul,
    E: Mul,
    F: Mul, 

type Output = T6<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output>

The resulting type after applying the * operator.

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

Performs the * operation.

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

type Output = T6<<T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<A, B, C, D, E, F> MulAssign for T6<A, B, C, D, E, F> where
    A: MulAssign,
    B: MulAssign,
    C: MulAssign,
    D: MulAssign,
    E: MulAssign,
    F: MulAssign, 

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

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

fn mul_assign(&mut self, rhs: T)

Performs the *= operation.

impl<A, B, C, D, E, F> Div for T6<A, B, C, D, E, F> where
    A: Div,
    B: Div,
    C: Div,
    D: Div,
    E: Div,
    F: Div, 

type Output = T6<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output>

The resulting type after applying the / operator.

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

Performs the / operation.

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

type Output = T6<<T as Div>::Output, <T as Div>::Output, <T as Div>::Output, <T as Div>::Output, <T as Div>::Output, <T as Div>::Output>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<A, B, C, D, E, F> DivAssign for T6<A, B, C, D, E, F> where
    A: DivAssign,
    B: DivAssign,
    C: DivAssign,
    D: DivAssign,
    E: DivAssign,
    F: DivAssign, 

fn div_assign(&mut self, rhs: Self)

Performs the /= operation.

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

fn div_assign(&mut self, rhs: T)

Performs the /= operation.

impl<A, B, C, D, E, F> Neg for T6<A, B, C, D, E, F> where
    A: Neg,
    B: Neg,
    C: Neg,
    D: Neg,
    E: Neg,
    F: Neg, 

type Output = T6<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

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

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

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

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

Performs the mutable indexing (container[index]) operation.

impl<A, B, C, D, E, F> From<(A, B, C, D, E, F)> for T6<A, B, C, D, E, F>

fn from(t: (A, B, C, D, E, F)) -> Self

Performs the conversion.

impl<A, B, C, D, E, F> Into<(A, B, C, D, E, F)> for T6<A, B, C, D, E, F>

fn into(self) -> (A, B, C, D, E, F)

Performs the conversion.

impl<T> From<[T; 6]> for T6<T, T, T, T, T, T>

This is only avaible with the 'nightly' feature

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

Performs the conversion.

impl<T> Into<[T; 6]> for T6<T, T, T, T, T, T>

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

Performs the conversion.

impl<A, B, C, D, E, F> Zero for T6<A, B, C, D, E, F> where
    A: Zero,
    B: Zero,
    C: Zero,
    D: Zero,
    E: Zero,
    F: 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 T6<T, T, T, T, T, T>

type Element = T

const N: usize

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

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.

fn from_iter<I>(iter: I) -> Option<Self> where
    I: Iterator<Item = Self::Element>, 

Important traits for Elements<&'a T>

impl<'a, T> Iterator for Elements<&'a T> where
    T: TupleElements,  type Item = &'a T::Element;impl<'a, T> Iterator for Elements<&'a mut T> where
    T: TupleElements,  type Item = &'a mut T::Element;

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

returns an Iterator over references to the elements of the tuple

Important traits for Elements<&'a T>

impl<'a, T> Iterator for Elements<&'a T> where
    T: TupleElements,  type Item = &'a T::Element;impl<'a, T> Iterator for Elements<&'a mut T> where
    T: TupleElements,  type Item = &'a mut T::Element;

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

returns an Iterator over mutable references to elements of the tuple

Important traits for IntoElements<T>

impl<T> Iterator for IntoElements<T> where
    T: TupleElements,  type Item = T::Element;

fn into_elements(self) -> IntoElements<Self>

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

fn splat(t: T) -> Self

impl<T, U> Map<U> for T6<T, T, T, T, T, T>

type Output = T6<U, U, U, U, U, U>

fn map<F>(self, f: F) -> Self::Output where
    F: Fn(T) -> U, 

apply a function to each element and return the result

fn map_mut<F>(self, f: F) -> Self::Output where
    F: FnMut(T) -> U, 

same as map, but accepts a FnMut

impl<A, B, C, D, E, F> OpRotateLeft for T6<A, B, C, D, E, F>

type Output = T6<B, C, D, E, F, A>

fn rot_l(self) -> Self::Output

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

impl<A, B, C, D, E, F> OpRotateRight for T6<A, B, C, D, E, F>

type Output = T6<F, A, B, C, D, E>

fn rot_r(self) -> Self::Output

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

impl<A, B, C, D, E, F> OpReverse for T6<A, B, C, D, E, F>

type Output = T6<F, E, D, C, B, A>

fn reverse(self) -> Self::Output

reverse the elements.

impl<a, b, c, d, e, f> OpSplit<T1<a>> for T6<a, b, c, d, e, f>

type R = T5<b, c, d, e, f>

fn split(self) -> (T1<a>, Self::R)

impl<a, b, c, d, e, f, g> OpJoin<T6<b, c, d, e, f, g>> for T1<a>

type Output = T7<a, b, c, d, e, f, g>

fn join(self, rhs: T6<b, c, d, e, f, g>) -> Self::Output

impl<a, b, c, d, e, f> OpSplit<T2<a, b>> for T6<a, b, c, d, e, f>

type R = T4<c, d, e, f>

fn split(self) -> (T2<a, b>, Self::R)

impl<a, b, c, d, e, f, g, h> OpJoin<T6<c, d, e, f, g, h>> for T2<a, b>

type Output = T8<a, b, c, d, e, f, g, h>

fn join(self, rhs: T6<c, d, e, f, g, h>) -> Self::Output

impl<a, b, c, d, e, f> OpSplit<T3<a, b, c>> for T6<a, b, c, d, e, f>

type R = T3<d, e, f>

fn split(self) -> (T3<a, b, c>, Self::R)

impl<a, b, c, d, e, f> OpSplit<T4<a, b, c, d>> for T6<a, b, c, d, e, f>

type R = T2<e, f>

fn split(self) -> (T4<a, b, c, d>, Self::R)

impl<a, b, c, d, e, f> OpSplit<T5<a, b, c, d, e>> for T6<a, b, c, d, e, f>

type R = T1<f>

fn split(self) -> (T5<a, b, c, d, e>, Self::R)

impl<a, b, c, d, e, f, g> OpJoin<T1<g>> for T6<a, b, c, d, e, f>

type Output = T7<a, b, c, d, e, f, g>

fn join(self, rhs: T1<g>) -> Self::Output

impl<a, b, c, d, e, f, g> OpSplit<T6<a, b, c, d, e, f>> for T7<a, b, c, d, e, f, g>

type R = T1<g>

fn split(self) -> (T6<a, b, c, d, e, f>, Self::R)

impl<a, b, c, d, e, f, g, h> OpJoin<T2<g, h>> for T6<a, b, c, d, e, f>

type Output = T8<a, b, c, d, e, f, g, h>

fn join(self, rhs: T2<g, h>) -> Self::Output

impl<a, b, c, d, e, f, g, h> OpSplit<T6<a, b, c, d, e, f>> for T8<a, b, c, d, e, f, g, h>

type R = T2<g, h>

fn split(self) -> (T6<a, b, c, d, e, f>, Self::R)

impl<A, B, C, D, E, F> Serialize for T6<A, B, C, D, E, F> where
    A: Serialize,
    B: Serialize,
    C: Serialize,
    D: Serialize,
    E: Serialize,
    F: Serialize, 

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> where
    S: Serializer, 

Serialize this value into the given Serde serializer.

impl<'de, A, B, C, D, E, F> Deserialize<'de> for T6<A, B, C, D, E, F> where
    A: Deserialize<'de>,
    B: Deserialize<'de>,
    C: Deserialize<'de>,
    D: Deserialize<'de>,
    E: Deserialize<'de>,
    F: Deserialize<'de>, 

fn deserialize<De>(deserializer: De) -> Result<Self, De::Error> where
    De: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.