Enum unicode_types::medefaidrin::Medefaidrin

pub enum Medefaidrin {
    CapitalLetterM,
    CapitalLetterS,
    CapitalLetterV,
    CapitalLetterW,
    CapitalLetterAtiu,
    CapitalLetterZ,
    CapitalLetterKp,
    CapitalLetterP,
    CapitalLetterT,
    CapitalLetterG,
    CapitalLetterF,
    CapitalLetterI,
    CapitalLetterK,
    CapitalLetterA,
    CapitalLetterJ,
    CapitalLetterE,
    CapitalLetterB,
    CapitalLetterC,
    CapitalLetterU,
    CapitalLetterYu,
    CapitalLetterL,
    CapitalLetterQ,
    CapitalLetterHp,
    CapitalLetterNy,
    CapitalLetterX,
    CapitalLetterD,
    CapitalLetterOe,
    CapitalLetterN,
    CapitalLetterR,
    CapitalLetterO,
    CapitalLetterAi,
    CapitalLetterY,
    SmallLetterM,
    SmallLetterS,
    SmallLetterV,
    SmallLetterW,
    SmallLetterAtiu,
    SmallLetterZ,
    SmallLetterKp,
    SmallLetterP,
    SmallLetterT,
    SmallLetterG,
    SmallLetterF,
    SmallLetterI,
    SmallLetterK,
    SmallLetterA,
    SmallLetterJ,
    SmallLetterE,
    SmallLetterB,
    SmallLetterC,
    SmallLetterU,
    SmallLetterYu,
    SmallLetterL,
    SmallLetterQ,
    SmallLetterHp,
    SmallLetterNy,
    SmallLetterX,
    SmallLetterD,
    SmallLetterOe,
    SmallLetterN,
    SmallLetterR,
    SmallLetterO,
    SmallLetterAi,
    SmallLetterY,
    DigitZero,
    DigitOne,
    DigitTwo,
    DigitThree,
    DigitFour,
    DigitFive,
    DigitSix,
    DigitSeven,
    DigitEight,
    DigitNine,
    NumberTen,
    NumberEleven,
    NumberTwelve,
    NumberThirteen,
    NumberFourteen,
    NumberFifteen,
    NumberSixteen,
    NumberSeventeen,
    NumberEighteen,
    NumberNineteen,
    DigitOneAlternateForm,
    DigitTwoAlternateForm,
    DigitThreeAlternateForm,
    Comma,
    FullStop,
    SymbolAiva,
    ExclamationOh,
}

An enum to represent all characters in the Medefaidrin block.

Variants

CapitalLetterM

\u{16e40}: '𖹀'

CapitalLetterS

\u{16e41}: '𖹁'

CapitalLetterV

\u{16e42}: '𖹂'

CapitalLetterW

\u{16e43}: '𖹃'

CapitalLetterAtiu

\u{16e44}: '𖹄'

CapitalLetterZ

\u{16e45}: '𖹅'

CapitalLetterKp

\u{16e46}: '𖹆'

CapitalLetterP

\u{16e47}: '𖹇'

CapitalLetterT

\u{16e48}: '𖹈'

CapitalLetterG

\u{16e49}: '𖹉'

CapitalLetterF

\u{16e4a}: '𖹊'

CapitalLetterI

\u{16e4b}: '𖹋'

CapitalLetterK

\u{16e4c}: '𖹌'

CapitalLetterA

\u{16e4d}: '𖹍'

CapitalLetterJ

\u{16e4e}: '𖹎'

CapitalLetterE

\u{16e4f}: '𖹏'

CapitalLetterB

\u{16e50}: '𖹐'

CapitalLetterC

\u{16e51}: '𖹑'

CapitalLetterU

\u{16e52}: '𖹒'

CapitalLetterYu

\u{16e53}: '𖹓'

CapitalLetterL

\u{16e54}: '𖹔'

CapitalLetterQ

\u{16e55}: '𖹕'

CapitalLetterHp

\u{16e56}: '𖹖'

CapitalLetterNy

\u{16e57}: '𖹗'

CapitalLetterX

\u{16e58}: '𖹘'

CapitalLetterD

\u{16e59}: '𖹙'

CapitalLetterOe

\u{16e5a}: '𖹚'

CapitalLetterN

\u{16e5b}: '𖹛'

CapitalLetterR

\u{16e5c}: '𖹜'

CapitalLetterO

\u{16e5d}: '𖹝'

CapitalLetterAi

\u{16e5e}: '𖹞'

CapitalLetterY

\u{16e5f}: '𖹟'

SmallLetterM

\u{16e60}: '𖹠'

SmallLetterS

\u{16e61}: '𖹡'

SmallLetterV

\u{16e62}: '𖹢'

SmallLetterW

\u{16e63}: '𖹣'

SmallLetterAtiu

\u{16e64}: '𖹤'

SmallLetterZ

\u{16e65}: '𖹥'

SmallLetterKp

\u{16e66}: '𖹦'

SmallLetterP

\u{16e67}: '𖹧'

SmallLetterT

\u{16e68}: '𖹨'

SmallLetterG

\u{16e69}: '𖹩'

SmallLetterF

\u{16e6a}: '𖹪'

SmallLetterI

\u{16e6b}: '𖹫'

SmallLetterK

\u{16e6c}: '𖹬'

SmallLetterA

\u{16e6d}: '𖹭'

SmallLetterJ

\u{16e6e}: '𖹮'

SmallLetterE

\u{16e6f}: '𖹯'

SmallLetterB

\u{16e70}: '𖹰'

SmallLetterC

\u{16e71}: '𖹱'

SmallLetterU

\u{16e72}: '𖹲'

SmallLetterYu

\u{16e73}: '𖹳'

SmallLetterL

\u{16e74}: '𖹴'

SmallLetterQ

\u{16e75}: '𖹵'

SmallLetterHp

\u{16e76}: '𖹶'

SmallLetterNy

\u{16e77}: '𖹷'

SmallLetterX

\u{16e78}: '𖹸'

SmallLetterD

\u{16e79}: '𖹹'

SmallLetterOe

\u{16e7a}: '𖹺'

SmallLetterN

\u{16e7b}: '𖹻'

SmallLetterR

\u{16e7c}: '𖹼'

SmallLetterO

\u{16e7d}: '𖹽'

SmallLetterAi

\u{16e7e}: '𖹾'

SmallLetterY

\u{16e7f}: '𖹿'

DigitZero

\u{16e80}: '𖺀'

DigitOne

\u{16e81}: '𖺁'

DigitTwo

\u{16e82}: '𖺂'

DigitThree

\u{16e83}: '𖺃'

DigitFour

\u{16e84}: '𖺄'

DigitFive

\u{16e85}: '𖺅'

DigitSix

\u{16e86}: '𖺆'

DigitSeven

\u{16e87}: '𖺇'

DigitEight

\u{16e88}: '𖺈'

DigitNine

\u{16e89}: '𖺉'

NumberTen

\u{16e8a}: '𖺊'

NumberEleven

\u{16e8b}: '𖺋'

NumberTwelve

\u{16e8c}: '𖺌'

NumberThirteen

\u{16e8d}: '𖺍'

NumberFourteen

\u{16e8e}: '𖺎'

NumberFifteen

\u{16e8f}: '𖺏'

NumberSixteen

\u{16e90}: '𖺐'

NumberSeventeen

\u{16e91}: '𖺑'

NumberEighteen

\u{16e92}: '𖺒'

NumberNineteen

\u{16e93}: '𖺓'

DigitOneAlternateForm

\u{16e94}: '𖺔'

DigitTwoAlternateForm

\u{16e95}: '𖺕'

DigitThreeAlternateForm

\u{16e96}: '𖺖'

Comma

\u{16e97}: '𖺗'

FullStop

\u{16e98}: '𖺘'

SymbolAiva

\u{16e99}: '𖺙'

ExclamationOh

\u{16e9a}: '𖺚'

Methods

impl Medefaidrin

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 Medefaidrin

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

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

Important traits for Medefaidrin

impl Iterator for Medefaidrin type Item = Self;

fn clone(&self) -> Medefaidrin

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Into<char> for Medefaidrin

fn into(self) -> char

Performs the conversion.

impl Into<u32> for Medefaidrin

fn into(self) -> u32

Performs the conversion.

impl Eq for Medefaidrin

impl Copy for Medefaidrin

impl Hash for Medefaidrin

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 Medefaidrin

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

Formats the value using the given formatter.

impl TryFrom<char> for Medefaidrin

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 Medefaidrin

type Error = ()

The type returned in the event of a conversion error.

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

Performs the conversion.