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:

fn main() { ("hello", 5, 'c'); }
("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:

fn main() { (&'static str, i32, char) }
(&'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:

fn main() { let tuple = ("hello", 5, 'c'); assert_eq!(tuple.0, "hello"); assert_eq!(tuple.1, 5); assert_eq!(tuple.2, 'c'); }
let tuple = ("hello", 5, 'c');

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

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.

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

Examples

Basic usage:

fn main() { let tuple = ("hello", 5, 'c'); assert_eq!(tuple.0, "hello"); }
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 main() { 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); }
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<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 J: Default, F: Default, E: Default, L: Default, D: Default, A: Default, H: Default, B: Default, I: Default, C: Default, G: Default, K: Default1.0.0

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

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 D: Ord, H: Ord, I: Ord, F: Ord, K: Ord, L: Ord, E: Ord, C: Ord, J: Ord, G: Ord, A: Ord, B: Ord1.0.0

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

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 J: PartialEq<J> + PartialOrd<J>, A: PartialEq<A> + PartialOrd<A>, F: PartialEq<F> + PartialOrd<F>, D: PartialEq<D> + PartialOrd<D>, G: PartialEq<G> + PartialOrd<G>, E: PartialEq<E> + PartialOrd<E>, K: PartialEq<K> + PartialOrd<K>, H: PartialEq<H> + PartialOrd<H>, I: PartialEq<I> + PartialOrd<I>, B: PartialEq<B> + PartialOrd<B>, L: PartialEq<L> + PartialOrd<L>, C: PartialEq<C> + PartialOrd<C>1.0.0

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

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

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

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

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

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 I: Eq, J: Eq, C: Eq, A: Eq, L: Eq, F: Eq, D: Eq, H: Eq, G: Eq, B: Eq, K: Eq, E: Eq1.0.0

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 F: PartialEq<F>, K: PartialEq<K>, E: PartialEq<E>, B: PartialEq<B>, J: PartialEq<J>, G: PartialEq<G>, I: PartialEq<I>, C: PartialEq<C>, H: PartialEq<H>, D: PartialEq<D>, A: PartialEq<A>, L: PartialEq<L>1.0.0

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

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

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

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

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

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

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

impl<A, B, C, D, E, F, G, H, I, J, K> Ord for (A, B, C, D, E, F, G, H, I, J, K) where A: Ord, B: Ord, J: Ord, K: Ord, D: Ord, E: Ord, I: Ord, C: Ord, G: Ord, H: Ord, F: Ord1.0.0

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

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

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

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

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

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

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

impl<A, B, C, D, E, F, G, H, I, J, K> Eq for (A, B, C, D, E, F, G, H, I, J, K) where F: Eq, A: Eq, K: Eq, B: Eq, C: Eq, E: Eq, G: Eq, I: Eq, H: Eq, D: Eq, J: Eq1.0.0

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

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

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

impl<A, B, C, D, E, F, G, H, I, J, K> Clone for (A, B, C, D, E, F, G, H, I, J, K) where E: Clone, B: Clone, A: Clone, F: Clone, G: Clone, C: Clone, I: Clone, K: Clone, D: Clone, H: Clone, J: Clone1.0.0

fn clone(&self) -> (A, B, C, D, E, F, G, H, I, J, K)

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

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

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

impl<A, B, C, D, E, F, G, H, I, J> Ord for (A, B, C, D, E, F, G, H, I, J) where I: Ord, C: Ord, D: Ord, E: Ord, B: Ord, A: Ord, J: Ord, G: Ord, F: Ord, H: Ord1.0.0

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

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

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

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

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

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

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

impl<A, B, C, D, E, F, G, H, I, J> Eq for (A, B, C, D, E, F, G, H, I, J) where F: Eq, E: Eq, C: Eq, B: Eq, G: Eq, I: Eq, H: Eq, J: Eq, D: Eq, A: Eq1.0.0

impl<A, B, C, D, E, F, G, H, I, J> PartialEq<(A, B, C, D, E, F, G, H, I, J)> for (A, B, C, D, E, F, G, H, I, J) where J: PartialEq<J>, H: PartialEq<H>, E: PartialEq<E>, D: PartialEq<D>, A: PartialEq<A>, G: PartialEq<G>, C: PartialEq<C>, B: PartialEq<B>, F: PartialEq<F>, I: PartialEq<I>1.0.0

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

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

impl<A, B, C, D, E, F, G, H, I, J> Clone for (A, B, C, D, E, F, G, H, I, J) where I: Clone, B: Clone, H: Clone, C: Clone, F: Clone, J: Clone, D: Clone, G: Clone, E: Clone, A: Clone1.0.0

fn clone(&self) -> (A, B, C, D, E, F, G, H, I, J)

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

impl<A, B, C, D, E, F, G, H, I> Default for (A, B, C, D, E, F, G, H, I) where B: Default, G: Default, I: Default, D: Default, H: Default, E: Default, C: Default, A: Default, F: Default1.0.0

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

impl<A, B, C, D, E, F, G, H, I> Ord for (A, B, C, D, E, F, G, H, I) where H: Ord, C: Ord, F: Ord, B: Ord, A: Ord, I: Ord, E: Ord, G: Ord, D: Ord1.0.0

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

impl<A, B, C, D, E, F, G, H, I> PartialOrd<(A, B, C, D, E, F, G, H, I)> for (A, B, C, D, E, F, G, H, I) where F: PartialEq<F> + PartialOrd<F>, H: PartialEq<H> + PartialOrd<H>, C: PartialEq<C> + PartialOrd<C>, A: PartialEq<A> + PartialOrd<A>, G: PartialEq<G> + PartialOrd<G>, I: PartialEq<I> + PartialOrd<I>, B: PartialEq<B> + PartialOrd<B>, D: PartialEq<D> + PartialOrd<D>, E: PartialEq<E> + PartialOrd<E>1.0.0

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

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

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

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

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

impl<A, B, C, D, E, F, G, H, I> Eq for (A, B, C, D, E, F, G, H, I) where D: Eq, I: Eq, A: Eq, B: Eq, E: Eq, G: Eq, C: Eq, F: Eq, H: Eq1.0.0

impl<A, B, C, D, E, F, G, H, I> PartialEq<(A, B, C, D, E, F, G, H, I)> for (A, B, C, D, E, F, G, H, I) where C: PartialEq<C>, H: PartialEq<H>, I: PartialEq<I>, D: PartialEq<D>, B: PartialEq<B>, E: PartialEq<E>, G: PartialEq<G>, F: PartialEq<F>, A: PartialEq<A>1.0.0

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

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

impl<A, B, C, D, E, F, G, H, I> Clone for (A, B, C, D, E, F, G, H, I) where I: Clone, F: Clone, A: Clone, H: Clone, E: Clone, G: Clone, B: Clone, C: Clone, D: Clone1.0.0

fn clone(&self) -> (A, B, C, D, E, F, G, H, I)

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

impl<A, B, C, D, E, F, G, H> Default for (A, B, C, D, E, F, G, H) where C: Default, D: Default, F: Default, H: Default, G: Default, A: Default, E: Default, B: Default1.0.0

fn default() -> (A, B, C, D, E, F, G, H)

impl<A, B, C, D, E, F, G, H> Ord for (A, B, C, D, E, F, G, H) where C: Ord, G: Ord, D: Ord, A: Ord, E: Ord, H: Ord, F: Ord, B: Ord1.0.0

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

impl<A, B, C, D, E, F, G, H> PartialOrd<(A, B, C, D, E, F, G, H)> for (A, B, C, D, E, F, G, H) where A: PartialEq<A> + PartialOrd<A>, F: PartialEq<F> + PartialOrd<F>, H: PartialEq<H> + PartialOrd<H>, G: PartialEq<G> + PartialOrd<G>, E: PartialEq<E> + PartialOrd<E>, C: PartialEq<C> + PartialOrd<C>, B: PartialEq<B> + PartialOrd<B>, D: PartialEq<D> + PartialOrd<D>1.0.0

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

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

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

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

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

impl<A, B, C, D, E, F, G, H> Eq for (A, B, C, D, E, F, G, H) where A: Eq, E: Eq, H: Eq, D: Eq, G: Eq, F: Eq, B: Eq, C: Eq1.0.0

impl<A, B, C, D, E, F, G, H> PartialEq<(A, B, C, D, E, F, G, H)> for (A, B, C, D, E, F, G, H) where G: PartialEq<G>, A: PartialEq<A>, E: PartialEq<E>, B: PartialEq<B>, H: PartialEq<H>, F: PartialEq<F>, D: PartialEq<D>, C: PartialEq<C>1.0.0

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

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

impl<A, B, C, D, E, F, G, H> Clone for (A, B, C, D, E, F, G, H) where H: Clone, G: Clone, D: Clone, B: Clone, C: Clone, E: Clone, A: Clone, F: Clone1.0.0

fn clone(&self) -> (A, B, C, D, E, F, G, H)

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

impl<A, B, C, D, E, F, G> Default for (A, B, C, D, E, F, G) where A: Default, C: Default, E: Default, F: Default, B: Default, D: Default, G: Default1.0.0

fn default() -> (A, B, C, D, E, F, G)

impl<A, B, C, D, E, F, G> Ord for (A, B, C, D, E, F, G) where B: Ord, C: Ord, D: Ord, E: Ord, G: Ord, A: Ord, F: Ord1.0.0

fn cmp(&self, other: &(A, B, C, D, E, F, G)) -> Ordering

impl<A, B, C, D, E, F, G> PartialOrd<(A, B, C, D, E, F, G)> for (A, B, C, D, E, F, G) where C: PartialEq<C> + PartialOrd<C>, E: PartialEq<E> + PartialOrd<E>, G: PartialEq<G> + PartialOrd<G>, F: PartialEq<F> + PartialOrd<F>, B: PartialEq<B> + PartialOrd<B>, D: PartialEq<D> + PartialOrd<D>, A: PartialEq<A> + PartialOrd<A>1.0.0

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

fn lt(&self, other: &(A, B, C, D, E, F, G)) -> bool

fn le(&self, other: &(A, B, C, D, E, F, G)) -> bool

fn ge(&self, other: &(A, B, C, D, E, F, G)) -> bool

fn gt(&self, other: &(A, B, C, D, E, F, G)) -> bool

impl<A, B, C, D, E, F, G> Eq for (A, B, C, D, E, F, G) where B: Eq, A: Eq, E: Eq, D: Eq, G: Eq, F: Eq, C: Eq1.0.0

impl<A, B, C, D, E, F, G> PartialEq<(A, B, C, D, E, F, G)> for (A, B, C, D, E, F, G) where D: PartialEq<D>, G: PartialEq<G>, E: PartialEq<E>, C: PartialEq<C>, F: PartialEq<F>, A: PartialEq<A>, B: PartialEq<B>1.0.0

fn eq(&self, other: &(A, B, C, D, E, F, G)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F, G)) -> bool

impl<A, B, C, D, E, F, G> Clone for (A, B, C, D, E, F, G) where F: Clone, D: Clone, C: Clone, G: Clone, E: Clone, A: Clone, B: Clone1.0.0

fn clone(&self) -> (A, B, C, D, E, F, G)

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

impl<A, B, C, D, E, F> Default for (A, B, C, D, E, F) where A: Default, C: Default, E: Default, D: Default, F: Default, B: Default1.0.0

fn default() -> (A, B, C, D, E, F)

impl<A, B, C, D, E, F> Ord for (A, B, C, D, E, F) where F: Ord, E: Ord, C: Ord, D: Ord, A: Ord, B: Ord1.0.0

fn cmp(&self, other: &(A, B, C, D, E, F)) -> Ordering

impl<A, B, C, D, E, F> PartialOrd<(A, B, C, D, E, F)> for (A, B, C, D, E, F) where D: PartialEq<D> + PartialOrd<D>, A: PartialEq<A> + PartialOrd<A>, F: PartialEq<F> + PartialOrd<F>, C: PartialEq<C> + PartialOrd<C>, B: PartialEq<B> + PartialOrd<B>, E: PartialEq<E> + PartialOrd<E>1.0.0

fn partial_cmp(&self, other: &(A, B, C, D, E, F)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C, D, E, F)) -> bool

fn le(&self, other: &(A, B, C, D, E, F)) -> bool

fn ge(&self, other: &(A, B, C, D, E, F)) -> bool

fn gt(&self, other: &(A, B, C, D, E, F)) -> bool

impl<A, B, C, D, E, F> Eq for (A, B, C, D, E, F) where C: Eq, A: Eq, F: Eq, D: Eq, E: Eq, B: Eq1.0.0

impl<A, B, C, D, E, F> PartialEq<(A, B, C, D, E, F)> for (A, B, C, D, E, F) where D: PartialEq<D>, C: PartialEq<C>, B: PartialEq<B>, E: PartialEq<E>, A: PartialEq<A>, F: PartialEq<F>1.0.0

fn eq(&self, other: &(A, B, C, D, E, F)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F)) -> bool

impl<A, B, C, D, E, F> Clone for (A, B, C, D, E, F) where B: Clone, F: Clone, A: Clone, D: Clone, E: Clone, C: Clone1.0.0

fn clone(&self) -> (A, B, C, D, E, F)

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

impl<A, B, C, D, E> Default for (A, B, C, D, E) where C: Default, B: Default, A: Default, D: Default, E: Default1.0.0

fn default() -> (A, B, C, D, E)

impl<A, B, C, D, E> Ord for (A, B, C, D, E) where B: Ord, A: Ord, D: Ord, E: Ord, C: Ord1.0.0

fn cmp(&self, other: &(A, B, C, D, E)) -> Ordering

impl<A, B, C, D, E> PartialOrd<(A, B, C, D, E)> for (A, B, C, D, E) where A: PartialEq<A> + PartialOrd<A>, C: PartialEq<C> + PartialOrd<C>, B: PartialEq<B> + PartialOrd<B>, E: PartialEq<E> + PartialOrd<E>, D: PartialEq<D> + PartialOrd<D>1.0.0

fn partial_cmp(&self, other: &(A, B, C, D, E)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C, D, E)) -> bool

fn le(&self, other: &(A, B, C, D, E)) -> bool

fn ge(&self, other: &(A, B, C, D, E)) -> bool

fn gt(&self, other: &(A, B, C, D, E)) -> bool

impl<A, B, C, D, E> Eq for (A, B, C, D, E) where C: Eq, B: Eq, E: Eq, D: Eq, A: Eq1.0.0

impl<A, B, C, D, E> PartialEq<(A, B, C, D, E)> for (A, B, C, D, E) where E: PartialEq<E>, C: PartialEq<C>, A: PartialEq<A>, B: PartialEq<B>, D: PartialEq<D>1.0.0

fn eq(&self, other: &(A, B, C, D, E)) -> bool

fn ne(&self, other: &(A, B, C, D, E)) -> bool

impl<A, B, C, D, E> Clone for (A, B, C, D, E) where A: Clone, B: Clone, D: Clone, C: Clone, E: Clone1.0.0

fn clone(&self) -> (A, B, C, D, E)

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

impl<A, B, C, D> Default for (A, B, C, D) where C: Default, D: Default, B: Default, A: Default1.0.0

fn default() -> (A, B, C, D)

impl<A, B, C, D> Ord for (A, B, C, D) where B: Ord, A: Ord, D: Ord, C: Ord1.0.0

fn cmp(&self, other: &(A, B, C, D)) -> Ordering

impl<A, B, C, D> PartialOrd<(A, B, C, D)> for (A, B, C, D) where A: PartialEq<A> + PartialOrd<A>, B: PartialEq<B> + PartialOrd<B>, D: PartialEq<D> + PartialOrd<D>, C: PartialEq<C> + PartialOrd<C>1.0.0

fn partial_cmp(&self, other: &(A, B, C, D)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C, D)) -> bool

fn le(&self, other: &(A, B, C, D)) -> bool

fn ge(&self, other: &(A, B, C, D)) -> bool

fn gt(&self, other: &(A, B, C, D)) -> bool

impl<A, B, C, D> Eq for (A, B, C, D) where B: Eq, D: Eq, C: Eq, A: Eq1.0.0

impl<A, B, C, D> PartialEq<(A, B, C, D)> for (A, B, C, D) where B: PartialEq<B>, C: PartialEq<C>, D: PartialEq<D>, A: PartialEq<A>1.0.0

fn eq(&self, other: &(A, B, C, D)) -> bool

fn ne(&self, other: &(A, B, C, D)) -> bool

impl<A, B, C, D> Clone for (A, B, C, D) where B: Clone, C: Clone, A: Clone, D: Clone1.0.0

fn clone(&self) -> (A, B, C, D)

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

impl<A, B, C> Default for (A, B, C) where C: Default, A: Default, B: Default1.0.0

fn default() -> (A, B, C)

impl<A, B, C> Ord for (A, B, C) where B: Ord, C: Ord, A: Ord1.0.0

fn cmp(&self, other: &(A, B, C)) -> Ordering

impl<A, B, C> PartialOrd<(A, B, C)> for (A, B, C) where A: PartialEq<A> + PartialOrd<A>, C: PartialEq<C> + PartialOrd<C>, B: PartialEq<B> + PartialOrd<B>1.0.0

fn partial_cmp(&self, other: &(A, B, C)) -> Option<Ordering>

fn lt(&self, other: &(A, B, C)) -> bool

fn le(&self, other: &(A, B, C)) -> bool

fn ge(&self, other: &(A, B, C)) -> bool

fn gt(&self, other: &(A, B, C)) -> bool

impl<A, B, C> Eq for (A, B, C) where C: Eq, A: Eq, B: Eq1.0.0

impl<A, B, C> PartialEq<(A, B, C)> for (A, B, C) where A: PartialEq<A>, B: PartialEq<B>, C: PartialEq<C>1.0.0

fn eq(&self, other: &(A, B, C)) -> bool

fn ne(&self, other: &(A, B, C)) -> bool

impl<A, B, C> Clone for (A, B, C) where C: Clone, A: Clone, B: Clone1.0.0

fn clone(&self) -> (A, B, C)

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

impl<A, B> Default for (A, B) where A: Default, B: Default1.0.0

fn default() -> (A, B)

impl<A, B> Ord for (A, B) where A: Ord, B: Ord1.0.0

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

impl<A, B> PartialOrd<(A, B)> for (A, B) where B: PartialEq<B> + PartialOrd<B>, A: PartialEq<A> + PartialOrd<A>1.0.0

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

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

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

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

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

impl<A, B> Eq for (A, B) where A: Eq, B: Eq1.0.0

impl<A, B> PartialEq<(A, B)> for (A, B) where A: PartialEq<A>, B: PartialEq<B>1.0.0

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

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

impl<A, B> Clone for (A, B) where A: Clone, B: Clone1.0.0

fn clone(&self) -> (A, B)

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

impl<A> Default for (A,) where A: Default1.0.0

fn default() -> (A,)

impl<A> Ord for (A,) where A: Ord1.0.0

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

impl<A> PartialOrd<(A,)> for (A,) where A: PartialEq<A> + PartialOrd<A>1.0.0

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

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

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

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

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

impl<A> Eq for (A,) where A: Eq1.0.0

impl<A> PartialEq<(A,)> for (A,) where A: PartialEq<A>1.0.0

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

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

impl<A> Clone for (A,) where A: Clone1.0.0

fn clone(&self) -> (A,)

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

impl Debug for ()1.0.0

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

impl<T11> Debug for (T11,) where T11: Debug1.0.0

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

impl<T10, T11> Debug for (T10, T11) where T11: Debug, T10: Debug1.0.0

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

impl<T9, T10, T11> Debug for (T9, T10, T11) where T9: Debug, T10: Debug, T11: Debug1.0.0

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

impl<T8, T9, T10, T11> Debug for (T8, T9, T10, T11) where T11: Debug, T10: Debug, T9: Debug, T8: Debug1.0.0

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

impl<T7, T8, T9, T10, T11> Debug for (T7, T8, T9, T10, T11) where T8: Debug, T11: Debug, T9: Debug, T10: Debug, T7: Debug1.0.0

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

impl<T6, T7, T8, T9, T10, T11> Debug for (T6, T7, T8, T9, T10, T11) where T8: Debug, T9: Debug, T10: Debug, T6: Debug, T11: Debug, T7: Debug1.0.0

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

impl<T5, T6, T7, T8, T9, T10, T11> Debug for (T5, T6, T7, T8, T9, T10, T11) where T5: Debug, T9: Debug, T6: Debug, T11: Debug, T10: Debug, T7: Debug, T8: Debug1.0.0

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

impl<T4, T5, T6, T7, T8, T9, T10, T11> Debug for (T4, T5, T6, T7, T8, T9, T10, T11) where T7: Debug, T4: Debug, T6: Debug, T5: Debug, T10: Debug, T9: Debug, T8: Debug, T11: Debug1.0.0

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

impl<T3, T4, T5, T6, T7, T8, T9, T10, T11> Debug for (T3, T4, T5, T6, T7, T8, T9, T10, T11) where T8: Debug, T4: Debug, T7: Debug, T11: Debug, T5: Debug, T3: Debug, T10: Debug, T9: Debug, T6: Debug1.0.0

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

impl<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Debug for (T2, T3, T4, T5, T6, T7, T8, T9, T10, T11) where T11: Debug, T6: Debug, T7: Debug, T4: Debug, T10: Debug, T8: Debug, T9: Debug, T5: Debug, T3: Debug, T2: Debug1.0.0

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

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 T8: Debug, T9: Debug, T10: Debug, T2: Debug, T11: Debug, T4: Debug, T7: Debug, T6: Debug, T5: Debug, T3: Debug, T1: Debug1.0.0

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

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 T11: Debug, T5: Debug, T9: Debug, T4: Debug, T0: Debug, T8: Debug, T10: Debug, T3: Debug, T2: Debug, T7: Debug, T6: Debug, T1: Debug1.0.0

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

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 E: Hash, F: Hash, J: Hash, A: Hash, G: Hash, D: Hash, H: Hash, C: Hash, K: Hash, B: Hash, L: Hash, I: Hash1.0.0

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

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

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 G: Hash, H: Hash, K: Hash, E: Hash, D: Hash, B: Hash, I: Hash, A: Hash, F: Hash, C: Hash, J: Hash1.0.0

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

1.3.0fn hash_slice<H>(data: &[Self], state: &mut H) where H: 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 G: Hash, F: Hash, A: Hash, D: Hash, H: Hash, E: Hash, C: Hash, B: Hash, I: Hash, J: Hash1.0.0

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

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

impl<A, B, C, D, E, F, G, H, I> Hash for (A, B, C, D, E, F, G, H, I) where C: Hash, A: Hash, E: Hash, B: Hash, H: Hash, F: Hash, D: Hash, G: Hash, I: Hash1.0.0

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

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

impl<A, B, C, D, E, F, G, H> Hash for (A, B, C, D, E, F, G, H) where E: Hash, A: Hash, C: Hash, F: Hash, D: Hash, B: Hash, G: Hash, H: Hash1.0.0

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

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

impl<A, B, C, D, E, F, G> Hash for (A, B, C, D, E, F, G) where B: Hash, A: Hash, C: Hash, F: Hash, D: Hash, E: Hash, G: Hash1.0.0

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

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

impl<A, B, C, D, E, F> Hash for (A, B, C, D, E, F) where C: Hash, B: Hash, D: Hash, F: Hash, A: Hash, E: Hash1.0.0

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

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

impl<A, B, C, D, E> Hash for (A, B, C, D, E) where D: Hash, B: Hash, A: Hash, E: Hash, C: Hash1.0.0

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

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

impl<A, B, C, D> Hash for (A, B, C, D) where C: Hash, A: Hash, B: Hash, D: Hash1.0.0

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

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

impl<A, B, C> Hash for (A, B, C) where A: Hash, C: Hash, B: Hash1.0.0

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

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

impl<A, B> Hash for (A, B) where B: Hash, A: Hash1.0.0

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

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

impl<A> Hash for (A,) where A: Hash1.0.0

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

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

impl Hash for ()1.0.0

fn hash<H>(&self, _state: &mut H) where H: Hasher

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

impl Default for ()1.0.0

fn default()

impl Clone for ()1.0.0

fn clone(&self)

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

impl Ord for ()1.0.0

fn cmp(&self, _other: &()) -> Ordering

impl PartialOrd<()> for ()1.0.0

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

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

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

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

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

impl Eq for ()1.0.0

impl PartialEq<()> for ()1.0.0

fn eq(&self, _other: &()) -> bool

fn ne(&self, _other: &()) -> bool

impl ToSocketAddrs for (IpAddr, u16)1.0.0

type Iter = IntoIter<SocketAddr>

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

impl ToSocketAddrs for (Ipv4Addr, u16)1.0.0

type Iter = IntoIter<SocketAddr>

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

impl ToSocketAddrs for (Ipv6Addr, u16)1.0.0

type Iter = IntoIter<SocketAddr>

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

impl<'a> ToSocketAddrs for (&'a str, u16)1.0.0

type Iter = IntoIter<SocketAddr>

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