Struct Node 

pub struct Node { /* private fields */ }

A coordinate inside of a Grid.

Implementations

impl Node

pub fn cover_row(self_ptr: *mut Node)

Cover every Node that is horizontally adjacent to this Node.

This Node is not covered.

pub fn uncover_row(self_ptr: *mut Self)

Uncover every Node that is horizontally adjacent to this Node.

This Node is not uncovered.

pub fn row_index(self_ptr: *const Self) -> usize

Return the row index of this Node.

pub fn column_index(self_ptr: *const Self) -> usize

Return the column index of this Node.

pub fn column_ptr(self_ptr: *const Self) -> *mut Column

Return a mut pointer to the Column of this Node.

pub fn neighbors(self_ptr: *const Self) -> impl Iterator<Item = *const Node>

Return an iterator over all Nodes that are adjacent to this Node.

Trait Implementations

impl Debug for Node

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

Formats the value using the given formatter.

impl Hash for Node

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 PartialEq for Node

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Eq for Node

impl StructuralPartialEq for Node