Struct std::iter::RangeInclusive

pub struct RangeInclusive<A> {
    priv range: Range<A>,
    priv done: bool,
}

An iterator over the range [start, stop]

Trait Implementations

impl<A: Clone> Clone for RangeInclusive<A>

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

Returns a copy of the value. The contents of owned pointers are copied to maintain uniqueness, while the contents of managed pointers are not copied.

impl<A: DeepClone> DeepClone for RangeInclusive<A>

fn deep_clone(&self) -> RangeInclusive<A>

Return a deep copy of the value. Unlike Clone, the contents of shared pointer types are copied.

impl<A: Add<A, A> + Eq + Ord + Clone> Iterator<A> for RangeInclusive<A>

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

Advance the iterator and return the next value. Return None when the end is reached.

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

Return a lower bound and upper bound on the remaining length of the iterator.

The common use case for the estimate is pre-allocating space to store the results.

impl<A: Sub<A, A> + Integer + Ord + Clone> DoubleEndedIterator<A> for RangeInclusive<A>

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

Yield an element from the end of the range, returning None if the range is empty.