1 // ***Remember to enable/add this part in `main.rs`!***
3 // Rust-101, Part 01: Expressions, Inherent methods
4 // ================================================
6 // Even though our code from the first part works, we can still learn a
7 // lot by making it prettier. To understand how, it is important to
8 // understand that Rust is an "expression-based" language. This means that most of the
9 // terms you write down are not just *statements* (executing code), but *expressions*
10 // (returning a value). This applies even to the body of entire functions!
12 // ## Expression-based programming
13 // For example, consider `sqr`:
14 fn sqr(i: i32) -> i32 { i * i }
15 // Between the curly braces, we are giving the *expression* that computes the return value.
16 // So we can just write `i * i`, the expression that returns the square if `i`!
17 // This is very close to how mathematicians write down functions (but with more types).
19 // Conditionals are also just expressions. You can compare this to the ternary `? :` operator
20 // from languages like C.
21 fn abs(i: i32) -> i32 { if i >= 0 { i } else { -i } }
23 // And the same applies to case distinction with `match`: Every `arm` of the match
24 // gives the expression that is returned in the respective case.
25 // (We repeat the definition from the previous part here.)
26 enum NumberOrNothing {
30 use self::NumberOrNothing::{Number,Nothing};
31 fn number_or_default(n: NumberOrNothing, default: i32) -> i32 {
38 // Let us now refactor `vec_min`.
39 fn vec_min(v: Vec<i32>) -> NumberOrNothing {
40 // Remember that helper function `min_i32`? Rust allows us to define such helper functions *inside* other
41 // functions. This is just a matter of namespacing, the inner function has no access to the data of the outer
42 // one. Still, being able to nicely group functions can be very useful.
43 fn min_i32(a: i32, b: i32) -> i32 {
44 if a < b { a } else { b }
47 let mut min = Nothing;
49 // Notice that all we do here is compute a new value for `min`, and that it will always end
50 // up being a `Number` rather than `Nothing`. In Rust, the structure of the code
51 // can express this uniformity.
52 min = Number(match min {
54 Number(n) => min_i32(n, e)
57 // The `return` keyword exists in Rust, but it is rarely used. Instead, we typically
58 // make use of the fact that the entire function body is an expression, so we can just
59 // write down the desired return value.
63 // Now that's already much shorter! Make sure you can go over the code above and actually understand
64 // every step of what's going on.
66 // ## Inherent implementations
67 // So much for `vec_min`. Let us now reconsider `print_number_or_nothing`. That function
68 // really belongs pretty close to the type `NumberOrNothing`. In C++ or Java, you would
69 // probably make it a method of the type. In Rust, we can achieve something very similar
70 // by providing an *inherent implementation*.
71 impl NumberOrNothing {
74 Nothing => println!("The number is: <nothing>"),
75 Number(n) => println!("The number is: {}", n),
79 // So, what just happened? Rust separates code from data, so the definition of the
80 // methods on an `enum` (and also on `struct`, which we will learn about later)
81 // is independent of the definition of the type. `self` is like `this` in other
82 // languages, and its type is always implicit. So `print` is now a method that
83 // takes as first argument a `NumberOrNothing`, just like `print_number_or_nothing`.
85 // Try making `number_or_default` from above an inherent method as well!
87 // With our refactored functions and methods, `main` now looks as follows:
88 fn read_vec() -> Vec<i32> {
93 let min = vec_min(vec);
96 // You will have to replace `part00` by `part01` in the `main` function in
97 // `main.rs` to run this code.
99 // **Exercise 01.1**: Write a funtion `vec_sum` that computes the sum of all values of a `Vec<i32>`.
101 // **Exercise 01.2**: Write a function `vec_print` that takes a vector and prints all its elements.
103 // [index](main.html) | [previous](part00.html) | [next](part02.html)