pub struct Cycle<T> { priv orig: T, priv iter: T, }
An iterator that repeats endlessly
impl<T: Clone> Clone for Cycle<T>
fn clone(&self) -> Cycle<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<A, T: Clone + Iterator<A>> Iterator<A> for Cycle<T>
fn next(&mut self) -> Option<A>
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<A, T: Clone + RandomAccessIterator<A>> RandomAccessIterator<A> for Cycle<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<A>
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
).