fn next<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&mut self) -> Option<A>

fn size_hint<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&self) -> (uint, Option<uint>)

fn chain<U: Iterator<A>>(self, U) -> Chain<RangeStepInclusive<A>, U>

fn zip<B, U: Iterator<B>>(self, U) -> Zip<RangeStepInclusive<A>, U>

fn map<B>(self, |A|: 'r -> B) -> Map<'r, A, B, RangeStepInclusive<A>>

fn filter<A: CheckedAdd + PartialOrd + Clone + PartialEq>(self, |&A|: 'r -> bool) -> Filter<'r, A, RangeStepInclusive<A>>

fn filter_map<B>(self, |A|: 'r -> Option<B>) -> FilterMap<'r, A, B, RangeStepInclusive<A>>

fn enumerate<A: CheckedAdd + PartialOrd + Clone + PartialEq>(self) -> Enumerate<RangeStepInclusive<A>>

fn peekable<A: CheckedAdd + PartialOrd + Clone + PartialEq>(self) -> Peekable<A, RangeStepInclusive<A>>

fn skip_while<A: CheckedAdd + PartialOrd + Clone + PartialEq>(self, |&A|: 'r -> bool) -> SkipWhile<'r, A, RangeStepInclusive<A>>

fn take_while<A: CheckedAdd + PartialOrd + Clone + PartialEq>(self, |&A|: 'r -> bool) -> TakeWhile<'r, A, RangeStepInclusive<A>>

fn skip<A: CheckedAdd + PartialOrd + Clone + PartialEq>(self, uint) -> Skip<RangeStepInclusive<A>>

fn take<A: CheckedAdd + PartialOrd + Clone + PartialEq>(self, uint) -> Take<RangeStepInclusive<A>>

fn scan<St, B>(self, St, |&mut St, A|: 'r -> Option<B>) -> Scan<'r, A, B, RangeStepInclusive<A>, St>

fn flat_map<B, U: Iterator<B>>(self, |A|: 'r -> U) -> FlatMap<'r, A, RangeStepInclusive<A>, U>

fn fuse<A: CheckedAdd + PartialOrd + Clone + PartialEq>(self) -> Fuse<RangeStepInclusive<A>>

fn inspect<A: CheckedAdd + PartialOrd + Clone + PartialEq>(self, |&A|: 'r) -> Inspect<'r, A, RangeStepInclusive<A>>

fn by_ref<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&'r mut self) -> ByRef<'r, RangeStepInclusive<A>>

fn advance<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&mut self, |A| -> bool) -> bool

fn collect<B: FromIterator<A>>(&mut self) -> B

fn nth<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&mut self, uint) -> Option<A>

fn last<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&mut self) -> Option<A>

fn fold<B>(&mut self, B, |B, A| -> B) -> B

fn count<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&mut self) -> uint

fn all<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&mut self, |A| -> bool) -> bool

fn any<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&mut self, |A| -> bool) -> bool

fn find<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&mut self, |&A| -> bool) -> Option<A>

fn position<A: CheckedAdd + PartialOrd + Clone + PartialEq>(&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>

fn clone<A: Clone>(&self) -> RangeStepInclusive<A>

fn clone_from<A: Clone>(&mut self, &RangeStepInclusive<A>)