Struct tuple::T1

pub struct T1<A>(pub A);

Tuple Fields

0: A

Implementations

impl<A> T1<A>

pub fn as_refs(&self) -> T1<&A>

pub fn as_mut_refs(&mut self) -> T1<&mut A>

impl<'a, T> T1<T>

where T: Clone,

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

impl<A> T1<Option<A>>

pub fn collect(self) -> Option<T1<A>>

Trait Implementations

impl<T> Add<T> for T1<T>

where T: Add + Clone,

type Output = T1<<T as Add>::Output>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<A> Add for T1<A>

where A: Add,

type Output = T1<<A as Add>::Output>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<T> AddAssign<T> for T1<T>

where T: AddAssign + Clone,

fn add_assign(&mut self, rhs: T)

Performs the += operation.

impl<A> AddAssign for T1<A>

where A: AddAssign,

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<Func, Out, A> Call<T1<A>> for Func

where Func: Fn(A) -> Out,

type Output = Out

fn call(&self, T1: T1<A>) -> Out

impl<Func, Out, A> CallMut<T1<A>> for Func

where Func: FnMut(A) -> Out,

type Output = Out

fn call_mut(&mut self, T1: T1<A>) -> Out

impl<Func, Out, A> CallOnce<T1<A>> for Func

where Func: FnOnce(A) -> Out,

type Output = Out

fn call_once(self, T1: T1<A>) -> Out

impl<A> Clone for T1<A>

where A: 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> Debug for T1<A>

where A: Debug,

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

Formats the value using the given formatter.

impl<A> Default for T1<A>

where A: Default,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, A> Deserialize<'de> for T1<A>

where A: Deserialize<'de>,

fn deserialize<De>(deserializer: De) -> Result<Self, De::Error>

where De: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Div<T> for T1<T>

where T: Div + Clone,

type Output = T1<<T as Div>::Output>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<A> Div for T1<A>

where A: Div,

type Output = T1<<A as Div>::Output>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> DivAssign<T> for T1<T>

where T: DivAssign + Clone,

fn div_assign(&mut self, rhs: T)

Performs the /= operation.

impl<A> DivAssign for T1<A>

where A: DivAssign,

fn div_assign(&mut self, rhs: Self)

Performs the /= operation.

impl<T> From<[T; 1]> for T1<T>

This is only avaible with the ‘nightly’ feature

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

Converts to this type from the input type.

impl<A> From<(A,)> for T1<A>

fn from(t: (A,)) -> Self

Converts to this type from the input type.

impl<A> From<u16> for T1<A>

where A: From<u16>,

fn from(value: u16) -> Self

Converts to this type from the input type.

impl<A> Hash for T1<A>

where A: Hash,

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

where Ha: Hasher,

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<T> Index<usize> for T1<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 T1<T>

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

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

impl<T> Into<[T; 1]> for T1<T>

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

Converts this type into the (usually inferred) input type.

impl<A> Into<(A,)> for T1<A>

fn into(self) -> (A,)

Converts this type into the (usually inferred) input type.

impl<A> Iterator for T1<A>

where A: Iterator,

type Item = T1<<A as Iterator>::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 next_chunk<const N: usize>( &mut self ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

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

Advances the iterator and returns an array containing the next N values.

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

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

where Self: Sized,

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

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

where Self: Sized,

Consumes the iterator, returning the last element.

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

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

Advances the iterator by n elements.

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

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

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 Self: Sized, 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 Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

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

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator.

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

where Self: Sized, 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 Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, 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 Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

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

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

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

where Self: Sized,

Creates an iterator that skips the first n elements.

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

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

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

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

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

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

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

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

where Self: Sized,

Borrows an iterator, rather than consuming it.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

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

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Item) -> bool,

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

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

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 Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

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 Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> R, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

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

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, 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 Self: Sized, P: FnMut(&Self::Item) -> bool,

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

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, F: FnMut(&Self::Item) -> R, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

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

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Item) -> bool,

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

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

where B: Ord, Self: Sized, 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 Self: Sized, 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, Self: Sized, 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 Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

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

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: 'a + Copy, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: 'a + Clone, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

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

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

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

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering>

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

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

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

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

fn eq_by<I, F>(self, other: I, eq: F) -> bool

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

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

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

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

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

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>, Self: Sized,

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>, Self: Sized,

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>, Self: Sized,

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

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

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

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

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

Checks if the elements of this iterator are sorted using the given key extraction function.

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

type Output = T1<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<T> Mul<T> for T1<T>

where T: Mul + Clone,

type Output = T1<<T as Mul>::Output>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<A> Mul for T1<A>

where A: Mul,

type Output = T1<<A as Mul>::Output>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> MulAssign<T> for T1<T>

where T: MulAssign + Clone,

fn mul_assign(&mut self, rhs: T)

Performs the *= operation.

impl<A> MulAssign for T1<A>

where A: MulAssign,

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl<A> Neg for T1<A>

where A: Neg,

type Output = T1<<A as Neg>::Output>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<a, b> OpJoin<T1<b>> for T1<a>

type Output = T2<a, b>

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

impl<a, b, c> OpJoin<T1<c>> for T2<a, b>

type Output = T3<a, b, c>

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

impl<a, b, c, d> OpJoin<T1<d>> for T3<a, b, c>

type Output = T4<a, b, c, d>

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

impl<a, b, c, d, e> OpJoin<T1<e>> for T4<a, b, c, d>

type Output = T5<a, b, c, d, e>

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

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

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

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

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, h> OpJoin<T1<h>> for T7<a, b, c, d, e, f, g>

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

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

impl<a, b, c> OpJoin<T2<b, c>> for T1<a>

type Output = T3<a, b, c>

fn join(self, rhs: T2<b, c>) -> Self::Output

impl<a, b, c, d> OpJoin<T3<b, c, d>> for T1<a>

type Output = T4<a, b, c, d>

fn join(self, rhs: T3<b, c, d>) -> Self::Output

impl<a, b, c, d, e> OpJoin<T4<b, c, d, e>> for T1<a>

type Output = T5<a, b, c, d, e>

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

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

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

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

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, g, h> OpJoin<T7<b, c, d, e, f, g, h>> for T1<a>

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

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

impl<A> OpReverse for T1<A>

type Output = T1<A>

fn reverse(self) -> Self::Output

reverse the elements.

impl<A> OpRotateLeft for T1<A>

type Output = T1<A>

fn rot_l(self) -> Self::Output

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

impl<A> OpRotateRight for T1<A>

type Output = T1<A>

fn rot_r(self) -> Self::Output

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

impl<a, b> OpSplit<T1<a>> for T2<a, b>

type R = T1<b>

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

impl<a, b, c> OpSplit<T1<a>> for T3<a, b, c>

type R = T2<b, c>

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

impl<a, b, c, d> OpSplit<T1<a>> for T4<a, b, c, d>

type R = T3<b, c, d>

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

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

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

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

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> OpSplit<T1<a>> for T7<a, b, c, d, e, f, g>

type R = T6<b, c, d, e, f, g>

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

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

type R = T7<b, c, d, e, f, g, h>

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

impl<A> PartialEq for T1<A>

where A: 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 !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<A> Serialize for T1<A>

where A: Serialize,

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

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> Splat<T> for T1<T>

where T: Clone,

fn splat(t: T) -> Self

impl<T> Sub<T> for T1<T>

where T: Sub + Clone,

type Output = T1<<T as Sub>::Output>

The resulting type after applying the - operator.

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

Performs the - operation.

impl<A> Sub for T1<A>

where A: Sub,

type Output = T1<<A as Sub>::Output>

The resulting type after applying the - operator.

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

Performs the - operation.

impl<T> SubAssign<T> for T1<T>

where T: SubAssign + Clone,

fn sub_assign(&mut self, rhs: T)

Performs the -= operation.

impl<A> SubAssign for T1<A>

where A: SubAssign,

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<T> TupleElements for T1<T>

type Element = T

const N: usize = 1usize

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>,

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 into_elements(self) -> IntoElements<Self>

impl<A> Zero for T1<A>

where A: 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.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.

impl<A> Copy for T1<A>

where A: Copy,

impl<A> Eq for T1<A>

where A: Eq,