Struct tuple::T14
[−]
[src]
pub struct T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N>(pub A, pub B, pub C, pub D, pub E, pub F, pub G, pub H, pub I, pub J, pub K, pub L, pub M, pub N);
Methods
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> T14<Option<A>, Option<B>, Option<C>, Option<D>, Option<E>, Option<F>, Option<G>, Option<H>, Option<I>, Option<J>, Option<K>, Option<L>, Option<M>, Option<N>>
[src]
Trait Implementations
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Clone for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Clone,
B: Clone,
C: Clone,
D: Clone,
E: Clone,
F: Clone,
G: Clone,
H: Clone,
I: Clone,
J: Clone,
K: Clone,
L: Clone,
M: Clone,
N: Clone,
[src]
A: Clone,
B: Clone,
C: Clone,
D: Clone,
E: Clone,
F: Clone,
G: Clone,
H: Clone,
I: Clone,
J: Clone,
K: Clone,
L: Clone,
M: Clone,
N: Clone,
fn clone(&self) -> Self
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Copy for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Copy,
B: Copy,
C: Copy,
D: Copy,
E: Copy,
F: Copy,
G: Copy,
H: Copy,
I: Copy,
J: Copy,
K: Copy,
L: Copy,
M: Copy,
N: Copy,
[src]
A: Copy,
B: Copy,
C: Copy,
D: Copy,
E: Copy,
F: Copy,
G: Copy,
H: Copy,
I: Copy,
J: Copy,
K: Copy,
L: Copy,
M: Copy,
N: Copy,
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> PartialEq for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: PartialEq,
B: PartialEq,
C: PartialEq,
D: PartialEq,
E: PartialEq,
F: PartialEq,
G: PartialEq,
H: PartialEq,
I: PartialEq,
J: PartialEq,
K: PartialEq,
L: PartialEq,
M: PartialEq,
N: PartialEq,
[src]
A: PartialEq,
B: PartialEq,
C: PartialEq,
D: PartialEq,
E: PartialEq,
F: PartialEq,
G: PartialEq,
H: PartialEq,
I: PartialEq,
J: PartialEq,
K: PartialEq,
L: PartialEq,
M: PartialEq,
N: PartialEq,
fn eq(&self, other: &Self) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Eq for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Eq,
B: Eq,
C: Eq,
D: Eq,
E: Eq,
F: Eq,
G: Eq,
H: Eq,
I: Eq,
J: Eq,
K: Eq,
L: Eq,
M: Eq,
N: Eq,
[src]
A: Eq,
B: Eq,
C: Eq,
D: Eq,
E: Eq,
F: Eq,
G: Eq,
H: Eq,
I: Eq,
J: Eq,
K: Eq,
L: Eq,
M: Eq,
N: Eq,
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Debug for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Debug,
B: Debug,
C: Debug,
D: Debug,
E: Debug,
F: Debug,
G: Debug,
H: Debug,
I: Debug,
J: Debug,
K: Debug,
L: Debug,
M: Debug,
N: Debug,
[src]
A: Debug,
B: Debug,
C: Debug,
D: Debug,
E: Debug,
F: Debug,
G: Debug,
H: Debug,
I: Debug,
J: Debug,
K: Debug,
L: Debug,
M: Debug,
N: Debug,
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Default for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Default,
B: Default,
C: Default,
D: Default,
E: Default,
F: Default,
G: Default,
H: Default,
I: Default,
J: Default,
K: Default,
L: Default,
M: Default,
N: Default,
[src]
A: Default,
B: Default,
C: Default,
D: Default,
E: Default,
F: Default,
G: Default,
H: Default,
I: Default,
J: Default,
K: Default,
L: Default,
M: Default,
N: Default,
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> From<u16> for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> 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>,
L: From<u16>,
M: From<u16>,
N: From<u16>,
[src]
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>,
L: From<u16>,
M: From<u16>,
N: From<u16>,
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Iterator for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Iterator,
B: Iterator,
C: Iterator,
D: Iterator,
E: Iterator,
F: Iterator,
G: Iterator,
H: Iterator,
I: Iterator,
J: Iterator,
K: Iterator,
L: Iterator,
M: Iterator,
N: Iterator,
[src]
A: Iterator,
B: Iterator,
C: Iterator,
D: Iterator,
E: Iterator,
F: Iterator,
G: Iterator,
H: Iterator,
I: Iterator,
J: Iterator,
K: Iterator,
L: Iterator,
M: Iterator,
N: Iterator,
type Item = T14<A::Item, B::Item, C::Item, D::Item, E::Item, F::Item, G::Item, H::Item, I::Item, J::Item, K::Item, L::Item, M::Item, N::Item>
The type of the elements being iterated over.
fn next(&mut self) -> Option<Self::Item>
[src]
Advances the iterator and returns the next value. Read more
fn size_hint(&self) -> (usize, Option<usize>)
1.0.0[src]
Returns the bounds on the remaining length of the iterator. Read more
fn count(self) -> usize
1.0.0[src]
Consumes the iterator, counting the number of iterations and returning it. Read more
fn last(self) -> Option<Self::Item>
1.0.0[src]
Consumes the iterator, returning the last element. Read more
fn nth(&mut self, n: usize) -> Option<Self::Item>
1.0.0[src]
Returns the n
th element of the iterator. Read more
fn step_by(self, step: usize) -> StepBy<Self>
[src]
🔬 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. Read more
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
1.0.0[src]
U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0[src]
U: IntoIterator,
'Zips up' two iterators into a single iterator of pairs. Read more
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0[src]
F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item) -> (),
[src]
F: FnMut(Self::Item) -> (),
iterator_for_each
)Calls a closure on each element of an iterator. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(Self::Item) -> Option<B>,
Creates an iterator that both filters and maps. Read more
fn enumerate(self) -> Enumerate<Self>
1.0.0[src]
Creates an iterator which gives the current iteration count as well as the next value. Read more
fn peekable(self) -> Peekable<Self>
1.0.0[src]
Creates an iterator which can use peek
to look at the next element of the iterator without consuming it. Read more
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator that [skip
]s elements based on a predicate. Read more
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator that yields elements based on a predicate. Read more
fn skip(self, n: usize) -> Skip<Self>
1.0.0[src]
Creates an iterator that skips the first n
elements. Read more
fn take(self, n: usize) -> Take<Self>
1.0.0[src]
Creates an iterator that yields its first n
elements. Read more
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(&mut St, Self::Item) -> Option<B>,
An iterator adaptor similar to [fold
] that holds internal state and produces a new iterator. Read more
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0[src]
F: FnMut(Self::Item) -> U,
U: IntoIterator,
Creates an iterator that works like map, but flattens nested structure. Read more
fn fuse(self) -> Fuse<Self>
1.0.0[src]
Creates an iterator which ends after the first [None
]. Read more
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item) -> (),
1.0.0[src]
F: FnMut(&Self::Item) -> (),
Do something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self
1.0.0[src]
Borrows an iterator, rather than consuming it. Read more
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
1.0.0[src]
B: FromIterator<Self::Item>,
Transforms an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
1.0.0[src]
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
Consumes an iterator, creating two collections from it. Read more
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.0.0[src]
F: FnMut(B, Self::Item) -> B,
An iterator adaptor that applies a function, producing a single, final value. Read more
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
Tests if every element of the iterator matches a predicate. Read more
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
Tests if any element of the iterator matches a predicate. Read more
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator that satisfies a predicate. Read more
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Searches for an element in an iterator, returning its index. Read more
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
Searches for an element in an iterator from the right, returning its index. Read more
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
Returns the maximum element of an iterator. Read more
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
Returns the minimum element of an iterator. Read more
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the maximum value from the specified function. Read more
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the minimum value from the specified function. Read more
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
Self: DoubleEndedIterator,
Reverses an iterator's direction. Read more
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
1.0.0[src]
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
Converts an iterator of pairs into a pair of containers. Read more
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
Creates an iterator which [clone
]s all of its elements. Read more
fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
Self: Clone,
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
S: Sum<Self::Item>,
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0[src]
P: Product<Self::Item>,
Iterates over the entire iterator, multiplying all the elements Read more
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
1.5.0[src]
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are equal to those of another. Read more
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are unequal to those of another. Read more
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically less than those of another. Read more
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
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. Read more
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than those of another. Read more
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
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. Read more
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Add for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Add,
B: Add,
C: Add,
D: Add,
E: Add,
F: Add,
G: Add,
H: Add,
I: Add,
J: Add,
K: Add,
L: Add,
M: Add,
N: Add,
[src]
A: Add,
B: Add,
C: Add,
D: Add,
E: Add,
F: Add,
G: Add,
H: Add,
I: Add,
J: Add,
K: Add,
L: Add,
M: Add,
N: Add,
type Output = T14<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output, L::Output, M::Output, N::Output>
The resulting type after applying the +
operator.
fn add(self, rhs: Self) -> Self::Output
[src]
Performs the +
operation.
impl<T> Add<T> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: Add + Clone,
[src]
T: Add + Clone,
type Output = T14<<T as Add>::Output, <T as Add>::Output, <T as Add>::Output, <T as Add>::Output, <T as Add>::Output, <T as Add>::Output, <T as Add>::Output, <T as Add>::Output, <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
[src]
Performs the +
operation.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> AddAssign for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: AddAssign,
B: AddAssign,
C: AddAssign,
D: AddAssign,
E: AddAssign,
F: AddAssign,
G: AddAssign,
H: AddAssign,
I: AddAssign,
J: AddAssign,
K: AddAssign,
L: AddAssign,
M: AddAssign,
N: AddAssign,
[src]
A: AddAssign,
B: AddAssign,
C: AddAssign,
D: AddAssign,
E: AddAssign,
F: AddAssign,
G: AddAssign,
H: AddAssign,
I: AddAssign,
J: AddAssign,
K: AddAssign,
L: AddAssign,
M: AddAssign,
N: AddAssign,
fn add_assign(&mut self, rhs: Self)
[src]
Performs the +=
operation.
impl<T> AddAssign<T> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: AddAssign + Clone,
[src]
T: AddAssign + Clone,
fn add_assign(&mut self, rhs: T)
[src]
Performs the +=
operation.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Sub for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Sub,
B: Sub,
C: Sub,
D: Sub,
E: Sub,
F: Sub,
G: Sub,
H: Sub,
I: Sub,
J: Sub,
K: Sub,
L: Sub,
M: Sub,
N: Sub,
[src]
A: Sub,
B: Sub,
C: Sub,
D: Sub,
E: Sub,
F: Sub,
G: Sub,
H: Sub,
I: Sub,
J: Sub,
K: Sub,
L: Sub,
M: Sub,
N: Sub,
type Output = T14<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output, L::Output, M::Output, N::Output>
The resulting type after applying the -
operator.
fn sub(self, rhs: Self) -> Self::Output
[src]
Performs the -
operation.
impl<T> Sub<T> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: Sub + Clone,
[src]
T: Sub + Clone,
type Output = T14<<T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output, <T as Sub>::Output, <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
[src]
Performs the -
operation.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> SubAssign for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: SubAssign,
B: SubAssign,
C: SubAssign,
D: SubAssign,
E: SubAssign,
F: SubAssign,
G: SubAssign,
H: SubAssign,
I: SubAssign,
J: SubAssign,
K: SubAssign,
L: SubAssign,
M: SubAssign,
N: SubAssign,
[src]
A: SubAssign,
B: SubAssign,
C: SubAssign,
D: SubAssign,
E: SubAssign,
F: SubAssign,
G: SubAssign,
H: SubAssign,
I: SubAssign,
J: SubAssign,
K: SubAssign,
L: SubAssign,
M: SubAssign,
N: SubAssign,
fn sub_assign(&mut self, rhs: Self)
[src]
Performs the -=
operation.
impl<T> SubAssign<T> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: SubAssign + Clone,
[src]
T: SubAssign + Clone,
fn sub_assign(&mut self, rhs: T)
[src]
Performs the -=
operation.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Mul for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Mul,
B: Mul,
C: Mul,
D: Mul,
E: Mul,
F: Mul,
G: Mul,
H: Mul,
I: Mul,
J: Mul,
K: Mul,
L: Mul,
M: Mul,
N: Mul,
[src]
A: Mul,
B: Mul,
C: Mul,
D: Mul,
E: Mul,
F: Mul,
G: Mul,
H: Mul,
I: Mul,
J: Mul,
K: Mul,
L: Mul,
M: Mul,
N: Mul,
type Output = T14<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output, L::Output, M::Output, N::Output>
The resulting type after applying the *
operator.
fn mul(self, rhs: Self) -> Self::Output
[src]
Performs the *
operation.
impl<T> Mul<T> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: Mul + Clone,
[src]
T: Mul + Clone,
type Output = T14<<T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output, <T as Mul>::Output, <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
[src]
Performs the *
operation.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> MulAssign for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: MulAssign,
B: MulAssign,
C: MulAssign,
D: MulAssign,
E: MulAssign,
F: MulAssign,
G: MulAssign,
H: MulAssign,
I: MulAssign,
J: MulAssign,
K: MulAssign,
L: MulAssign,
M: MulAssign,
N: MulAssign,
[src]
A: MulAssign,
B: MulAssign,
C: MulAssign,
D: MulAssign,
E: MulAssign,
F: MulAssign,
G: MulAssign,
H: MulAssign,
I: MulAssign,
J: MulAssign,
K: MulAssign,
L: MulAssign,
M: MulAssign,
N: MulAssign,
fn mul_assign(&mut self, rhs: Self)
[src]
Performs the *=
operation.
impl<T> MulAssign<T> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: MulAssign + Clone,
[src]
T: MulAssign + Clone,
fn mul_assign(&mut self, rhs: T)
[src]
Performs the *=
operation.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Div for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Div,
B: Div,
C: Div,
D: Div,
E: Div,
F: Div,
G: Div,
H: Div,
I: Div,
J: Div,
K: Div,
L: Div,
M: Div,
N: Div,
[src]
A: Div,
B: Div,
C: Div,
D: Div,
E: Div,
F: Div,
G: Div,
H: Div,
I: Div,
J: Div,
K: Div,
L: Div,
M: Div,
N: Div,
type Output = T14<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output, L::Output, M::Output, N::Output>
The resulting type after applying the /
operator.
fn div(self, rhs: Self) -> Self::Output
[src]
Performs the /
operation.
impl<T> Div<T> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: Div + Clone,
[src]
T: Div + Clone,
type Output = T14<<T as Div>::Output, <T as Div>::Output, <T as Div>::Output, <T as Div>::Output, <T as Div>::Output, <T as Div>::Output, <T as Div>::Output, <T as Div>::Output, <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
[src]
Performs the /
operation.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> DivAssign for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: DivAssign,
B: DivAssign,
C: DivAssign,
D: DivAssign,
E: DivAssign,
F: DivAssign,
G: DivAssign,
H: DivAssign,
I: DivAssign,
J: DivAssign,
K: DivAssign,
L: DivAssign,
M: DivAssign,
N: DivAssign,
[src]
A: DivAssign,
B: DivAssign,
C: DivAssign,
D: DivAssign,
E: DivAssign,
F: DivAssign,
G: DivAssign,
H: DivAssign,
I: DivAssign,
J: DivAssign,
K: DivAssign,
L: DivAssign,
M: DivAssign,
N: DivAssign,
fn div_assign(&mut self, rhs: Self)
[src]
Performs the /=
operation.
impl<T> DivAssign<T> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: DivAssign + Clone,
[src]
T: DivAssign + Clone,
fn div_assign(&mut self, rhs: T)
[src]
Performs the /=
operation.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Neg for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Neg,
B: Neg,
C: Neg,
D: Neg,
E: Neg,
F: Neg,
G: Neg,
H: Neg,
I: Neg,
J: Neg,
K: Neg,
L: Neg,
M: Neg,
N: Neg,
[src]
A: Neg,
B: Neg,
C: Neg,
D: Neg,
E: Neg,
F: Neg,
G: Neg,
H: Neg,
I: Neg,
J: Neg,
K: Neg,
L: Neg,
M: Neg,
N: Neg,
type Output = T14<A::Output, B::Output, C::Output, D::Output, E::Output, F::Output, G::Output, H::Output, I::Output, J::Output, K::Output, L::Output, M::Output, N::Output>
The resulting type after applying the -
operator.
fn neg(self) -> Self::Output
[src]
Performs the unary -
operation.
impl<T> Index<usize> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T>
[src]
type Output = T
The returned type after indexing.
fn index(&self, index: usize) -> &T
[src]
Performs the indexing (container[index]
) operation.
impl<T> IndexMut<usize> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T>
[src]
fn index_mut(&mut self, index: usize) -> &mut T
[src]
Performs the mutable indexing (container[index]
) operation.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> From<(A, B, C, D, E, F, G, H, I, J, K, L, M, N)> for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N>
[src]
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Into<(A, B, C, D, E, F, G, H, I, J, K, L, M, N)> for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N>
[src]
impl<T> From<[T; 14]> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T>
[src]
impl<T> Into<[T; 14]> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T>
[src]
impl<'a, T> TryFrom<&'a [T]> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: Clone,
[src]
T: Clone,
type Error = ConvertError
try_from
)The type returned in the event of a conversion error.
fn try_from(slice: &'a [T]) -> Result<Self, ConvertError>
[src]
try_from
)Performs the conversion.
impl<A, a, B, b, C, c, D, d, E, e, F, f, G, g, H, h, I, i, J, j, K, k, L, l, M, m, N, n> TryFrom<T14<a, b, c, d, e, f, g, h, i, j, k, l, m, n>> for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: TryFrom<a>,
B: TryFrom<b>,
C: TryFrom<c>,
D: TryFrom<d>,
E: TryFrom<e>,
F: TryFrom<f>,
G: TryFrom<g>,
H: TryFrom<h>,
I: TryFrom<i>,
J: TryFrom<j>,
K: TryFrom<k>,
L: TryFrom<l>,
M: TryFrom<m>,
N: TryFrom<n>,
[src]
A: TryFrom<a>,
B: TryFrom<b>,
C: TryFrom<c>,
D: TryFrom<d>,
E: TryFrom<e>,
F: TryFrom<f>,
G: TryFrom<g>,
H: TryFrom<h>,
I: TryFrom<i>,
J: TryFrom<j>,
K: TryFrom<k>,
L: TryFrom<l>,
M: TryFrom<m>,
N: TryFrom<n>,
type Error = T14<Option<A::Error>, Option<B::Error>, Option<C::Error>, Option<D::Error>, Option<E::Error>, Option<F::Error>, Option<G::Error>, Option<H::Error>, Option<I::Error>, Option<J::Error>, Option<K::Error>, Option<L::Error>, Option<M::Error>, Option<N::Error>>
try_from
)The type returned in the event of a conversion error.
fn try_from(
value: T14<a, b, c, d, e, f, g, h, i, j, k, l, m, n>
) -> Result<Self, Self::Error>
[src]
value: T14<a, b, c, d, e, f, g, h, i, j, k, l, m, n>
) -> Result<Self, Self::Error>
try_from
)Performs the conversion.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Zero for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Zero,
B: Zero,
C: Zero,
D: Zero,
E: Zero,
F: Zero,
G: Zero,
H: Zero,
I: Zero,
J: Zero,
K: Zero,
L: Zero,
M: Zero,
N: Zero,
[src]
A: Zero,
B: Zero,
C: Zero,
D: Zero,
E: Zero,
F: Zero,
G: Zero,
H: Zero,
I: Zero,
J: Zero,
K: Zero,
L: Zero,
M: Zero,
N: Zero,
fn zero() -> Self
[src]
Returns the additive identity element of Self
, 0
. Read more
fn is_zero(&self) -> bool
[src]
Returns true
if self
is equal to the additive identity.
impl<T> TupleElements for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T>
[src]
type Element = T
const N: usize
N: usize = 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 0
fn get(&self, index: usize) -> Option<&T>
[src]
attempt to access the n-th element
fn get_mut(&mut self, index: usize) -> Option<&mut T>
[src]
attempt to access the n-th element mutablbly. This function shall not return the same data for two different indices. Read more
fn from_iter<I>(iter: I) -> Option<Self> where
I: Iterator<Item = Self::Element>,
[src]
I: Iterator<Item = Self::Element>,
fn elements(&self) -> Elements<&Self>
[src]
returns an Iterator over references to the elements of the tuple
fn elements_mut(&mut self) -> Elements<&mut Self>
[src]
returns an Iterator over mutable references to elements of the tuple
fn into_elements(self) -> IntoElements<Self>
[src]
impl<T> Splat<T> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T> where
T: Clone,
[src]
T: Clone,
impl<T, U> Map<U> for T14<T, T, T, T, T, T, T, T, T, T, T, T, T, T>
[src]
type Output = T14<U, U, U, U, U, U, U, U, U, U, U, U, U, U>
fn map<F>(self, f: F) -> Self::Output where
F: Fn(T) -> U,
[src]
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,
[src]
F: FnMut(T) -> U,
same as map
, but accepts a FnMut
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> OpRotateLeft for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N>
[src]
type Output = T14<B, C, D, E, F, G, H, I, J, K, L, M, N, A>
fn rot_l(self) -> Self::Output
[src]
rotate left. The previously first element is now the first.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> OpRotateRight for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N>
[src]
type Output = T14<N, A, B, C, D, E, F, G, H, I, J, K, L, M>
fn rot_r(self) -> Self::Output
[src]
rotate right. The previously last element is now the last.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> OpReverse for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N>
[src]
type Output = T14<N, M, L, K, J, I, H, G, F, E, D, C, B, A>
fn reverse(self) -> Self::Output
[src]
reverse the elements.
impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> Serialize for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Serialize,
B: Serialize,
C: Serialize,
D: Serialize,
E: Serialize,
F: Serialize,
G: Serialize,
H: Serialize,
I: Serialize,
J: Serialize,
K: Serialize,
L: Serialize,
M: Serialize,
N: Serialize,
[src]
A: Serialize,
B: Serialize,
C: Serialize,
D: Serialize,
E: Serialize,
F: Serialize,
G: Serialize,
H: Serialize,
I: Serialize,
J: Serialize,
K: Serialize,
L: Serialize,
M: Serialize,
N: Serialize,
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> where
S: Serializer,
[src]
S: Serializer,
Serialize this value into the given Serde serializer. Read more
impl<'de, A, B, C, D, E, F, G, H, I, J, K, L, M, N> Deserialize<'de> for T14<A, B, C, D, E, F, G, H, I, J, K, L, M, N> where
A: Deserialize<'de>,
B: Deserialize<'de>,
C: Deserialize<'de>,
D: Deserialize<'de>,
E: Deserialize<'de>,
F: Deserialize<'de>,
G: Deserialize<'de>,
H: Deserialize<'de>,
I: Deserialize<'de>,
J: Deserialize<'de>,
K: Deserialize<'de>,
L: Deserialize<'de>,
M: Deserialize<'de>,
N: Deserialize<'de>,
[src]
A: Deserialize<'de>,
B: Deserialize<'de>,
C: Deserialize<'de>,
D: Deserialize<'de>,
E: Deserialize<'de>,
F: Deserialize<'de>,
G: Deserialize<'de>,
H: Deserialize<'de>,
I: Deserialize<'de>,
J: Deserialize<'de>,
K: Deserialize<'de>,
L: Deserialize<'de>,
M: Deserialize<'de>,
N: Deserialize<'de>,
fn deserialize<De>(deserializer: De) -> Result<Self, De::Error> where
De: Deserializer<'de>,
[src]
De: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more