iterator: simplify the `take` implementation

diff --git a/src/libstd/iterator.rs b/src/libstd/iterator.rs
index 56a0dca56679ccf3a34d89038944614d0c497263..4803e2e004e75c2dc811ab4eff939049afd44bca 100644 (file)
--- a/src/libstd/iterator.rs
+++ b/src/libstd/iterator.rs
@@ -1316,10 +1316,9 @@ pub struct Take<T> {
 impl<A, T: Iterator<A>> Iterator<A> for Take<T> {
     #[inline]
     fn next(&mut self) -> Option<A> {
-        let next = self.iter.next();
         if self.n != 0 {
             self.n -= 1;
-            next
+            self.iter.next()
         } else {
             None
         }