pub trait DoubleEndedIterator<A>: Iterator<A> { fn next_back(&mut self) -> Option<A>; fn invert(self) -> Invert<Self> { ... } }
A range iterator able to yield elements from both ends
fn next_back(&mut self) -> Option<A>
Yield an element from the end of the range, returning None
if the range is empty.
fn invert(self) -> Invert<Self>
Flip the direction of the iterator
The inverted iterator flips the ends on an iterator that can already be iterated from the front and from the back.
If the iterator also implements RandomAccessIterator, the inverted iterator is also random access, with the indices starting at the back of the original iterator.
Note: Random access with inverted indices still only applies to the first
uint::max_value
elements of the original iterator.
OptionIterator<A>
Repeat<A>
RangeInclusive<A>
Range<A>
Inspect<'self, A, T>
Fuse<T>
FlatMap<'self, A, T, U>
Enumerate<T>
FilterMap<'self, A, B, T>
Filter<'self, A, T>
Map<'self, A, B, T>
Zip<T, U>
Chain<T, U>
Invert<T>
CharSplitIterator<'self, Sep>
CharOffsetIterator<'self>
CharIterator<'self>
VecMutIterator<'self, T>
VecIterator<'self, T>
ChunkIter<'self, T>
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
).