From caa50ce15d8ed8f0d50c9049053a5e2cd5a0d701 Mon Sep 17 00:00:00 2001 From: James Miller Date: Tue, 25 Jun 2013 17:08:26 +1200 Subject: Remove stage0 cfgs --- src/libstd/iterator.rs | 5 ----- 1 file changed, 5 deletions(-) (limited to 'src/libstd/iterator.rs') diff --git a/src/libstd/iterator.rs b/src/libstd/iterator.rs index d96191f296d..9177ecabed6 100644 --- a/src/libstd/iterator.rs +++ b/src/libstd/iterator.rs @@ -43,7 +43,6 @@ pub trait Iterator { /// Return a lower bound and upper bound on the remaining length of the iterator. /// /// The common use case for the estimate is pre-allocating space to store the results. - #[cfg(not(stage0))] fn size_hint(&self) -> (Option, Option) { (None, None) } } @@ -610,7 +609,6 @@ impl, U: Iterator> Iterator for ChainIterator { } #[inline] - #[cfg(not(stage0))] fn size_hint(&self) -> (Option, Option) { let (a_lower, a_upper) = self.a.size_hint(); let (b_lower, b_upper) = self.b.size_hint(); @@ -664,7 +662,6 @@ impl<'self, A, B, T: Iterator> Iterator for MapIterator<'self, A, B, T> { } #[inline] - #[cfg(not(stage0))] fn size_hint(&self) -> (Option, Option) { self.iter.size_hint() } @@ -690,7 +687,6 @@ impl<'self, A, T: Iterator> Iterator for FilterIterator<'self, A, T> { } #[inline] - #[cfg(not(stage0))] fn size_hint(&self) -> (Option, Option) { let (_, upper) = self.iter.size_hint(); (None, upper) // can't know a lower bound, due to the predicate @@ -716,7 +712,6 @@ impl<'self, A, B, T: Iterator> Iterator for FilterMapIterator<'self, A, B, } #[inline] - #[cfg(not(stage0))] fn size_hint(&self) -> (Option, Option) { let (_, upper) = self.iter.size_hint(); (None, upper) // can't know a lower bound, due to the predicate -- cgit 1.4.1-3-g733a5