Trait std::iter::RandomAccessIterator [src]

pub trait RandomAccessIterator<A>: Iterator<A> {
    fn indexable<A>(&self) -> uint;
    fn idx<A>(&mut self, index: uint) -> Option<A>;
}

An object implementing random access indexing by uint

A RandomAccessIterator should be either infinite or a DoubleEndedIterator.

Required Methods

`fn indexable<A>(&self) -> uint`

Return the number of indexable elements. At most std::uint::MAX elements are indexable, even if the iterator represents a longer range.

`fn idx<A>(&mut self, index: uint) -> Option<A>`

Return an element at an index

Implementors

impl<A, T: DoubleEndedIterator<A> + RandomAccessIterator<A>> RandomAccessIterator<A> for Rev<T>
impl<A, T: Clone + RandomAccessIterator<A>> RandomAccessIterator<A> for Cycle<T>
impl<A, T: RandomAccessIterator<A>, U: RandomAccessIterator<A>> RandomAccessIterator<A> for Chain<T, U>
impl<A, B, T: RandomAccessIterator<A>, U: RandomAccessIterator<B>> RandomAccessIterator<(A, B)> for Zip<T, U>
impl<'a, A, B, T: RandomAccessIterator<A>> RandomAccessIterator<B> for Map<'a, A, B, T>
impl<A, T: RandomAccessIterator<A>> RandomAccessIterator<(uint, A)> for Enumerate<T>
impl<A, T: RandomAccessIterator<A>> RandomAccessIterator<A> for Skip<T>
impl<A, T: RandomAccessIterator<A>> RandomAccessIterator<A> for Take<T>
impl<A, T: RandomAccessIterator<A>> RandomAccessIterator<A> for Fuse<T>
impl<'a, A, T: RandomAccessIterator<A>> RandomAccessIterator<A> for Inspect<'a, A, T>
impl<A: Clone> RandomAccessIterator<A> for Repeat<A>
impl<'a, T> RandomAccessIterator<&'a [T]> for Chunks<'a, T>
impl<'a, T> RandomAccessIterator<&'a T> for Items<'a, T>
impl<'a> RandomAccessIterator<bool> for Bits<'a>
impl<'a, T> RandomAccessIterator<&'a T> for Items<'a, T>