From b3a317c368d424929cdd2e6c3be661d7d8553cc0 Mon Sep 17 00:00:00 2001
From: Daniel Micay <danielmicay@gmail.com>
Date: Mon, 5 Aug 2013 19:23:29 -0400
Subject: [PATCH] iterator: simplify the `take` implementation

---
 src/libstd/iterator.rs | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/src/libstd/iterator.rs b/src/libstd/iterator.rs
index 56a0dca5667..4803e2e004e 100644
--- 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
         }