Enum unicode_types::runic::Runic

pub enum Runic {
    LetterFehuFeohFeF,
    LetterV,
    LetterUruzUrU,
    LetterYr,
    LetterY,
    LetterW,
    LetterThurisazThursThorn,
    LetterEth,
    LetterAnsuzA,
    LetterOsO,
    LetterAcA,
    LetterAesc,
    LetterLongDashBranchDashOssO,
    LetterShortDashTwigDashOssO,
    LetterO,
    LetterOe,
    LetterOn,
    LetterRaidoRadReidR,
    LetterKauna,
    LetterCen,
    LetterKaunK,
    LetterG,
    LetterEng,
    LetterGeboGyfuG,
    LetterGar,
    LetterWunjoWynnW,
    LetterHaglazH,
    LetterHaeglH,
    LetterLongDashBranchDashHagallH,
    LetterShortDashTwigDashHagallH,
    LetterNaudizNydNaudN,
    LetterShortDashTwigDashNaudN,
    LetterDottedDashN,
    LetterIsazIsIssI,
    LetterE,
    LetterJeranJ,
    LetterGer,
    LetterLongDashBranchDashArAe,
    LetterShortDashTwigDashArA,
    LetterIwazEoh,
    LetterPerthoPeorthP,
    LetterAlgizEolhx,
    LetterSowiloS,
    LetterSigelLongDashBranchDashSolS,
    LetterShortDashTwigDashSolS,
    LetterC,
    LetterZ,
    LetterTiwazTirTyrT,
    LetterShortDashTwigDashTyrT,
    LetterD,
    LetterBerkananBeorcBjarkanB,
    LetterShortDashTwigDashBjarkanB,
    LetterDottedDashP,
    LetterOpenDashP,
    LetterEhwazEhE,
    LetterMannazManM,
    LetterLongDashBranchDashMadrM,
    LetterShortDashTwigDashMadrM,
    LetterLaukazLaguLogrL,
    LetterDottedDashL,
    LetterIngwaz,
    LetterIng,
    LetterDagazDaegD,
    LetterOthalanEthelO,
    LetterEar,
    LetterIor,
    LetterCweorth,
    LetterCalc,
    LetterCealc,
    LetterStan,
    LetterLongDashBranchDashYr,
    LetterShortDashTwigDashYr,
    LetterIcelandicDashYr,
    LetterQ,
    LetterX,
    SinglePunctuation,
    MultiplePunctuation,
    CrossPunctuation,
    ArlaugSymbol,
    TvimadurSymbol,
    BelgthorSymbol,
    LetterK,
    LetterSh,
    LetterOo,
    LetterFranksCasketOs,
    LetterFranksCasketIs,
    LetterFranksCasketEh,
    LetterFranksCasketAc,
    LetterFranksCasketAesc,
}

An enum to represent all characters in the Runic block.

Variants

LetterFehuFeohFeF

\u{16a0}: 'ᚠ'

LetterV

\u{16a1}: 'ᚡ'

LetterUruzUrU

\u{16a2}: 'ᚢ'

LetterYr

\u{16a3}: 'ᚣ'

LetterY

\u{16a4}: 'ᚤ'

LetterW

\u{16a5}: 'ᚥ'

LetterThurisazThursThorn

\u{16a6}: 'ᚦ'

LetterEth

\u{16a7}: 'ᚧ'

LetterAnsuzA

\u{16a8}: 'ᚨ'

LetterOsO

\u{16a9}: 'ᚩ'

LetterAcA

\u{16aa}: 'ᚪ'

LetterAesc

\u{16ab}: 'ᚫ'

LetterLongDashBranchDashOssO

\u{16ac}: 'ᚬ'

LetterShortDashTwigDashOssO

\u{16ad}: 'ᚭ'

LetterO

\u{16ae}: 'ᚮ'

LetterOe

\u{16af}: 'ᚯ'

LetterOn

\u{16b0}: 'ᚰ'

LetterRaidoRadReidR

\u{16b1}: 'ᚱ'

LetterKauna

\u{16b2}: 'ᚲ'

LetterCen

\u{16b3}: 'ᚳ'

LetterKaunK

\u{16b4}: 'ᚴ'

LetterG

\u{16b5}: 'ᚵ'

LetterEng

\u{16b6}: 'ᚶ'

LetterGeboGyfuG

\u{16b7}: 'ᚷ'

LetterGar

\u{16b8}: 'ᚸ'

LetterWunjoWynnW

\u{16b9}: 'ᚹ'

LetterHaglazH

\u{16ba}: 'ᚺ'

LetterHaeglH

\u{16bb}: 'ᚻ'

LetterLongDashBranchDashHagallH

\u{16bc}: 'ᚼ'

LetterShortDashTwigDashHagallH

\u{16bd}: 'ᚽ'

LetterNaudizNydNaudN

\u{16be}: 'ᚾ'

LetterShortDashTwigDashNaudN

\u{16bf}: 'ᚿ'

LetterDottedDashN

\u{16c0}: 'ᛀ'

LetterIsazIsIssI

\u{16c1}: 'ᛁ'

LetterE

\u{16c2}: 'ᛂ'

LetterJeranJ

\u{16c3}: 'ᛃ'

LetterGer

\u{16c4}: 'ᛄ'

LetterLongDashBranchDashArAe

\u{16c5}: 'ᛅ'

LetterShortDashTwigDashArA

\u{16c6}: 'ᛆ'

LetterIwazEoh

\u{16c7}: 'ᛇ'

LetterPerthoPeorthP

\u{16c8}: 'ᛈ'

LetterAlgizEolhx

\u{16c9}: 'ᛉ'

LetterSowiloS

\u{16ca}: 'ᛊ'

LetterSigelLongDashBranchDashSolS

\u{16cb}: 'ᛋ'

LetterShortDashTwigDashSolS

\u{16cc}: 'ᛌ'

LetterC

\u{16cd}: 'ᛍ'

LetterZ

\u{16ce}: 'ᛎ'

LetterTiwazTirTyrT

\u{16cf}: 'ᛏ'

LetterShortDashTwigDashTyrT

\u{16d0}: 'ᛐ'

LetterD

\u{16d1}: 'ᛑ'

LetterBerkananBeorcBjarkanB

\u{16d2}: 'ᛒ'

LetterShortDashTwigDashBjarkanB

\u{16d3}: 'ᛓ'

LetterDottedDashP

\u{16d4}: 'ᛔ'

LetterOpenDashP

\u{16d5}: 'ᛕ'

LetterEhwazEhE

\u{16d6}: 'ᛖ'

LetterMannazManM

\u{16d7}: 'ᛗ'

LetterLongDashBranchDashMadrM

\u{16d8}: 'ᛘ'

LetterShortDashTwigDashMadrM

\u{16d9}: 'ᛙ'

LetterLaukazLaguLogrL

\u{16da}: 'ᛚ'

LetterDottedDashL

\u{16db}: 'ᛛ'

LetterIngwaz

\u{16dc}: 'ᛜ'

LetterIng

\u{16dd}: 'ᛝ'

LetterDagazDaegD

\u{16de}: 'ᛞ'

LetterOthalanEthelO

\u{16df}: 'ᛟ'

LetterEar

\u{16e0}: 'ᛠ'

LetterIor

\u{16e1}: 'ᛡ'

LetterCweorth

\u{16e2}: 'ᛢ'

LetterCalc

\u{16e3}: 'ᛣ'

LetterCealc

\u{16e4}: 'ᛤ'

LetterStan

\u{16e5}: 'ᛥ'

LetterLongDashBranchDashYr

\u{16e6}: 'ᛦ'

LetterShortDashTwigDashYr

\u{16e7}: 'ᛧ'

LetterIcelandicDashYr

\u{16e8}: 'ᛨ'

LetterQ

\u{16e9}: 'ᛩ'

LetterX

\u{16ea}: 'ᛪ'

SinglePunctuation

\u{16eb}: '᛫'

MultiplePunctuation

\u{16ec}: '᛬'

CrossPunctuation

\u{16ed}: '᛭'

ArlaugSymbol

\u{16ee}: 'ᛮ'

TvimadurSymbol

\u{16ef}: 'ᛯ'

BelgthorSymbol

\u{16f0}: 'ᛰ'

LetterK

\u{16f1}: 'ᛱ'

LetterSh

\u{16f2}: 'ᛲ'

LetterOo

\u{16f3}: 'ᛳ'

LetterFranksCasketOs

\u{16f4}: 'ᛴ'

LetterFranksCasketIs

\u{16f5}: 'ᛵ'

LetterFranksCasketEh

\u{16f6}: 'ᛶ'

LetterFranksCasketAc

\u{16f7}: 'ᛷ'

LetterFranksCasketAesc

\u{16f8}: 'ᛸ'

Methods

impl Runic

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 Runic

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

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

Important traits for Runic

impl Iterator for Runic type Item = Self;

fn clone(&self) -> Runic

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Into<char> for Runic

fn into(self) -> char

Performs the conversion.

impl Into<u32> for Runic

fn into(self) -> u32

Performs the conversion.

impl Eq for Runic

impl Copy for Runic

impl Hash for Runic

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 Runic

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

Formats the value using the given formatter.

impl TryFrom<char> for Runic

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 Runic

type Error = ()

The type returned in the event of a conversion error.

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

Performs the conversion.