std​::iter

Modules

order

Structs

ByRefChainCounterCycleEnumerateFilterFilterMapFlatMapFuseInspectMapPeekableRangeRangeInclusiveRangeStepRangeStepInclusiveRepeatRevScanSkipSkipWhileTakeTakeWhileUnfoldZip

Traits

AdditiveIteratorCloneableIteratorDoubleEndedIteratorExactSizeExtendableFromIteratorIteratorMultiplicativeIteratorMutableDoubleEndedIteratorOrdIteratorRandomAccessIterator

Functions

countrangerange_inclusiverange_steprange_step_inclusive

Struct std::iter::Repeat[src]

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

An iterator that repeats an element endlessly

Methods

impl<A: Clone> Repeat<A>

fn new<A: Clone>(elt: A) -> Repeat<A>

Create a new Repeat that endlessly repeats the element elt.

Trait Implementations

impl<A: Clone> Iterator<A> for Repeat<A>

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

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

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

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

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

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

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

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

fn enumerate<A: Clone>(self) -> Enumerate<Repeat<A>>

fn peekable<A: Clone>(self) -> Peekable<A, Repeat<A>>

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

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

fn skip<A: Clone>(self, uint) -> Skip<Repeat<A>>

fn take<A: Clone>(self, uint) -> Take<Repeat<A>>

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

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

fn fuse<A: Clone>(self) -> Fuse<Repeat<A>>

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

fn by_ref<A: Clone>(&'r mut self) -> ByRef<'r, Repeat<A>>

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

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

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

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

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

fn count<A: Clone>(&mut self) -> uint

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

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

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

fn position<A: 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> DoubleEndedIterator<A> for Repeat<A>

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

fn rev<A: Clone>(self) -> Rev<Repeat<A>>

impl<A: Clone> RandomAccessIterator<A> for Repeat<A>

fn indexable<A: Clone>(&self) -> uint

fn idx<A: Clone>(&mut self, uint) -> Option<A>

Derived Implementations

impl<A: Clone> Clone for Repeat<A>

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

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