std​::iter

Modules

order

Structs

ByRefChainCounterCycleEnumerateFilterFilterMapFlatMapFuseInspectMapPeekableRangeRangeInclusiveRangeStepRangeStepInclusiveRepeatRevScanSkipSkipWhileTakeTakeWhileUnfoldZip

Traits

AdditiveIteratorCloneableIteratorDoubleEndedIteratorExactSizeExtendableFromIteratorIteratorMultiplicativeIteratorMutableDoubleEndedIteratorOrdIteratorRandomAccessIterator

Functions

countrangerange_inclusiverange_steprange_step_inclusive

Struct std::iter::Scan[src]

pub struct Scan<'a, A, B, T, St> {
    pub state: St,
    // some fields omitted
}

An iterator to maintain state while iterating another iterator

Fields

state

Trait Implementations

impl<'a, A, B, T: Iterator<A>, St> Iterator<B> for Scan<'a, A, B, T, St>

fn next<'a, A, B, T: Iterator<A>, St>(&mut self) -> Option<B>

fn size_hint<'a, A, B, T: Iterator<A>, St>(&self) -> (uint, Option<uint>)

fn size_hint<'a, A, B, T: Iterator<A>, St>(&self) -> (uint, Option<uint>)

fn chain<U: Iterator<B>>(self, U) -> Chain<Scan<'a, A, B, T, St>, U>

fn zip<B, U: Iterator<B>>(self, U) -> Zip<Scan<'a, A, B, T, St>, U>

fn map<B>(self, |B|: 'r -> B) -> Map<'r, B, B, Scan<'a, A, B, T, St>>

fn filter<'a, A, B, T: Iterator<A>, St>(self, |&B|: 'r -> bool) -> Filter<'r, B, Scan<'a, A, B, T, St>>

fn filter_map<B>(self, |B|: 'r -> Option<B>) -> FilterMap<'r, B, B, Scan<'a, A, B, T, St>>

fn enumerate<'a, A, B, T: Iterator<A>, St>(self) -> Enumerate<Scan<'a, A, B, T, St>>

fn peekable<'a, A, B, T: Iterator<A>, St>(self) -> Peekable<B, Scan<'a, A, B, T, St>>

fn skip_while<'a, A, B, T: Iterator<A>, St>(self, |&B|: 'r -> bool) -> SkipWhile<'r, B, Scan<'a, A, B, T, St>>

fn take_while<'a, A, B, T: Iterator<A>, St>(self, |&B|: 'r -> bool) -> TakeWhile<'r, B, Scan<'a, A, B, T, St>>

fn skip<'a, A, B, T: Iterator<A>, St>(self, uint) -> Skip<Scan<'a, A, B, T, St>>

fn take<'a, A, B, T: Iterator<A>, St>(self, uint) -> Take<Scan<'a, A, B, T, St>>

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

fn flat_map<B, U: Iterator<B>>(self, |B|: 'r -> U) -> FlatMap<'r, B, Scan<'a, A, B, T, St>, U>

fn fuse<'a, A, B, T: Iterator<A>, St>(self) -> Fuse<Scan<'a, A, B, T, St>>

fn inspect<'a, A, B, T: Iterator<A>, St>(self, |&B|: 'r) -> Inspect<'r, B, Scan<'a, A, B, T, St>>

fn by_ref<'a, A, B, T: Iterator<A>, St>(&'r mut self) -> ByRef<'r, Scan<'a, A, B, T, St>>

fn advance<'a, A, B, T: Iterator<A>, St>(&mut self, |B| -> bool) -> bool

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

fn nth<'a, A, B, T: Iterator<A>, St>(&mut self, uint) -> Option<B>

fn last<'a, A, B, T: Iterator<A>, St>(&mut self) -> Option<B>

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

fn count<'a, A, B, T: Iterator<A>, St>(&mut self) -> uint

fn all<'a, A, B, T: Iterator<A>, St>(&mut self, |B| -> bool) -> bool

fn any<'a, A, B, T: Iterator<A>, St>(&mut self, |B| -> bool) -> bool

fn find<'a, A, B, T: Iterator<A>, St>(&mut self, |&B| -> bool) -> Option<B>

fn position<'a, A, B, T: Iterator<A>, St>(&mut self, |B| -> bool) -> Option<uint>

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

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