Merge pull request #1562 from Rqnsom/fibonacci_fix

fix: Fibonacci sequence starts from zero

src/trait/iter.md

@@ -1,12 +1,13 @@
 # Iterators
 
-The [`Iterator`][iter] trait is used to implement iterators over collections such as arrays.
+The [`Iterator`][iter] trait is used to implement iterators over collections
+such as arrays.
 
-The trait requires only a method to be defined for the `next` element, 
-which may be manually defined in an `impl` block or automatically 
+The trait requires only a method to be defined for the `next` element,
+which may be manually defined in an `impl` block or automatically
 defined (as in arrays and ranges).
 
-As a point of convenience for common situations, the `for` construct 
+As a point of convenience for common situations, the `for` construct
 turns some collections into iterators using the [`.into_iter()`][intoiter] method.
 
 ```rust,editable
@@ -20,22 +21,22 @@ struct Fibonacci {
 impl Iterator for Fibonacci {
     // We can refer to this type using Self::Item
     type Item = u32;
-    
+
     // Here, we define the sequence using `.curr` and `.next`.
     // The return type is `Option<T>`:
     //     * When the `Iterator` is finished, `None` is returned.
     //     * Otherwise, the next value is wrapped in `Some` and returned.
     // We use Self::Item in the return type, so we can change
     // the type without having to update the function signatures.
     fn next(&mut self) -> Option<Self::Item> {
-        let new_next = self.curr + self.next;
+        let current = self.curr;
 
         self.curr = self.next;
-        self.next = new_next;
+        self.next = current + self.next;
 
         // Since there's no endpoint to a Fibonacci sequence, the `Iterator` 
         // will never return `None`, and `Some` is always returned.
-        Some(self.curr)
+        Some(current)
     }
 }