Struct num::iter::RangeStepInclusiveExperimental

pub struct RangeStepInclusive<A> {
    // some fields omitted
}

An iterator over the range [start, stop] by step. It handles overflow by stopping.

Trait Implementations

impl<A: CheckedAdd + PartialOrd + Clone + PartialEq> Iterator<A> for RangeStepInclusive<A>

fn next(&mut self) -> Option<A>

fn size_hint(&self) -> (uint, Option<uint>)

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

fn zip<B, U: Iterator<B>>(self, other: U) -> Zip<Self, U>

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

fn filter(self, predicate: |&A| -> bool) -> Filter<'r, A, Self>

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

fn enumerate(self) -> Enumerate<Self>

fn peekable(self) -> Peekable<A, Self>

fn skip_while(self, predicate: |&A| -> bool) -> SkipWhile<'r, A, Self>

fn take_while(self, predicate: |&A| -> bool) -> TakeWhile<'r, A, Self>

fn skip(self, n: uint) -> Skip<Self>

fn take(self, n: uint) -> Take<Self>

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

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

fn fuse(self) -> Fuse<Self>

fn inspect(self, f: |&A|) -> Inspect<'r, A, Self>

fn by_ref(&'r mut self) -> ByRef<'r, Self>

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

fn nth(&mut self, n: uint) -> Option<A>

fn last(&mut self) -> Option<A>

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

fn count(&mut self) -> uint

fn all(&mut self, f: |A| -> bool) -> bool

fn any(&mut self, f: |A| -> bool) -> bool

fn find(&mut self, predicate: |&A| -> bool) -> Option<A>

fn position(&mut self, predicate: |A| -> bool) -> Option<uint>

fn max_by<B: Ord>(&mut self, f: |&A| -> B) -> Option<A>

fn min_by<B: Ord>(&mut self, f: |&A| -> B) -> Option<A>

Derived Implementations

impl<A: Clone> Clone for RangeStepInclusive<A>

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

fn clone_from(&mut self, source: &Self)