Struct std::iter::Range[src]
pub struct Range<A> {
// some fields omitted
}An iterator over the range [start, stop)
Trait Implementations
impl<A: Add<A, A> + PartialOrd + Clone + ToPrimitive> Iterator<A> for Range<A>
fn next<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&mut self) -> Option<A>
fn size_hint<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&self) -> (uint, Option<uint>)
fn size_hint<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&self) -> (uint, Option<uint>)
fn chain<U: Iterator<A>>(self, U) -> Chain<Range<A>, U>
fn zip<B, U: Iterator<B>>(self, U) -> Zip<Range<A>, U>
fn map<B>(self, |A|: 'r -> B) -> Map<'r, A, B, Range<A>>
fn filter<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(self, |&A|: 'r -> bool) -> Filter<'r, A, Range<A>>
fn filter_map<B>(self, |A|: 'r -> Option<B>) -> FilterMap<'r, A, B, Range<A>>
fn enumerate<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(self) -> Enumerate<Range<A>>
fn peekable<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(self) -> Peekable<A, Range<A>>
fn skip_while<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(self, |&A|: 'r -> bool) -> SkipWhile<'r, A, Range<A>>
fn take_while<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(self, |&A|: 'r -> bool) -> TakeWhile<'r, A, Range<A>>
fn skip<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(self, uint) -> Skip<Range<A>>
fn take<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(self, uint) -> Take<Range<A>>
fn scan<St, B>(self, St, |&mut St, A|: 'r -> Option<B>) -> Scan<'r, A, B, Range<A>, St>
fn flat_map<B, U: Iterator<B>>(self, |A|: 'r -> U) -> FlatMap<'r, A, Range<A>, U>
fn fuse<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(self) -> Fuse<Range<A>>
fn inspect<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(self, |&A|: 'r) -> Inspect<'r, A, Range<A>>
fn by_ref<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&'r mut self) -> ByRef<'r, Range<A>>
fn advance<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&mut self, |A| -> bool) -> bool
fn collect<B: FromIterator<A>>(&mut self) -> B
fn nth<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&mut self, uint) -> Option<A>
fn last<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&mut self) -> Option<A>
fn fold<B>(&mut self, B, |B, A| -> B) -> B
fn count<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&mut self) -> uint
fn all<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&mut self, |A| -> bool) -> bool
fn any<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&mut self, |A| -> bool) -> bool
fn find<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&mut self, |&A| -> bool) -> Option<A>
fn position<A: Add<A, A> + PartialOrd + Clone + ToPrimitive>(&mut self, |A| -> bool) -> Option<uint>
fn max_by<B: Ord>(&mut self, |&A| -> B) -> Option<A>
fn min_by<B: Ord>(&mut self, |&A| -> B) -> Option<A>
impl<A: Int + PartialOrd + Clone + ToPrimitive> DoubleEndedIterator<A> for Range<A>
Int is required to ensure the range will be the same regardless of
the direction it is consumed.