Struct std::iter::TakeWhile[src]
pub struct TakeWhile<'a, A, T> {
// some fields omitted
}An iterator which only accepts elements while predicate is true
pub struct TakeWhile<'a, A, T> {
// some fields omitted
}An iterator which only accepts elements while predicate is true
impl<'a, A, T: Iterator<A>> Iterator<A> for TakeWhile<'a, A, T>fn next<'a, A, T: Iterator<A>>(&mut self) -> Option<A>fn size_hint<'a, A, T: Iterator<A>>(&self) -> (uint, Option<uint>)fn size_hint<'a, A, T: Iterator<A>>(&self) -> (uint, Option<uint>)fn chain<U: Iterator<A>>(self, U) -> Chain<TakeWhile<'a, A, T>, U>fn zip<B, U: Iterator<B>>(self, U) -> Zip<TakeWhile<'a, A, T>, U>fn map<B>(self, |A|: 'r -> B) -> Map<'r, A, B, TakeWhile<'a, A, T>>fn filter<'a, A, T: Iterator<A>>(self, |&A|: 'r -> bool) -> Filter<'r, A, TakeWhile<'a, A, T>>fn filter_map<B>(self, |A|: 'r -> Option<B>) -> FilterMap<'r, A, B, TakeWhile<'a, A, T>>fn enumerate<'a, A, T: Iterator<A>>(self) -> Enumerate<TakeWhile<'a, A, T>>fn peekable<'a, A, T: Iterator<A>>(self) -> Peekable<A, TakeWhile<'a, A, T>>fn skip_while<'a, A, T: Iterator<A>>(self, |&A|: 'r -> bool) -> SkipWhile<'r, A, TakeWhile<'a, A, T>>fn take_while<'a, A, T: Iterator<A>>(self, |&A|: 'r -> bool) -> TakeWhile<'r, A, TakeWhile<'a, A, T>>fn skip<'a, A, T: Iterator<A>>(self, uint) -> Skip<TakeWhile<'a, A, T>>fn take<'a, A, T: Iterator<A>>(self, uint) -> Take<TakeWhile<'a, A, T>>fn scan<St, B>(self, St, |&mut St, A|: 'r -> Option<B>) -> Scan<'r, A, B, TakeWhile<'a, A, T>, St>fn flat_map<B, U: Iterator<B>>(self, |A|: 'r -> U) -> FlatMap<'r, A, TakeWhile<'a, A, T>, U>fn fuse<'a, A, T: Iterator<A>>(self) -> Fuse<TakeWhile<'a, A, T>>fn inspect<'a, A, T: Iterator<A>>(self, |&A|: 'r) -> Inspect<'r, A, TakeWhile<'a, A, T>>fn by_ref<'a, A, T: Iterator<A>>(&'r mut self) -> ByRef<'r, TakeWhile<'a, A, T>>fn advance<'a, A, T: Iterator<A>>(&mut self, |A| -> bool) -> boolfn collect<B: FromIterator<A>>(&mut self) -> Bfn nth<'a, A, T: Iterator<A>>(&mut self, uint) -> Option<A>fn last<'a, A, T: Iterator<A>>(&mut self) -> Option<A>fn fold<B>(&mut self, B, |B, A| -> B) -> Bfn count<'a, A, T: Iterator<A>>(&mut self) -> uintfn all<'a, A, T: Iterator<A>>(&mut self, |A| -> bool) -> boolfn any<'a, A, T: Iterator<A>>(&mut self, |A| -> bool) -> boolfn find<'a, A, T: Iterator<A>>(&mut self, |&A| -> bool) -> Option<A>fn position<'a, A, T: Iterator<A>>(&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>
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 (or str), enum,
trait, typedef (or
tdef).