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 | The current internal state to be passed to the closure next.
|
Trait Implementations
impl<'a, A, B, T: Iterator<A>, St> Iterator<B> for Scan<'a, A, B, T, St>
fn next(&mut self) -> Option<B>
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| -> B) -> Map<'r, B, B, Scan<'a, A, B, T, St>>
fn filter(self, |&B| -> bool) -> Filter<'r, B, Scan<'a, A, B, T, St>>
fn skip(self, uint) -> Skip<Scan<'a, A, B, T, St>>
fn take(self, uint) -> Take<Scan<'a, A, B, T, St>>
fn scan<St, B>(self, St, |&mut St, B| -> Option<B>) -> Scan<'r, B, B, Scan<'a, A, B, T, St>, St>
fn flat_map<B, U: Iterator<B>>(self, |B| -> U) -> FlatMap<'r, B, Scan<'a, A, B, T, St>, U>
fn fuse(self) -> Fuse<Scan<'a, A, B, T, St>>
fn inspect(self, |&B|) -> Inspect<'r, B, Scan<'a, A, B, T, St>>
fn by_ref(&'r mut self) -> ByRef<'r, Scan<'a, A, B, T, St>>
fn last(&mut self) -> Option<B>
fn fold<B>(&mut self, B, |B, B| -> B) -> B
fn all(&mut self, |B| -> bool) -> bool
fn any(&mut self, |B| -> bool) -> bool
fn find(&mut self, |&B| -> bool) -> Option<B>
fn max_by<B: Ord>(&mut self, |&B| -> B) -> Option<B>
fn min_by<B: Ord>(&mut self, |&B| -> B) -> Option<B>
Keyboard shortcuts
- ?
- Show this help dialog
- S
- Focus the search field
- ⇤
- Move up in search results
- ⇥
- Move down in search results
- ⏎
- Go to active search result
Search tricks
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, enum,
trait, typedef (or
tdef).