Struct collections::str::GraphemeIndicesExperimental [-]  [+] [src]

pub struct GraphemeIndices<'a> {
    // some fields omitted
}

External iterator for grapheme clusters and byte offsets.

Trait Implementations

impl<'a> Iterator<(uint, &'a str)> for GraphemeIndices<'a>

fn next(&mut self) -> Option<(uint, &'a str)>

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

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

fn chain<U: Iterator<(uint, &'a str)>>(self, U) -> Chain<GraphemeIndices<'a>, U>

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

fn map<B>(self, |(uint, &'a str)| -> B) -> Map<'r, (uint, &'a str), B, GraphemeIndices<'a>>

fn filter(self, |&(uint, &'a str)| -> bool) -> Filter<'r, (uint, &'a str), GraphemeIndices<'a>>

fn filter_map<B>(self, |(uint, &'a str)| -> Option<B>) -> FilterMap<'r, (uint, &'a str), B, GraphemeIndices<'a>>

fn enumerate(self) -> Enumerate<GraphemeIndices<'a>>

fn peekable(self) -> Peekable<(uint, &'a str), GraphemeIndices<'a>>

fn skip_while(self, |&(uint, &'a str)| -> bool) -> SkipWhile<'r, (uint, &'a str), GraphemeIndices<'a>>

fn take_while(self, |&(uint, &'a str)| -> bool) -> TakeWhile<'r, (uint, &'a str), GraphemeIndices<'a>>

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

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

fn scan<St, B>(self, St, |&mut St, (uint, &'a str)| -> Option<B>) -> Scan<'r, (uint, &'a str), B, GraphemeIndices<'a>, St>

fn flat_map<B, U: Iterator<B>>(self, |(uint, &'a str)| -> U) -> FlatMap<'r, (uint, &'a str), GraphemeIndices<'a>, U>

fn fuse(self) -> Fuse<GraphemeIndices<'a>>

fn inspect(self, |&(uint, &'a str)|) -> Inspect<'r, (uint, &'a str), GraphemeIndices<'a>>

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

fn collect<B: FromIterator<(uint, &'a str)>>(&mut self) -> B

fn nth(&mut self, uint) -> Option<(uint, &'a str)>

fn last(&mut self) -> Option<(uint, &'a str)>

fn fold<B>(&mut self, B, |B, (uint, &'a str)| -> B) -> B

fn count(&mut self) -> uint

fn all(&mut self, |(uint, &'a str)| -> bool) -> bool

fn any(&mut self, |(uint, &'a str)| -> bool) -> bool

fn find(&mut self, |&(uint, &'a str)| -> bool) -> Option<(uint, &'a str)>

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

fn max_by<B: Ord>(&mut self, |&(uint, &'a str)| -> B) -> Option<(uint, &'a str)>

fn min_by<B: Ord>(&mut self, |&(uint, &'a str)| -> B) -> Option<(uint, &'a str)>

impl<'a> DoubleEndedIterator<(uint, &'a str)> for GraphemeIndices<'a>

fn next_back(&mut self) -> Option<(uint, &'a str)>

fn rev(self) -> Rev<GraphemeIndices<'a>>

Derived Implementations

impl<'a> Clone for GraphemeIndices<'a>

fn clone(&self) -> GraphemeIndices<'a>

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