be more explicit about dereferencing

diff --git a/src/part10.rs b/src/part10.rs
index c8a0129a5ad4f4508091dcd449bab87ad89323fc..452e993d36a63e35c8abd38b72cdbe0e68fc1fa6 100644 (file)
--- a/src/part10.rs
+++ b/src/part10.rs
@@ -115,7 +115,7 @@ fn inc_print_even(v: &Vec<i32>, offset: i32, threshold: i32) {
     //@ 
     //@ Since all these closures compile down to the pattern described above, there is actually no heap allocation going on here. This makes
     //@ closures very efficient, and it makes optimization fairly trivial: The resulting code will look like you hand-rolled the loop in C.
-    for i in v.iter().map(|n| n + offset).filter(|n| *n > threshold) {
+    for i in v.iter().map(|n| *n + offset).filter(|n| *n > threshold) {
         println!("{}", i);
     }
 }

diff --git a/workspace/src/part10.rs b/workspace/src/part10.rs
index f7d9028ad46a15e9ccc4a0b11fca8b1d84584b28..7af161716f6a07971f499351081defbef299100f 100644 (file)
--- a/workspace/src/part10.rs
+++ b/workspace/src/part10.rs
@@ -76,7 +76,7 @@ pub fn print_and_count(b: &BigInt) {
 
 // Let's say we want to write a function that increments every entry of a `Vec` by some number, then looks for numbers larger than some threshold, and prints them.
 fn inc_print_even(v: &Vec<i32>, offset: i32, threshold: i32) {
-    for i in v.iter().map(|n| n + offset).filter(|n| *n > threshold) {
+    for i in v.iter().map(|n| *n + offset).filter(|n| *n > threshold) {
         println!("{}", i);
     }
 }