+// Rust-101, Part 00: Algebraic datatypes, expressions
+// ===================================================
+
+// As our first piece of Rust code, we want to write a function that computes the
+// minimum of a list. We are going to make use of the standard library, so let's import that:
+
+use std;
+
+// Let us start by thinking about the *type* of our function. Rust forces us to give the types of
+// all arguments, and the return type, before we even start writing the body. In the case of our minimum
+// function, we may be inclined to say that it returns a number. But then we would be in trouble: What's
+// the minimum of an empty list? The type of the function says we have to return *something*.
+// We could just choose 0, but that would be kind of arbitrary. What we need
+// is a type that is "a number, or nothing". Such a type (of multiple exclusive options)
+// is called an "algebraic datatype", and Rust lets us define such types with the keyword `enum`.
+// Coming from C(++), you can think of such a type as a `union`, together with a field that
+// stores the variant of the union that's currently used.
+
+enum NumberOrNothing {
+ Number(i32),
+ Nothing
+}
+
+// Notice that `i32` is the type of (signed, 32-bit) integers. To write down the type of
+// the minimum function, we need just one more ingredient: `Vec<i32>` is the type of
+// (growable) arrays of numbers, and we will use that as our list type.
+// Observe how in Rust, the return type comes *after* the arguments.
+
+fn vec_min_try1(vec: Vec<i32>) -> NumberOrNothing {
+ // First, we need some variable to store the minimum as computed so far.
+ // Since we start out with nothing computed, this will again be a
+ // "number or nothing":
+ let mut min = NumberOrNothing::Nothing;
+ // We do not have to write a type next to `min`, Rust can figure that out automatically
+ // (a bit like `auto` in C++11). Also notice the `mut`: In Rust, variables are
+ // immutable per default, and you need to tell Rust if you want
+ // to change a variable later.
+
+ // Now we want to *iterate* over the list. Rust has some nice syntax for
+ // iterators:
+ for el in vec {
+ // So `el` is al element of the list. We need to update `min` accordingly, but how do we get the current
+ // number in there? This is what pattern matching can do:
+ match min {
+ NumberOrNothing::Nothing => {
+ // In this case (*arm*) of the `match`, `min` is currently nothing, so let's just make it the number `el`.
+ min = NumberOrNothing::Number(el);
+ },
+ NumberOrNothing::Number(n) => {
+ // In this arm, `min` is currently the number `n`, so let's compute the new minimum and store it.
+ let new_min = std::cmp::min(n, el);
+ min = NumberOrNothing::Number(new_min);
+ }
+ }
+ }
+ // Finally, we return the result of the computation.
+ return min;
+}
+
+// Phew. We wrote our first Rust function! But all this `NumberOrNothing::` is getting kind of
+// ugly. Can't we do that nicer? Indeed, we can: The following line tells Rust to take
+// the constructors of `NumberOrNothing` into the local namespace:
+use self::NumberOrNothing::{Number,Nothing};
+// Try moving that above the function, and removing all the occurrences `NumberOrNothing::`.
+// Things should still compile, now being much less verbose!
+
+// There is more prettification we can do. To understand how, it is important to
+// understand that Rust is an "expression-based" language. This means that most of the
+// terms you write down are not just *statements* (executing code), but *expressions*
+// (returning a value). This applies even to the body of entire functions!
+
+// For example, consider `sqr`:
+fn sqr(i: i32) -> i32 { i * i }
+// Between the curly braces, we are giving the *expression* that computes the return value.
+// So we can just write `i * i`, the expression that returns the square if `i`!
+// This is very close to how mathematicians write down functions (but with more types).
projects / rust-101.git / blobdiff