mirror of
https://github.com/google/comprehensive-rust.git
synced 2025-05-18 16:33:09 +02:00
8c58253217
* Update the Speaker Notes of the type-inference.md I think this is one of the critical moments in understanding Rust. This behavior is different from many static and dynamic programming languages. * Fix typo Co-authored-by: Andrew Walbran <qwandor@google.com>
1.4 KiB
1.4 KiB
Type Inference
Rust will look at how the variable is used to determine the type:
fn takes_u32(x: u32) {
println!("u32: {x}");
}
fn takes_i8(y: i8) {
println!("i8: {y}");
}
fn main() {
let x = 10;
let y = 20;
takes_u32(x);
takes_i8(y);
// takes_u32(y);
}
This slide demonstrates how the Rust compiler infers types based on constraints given by variable declarations and usages.
It is very important to emphasize that variables declared like this are not of some sort of dynamic "any type" that can hold any data. The machine code generated by such declaration is identical to the explicit declaration of a type. The compiler does the job for us and helps us to write a more concise code.
The following code tells the compiler to copy into a certain generic container without the code ever explicitly specifying the contained type, using _ as a placeholder:
fn main() {
let mut v = Vec::new();
v.push((10, false));
v.push((20, true));
println!("v: {v:?}");
let vv = v.iter().collect::<std::collections::HashSet<_>>();
println!("vv: {vv:?}");
}