Enum unicode_types::deseret::Deseret

pub enum Deseret {
    CapitalLetterLongI,
    CapitalLetterLongE,
    CapitalLetterLongA,
    CapitalLetterLongAh,
    CapitalLetterLongO,
    CapitalLetterLongOo,
    CapitalLetterShortI,
    CapitalLetterShortE,
    CapitalLetterShortA,
    CapitalLetterShortAh,
    CapitalLetterShortO,
    CapitalLetterShortOo,
    CapitalLetterAy,
    CapitalLetterOw,
    CapitalLetterWu,
    CapitalLetterYee,
    CapitalLetterH,
    CapitalLetterPee,
    CapitalLetterBee,
    CapitalLetterTee,
    CapitalLetterDee,
    CapitalLetterChee,
    CapitalLetterJee,
    CapitalLetterKay,
    CapitalLetterGay,
    CapitalLetterEf,
    CapitalLetterVee,
    CapitalLetterEth,
    CapitalLetterThee,
    CapitalLetterEs,
    CapitalLetterZee,
    CapitalLetterEsh,
    CapitalLetterZhee,
    CapitalLetterEr,
    CapitalLetterEl,
    CapitalLetterEm,
    CapitalLetterEn,
    CapitalLetterEng,
    CapitalLetterOi,
    CapitalLetterEw,
    SmallLetterLongI,
    SmallLetterLongE,
    SmallLetterLongA,
    SmallLetterLongAh,
    SmallLetterLongO,
    SmallLetterLongOo,
    SmallLetterShortI,
    SmallLetterShortE,
    SmallLetterShortA,
    SmallLetterShortAh,
    SmallLetterShortO,
    SmallLetterShortOo,
    SmallLetterAy,
    SmallLetterOw,
    SmallLetterWu,
    SmallLetterYee,
    SmallLetterH,
    SmallLetterPee,
    SmallLetterBee,
    SmallLetterTee,
    SmallLetterDee,
    SmallLetterChee,
    SmallLetterJee,
    SmallLetterKay,
    SmallLetterGay,
    SmallLetterEf,
    SmallLetterVee,
    SmallLetterEth,
    SmallLetterThee,
    SmallLetterEs,
    SmallLetterZee,
    SmallLetterEsh,
    SmallLetterZhee,
    SmallLetterEr,
    SmallLetterEl,
    SmallLetterEm,
    SmallLetterEn,
    SmallLetterEng,
    SmallLetterOi,
}

An enum to represent all characters in the Deseret block.

Variants

CapitalLetterLongI

\u{10400}: '𐐀'

CapitalLetterLongE

\u{10401}: '𐐁'

CapitalLetterLongA

\u{10402}: '𐐂'

CapitalLetterLongAh

\u{10403}: '𐐃'

CapitalLetterLongO

\u{10404}: '𐐄'

CapitalLetterLongOo

\u{10405}: '𐐅'

CapitalLetterShortI

\u{10406}: '𐐆'

CapitalLetterShortE

\u{10407}: '𐐇'

CapitalLetterShortA

\u{10408}: '𐐈'

CapitalLetterShortAh

\u{10409}: '𐐉'

CapitalLetterShortO

\u{1040a}: '𐐊'

CapitalLetterShortOo

\u{1040b}: '𐐋'

CapitalLetterAy

\u{1040c}: '𐐌'

CapitalLetterOw

\u{1040d}: '𐐍'

CapitalLetterWu

\u{1040e}: '𐐎'

CapitalLetterYee

\u{1040f}: '𐐏'

CapitalLetterH

\u{10410}: '𐐐'

CapitalLetterPee

\u{10411}: '𐐑'

CapitalLetterBee

\u{10412}: '𐐒'

CapitalLetterTee

\u{10413}: '𐐓'

CapitalLetterDee

\u{10414}: '𐐔'

CapitalLetterChee

\u{10415}: '𐐕'

CapitalLetterJee

\u{10416}: '𐐖'

CapitalLetterKay

\u{10417}: '𐐗'

CapitalLetterGay

\u{10418}: '𐐘'

CapitalLetterEf

\u{10419}: '𐐙'

CapitalLetterVee

\u{1041a}: '𐐚'

CapitalLetterEth

\u{1041b}: '𐐛'

CapitalLetterThee

\u{1041c}: '𐐜'

CapitalLetterEs

\u{1041d}: '𐐝'

CapitalLetterZee

\u{1041e}: '𐐞'

CapitalLetterEsh

\u{1041f}: '𐐟'

CapitalLetterZhee

\u{10420}: '𐐠'

CapitalLetterEr

\u{10421}: '𐐡'

CapitalLetterEl

\u{10422}: '𐐢'

CapitalLetterEm

\u{10423}: '𐐣'

CapitalLetterEn

\u{10424}: '𐐤'

CapitalLetterEng

\u{10425}: '𐐥'

CapitalLetterOi

\u{10426}: '𐐦'

CapitalLetterEw

\u{10427}: '𐐧'

SmallLetterLongI

\u{10428}: '𐐨'

SmallLetterLongE

\u{10429}: '𐐩'

SmallLetterLongA

\u{1042a}: '𐐪'

SmallLetterLongAh

\u{1042b}: '𐐫'

SmallLetterLongO

\u{1042c}: '𐐬'

SmallLetterLongOo

\u{1042d}: '𐐭'

SmallLetterShortI

\u{1042e}: '𐐮'

SmallLetterShortE

\u{1042f}: '𐐯'

SmallLetterShortA

\u{10430}: '𐐰'

SmallLetterShortAh

\u{10431}: '𐐱'

SmallLetterShortO

\u{10432}: '𐐲'

SmallLetterShortOo

\u{10433}: '𐐳'

SmallLetterAy

\u{10434}: '𐐴'

SmallLetterOw

\u{10435}: '𐐵'

SmallLetterWu

\u{10436}: '𐐶'

SmallLetterYee

\u{10437}: '𐐷'

SmallLetterH

\u{10438}: '𐐸'

SmallLetterPee

\u{10439}: '𐐹'

SmallLetterBee

\u{1043a}: '𐐺'

SmallLetterTee

\u{1043b}: '𐐻'

SmallLetterDee

\u{1043c}: '𐐼'

SmallLetterChee

\u{1043d}: '𐐽'

SmallLetterJee

\u{1043e}: '𐐾'

SmallLetterKay

\u{1043f}: '𐐿'

SmallLetterGay

\u{10440}: '𐑀'

SmallLetterEf

\u{10441}: '𐑁'

SmallLetterVee

\u{10442}: '𐑂'

SmallLetterEth

\u{10443}: '𐑃'

SmallLetterThee

\u{10444}: '𐑄'

SmallLetterEs

\u{10445}: '𐑅'

SmallLetterZee

\u{10446}: '𐑆'

SmallLetterEsh

\u{10447}: '𐑇'

SmallLetterZhee

\u{10448}: '𐑈'

SmallLetterEr

\u{10449}: '𐑉'

SmallLetterEl

\u{1044a}: '𐑊'

SmallLetterEm

\u{1044b}: '𐑋'

SmallLetterEn

\u{1044c}: '𐑌'

SmallLetterEng

\u{1044d}: '𐑍'

SmallLetterOi

\u{1044e}: '𐑎'

Methods

impl Deseret

pub fn new() -> Self

The character with the lowest index in this unicode block

pub fn name(&self) -> String

The character's name, in sentence case

Trait Implementations

impl Iterator for Deseret

type Item = Self

The type of the elements being iterated over.

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

Advances the iterator and returns the next value.

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

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator<Item = Self::Item>, 

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator, 

'Zips up' two iterators into a single iterator of pairs.

fn map<B, F>(self, f: F) -> Map<Self, F> where
    F: FnMut(Self::Item) -> B, 

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F) where
    F: FnMut(Self::Item), 

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
    F: FnMut(Self::Item) -> Option<B>, 

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use peek to look at the next element of the iterator without consuming it.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that [skip]s elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that yields elements based on a predicate.

fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields its first n elements.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
    F: FnMut(&mut St, Self::Item) -> Option<B>, 

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
    F: FnMut(Self::Item) -> U,
    U: IntoIterator, 

Creates an iterator that works like map, but flattens nested structure.

fn flatten(self) -> Flatten<Self> where
    Self::Item: IntoIterator, 

Creates an iterator that flattens nested structure.

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first [None].

fn inspect<F>(self, f: F) -> Inspect<Self, F> where
    F: FnMut(&Self::Item), 

Do something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it.

#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]

fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>, 

Transforms an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B) where
    B: Default + Extend<Self::Item>,
    F: FnMut(&Self::Item) -> bool, 

Consumes an iterator, creating two collections from it.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, Self::Item) -> R,
    R: Try<Ok = B>, 

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R where
    F: FnMut(Self::Item) -> R,
    R: Try<Ok = ()>, 

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn fold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

An iterator method that applies a function, producing a single, final value.

fn all<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B> where
    F: FnMut(Self::Item) -> Option<B>, 

Applies function to the elements of iterator and returns the first non-none result.

fn position<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool, 

Searches for an element in an iterator, returning its index.

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool,
    Self: ExactSizeIterator + DoubleEndedIterator, 

Searches for an element in an iterator from the right, returning its index.

fn max(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the minimum value with respect to the specified comparison function.

fn rev(self) -> Rev<Self> where
    Self: DoubleEndedIterator, 

Reverses an iterator's direction.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
    FromA: Default + Extend<A>,
    FromB: Default + Extend<B>,
    Self: Iterator<Item = (A, B)>, 

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Copy, 

🔬 This is a nightly-only experimental API. (iter_copied)

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Clone, 

Creates an iterator which [clone]s all of its elements.

fn cycle(self) -> Cycle<Self> where
    Self: Clone, 

Repeats an iterator endlessly.

fn sum<S>(self) -> S where
    S: Sum<Self::Item>, 

Sums the elements of an iterator.

fn product<P>(self) -> P where
    P: Product<Self::Item>, 

Iterates over the entire iterator, multiplying all the elements

fn cmp<I>(self, other: I) -> Ordering where
    I: IntoIterator<Item = Self::Item>,
    Self::Item: Ord, 

Lexicographically compares the elements of this Iterator with those of another.

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Lexicographically compares the elements of this Iterator with those of another.

fn eq<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are equal to those of another.

fn ne<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are unequal to those of another.

fn lt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted(self) -> bool where
    Self::Item: PartialOrd<Self::Item>, 

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted.

fn is_sorted_by<F>(self, compare: F) -> bool where
    F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>, 

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool where
    F: FnMut(&Self::Item) -> K,
    K: PartialOrd<K>, 

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted using the given key extraction function.

impl PartialEq<Deseret> for Deseret

fn eq(&self, other: &Deseret) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl Clone for Deseret

Important traits for Deseret

impl Iterator for Deseret type Item = Self;

fn clone(&self) -> Deseret

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Into<char> for Deseret

fn into(self) -> char

Performs the conversion.

impl Into<u32> for Deseret

fn into(self) -> u32

Performs the conversion.

impl Eq for Deseret

impl Copy for Deseret

impl Hash for Deseret

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl Debug for Deseret

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl TryFrom<char> for Deseret

type Error = ()

The type returned in the event of a conversion error.

fn try_from(c: char) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<u32> for Deseret

type Error = ()

The type returned in the event of a conversion error.

fn try_from(u: u32) -> Result<Self, Self::Error>

Performs the conversion.