Operations on tuples
To access a single element of a tuple one can use the .0`.0`
field access syntax.
Indexing starts from zero, so .0`.0returns first value,` returns first value, .1`.1`
returns second value, and so on. In general, a tuple with N
elements has field accessors from 0 to N - 1.
If every type inside a tuple implements one of the following
traits, then a tuple itself also implements it.
Clone`Clone`
PartialEq`PartialEq`
Eq`Eq`
PartialOrd`PartialOrd`
Ord`Ord`
Default`Default`
Trait Implementations
impl Eq for ()
fn lt(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
fn gt(&self, other: &Rhs) -> bool
fn ge(&self, other: &Rhs) -> bool
Keyboard shortcuts
- ?
- Show this help dialog
- S
- Focus the search field
- ⇤
- Move up in search results
- ⇥
- Move down in search results
- ⏎
- Go to active search result
Search tricks
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct, enum,
trait, typedef (or
tdef).
Search functions by type signature (e.g.
vec -> usize)