Enum unicode_types::tifinagh::Tifinagh

pub enum Tifinagh {
    LetterYa,
    LetterYab,
    LetterYabh,
    LetterYag,
    LetterYaghh,
    LetterBerberAcademyYaj,
    LetterYaj,
    LetterYad,
    LetterYadh,
    LetterYadd,
    LetterYaddh,
    LetterYey,
    LetterYaf,
    LetterYak,
    LetterTuaregYak,
    LetterYakhh,
    LetterYah,
    LetterBerberAcademyYah,
    LetterTuaregYah,
    LetterYahh,
    LetterYaa,
    LetterYakh,
    LetterTuaregYakh,
    LetterYaq,
    LetterTuaregYaq,
    LetterYi,
    LetterYazh,
    LetterAhaggarYazh,
    LetterTuaregYazh,
    LetterYal,
    LetterYam,
    LetterYan,
    LetterTuaregYagn,
    LetterTuaregYang,
    LetterYap,
    LetterYu,
    LetterYar,
    LetterYarr,
    LetterYagh,
    LetterTuaregYagh,
    LetterAyerYagh,
    LetterYas,
    LetterYass,
    LetterYash,
    LetterYat,
    LetterYath,
    LetterYach,
    LetterYatt,
    LetterYav,
    LetterYaw,
    LetterYay,
    LetterYaz,
    LetterTawellemetYaz,
    LetterYazz,
    LetterYe,
    LetterYo,
    ModifierLetterLabializationMark,
    SeparatorMark,
}

An enum to represent all characters in the Tifinagh block.

Variants

LetterYa

\u{2d30}: 'ⴰ'

LetterYab

\u{2d31}: 'ⴱ'

LetterYabh

\u{2d32}: 'ⴲ'

LetterYag

\u{2d33}: 'ⴳ'

LetterYaghh

\u{2d34}: 'ⴴ'

LetterBerberAcademyYaj

\u{2d35}: 'ⴵ'

LetterYaj

\u{2d36}: 'ⴶ'

LetterYad

\u{2d37}: 'ⴷ'

LetterYadh

\u{2d38}: 'ⴸ'

LetterYadd

\u{2d39}: 'ⴹ'

LetterYaddh

\u{2d3a}: 'ⴺ'

LetterYey

\u{2d3b}: 'ⴻ'

LetterYaf

\u{2d3c}: 'ⴼ'

LetterYak

\u{2d3d}: 'ⴽ'

LetterTuaregYak

\u{2d3e}: 'ⴾ'

LetterYakhh

\u{2d3f}: 'ⴿ'

LetterYah

\u{2d40}: 'ⵀ'

LetterBerberAcademyYah

\u{2d41}: 'ⵁ'

LetterTuaregYah

\u{2d42}: 'ⵂ'

LetterYahh

\u{2d43}: 'ⵃ'

LetterYaa

\u{2d44}: 'ⵄ'

LetterYakh

\u{2d45}: 'ⵅ'

LetterTuaregYakh

\u{2d46}: 'ⵆ'

LetterYaq

\u{2d47}: 'ⵇ'

LetterTuaregYaq

\u{2d48}: 'ⵈ'

LetterYi

\u{2d49}: 'ⵉ'

LetterYazh

\u{2d4a}: 'ⵊ'

LetterAhaggarYazh

\u{2d4b}: 'ⵋ'

LetterTuaregYazh

\u{2d4c}: 'ⵌ'

LetterYal

\u{2d4d}: 'ⵍ'

LetterYam

\u{2d4e}: 'ⵎ'

LetterYan

\u{2d4f}: 'ⵏ'

LetterTuaregYagn

\u{2d50}: 'ⵐ'

LetterTuaregYang

\u{2d51}: 'ⵑ'

LetterYap

\u{2d52}: 'ⵒ'

LetterYu

\u{2d53}: 'ⵓ'

LetterYar

\u{2d54}: 'ⵔ'

LetterYarr

\u{2d55}: 'ⵕ'

LetterYagh

\u{2d56}: 'ⵖ'

LetterTuaregYagh

\u{2d57}: 'ⵗ'

LetterAyerYagh

\u{2d58}: 'ⵘ'

LetterYas

\u{2d59}: 'ⵙ'

LetterYass

\u{2d5a}: 'ⵚ'

LetterYash

\u{2d5b}: 'ⵛ'

LetterYat

\u{2d5c}: 'ⵜ'

LetterYath

\u{2d5d}: 'ⵝ'

LetterYach

\u{2d5e}: 'ⵞ'

LetterYatt

\u{2d5f}: 'ⵟ'

LetterYav

\u{2d60}: 'ⵠ'

LetterYaw

\u{2d61}: 'ⵡ'

LetterYay

\u{2d62}: 'ⵢ'

LetterYaz

\u{2d63}: 'ⵣ'

LetterTawellemetYaz

\u{2d64}: 'ⵤ'

LetterYazz

\u{2d65}: 'ⵥ'

LetterYe

\u{2d66}: 'ⵦ'

LetterYo

\u{2d67}: 'ⵧ'

ModifierLetterLabializationMark

\u{2d6f}: 'ⵯ'

SeparatorMark

\u{2d70}: '⵰'

Methods

impl Tifinagh

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 Tifinagh

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

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

Important traits for Tifinagh

impl Iterator for Tifinagh type Item = Self;

fn clone(&self) -> Tifinagh

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Into<char> for Tifinagh

fn into(self) -> char

Performs the conversion.

impl Into<u32> for Tifinagh

fn into(self) -> u32

Performs the conversion.

impl Eq for Tifinagh

impl Copy for Tifinagh

impl Hash for Tifinagh

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 Tifinagh

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

Formats the value using the given formatter.

impl TryFrom<char> for Tifinagh

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 Tifinagh

type Error = ()

The type returned in the event of a conversion error.

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

Performs the conversion.