Struct collections::slice::ChunksExperimental [-]  [+] [src]

pub struct Chunks<'a, T: 'a> {
    // some fields omitted
}

An iterator over a slice in (non-overlapping) chunks (size elements at a time).

When the slice len is not evenly divided by the chunk size, the last slice of the iteration will be the remainder.

Trait Implementations

impl<'a, T> Iterator<&'a [T]> for Chunks<'a, T>

fn next(&mut self) -> Option<&'a [T]>

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

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

fn chain<U: Iterator<&'a [T]>>(self, U) -> Chain<Chunks<'a, T>, U>

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

fn map<B>(self, |&'a [T]| -> B) -> Map<'r, &'a [T], B, Chunks<'a, T>>

fn filter(self, |&&'a [T]| -> bool) -> Filter<'r, &'a [T], Chunks<'a, T>>

fn filter_map<B>(self, |&'a [T]| -> Option<B>) -> FilterMap<'r, &'a [T], B, Chunks<'a, T>>

fn enumerate(self) -> Enumerate<Chunks<'a, T>>

fn peekable(self) -> Peekable<&'a [T], Chunks<'a, T>>

fn skip_while(self, |&&'a [T]| -> bool) -> SkipWhile<'r, &'a [T], Chunks<'a, T>>

fn take_while(self, |&&'a [T]| -> bool) -> TakeWhile<'r, &'a [T], Chunks<'a, T>>

fn skip(self, uint) -> Skip<Chunks<'a, T>>

fn take(self, uint) -> Take<Chunks<'a, T>>

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

fn flat_map<B, U: Iterator<B>>(self, |&'a [T]| -> U) -> FlatMap<'r, &'a [T], Chunks<'a, T>, U>

fn fuse(self) -> Fuse<Chunks<'a, T>>

fn inspect(self, |&&'a [T]|) -> Inspect<'r, &'a [T], Chunks<'a, T>>

fn by_ref(&'r mut self) -> ByRef<'r, Chunks<'a, T>>

fn collect<B: FromIterator<&'a [T]>>(&mut self) -> B

fn nth(&mut self, uint) -> Option<&'a [T]>

fn last(&mut self) -> Option<&'a [T]>

fn fold<B>(&mut self, B, |B, &'a [T]| -> B) -> B

fn count(&mut self) -> uint

fn all(&mut self, |&'a [T]| -> bool) -> bool

fn any(&mut self, |&'a [T]| -> bool) -> bool

fn find(&mut self, |&&'a [T]| -> bool) -> Option<&'a [T]>

fn position(&mut self, |&'a [T]| -> bool) -> Option<uint>

fn max_by<B: Ord>(&mut self, |&&'a [T]| -> B) -> Option<&'a [T]>

fn min_by<B: Ord>(&mut self, |&&'a [T]| -> B) -> Option<&'a [T]>

impl<'a, T> DoubleEndedIterator<&'a [T]> for Chunks<'a, T>

fn next_back(&mut self) -> Option<&'a [T]>

fn rev(self) -> Rev<Chunks<'a, T>>

impl<'a, T> RandomAccessIterator<&'a [T]> for Chunks<'a, T>

fn indexable(&self) -> uint

fn idx(&mut self, index: uint) -> Option<&'a [T]>

Derived Implementations

impl<'a, T: Clone + 'a> Clone for Chunks<'a, T>

fn clone(&self) -> Chunks<'a, T>

fn clone_from(&mut self, &Chunks<'a, T>)