Enum unicode_types::bamum::Bamum

pub enum Bamum {
    LetterA,
    LetterKa,
    LetterU,
    LetterKu,
    LetterEe,
    LetterRee,
    LetterTae,
    LetterO,
    LetterNyi,
    LetterI,
    LetterLa,
    LetterPa,
    LetterRii,
    LetterRiee,
    LetterLeeee,
    LetterMeeee,
    LetterTaa,
    LetterNdaa,
    LetterNjaem,
    LetterM,
    LetterSuu,
    LetterMu,
    LetterShii,
    LetterSi,
    LetterSheux,
    LetterSeux,
    LetterKyee,
    LetterKet,
    LetterNuae,
    LetterNu,
    LetterNjuae,
    LetterYoq,
    LetterShu,
    LetterYuq,
    LetterYa,
    LetterNsha,
    LetterKeux,
    LetterPeux,
    LetterNjee,
    LetterNtee,
    LetterPue,
    LetterWue,
    LetterPee,
    LetterFee,
    LetterRu,
    LetterLu,
    LetterMi,
    LetterNi,
    LetterReux,
    LetterRae,
    LetterKen,
    LetterNgkwaen,
    LetterNgga,
    LetterNga,
    LetterSho,
    LetterPuae,
    LetterFu,
    LetterFom,
    LetterWa,
    LetterNa,
    LetterLi,
    LetterPi,
    LetterLoq,
    LetterKo,
    LetterMben,
    LetterRen,
    LetterMen,
    LetterMa,
    LetterTi,
    LetterKi,
    LetterMo,
    LetterMbaa,
    LetterTet,
    LetterKpa,
    LetterTen,
    LetterNtuu,
    LetterSamba,
    LetterFaamae,
    LetterKovuu,
    LetterKoghom,
    CombiningMarkKoqndon,
    CombiningMarkTukwentis,
    Njaemli,
    FullStop,
    Colon,
    Comma,
    Semicolon,
    QuestionMark,
}

An enum to represent all characters in the Bamum block.

Variants

LetterA

\u{a6a0}: 'ꚠ'

LetterKa

\u{a6a1}: 'ꚡ'

LetterU

\u{a6a2}: 'ꚢ'

LetterKu

\u{a6a3}: 'ꚣ'

LetterEe

\u{a6a4}: 'ꚤ'

LetterRee

\u{a6a5}: 'ꚥ'

LetterTae

\u{a6a6}: 'ꚦ'

LetterO

\u{a6a7}: 'ꚧ'

LetterNyi

\u{a6a8}: 'ꚨ'

LetterI

\u{a6a9}: 'ꚩ'

LetterLa

\u{a6aa}: 'ꚪ'

LetterPa

\u{a6ab}: 'ꚫ'

LetterRii

\u{a6ac}: 'ꚬ'

LetterRiee

\u{a6ad}: 'ꚭ'

LetterLeeee

\u{a6ae}: 'ꚮ'

LetterMeeee

\u{a6af}: 'ꚯ'

LetterTaa

\u{a6b0}: 'ꚰ'

LetterNdaa

\u{a6b1}: 'ꚱ'

LetterNjaem

\u{a6b2}: 'ꚲ'

LetterM

\u{a6b3}: 'ꚳ'

LetterSuu

\u{a6b4}: 'ꚴ'

LetterMu

\u{a6b5}: 'ꚵ'

LetterShii

\u{a6b6}: 'ꚶ'

LetterSi

\u{a6b7}: 'ꚷ'

LetterSheux

\u{a6b8}: 'ꚸ'

LetterSeux

\u{a6b9}: 'ꚹ'

LetterKyee

\u{a6ba}: 'ꚺ'

LetterKet

\u{a6bb}: 'ꚻ'

LetterNuae

\u{a6bc}: 'ꚼ'

LetterNu

\u{a6bd}: 'ꚽ'

LetterNjuae

\u{a6be}: 'ꚾ'

LetterYoq

\u{a6bf}: 'ꚿ'

LetterShu

\u{a6c0}: 'ꛀ'

LetterYuq

\u{a6c1}: 'ꛁ'

LetterYa

\u{a6c2}: 'ꛂ'

LetterNsha

\u{a6c3}: 'ꛃ'

LetterKeux

\u{a6c4}: 'ꛄ'

LetterPeux

\u{a6c5}: 'ꛅ'

LetterNjee

\u{a6c6}: 'ꛆ'

LetterNtee

\u{a6c7}: 'ꛇ'

LetterPue

\u{a6c8}: 'ꛈ'

LetterWue

\u{a6c9}: 'ꛉ'

LetterPee

\u{a6ca}: 'ꛊ'

LetterFee

\u{a6cb}: 'ꛋ'

LetterRu

\u{a6cc}: 'ꛌ'

LetterLu

\u{a6cd}: 'ꛍ'

LetterMi

\u{a6ce}: 'ꛎ'

LetterNi

\u{a6cf}: 'ꛏ'

LetterReux

\u{a6d0}: 'ꛐ'

LetterRae

\u{a6d1}: 'ꛑ'

LetterKen

\u{a6d2}: 'ꛒ'

LetterNgkwaen

\u{a6d3}: 'ꛓ'

LetterNgga

\u{a6d4}: 'ꛔ'

LetterNga

\u{a6d5}: 'ꛕ'

LetterSho

\u{a6d6}: 'ꛖ'

LetterPuae

\u{a6d7}: 'ꛗ'

LetterFu

\u{a6d8}: 'ꛘ'

LetterFom

\u{a6d9}: 'ꛙ'

LetterWa

\u{a6da}: 'ꛚ'

LetterNa

\u{a6db}: 'ꛛ'

LetterLi

\u{a6dc}: 'ꛜ'

LetterPi

\u{a6dd}: 'ꛝ'

LetterLoq

\u{a6de}: 'ꛞ'

LetterKo

\u{a6df}: 'ꛟ'

LetterMben

\u{a6e0}: 'ꛠ'

LetterRen

\u{a6e1}: 'ꛡ'

LetterMen

\u{a6e2}: 'ꛢ'

LetterMa

\u{a6e3}: 'ꛣ'

LetterTi

\u{a6e4}: 'ꛤ'

LetterKi

\u{a6e5}: 'ꛥ'

LetterMo

\u{a6e6}: 'ꛦ'

LetterMbaa

\u{a6e7}: 'ꛧ'

LetterTet

\u{a6e8}: 'ꛨ'

LetterKpa

\u{a6e9}: 'ꛩ'

LetterTen

\u{a6ea}: 'ꛪ'

LetterNtuu

\u{a6eb}: 'ꛫ'

LetterSamba

\u{a6ec}: 'ꛬ'

LetterFaamae

\u{a6ed}: 'ꛭ'

LetterKovuu

\u{a6ee}: 'ꛮ'

LetterKoghom

\u{a6ef}: 'ꛯ'

CombiningMarkKoqndon

\u{a6f0}: '꛰'

CombiningMarkTukwentis

\u{a6f1}: '꛱'

Njaemli

\u{a6f2}: '꛲'

FullStop

\u{a6f3}: '꛳'

Colon

\u{a6f4}: '꛴'

Comma

\u{a6f5}: '꛵'

Semicolon

\u{a6f6}: '꛶'

QuestionMark

\u{a6f7}: '꛷'

Methods

impl Bamum

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 Bamum

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

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

Important traits for Bamum

impl Iterator for Bamum type Item = Self;

fn clone(&self) -> Bamum

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Into<char> for Bamum

fn into(self) -> char

Performs the conversion.

impl Into<u32> for Bamum

fn into(self) -> u32

Performs the conversion.

impl Eq for Bamum

impl Copy for Bamum

impl Hash for Bamum

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 Bamum

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

Formats the value using the given formatter.

impl TryFrom<char> for Bamum

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 Bamum

type Error = ()

The type returned in the event of a conversion error.

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

Performs the conversion.