Struct std::iter::RangeStep[src]
pub struct RangeStep<A> {
// some fields omitted
}An iterator over the range [start, stop) by step. It handles overflow by stopping.
pub struct RangeStep<A> {
// some fields omitted
}An iterator over the range [start, stop) by step. It handles overflow by stopping.
impl<A: CheckedAdd + PartialOrd + Clone> Iterator<A> for RangeStep<A>fn next<A: CheckedAdd + PartialOrd + Clone>(&mut self) -> Option<A>fn size_hint<A: CheckedAdd + PartialOrd + Clone>(&self) -> (uint, Option<uint>)fn chain<U: Iterator<A>>(self, U) -> Chain<RangeStep<A>, U>fn zip<B, U: Iterator<B>>(self, U) -> Zip<RangeStep<A>, U>fn map<B>(self, |A|: 'r -> B) -> Map<'r, A, B, RangeStep<A>>fn filter<A: CheckedAdd + PartialOrd + Clone>(self, |&A|: 'r -> bool) -> Filter<'r, A, RangeStep<A>>fn filter_map<B>(self, |A|: 'r -> Option<B>) -> FilterMap<'r, A, B, RangeStep<A>>fn enumerate<A: CheckedAdd + PartialOrd + Clone>(self) -> Enumerate<RangeStep<A>>fn peekable<A: CheckedAdd + PartialOrd + Clone>(self) -> Peekable<A, RangeStep<A>>fn skip_while<A: CheckedAdd + PartialOrd + Clone>(self, |&A|: 'r -> bool) -> SkipWhile<'r, A, RangeStep<A>>fn take_while<A: CheckedAdd + PartialOrd + Clone>(self, |&A|: 'r -> bool) -> TakeWhile<'r, A, RangeStep<A>>fn skip<A: CheckedAdd + PartialOrd + Clone>(self, uint) -> Skip<RangeStep<A>>fn take<A: CheckedAdd + PartialOrd + Clone>(self, uint) -> Take<RangeStep<A>>fn scan<St, B>(self, St, |&mut St, A|: 'r -> Option<B>) -> Scan<'r, A, B, RangeStep<A>, St>fn flat_map<B, U: Iterator<B>>(self, |A|: 'r -> U) -> FlatMap<'r, A, RangeStep<A>, U>fn fuse<A: CheckedAdd + PartialOrd + Clone>(self) -> Fuse<RangeStep<A>>fn inspect<A: CheckedAdd + PartialOrd + Clone>(self, |&A|: 'r) -> Inspect<'r, A, RangeStep<A>>fn by_ref<A: CheckedAdd + PartialOrd + Clone>(&'r mut self) -> ByRef<'r, RangeStep<A>>fn advance<A: CheckedAdd + PartialOrd + Clone>(&mut self, |A| -> bool) -> boolfn collect<B: FromIterator<A>>(&mut self) -> Bfn nth<A: CheckedAdd + PartialOrd + Clone>(&mut self, uint) -> Option<A>fn last<A: CheckedAdd + PartialOrd + Clone>(&mut self) -> Option<A>fn fold<B>(&mut self, B, |B, A| -> B) -> Bfn count<A: CheckedAdd + PartialOrd + Clone>(&mut self) -> uintfn all<A: CheckedAdd + PartialOrd + Clone>(&mut self, |A| -> bool) -> boolfn any<A: CheckedAdd + PartialOrd + Clone>(&mut self, |A| -> bool) -> boolfn find<A: CheckedAdd + PartialOrd + Clone>(&mut self, |&A| -> bool) -> Option<A>fn position<A: CheckedAdd + PartialOrd + Clone>(&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: Clone> Clone for RangeStep<A>
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct (or str), enum,
trait, typedef (or
tdef).