Struct tuple::T2
[−]
[src]
pub struct T2<A, B>(pub A, pub B);
Methods
impl<T> T2<T, T>
[src]
fn map<F, O>(self, f: F) -> T2<O, O> where F: Fn(T) -> O
apply function f
to each element and return the resulting tuple
Trait Implementations
impl<A, B> Clone for T2<A, B> where A: Clone, B: Clone
[src]
fn clone(&self) -> Self
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more
impl<A, B> Copy for T2<A, B> where A: Copy, B: Copy
[src]
impl<A, B> PartialEq for T2<A, B> where A: PartialEq, B: PartialEq
[src]
fn eq(&self, other: &Self) -> bool
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
This method tests for !=
.
impl<A, B> Eq for T2<A, B> where A: Eq, B: Eq
[src]
impl<A, B> Debug for T2<A, B> where A: Debug, B: Debug
[src]
impl<A, B> From<u16> for T2<A, B> where A: From<u16>, B: From<u16>
[src]
impl<A, B> Iterator for T2<A, B> where A: Iterator, B: Iterator
[src]
type Item = T2<A::Item, B::Item>
The type of the elements being iterated over.
fn next(&mut self) -> Option<Self::Item>
Advances the iterator and returns the next value. Read more
fn size_hint(&self) -> (usize, Option<usize>)
1.0.0
Returns the bounds on the remaining length of the iterator. Read more
fn count(self) -> usize
1.0.0
Consumes the iterator, counting the number of iterations and returning it. Read more
fn last(self) -> Option<Self::Item>
1.0.0
Consumes the iterator, returning the last element. Read more
fn nth(&mut self, n: usize) -> Option<Self::Item>
1.0.0
Returns the n
th element of the iterator. Read more
fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>
1.0.0
Takes two iterators and creates a new iterator over both in sequence. Read more
fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator
1.0.0
'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
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool
1.0.0
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
Creates an iterator that both filters and maps. Read more
fn enumerate(self) -> Enumerate<Self>
1.0.0
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
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
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
Creates an iterator that yields elements based on a predicate. Read more
fn skip(self, n: usize) -> Skip<Self>
1.0.0
Creates an iterator that skips the first n
elements. Read more
fn take(self, n: usize) -> Take<Self>
1.0.0
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
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
Creates an iterator that works like map, but flattens nested structure. Read more
fn fuse(self) -> Fuse<Self>
1.0.0
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
Do something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self
1.0.0
Borrows an iterator, rather than consuming it. Read more
fn collect<B>(self) -> B where B: FromIterator<Self::Item>
1.0.0
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
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
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
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
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
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
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
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
Returns the maximum element of an iterator. Read more
fn min(self) -> Option<Self::Item> where Self::Item: Ord
1.0.0
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
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
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
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
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
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
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
Creates an iterator which [clone
]s all of its elements. Read more
fn cycle(self) -> Cycle<Self> where Self: Clone
1.0.0
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where S: Sum<Self::Item>
1.11.0
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where P: Product<Self::Item>
1.11.0
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
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::Item>
1.5.0
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::Item>
1.5.0
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::Item>
1.5.0
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::Item>
1.5.0
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::Item>
1.5.0
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::Item>
1.5.0
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::Item>
1.5.0
Determines if the elements of this Iterator
are lexicographically greater than or equal to those of another. Read more
impl<A, B> Add for T2<A, B> where A: Add, B: Add
[src]
type Output = T2<A::Output, B::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 T2<T, T> where T: Add + Clone
[src]
type Output = T2<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> AddAssign for T2<A, B> where A: AddAssign, B: AddAssign
[src]
fn add_assign(&mut self, rhs: Self)
The method for the +=
operator
impl<T> AddAssign<T> for T2<T, T> where T: AddAssign + Clone
[src]
fn add_assign(&mut self, rhs: T)
The method for the +=
operator
impl<A, B> Sub for T2<A, B> where A: Sub, B: Sub
[src]
type Output = T2<A::Output, B::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 T2<T, T> where T: Sub + Clone
[src]
type Output = T2<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> SubAssign for T2<A, B> where A: SubAssign, B: SubAssign
[src]
fn sub_assign(&mut self, rhs: Self)
The method for the -=
operator
impl<T> SubAssign<T> for T2<T, T> where T: SubAssign + Clone
[src]
fn sub_assign(&mut self, rhs: T)
The method for the -=
operator
impl<A, B> Mul for T2<A, B> where A: Mul, B: Mul
[src]
type Output = T2<A::Output, B::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 T2<T, T> where T: Mul + Clone
[src]
type Output = T2<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> MulAssign for T2<A, B> where A: MulAssign, B: MulAssign
[src]
fn mul_assign(&mut self, rhs: Self)
The method for the *=
operator
impl<T> MulAssign<T> for T2<T, T> where T: MulAssign + Clone
[src]
fn mul_assign(&mut self, rhs: T)
The method for the *=
operator
impl<A, B> Div for T2<A, B> where A: Div, B: Div
[src]
type Output = T2<A::Output, B::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 T2<T, T> where T: Div + Clone
[src]
type Output = T2<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> DivAssign for T2<A, B> where A: DivAssign, B: DivAssign
[src]
fn div_assign(&mut self, rhs: Self)
The method for the /=
operator
impl<T> DivAssign<T> for T2<T, T> where T: DivAssign + Clone
[src]
fn div_assign(&mut self, rhs: T)
The method for the /=
operator
impl<A, B> Neg for T2<A, B> where A: Neg, B: Neg
[src]
type Output = T2<A::Output, B::Output>
The resulting type after applying the -
operator
fn neg(self) -> Self::Output
The method for the unary -
operator
impl<T> Index<usize> for T2<T, T>
[src]
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 T2<T, T>
[src]
fn index_mut(&mut self, index: usize) -> &mut T
The method for the mutable indexing (container[index]
) operation
impl<A, B> From<(A, B)> for T2<A, B>
[src]
impl<A, B> Into<(A, B)> for T2<A, B>
[src]
impl<T> From<[T; 2]> for T2<T, T>
[src]
impl<T> Into<[T; 2]> for T2<T, T>
[src]
impl<'a, T> TryFrom<&'a [T]> for T2<T, T> where T: Clone
[src]
type Error = ConvertError
try_from
)The type returned in the event of a conversion error.
fn try_from(slice: &'a [T]) -> Result<Self, ConvertError>
try_from
)Performs the conversion.
impl<A, B> Zero for T2<A, B> where A: Zero, B: Zero
[src]
fn zero() -> Self
Returns the additive identity element of Self
, 0
. Read more
fn is_zero(&self) -> bool
Returns true
if self
is equal to the additive identity.
impl<T> TupleElements for T2<T, T>
[src]
type Element = T
const N: usize
N: usize = 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. Read more
impl<T> Splat<T> for T2<T, T> where T: Clone
[src]
fn splat(t: T) -> Self
impl<A, B> OpRotateLeft for T2<A, B>
[src]
type Output = T2<B, A>
fn rot_l(self) -> Self::Output
rotate left. The previously first element is now the first.
impl<A, B> OpRotateRight for T2<A, B>
[src]
type Output = T2<B, A>
fn rot_r(self) -> Self::Output
rotate right. The previously last element is now the last.