Struct `Decomposition`

struct Decomposition<'data, I> { ... }
where
    I: Iterator<Item = char>

An iterator adaptor that turns an Iterator over char into a lazily-decomposed char sequence.

Implementations

`impl<'data, I> Debug for Decomposition<'data, I>`

fn fmt(self: &Self, f: &mut Formatter<'_>) -> Result

`impl<'data, I> Freeze for Decomposition<'data, I>`

`impl<'data, I> RefUnwindSafe for Decomposition<'data, I>`

`impl<'data, I> Send for Decomposition<'data, I>`

`impl<'data, I> Sync for Decomposition<'data, I>`

`impl<'data, I> Unpin for Decomposition<'data, I>`

`impl<'data, I> UnsafeUnpin for Decomposition<'data, I>`

`impl<'data, I> UnwindSafe for Decomposition<'data, I>`

`impl<I> IntoIterator for Decomposition<'data, I>`

fn into_iter(self: Self) -> I

`impl<I> Iterator for Decomposition<'_, I>`

fn next(self: &mut Self) -> Option<char>

`impl<T> Any for Decomposition<'data, I>`

fn type_id(self: &Self) -> TypeId

`impl<T> Borrow for Decomposition<'data, I>`

fn borrow(self: &Self) -> &T

`impl<T> BorrowMut for Decomposition<'data, I>`

fn borrow_mut(self: &mut Self) -> &mut T

`impl<T> ErasedDestructor for Decomposition<'data, I>`

`impl<T> From for Decomposition<'data, I>`

fn from(t: T) -> T: Returns the argument unchanged.

`impl<T, U> Into for Decomposition<'data, I>`

fn into(self: Self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

`impl<T, U> TryFrom for Decomposition<'data, I>`

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

`impl<T, U> TryInto for Decomposition<'data, I>`

fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>