# Primitive Type tuple

1.0.0 ·
Expand description

A finite heterogeneous sequence, `(T, U, ..)`.

Let’s cover each of those in turn:

Tuples are finite. In other words, a tuple has a length. Here’s a tuple of length `3`:

``("hello", 5, 'c');``
Run

‘Length’ is also sometimes called ‘arity’ here; each tuple of a different length is a different, distinct type.

Tuples are heterogeneous. This means that each element of the tuple can have a different type. In that tuple above, it has the type:

``(&'static str, i32, char)``
Run

Tuples are a sequence. This means that they can be accessed by position; this is called ‘tuple indexing’, and it looks like this:

``````let tuple = ("hello", 5, 'c');

assert_eq!(tuple.0, "hello");
assert_eq!(tuple.1, 5);
assert_eq!(tuple.2, 'c');``````
Run

The sequential nature of the tuple applies to its implementations of various traits. For example, in `PartialOrd` and `Ord`, the elements are compared sequentially until the first non-equal set is found.

For more about tuples, see the book.

## Trait implementations

In this documentation the shorthand `(T₁, T₂, …, Tₙ)` is used to represent tuples of varying length. When that is used, any trait bound expressed on `T` applies to each element of the tuple independently. Note that this is a convenience notation to avoid repetitive documentation, not valid Rust syntax.

Due to a temporary restriction in Rust’s type system, the following traits are only implemented on tuples of arity 12 or less. In the future, this may change:

The following traits are implemented for tuples of any length. These traits have implementations that are automatically generated by the compiler, so are not limited by missing language features.

## Examples

Basic usage:

``````let tuple = ("hello", 5, 'c');

assert_eq!(tuple.0, "hello");``````
Run

Tuples are often used as a return type when you want to return more than one value:

``````fn calculate_point() -> (i32, i32) {
// Don't do a calculation, that's not the point of the example
(4, 5)
}

let point = calculate_point();

assert_eq!(point.0, 4);
assert_eq!(point.1, 5);

// Combining this with patterns can be nicer.

let (x, y) = calculate_point();

assert_eq!(x, 4);
assert_eq!(y, 5);``````
Run

Homogenous tuples can be created from arrays of appropriate length:

``````let array: [u32; 3] = [1, 2, 3];
let tuple: (u32, u32, u32) = array.into();``````
Run

source§

source§

## Trait Implementations§

source§

### impl<T: Clone> Clone for (T₁, T₂, …, Tₙ)

This trait is implemented on arbitrary-length tuples.

source§

#### fn clone(&self) -> Self

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from `source`. Read more
source§

### impl<A, Z, Y, X, W, V, U, T> Debug for (A, Z, Y, X, W, V, U, T)where A: Debug, Z: Debug, Y: Debug, X: Debug, W: Debug, V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<B, A, Z, Y, X, W, V, U, T> Debug for (B, A, Z, Y, X, W, V, U, T)where B: Debug, A: Debug, Z: Debug, Y: Debug, X: Debug, W: Debug, V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<C, B, A, Z, Y, X, W, V, U, T> Debug for (C, B, A, Z, Y, X, W, V, U, T)where C: Debug, B: Debug, A: Debug, Z: Debug, Y: Debug, X: Debug, W: Debug, V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<D, C, B, A, Z, Y, X, W, V, U, T> Debug for (D, C, B, A, Z, Y, X, W, V, U, T)where D: Debug, C: Debug, B: Debug, A: Debug, Z: Debug, Y: Debug, X: Debug, W: Debug, V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<E, D, C, B, A, Z, Y, X, W, V, U, T> Debug for (E, D, C, B, A, Z, Y, X, W, V, U, T)where E: Debug, D: Debug, C: Debug, B: Debug, A: Debug, Z: Debug, Y: Debug, X: Debug, W: Debug, V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<T> Debug for (T₁, T₂, …, Tₙ)where T: Debug + ?Sized,

This trait is implemented for tuples up to twelve items long.

source§

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

Formats the value using the given formatter. Read more
source§

### impl<U, T> Debug for (U, T)where U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<V, U, T> Debug for (V, U, T)where V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<W, V, U, T> Debug for (W, V, U, T)where W: Debug, V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<X, W, V, U, T> Debug for (X, W, V, U, T)where X: Debug, W: Debug, V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<Y, X, W, V, U, T> Debug for (Y, X, W, V, U, T)where Y: Debug, X: Debug, W: Debug, V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<Z, Y, X, W, V, U, T> Debug for (Z, Y, X, W, V, U, T)where Z: Debug, Y: Debug, X: Debug, W: Debug, V: Debug, U: Debug, T: Debug + ?Sized,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<A, Z, Y, X, W, V, U, T> Default for (A, Z, Y, X, W, V, U, T)where A: Default, Z: Default, Y: Default, X: Default, W: Default, V: Default, U: Default, T: Default,

source§

#### fn default() -> (A, Z, Y, X, W, V, U, T)

Returns the “default value” for a type. Read more
source§

### impl<B, A, Z, Y, X, W, V, U, T> Default for (B, A, Z, Y, X, W, V, U, T)where B: Default, A: Default, Z: Default, Y: Default, X: Default, W: Default, V: Default, U: Default, T: Default,

source§

#### fn default() -> (B, A, Z, Y, X, W, V, U, T)

Returns the “default value” for a type. Read more
source§

### impl<C, B, A, Z, Y, X, W, V, U, T> Default for (C, B, A, Z, Y, X, W, V, U, T)where C: Default, B: Default, A: Default, Z: Default, Y: Default, X: Default, W: Default, V: Default, U: Default, T: Default,

source§

#### fn default() -> (C, B, A, Z, Y, X, W, V, U, T)

Returns the “default value” for a type. Read more
source§

### impl<D, C, B, A, Z, Y, X, W, V, U, T> Default for (D, C, B, A, Z, Y, X, W, V, U, T)where D: Default, C: Default, B: Default, A: Default, Z: Default, Y: Default, X: Default, W: Default, V: Default, U: Default, T: Default,

source§

#### fn default() -> (D, C, B, A, Z, Y, X, W, V, U, T)

Returns the “default value” for a type. Read more
source§

### impl<E, D, C, B, A, Z, Y, X, W, V, U, T> Default for (E, D, C, B, A, Z, Y, X, W, V, U, T)where E: Default, D: Default, C: Default, B: Default, A: Default, Z: Default, Y: Default, X: Default, W: Default, V: Default, U: Default, T: Default,

source§

#### fn default() -> (E, D, C, B, A, Z, Y, X, W, V, U, T)

Returns the “default value” for a type. Read more
source§

### impl<T> Default for (T₁, T₂, …, Tₙ)where T: Default,

This trait is implemented for tuples up to twelve items long.

source§

#### fn default() -> (T,)

Returns the “default value” for a type. Read more
source§

### impl<U, T> Default for (U, T)where U: Default, T: Default,

source§

#### fn default() -> (U, T)

Returns the “default value” for a type. Read more
source§

### impl<V, U, T> Default for (V, U, T)where V: Default, U: Default, T: Default,

source§

#### fn default() -> (V, U, T)

Returns the “default value” for a type. Read more
source§

### impl<W, V, U, T> Default for (W, V, U, T)where W: Default, V: Default, U: Default, T: Default,

source§

#### fn default() -> (W, V, U, T)

Returns the “default value” for a type. Read more
source§

### impl<X, W, V, U, T> Default for (X, W, V, U, T)where X: Default, W: Default, V: Default, U: Default, T: Default,

source§

#### fn default() -> (X, W, V, U, T)

Returns the “default value” for a type. Read more
source§

### impl<Y, X, W, V, U, T> Default for (Y, X, W, V, U, T)where Y: Default, X: Default, W: Default, V: Default, U: Default, T: Default,

source§

#### fn default() -> (Y, X, W, V, U, T)

Returns the “default value” for a type. Read more
source§

### impl<Z, Y, X, W, V, U, T> Default for (Z, Y, X, W, V, U, T)where Z: Default, Y: Default, X: Default, W: Default, V: Default, U: Default, T: Default,

source§

#### fn default() -> (Z, Y, X, W, V, U, T)

Returns the “default value” for a type. Read more
source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

### impl<T> Eq for (T₁, T₂, …, Tₙ)where T: Eq + ?Sized,

This trait is implemented for tuples up to twelve items long.

source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

### impl<'a, K, V, S, A> Extend<&'a (K, V)> for HashMap<K, V, S, A>where K: Eq + Hash + Copy, V: Copy, S: BuildHasher, A: Allocator + Clone,

Inserts all new key-values from the iterator and replaces values with existing keys with new values returned from the iterator.

source§

#### fn extend<T>(&mut self, iter: T)where T: IntoIterator<Item = &'a (K, V)>,

Inserts all new key-values from the iterator to existing `HashMap<K, V, S, A>`. Replace values with existing keys with new values returned from the iterator. The keys and values must implement `Copy` trait.

##### Examples
``````use hashbrown::hash_map::HashMap;

let mut map = HashMap::new();
map.insert(1, 100);

let arr = [(1, 1), (2, 2)];
let some_iter = arr.iter();
map.extend(some_iter);
// Replace values with existing keys with new values returned from the iterator.
// So that the map.get(&1) doesn't return Some(&100).
assert_eq!(map.get(&1), Some(&1));

let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
map.extend(&some_vec);

let some_arr = [(5, 5), (6, 6)];
map.extend(&some_arr);

let mut vec: Vec<_> = map.into_iter().collect();
// The `IntoIter` iterator produces items in arbitrary order, so the
// items must be sorted to test them against a sorted array.
vec.sort_unstable();
assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);``````
Run
source§

#### fn extend_one(&mut self, _: &'a (K, V))

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Extends a collection with exactly one element.
source§

#### fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Reserves capacity in a collection for the given number of additional elements. Read more
1.2.0 · source§

### impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>where K: Ord + Copy, V: Copy, A: Allocator + Clone,

source§

#### fn extend<I>(&mut self, iter: I)where I: IntoIterator<Item = (&'a K, &'a V)>,

Extends a collection with the contents of an iterator. Read more
source§

#### fn extend_one(&mut self, _: (&'a K, &'a V))

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Extends a collection with exactly one element.
source§

#### fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Reserves capacity in a collection for the given number of additional elements. Read more
1.4.0 · source§

### impl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap<K, V, S>where K: Eq + Hash + Copy, V: Copy, S: BuildHasher,

source§

#### fn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator. Read more
source§

#### fn extend_one(&mut self, (k, v): (&'a K, &'a V))

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Extends a collection with exactly one element.
source§

#### fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

### impl<'a, K, V, S, A> Extend<(&'a K, &'a V)> for HashMap<K, V, S, A>where K: Eq + Hash + Copy, V: Copy, S: BuildHasher, A: Allocator + Clone,

Inserts all new key-values from the iterator and replaces values with existing keys with new values returned from the iterator.

source§

#### fn extend<T>(&mut self, iter: T)where T: IntoIterator<Item = (&'a K, &'a V)>,

Inserts all new key-values from the iterator to existing `HashMap<K, V, S, A>`. Replace values with existing keys with new values returned from the iterator. The keys and values must implement `Copy` trait.

##### Examples
``````use hashbrown::hash_map::HashMap;

let mut map = HashMap::new();
map.insert(1, 100);

let arr = [(1, 1), (2, 2)];
let some_iter = arr.iter().map(|(k, v)| (k, v));
map.extend(some_iter);
// Replace values with existing keys with new values returned from the iterator.
// So that the map.get(&1) doesn't return Some(&100).
assert_eq!(map.get(&1), Some(&1));

let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
map.extend(some_vec.iter().map(|(k, v)| (k, v)));

let some_arr = [(5, 5), (6, 6)];
map.extend(some_arr.iter().map(|(k, v)| (k, v)));

// You can also extend from another HashMap
let mut new_map = HashMap::new();
new_map.extend(&map);
assert_eq!(new_map, map);

let mut vec: Vec<_> = new_map.into_iter().collect();
// The `IntoIter` iterator produces items in arbitrary order, so the
// items must be sorted to test them against a sorted array.
vec.sort_unstable();
assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);``````
Run
source§

#### fn extend_one(&mut self, _: (&'a K, &'a V))

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Extends a collection with exactly one element.
source§

#### fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Reserves capacity in a collection for the given number of additional elements. Read more
1.56.0 · source§

### impl<A, B, ExtendA, ExtendB> Extend<(A, B)> for (ExtendA, ExtendB)where ExtendA: Extend<A>, ExtendB: Extend<B>,

source§

#### fn extend<T>(&mut self, into_iter: T)where T: IntoIterator<Item = (A, B)>,

Allows to `extend` a tuple of collections that also implement `Extend`.

See also: `Iterator::unzip`

##### Examples
``````let mut tuple = (vec![0], vec![1]);
tuple.extend([(2, 3), (4, 5), (6, 7)]);
assert_eq!(tuple.0, [0, 2, 4, 6]);
assert_eq!(tuple.1, [1, 3, 5, 7]);

// also allows for arbitrarily nested tuples as elements
let mut nested_tuple = (vec![1], (vec![2], vec![3]));
nested_tuple.extend([(4, (5, 6)), (7, (8, 9))]);

let (a, (b, c)) = nested_tuple;
assert_eq!(a, [1, 4, 7]);
assert_eq!(b, [2, 5, 8]);
assert_eq!(c, [3, 6, 9]);``````
Run
source§

#### fn extend_one(&mut self, item: (A, B))

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Extends a collection with exactly one element.
source§

#### fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

### impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>where K: Ord, A: Allocator + Clone,

source§

#### fn extend<T>(&mut self, iter: T)where T: IntoIterator<Item = (K, V)>,

Extends a collection with the contents of an iterator. Read more
source§

#### fn extend_one(&mut self, _: (K, V))

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Extends a collection with exactly one element.
source§

#### fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

### impl<K, V, S> Extend<(K, V)> for HashMap<K, V, S>where K: Eq + Hash, S: BuildHasher,

Inserts all new key-values from the iterator and replaces values with existing keys with new values returned from the iterator.

source§

#### fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator. Read more
source§

#### fn extend_one(&mut self, (k, v): (K, V))

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Extends a collection with exactly one element.
source§

#### fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

### impl<K, V, S, A> Extend<(K, V)> for HashMap<K, V, S, A>where K: Eq + Hash, S: BuildHasher, A: Allocator + Clone,

Inserts all new key-values from the iterator and replaces values with existing keys with new values returned from the iterator.

source§

#### fn extend<T>(&mut self, iter: T)where T: IntoIterator<Item = (K, V)>,

Inserts all new key-values from the iterator to existing `HashMap<K, V, S, A>`. Replace values with existing keys with new values returned from the iterator.

##### Examples
``````use hashbrown::hash_map::HashMap;

let mut map = HashMap::new();
map.insert(1, 100);

let some_iter = [(1, 1), (2, 2)].into_iter();
map.extend(some_iter);
// Replace values with existing keys with new values returned from the iterator.
// So that the map.get(&1) doesn't return Some(&100).
assert_eq!(map.get(&1), Some(&1));

let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
map.extend(some_vec);

let some_arr = [(5, 5), (6, 6)];
map.extend(some_arr);
let old_map_len = map.len();

// You can also extend from another HashMap
let mut new_map = HashMap::new();
new_map.extend(map);
assert_eq!(new_map.len(), old_map_len);

let mut vec: Vec<_> = new_map.into_iter().collect();
// The `IntoIter` iterator produces items in arbitrary order, so the
// items must be sorted to test them against a sorted array.
vec.sort_unstable();
assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);``````
Run
source§

#### fn extend_one(&mut self, _: (K, V))

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Extends a collection with exactly one element.
source§

#### fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (`extend_one` #72631)
Reserves capacity in a collection for the given number of additional elements. Read more
1.71.0 · source§

### impl<T> From<[T; 1]> for (T,)

source§

#### fn from(array: [T; 1]) -> (T,)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 10]> for (T, T, T, T, T, T, T, T, T, T)

source§

#### fn from(array: [T; 10]) -> (T, T, T, T, T, T, T, T, T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 11]> for (T, T, T, T, T, T, T, T, T, T, T)

source§

#### fn from(array: [T; 11]) -> (T, T, T, T, T, T, T, T, T, T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 12]> for (T, T, T, T, T, T, T, T, T, T, T, T)

source§

#### fn from(array: [T; 12]) -> (T, T, T, T, T, T, T, T, T, T, T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 2]> for (T, T)

source§

#### fn from(array: [T; 2]) -> (T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 3]> for (T, T, T)

source§

#### fn from(array: [T; 3]) -> (T, T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 4]> for (T, T, T, T)

source§

#### fn from(array: [T; 4]) -> (T, T, T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 5]> for (T, T, T, T, T)

source§

#### fn from(array: [T; 5]) -> (T, T, T, T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 6]> for (T, T, T, T, T, T)

source§

#### fn from(array: [T; 6]) -> (T, T, T, T, T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 7]> for (T, T, T, T, T, T, T)

source§

#### fn from(array: [T; 7]) -> (T, T, T, T, T, T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 8]> for (T, T, T, T, T, T, T, T)

source§

#### fn from(array: [T; 8]) -> (T, T, T, T, T, T, T, T)

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<[T; 9]> for (T, T, T, T, T, T, T, T, T)

source§

#### fn from(array: [T; 9]) -> (T, T, T, T, T, T, T, T, T)

Converts to this type from the input type.
1.17.0 · source§

source§

#### fn from(pieces: (I, u16)) -> SocketAddr

Converts a tuple struct (Into<`IpAddr`>, `u16`) into a `SocketAddr`.

This conversion creates a `SocketAddr::V4` for an `IpAddr::V4` and creates a `SocketAddr::V6` for an `IpAddr::V6`.

`u16` is treated as port of the newly created `SocketAddr`.

1.71.0 · source§

### impl<T> From<(T,)> for [T; 1]

source§

#### fn from(tuple: (T,)) -> [T; 1]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T)> for [T; 2]

source§

#### fn from(tuple: (T, T)) -> [T; 2]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T)> for [T; 3]

source§

#### fn from(tuple: (T, T, T)) -> [T; 3]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T, T)> for [T; 4]

source§

#### fn from(tuple: (T, T, T, T)) -> [T; 4]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T, T, T)> for [T; 5]

source§

#### fn from(tuple: (T, T, T, T, T)) -> [T; 5]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T, T, T, T)> for [T; 6]

source§

#### fn from(tuple: (T, T, T, T, T, T)) -> [T; 6]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T, T, T, T, T)> for [T; 7]

source§

#### fn from(tuple: (T, T, T, T, T, T, T)) -> [T; 7]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T, T, T, T, T, T)> for [T; 8]

source§

#### fn from(tuple: (T, T, T, T, T, T, T, T)) -> [T; 8]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T, T, T, T, T, T, T)> for [T; 9]

source§

#### fn from(tuple: (T, T, T, T, T, T, T, T, T)) -> [T; 9]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T, T, T, T, T, T, T, T)> for [T; 10]

source§

#### fn from(tuple: (T, T, T, T, T, T, T, T, T, T)) -> [T; 10]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T, T, T, T, T, T, T, T, T)> for [T; 11]

source§

#### fn from(tuple: (T, T, T, T, T, T, T, T, T, T, T)) -> [T; 11]

Converts to this type from the input type.
1.71.0 · source§

### impl<T> From<(T, T, T, T, T, T, T, T, T, T, T, T)> for [T; 12]

source§

#### fn from(tuple: (T, T, T, T, T, T, T, T, T, T, T, T)) -> [T; 12]

Converts to this type from the input type.
source§

### impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V, Global>where K: Ord,

source§

#### fn from_iter<T>(iter: T) -> BTreeMap<K, V, Global>where T: IntoIterator<Item = (K, V)>,

Creates a value from an iterator. Read more
source§

### impl<K, V, S> FromIterator<(K, V)> for HashMap<K, V, S>where K: Eq + Hash, S: BuildHasher + Default,

source§

#### fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> HashMap<K, V, S>

Creates a value from an iterator. Read more
source§

### impl<K, V, S, A> FromIterator<(K, V)> for HashMap<K, V, S, A>where K: Eq + Hash, S: BuildHasher + Default, A: Default + Allocator + Clone,

source§

#### fn from_iter<T>(iter: T) -> HashMap<K, V, S, A>where T: IntoIterator<Item = (K, V)>,

Creates a value from an iterator. Read more
source§

### impl<T> Hash for (T₁, T₂, …, Tₙ)where T: Hash + ?Sized,

This trait is implemented for tuples up to twelve items long.

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B> Hash for (T, B)where T: Hash, B: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C> Hash for (T, B, C)where T: Hash, B: Hash, C: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C, D> Hash for (T, B, C, D)where T: Hash, B: Hash, C: Hash, D: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C, D, E> Hash for (T, B, C, D, E)where T: Hash, B: Hash, C: Hash, D: Hash, E: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C, D, E, F> Hash for (T, B, C, D, E, F)where T: Hash, B: Hash, C: Hash, D: Hash, E: Hash, F: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C, D, E, F, G> Hash for (T, B, C, D, E, F, G)where T: Hash, B: Hash, C: Hash, D: Hash, E: Hash, F: Hash, G: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C, D, E, F, G, H> Hash for (T, B, C, D, E, F, G, H)where T: Hash, B: Hash, C: Hash, D: Hash, E: Hash, F: Hash, G: Hash, H: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C, D, E, F, G, H, I> Hash for (T, B, C, D, E, F, G, H, I)where T: Hash, B: Hash, C: Hash, D: Hash, E: Hash, F: Hash, G: Hash, H: Hash, I: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C, D, E, F, G, H, I, J> Hash for (T, B, C, D, E, F, G, H, I, J)where T: Hash, B: Hash, C: Hash, D: Hash, E: Hash, F: Hash, G: Hash, H: Hash, I: Hash, J: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C, D, E, F, G, H, I, J, K> Hash for (T, B, C, D, E, F, G, H, I, J, K)where T: Hash, B: Hash, C: Hash, D: Hash, E: Hash, F: Hash, G: Hash, H: Hash, I: Hash, J: Hash, K: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<T, B, C, D, E, F, G, H, I, J, K, L> Hash for (T, B, C, D, E, F, G, H, I, J, K, L)where T: Hash, B: Hash, C: Hash, D: Hash, E: Hash, F: Hash, G: Hash, H: Hash, I: Hash, J: Hash, K: Hash, L: Hash + ?Sized,

source§

#### fn hash<S>(&self, state: &mut S)where S: Hasher,

Feeds this value into the given `Hasher`. Read more
source§

### impl<A, Z, Y, X, W, V, U, T> Ord for (A, Z, Y, X, W, V, U, T)where A: Ord, Z: Ord, Y: Ord, X: Ord, W: Ord, V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(A, Z, Y, X, W, V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<B, A, Z, Y, X, W, V, U, T> Ord for (B, A, Z, Y, X, W, V, U, T)where B: Ord, A: Ord, Z: Ord, Y: Ord, X: Ord, W: Ord, V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(B, A, Z, Y, X, W, V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<C, B, A, Z, Y, X, W, V, U, T> Ord for (C, B, A, Z, Y, X, W, V, U, T)where C: Ord, B: Ord, A: Ord, Z: Ord, Y: Ord, X: Ord, W: Ord, V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(C, B, A, Z, Y, X, W, V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<D, C, B, A, Z, Y, X, W, V, U, T> Ord for (D, C, B, A, Z, Y, X, W, V, U, T)where D: Ord, C: Ord, B: Ord, A: Ord, Z: Ord, Y: Ord, X: Ord, W: Ord, V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(D, C, B, A, Z, Y, X, W, V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<E, D, C, B, A, Z, Y, X, W, V, U, T> Ord for (E, D, C, B, A, Z, Y, X, W, V, U, T)where E: Ord, D: Ord, C: Ord, B: Ord, A: Ord, Z: Ord, Y: Ord, X: Ord, W: Ord, V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(E, D, C, B, A, Z, Y, X, W, V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<T> Ord for (T₁, T₂, …, Tₙ)where T: Ord + ?Sized,

This trait is implemented for tuples up to twelve items long.

source§

#### fn cmp(&self, other: &(T,)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<U, T> Ord for (U, T)where U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<V, U, T> Ord for (V, U, T)where V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<W, V, U, T> Ord for (W, V, U, T)where W: Ord, V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(W, V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<X, W, V, U, T> Ord for (X, W, V, U, T)where X: Ord, W: Ord, V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(X, W, V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<Y, X, W, V, U, T> Ord for (Y, X, W, V, U, T)where Y: Ord, X: Ord, W: Ord, V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(Y, X, W, V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<Z, Y, X, W, V, U, T> Ord for (Z, Y, X, W, V, U, T)where Z: Ord, Y: Ord, X: Ord, W: Ord, V: Ord, U: Ord, T: Ord + ?Sized,

source§

#### fn cmp(&self, other: &(Z, Y, X, W, V, U, T)) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
source§

### impl<A, Z, Y, X, W, V, U, T> PartialEq<(A, Z, Y, X, W, V, U, T)> for (A, Z, Y, X, W, V, U, T)where A: PartialEq<A>, Z: PartialEq<Z>, Y: PartialEq<Y>, X: PartialEq<X>, W: PartialEq<W>, V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(A, Z, Y, X, W, V, U, T)) -> bool

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

#### fn ne(&self, other: &(A, Z, Y, X, W, V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<B, A, Z, Y, X, W, V, U, T> PartialEq<(B, A, Z, Y, X, W, V, U, T)> for (B, A, Z, Y, X, W, V, U, T)where B: PartialEq<B>, A: PartialEq<A>, Z: PartialEq<Z>, Y: PartialEq<Y>, X: PartialEq<X>, W: PartialEq<W>, V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(B, A, Z, Y, X, W, V, U, T)) -> bool

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

#### fn ne(&self, other: &(B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<C, B, A, Z, Y, X, W, V, U, T> PartialEq<(C, B, A, Z, Y, X, W, V, U, T)> for (C, B, A, Z, Y, X, W, V, U, T)where C: PartialEq<C>, B: PartialEq<B>, A: PartialEq<A>, Z: PartialEq<Z>, Y: PartialEq<Y>, X: PartialEq<X>, W: PartialEq<W>, V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(C, B, A, Z, Y, X, W, V, U, T)) -> bool

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

#### fn ne(&self, other: &(C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<D, C, B, A, Z, Y, X, W, V, U, T> PartialEq<(D, C, B, A, Z, Y, X, W, V, U, T)> for (D, C, B, A, Z, Y, X, W, V, U, T)where D: PartialEq<D>, C: PartialEq<C>, B: PartialEq<B>, A: PartialEq<A>, Z: PartialEq<Z>, Y: PartialEq<Y>, X: PartialEq<X>, W: PartialEq<W>, V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

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

#### fn ne(&self, other: &(D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<E, D, C, B, A, Z, Y, X, W, V, U, T> PartialEq<(E, D, C, B, A, Z, Y, X, W, V, U, T)> for (E, D, C, B, A, Z, Y, X, W, V, U, T)where E: PartialEq<E>, D: PartialEq<D>, C: PartialEq<C>, B: PartialEq<B>, A: PartialEq<A>, Z: PartialEq<Z>, Y: PartialEq<Y>, X: PartialEq<X>, W: PartialEq<W>, V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(E, D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

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

#### fn ne(&self, other: &(E, D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<T> PartialEq<(T,)> for (T₁, T₂, …, Tₙ)where T: PartialEq<T> + ?Sized,

This trait is implemented for tuples up to twelve items long.

source§

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

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

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

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<U, T> PartialEq<(U, T)> for (U, T)where U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(U, T)) -> bool

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

#### fn ne(&self, other: &(U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<V, U, T> PartialEq<(V, U, T)> for (V, U, T)where V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(V, U, T)) -> bool

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

#### fn ne(&self, other: &(V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<W, V, U, T> PartialEq<(W, V, U, T)> for (W, V, U, T)where W: PartialEq<W>, V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(W, V, U, T)) -> bool

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

#### fn ne(&self, other: &(W, V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<X, W, V, U, T> PartialEq<(X, W, V, U, T)> for (X, W, V, U, T)where X: PartialEq<X>, W: PartialEq<W>, V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(X, W, V, U, T)) -> bool

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

#### fn ne(&self, other: &(X, W, V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<Y, X, W, V, U, T> PartialEq<(Y, X, W, V, U, T)> for (Y, X, W, V, U, T)where Y: PartialEq<Y>, X: PartialEq<X>, W: PartialEq<W>, V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(Y, X, W, V, U, T)) -> bool

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

#### fn ne(&self, other: &(Y, X, W, V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<Z, Y, X, W, V, U, T> PartialEq<(Z, Y, X, W, V, U, T)> for (Z, Y, X, W, V, U, T)where Z: PartialEq<Z>, Y: PartialEq<Y>, X: PartialEq<X>, W: PartialEq<W>, V: PartialEq<V>, U: PartialEq<U>, T: PartialEq<T> + ?Sized,

source§

#### fn eq(&self, other: &(Z, Y, X, W, V, U, T)) -> bool

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

#### fn ne(&self, other: &(Z, Y, X, W, V, U, T)) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<A, Z, Y, X, W, V, U, T> PartialOrd<(A, Z, Y, X, W, V, U, T)> for (A, Z, Y, X, W, V, U, T)where A: PartialOrd<A>, Z: PartialOrd<Z>, Y: PartialOrd<Y>, X: PartialOrd<X>, W: PartialOrd<W>, V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp(&self, other: &(A, Z, Y, X, W, V, U, T)) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<B, A, Z, Y, X, W, V, U, T> PartialOrd<(B, A, Z, Y, X, W, V, U, T)> for (B, A, Z, Y, X, W, V, U, T)where B: PartialOrd<B>, A: PartialOrd<A>, Z: PartialOrd<Z>, Y: PartialOrd<Y>, X: PartialOrd<X>, W: PartialOrd<W>, V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp(&self, other: &(B, A, Z, Y, X, W, V, U, T)) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<C, B, A, Z, Y, X, W, V, U, T> PartialOrd<(C, B, A, Z, Y, X, W, V, U, T)> for (C, B, A, Z, Y, X, W, V, U, T)where C: PartialOrd<C>, B: PartialOrd<B>, A: PartialOrd<A>, Z: PartialOrd<Z>, Y: PartialOrd<Y>, X: PartialOrd<X>, W: PartialOrd<W>, V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp( &self, other: &(C, B, A, Z, Y, X, W, V, U, T) ) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<D, C, B, A, Z, Y, X, W, V, U, T> PartialOrd<(D, C, B, A, Z, Y, X, W, V, U, T)> for (D, C, B, A, Z, Y, X, W, V, U, T)where D: PartialOrd<D>, C: PartialOrd<C>, B: PartialOrd<B>, A: PartialOrd<A>, Z: PartialOrd<Z>, Y: PartialOrd<Y>, X: PartialOrd<X>, W: PartialOrd<W>, V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp( &self, other: &(D, C, B, A, Z, Y, X, W, V, U, T) ) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<E, D, C, B, A, Z, Y, X, W, V, U, T> PartialOrd<(E, D, C, B, A, Z, Y, X, W, V, U, T)> for (E, D, C, B, A, Z, Y, X, W, V, U, T)where E: PartialOrd<E>, D: PartialOrd<D>, C: PartialOrd<C>, B: PartialOrd<B>, A: PartialOrd<A>, Z: PartialOrd<Z>, Y: PartialOrd<Y>, X: PartialOrd<X>, W: PartialOrd<W>, V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp( &self, other: &(E, D, C, B, A, Z, Y, X, W, V, U, T) ) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(E, D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(E, D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(E, D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(E, D, C, B, A, Z, Y, X, W, V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<T> PartialOrd<(T,)> for (T₁, T₂, …, Tₙ)where T: PartialOrd<T> + ?Sized,

This trait is implemented for tuples up to twelve items long.

source§

#### fn partial_cmp(&self, other: &(T,)) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(T,)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(T,)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(T,)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(T,)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<U, T> PartialOrd<(U, T)> for (U, T)where U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp(&self, other: &(U, T)) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<V, U, T> PartialOrd<(V, U, T)> for (V, U, T)where V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp(&self, other: &(V, U, T)) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<W, V, U, T> PartialOrd<(W, V, U, T)> for (W, V, U, T)where W: PartialOrd<W>, V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp(&self, other: &(W, V, U, T)) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(W, V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(W, V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(W, V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(W, V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<X, W, V, U, T> PartialOrd<(X, W, V, U, T)> for (X, W, V, U, T)where X: PartialOrd<X>, W: PartialOrd<W>, V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp(&self, other: &(X, W, V, U, T)) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(X, W, V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(X, W, V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(X, W, V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(X, W, V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<Y, X, W, V, U, T> PartialOrd<(Y, X, W, V, U, T)> for (Y, X, W, V, U, T)where Y: PartialOrd<Y>, X: PartialOrd<X>, W: PartialOrd<W>, V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp(&self, other: &(Y, X, W, V, U, T)) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(Y, X, W, V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(Y, X, W, V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(Y, X, W, V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(Y, X, W, V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
source§

### impl<Z, Y, X, W, V, U, T> PartialOrd<(Z, Y, X, W, V, U, T)> for (Z, Y, X, W, V, U, T)where Z: PartialOrd<Z>, Y: PartialOrd<Y>, X: PartialOrd<X>, W: PartialOrd<W>, V: PartialOrd<V>, U: PartialOrd<U>, T: PartialOrd<T> + ?Sized,

source§

#### fn partial_cmp(&self, other: &(Z, Y, X, W, V, U, T)) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
source§

#### fn lt(&self, other: &(Z, Y, X, W, V, U, T)) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
source§

#### fn le(&self, other: &(Z, Y, X, W, V, U, T)) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
source§

#### fn ge(&self, other: &(Z, Y, X, W, V, U, T)) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

#### fn gt(&self, other: &(Z, Y, X, W, V, U, T)) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
1.28.0 · source§

### impl<'a, T> RangeBounds<T> for (Bound<&'a T>, Bound<&'a T>)where T: 'a + ?Sized,

source§

source§

1.35.0 · source§

#### fn contains<U>(&self, item: &U) -> boolwhere T: PartialOrd<U>, U: PartialOrd<T> + ?Sized,

Returns `true` if `item` is contained in the range. Read more
1.28.0 · source§

### impl<T> RangeBounds<T> for (Bound<T>, Bound<T>)

source§

source§

1.35.0 · source§

#### fn contains<U>(&self, item: &U) -> boolwhere T: PartialOrd<U>, U: PartialOrd<T> + ?Sized,

Returns `true` if `item` is contained in the range. Read more
1.53.0 · source§

### impl<T> SliceIndex<[T]> for (Bound<usize>, Bound<usize>)

§

#### type Output = [T]

The output type returned by methods.
source§

#### fn get( self, slice: &[T] ) -> Option<&<(Bound<usize>, Bound<usize>) as SliceIndex<[T]>>::Output>

🔬This is a nightly-only experimental API. (`slice_index_methods`)
Returns a shared reference to the output at this location, if in bounds.
source§

#### fn get_mut( self, slice: &mut [T] ) -> Option<&mut <(Bound<usize>, Bound<usize>) as SliceIndex<[T]>>::Output>

🔬This is a nightly-only experimental API. (`slice_index_methods`)
Returns a mutable reference to the output at this location, if in bounds.
source§

#### unsafe fn get_unchecked( self, slice: *const [T] ) -> *const <(Bound<usize>, Bound<usize>) as SliceIndex<[T]>>::Output

🔬This is a nightly-only experimental API. (`slice_index_methods`)
Returns a shared reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling `slice` pointer is undefined behavior even if the resulting reference is not used.
source§

#### unsafe fn get_unchecked_mut( self, slice: *mut [T] ) -> *mut <(Bound<usize>, Bound<usize>) as SliceIndex<[T]>>::Output

🔬This is a nightly-only experimental API. (`slice_index_methods`)
Returns a mutable reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling `slice` pointer is undefined behavior even if the resulting reference is not used.
source§

#### fn index( self, slice: &[T] ) -> &<(Bound<usize>, Bound<usize>) as SliceIndex<[T]>>::Output

🔬This is a nightly-only experimental API. (`slice_index_methods`)
Returns a shared reference to the output at this location, panicking if out of bounds.
source§

#### fn index_mut( self, slice: &mut [T] ) -> &mut <(Bound<usize>, Bound<usize>) as SliceIndex<[T]>>::Output

🔬This is a nightly-only experimental API. (`slice_index_methods`)
Returns a mutable reference to the output at this location, panicking if out of bounds.
source§

### impl ToSocketAddrs for (&str, u16)

§

#### type Iter = IntoIter<SocketAddr, Global>

Returned iterator over socket addresses which this type may correspond to.
source§

Converts this object to an iterator of resolved `SocketAddr`s. Read more
source§

§

Returned iterator over socket addresses which this type may correspond to.
source§

Converts this object to an iterator of resolved `SocketAddr`s. Read more
source§

§

Returned iterator over socket addresses which this type may correspond to.
source§

Converts this object to an iterator of resolved `SocketAddr`s. Read more
source§

§

Returned iterator over socket addresses which this type may correspond to.
source§

Converts this object to an iterator of resolved `SocketAddr`s. Read more
1.46.0 · source§

### impl ToSocketAddrs for (String, u16)

§

#### type Iter = IntoIter<SocketAddr, Global>

Returned iterator over socket addresses which this type may correspond to.
source§

Converts this object to an iterator of resolved `SocketAddr`s. Read more
source§

### impl<'a> TryFrom<(&'a str, u16)> for LookupHost

§

#### type Error = Error

The type returned in the event of a conversion error.
source§

#### fn try_from((host, port): (&'a str, u16)) -> Result<LookupHost>

Performs the conversion.
source§

source§

source§

source§

source§

source§

### impl<T> ConstParamTy for (T₁, T₂, …, Tₙ)where T: ConstParamTy,

This trait is implemented for tuples up to twelve items long.

source§

source§

source§

source§

source§

source§

source§

### impl<T: Copy> Copy for (T₁, T₂, …, Tₙ)

This trait is implemented on arbitrary-length tuples.

source§

source§

source§

source§

source§

source§

### impl<T> StructuralEq for (T₁, T₂, …, Tₙ)

This trait is implemented for tuples up to twelve items long.

source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

source§

### impl<T> StructuralPartialEq for (T₁, T₂, …, Tₙ)

This trait is implemented for tuples up to twelve items long.

source§

source§

source§

source§

source§

source§

§

§

§

§

§

## Blanket Implementations§

source§

### impl<T> Any for Twhere T: 'static + ?Sized,

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

### impl<T> Borrow<T> for Twhere T: ?Sized,

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

### impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

#### fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> for Twhere U: From<T>,

source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

source§

### impl<T> ToOwned for Twhere T: Clone,

§

#### type Owned = T

The resulting type after obtaining ownership.
source§

#### fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

#### fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

### impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

#### type Error = Infallible

The type returned in the event of a conversion error.
source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

### impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.