Primitive Type tuple

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');

‘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)

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');

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

If every type inside a tuple implements one of the following traits, then a tuple itself also implements it.

• Clone
• Copy
• PartialEq
• Eq
• PartialOrd
• Ord
• Debug
• Default
• Hash

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

Examples

Basic usage:

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

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

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);

Trait Implementations

impl<T10, T11> Debug for (T10, T11) where
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T4, T5, T6, T7, T8, T9, T10, T11> Debug for (T4, T5, T6, T7, T8, T9, T10, T11) where
    T4: Debug,
    T5: Debug,
    T6: Debug,
    T7: Debug,
    T8: Debug,
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Debug for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11) where
    T0: Debug,
    T1: Debug,
    T2: Debug,
    T3: Debug,
    T4: Debug,
    T5: Debug,
    T6: Debug,
    T7: Debug,
    T8: Debug,
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T6, T7, T8, T9, T10, T11> Debug for (T6, T7, T8, T9, T10, T11) where
    T6: Debug,
    T7: Debug,
    T8: Debug,
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T5, T6, T7, T8, T9, T10, T11> Debug for (T5, T6, T7, T8, T9, T10, T11) where
    T5: Debug,
    T6: Debug,
    T7: Debug,
    T8: Debug,
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T11> Debug for (T11,) where
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T8, T9, T10, T11> Debug for (T8, T9, T10, T11) where
    T8: Debug,
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Debug for (T2, T3, T4, T5, T6, T7, T8, T9, T10, T11) where
    T2: Debug,
    T3: Debug,
    T4: Debug,
    T5: Debug,
    T6: Debug,
    T7: Debug,
    T8: Debug,
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T9, T10, T11> Debug for (T9, T10, T11) where
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T3, T4, T5, T6, T7, T8, T9, T10, T11> Debug for (T3, T4, T5, T6, T7, T8, T9, T10, T11) where
    T3: Debug,
    T4: Debug,
    T5: Debug,
    T6: Debug,
    T7: Debug,
    T8: Debug,
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Debug for (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11) where
    T1: Debug,
    T2: Debug,
    T3: Debug,
    T4: Debug,
    T5: Debug,
    T6: Debug,
    T7: Debug,
    T8: Debug,
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<T7, T8, T9, T10, T11> Debug for (T7, T8, T9, T10, T11) where
    T7: Debug,
    T8: Debug,
    T9: Debug,
    T10: Debug,
    T11: Debug + ?Sized, 

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

Formats the value using the given formatter.

impl<D, E, F, G, H, I, J, K, L> Default for (D, E, F, G, H, I, J, K, L) where
    D: Default,
    E: Default,
    F: Default,
    G: Default,
    H: Default,
    I: Default,
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (D, E, F, G, H, I, J, K, L)

Returns the “default value” for a type.

impl<J, K, L> Default for (J, K, L) where
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (J, K, L)

Returns the “default value” for a type.

impl<E, F, G, H, I, J, K, L> Default for (E, F, G, H, I, J, K, L) where
    E: Default,
    F: Default,
    G: Default,
    H: Default,
    I: Default,
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (E, F, G, H, I, J, K, L)

Returns the “default value” for a type.

impl<K, L> Default for (K, L) where
    K: Default,
    L: Default, 

fn default() -> (K, L)

Returns the “default value” for a type.

impl<B, C, D, E, F, G, H, I, J, K, L> Default for (B, C, D, E, F, G, H, I, J, K, L) where
    B: Default,
    C: Default,
    D: Default,
    E: Default,
    F: Default,
    G: Default,
    H: Default,
    I: Default,
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (B, C, D, E, F, G, H, I, J, K, L)

Returns the “default value” for a type.

impl<H, I, J, K, L> Default for (H, I, J, K, L) where
    H: Default,
    I: Default,
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (H, I, J, K, L)

Returns the “default value” for a type.

impl<A, B, C, D, E, F, G, H, I, J, K, L> Default for (A, B, C, D, E, F, G, H, I, J, K, L) where
    A: Default,
    B: Default,
    C: Default,
    D: Default,
    E: Default,
    F: Default,
    G: Default,
    H: Default,
    I: Default,
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (A, B, C, D, E, F, G, H, I, J, K, L)

Returns the “default value” for a type.

impl<C, D, E, F, G, H, I, J, K, L> Default for (C, D, E, F, G, H, I, J, K, L) where
    C: Default,
    D: Default,
    E: Default,
    F: Default,
    G: Default,
    H: Default,
    I: Default,
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (C, D, E, F, G, H, I, J, K, L)

Returns the “default value” for a type.

impl<I, J, K, L> Default for (I, J, K, L) where
    I: Default,
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (I, J, K, L)

Returns the “default value” for a type.

impl<F, G, H, I, J, K, L> Default for (F, G, H, I, J, K, L) where
    F: Default,
    G: Default,
    H: Default,
    I: Default,
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (F, G, H, I, J, K, L)

Returns the “default value” for a type.

impl<L> Default for (L,) where
    L: Default, 

fn default() -> (L,)

Returns the “default value” for a type.

impl<G, H, I, J, K, L> Default for (G, H, I, J, K, L) where
    G: Default,
    H: Default,
    I: Default,
    J: Default,
    K: Default,
    L: Default, 

fn default() -> (G, H, I, J, K, L)

Returns the “default value” for a type.

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

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

Extends a collection with the contents of an iterator.

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.

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.

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

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

Extends a collection with the contents of an iterator.

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.

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.

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

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]);

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.

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.

impl<K, V> Extend<(K, V)> for BTreeMap<K, V> where
    K: Ord, 

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, (K, V))

🔬 This is a nightly-only experimental API. (extend_one #72631)

Extends a collection with exactly one element.

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.

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.

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

Extends a collection with the contents of an iterator.

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.

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.

impl<I: Into<IpAddr>> From<(I, u16)> for SocketAddr

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.

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

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

Creates a value from an iterator.

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

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

Creates a value from an iterator.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<A> Hash for (A,) where
    A: Hash + ?Sized, 

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<L> Ord for (L,) where
    L: Ord + ?Sized, 

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

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<I, J, K, L> Ord for (I, J, K, L) where
    I: Ord,
    J: Ord,
    K: Ord,
    L: Ord + ?Sized, 

fn cmp(&self, other: &(I, J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<G, H, I, J, K, L> Ord for (G, H, I, J, K, L) where
    G: Ord,
    H: Ord,
    I: Ord,
    J: Ord,
    K: Ord,
    L: Ord + ?Sized, 

fn cmp(&self, other: &(G, H, I, J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

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

fn cmp(&self, other: &(C, D, E, F, G, H, I, J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<J, K, L> Ord for (J, K, L) where
    J: Ord,
    K: Ord,
    L: Ord + ?Sized, 

fn cmp(&self, other: &(J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<H, I, J, K, L> Ord for (H, I, J, K, L) where
    H: Ord,
    I: Ord,
    J: Ord,
    K: Ord,
    L: Ord + ?Sized, 

fn cmp(&self, other: &(H, I, J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<D, E, F, G, H, I, J, K, L> Ord for (D, E, F, G, H, I, J, K, L) where
    D: Ord,
    E: Ord,
    F: Ord,
    G: Ord,
    H: Ord,
    I: Ord,
    J: Ord,
    K: Ord,
    L: Ord + ?Sized, 

fn cmp(&self, other: &(D, E, F, G, H, I, J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<K, L> Ord for (K, L) where
    K: Ord,
    L: Ord + ?Sized, 

fn cmp(&self, other: &(K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

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

fn cmp(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

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

fn cmp(&self, other: &(B, C, D, E, F, G, H, I, J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<E, F, G, H, I, J, K, L> Ord for (E, F, G, H, I, J, K, L) where
    E: Ord,
    F: Ord,
    G: Ord,
    H: Ord,
    I: Ord,
    J: Ord,
    K: Ord,
    L: Ord + ?Sized, 

fn cmp(&self, other: &(E, F, G, H, I, J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<F, G, H, I, J, K, L> Ord for (F, G, H, I, J, K, L) where
    F: Ord,
    G: Ord,
    H: Ord,
    I: Ord,
    J: Ord,
    K: Ord,
    L: Ord + ?Sized, 

fn cmp(&self, other: &(F, G, H, I, J, K, L)) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

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

fn eq(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> bool

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

fn ne(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> bool

This method tests for !=.

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

fn eq(&self, other: &(B, C, D, E, F, G, H, I, J, K, L)) -> bool

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

fn ne(&self, other: &(B, C, D, E, F, G, H, I, J, K, L)) -> bool

This method tests for !=.

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

fn eq(&self, other: &(C, D, E, F, G, H, I, J, K, L)) -> bool

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

fn ne(&self, other: &(C, D, E, F, G, H, I, J, K, L)) -> bool

This method tests for !=.

impl<D, E, F, G, H, I, J, K, L> PartialEq<(D, E, F, G, H, I, J, K, L)> for (D, E, F, G, H, I, J, K, L) where
    D: PartialEq<D>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    I: PartialEq<I>,
    J: PartialEq<J>,
    K: PartialEq<K>,
    L: PartialEq<L> + ?Sized, 

fn eq(&self, other: &(D, E, F, G, H, I, J, K, L)) -> bool

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

fn ne(&self, other: &(D, E, F, G, H, I, J, K, L)) -> bool

This method tests for !=.

impl<E, F, G, H, I, J, K, L> PartialEq<(E, F, G, H, I, J, K, L)> for (E, F, G, H, I, J, K, L) where
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    I: PartialEq<I>,
    J: PartialEq<J>,
    K: PartialEq<K>,
    L: PartialEq<L> + ?Sized, 

fn eq(&self, other: &(E, F, G, H, I, J, K, L)) -> bool

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

fn ne(&self, other: &(E, F, G, H, I, J, K, L)) -> bool

This method tests for !=.

impl<F, G, H, I, J, K, L> PartialEq<(F, G, H, I, J, K, L)> for (F, G, H, I, J, K, L) where
    F: PartialEq<F>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    I: PartialEq<I>,
    J: PartialEq<J>,
    K: PartialEq<K>,
    L: PartialEq<L> + ?Sized, 

fn eq(&self, other: &(F, G, H, I, J, K, L)) -> bool

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

fn ne(&self, other: &(F, G, H, I, J, K, L)) -> bool

This method tests for !=.

impl<G, H, I, J, K, L> PartialEq<(G, H, I, J, K, L)> for (G, H, I, J, K, L) where
    G: PartialEq<G>,
    H: PartialEq<H>,
    I: PartialEq<I>,
    J: PartialEq<J>,
    K: PartialEq<K>,
    L: PartialEq<L> + ?Sized, 

fn eq(&self, other: &(G, H, I, J, K, L)) -> bool

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

fn ne(&self, other: &(G, H, I, J, K, L)) -> bool

This method tests for !=.

impl<H, I, J, K, L> PartialEq<(H, I, J, K, L)> for (H, I, J, K, L) where
    H: PartialEq<H>,
    I: PartialEq<I>,
    J: PartialEq<J>,
    K: PartialEq<K>,
    L: PartialEq<L> + ?Sized, 

fn eq(&self, other: &(H, I, J, K, L)) -> bool

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

fn ne(&self, other: &(H, I, J, K, L)) -> bool

This method tests for !=.

impl<I, J, K, L> PartialEq<(I, J, K, L)> for (I, J, K, L) where
    I: PartialEq<I>,
    J: PartialEq<J>,
    K: PartialEq<K>,
    L: PartialEq<L> + ?Sized, 

fn eq(&self, other: &(I, J, K, L)) -> bool

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

fn ne(&self, other: &(I, J, K, L)) -> bool

This method tests for !=.

impl<J, K, L> PartialEq<(J, K, L)> for (J, K, L) where
    J: PartialEq<J>,
    K: PartialEq<K>,
    L: PartialEq<L> + ?Sized, 

fn eq(&self, other: &(J, K, L)) -> bool

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

fn ne(&self, other: &(J, K, L)) -> bool

This method tests for !=.

impl<K, L> PartialEq<(K, L)> for (K, L) where
    K: PartialEq<K>,
    L: PartialEq<L> + ?Sized, 

fn eq(&self, other: &(K, L)) -> bool

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

fn ne(&self, other: &(K, L)) -> bool

This method tests for !=.

impl<L> PartialEq<(L,)> for (L,) where
    L: PartialEq<L> + ?Sized, 

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

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

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

This method tests for !=.

impl<A, B, C, D, E, F, G, H, I, J, K, L> PartialOrd<(A, B, C, D, E, F, G, H, I, J, K, L)> for (A, B, C, D, E, F, G, H, I, J, K, L) where
    A: PartialOrd<A> + PartialEq<A>,
    B: PartialOrd<B> + PartialEq<B>,
    C: PartialOrd<C> + PartialEq<C>,
    D: PartialOrd<D> + PartialEq<D>,
    E: PartialOrd<E> + PartialEq<E>,
    F: PartialOrd<F> + PartialEq<F>,
    G: PartialOrd<G> + PartialEq<G>,
    H: PartialOrd<H> + PartialEq<H>,
    I: PartialOrd<I> + PartialEq<I>,
    J: PartialOrd<J> + PartialEq<J>,
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(
    &self,
    other: &(A, B, C, D, E, F, G, H, I, J, K, L)
) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> bool

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

fn ge(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> bool

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

fn gt(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

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

fn partial_cmp(
    &self,
    other: &(B, C, D, E, F, G, H, I, J, K, L)
) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(B, C, D, E, F, G, H, I, J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(B, C, D, E, F, G, H, I, J, K, L)) -> bool

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

fn ge(&self, other: &(B, C, D, E, F, G, H, I, J, K, L)) -> bool

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

fn gt(&self, other: &(B, C, D, E, F, G, H, I, J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<C, D, E, F, G, H, I, J, K, L> PartialOrd<(C, D, E, F, G, H, I, J, K, L)> for (C, D, E, F, G, H, I, J, K, L) where
    C: PartialOrd<C> + PartialEq<C>,
    D: PartialOrd<D> + PartialEq<D>,
    E: PartialOrd<E> + PartialEq<E>,
    F: PartialOrd<F> + PartialEq<F>,
    G: PartialOrd<G> + PartialEq<G>,
    H: PartialOrd<H> + PartialEq<H>,
    I: PartialOrd<I> + PartialEq<I>,
    J: PartialOrd<J> + PartialEq<J>,
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(
    &self,
    other: &(C, D, E, F, G, H, I, J, K, L)
) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(C, D, E, F, G, H, I, J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(C, D, E, F, G, H, I, J, K, L)) -> bool

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

fn ge(&self, other: &(C, D, E, F, G, H, I, J, K, L)) -> bool

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

fn gt(&self, other: &(C, D, E, F, G, H, I, J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<D, E, F, G, H, I, J, K, L> PartialOrd<(D, E, F, G, H, I, J, K, L)> for (D, E, F, G, H, I, J, K, L) where
    D: PartialOrd<D> + PartialEq<D>,
    E: PartialOrd<E> + PartialEq<E>,
    F: PartialOrd<F> + PartialEq<F>,
    G: PartialOrd<G> + PartialEq<G>,
    H: PartialOrd<H> + PartialEq<H>,
    I: PartialOrd<I> + PartialEq<I>,
    J: PartialOrd<J> + PartialEq<J>,
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(&self, other: &(D, E, F, G, H, I, J, K, L)) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(D, E, F, G, H, I, J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(D, E, F, G, H, I, J, K, L)) -> bool

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

fn ge(&self, other: &(D, E, F, G, H, I, J, K, L)) -> bool

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

fn gt(&self, other: &(D, E, F, G, H, I, J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<E, F, G, H, I, J, K, L> PartialOrd<(E, F, G, H, I, J, K, L)> for (E, F, G, H, I, J, K, L) where
    E: PartialOrd<E> + PartialEq<E>,
    F: PartialOrd<F> + PartialEq<F>,
    G: PartialOrd<G> + PartialEq<G>,
    H: PartialOrd<H> + PartialEq<H>,
    I: PartialOrd<I> + PartialEq<I>,
    J: PartialOrd<J> + PartialEq<J>,
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(&self, other: &(E, F, G, H, I, J, K, L)) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(E, F, G, H, I, J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(E, F, G, H, I, J, K, L)) -> bool

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

fn ge(&self, other: &(E, F, G, H, I, J, K, L)) -> bool

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

fn gt(&self, other: &(E, F, G, H, I, J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<F, G, H, I, J, K, L> PartialOrd<(F, G, H, I, J, K, L)> for (F, G, H, I, J, K, L) where
    F: PartialOrd<F> + PartialEq<F>,
    G: PartialOrd<G> + PartialEq<G>,
    H: PartialOrd<H> + PartialEq<H>,
    I: PartialOrd<I> + PartialEq<I>,
    J: PartialOrd<J> + PartialEq<J>,
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(&self, other: &(F, G, H, I, J, K, L)) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(F, G, H, I, J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(F, G, H, I, J, K, L)) -> bool

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

fn ge(&self, other: &(F, G, H, I, J, K, L)) -> bool

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

fn gt(&self, other: &(F, G, H, I, J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<G, H, I, J, K, L> PartialOrd<(G, H, I, J, K, L)> for (G, H, I, J, K, L) where
    G: PartialOrd<G> + PartialEq<G>,
    H: PartialOrd<H> + PartialEq<H>,
    I: PartialOrd<I> + PartialEq<I>,
    J: PartialOrd<J> + PartialEq<J>,
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(&self, other: &(G, H, I, J, K, L)) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(G, H, I, J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(G, H, I, J, K, L)) -> bool

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

fn ge(&self, other: &(G, H, I, J, K, L)) -> bool

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

fn gt(&self, other: &(G, H, I, J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<H, I, J, K, L> PartialOrd<(H, I, J, K, L)> for (H, I, J, K, L) where
    H: PartialOrd<H> + PartialEq<H>,
    I: PartialOrd<I> + PartialEq<I>,
    J: PartialOrd<J> + PartialEq<J>,
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(&self, other: &(H, I, J, K, L)) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(H, I, J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(H, I, J, K, L)) -> bool

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

fn ge(&self, other: &(H, I, J, K, L)) -> bool

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

fn gt(&self, other: &(H, I, J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<I, J, K, L> PartialOrd<(I, J, K, L)> for (I, J, K, L) where
    I: PartialOrd<I> + PartialEq<I>,
    J: PartialOrd<J> + PartialEq<J>,
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(&self, other: &(I, J, K, L)) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(I, J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(I, J, K, L)) -> bool

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

fn ge(&self, other: &(I, J, K, L)) -> bool

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

fn gt(&self, other: &(I, J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<J, K, L> PartialOrd<(J, K, L)> for (J, K, L) where
    J: PartialOrd<J> + PartialEq<J>,
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(&self, other: &(J, K, L)) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(J, K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(J, K, L)) -> bool

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

fn ge(&self, other: &(J, K, L)) -> bool

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

fn gt(&self, other: &(J, K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<K, L> PartialOrd<(K, L)> for (K, L) where
    K: PartialOrd<K> + PartialEq<K>,
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

fn partial_cmp(&self, other: &(K, L)) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &(K, L)) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &(K, L)) -> bool

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

fn ge(&self, other: &(K, L)) -> bool

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

fn gt(&self, other: &(K, L)) -> bool

This method tests greater than (for self and other) and is used by the > operator.

impl<L> PartialOrd<(L,)> for (L,) where
    L: PartialOrd<L> + PartialEq<L> + ?Sized, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

fn start_bound(&self) -> Bound<&T>

Start index bound.

fn end_bound(&self) -> Bound<&T>

End index bound.

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

Returns true if item is contained in the range.

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

fn start_bound(&self) -> Bound<&T>

Start index bound.

fn end_bound(&self) -> Bound<&T>

End index bound.

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

Returns true if item is contained in the range.

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

type Output = [T]

The output type returned by methods.

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.

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.

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.

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.

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.

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.

impl ToSocketAddrs for (IpAddr, u16)

type Iter = IntoIter<SocketAddr>

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

fn to_socket_addrs(&self) -> Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolved SocketAddrs.

impl ToSocketAddrs for (Ipv4Addr, u16)

type Iter = IntoIter<SocketAddr>

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

fn to_socket_addrs(&self) -> Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolved SocketAddrs.

impl ToSocketAddrs for (Ipv6Addr, u16)

type Iter = IntoIter<SocketAddr>

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

fn to_socket_addrs(&self) -> Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolved SocketAddrs.

impl ToSocketAddrs for (&str, u16)

type Iter = IntoIter<SocketAddr, Global>

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

fn to_socket_addrs(&self) -> Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolved SocketAddrs.

impl ToSocketAddrs for (String, u16)

type Iter = IntoIter<SocketAddr, Global>

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

fn to_socket_addrs(&self) -> Result<IntoIter<SocketAddr>>

Converts this object to an iterator of resolved SocketAddrs.

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

impl<H, I, J, K, L> Eq for (H, I, J, K, L) where
    H: Eq,
    I: Eq,
    J: Eq,
    K: Eq,
    L: Eq + ?Sized, 

impl<J, K, L> Eq for (J, K, L) where
    J: Eq,
    K: Eq,
    L: Eq + ?Sized, 

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

impl<F, G, H, I, J, K, L> Eq for (F, G, H, I, J, K, L) where
    F: Eq,
    G: Eq,
    H: Eq,
    I: Eq,
    J: Eq,
    K: Eq,
    L: Eq + ?Sized, 

impl<D, E, F, G, H, I, J, K, L> Eq for (D, E, F, G, H, I, J, K, L) where
    D: Eq,
    E: Eq,
    F: Eq,
    G: Eq,
    H: Eq,
    I: Eq,
    J: Eq,
    K: Eq,
    L: Eq + ?Sized, 

impl<I, J, K, L> Eq for (I, J, K, L) where
    I: Eq,
    J: Eq,
    K: Eq,
    L: Eq + ?Sized, 

impl<G, H, I, J, K, L> Eq for (G, H, I, J, K, L) where
    G: Eq,
    H: Eq,
    I: Eq,
    J: Eq,
    K: Eq,
    L: Eq + ?Sized, 

impl<L> Eq for (L,) where
    L: Eq + ?Sized, 

impl<E, F, G, H, I, J, K, L> Eq for (E, F, G, H, I, J, K, L) where
    E: Eq,
    F: Eq,
    G: Eq,
    H: Eq,
    I: Eq,
    J: Eq,
    K: Eq,
    L: Eq + ?Sized, 

impl<K, L> Eq for (K, L) where
    K: Eq,
    L: Eq + ?Sized, 

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