Enum unicode_types::adlam::Adlam

pub enum Adlam {
    CapitalLetterAlif,
    CapitalLetterDaali,
    CapitalLetterLaam,
    CapitalLetterMiim,
    CapitalLetterBa,
    CapitalLetterSinnyiiyhe,
    CapitalLetterPe,
    CapitalLetterBhe,
    CapitalLetterRa,
    CapitalLetterE,
    CapitalLetterFa,
    CapitalLetterI,
    CapitalLetterO,
    CapitalLetterDha,
    CapitalLetterYhe,
    CapitalLetterWaw,
    CapitalLetterNun,
    CapitalLetterKaf,
    CapitalLetterYa,
    CapitalLetterU,
    CapitalLetterJiim,
    CapitalLetterChi,
    CapitalLetterHa,
    CapitalLetterQaaf,
    CapitalLetterGa,
    CapitalLetterNya,
    CapitalLetterTu,
    CapitalLetterNha,
    CapitalLetterVa,
    CapitalLetterKha,
    CapitalLetterGbe,
    CapitalLetterZal,
    CapitalLetterKpo,
    CapitalLetterSha,
    SmallLetterAlif,
    SmallLetterDaali,
    SmallLetterLaam,
    SmallLetterMiim,
    SmallLetterBa,
    SmallLetterSinnyiiyhe,
    SmallLetterPe,
    SmallLetterBhe,
    SmallLetterRa,
    SmallLetterE,
    SmallLetterFa,
    SmallLetterI,
    SmallLetterO,
    SmallLetterDha,
    SmallLetterYhe,
    SmallLetterWaw,
    SmallLetterNun,
    SmallLetterKaf,
    SmallLetterYa,
    SmallLetterU,
    SmallLetterJiim,
    SmallLetterChi,
    SmallLetterHa,
    SmallLetterQaaf,
    SmallLetterGa,
    SmallLetterNya,
    SmallLetterTu,
    SmallLetterNha,
    SmallLetterVa,
    SmallLetterKha,
    SmallLetterGbe,
    SmallLetterZal,
    SmallLetterKpo,
    SmallLetterSha,
    AlifLengthener,
    VowelLengthener,
    GeminationMark,
    Hamza,
    ConsonantModifier,
    GeminateConsonantModifier,
    Nukta,
    NasalizationMark,
    DigitZero,
    DigitOne,
    DigitTwo,
    DigitThree,
    DigitFour,
    DigitFive,
    DigitSix,
    DigitSeven,
    DigitEight,
    DigitNine,
    InitialExclamationMark,
}

An enum to represent all characters in the Adlam block.

Variants

CapitalLetterAlif

\u{1e900}: '𞤀'

CapitalLetterDaali

\u{1e901}: '𞤁'

CapitalLetterLaam

\u{1e902}: '𞤂'

CapitalLetterMiim

\u{1e903}: '𞤃'

CapitalLetterBa

\u{1e904}: '𞤄'

CapitalLetterSinnyiiyhe

\u{1e905}: '𞤅'

CapitalLetterPe

\u{1e906}: '𞤆'

CapitalLetterBhe

\u{1e907}: '𞤇'

CapitalLetterRa

\u{1e908}: '𞤈'

CapitalLetterE

\u{1e909}: '𞤉'

CapitalLetterFa

\u{1e90a}: '𞤊'

CapitalLetterI

\u{1e90b}: '𞤋'

CapitalLetterO

\u{1e90c}: '𞤌'

CapitalLetterDha

\u{1e90d}: '𞤍'

CapitalLetterYhe

\u{1e90e}: '𞤎'

CapitalLetterWaw

\u{1e90f}: '𞤏'

CapitalLetterNun

\u{1e910}: '𞤐'

CapitalLetterKaf

\u{1e911}: '𞤑'

CapitalLetterYa

\u{1e912}: '𞤒'

CapitalLetterU

\u{1e913}: '𞤓'

CapitalLetterJiim

\u{1e914}: '𞤔'

CapitalLetterChi

\u{1e915}: '𞤕'

CapitalLetterHa

\u{1e916}: '𞤖'

CapitalLetterQaaf

\u{1e917}: '𞤗'

CapitalLetterGa

\u{1e918}: '𞤘'

CapitalLetterNya

\u{1e919}: '𞤙'

CapitalLetterTu

\u{1e91a}: '𞤚'

CapitalLetterNha

\u{1e91b}: '𞤛'

CapitalLetterVa

\u{1e91c}: '𞤜'

CapitalLetterKha

\u{1e91d}: '𞤝'

CapitalLetterGbe

\u{1e91e}: '𞤞'

CapitalLetterZal

\u{1e91f}: '𞤟'

CapitalLetterKpo

\u{1e920}: '𞤠'

CapitalLetterSha

\u{1e921}: '𞤡'

SmallLetterAlif

\u{1e922}: '𞤢'

SmallLetterDaali

\u{1e923}: '𞤣'

SmallLetterLaam

\u{1e924}: '𞤤'

SmallLetterMiim

\u{1e925}: '𞤥'

SmallLetterBa

\u{1e926}: '𞤦'

SmallLetterSinnyiiyhe

\u{1e927}: '𞤧'

SmallLetterPe

\u{1e928}: '𞤨'

SmallLetterBhe

\u{1e929}: '𞤩'

SmallLetterRa

\u{1e92a}: '𞤪'

SmallLetterE

\u{1e92b}: '𞤫'

SmallLetterFa

\u{1e92c}: '𞤬'

SmallLetterI

\u{1e92d}: '𞤭'

SmallLetterO

\u{1e92e}: '𞤮'

SmallLetterDha

\u{1e92f}: '𞤯'

SmallLetterYhe

\u{1e930}: '𞤰'

SmallLetterWaw

\u{1e931}: '𞤱'

SmallLetterNun

\u{1e932}: '𞤲'

SmallLetterKaf

\u{1e933}: '𞤳'

SmallLetterYa

\u{1e934}: '𞤴'

SmallLetterU

\u{1e935}: '𞤵'

SmallLetterJiim

\u{1e936}: '𞤶'

SmallLetterChi

\u{1e937}: '𞤷'

SmallLetterHa

\u{1e938}: '𞤸'

SmallLetterQaaf

\u{1e939}: '𞤹'

SmallLetterGa

\u{1e93a}: '𞤺'

SmallLetterNya

\u{1e93b}: '𞤻'

SmallLetterTu

\u{1e93c}: '𞤼'

SmallLetterNha

\u{1e93d}: '𞤽'

SmallLetterVa

\u{1e93e}: '𞤾'

SmallLetterKha

\u{1e93f}: '𞤿'

SmallLetterGbe

\u{1e940}: '𞥀'

SmallLetterZal

\u{1e941}: '𞥁'

SmallLetterKpo

\u{1e942}: '𞥂'

SmallLetterSha

\u{1e943}: '𞥃'

AlifLengthener

\u{1e944}: '𞥄'

VowelLengthener

\u{1e945}: '𞥅'

GeminationMark

\u{1e946}: '𞥆'

Hamza

\u{1e947}: '𞥇'

ConsonantModifier

\u{1e948}: '𞥈'

GeminateConsonantModifier

\u{1e949}: '𞥉'

Nukta

\u{1e94a}: '𞥊'

NasalizationMark

\u{1e94b}: '𞥋'

DigitZero

\u{1e950}: '𞥐'

DigitOne

\u{1e951}: '𞥑'

DigitTwo

\u{1e952}: '𞥒'

DigitThree

\u{1e953}: '𞥓'

DigitFour

\u{1e954}: '𞥔'

DigitFive

\u{1e955}: '𞥕'

DigitSix

\u{1e956}: '𞥖'

DigitSeven

\u{1e957}: '𞥗'

DigitEight

\u{1e958}: '𞥘'

DigitNine

\u{1e959}: '𞥙'

InitialExclamationMark

\u{1e95e}: '𞥞'

Methods

impl Adlam

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 Adlam

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

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

Important traits for Adlam

impl Iterator for Adlam type Item = Self;

fn clone(&self) -> Adlam

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Into<char> for Adlam

fn into(self) -> char

Performs the conversion.

impl Into<u32> for Adlam

fn into(self) -> u32

Performs the conversion.

impl Eq for Adlam

impl Copy for Adlam

impl Hash for Adlam

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 Adlam

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

Formats the value using the given formatter.

impl TryFrom<char> for Adlam

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 Adlam

type Error = ()

The type returned in the event of a conversion error.

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

Performs the conversion.