Struct goban::pieces::goban::Goban

pub struct Goban { /* fields omitted */ }

Methods

impl Goban

pub fn new(size: usize) -> Goban

pub fn clear(&mut self)

Removes all the stones from the goban.

pub fn push(     &mut self,     coord: &Coord,     color: Color ) -> Result<&mut Goban, String>

pub fn push_stone(&mut self, stone: &Stone) -> Result<&mut Goban, String>

pub fn get(&self, coord: &Coord) -> Color

pub fn push_many<'a>(     &'a mut self,     coords: impl Iterator<Item = &'a Coord>,     value: Color )

Put many stones.

pub fn pop(&mut self) -> &mut Self

Removes the last

pub fn get_neighbors(     &self,     coord: &Coord ) -> impl Iterator<Item = Stone> + '_

Get all the neighbors to the coordinate

pub fn get_neighbors_stones(     &self,     coord: &Coord ) -> impl Iterator<Item = Stone> + '_

Get all the stones that are neighbor to the coord except empty intersections

pub fn get_stones(     &self ) -> impl Iterator<Item = Stone> + '_

Get all the stones except "Empty stones"

pub fn get_stones_by_color(     &self,     color: Color ) -> impl Iterator<Item = Stone> + '_

Get stones by their color.

pub fn get_liberties(     &self,     point: &Stone ) -> impl Iterator<Item = Stone> + '_

Returns the empty stones connected to the point

pub fn get_nb_liberties(&self, point: &Stone) -> u8

Returns the number of liberties. of the stone

pub fn has_liberties(&self, point: &Stone) -> bool

Returns true if the stone has liberties.

pub fn pretty_string(&self) -> String

impl Goban

pub fn get_dead_stones(&self) -> Vec<HashSet<Stone>>

Get all the groups of connected atari stones

pub fn get_dead_stones_color(&self, color: Color) -> Vec<HashSet<Stone>>

Get all the groups of connected atari stones of a color. if the color is empty it's an undefined behaviour

pub fn bfs(&self, point: &Stone) -> HashSet<Stone>

Can get a group of stones and his neighbors with a Breadth First Search, works for Empty stones too.

pub fn get_strongly_connected_stones(     &self,     stones: impl Iterator<Item = Stone> ) -> Vec<HashSet<Stone>>

Use a breadth first search to deduce the groups of connected stones. Get stones connected. [[x,y,z],[a,e,r]] example of return.

Trait Implementations

impl Eq for Goban

impl PartialEq<Goban> for Goban

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

fn clone(&self) -> Goban

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Display for Goban

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

Formats the value using the given formatter.