Enum unicode_types::letterlike_symbols::LetterlikeSymbols

pub enum LetterlikeSymbols {
    AccountOf,
    AddressedToTheSubject,
    DoubleDashStruckCapitalC,
    DegreeCelsius,
    CentreLineSymbol,
    CareOf,
    CadaUna,
    EulerConstant,
    Scruple,
    DegreeFahrenheit,
    ScriptSmallG,
    ScriptCapitalH,
    BlackDashLetterCapitalH,
    DoubleDashStruckCapitalH,
    PlanckConstant,
    PlanckConstantOverTwoPi,
    ScriptCapitalI,
    BlackDashLetterCapitalI,
    ScriptCapitalL,
    ScriptSmallL,
    LBBarSymbol,
    DoubleDashStruckCapitalN,
    NumeroSign,
    SoundRecordingCopyright,
    ScriptCapitalP,
    DoubleDashStruckCapitalP,
    DoubleDashStruckCapitalQ,
    ScriptCapitalR,
    BlackDashLetterCapitalR,
    DoubleDashStruckCapitalR,
    PrescriptionTake,
    Response,
    ServiceMark,
    TelephoneSign,
    TradeMarkSign,
    Versicle,
    DoubleDashStruckCapitalZ,
    OunceSign,
    OhmSign,
    InvertedOhmSign,
    BlackDashLetterCapitalZ,
    TurnedGreekSmallLetterIota,
    KelvinSign,
    AngstromSign,
    ScriptCapitalB,
    BlackDashLetterCapitalC,
    EstimatedSymbol,
    ScriptSmallE,
    ScriptCapitalE,
    ScriptCapitalF,
    TurnedCapitalF,
    ScriptCapitalM,
    ScriptSmallO,
    AlefSymbol,
    BetSymbol,
    GimelSymbol,
    DaletSymbol,
    InformationSource,
    RotatedCapitalQ,
    FacsimileSign,
    DoubleDashStruckSmallPi,
    DoubleDashStruckSmallGamma,
    DoubleDashStruckCapitalGamma,
    DoubleDashStruckCapitalPi,
    DoubleDashStruckNDashArySummation,
    TurnedSansDashSerifCapitalG,
    TurnedSansDashSerifCapitalL,
    ReversedSansDashSerifCapitalL,
    TurnedSansDashSerifCapitalY,
    DoubleDashStruckItalicCapitalD,
    DoubleDashStruckItalicSmallD,
    DoubleDashStruckItalicSmallE,
    DoubleDashStruckItalicSmallI,
    DoubleDashStruckItalicSmallJ,
    PropertyLine,
    TurnedAmpersand,
    PerSign,
    Aktieselskab,
    TurnedSmallF,
}

An enum to represent all characters in the LetterlikeSymbols block.

Variants

AccountOf

\u{2100}: '℀'

AddressedToTheSubject

\u{2101}: '℁'

DoubleDashStruckCapitalC

\u{2102}: 'ℂ'

DegreeCelsius

\u{2103}: '℃'

CentreLineSymbol

\u{2104}: '℄'

CareOf

\u{2105}: '℅'

CadaUna

\u{2106}: '℆'

EulerConstant

\u{2107}: 'ℇ'

Scruple

\u{2108}: '℈'

DegreeFahrenheit

\u{2109}: '℉'

ScriptSmallG

\u{210a}: 'ℊ'

ScriptCapitalH

\u{210b}: 'ℋ'

BlackDashLetterCapitalH

\u{210c}: 'ℌ'

DoubleDashStruckCapitalH

\u{210d}: 'ℍ'

PlanckConstant

\u{210e}: 'ℎ'

PlanckConstantOverTwoPi

\u{210f}: 'ℏ'

ScriptCapitalI

\u{2110}: 'ℐ'

BlackDashLetterCapitalI

\u{2111}: 'ℑ'

ScriptCapitalL

\u{2112}: 'ℒ'

ScriptSmallL

\u{2113}: 'ℓ'

LBBarSymbol

\u{2114}: '℔'

DoubleDashStruckCapitalN

\u{2115}: 'ℕ'

NumeroSign

\u{2116}: '№'

SoundRecordingCopyright

\u{2117}: '℗'

ScriptCapitalP

\u{2118}: '℘'

DoubleDashStruckCapitalP

\u{2119}: 'ℙ'

DoubleDashStruckCapitalQ

\u{211a}: 'ℚ'

ScriptCapitalR

\u{211b}: 'ℛ'

BlackDashLetterCapitalR

\u{211c}: 'ℜ'

DoubleDashStruckCapitalR

\u{211d}: 'ℝ'

PrescriptionTake

\u{211e}: '℞'

Response

\u{211f}: '℟'

ServiceMark

\u{2120}: '℠'

TelephoneSign

\u{2121}: '℡'

TradeMarkSign

\u{2122}: '™'

Versicle

\u{2123}: '℣'

DoubleDashStruckCapitalZ

\u{2124}: 'ℤ'

OunceSign

\u{2125}: '℥'

OhmSign

\u{2126}: 'Ω'

InvertedOhmSign

\u{2127}: '℧'

BlackDashLetterCapitalZ

\u{2128}: 'ℨ'

TurnedGreekSmallLetterIota

\u{2129}: '℩'

KelvinSign

\u{212a}: 'K'

AngstromSign

\u{212b}: 'Å'

ScriptCapitalB

\u{212c}: 'ℬ'

BlackDashLetterCapitalC

\u{212d}: 'ℭ'

EstimatedSymbol

\u{212e}: '℮'

ScriptSmallE

\u{212f}: 'ℯ'

ScriptCapitalE

\u{2130}: 'ℰ'

ScriptCapitalF

\u{2131}: 'ℱ'

TurnedCapitalF

\u{2132}: 'Ⅎ'

ScriptCapitalM

\u{2133}: 'ℳ'

ScriptSmallO

\u{2134}: 'ℴ'

AlefSymbol

\u{2135}: 'ℵ'

BetSymbol

\u{2136}: 'ℶ'

GimelSymbol

\u{2137}: 'ℷ'

DaletSymbol

\u{2138}: 'ℸ'

InformationSource

\u{2139}: 'ℹ'

RotatedCapitalQ

\u{213a}: '℺'

FacsimileSign

\u{213b}: '℻'

DoubleDashStruckSmallPi

\u{213c}: 'ℼ'

DoubleDashStruckSmallGamma

\u{213d}: 'ℽ'

DoubleDashStruckCapitalGamma

\u{213e}: 'ℾ'

DoubleDashStruckCapitalPi

\u{213f}: 'ℿ'

DoubleDashStruckNDashArySummation

\u{2140}: '⅀'

TurnedSansDashSerifCapitalG

\u{2141}: '⅁'

TurnedSansDashSerifCapitalL

\u{2142}: '⅂'

ReversedSansDashSerifCapitalL

\u{2143}: '⅃'

TurnedSansDashSerifCapitalY

\u{2144}: '⅄'

DoubleDashStruckItalicCapitalD

\u{2145}: 'ⅅ'

DoubleDashStruckItalicSmallD

\u{2146}: 'ⅆ'

DoubleDashStruckItalicSmallE

\u{2147}: 'ⅇ'

DoubleDashStruckItalicSmallI

\u{2148}: 'ⅈ'

DoubleDashStruckItalicSmallJ

\u{2149}: 'ⅉ'

PropertyLine

\u{214a}: '⅊'

TurnedAmpersand

\u{214b}: '⅋'

PerSign

\u{214c}: '⅌'

Aktieselskab

\u{214d}: '⅍'

TurnedSmallF

\u{214e}: 'ⅎ'

Methods

impl LetterlikeSymbols

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 LetterlikeSymbols

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

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

Important traits for LetterlikeSymbols

impl Iterator for LetterlikeSymbols type Item = Self;

fn clone(&self) -> LetterlikeSymbols

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Into<char> for LetterlikeSymbols

fn into(self) -> char

Performs the conversion.

impl Into<u32> for LetterlikeSymbols

fn into(self) -> u32

Performs the conversion.

impl Eq for LetterlikeSymbols

impl Copy for LetterlikeSymbols

impl Hash for LetterlikeSymbols

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 LetterlikeSymbols

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

Formats the value using the given formatter.

impl TryFrom<char> for LetterlikeSymbols

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 LetterlikeSymbols

type Error = ()

The type returned in the event of a conversion error.

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

Performs the conversion.