Enum unicode_types::duployan::Duployan

pub enum Duployan {
    LetterH,
    LetterX,
    LetterP,
    LetterT,
    LetterF,
    LetterK,
    LetterL,
    LetterB,
    LetterD,
    LetterV,
    LetterG,
    LetterR,
    LetterPN,
    LetterDS,
    LetterFN,
    LetterKM,
    LetterRS,
    LetterTh,
    LetterSloanDh,
    LetterDh,
    LetterKk,
    LetterSloanJ,
    LetterHl,
    LetterLh,
    LetterRh,
    LetterM,
    LetterN,
    LetterJ,
    LetterS,
    LetterMN,
    LetterNM,
    LetterJM,
    LetterSJ,
    LetterMWithDot,
    LetterNWithDot,
    LetterJWithDot,
    LetterJWithDotsInsideAndAbove,
    LetterSWithDot,
    LetterSWithDotBelow,
    LetterMS,
    LetterNS,
    LetterJS,
    LetterSS,
    LetterMNS,
    LetterNMS,
    LetterJMS,
    LetterSJS,
    LetterJSWithDot,
    LetterJN,
    LetterJNS,
    LetterST,
    LetterSTR,
    LetterSP,
    LetterSPR,
    LetterTS,
    LetterTRS,
    LetterW,
    LetterWh,
    LetterWR,
    LetterSN,
    LetterSM,
    LetterKRS,
    LetterGRS,
    LetterSK,
    LetterSKR,
    LetterA,
    LetterSloanOw,
    LetterOa,
    LetterO,
    LetterAou,
    LetterI,
    LetterE,
    LetterIe,
    LetterShortI,
    LetterUi,
    LetterEe,
    LetterSloanEh,
    LetterRomanianI,
    LetterSloanEe,
    LetterLongI,
    LetterYe,
    LetterU,
    LetterEu,
    LetterXw,
    LetterUN,
    LetterLongU,
    LetterRomanianU,
    LetterUh,
    LetterSloanU,
    LetterOoh,
    LetterOw,
    LetterOu,
    LetterWa,
    LetterWo,
    LetterWi,
    LetterWei,
    LetterWow,
    LetterNasalU,
    LetterNasalO,
    LetterNasalI,
    LetterNasalA,
    LetterPerninAn,
    LetterPerninAm,
    LetterSloanEn,
    LetterSloanAn,
    LetterSloanOn,
    LetterVocalicM,
    AffixLeftHorizontalSecant,
    AffixMidHorizontalSecant,
    AffixRightHorizontalSecant,
    AffixLowVerticalSecant,
    AffixMidVerticalSecant,
    AffixHighVerticalSecant,
    AffixAttachedSecant,
    AffixAttachedLeftDashToDashRightSecant,
    AffixAttachedTangent,
    AffixAttachedTail,
    AffixAttachedEHook,
    AffixAttachedIHook,
    AffixAttachedTangentHook,
    AffixHighAcute,
    AffixHighTightAcute,
    AffixHighGrave,
    AffixHighLongGrave,
    AffixHighDot,
    AffixHighCircle,
    AffixHighLine,
    AffixHighWave,
    AffixHighVertical,
    AffixLowAcute,
    AffixLowTightAcute,
    AffixLowGrave,
    AffixLowLongGrave,
    AffixLowDot,
    AffixLowCircle,
    AffixLowLine,
    AffixLowWave,
    AffixLowVertical,
    AffixLowArrow,
    SignOWithCross,
    ThickLetterSelector,
    DoubleMark,
}

An enum to represent all characters in the Duployan block.

Variants

LetterH

\u{1bc00}: '𛰀'

LetterX

\u{1bc01}: '𛰁'

LetterP

\u{1bc02}: '𛰂'

LetterT

\u{1bc03}: '𛰃'

LetterF

\u{1bc04}: '𛰄'

LetterK

\u{1bc05}: '𛰅'

LetterL

\u{1bc06}: '𛰆'

LetterB

\u{1bc07}: '𛰇'

LetterD

\u{1bc08}: '𛰈'

LetterV

\u{1bc09}: '𛰉'

LetterG

\u{1bc0a}: '𛰊'

LetterR

\u{1bc0b}: '𛰋'

LetterPN

\u{1bc0c}: '𛰌'

LetterDS

\u{1bc0d}: '𛰍'

LetterFN

\u{1bc0e}: '𛰎'

LetterKM

\u{1bc0f}: '𛰏'

LetterRS

\u{1bc10}: '𛰐'

LetterTh

\u{1bc11}: '𛰑'

LetterSloanDh

\u{1bc12}: '𛰒'

LetterDh

\u{1bc13}: '𛰓'

LetterKk

\u{1bc14}: '𛰔'

LetterSloanJ

\u{1bc15}: '𛰕'

LetterHl

\u{1bc16}: '𛰖'

LetterLh

\u{1bc17}: '𛰗'

LetterRh

\u{1bc18}: '𛰘'

LetterM

\u{1bc19}: '𛰙'

LetterN

\u{1bc1a}: '𛰚'

LetterJ

\u{1bc1b}: '𛰛'

LetterS

\u{1bc1c}: '𛰜'

LetterMN

\u{1bc1d}: '𛰝'

LetterNM

\u{1bc1e}: '𛰞'

LetterJM

\u{1bc1f}: '𛰟'

LetterSJ

\u{1bc20}: '𛰠'

LetterMWithDot

\u{1bc21}: '𛰡'

LetterNWithDot

\u{1bc22}: '𛰢'

LetterJWithDot

\u{1bc23}: '𛰣'

LetterJWithDotsInsideAndAbove

\u{1bc24}: '𛰤'

LetterSWithDot

\u{1bc25}: '𛰥'

LetterSWithDotBelow

\u{1bc26}: '𛰦'

LetterMS

\u{1bc27}: '𛰧'

LetterNS

\u{1bc28}: '𛰨'

LetterJS

\u{1bc29}: '𛰩'

LetterSS

\u{1bc2a}: '𛰪'

LetterMNS

\u{1bc2b}: '𛰫'

LetterNMS

\u{1bc2c}: '𛰬'

LetterJMS

\u{1bc2d}: '𛰭'

LetterSJS

\u{1bc2e}: '𛰮'

LetterJSWithDot

\u{1bc2f}: '𛰯'

LetterJN

\u{1bc30}: '𛰰'

LetterJNS

\u{1bc31}: '𛰱'

LetterST

\u{1bc32}: '𛰲'

LetterSTR

\u{1bc33}: '𛰳'

LetterSP

\u{1bc34}: '𛰴'

LetterSPR

\u{1bc35}: '𛰵'

LetterTS

\u{1bc36}: '𛰶'

LetterTRS

\u{1bc37}: '𛰷'

LetterW

\u{1bc38}: '𛰸'

LetterWh

\u{1bc39}: '𛰹'

LetterWR

\u{1bc3a}: '𛰺'

LetterSN

\u{1bc3b}: '𛰻'

LetterSM

\u{1bc3c}: '𛰼'

LetterKRS

\u{1bc3d}: '𛰽'

LetterGRS

\u{1bc3e}: '𛰾'

LetterSK

\u{1bc3f}: '𛰿'

LetterSKR

\u{1bc40}: '𛱀'

LetterA

\u{1bc41}: '𛱁'

LetterSloanOw

\u{1bc42}: '𛱂'

LetterOa

\u{1bc43}: '𛱃'

LetterO

\u{1bc44}: '𛱄'

LetterAou

\u{1bc45}: '𛱅'

LetterI

\u{1bc46}: '𛱆'

LetterE

\u{1bc47}: '𛱇'

LetterIe

\u{1bc48}: '𛱈'

LetterShortI

\u{1bc49}: '𛱉'

LetterUi

\u{1bc4a}: '𛱊'

LetterEe

\u{1bc4b}: '𛱋'

LetterSloanEh

\u{1bc4c}: '𛱌'

LetterRomanianI

\u{1bc4d}: '𛱍'

LetterSloanEe

\u{1bc4e}: '𛱎'

LetterLongI

\u{1bc4f}: '𛱏'

LetterYe

\u{1bc50}: '𛱐'

LetterU

\u{1bc51}: '𛱑'

LetterEu

\u{1bc52}: '𛱒'

LetterXw

\u{1bc53}: '𛱓'

LetterUN

\u{1bc54}: '𛱔'

LetterLongU

\u{1bc55}: '𛱕'

LetterRomanianU

\u{1bc56}: '𛱖'

LetterUh

\u{1bc57}: '𛱗'

LetterSloanU

\u{1bc58}: '𛱘'

LetterOoh

\u{1bc59}: '𛱙'

LetterOw

\u{1bc5a}: '𛱚'

LetterOu

\u{1bc5b}: '𛱛'

LetterWa

\u{1bc5c}: '𛱜'

LetterWo

\u{1bc5d}: '𛱝'

LetterWi

\u{1bc5e}: '𛱞'

LetterWei

\u{1bc5f}: '𛱟'

LetterWow

\u{1bc60}: '𛱠'

LetterNasalU

\u{1bc61}: '𛱡'

LetterNasalO

\u{1bc62}: '𛱢'

LetterNasalI

\u{1bc63}: '𛱣'

LetterNasalA

\u{1bc64}: '𛱤'

LetterPerninAn

\u{1bc65}: '𛱥'

LetterPerninAm

\u{1bc66}: '𛱦'

LetterSloanEn

\u{1bc67}: '𛱧'

LetterSloanAn

\u{1bc68}: '𛱨'

LetterSloanOn

\u{1bc69}: '𛱩'

LetterVocalicM

\u{1bc6a}: '𛱪'

AffixLeftHorizontalSecant

\u{1bc70}: '𛱰'

AffixMidHorizontalSecant

\u{1bc71}: '𛱱'

AffixRightHorizontalSecant

\u{1bc72}: '𛱲'

AffixLowVerticalSecant

\u{1bc73}: '𛱳'

AffixMidVerticalSecant

\u{1bc74}: '𛱴'

AffixHighVerticalSecant

\u{1bc75}: '𛱵'

AffixAttachedSecant

\u{1bc76}: '𛱶'

AffixAttachedLeftDashToDashRightSecant

\u{1bc77}: '𛱷'

AffixAttachedTangent

\u{1bc78}: '𛱸'

AffixAttachedTail

\u{1bc79}: '𛱹'

AffixAttachedEHook

\u{1bc7a}: '𛱺'

AffixAttachedIHook

\u{1bc7b}: '𛱻'

AffixAttachedTangentHook

\u{1bc7c}: '𛱼'

AffixHighAcute

\u{1bc80}: '𛲀'

AffixHighTightAcute

\u{1bc81}: '𛲁'

AffixHighGrave

\u{1bc82}: '𛲂'

AffixHighLongGrave

\u{1bc83}: '𛲃'

AffixHighDot

\u{1bc84}: '𛲄'

AffixHighCircle

\u{1bc85}: '𛲅'

AffixHighLine

\u{1bc86}: '𛲆'

AffixHighWave

\u{1bc87}: '𛲇'

AffixHighVertical

\u{1bc88}: '𛲈'

AffixLowAcute

\u{1bc90}: '𛲐'

AffixLowTightAcute

\u{1bc91}: '𛲑'

AffixLowGrave

\u{1bc92}: '𛲒'

AffixLowLongGrave

\u{1bc93}: '𛲓'

AffixLowDot

\u{1bc94}: '𛲔'

AffixLowCircle

\u{1bc95}: '𛲕'

AffixLowLine

\u{1bc96}: '𛲖'

AffixLowWave

\u{1bc97}: '𛲗'

AffixLowVertical

\u{1bc98}: '𛲘'

AffixLowArrow

\u{1bc99}: '𛲙'

SignOWithCross

\u{1bc9c}: '𛲜'

ThickLetterSelector

\u{1bc9d}: '𛲝'

DoubleMark

\u{1bc9e}: '𛲞'

Methods

impl Duployan

pub fn new() -> Self

The character with the lowest index in this unicode block

pub fn name(&self) -> &str

The character's name, all lowercase and space-separated

Trait Implementations

impl Iterator for Duployan

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<Duployan> for Duployan

fn eq(&self, other: &Duployan) -> 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 Duployan

Important traits for Duployan

impl Iterator for Duployan type Item = Self;

fn clone(&self) -> Duployan

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Into<char> for Duployan

fn into(self) -> char

Performs the conversion.

impl Into<u32> for Duployan

fn into(self) -> u32

Performs the conversion.

impl Eq for Duployan

impl Copy for Duployan

impl Hash for Duployan

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 Duployan

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

Formats the value using the given formatter.

impl TryFrom<char> for Duployan

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 Duployan

type Error = ()

The type returned in the event of a conversion error.

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

Performs the conversion.