X-Git-Url: https://git.ralfj.de/rust-101.git/blobdiff_plain/29958c0fd33c5e714b52bed79a1832113c43b8d8..8d09a95e8d64b2fd3a30940fcedbc41ae2c59396:/workspace/src/part07.rs?ds=sidebyside

diff --git a/workspace/src/part07.rs b/workspace/src/part07.rs
index 6b779cc..916cb01 100644
--- a/workspace/src/part07.rs
+++ b/workspace/src/part07.rs
@@ -11,14 +11,17 @@ pub trait Minimum {
 pub fn vec_min<T: Minimum>(v: &Vec<T>) -> Option<&T> {
     let mut min: Option<&T> = None;
     for e in v {
-        unimplemented!()
+        min = Some(match min {
+            None => e,
+            Some(n) => n.min(e)
+        });
     }
     min
 }
 
 // **Exercise 07.1**: For our `vec_min` to be usable with `BigInt`, you will have to provide an implementation of
 // `Minimum`. You should be able to pretty much copy the code you wrote for exercise 06.1. You should *not*
-// make any copies!
+// make any copies of `BigInt`!
 impl Minimum for BigInt {
     fn min<'a>(&'a self, other: &'a Self) -> &'a Self {
         unimplemented!()
@@ -36,7 +39,7 @@ impl PartialEq for BigInt {
 }
 
 
-// Now we can compare `BigInt`s. Rust treats `PratialEq` special in that it is wired to the operator `==`:
+// Now we can compare `BigInt`s. Rust treats `PartialEq` special in that it is wired to the operator `==`:
 fn compare_big_ints() {
     let b1 = BigInt::new(13);
     let b2 = BigInt::new(37);
@@ -58,7 +61,7 @@ fn test_min() {
 
 // ## Formatting
 
-// All formating is handled by [`std::fmt`](http://doc.rust-lang.org/std/fmt/index.html). I won't explain
+// All formating is handled by [`std::fmt`](https://doc.rust-lang.org/std/fmt/index.html). I won't explain
 // all the details, and refer you to the documentation instead.
 use std::fmt;