fn next<'a>(&mut self) -> Option<char>

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

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

fn chain<U: Iterator<char>>(self, U) -> Chain<Decompositions<'a>, U>

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

fn map<B>(self, |char|: 'r -> B) -> Map<'r, char, B, Decompositions<'a>>

fn filter<'a>(self, |&char|: 'r -> bool) -> Filter<'r, char, Decompositions<'a>>

fn filter_map<B>(self, |char|: 'r -> Option<B>) -> FilterMap<'r, char, B, Decompositions<'a>>

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

fn peekable<'a>(self) -> Peekable<char, Decompositions<'a>>

fn skip_while<'a>(self, |&char|: 'r -> bool) -> SkipWhile<'r, char, Decompositions<'a>>

fn take_while<'a>(self, |&char|: 'r -> bool) -> TakeWhile<'r, char, Decompositions<'a>>

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

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

fn scan<St, B>(self, St, |&mut St, char|: 'r -> Option<B>) -> Scan<'r, char, B, Decompositions<'a>, St>

fn flat_map<B, U: Iterator<B>>(self, |char|: 'r -> U) -> FlatMap<'r, char, Decompositions<'a>, U>

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

fn inspect<'a>(self, |&char|: 'r) -> Inspect<'r, char, Decompositions<'a>>

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

fn advance<'a>(&mut self, |char| -> bool) -> bool

fn collect<B: FromIterator<char>>(&mut self) -> B

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

fn last<'a>(&mut self) -> Option<char>

fn fold<B>(&mut self, B, |B, char| -> B) -> B

fn count<'a>(&mut self) -> uint

fn all<'a>(&mut self, |char| -> bool) -> bool

fn any<'a>(&mut self, |char| -> bool) -> bool

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

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

fn max_by<B: Ord>(&mut self, |&char| -> B) -> Option<char>

fn min_by<B: Ord>(&mut self, |&char| -> B) -> Option<char>

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

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