Struct collections::std::ops::Range [−] [src]

pub struct Range<Idx> {
    pub start: Idx,
    pub end: Idx,
}

A (half-open) range which is bounded at both ends.

Fields

start

The lower bound of the range (inclusive).

end

The upper bound of the range (exclusive).

Methods

impl<A> Range<A> where A: Step

fn step_by(self, by: A) -> StepBy<A, Range<A>>

Unstable (step_by #27741)

: recent addition

Creates an iterator with the same range, but stepping by the given amount at each iteration.

The resulting iterator handles overflow by stopping.

Examples

#![feature(step_by)] fn main() { for i in (0..10).step_by(2) { println!("{}", i); } }
#![feature(step_by)]

for i in (0..10).step_by(2) {
    println!("{}", i);
}

This prints:

0
2
4
6
8

Trait Implementations

impl<Idx> Debug for Range<Idx> where Idx: Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

impl<A> Iterator for Range<A> where A: One + Step, &'a A: Add<&'a A>, &'a A::Output == A

type Item = A

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

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

fn count(self) -> usize

fn last(self) -> Option<Self::Item>

fn nth(&mut self, n: usize) -> Option<Self::Item>

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

fn enumerate(self) -> Enumerate<Self>

fn peekable(self) -> Peekable<Self>

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

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

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

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U

fn fuse(self) -> Fuse<Self>

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

fn by_ref(&mut self) -> &mut Self

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

fn partition<B, F>(self, f: F) -> (B, B) where B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

fn max(self) -> Option<Self::Item> where Self::Item: Ord

fn min(self) -> Option<Self::Item> where Self::Item: Ord

fn max_by<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

fn min_by<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where Self: Iterator<Item=(A, B)>, FromB: Default + Extend<B>, FromA: Default + Extend<A>

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

fn cycle(self) -> Cycle<Self> where Self: Clone

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

impl ExactSizeIterator for Range<usize>

fn len(&self) -> usize

impl ExactSizeIterator for Range<u8>

fn len(&self) -> usize

impl ExactSizeIterator for Range<u16>

fn len(&self) -> usize

impl ExactSizeIterator for Range<u32>

fn len(&self) -> usize

impl ExactSizeIterator for Range<isize>

fn len(&self) -> usize

impl ExactSizeIterator for Range<i8>

fn len(&self) -> usize

impl ExactSizeIterator for Range<i16>

fn len(&self) -> usize

impl ExactSizeIterator for Range<i32>

fn len(&self) -> usize

impl<A> DoubleEndedIterator for Range<A> where A: Clone + Step + One, &'a A: Add<&'a A>, &'a A: Sub<&'a A>, &'a A::Output == A, &'a A::Output == A

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

impl<T> RangeArgument<T> for Range<T>

fn start(&self) -> Option<&T>

fn end(&self) -> Option<&T>

Derived Implementations

impl<Idx> Eq for Range<Idx> where Idx: Eq

fn assert_receiver_is_total_eq(&self)

impl<Idx> PartialEq<Range<Idx>> for Range<Idx> where Idx: PartialEq<Idx>

fn eq(&self, __arg_0: &Range<Idx>) -> bool

fn ne(&self, __arg_0: &Range<Idx>) -> bool

impl<Idx> Clone for Range<Idx> where Idx: Clone

fn clone(&self) -> Range<Idx>

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