From: Ralf Jung Date: Tue, 9 Jun 2015 17:10:18 +0000 (+0200) Subject: finish part 2 X-Git-Url: https://git.ralfj.de/rust-101.git/commitdiff_plain/f21475ab3d58a70db564410f2b81572a4dbb492c?ds=sidebyside finish part 2 --- diff --git a/src/main.rs b/src/main.rs index fdc8f5f..b635f7e 100644 --- a/src/main.rs +++ b/src/main.rs @@ -1,6 +1,6 @@ // Welcome to Rust-101 // =================== -// +// // This is [Rust-101](https://www.ralfj.de/projects/rust-101/), a small *work-in-progress* // tutorial for the [Rust language](http://www.rust-lang.org/). // It is intended to be an interactive, hands-on course: I believe the only way to @@ -13,10 +13,10 @@ // // I will assume basic familiarity with programming, and hence not explain the basic // concepts common to most languages. Instead, I will focus on what makes Rust special. -// +// // Prerequisites // ------------- -// +// // You will need to have Rust installed, of course. It is available for download on // [the Rust website](http://www.rust-lang.org/). At this point, I plan to restrict // myself to stable Rust, so "Recommended" version is just right. @@ -24,14 +24,14 @@ // [the second chapter of The Book](https://doc.rust-lang.org/stable/book/installing-rust.html). // When you are done, running `cargo build` in the root of Rust-101 should successfully compile // all the code. -// +// // Getting the source // ------------------ -// +// // You are meant to play around with the source code of the course as you go on, so please // fetch it from the [git repository](http://www.ralfj.de/git/rust-101.git) (also available // [on GitHub](https://github.com/RalfJung/rust-101)). -// +// // Course Content // -------------- // @@ -40,7 +40,7 @@ // // * [Part 00](part00.html) // * [Part 01](part01.html) -// * [Part 02](part02.html) (WIP) +// * [Part 02](part02.html) // * (to be continued) #![allow(dead_code, unused_imports, unused_variables)] mod part00; diff --git a/src/part01.rs b/src/part01.rs index 7603c1f..927a617 100644 --- a/src/part01.rs +++ b/src/part01.rs @@ -94,6 +94,7 @@ pub fn part_main() { // `main.rs` to run this code. // **Exercise**: Write a funtion `vec_avg` that computes the average value of a `Vec`. +// // *Hint*: `vec.len()` returns the length of a vector `vec`. // [index](main.html) | [previous](part00.html) | [next](part02.html) diff --git a/src/part02.rs b/src/part02.rs index 72dcddc..a9f9b05 100644 --- a/src/part02.rs +++ b/src/part02.rs @@ -1,5 +1,5 @@ -// Rust-101, Part 02: Generic types (WIP) -// ================================ +// Rust-101, Part 02: Generic types, Traits +// ======================================== use std; @@ -11,7 +11,7 @@ use std; // The solution to this is called *generics* or *polymorphism* (the latter is Greek, // meaning "many shapes"). You may know something similar from C++ (where it's called // *templates*) or Java, or one of the many functional languages. So here, we define -// a generic `SomethingOrNothing` type. +// a generic type `SomethingOrNothing`. enum SomethingOrNothing { Something(T), Nothing, @@ -27,7 +27,7 @@ use self::SomethingOrNothing::{Something,Nothing}; // **Exercise**: Write functions converting between `SomethingOrNothing` and `Option`. You will have to use // the names of the constructor of `Option`, which you can find in the documentation I linked above. - +// // Here's a skeleton for your solution, you only have to fill in the function bodies. // (`panic!` is, again, a macro - this one terminates execution when it is reached). // @@ -36,11 +36,11 @@ use self::SomethingOrNothing::{Something,Nothing}; // *using* that variable ("The thing I do, is implement `SomethingOrNothing`"). impl SomethingOrNothing { fn new(o: Option) -> Self { - panic!("Not yet implemented."); + panic!("Not yet implemented.") } fn to_option(self) -> Option { - panic!("Not yet implemented."); + panic!("Not yet implemented.") } } // Inside an `impl`, `Self` refers to the type we are implementing things for. Here, it is @@ -55,6 +55,104 @@ impl SomethingOrNothing { fn call_constructor(x: i32) -> SomethingOrNothing { SomethingOrNothing::new(Some(x)) } - + +// Now that we have a generic `SomethingOrNothing`, wouldn't it be nice to also gave a generic +// `vec_min`? Of course, we can't take the minimum of a vector of *any* type. It has to be a type +// supporting a `min` operation. Rust calls such properties that we may demand of types *traits*. + +// So, as a first step towards a generic `vec_min`, we define a `Minimum` trait. +// For now, just ignore the `Copy`, we will come back to this point later. +// A `trait` is a lot like interfaces in Java: You define a bunch of functions +// you want to have implemented, and their argument and return types. +trait Minimum : Copy { + fn min(a: Self, b: Self) -> Self; +} + +// Now we can write `vec_min`, generic over a type `T` that we demand to satisfy the `Minimum` trait. +// This is called a *trait bound*. +// The only difference to the version from the previous part is that we call `T::min` (the `min` +// function provided for type `T`) instead of `std::cmp::min`. +// +// Notice a crucial difference to templates in C++: We actually have to declare which traits +// we want the type to satisfy. If we left away the `Minimum`, Rust would have complained that +// we cannot call `min`. Just try it! There is no reason to believe that `T` provides such an operation. +// This is in strong contrast to C++, where the compiler only checks such details when the +// function is actually used. +fn vec_min(v: &Vec) -> SomethingOrNothing { + let mut min = Nothing; + for e in v { + let e = *e; + min = Something(match min { + Nothing => e, + Something(n) => T::min(n, e) + }); + } + min +} + +// To make the function usable with a `Vec`, we implement the `Minimum` trait for `i32`. +impl Minimum for i32 { + fn min(a: Self, b: Self) -> Self { + std::cmp::min(a, b) + } +} + +// In order to run our code and see the result, we again provide a `print` function. +// This also shows that we can have multiple `impl` blocks for the same type, and we +// can provide some methods only for certain instances of a generic type. +impl SomethingOrNothing { + fn print(self) { + match self { + Nothing => println!("The number is: "), + Something(n) => println!("The number is: {}", n), + }; + } +} + +// Now we are again ready to run our code. Remember to change `main.rs` appropriately. +// Rust figures out automatically that we want the `T` of `vec_min` to be `i32`, and +// that `i32` implements `Minimum` and hence all is good. +// +// In case you are worried about performance, note that Rust performs *monomorphisation* +// of generic functions: When you call `vec_min` with `T` being `i32`, Rust essentially goes +// ahead and creates a copy of the function for this particular type, filling in all the blanks. +// In this case, the call to `T::min` will become a call to our implementation *statically*. There is +// no dynamic dispatch, like there would be for Java interface methods or C++ `virtual` methods. +// This behavior is similar to C++ templates. The optimizer (Rust is using LLVM) then has all the +// information it could want to, e.g., inline function calls. +fn read_vec() -> Vec { + vec![18,5,7,3,9,27] +} +pub fn part_main() { + let vec = read_vec(); + let min = vec_min(&vec); + min.print(); +} + +// If this printed `3`, then you generic `vec_min` is working! +// +// Before going on, take a moment to ponder the flexibility of Rust's take on abstraction: +// We just defined our own, custom trait (interface), and then implemented that trait +// *for an existing type*. With the hierarchical approach of, e.g., C++ or Java, +// that's not possible: We cannot make an existing type suddenly also inherit from our abstract base class. + +// **Exercise**: Define a trait "Print" to write a generic version of `SomethingOrNothing::print`. +// Implement that trait for `i32`, and change the code above to use it. +// I will again provide a skeleton for this solution. It also shows how to attach bounds to generic +// implementations (just compare it to the `impl` block from the previous exercise). +// You can read this as "For all types `T` satisfying the `Print` trait, I provide an implementation +// for `SomethingOrNothing`". +// +// Notice that I called the function on `SomethingOrNothing` `print2` to disambiguate from the `print` defined above. +// +// *Hint*: There is a macro `print!` for printing without appending a newline. +trait Print { + /* Add things here */ +} +impl SomethingOrNothing { + fn print2(self) { + panic!("Not yet implemented.") + } +} // [index](main.html) | [previous](part01.html) | next