X-Git-Url: https://git.ralfj.de/rust-101.git/blobdiff_plain/4f61be32dd480f23a7fef05ee66c42ae27c980c6..cfc6a4901346f45284dcf591375f759e7193d561:/workspace/src/part00.rs?ds=inline

diff --git a/workspace/src/part00.rs b/workspace/src/part00.rs
index bf6a9fd..49e89eb 100644
--- a/workspace/src/part00.rs
+++ b/workspace/src/part00.rs
@@ -1,5 +1,3 @@
-// ***Remember to enable/add this part in `main.rs`!***
-
 // Rust-101, Part 00: Algebraic datatypes
 // ======================================
 
@@ -17,8 +15,7 @@ enum NumberOrNothing {
 fn vec_min(vec: Vec<i32>) -> NumberOrNothing {
     let mut min = NumberOrNothing::Nothing;
 
-    // Now we want to *iterate* over the list. Rust has some nice syntax for
-    // iterators:
+    // 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:
@@ -61,8 +58,7 @@ fn read_vec() -> Vec<i32> {
     unimplemented!()
 }
 
-// Finally, let's call our functions and run the code!
-// But, wait, we would like to actually see something, so we need to print the result.
+// Of course, we would also like to actually see the result of the computation, so we need to print the result.
 
 fn print_number_or_nothing(n: NumberOrNothing) {
     unimplemented!()
@@ -75,7 +71,6 @@ pub fn main() {
     print_number_or_nothing(min);
 }
 
-// You can now use `cargo build` to compile your code. If all goes well, try `cargo run` on the
-// console to run it.
+// Finally, try `cargo run` on the console to run it.