Struct cozy_chess::PieceMoves

pub struct PieceMoves {
    pub piece: Piece,
    pub from: Square,
    pub to: BitBoard,
}

A compact structure representing multiple moves for a piece on the board. Iterate it to unpack its moves.

Fields

piece: Piece

The Piece that is moved.

from: Square

The square to move the piece from.

to: BitBoard

The possible destination squares.

Implementations

impl PieceMoves

pub fn len(&self) -> usize

Get the number of Moves.

pub fn is_empty(&self) -> bool

Check if there are no Moves.

pub fn has(&self, mv: Move) -> bool

Check if it contains a given Move.

Trait Implementations

impl Clone for PieceMoves

fn clone(&self) -> PieceMoves

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PieceMoves

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

Formats the value using the given formatter.

impl Hash for PieceMoves

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl IntoIterator for PieceMoves

type Item = Move

The type of the elements being iterated over.

type IntoIter = PieceMovesIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for PieceMoves

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

impl Eq for PieceMoves

impl StructuralPartialEq for PieceMoves