Enum unicode_types::chess_symbols::ChessSymbols

pub enum ChessSymbols {
    NeutralChessKing,
    NeutralChessQueen,
    NeutralChessRook,
    NeutralChessBishop,
    NeutralChessKnight,
    NeutralChessPawn,
    WhiteChessKnightRotatedFortyDashFiveDegrees,
    BlackChessKnightRotatedFortyDashFiveDegrees,
    NeutralChessKnightRotatedFortyDashFiveDegrees,
    WhiteChessKingRotatedNinetyDegrees,
    WhiteChessQueenRotatedNinetyDegrees,
    WhiteChessRookRotatedNinetyDegrees,
    WhiteChessBishopRotatedNinetyDegrees,
    WhiteChessKnightRotatedNinetyDegrees,
    WhiteChessPawnRotatedNinetyDegrees,
    BlackChessKingRotatedNinetyDegrees,
    BlackChessQueenRotatedNinetyDegrees,
    BlackChessRookRotatedNinetyDegrees,
    BlackChessBishopRotatedNinetyDegrees,
    BlackChessKnightRotatedNinetyDegrees,
    BlackChessPawnRotatedNinetyDegrees,
    NeutralChessKingRotatedNinetyDegrees,
    NeutralChessQueenRotatedNinetyDegrees,
    NeutralChessRookRotatedNinetyDegrees,
    NeutralChessBishopRotatedNinetyDegrees,
    NeutralChessKnightRotatedNinetyDegrees,
    NeutralChessPawnRotatedNinetyDegrees,
    WhiteChessKnightRotatedOneHundredThirtyDashFiveDegrees,
    BlackChessKnightRotatedOneHundredThirtyDashFiveDegrees,
    NeutralChessKnightRotatedOneHundredThirtyDashFiveDegrees,
    WhiteChessTurnedKing,
    WhiteChessTurnedQueen,
    WhiteChessTurnedRook,
    WhiteChessTurnedBishop,
    WhiteChessTurnedKnight,
    WhiteChessTurnedPawn,
    BlackChessTurnedKing,
    BlackChessTurnedQueen,
    BlackChessTurnedRook,
    BlackChessTurnedBishop,
    BlackChessTurnedKnight,
    BlackChessTurnedPawn,
    NeutralChessTurnedKing,
    NeutralChessTurnedQueen,
    NeutralChessTurnedRook,
    NeutralChessTurnedBishop,
    NeutralChessTurnedKnight,
    NeutralChessTurnedPawn,
    WhiteChessKnightRotatedTwoHundredTwentyDashFiveDegrees,
    BlackChessKnightRotatedTwoHundredTwentyDashFiveDegrees,
    NeutralChessKnightRotatedTwoHundredTwentyDashFiveDegrees,
    WhiteChessKingRotatedTwoHundredSeventyDegrees,
    WhiteChessQueenRotatedTwoHundredSeventyDegrees,
    WhiteChessRookRotatedTwoHundredSeventyDegrees,
    WhiteChessBishopRotatedTwoHundredSeventyDegrees,
    WhiteChessKnightRotatedTwoHundredSeventyDegrees,
    WhiteChessPawnRotatedTwoHundredSeventyDegrees,
    BlackChessKingRotatedTwoHundredSeventyDegrees,
    BlackChessQueenRotatedTwoHundredSeventyDegrees,
    BlackChessRookRotatedTwoHundredSeventyDegrees,
    BlackChessBishopRotatedTwoHundredSeventyDegrees,
    BlackChessKnightRotatedTwoHundredSeventyDegrees,
    BlackChessPawnRotatedTwoHundredSeventyDegrees,
    NeutralChessKingRotatedTwoHundredSeventyDegrees,
    NeutralChessQueenRotatedTwoHundredSeventyDegrees,
    NeutralChessRookRotatedTwoHundredSeventyDegrees,
    NeutralChessBishopRotatedTwoHundredSeventyDegrees,
    NeutralChessKnightRotatedTwoHundredSeventyDegrees,
    NeutralChessPawnRotatedTwoHundredSeventyDegrees,
    WhiteChessKnightRotatedThreeHundredFifteenDegrees,
    BlackChessKnightRotatedThreeHundredFifteenDegrees,
    NeutralChessKnightRotatedThreeHundredFifteenDegrees,
    WhiteChessEquihopper,
    BlackChessEquihopper,
    NeutralChessEquihopper,
    WhiteChessEquihopperRotatedNinetyDegrees,
    BlackChessEquihopperRotatedNinetyDegrees,
    NeutralChessEquihopperRotatedNinetyDegrees,
    WhiteChessKnightDashQueen,
    WhiteChessKnightDashRook,
    WhiteChessKnightDashBishop,
    BlackChessKnightDashQueen,
    BlackChessKnightDashRook,
    BlackChessKnightDashBishop,
    XiangqiRedGeneral,
    XiangqiRedMandarin,
    XiangqiRedElephant,
    XiangqiRedHorse,
    XiangqiRedChariot,
    XiangqiRedCannon,
    XiangqiRedSoldier,
    XiangqiBlackGeneral,
    XiangqiBlackMandarin,
    XiangqiBlackElephant,
    XiangqiBlackHorse,
    XiangqiBlackChariot,
    XiangqiBlackCannon,
    XiangqiBlackSoldier,
}

An enum to represent all characters in the ChessSymbols block.

Variants

NeutralChessKing

\u{1fa00}: '🨀'

NeutralChessQueen

\u{1fa01}: '🨁'

NeutralChessRook

\u{1fa02}: '🨂'

NeutralChessBishop

\u{1fa03}: '🨃'

NeutralChessKnight

\u{1fa04}: '🨄'

NeutralChessPawn

\u{1fa05}: '🨅'

WhiteChessKnightRotatedFortyDashFiveDegrees

\u{1fa06}: '🨆'

BlackChessKnightRotatedFortyDashFiveDegrees

\u{1fa07}: '🨇'

NeutralChessKnightRotatedFortyDashFiveDegrees

\u{1fa08}: '🨈'

WhiteChessKingRotatedNinetyDegrees

\u{1fa09}: '🨉'

WhiteChessQueenRotatedNinetyDegrees

\u{1fa0a}: '🨊'

WhiteChessRookRotatedNinetyDegrees

\u{1fa0b}: '🨋'

WhiteChessBishopRotatedNinetyDegrees

\u{1fa0c}: '🨌'

WhiteChessKnightRotatedNinetyDegrees

\u{1fa0d}: '🨍'

WhiteChessPawnRotatedNinetyDegrees

\u{1fa0e}: '🨎'

BlackChessKingRotatedNinetyDegrees

\u{1fa0f}: '🨏'

BlackChessQueenRotatedNinetyDegrees

\u{1fa10}: '🨐'

BlackChessRookRotatedNinetyDegrees

\u{1fa11}: '🨑'

BlackChessBishopRotatedNinetyDegrees

\u{1fa12}: '🨒'

BlackChessKnightRotatedNinetyDegrees

\u{1fa13}: '🨓'

BlackChessPawnRotatedNinetyDegrees

\u{1fa14}: '🨔'

NeutralChessKingRotatedNinetyDegrees

\u{1fa15}: '🨕'

NeutralChessQueenRotatedNinetyDegrees

\u{1fa16}: '🨖'

NeutralChessRookRotatedNinetyDegrees

\u{1fa17}: '🨗'

NeutralChessBishopRotatedNinetyDegrees

\u{1fa18}: '🨘'

NeutralChessKnightRotatedNinetyDegrees

\u{1fa19}: '🨙'

NeutralChessPawnRotatedNinetyDegrees

\u{1fa1a}: '🨚'

WhiteChessKnightRotatedOneHundredThirtyDashFiveDegrees

\u{1fa1b}: '🨛'

BlackChessKnightRotatedOneHundredThirtyDashFiveDegrees

\u{1fa1c}: '🨜'

NeutralChessKnightRotatedOneHundredThirtyDashFiveDegrees

\u{1fa1d}: '🨝'

WhiteChessTurnedKing

\u{1fa1e}: '🨞'

WhiteChessTurnedQueen

\u{1fa1f}: '🨟'

WhiteChessTurnedRook

\u{1fa20}: '🨠'

WhiteChessTurnedBishop

\u{1fa21}: '🨡'

WhiteChessTurnedKnight

\u{1fa22}: '🨢'

WhiteChessTurnedPawn

\u{1fa23}: '🨣'

BlackChessTurnedKing

\u{1fa24}: '🨤'

BlackChessTurnedQueen

\u{1fa25}: '🨥'

BlackChessTurnedRook

\u{1fa26}: '🨦'

BlackChessTurnedBishop

\u{1fa27}: '🨧'

BlackChessTurnedKnight

\u{1fa28}: '🨨'

BlackChessTurnedPawn

\u{1fa29}: '🨩'

NeutralChessTurnedKing

\u{1fa2a}: '🨪'

NeutralChessTurnedQueen

\u{1fa2b}: '🨫'

NeutralChessTurnedRook

\u{1fa2c}: '🨬'

NeutralChessTurnedBishop

\u{1fa2d}: '🨭'

NeutralChessTurnedKnight

\u{1fa2e}: '🨮'

NeutralChessTurnedPawn

\u{1fa2f}: '🨯'

WhiteChessKnightRotatedTwoHundredTwentyDashFiveDegrees

\u{1fa30}: '🨰'

BlackChessKnightRotatedTwoHundredTwentyDashFiveDegrees

\u{1fa31}: '🨱'

NeutralChessKnightRotatedTwoHundredTwentyDashFiveDegrees

\u{1fa32}: '🨲'

WhiteChessKingRotatedTwoHundredSeventyDegrees

\u{1fa33}: '🨳'

WhiteChessQueenRotatedTwoHundredSeventyDegrees

\u{1fa34}: '🨴'

WhiteChessRookRotatedTwoHundredSeventyDegrees

\u{1fa35}: '🨵'

WhiteChessBishopRotatedTwoHundredSeventyDegrees

\u{1fa36}: '🨶'

WhiteChessKnightRotatedTwoHundredSeventyDegrees

\u{1fa37}: '🨷'

WhiteChessPawnRotatedTwoHundredSeventyDegrees

\u{1fa38}: '🨸'

BlackChessKingRotatedTwoHundredSeventyDegrees

\u{1fa39}: '🨹'

BlackChessQueenRotatedTwoHundredSeventyDegrees

\u{1fa3a}: '🨺'

BlackChessRookRotatedTwoHundredSeventyDegrees

\u{1fa3b}: '🨻'

BlackChessBishopRotatedTwoHundredSeventyDegrees

\u{1fa3c}: '🨼'

BlackChessKnightRotatedTwoHundredSeventyDegrees

\u{1fa3d}: '🨽'

BlackChessPawnRotatedTwoHundredSeventyDegrees

\u{1fa3e}: '🨾'

NeutralChessKingRotatedTwoHundredSeventyDegrees

\u{1fa3f}: '🨿'

NeutralChessQueenRotatedTwoHundredSeventyDegrees

\u{1fa40}: '🩀'

NeutralChessRookRotatedTwoHundredSeventyDegrees

\u{1fa41}: '🩁'

NeutralChessBishopRotatedTwoHundredSeventyDegrees

\u{1fa42}: '🩂'

NeutralChessKnightRotatedTwoHundredSeventyDegrees

\u{1fa43}: '🩃'

NeutralChessPawnRotatedTwoHundredSeventyDegrees

\u{1fa44}: '🩄'

WhiteChessKnightRotatedThreeHundredFifteenDegrees

\u{1fa45}: '🩅'

BlackChessKnightRotatedThreeHundredFifteenDegrees

\u{1fa46}: '🩆'

NeutralChessKnightRotatedThreeHundredFifteenDegrees

\u{1fa47}: '🩇'

WhiteChessEquihopper

\u{1fa48}: '🩈'

BlackChessEquihopper

\u{1fa49}: '🩉'

NeutralChessEquihopper

\u{1fa4a}: '🩊'

WhiteChessEquihopperRotatedNinetyDegrees

\u{1fa4b}: '🩋'

BlackChessEquihopperRotatedNinetyDegrees

\u{1fa4c}: '🩌'

NeutralChessEquihopperRotatedNinetyDegrees

\u{1fa4d}: '🩍'

WhiteChessKnightDashQueen

\u{1fa4e}: '🩎'

WhiteChessKnightDashRook

\u{1fa4f}: '🩏'

WhiteChessKnightDashBishop

\u{1fa50}: '🩐'

BlackChessKnightDashQueen

\u{1fa51}: '🩑'

BlackChessKnightDashRook

\u{1fa52}: '🩒'

BlackChessKnightDashBishop

\u{1fa53}: '🩓'

XiangqiRedGeneral

\u{1fa60}: '🩠'

XiangqiRedMandarin

\u{1fa61}: '🩡'

XiangqiRedElephant

\u{1fa62}: '🩢'

XiangqiRedHorse

\u{1fa63}: '🩣'

XiangqiRedChariot

\u{1fa64}: '🩤'

XiangqiRedCannon

\u{1fa65}: '🩥'

XiangqiRedSoldier

\u{1fa66}: '🩦'

XiangqiBlackGeneral

\u{1fa67}: '🩧'

XiangqiBlackMandarin

\u{1fa68}: '🩨'

XiangqiBlackElephant

\u{1fa69}: '🩩'

XiangqiBlackHorse

\u{1fa6a}: '🩪'

XiangqiBlackChariot

\u{1fa6b}: '🩫'

XiangqiBlackCannon

\u{1fa6c}: '🩬'

XiangqiBlackSoldier

\u{1fa6d}: '🩭'

Methods

impl ChessSymbols

pub fn new() -> Self

The character with the lowest index in this unicode block

pub fn name(&self) -> String

The character's name, in sentence case

Trait Implementations

impl Iterator for ChessSymbols

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

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

Important traits for ChessSymbols

impl Iterator for ChessSymbols type Item = Self;

fn clone(&self) -> ChessSymbols

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Into<char> for ChessSymbols

fn into(self) -> char

Performs the conversion.

impl Into<u32> for ChessSymbols

fn into(self) -> u32

Performs the conversion.

impl Eq for ChessSymbols

impl Copy for ChessSymbols

impl Hash for ChessSymbols

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 ChessSymbols

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

Formats the value using the given formatter.

impl TryFrom<char> for ChessSymbols

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 ChessSymbols

type Error = ()

The type returned in the event of a conversion error.

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

Performs the conversion.