pub struct ChunkIter<'self, T> { priv v: &'self [T], priv size: uint, }
An iterator over a vector in (non-overlapping) chunks (size
elements at a time).
When the vector len is not evenly divided by the chunk size, the last slice of the iteration will be the remainder.
impl<'self, T: Clone> Clone for ChunkIter<'self, T>
fn clone(&self) -> ChunkIter<'self, T>
Returns a copy of the value. The contents of owned pointers are copied to maintain uniqueness, while the contents of managed pointers are not copied.
impl<'self, T> Iterator<&'self [T]> for ChunkIter<'self, T>
fn next(&mut self) -> Option<&'self [T]>
Advance the iterator and return the next value. Return None
when the end is reached.
fn size_hint(&self) -> (uint, Option<uint>)
Return a lower bound and upper bound on the remaining length of the iterator.
The common use case for the estimate is pre-allocating space to store the results.
impl<'self, T> DoubleEndedIterator<&'self [T]> for ChunkIter<'self, T>
fn next_back(&mut self) -> Option<&'self [T]>
Yield an element from the end of the range, returning None
if the range is empty.
impl<'self, T> RandomAccessIterator<&'self [T]> for ChunkIter<'self, T>
fn indexable(&self) -> uint
Return the number of indexable elements. At most std::uint::max_value
elements are indexable, even if the iterator represents a longer range.
fn idx(&self, index: uint) -> Option<&'self [T]>
Return an element at an index
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
).