Rust Language Cheat Sheet #7826

guevara · 2021-04-27T06:39:42Z

Rust Language Cheat Sheet

https://cheats.rs/

Rust Language Cheat Sheet 25.04.2021

Contains clickable links to The Book ^BK, Rust by Example ^EX, Std Docs ^STD, Nomicon ^NOM, Reference ^REF.

Clickable symbols

^BK The Book
^EX Rust by Example
^STD Std Docs
^NOM Nomicon
^REF Reference
^RFC Official RFC documents
^🔗 The internet
^↑ On this page, above
^↓ On this page, below

Other symbols

^🗑️ Largely deprecated
^'18 Has minimum edition requirement
^🚧 Requires Rust nightly (or is incomplete)
^🛑 Intentionally wrong example or pitfall
^🝖 Slightly esoteric, rarely used or advanced
^🔥 Something with outstanding utility
^? Is missing good link or explanation
^💬Opinionated

Fira Code Ligatures (..=, =>) Expand all the things? Night Mode 💡

Language Constructs

Behind the Scenes

Data Layout

Standard Library

Tooling

Coding Guides

Misc

Hello, Rust!^url

If you are new to Rust, or if you want to try the things below:

Hello World

fn main() {
    println!("Hello, world!");
}

Strengths

Things Rust does measurably really well

Weaknesses

Points you might run into

Steep learning curve;¹ compiler enforcing (esp. memory) rules that would be "best practices" elsewhere.
Missing Rust-native libs in some domains, target platforms (esp. embedded), IDE features.¹
Longer compile times than "similar" code in other languages.¹
No formal language specification, can prevent legal use in some domains (aviation, medical, …).
Careless (use of unsafe in) libraries can secretly break safety guarantees.

¹ Compare Rust Survey.

Installation

Download

Get installer from rustup.rs (highly recommended for any platform)

IDEs

First Steps

Modular Beginner Resources

In addition, have a look at the ususal suspects. ^BK ^EX ^STD

Opinion ^💬 — If you have never seen or used any Rust it might be good to visit one of the links above before continuing; the next chapter might feel a bit terse otherwise.

Data Structures^url

Data types and memory locations defined via keywords.

Example	Explanation
`struct S {}`	Define a struct ^BK ^EX ^STD ^REF with named fields.
`struct S { x: T }`	Define struct with named field `x` of type `T`.
`struct S` `(T);`	Define "tupled" struct with numbered field `.0` of type `T`.
`struct S;`	Define zero sized ^NOM unit struct. Occupies no space, optimized away.
`enum E {}`	Define an enum ^BK ^EX ^REF , c. algebraic data types, tagged unions.
`enum E { A, B``(), C {} }`	Define variants of enum; can be unit- `A`, tuple- `B` `()` and struct-like `C{}`.
`enum E { A = 1 }`	If variants are only unit-like, allow discriminant values, e.g., for FFI.
`union U {}`	Unsafe C-like union ^REF for FFI compatibility. ^🝖
`static X: T = T();`	Global variable ^BK ^EX ^REF with `'static` lifetime, single memory location.
`const X: T = T();`	Defines constant ^BK ^EX ^REF. Copied into a temporary when used.
`let x: T;`	Allocate `T` bytes on stack¹ bound as `x`. Assignable once, not mutable.
`let mut x: T;`	Like `let`, but allow for mutability ^BK ^EX and mutable borrow.²
`x = y;`	Moves `y` to `x`, invalidating `y` if `T` is not `Copy`, ^STD and copying `y` otherwise.

¹Bound variables ^BK ^EX ^REF live on stack for synchronous code. In async {} code they become part async's state machine, may reside on heap.
² Technically mutable and immutable are misnomer. Immutable binding or shared reference may still contain Cell ^STD, giving interior mutability.

Creating and accessing data structures; and some more sigilic types.

Example	Explanation
`S { x: y }`	Create `struct S {}` or `use`'ed `enum E::S {}` with field `x` set to `y`.
`S { x }`	Same, but use local variable `x` for field `x`.
`S { ..s }`	Fill remaining fields from `s`, esp. useful with Default.
`S { 0: x }`	Like `S` `(x)` below, but set field `.0` with struct syntax.
`S` `(x)`	Create `struct S` `(T)` or `use`'ed `enum E::S` `()` with field `.0` set to `x`.
`S`	If `S` is unit `struct S;` or `use`'ed `enum E::S` create value of `S`.
`E::C { x: y }`	Create enum variant `C`. Other methods above also work.
`()`	Empty tuple, both literal and type, aka unit. ^STD
`(x)`	Parenthesized expression.
`(x,)`	Single-element tuple expression. ^EX ^STD ^REF
`(S,)`	Single-element tuple type.
`[S]`	Array type of unspecified length, i.e., slice. ^EX ^STD ^REF Can't live on stack. ^*
`[S; n]`	Array type ^EX ^STD of fixed length `n` holding elements of type `S`.
`[x; n]`	Array instance with `n` copies of `x`. ^REF
`[x, y]`	Array instance with given elements `x` and `y`.
`x[0]`	Collection indexing, here w. `usize`. Implementable with Index, IndexMut.
`x[..]`	Same, via range (here full range), also `x[a..b]`, `x[a..=b]`, ... c. below.
`a..b`	Right-exclusive range ^STD ^REF creation, e.g., `1..3` means `1, 2`.
`..b`	Right-exclusive range to ^STD without starting point.
`a..=b`	Inclusive range, ^STD `1..=3` means `1, 2, 3`.
`..=b`	Inclusive range from ^STD without starting point.
`..`	Full range, ^STD usually means the whole collection.
`s.x`	Named field access, ^REF might try to Deref if `x` not part of type `S`.
`s.0`	Numbered field access, used for tuple types `S` `(T)`.

^* For now,^RFC pending completion of tracking issue.

References & Pointers^url

Granting access to un-owned memory. Also see section on Generics & Constraints.

Example	Explanation
`&S`	Shared reference ^BK ^STD ^NOM ^REF (space for holding any `&s`).
`&[S]`	Special slice reference that contains (`address`, `length`).
`&str`	Special string slice reference that contains (`address`, `length`).
`&mut S`	Exclusive reference to allow mutability (also `&mut [S]`, `&mut dyn S`, …)
`&dyn T`	Special trait object ^BK reference that contains (`address`, `vtable`).
`&s`	Shared borrow ^BK ^EX ^STD (e.g., address, len, vtable, … of this `s`, like `0x1234`).
`&mut s`	Exclusive borrow that allows mutability. ^EX
`*const S`	Immutable raw pointer type ^BK ^STD ^REF w/o memory safety.
`*mut S`	Mutable raw pointer type w/o memory safety.
`&raw const s`	Create raw pointer w/o going through reference; c. `ptr:addr_of!()` ^STD ^🚧^🝖
`&raw mut s`	Same, but mutable. ^🚧 Raw ptrs. are needed for unaligned, packed fields. ^🝖
`ref s`	Bind by reference. ^EX ^🗑️
`let ref r = s;`	Equivalent to `let r = &s`.
`let S { ref mut x } = s;`	Mutable ref binding (`let x = &mut s.x`), shorthand destructuring ^↓ version.
`*r`	Dereference ^BK ^STD ^NOM a reference `r` to access what it points to.
`*r = s;`	If `r` is a mutable reference, move or copy `s` to target memory.
`s = *r;`	Make `s` a copy of whatever `r` references, if that is `Copy`.
`s = *r;`	Won't work ^🛑 if `*r` is not `Copy`, as that would move and leave empty place.
`s = *my_box;`	Special case^🔗 for `Box` that can also move out Box'ed content if it isn't `Copy`.
`'a`	A lifetime parameter, ^BK ^EX ^NOM ^REF duration of a flow in static analysis.
`&'a S`	Only accepts an address holding an `s`; addr. existing `'a` or longer.
`&'a mut S`	Same, but allow content of address to be changed.
`struct S<'a> {}`	Signals `S` will contain address with lifetime `'a`. Creator of `S` decides `'a`.
`trait T<'a> {}`	Signals a `S` which `impl T for S` might contain address.
`fn f<'a>(t: &'a T)`	Same, for function. Caller decides `'a`.
`'static`	Special lifetime lasting the entire program execution.

Functions & Behavior^url

Define units of code and their abstractions.

Example	Explanation
`trait T {}`	Define a trait; ^BK ^EX ^REF common behavior others can implement.
`trait T : R {}`	`T` is subtrait of supertrait ^REF `R`. Any `S` must `impl R` before it can `impl T`.
`impl S {}`	Implementation ^REF of functionality for a type `S`, e.g., methods.
`impl T for S {}`	Implement trait `T` for type `S`.
`impl !T for S {}`	Disable an automatically derived auto trait. ^NOM ^REF
`fn f() {}`	Definition of a function; ^BK ^EX ^REF or associated function if inside `impl`.
`fn f() -> S {}`	Same, returning a value of type S.
`fn f(&self) {}`	Define a method, ^BK ^EX e.g., within an `impl S {}`.
`const fn f() {}`	Constant `fn` usable at compile time, e.g., `const X: u32 = f(Y)`. ^'18
`async fn f() {}`	Async ^REF ^'18 function transformation, makes `f` return an `impl` `Future`. ^STD
`async fn f() -> S {}`	Same, but make `f` return an `impl Future<Output=S>`.
`async { x }`	Used within a function, make `{ x }` an `impl Future<Output=X>`.
`fn() -> S`	Function pointers, ^BK ^STD ^REF memory holding address of a callable.
`Fn() -> S`	Callable Trait ^BK ^STD (also `FnMut`, `FnOnce`), implemented by closures, fn's …
`\|\| {}`	A closure ^BK ^EX ^REF that borrows its captures. ^REF
`\|x\| {}`	Closure with a bound parameter `x`.
`\|x\| x + x`	Closure without block expression; may only consist of single expression.
`move \|x\| x + y`	Closure taking ownership of its captures.
`return \|\| true`	Closures sometimes look like logical ORs (here: return a closure).
`unsafe`	If you enjoy debugging segfaults Friday night; unsafe code. ^↓ ^BK ^EX ^NOM ^REF
`unsafe f() {}`	Sort-of means "can cause UB, ^↓ YOU must check* requirements*".
`unsafe {}`	Guarantees to compiler "I have checked requirements, trust me".

Control Flow^url

Control execution within a function.

Example	Explanation
`while x {}`	Loop ^REF, run while expression `x` is true.
`loop {}`	Loop infinitely ^REF until `break`. Can yield value with `break x`.
`for x in iter {}`	Syntactic sugar to loop over iterators. ^BK ^STD ^REF
`if x {} else {}`	Conditional branch ^REF if expression is true.
`'label: loop {}`	Loop label, ^EX ^REF useful for flow control in nested loops.
`break`	Break expression ^REF to exit a loop.
`break x`	Same, but make `x` value of the loop expression (only in actual `loop`).
`break 'label`	Exit not only this loop, but the enclosing one marked with `'label`.
`break 'label x`	Same, but make `x` the value of the enclosing loop marked with `'label`.
`continue`	Continue expression ^REF to the next loop iteration of this loop.
`continue 'label`	Same but instead of this loop, enclosing loop marked with 'label.
`x?`	If `x` is Err or None, return and propagate. ^BK ^EX ^STD ^REF
`x.await`	Only works inside `async`. Yield flow until `Future` ^STD or Stream `x` ready. ^REF ^'18
`return x`	Early return from function. More idiomatic way is to end with expression.
`f()`	Invoke callable `f` (e.g., a function, closure, function pointer, `Fn`, …).
`x.f()`	Call member function, requires `f` takes `self`, `&self`, … as first argument.
`X::f(x)`	Same as `x.f()`. Unless `impl Copy for X {}`, `f` can only be called once.
`X::f(&x)`	Same as `x.f()`.
`X::f(&mut x)`	Same as `x.f()`.
`S::f(&x)`	Same as `x.f()` if `X` derefs to `S`, i.e., `x.f()` finds methods of `S`.
`T::f(&x)`	Same as `x.f()` if `X impl T`, i.e., `x.f()` finds methods of `T` if in scope.
`X::f()`	Call associated function, e.g., `X::new()`.
`<X as T>::f()`	Call trait method `T::f()` implemented for `X`.

Organizing Code^url

Segment projects into smaller units and minimize dependencies.

Example	Explanation
`mod m {}`	Define a module, ^BK ^EX ^REF get definition from inside `{}`. ^↓
`mod m;`	Define a module, get definition from `m.rs` or `m/mod.rs`. ^↓
`a::b`	Namespace path ^EX ^REF to element `b` within `a` (`mod`, `enum`, …).
`::b`	Search `b` relative to crate root. ^🗑️
`crate::b`	Search `b` relative to crate root. ^'18
`self::b`	Search `b` relative to current module.
`super::b`	Search `b` relative to parent module.
`use a::b;`	Use ^EX ^REF `b` directly in this scope without requiring `a` anymore.
`use a::{b, c};`	Same, but bring `b` and `c` into scope.
`use a::b as x;`	Bring `b` into scope but name `x`, like `use std::error::Error as E`.
`use a::b as _;`	Bring `b` anonymously into scope, useful for traits with conflicting names.
`use a::*;`	Bring everything from `a` into scope.
`pub use a::b;`	Bring `a::b` into scope and reexport from here.
`pub T`	"Public if parent path is public" visibility ^BK for `T`.
`pub(crate) T`	Visible at most in current crate.
`pub(self) T`	Visible at most in current module.
`pub(super) T`	Visible at most in parent.
`pub(in a::b) T`	Visible at most in `a::b`.
`extern crate a;`	Declare dependency on external crate ^BK ^REF ^🗑️ ; just `use a::b` in ^'18.
`extern "C" {}`	Declare external dependencies and ABI (e.g., `"C"`) from FFI. ^BK ^EX ^NOM ^REF
`extern "C" fn f() {}`	Define function to be exported with ABI (e.g., `"C"`) to FFI.

Type Aliases and Casts^url

Short-hand names of types, and methods to convert one type to another.

Example	Explanation
`type T = S;`	Create a type alias ^BK ^REF, i.e., another name for `S`.
`Self`	Type alias for implementing type ^REF, e.g. `fn new() -> Self`.
`self`	Method subject in `fn f(self) {}`, same as `fn f(self: Self) {}`.
`&self`	Same, but refers to self as borrowed, same as `f(self: &Self)`
`&mut self`	Same, but mutably borrowed, same as `f(self: &mut Self)`
`self: Box<Self>`	Arbitrary self type, add methods to smart pointers (`my_box.f_of_self()`).
`S as T`	Disambiguate ^BK ^REF type `S` as trait `T`, e.g., `<S as T>::f()`.
`S as R`	In `use` of symbol, import `S` as `R`, e.g., `use a::S as R`.
`x as u32`	Primitive cast ^EX ^REF, may truncate and be a bit surprising. ^NOM

Macros & Attributes^url

Code generation constructs expanded before the actual compilation happens.

Example	Explanation
`m!()`	Macro ^BK ^STD ^REF invocation, also `m!{}`, `m![]` (depending on macro).
`#[attr]`	Outer attribute. ^EX ^REF, annotating the following item.
`#![attr]`	Inner attribute, annotating the upper, surrounding item.

Pattern Matching^url

Constructs found in match or let expressions, or function parameters.

Example	Explanation
`match m {}`	Initiate pattern matching ^BK ^EX ^REF, then use match arms, c. next table.
`let S(x) = get();`	Notably, `let` also destructures ^EX similar to the table below.
`let S { x } = s;`	Only `x` will be bound to value `s.x`.
`let (_, b, _) = abc;`	Only `b` will be bound to value `abc.1`.
`let (a, ..) = abc;`	Ignoring 'the rest' also works.
`let (.., a, b) = (1, 2);`	Specific bindings take precedence over 'the rest', here `a` is `1`, `b` is `2`.
`let Some(x) = get();`	Won't work ^🛑 if pattern can be refuted ^REF, use `if let` instead.
`if let Some(x) = get() {}`	Branch if pattern can be assigned (e.g., `enum` variant), syntactic sugar. ^*
`while let Some(x) = get() {}`	Equiv.; here keep calling `get()`, run `{}` as long as pattern can be assigned.
`fn f(S { x }: S)`	Function parameters also work like `let`, here `x` bound to `s.x` of `f(s)`. ^🝖

^* Desugars to match get() { Some(x) => {}, _ => () }.

Pattern matching arms in match expressions. Left side of these arms can also be found in let expressions.

Generics & Constraints^url

Generics combine with type constructors, traits and functions to give your users more flexibility.

Example	Explanation
`S<T>`	A generic ^BK ^EX type with a type parameter (`T` is placeholder name here).
`S<T: R>`	Type short hand trait bound ^BK ^EX specification (`R` must be actual trait).
`T: R, P: S`	Independent trait bounds (here one for `T` and one for `P`).
`T: R, S`	Compile error, ^🛑 you probably want compound bound `R + S` below.
`T: R + S`	Compound trait bound ^BK ^EX, `T` must fulfill `R` and `S`.
`T: R + 'a`	Same, but w. lifetime. `T` must fulfill `R`, if `T` has lifetimes, must outlive `'a`.
`T: ?Sized`	Opt out of a pre-defined trait bound, here `Sized`. ^?
`T: 'a`	Type lifetime bound ^EX; if T has references, they must outlive `'a`.
`T: 'static`	Same; does esp. not mean value `t` will ^🛑 live `'static`, only that it could.
`'b: 'a`	Lifetime `'b` must live at least as long as (i.e., outlive) `'a` bound.
`S<const N: usize>`	Generic const bound; ^? user of type `S` can provide constant value `N`. ^🚧
`S<10>`	Where used, const bounds can be provided as primitive values.
`S<{5+5}>`	Expressions must be put in curly brackets.
`S<T> where T: R`	Almost same as `S<T: R>` but more pleasant to read for longer bounds.
`S<T> where u8: R<T>`	Also allows you to make conditional statements involving other types.
`S<T = R>`	Default type parameter ^BK for associated type.
`S<'_>`	Inferred anonymous lifetime; asks compiler to 'figure it out' if obvious.
`S<_>`	Inferred anonymous type, e.g., as `let x: Vec<_> = iter.collect()`
`S::<T>`	Turbofish ^STD call site type disambiguation, e.g. `f::<u32>()`.
`trait T<X> {}`	A trait generic over `X`. Can have multiple `impl T for S` (one per `X`).
`trait T { type X; }`	Defines associated type ^BK ^REF `X`. Only one `impl T for S` possible.
`type X = R;`	Set associated type within `impl T for S { type X = R; }`.
`impl<T> S<T> {}`	Implement functionality for any `T` in `S<T>`, here `T` type parameter.
`impl S<T> {}`	Implement functionality for exactly `S<T>`, here `T` specific type (e.g., `S<u32>`).
`fn f() -> impl T`	Existential types, ^BK returns an unknown-to-caller `S` that `impl T`.
`fn f(x: &impl T)`	Trait bound,"impl traits", ^BK somewhat similar to `fn f<S:T>(x: &S)`.
`fn f(x: &dyn T)`	Marker for dynamic dispatch, ^BK ^REF `f` will not be monomorphized.
`fn f() where Self: R;`	In `trait T {}`, make `f` accessible only on types known to also `impl R`.
`fn f() where Self: R {}`	Esp. useful w. default methods (non dflt. would need be impl'ed anyway).
`for<'a>`	Higher-ranked trait bounds. ^NOM ^REF ^🝖
`trait T: for<'a> R<'a> {}`	Any `S` that `impl T` would also have to fulfill `R` for any lifetime.

Strings & Chars^url

Rust has several ways to create textual values.

Example	Explanation
`"..."`	String literal, ^REF^{, 1} UTF-8, will interpret `\n` as line break `0xA`, …
`r"..."`	Raw string literal. ^REF^{, 1} UTF-8, won't interpret `\n`, …
`r#"..."#`	Raw string literal, UTF-8, but can also contain `"`. Number of `#` can vary.
`b"..."`	Byte string literal; ^REF^{, 1} constructs ASCII `[u8]`, not a string.
`br"..."`, `br#"..."#`	Raw byte string literal, ASCII `[u8]`, combination of the above.
`'🦀'`	Character literal, ^REF fixed 4 byte unicode 'char'. ^STD
`b'x'`	ASCII byte literal. ^REF

¹ Supports multiple lines out of the box. Just keep in mind Debug^↓ (e.g., dbg!(x) and println!("{:?}", x)) might render them as \n, while Display^↓ (e.g., println!("{}", x)) renders them proper.

Documentation^url

Debuggers hate him. Avoid bugs with this one weird trick.

Example	Explanation
`///`	Outer line doc comment, ^BK ^EX ^REF use these on types, traits, functions, …
`//!`	Inner line doc comment, mostly used at start of file to document module.
`//`	Line comment, use these to document code flow or internals.
`/.../`	Block comment.
`/*.../`	Outer block doc comment.
`/!.../`	Inner block doc comment.

Tooling directives ^↓ outlines what you can do inside doc comments.

Miscellaneous^url

These sigils did not fit any other category but are good to know nonetheless.

Example	Explanation
`!`	Always empty never type. ^🚧^BK ^EX ^STD ^REF
`_`	Unnamed variable binding, e.g., `\|x, _\| {}`.
`let _ = x;`	Unnamed assignment is no-op, does not ^🛑 move out `x` or preserve scope!
`_x`	Variable binding explicitly marked as unused.
`1_234_567`	Numeric separator for visual clarity.
`1_u8`	Type specifier for numeric literals ^EX ^REF (also `i8`, `u16`, …).
`0xBEEF`, `0o777`, `0b1001`	Hexadecimal (`0x`), octal (`0o`) and binary (`0b`) integer literals.
`r#foo`	A raw identifier ^BK ^EX for edition compatibility.
`x;`	Statement ^REF terminator, c. expressions ^EX ^REF

Common Operators^url

Rust supports most operators you would expect (+, *, %, =, ==, …), including overloading. ^STD Since they behave no differently in Rust we do not list them here.

Behind the Scenes^url

Arcane knowledge that may do terrible things to your mind, highly recommended.

The Abstract Machine^url

Like C and C++, Rust is based on an abstract machine.

Rust → CPU
^🛑 Less correctish. Rust → Abstract Machine → CPU
More correctish.

The abstract machine

is not a runtime, and does not have any runtime overhead, but is a computing model abstraction,
contains concepts such as memory regions (stack, ...), execution semantics, ...
knows and sees things your CPU might not care about,
forms a contract between programmer and machine,
and exploits all of the above for optimizations.

^* Things people may incorrectly assume they should get away with if Rust targeted CPU directly, and more correct counterparts.

Practically this means:

before assuming your CPU will do A when writing B you need positive proof via documentation(!),

if you don't have that any physical behavior is coincidental,

violate the abtract machine's contract and the optimizer makes your CPU do something entirely else — undefined behavior.^↓

Memory & Lifetimes^url

Why moves, references and lifetimes are how they are.

Types & Moves

Application Memory S(1) Application Memory

Application memory in itself is just array of bytes.
Operating environment usually segments that, amongst others, into:
- stack (small, low-overhead memory,¹ most variables go here),
- heap (large, flexible memory, but always handled via stack proxy like Box<T>),
- static (most commonly used as resting place for str part of &str),
- code (where bitcode of your functions reside).
Programming languages such as Rust give developers tools to:
- define what data goes into what segment,
- express a desire for bitcode with specific properties to be produced,
- protect themselves from errors while performing these operations.
Most tricky part is tied to how stack evolves, which is our focus.

¹ While for each part of the heap someone (the allocator) needs to perform bookkeeping at runtime, the stack is trivially managable: take a few bytes more while you need them, they will be discarded once you leave. The (for performance reasons desired) simplicity of this appraoch, along with the fact that you can tell others about such transient locations (which in turn might want to access them long after you left), form the very essence of why lifetimes exist; and are the subject of the rest of this chapter.

Variables S(1) S(1) a t Variables

let t = S(1);

Reserves memory location with name t of type S and the value S(1) stored inside.
If declared with let that location lives on stack. ¹
Note that the term variable has some linguistic ambiguity,² it can mean:
1. the name of the location ("rename that variable"),
2. the location itself, 0x7 ("tell me the address of that variable"),
3. the value contained within, S(1) ("increment that variable").
Specifically towards the compiler t can mean location of t, here 0x7, and value within t, here S(1).

¹ Compare above,^↑ true for fully synchronous code, but async stack frame might placed it on heap via runtime.

² It is the author's opinion ^💬 that this ambiguity related to variables (and lifetimes and scope later) are some of the biggest contributors to the confusion around learning the basics of lifetimes. Whenever you hear one of these terms ask yourself "what exactly is meant here?"

Move Semantics S(1) a t Moves

let a = t;

This will move value within t to location of a, or copy it, if S is Copy.
After move location t is invalid and cannot be read anymore.
- Technically the bits at that location are not really empty, but undefined.
- If you still had access to t (via unsafe) they might still look like valid S, but any attempt to use them as valid S is undefined behavior. ^↓
We do not cover Copy types explicitly here. They change the rules a bit, but not much:
- They won't be dropped
- They never leave behind an 'empty' variable location.

Type Safety S(1) M { ... } ⛔ a c Type Safety

let c: S = M::new();

The type of a variable serves multiple important purposes, it:
1. dictates how the underlying bits are to be interpreted,
2. allows only well-defined operations on these bits
3. prevents random other values or bits from being written to that location.
Here assignment fails to compile since the bytes of M::new() cannot be converted to form of type S.
Conversions between types will always fail in general, unless explicit rule allows it (coercion, cast, …).

As an excercise to the reader, any time you see a value of type A being assignable to a location of some type not-exactly-A you should ask yourself: through what mechanism is this possible?

Scope & Drop S(1)▼ C(2) S(2)▼ S(3) t Scope & Drop

{
    let mut c = S(2);
    c = S(3);  // <- Drop called on `c` before assignment.
    let t = S(1);
    let a = t;
}   // <- Scope of `a`, `t`, `c` ends here, drop called on `a`, `c`.

Once the 'name' of a non-vacated variable goes out of (drop-)scope, the contained value is dropped.
- Rule of thumb: execution reaches point where name of variable leaves {}-block it was defined in
- In detail more tricky, esp. temporaries, …
Drop also invoked when new value assigned to existing variable location.
In that case Drop::drop() is called on the location of that value.
- In the example above drop() is called on a, twice on c, but not on t.
Most non-Copy values get dropped most of the time; exceptions include mem::forget(), Rc cycles, abort().

Call Stack

Stack Frame S(1) a x Function Boundaries

fn f(x: S) { ... }
let a = S(1); // <- We are here

f(a);

When a function is called, memory for parameters (and return values) are reserved on stack.¹
Here before f is invoked value in a is moved to 'agreed upon' location on stack, and during f works like 'local variable' x.

¹ Actual location depends on calling convention, might practically not end up on stack at all, but that doesn't change mental model.

S(1) a x x Nested Functions

fn f(x: S) {
    if once() { f(x) } // <- We are here (before recursion)
}
let a = S(1);

f(a);

Recursively calling functions, or calling other functions, likewise extends the stack frame.
Nesting too many invocations (esp. via unbounded recursion) will cause stack to grow, and eventually to overflow, terminating the app.

Validity of Variables S(1) M { } a x m Repurposing Memory

fn f(x: S) {
    if once() { f(x) }
    let m = M::new() // <- We are here (after recursion)
}
let a = S(1);

f(a);

Stack that previously held a certain type will be repurposed across (even within) functions.
Here, recursing on f produced second x, which after recursion was partially reused for m.

Key take away so far, there are multiple ways how memory locations that previously held a valid value of a certain type stopped doing so in the meantime. As we will see shortly, this has implications for pointers.

References & Pointers

Reference Types ▼ S(1) 0x3 a r References as Pointers

let a = S(1);
let r: &S = &a;

(Mutable) References ▼ S(2) 0x3 S(1) a r d Access to Non-Owned Memory

let mut a = S(1);
let r = &mut a;
let d = r.clone();  // Valid to clone (or copy) from r-target.
*r = S(2);          // Valid to set new S value to r-target.

References can read from (&S) and also write to (&mut S) location they point to.
The dereference *r means to neither use the location of or value within r, but the location r points to.
In example above, clone d is created from *r, and S(2) written to *r.
- Method Clone::clone(&T) expects a reference itself, which is why we can use r, not *r.
- On assignment *r = ... old value in location also dropped (not shown above).

▼ S(2) 0x3 M { x } ⛔ ⛔ a r d References Guard Referents

let mut a = ...;
let r = &mut a;
let d = *r;       // Invalid to move out value, `a` would be empty.
*r = M::new();    // invalid to store non S value, doesn't make sense.

While bindings guarantee to always hold valid data, references guarantee to always point to valid data.
Esp. &mut T must provide same guarantees as variables, and some more as they can't dissolve the target:
- They do not allow writing invalid data.
- They do not allow moving out data (would leave target empty w/o owner knowing).

▼ C(2) 0x3 c p Raw Pointers

let p: *const S = questionable_origin();

In contrast to references, pointers come with almost no guarantees.
They may point to invalid or non-existent data.
Dereferencing them is unsafe, and treating an invalid *p as if it were valid is undefined behavior. ^↓

Lifetime Basics

C(2) 0x3 "Lifetime" of Things

Every entity in a program has some time it is alive.
Loosely speaking, this alive time can be¹
1. the LOC (lines of code) where an item is available (e.g., a module name).
2. the LOC between when a location is initialized with a value, and when the location is abandoned.
3. the LOC between when a location is first used in a certain way, and when that usage stops.
4. the LOC (or actual time) between when a value is created, and when that value is dropped.
Within the rest of this section, we will refer to the items above as the:
1. scope of that item, irrelevant here.
2. scope of that variable or location.
3. lifetime² of that usage.
4. lifetime of that value, might be useful when discussing open file descriptors, but also irrelevant here.
Likewise, lifetime parameters in code, e.g., r: &'a S, are
- concerned with LOC any location r points to needs to be accessible or locked;
- unrelated to the 'existence time' (as LOC) of r itself (well, it needs to exist shorter, that's it).
&'static S means address must be valid during all lines of code.

¹ There is sometimes ambiguity in the docs differentiating the various scopes and lifetimes. We try to be pragmatic here, but suggestions are welcome.

²Live lines might have been a more appropriate term ...

▼ S(0) S(1) S(2) 0xa a b c r Meaning of r: &'c S

Assume you got a r: &'c S from somewhere it means:
- r holds an address of some S,
- any address r points to must and will exist for at least 'c,
- the variable r itself cannot live longer than 'c.

▼ S(0) S(3) S(2) 0x6 ⛔ a b c r Typelikeness of Lifetimes

{
    let b = S(3);
    {
        let c = S(2);
        let r: &'c S = &c;      // Does not quite work since we can't name lifetimes of local
        {                       // variables in a function body, but very same principle applies
            let a = S(0);       // to functions next page.
        r = &amp;a;             // Location of `a` does not live sufficient many lines -&gt; not ok.
        r = &amp;b;             // Location of `b` lives all lines of `c` and more -&gt; ok.
    }
}

}

Assume you got a mut r: &mut 'c S from somewhere.
- That is, a mutable location that can hold a mutable reference.
As mentioned, that reference must guard the targeted memory.
However, the 'c part, like a type, also guards what is allowed into r.
Here assiging &b (0x6) to r is valid, but &a (0x3) would not, as only &b lives equal or longer than &c.

▼ S(0) S(2) 0x6 S(4) ⛔ a b c Borrowed State

let mut b = S(0);
let r = &mut b;
b = S(4);   // Will fail since b in borrowed state.
print_byte(r);

Once the address of a variable is taken via &b or &mut b the variable is marked as borrowed.
While borrowed, the content of the addess cannot be modified anymore via original binding b.
Once address taken via &b or &mut b stops being used (in terms of LOC) original binding b works again.

Lifetimes in Functions

S(0) S(1) S(2) ? 0x6 0xa a b c r x y Function Parameters

fn f(x: &S, y:&S) -> &u8 { ... }
let b = S(1);

let c = S(2);
let r = f(&b, &c);

When calling functions that take and return references two interesting things happen:
- The used local variables are placed in a borrowed state,
- But it is during compilation unknown which address will be returned.

S(0) S(1) S(2) ? 0x6 0xa a b c r x y Problem of 'Borrowed' Propagation

let b = S(1);
let c = S(2);
let r = f(&b, &c);
let a = b;   // Are we allowed to do this?

let a = c;   // Which one is really borrowed?
print_byte(r);

Since f can return only one address, not in all cases b and c need to stay locked.
In many cases we can get quality-of-life improvements.
- Notably, when we know one parameter couldn't have been used in return value anymore.

▼ S(1) S(1) S(2) y + _ 0x6 0xa a b c r x y Lifetimes Propagate Borrowed State

fn f<'b, 'c>(x: &'b S, y: &'c S) -> &'c u8 { ... }
let b = S(1);

let c = S(2);
let r = f(&b, &c); // We know returned reference is c-based, which must stay locked,

// while b is free to move.
let a = b;
print_byte(r);

Liftime parameters in signatures, like 'c above, solve that problem.
Their primary purpose is:
- outside the function, to explain based on which input address an output address could be generated,
- within the function, to guarantee only addresses that live at least 'c are assigned.
The actual lifetimes 'b, 'c are transparently picked by the compiler at call site, based on the borrowed variables the developer gave.
They are not equal to the scope (which would be LOC from initialization to destruction) of b or c, but only a minimal subset of their scope called lifetime, that is, a minmal set of LOC based on how long b and c need to be borrowed to perform this call and use the obtained result.
In some cases, like if f had 'c: 'b instead, we still couldn't distinguish and both needed to stay locked.

S(2) S(1) S(2) y + 1 0x6 0xa a b c r x y Unlocking

let mut c = S(2);
let r = f(&c);

let s = r;

// <- Not here, s prolongs locking of c.
print_byte(s);
let a = c;          // <- But here, no more use of r or s.

A variable location is unlocked again once the last use of any reference that may point to it ends.

↕️ Examples expand by clicking.

Language Sugar^url

If something works that "shouldn't work now that you think about it", it might be due to one of these.

Opinion ^💬 — The features above will make your life easier, but might hinder your understanding. If any (type-related) operation ever feels inconsistent it might be worth revisiting this list.

Types, Traits, Generics^url

The building blocks of compile-time safety.

u8 u16 f32 bool char Primitive Types File String Builder Composite Types Vec<T> Vec<T> Vec<T> &'a T &'a T &'a T &mut 'a T &mut 'a T &mut 'a T [T; n] [T; n] [T; n] Type Constructors Vec<T> Vec<T> f<T>() {} drop() {} Functions PI dbg! Other ⌾ Copy ⌾ Deref type Tgt; ⌾ From<T> ⌾ From<T> ⌾ From<T> Traits Items defined in upstream crates. ⌾ Serialize ⌾ Transport ⌾ ShowHex Device ⌾ From<u8> Foreign trait impl. for local type. String ⌾ Serialize Local trait impl. for foreign type. String ⌾ From<u8> ^🛑 Illegal, foreign trait for f. type. String ⌾ From<Port> Exception: Legal if used type local. Port ⌾ From<u8> ⌾ From<u16> Mult. impl. of trait with differing IN params. Container ⌾ Deref Tgt = u8; ⌾ Deref Tgt = f32; ^🛑 Illegal impl. of trait with differing OUT params. T T T ⌾ ShowHex Blanket impl. of trait for any type. Your crate.

A walk through the jungle of types, traits, and implementations that (might possibly) exist in your application.

Type Paraphernalia^url

Allowing users to bring their own types and avoid code duplication.

Types & Traits

u8 String Device

Set of values with given semantics, layout, …

Type	Values
`u8`	`{ 0_u8, 1_u8, ..., 255_u8 }`
`char`	`{ 'a', 'b', ... '🦀' }`
`struct S(u8, char)`	`{ (0_u8, 'a'), ... (255_u8, '🦀') }`

Sample types and sample values.

Type Equivalence and Conversions u8 &u8 &mut u8 [u8; 1] String

May be obvious but u8, &u8, &mut u8, entirely different from each other
Any t: T only accepts values from exactly T, e.g.,
- f(0_u8) can't be called with f(&0_u8),
- f(&mut my_u8) can't be called with f(&my_u8),
- f(0_u8) can't be called with f(0_i8).

Yes, 0 != 0 (in a mathematical sense) when it comes to types! In a language sense, the operation ==(0_u8, 0_u16) just isn't defined to prevent happy little accidents.

Type	Values
`u8`	`{ 0_u8, 1_u8, ..., 255_u8 }`
`u16`	`{ 0_u16, 1_u16, ..., 65_535_u16 }`
`&u8`	`{ 0xffaa_&u8, 0xffbb_&u8, ... }`
`&mut u8`	`{ 0xffaa_{&mut u8}, 0xffbb_{&mut u8}, ... }`

How values differ between types.

However, Rust might sometimes help to convert between types¹
- casts manually convert values of types, 0_i8 as u8
- coercions ^↑ automatically convert types if safe², let x: &u8 = &mut 0_u8;

¹ Casts and coercions convert values from one set (e.g., u8) to another (e.g., u16), possibly adding CPU instructions to do so; and in such differ from subtyping, which would imply type and subtype are part of the same set (e.g., u8 being subtype of u16 and 0_u8 being the same as 0_u16) where such a conversion would be purely a compile time check. Rust does not use subtyping for regular types (and 0_u8 does differ from 0_u16) but sort-of for lifetimes. ^🔗

² Safety here is not just physical concept (e.g., &u8 can't be coerced to &u128), but also whether 'history has shown that such a conversion would lead to programming errors'.

Implementations — impl S { } u8 impl { ... } String impl { ... } Port impl { ... }

impl Port {
    fn f() { ... }
}

Types usually come with implementation, e.g., impl Port {}, behavior related to type:
- associated functions Port::new(80)
- methods port.close()

What's considered related is more philosophical than technical, nothing (except good taste) would prevent a u8::play_sound() from happening.

⌾ Copy ⌾ Clone ⌾ Sized ⌾ ShowHex

Traits ...
- are way to "abstract" behavior,
- trait author declares semantically this trait means X,
- other can implement ("subscribe to") that behavior for their type.
Think about trait as "membership list" for types:

Clone Trait
`u8`
`String`
`...`

Sized Trait
`char`
`Port`
`...`

Traits as membership tables, Self refers to the type included.

Whoever is part of that membership list will adhere to behavior of list.
Traits can also include associated methods, functions, ...

trait ShowHex {
    // Must be implemented according to documentation.
    fn as_hex() -> String;
// Provided by trait author.
fn print_hex() {}

}

⌾ Copy

trait Copy { }

Traits without methods often called marker traits.
Copy is example marker trait, meaning memory may be copied bitwise.

⌾ Sized

Some traits entirely outside explicit control
Sized provided by compiler for types with known size; either this is, or isn't

Implementing Traits for Types — impl T for S { }

impl ShowHex for Port { ... }

Traits are implemented for types 'at some point'.
Implementation impl A for B add type B to the trait memebership list:

Visually, you can think of the type getting a "badge" for its membership:

u8 impl { ... } ⌾ Sized ⌾ Clone ⌾ Copy Device impl { ... } ⌾ Transport Port impl { ... } ⌾ Sized ⌾ Clone ⌾ ShowHex 👩‍🦰 ⌾ Eat 🧔 Venison ⌾ Eat 🎅 venison.eat()

Interfaces

In Java, Alice creates interface Eat.
When Bob authors Venison, he must decide if Venison implements Eat or not.
In other words, all membership must be exhaustively declared during type definition.
When using Venison, Santa can make use of behavior provided by Eat:

// Santa imports `Venison` to create it, can `eat()` if he wants.
import food.Venison;
new Venison("rudolph").eat();

👩‍🦰 ⌾ Eat 🧔 Venison 👩‍🦰 / 🧔 Venison + ⌾ Eat 🎅 venison.eat()

Traits

In Rust, Alice creates trait Eat.
Bob creates type Venison and decides not to implement Eat (he might not even know about Eat).
Someone^* later decides adding Eat to Venison would be a really good idea.
When using Venison Santa must import Eat separately:

// Santa needs to import `Venison` to create it, and import `Eat` for trait method.
use food::Venison;
use tasks::Eat;
// Ho ho ho

Venison::new("rudolph").eat();

^* To prevent two persons from implementing Eat differently Rust limits that choice to either Alice or Bob; that is, an impl Eat for Venison may only happen in the crate of Venison or in the crate of Eat. For details see coherence. ^?

Generics

Type Constructors — Vec<> Vec<u8> Vec<char>

Vec<u8> is type "vector of bytes"; Vec<char> is type "vector of chars", but what is Vec<>?

Construct	Values
`Vec<u8>`	`{ [], [1], [1, 2, 3], ... }`
`Vec<char>`	`{ [], ['a'], ['x', 'y', 'z'], ... }`
`Vec<>`	-

Types vs type constructors.

Vec<>

Vec<> is no type, does not occupy memory, can't even be translated to code.
Vec<> is type constructor, a "template" or "recipe to create types"
- allows 3^rd party to construct concrete type via parameter,
- only then would this Vec<UserType> become real type itself.

Vec<T> [T; 128] &T &mut T S<T>

Parameter for Vec<> often named T therefore Vec<T>.
T "variable name for type" for user to plug in something specfic, Vec<f32>, S<u8>, …

Type Constructor	Produces Family
`struct Vec<T> {}`	`Vec<u8>`, `Vec<f32>`, `Vec<Vec<u8>>`, ...
`[T; 128]`	`[u8; 128]`, `[char; 128]`, `[Port; 128]` ...
`&T`	`&u8`, `&u16`, `&str`, ...

Type vs type constructors.

// S<> is type constructor with parameter T; user can supply any concrete type for T.
struct S<T> {
    x: T
}
// Within 'concrete' code an existing type must be given for T.

fn f() {

let x: S<f32> = S::new(0_f32);

}

Const Generics — [T; N] and S<const N: usize> [T; n] S<const N>

Some type constructors not only accept specific type, but also specific constant.
[T; n] constructs array type holding T type n times.
For custom types declared as MyArray<T, const N: usize>.

Type Constructor	Produces Family
`[u8; N]`	`[u8; 0]`, `[u8; 1]`, `[u8; 2]`, ...
`struct S<const N: usize> {}`	`S<1>`, `S<6>`, `S<123>`, ...

Type constructors based on constant.

let x: [u8; 4]; // "array of 4 bytes"
let y: [f32; 16]; // "array of 16 floats"
// MyArray is type constructor requiring concrete type T and

// concrete usize N to construct specific type.

struct MyArray<T, const N: usize> {

data: [T; N],

}

Bounds (Simple) — where T: X 🧔 Num<T> → 🎅 Num<u8> Num<f32> Num<Cmplx> u8 ⌾ Absolute ⌾ Dim ⌾ Mul Port ⌾ Clone ⌾ ShowHex

If T can be any type, how can we reason about (write code) for such a Num<T>?
Parameter bounds:
- limit what types (trait bound) or values (const bound ^?) allowed,
- we now can make use of these limits!
Trait bounds act as "membership check":

// Type can only be constructed for some `T` if that
// T is part of `Absolute` membership list.
struct Num<T> where T: Absolute {
    ...
}

Absolute Trait
`u8`
`u16`
`...`

We add bounds to the struct here. In practice it's nicer add bounds to the respective impl blocks instead, see later this section.

Bounds (Compound) — where T: X + Y u8 ⌾ Absolute ⌾ Dim ⌾ Mul f32 ⌾ Absolute ⌾ Mul char Cmplx ⌾ Absolute ⌾ Dim ⌾ Mul ⌾ DirName ⌾ TwoD Car ⌾ DirName

struct S<T>
where
    T: Absolute + Dim + Mul + DirName + TwoD
{ ... }

Long trait bounds can look intimidating.
In practice, each + X addition to a bound merely cuts down space of eligible types.

Implementing Families — impl<>

When we write:

impl<T> S<T> where T: Absolute + Dim + Mul {
    fn f(&self, x: T) { ... };
}

It can be read as:

here is an implementation recipe for any type T (the impl <T> part),
where that type must be member of the Absolute + Dim + Mul traits,
you may add an implementation block to S<T>,
containing the methods ...

You can think of such impl<T> ... {} code as abstractly implementing a family of behaviors. Most notably, they allow 3^rd parties to transparently materialize implementations similarly to how type constructors materialize types:

// If compiler encounters this, it will
// - check `0` and `x` fulfill the membership requirements of `T`
// - create two new version of `f`, one for `char`, another one for `u32`.
// - based on "family implementation" provided
s.f(0_u32);
s.f('x');

Blanket Implementations — impl<T&gt X for T { ... }

Can also write "family implementations" so they apply trait to many types:

// Also implements Serialize for any type if that type already implements ToHex
impl<T> Serialize for T where T: ToHex { ... }

These are called blanket implementations.

→ Whatever was in left table, may be added to right table, based on the following recipe (impl) →

Serialize Trait
`u8`
`Port`
`...`

They can be neat way to give foreign types functionality in a modular way if they just implement another interface.

Advanced Concepts^🝖

Trait Parameters — Trait<In> { type Out; }

Notice how some traits can be "attached" multiple times, but others just once?

Port ⌾ From<u8> ⌾ From<u16> Port ⌾ Deref type u8;

Why is that?

Traits themselves can be generic over two kinds of parameters:
- trait From {}
- trait Deref { type O; }
Remember we said traits are "membership lists" for types and called the list Self?
Turns out, parameters I (for input) and O (for output) are just more columns to that trait's list:

impl From<u8> for u16 {}
impl From<u16> for u32 {}
impl Deref for Port { type O = u8; }
impl Deref for String { type O = str; }

Deref
`Port`	`u8`
`String`	`str`
`...`

Input and output parameters.

Now here's the twist,

any output O parameters must be uniquely determined by input parameters I,
(in the same way as a relation X Y would represent a function),
Self counts as an input.

A more complex example:

trait Complex<I1, I2> {
    type O1;
    type O2;
}

this creates a relation relation of types named Complex,
with 3 inputs (Self is always one) and 2 outputs, and it holds (Self, I1, I2) => (O1, O2)

Complex
`Player`	`u8`	`char`	`f32`	`f32`
`EvilMonster`	`u16`	`str`	`u8`	`u8`
`EvilMonster`	`u16`	`String`	`u8`	`u8`
`NiceMonster`	`u16`	`String`	`u8`	`u8`
`NiceMonster`^{^🛑}	`u16`	`String`	`u8`	`u16`

Various trait implementations. The last one is not valid as (NiceMonster, u16, String) has
already uniquely determined the outputs.

Trait Authoring Considerations (Abstract) 👩‍🦰 ⌾ A 🧔 Car 👩‍🦰 / 🧔 Car ⌾ A 🎅 car.a(0_u8) car.a(0_f32)
👩‍🦰 ⌾ B type O; 🧔 Car 👩‍🦰 / 🧔 Car ⌾ B T = u8; 🎅 car.b(0_u8) car.b(0_f32)

Parameter choice (input vs. output) also determines who may be allowed to add members:
- I parameters allow "familes of implementations" be forwarded to user (Santa),
- O parameters must be determined by trait implementor (Alice or Bob).

trait A<I> { }
trait B { type O; }
// Implementor adds (X, u32) to A.

impl A<u32> for X { }
// Implementor adds family impl. (X, ...) to A, user can materialze.

impl<T> A<T> for Y { }
// Implementor must decide specific entry (X, O) added to B.

impl B for X { type O = u32; }

Santa may add more members by providing his own type for T.

For given set of inputs (here Self), implementor must pre-select O.

Trait Authoring Considerations (Example) ⌾ Audio → ⌾ Audio ⌾ Audio type O; ⌾ Audio type O;

Choice of parameters goes along with purpose trait has to fill:

No Additional Parameters

trait Audio {
    fn play(&self, volume: f32);
}
impl Audio for MP3 { ... }

impl Audio for Ogg { ... }
mp3.play(0_f32);

👩‍🦰 ⌾ Audio → 🧔 MP3 ⌾ Audio Ogg ⌾ Audio

Trait author assumes:

neither implementor nor user need to customize API.

Input Parameters

trait Audio<I> {
    fn play(&self, volume: I);
}
impl Audio<f32> for MP3 { ... }

impl Audio<u8> for MP3 { ... }

impl Audio<Mixer> for MP3 { ... }

impl<T> Audio<T> for Ogg where T: HeadsetControl { ... }
mp3.play(0_f32);

mp3.play(mixer);

👩‍🦰 ⌾ Audio → 🧔 MP3 ⌾ Audio<f32> ⌾ Audio<u8> ⌾ Audio<Mix> Ogg ⌾ Audio<T> ... where T is HeadsetCtrl.

Trait author assumes:

developers would customize API in multiple ways for same Self type,
users (may want) ability to decide for which I-types ability should be possible.

Output Parameters

trait Audio {
    type O;
    fn play(&self, volume: Self::O);
}
impl Audio for MP3 { type O = f32; }

impl Audio for Ogg { type O = Mixer; }
mp3.play(0_f32);

ogg.play(mixer);

👩‍🦰 ⌾ Audio type O; → 🧔 MP3 ⌾ Audio O = f32; Ogg ⌾ Audio O = Mixer;

Trait author assumes:

developers would customize API for Self type (but in only one way),
users do not need, or should not have, ability to influence customization for specific Self.

As you can see here, the term input or output does not (necessarily) have anything to do with whether I or O are inputs or outputs to an actual function!

Multiple In- and Output Parameters

trait Audio<I> {
    type O;
    fn play(&self, volume: I) -> Self::O;
}
impl Audio<u8> for MP3 { type O = DigitalDevice; }

impl Audio<f32> for MP3 { type O = AnalogDevice; }

impl<T> Audio<T> for Ogg { type O = GenericDevice; }
mp3.play(0_u8).flip_bits();

mp3.play(0_f32).rewind_tape();

👩‍🦰 ⌾ Audio type O; → 🧔 MP3 ⌾ Audio<u8> O = DD; ⌾ Audio<f32> O = AD; Ogg ⌾ Audio<T> O = GD;

Like examples above, in particular trait author assumes:

users may want ability to decide for which I-types ability should be possible,
for given inputs, developer should determine resulting output type.

S<T> → S<u8> S<char> S<str>

struct S<T> { ... }

T can be any concrete type.
However, there exists invisible default bound T: Sized, so S<str> is not possible out of box.
Instead we have to add T : ?Sized to opt-out of that bound:

S<T> → S<u8> S<char> S<str>

struct S<T> where T: ?Sized { ... }

Generics and Lifetimes — <'a> S<'a> &'a f32 &'a mut u8

Lifetimes act^* like type parameters:
- user must provide specific 'a to instantiate type (compiler will help within methods),
- as Vec<f32> and Vec<u8> are different types, so are S<'p> and S<'q>,
- meaning you can't just assign value of type S<'a> to variable expecting S<'b> (exception: "subtype" relationship for lifetimes, e.g. 'a outliving 'b).

S<'a> → S<'auto> S<'static>

'static is only nameable instance of the typespace lifetimes.

// `'a is free parameter here (user can pass any specific lifetime)
struct S<'a> {
    x: &'a u32
}
// In non-generic code, 'static is the only nameable lifetime we can explicitly put in here.

let a: S<'static>;
// Alternatively, in non-generic code we can (often must) omit 'a and have Rust determine

// the right value for 'a automatically.

let b: S;

^* There are subtle differences, for example you can create an explicit instance 0 of a type u32, but with the exception of 'static you can't really create a lifetime, e.g., "lines 80 - 100", the compiler will do that for you. ^🔗

Note to self and TODO: that analogy seems somewhat flawed, as if S<'a> is to S<'static> like S<T> is to S<u32>, then 'static would be a type; but then what's the value of that type?

Examples expand by clicking.

Data Layout^url

Memory representations of common data types.

Basic Types^url

Essential types built into the core of the language.

Numeric Types ^REF^url

u8, i8 u16, i16 u32, i32 u64, i64 u128, i128 f32 f64 usize, isize Same as ptr on platform.

Unsigned Types

Type	Max Value
`u8`	`255`
`u16`	`65_535`
`u32`	`4_294_967_295`
`u64`	`18_446_744_073_709_551_615`
`u128`	`340_282_366_920_938_463_463_374_607_431_768_211_455`
`usize`	Depending on platform pointer size, same as `u16`, `u32`, or `u64`.

Signed Types

Type	Max Value
`i8`	`127`
`i16`	`32_767`
`i32`	`2_147_483_647`
`i64`	`9_223_372_036_854_775_807`
`i128`	`170_141_183_460_469_231_731_687_303_715_884_105_727`
`isize`	Depending on platform pointer size, same as `i16`, `i32`, or `i64`.

Type	Min Value
`i8`	`-128`
`i16`	`-32_768`
`i32`	`-2_147_483_648`
`i64`	`-9_223_372_036_854_775_808`
`i128`	`-170_141_183_460_469_231_731_687_303_715_884_105_728`
`isize`	Depending on platform pointer size, same as `i16`, `i32`, or `i64`.

Float Types^🝖

Sample bit representation^* for a f32:

S E E E E E E E E F F F F F F F F F F F F F F F F F F F F F F F

Explanation:

f32	S (1)	E (8)	F (23)	Value
Normalized number	±	1 to 254	any	±(1.F)₂ * 2^E-127
Denormalized number	±	0	non-zero	±(0.F)₂ * 2^-126
Zero	±	0	0	±0
Infinity	±	255	0	±∞
NaN	±	255	non-zero	NaN

Similarly, for f64 types this would look like:

f64	S (1)	E (11)	F (52)	Value
Normalized number	±	1 to 2046	any	±(1.F)₂ * 2^E-1023
Denormalized number	±	0	non-zero	±(0.F)₂ * 2^-1022
Zero	±	0	0	±0
Infinity	±	2047	0	±∞
NaN	±	2047	non-zero	NaN

^* Float types follow IEEE 754-2008 and depend on platform endianness.

Textual Types ^REF^url

char Any UTF-8 scalar. str ... U T F - 8 ... unspecified times Rarely seen alone, but as &str instead.

Basics

Type	Description
`char`	Always 4 bytes and only holds a single Unicode scalar value ^🔗.
`str`	An `u8`-array of unknown length guaranteed to hold UTF-8 encoded code points.

Usage

Chars	Description
`let c = 'a';`	Often a `char` (unicode scalar) can coincide with your intuition of character.
`let c = '❤';`	It can also hold many Unicode symbols.
`let c = '❤️';`	But not always. Given emoji is two `char` (see Encoding) and can't ^🛑 be held by `c`.¹
`c = 0xffff_ffff;`	Also, chars are not allowed ^🛑 to hold arbitrary bit patterns.

¹ Fun fact, due to the Zero-width joiner (⨝) what the user perceives as a character can get even more unpredictable: 👨‍👩‍👧 is in fact 5 chars 👨⨝👩⨝👧, and rendering engines are free to either show them fused as one, or separately as three, depending on their abilities.

Strings	Description
`let s = "a";`	A `str` is usually never held directly, but as `&str`, like `s` here.
`let s = "❤❤️";`	It can hold arbitrary text, has variable length per c., and is hard to index.

Encoding^🝖

let s = "I ❤ Rust";
let t = "I ❤️ Rust";

Variant	Memory Representation²
`s.as_bytes()`	`49` `20` `e2 9d a4` `20 52 75 73 74` ³
`s.chars()`¹	`49 00 00 00 20 00 00 00` `64 27 00 00` `20 00 00 00 52 00 00 00 75 00 00 00 73 00` …
`t.as_bytes()`	`49` `20` `e2 9d a4` `ef b8 8f` `20 52 75 73 74` ⁴
`t.chars()`¹	`49 00 00 00 20 00 00 00` `64 27 00 00` `0f fe 01 00` `20 00 00 00 52 00 00 00 75 00` …

¹ Result then collected into array and transmuted to bytes.
² Values given in hex, on x86.
³ Notice how ❤, having Unicode Code Point (U+2764), is represented as 64 27 00 00 inside the char, but got UTF-8 encoded to e2 9d a4 in the str.
⁴ Also observe how the emoji Red Heart ❤️, is a combination of ❤ and the U+FE0F Variation Selector, thus t has a higher char count than s.

^💬 For what seem to be browser bugs Safari and Edge render the hearts in Footnote 3 and 4 wrong, despite being able to differentiate them correctly in s and t above.

Custom Types^url

Basic types definable by users. Actual layout ^REF is subject to representation; ^REF padding can be present.

T x T Sized ^↓ T: ?Sized T Maybe DST ^↓ [T; n] T T T ... n times Fixed array of n elements. [T] ... T T T ... unspecified times Slice type of unknown-many elements. Neither
Sized (nor carries len information), and most
often lives behind reference as &[T]. ^↓ struct S; ; Zero-Sized ^↓ (A, B, C) A B C or maybe B A C Unless a representation is forced
(e.g., via #[repr(C)]), type layout
unspecified. struct S { b: B, c: C } B C or maybe C ↦ B Compiler may also add padding.

Also note, two types A(X, Y) and B(X, Y) with exactly the same fields can still have differing layout; never transmute() without representation guarantees.

These sum types hold a value of one of their sub types:

enum E { A, B, C } Tag A exclusive or Tag B exclusive or Tag C Safely holds A or B or C, also
called 'tagged union', though
compiler may omit tag. union { ... } A unsafe or B unsafe or C Can unsafely reinterpret
memory. Result might
be undefined.

References & Pointers^url

References give safe access to other memory, raw pointers unsafe access. The respective mut types are identical.

&'a T ptr_2/4/8meta_2/4/8 | T Must target some valid t of T,
and any such target must exist for
at least 'a. *const T ptr_2/4/8meta_2/4/8 No guarantees.

Many reference and pointer types can carry an extra field, pointer metadata. ^STD It can be the element- or byte-length of the target, or a pointer to a vtable. Pointers with meta are called fat, otherwise thin.

&'a T ptr_2/4/8 | T No meta for
sized target.
(pointer is thin). &'a T ptr_2/4/8len_2/4/8 | T If T is a DST struct such as
S { x: [u8] } meta field len is
length of dyn. sized content. &'a [T] ptr_2/4/8len_2/4/8 | ... T T ... Regular slice reference (i.e., the
reference type of a slice type [T]) ^↑
often seen as &[T] if 'a elided. &'a str ptr_2/4/8len_2/4/8 | ... U T F - 8 ... String slice reference (i.e., the
reference type of string type str),
with meta len being byte length. &'a dyn Trait ptr_2/4/8ptr_2/4/8 | T |

`*Drop::drop(&mut T)`
`size`
`align`
`*Trait::f(&T, ...)`
`*Trait::g(&T, ...)`

Meta points to vtable, where *Drop::drop(), *Trait::f(), ... are pointers to their respective impl for T.

Closures^url

Ad-hoc functions with an automatically managed data block capturing ^REF environment where closure was defined. For example:

move |x| x + y.f() + z Y Z Anonymous closure type C1 |x| x + y.f() + z ptr_2/4/8ptr_2/4/8 Anonymous closure type C2 | Y | Z

Also produces anonymous fn such as f_c1(C1, X) or f_c2(&C2, X). Details depend which FnOnce, FnMut, Fn ... is supported, based on properties of captured types.

Standard Library Types^url

Rust's standard library combines the above primitive types into useful types with special semantics, e.g.:

UnsafeCell<T> T Magic type allowing
aliased mutability. Cell<T> T Allows T's
to move in
and out. RefCell<T> borrowed T Also support dynamic
borrowing of T. Like Cell this
is Send, but not Sync. AtomicUsize usize_2/4/8 Other atomic similarly. Result<T, E> Tag E or Tag T Option<T> Tag or Tag T Tag may be omitted for
certain T, e.g., NonNull.

General Purpose Heap Storage^url

Box<T> ptr_2/4/8meta_2/4/8 | T For some T stack proxy may carry
meta^↑ (e.g., Box[T]>). Vec<T> ptr_2/4/8capacity_2/4/8len_2/4/8 |

T T ... len

← capacity →

Owned Strings^url

String ptr_2/4/8capacity_2/4/8len_2/4/8 |

U T F - 8 ... len

← capacity → Observe how String differs from &str and &[char]. CString ptr_2/4/8len_2/4/8 |

A B C ... len ... ␀

Nul-terminated but w/o nul in middle. OsString ^? Platform Defined |

? ? / ? ?

Encapsulates how operating system
represents strings (e.g., UTF-16 on
Windows). PathBuf ^?OsString |

? ? / ? ?

Encapsulates how operating system
represents paths.

Shared Ownership^url

If the type does not contain a Cell for T, these are often combined with one of the Cell types above to allow shared de-facto mutability.

Rc<T> ptr_2/4/8meta_2/4/8

| strng_2/4/8weak_2/4/8T

Share ownership of T in same thread. Needs nested Cell
or RefCellto allow mutation. Is neither Send nor Sync. Arc<T> ptr_2/4/8meta_2/4/8

| strng_2/4/8weak_2/4/8T

Same, but allow sharing between threads IF contained
T itself is Send and Sync. Mutex<T> / RwLock<T> ptr_2/4/8poison_2/4/8T | lock Needs to be held in Arc to be shared between
threads, always Send and Sync. Consider using
parking_lot instead (faster, no heap usage).

Standard Library^url

One-Liners^url

Snippets that are common, but still easy to forget. See Rust Cookbook ^🔗 for more.

Thread Safety^url

Examples	`Send`^*	`!Send`
`Sync`^*	Most types ... `Mutex<T>`, `Arc<T>`^1,2	`MutexGuard<T>`¹, `RwLockReadGuard<T>`¹
`!Sync`	`Cell<T>`², `RefCell<T>`²	`Rc<T>`, `&dyn Trait`, `const T`³, `mut T`³

^* An instance t where T: Send can be moved to another thread, a T: Sync means &t can be moved to another thread.
¹ If T is Sync.
² If T is Send.
³ If you need to send a raw pointer, create newtype struct Ptr(*const u8) and unsafe impl Send for Ptr {}. Just ensure you may send it.

(Dynamically / Zero) Sized Types^url

MostTypes ⌾ Sized Normal types. vs. Z ⌾ Sized Zero sized. vs. str ⌾ Sized Dynamically sized. [u8] ⌾ Sized dyn Trait ⌾ Sized ... ⌾ Sized

Overview

A type T is Sized ^STD if at compile time it is known how many bytes it occupies, u8 and &[u8] are, [u8] isn't.
Being Sized means impl Sized for T {} holds. Happens automatically and cannot be user impl'ed.
Types not Sized are called dynamically sized types ^BK ^NOM ^REF (DSTs), sometimes unsized.
Types without data are called zero sized types ^NOM (ZSTs), do not occupy space.

Sized in Bounds

Iterators^url

Collection<T> ⌾ IntoIter Item = T; To = IntoIter<T> Iterate over T. IntoIter<T> ⌾ Iterator Item = T; &Collection<T> ⌾ IntoIter Item = &T; To = Iter<T> Iterate over &T. Iter<T> ⌾ Iterator Item = &T; &mut Collectn<T> ⌾ IntoIter Item = &mut T; To = IterMut<T> Iterate over &mut T. IterMut<T> ⌾ Iterator Item = &mut T;

String Conversions^url

If you want a string of type …

ⁱ Short form x.into() possible if type can be inferred.
^r Short form x.as_ref() possible if type can be inferred.

¹ You should, or must if call is unsafe, ensure raw data comes with a valid representation for the string type (e.g., UTF-8 data for a String).

² Only on some platforms std::os::<your_os>::ffi::OsStrExt exists with helper methods to get a raw &[u8] representation of the underlying OsStr. Use the rest of the table to go from there, e.g.:

use std::os::unix::ffi::OsStrExt;
let bytes: &[u8] = my_os_str.as_bytes();
CString::new(bytes)?

³ The c_char must have come from a previous CString. If it comes from FFI see &CStr instead.

⁴ No known shorthand as x will lack terminating 0x0. Best way to probably go via CString.

⁵ Must ensure vector actually ends with 0x0.

String Output^url

How to convert types into a String, or output them.

APIs Printable Types Formatting

Each argument designator in format macro is either empty {}, {argument}, or follows a basic syntax:

{ [argument] ':' [[fill] align] [sign] ['#'] [width [$]] ['.' precision [$]] [type] }

Project Anatomy^url

Basic project layout, and common files and folders, as used by cargo. ^↓

^* On stable consider Criterion.

Minimal examples for various entry points might look like:

Applications

// src/main.rs (default application entry point)
fn main() {

println!("Hello, world!");

}

Libraries

// src/lib.rs (default library entry point)
pub fn f() {}      // Is a public item in root, so it's accessible from the outside.
mod m {

pub fn g() {}  // No public path (m not public) from root, so g

}                  // is not accessible from the outside of the crate.

Unit Tests

// src/my_module.rs (any file of your project)
fn f() -> u32 { 0 }
#[cfg(test)]

mod test {

use super::f;           // Need to import items from parent module. Has

// access to non-public members.

#[test]

fn ff() {

assert_eq!(f(), 0);

}

}

Integration Tests

// tests/sample.rs (sample integration test)
#[test]

fn my_sample() {

assert_eq!(my_crate::f(), 123); // Integration tests (and benchmarks) 'depend' to the crate like

}                                   // a 3rd party would. Hence, they only see public items.

Benchmarks

// benches/sample.rs (sample benchmark)
#![feature(test)]   // #[bench] is still experimental
extern crate test;  // Even in '18 this is needed ... for reasons.

// Normally you don't need this in '18 code.
use test::{black_box, Bencher};
#[bench]

fn my_algo(b: &mut Bencher) {

b.iter(|| black_box(my_crate::f())); // black_box prevents f from being optimized away.

}

Build Scripts

// build.rs (sample pre-build script)
fn main() {

// You need to rely on env. vars for target; #[cfg(...)] are for host.

let target_os = env::var("CARGO_CFG_TARGET_OS");

}

^*See here for list of environment variables set.

Proc Macros^🝖

// src/lib.rs (default entry point for proc macros)
extern crate proc_macro;  // Apparently needed to be imported like this.
use proc_macro::TokenStream;
#[proc_macro_attribute]   // Can now be used as #[my_attribute]

pub fn my_attribute(_attr: TokenStream, item: TokenStream) -> TokenStream {

item

}

// Cargo.toml

[package]
name = "my_crate"
version = "0.1.0"

[lib]
proc-macro = true

Module trees and imports:

Module Trees

Modules ^BK ^EX ^REF and source files work as follows:

Module tree needs to be explicitly defined, is not implicitly built from file system tree. ^🔗
Module tree root equals library, app, … entry point (e.g., lib.rs).

Actual module definitions work as follows:

A mod m {} defines module in-file, while mod m; will read m.rs or m/mod.rs.
Path of .rs based on nesting, e.g., mod a { mod b { mod c; }}} is either a/b/c.rs or a/b/c/mod.rs.
Files not pathed from module tree root via some mod m; won't be touched by compiler! ^🛑

Namespaces^🝖

Rust has three kinds of namespaces:

Namespace Types	Namespace Functions	Namespace Macros
`mod X {}`	`fn X() {}`	`macro_rules! X { ... }`
`X` (crate)	`const X: u8 = 1;`
`trait X {}`	`static X: u8 = 1;`
`enum X {}`
`union X {}`
`struct X {}`
`struct X;`¹
`struct X();`¹

¹ Counts in Types and in Functions.

In any given scope, for example within a module, only one item item per namespace can exist, e.g.,
- enum X {} and fn X() {} can coexist
- struct X; and const X cannot coexist
With a use my_mod::X; all items called X will be imported.

Due to naming conventions (e.g., fn and mod are lowercase by convention) and common sense (most developers just don't name all things X) you won't have to worry about these kinds in most cases. They can, however, be a factor when designing macros.

Commands and tools that are good to know.

A command like cargo build means you can either type cargo build or just cargo b.

These are optional rustup components. Install them with rustup component add [tool].

A large number of additional cargo plugins can be found here.

Cross Compilation^url

🔘 Check target is supported.

🔘 Install target via rustup target install X.

🔘 Install native toolchain (required to link, depends on target).

Get from target vendor (Google, Apple, …), might not be available on all hosts (e.g., no iOS toolchain on Windows).

Some toolchains require additional build steps (e.g., Android's make-standalone-toolchain.sh).

🔘 Update ~/.cargo/config.toml like this:

[target.aarch64-linux-android]
linker = "[PATH_TO_TOOLCHAIN]/aarch64-linux-android/bin/aarch64-linux-android-clang"

or

[target.aarch64-linux-android]
linker = "C:/[PATH_TO_TOOLCHAIN]/prebuilt/windows-x86_64/bin/aarch64-linux-android21-clang.cmd"

🔘 Set environment variables (optional, wait until compiler complains before setting):

set CC=C:\[PATH_TO_TOOLCHAIN]\prebuilt\windows-x86_64\bin\aarch64-linux-android21-clang.cmd
set AR=C:\[PATH_TO_TOOLCHAIN]\prebuilt\windows-x86_64\bin\aarch64-linux-android-ar.exe
...

Whether you set them depends on how compiler complains, not necessarily all are needed.

Some platforms / configurations can be extremely sensitive how paths are specified (e.g., \ vs /) and quoted.

✔️ Compile with cargo build --target=X

Special tokens embedded in source code used by tooling or preprocessing.

Macros Documentation #![globals] #[code] #[quality] #[macros] #[cfg] build.rs

For the On column in attributes:
C means on crate level (usually given as #![my_attr] in the top level file).
M means on modules.
F means on functions.
S means on static.
T means on types.
X means something special.
! means on macros.
* means on almost any item.

Coding Guides^url

Idiomatic Rust^url

If you are used to programming Java or C, consider these.

🔥 We highly recommend you also follow the API Guidelines (Checklist) for any shared project! 🔥

Async-Await 101^url

If you are familiar with async / await in C# or TypeScript, here are some things to keep in mind:

Closures in APIs^url

There is a subtrait relationship Fn : FnMut : FnOnce. That means a closure that implements Fn ^STD also implements FnMut and FnOnce. Likewise a closure that implements FnMut ^STD also implements FnOnce. ^STD

From a call site perspective that means:

Notice how asking for a Fn closure as a function is most restrictive for the caller; but having a Fn closure as a caller is most compatible with any function.

From the perspective of someone defining a closure:

That gives the following advantages and disadvantages:

Unsafe, Unsound, Undefined^url

Unsafe leads to unsound. Unsound leads to undefined. Undefined leads to the dark side of the force.

Unsafe Code

Code marked unsafe has special permissions, e.g., to deref raw pointers, or invoke other unsafe functions.
Along come special promises the author must uphold to the compiler, and the compiler will trust you.
By itself unsafe code is not bad, but dangerous, and needed for FFI or exotic data structures.

// `x` must always point to race-free, valid, aligned, initialized u8 memory.
unsafe fn unsafe_f(x: *mut u8) {
    my_native_lib(x);
}

Undefined Behavior

Undefined Behavior (UB)

As mentioned, unsafe code implies special promises to the compiler (it wouldn't need be unsafe otherwise).
Failure to uphold any promise makes compiler produce fallacious code, execution of which leads to UB.
After triggering undefined behavior anything can happen. Insidiously, the effects may be 1) subtle, 2) manifest far away from the site of violation or 3) be visible only under certain conditions.
A seemingly working program (incl. any number of unit tests) is no proof UB code might not fail on a whim.
Code with UB is objectively dangerous, invalid and should never exist.

if should_be_true() {
   let r: &u8 = unsafe { &*ptr::null() };    // Once this runs, ENTIRE app is undefined. Even if
} else {                                     // line seemingly didn't do anything, app might now run
    println!("the spanish inquisition");     // both paths, corrupt database, or anything else.
}

Unsound Code

Any safe Rust that could (even only theoretically) produce UB for any user input is always unsound.
As is unsafe code that may invoke UB on its own accord by violating above-mentioned promises.
Unsound code is a stability and security risk, and violates basic assumption many Rust users have.

fn unsound_ref<T>(x: &T) -> &u128 {      // Signature looks safe to users. Happens to be
    unsafe { mem::transmute(x) }         // ok if invoked with an &u128, UB for practically
}                                        // everything else.

Responsible use of Unsafe ^💬

Do not use unsafe unless you absolutely have to.

Follow the Nomicon, Unsafe Guidelines, always uphold all safety invariants, and never invoke UB.

Minimize the use of unsafe and encapsulate it in small, sound modules that are easy to review.

Never create unsound abstractions; if you can't encapsulate unsafe properly, don't do it.

Each unsafe unit should be accompanied by plain-text reasoning outlining its safety.

API Stability^url

When updating an API, these changes can break client code.^RFC Major changes (🔴) are definitely breaking, while minor changes (🟡) might be breaking:

Links & Services^url

These are other great guides and tables.

All major Rust books developed by the community.

For more inofficial books see Little Book of Rust Books.

Comprehensive lookup tables for common components.

Online services which provide information or tooling.

Printing & PDF^url

Want this Rust cheat sheet as a PDF? Download the latest PDF here. Alternatively, generate it yourself via File > Print and then "Save as PDF" (works great in Chrome, has some issues in Firefox).

via Rust Language Cheat Sheet

April 26, 2021 at 10:34AM

The text was updated successfully, but these errors were encountered:

Rust Language Cheat Sheet #7826

Rust Language Cheat Sheet #7826

Comments

guevara commented Apr 27, 2021

Hello, Rust!url

Data Structuresurl

References & Pointersurl

Functions & Behaviorurl

Control Flowurl

Organizing Codeurl

Type Aliases and Castsurl

Macros & Attributesurl

Pattern Matchingurl

Generics & Constraintsurl

Strings & Charsurl

Documentationurl

Miscellaneousurl

Common Operatorsurl

Behind the Scenesurl

The Abstract Machineurl

Memory & Lifetimesurl

Language Sugarurl

Types, Traits, Genericsurl

Type Paraphernaliaurl

Data Layouturl

Basic Typesurl

Numeric Types REFurl

Textual Types REFurl

Custom Typesurl

References & Pointersurl

Closuresurl

Standard Library Typesurl

General Purpose Heap Storageurl

Owned Stringsurl

Shared Ownershipurl

Standard Libraryurl

One-Linersurl

Thread Safetyurl

(Dynamically / Zero) Sized Typesurl

Iteratorsurl

String Conversionsurl

String Outputurl

Project Anatomyurl

Cross Compilationurl

Coding Guidesurl

Idiomatic Rusturl

Async-Await 101url

Closures in APIsurl

Unsafe, Unsound, Undefinedurl

API Stabilityurl

Links & Servicesurl

Printing & PDFurl

Hello, Rust!^url

Data Structures^url

References & Pointers^url

Functions & Behavior^url

Control Flow^url

Organizing Code^url

Type Aliases and Casts^url

Macros & Attributes^url

Pattern Matching^url

Generics & Constraints^url

Strings & Chars^url

Documentation^url

Miscellaneous^url

Common Operators^url

Behind the Scenes^url

The Abstract Machine^url

Memory & Lifetimes^url

Language Sugar^url

Types, Traits, Generics^url

Type Paraphernalia^url

Data Layout^url

Basic Types^url

Numeric Types ^REF^url

Textual Types ^REF^url

Custom Types^url

References & Pointers^url

Closures^url

Standard Library Types^url

General Purpose Heap Storage^url

Owned Strings^url

Shared Ownership^url

Standard Library^url

One-Liners^url

Thread Safety^url

(Dynamically / Zero) Sized Types^url

Iterators^url

String Conversions^url

String Output^url

Project Anatomy^url

Cross Compilation^url

Coding Guides^url

Idiomatic Rust^url

Async-Await 101^url

Closures in APIs^url

Unsafe, Unsound, Undefined^url

API Stability^url

Links & Services^url

Printing & PDF^url