Enum chess::Rank

#[repr(u8)]
pub enum Rank {
    First,
    Second,
    Third,
    Fourth,
    Fifth,
    Sixth,
    Seventh,
    Eighth,
}

Describe a rank (row) on a chess board.

Variants

First

Second

Third

Fourth

Fifth

Sixth

Seventh

Eighth

Implementations

impl Rank

pub fn new(index: usize) -> Self

Gets a Rank from an integer index.

Note: If index is not in the range 0..=7, wrap around.

pub fn to_index(&self) -> usize

Convert this Rank into a usize.

pub fn up(&self) -> Self

Go one rank up.

Note: If impossible, wrap around.

pub fn down(&self) -> Self

Go one rank down.

Note: If impossible, wrap around.

pub fn distance(&self, other: Rank) -> u32

Distance between two Rank.

pub fn between(&self, lower_bound: Rank, upper_bound: Rank) -> bool

Verify if the Rank is between two other (i.e. lower <= self <= upper).

Assume that lower_bound <= upper_bound.

Trait Implementations

impl Clone for Rank

fn clone(&self) -> Rank

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Rank

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

Formats the value using the given formatter.

impl FromStr for Rank

type Err = Error

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl Ord for Rank

fn cmp(&self, other: &Rank) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<Rank> for Rank

fn eq(&self, other: &Rank) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd<Rank> for Rank

fn partial_cmp(&self, other: &Rank) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for Rank

impl Eq for Rank

impl StructuralEq for Rank

impl StructuralPartialEq for Rank