Struct Grid 

pub struct Grid { /* private fields */ }

Dense row-major rectangular map: walkability, traversal_cost, optional reachability.

Shared substrate for online crate::Pathfinder algorithms (4-connected). Open cells default to unit cost; blocked cells are excluded from neighbors. Cached reachability::GridReachabilityIndex is optional and cleared on walkability edits.

Implementations

impl Grid

pub fn new(width: usize, height: usize) -> Result<Self, GridBuildError>

Creates a grid with non-zero dimensions.

Errors

Returns GridBuildError when either dimension is zero, the cell count overflows, or backing storage cannot be reserved.

pub const fn builder(width: usize, height: usize) -> GridBuilder

Starts a builder for a grid with the supplied dimensions.

pub fn try_from_rows<I, S>(rows: I) -> Result<Self, GridBuildError>

where I: IntoIterator<Item = S>, S: AsRef<str>,

Parses a rectangular grid from textual rows.

. creates an open cell with cost 1, # creates a blocked cell, and 1 through 9 create open cells with the corresponding traversal cost.

Errors

Returns GridBuildError for empty, zero-width, ragged, or invalid input, or when the resulting grid cannot be allocated.

pub fn index_reachability(&mut self)

Builds or rebuilds the cached reachability index from the current cells.

pub fn is_reachable(&self, start: Point, goal: Point) -> bool

Returns whether start and goal share a walkable 4-way component.

Without a prior Self::index_reachability call, always returns true so search is not short-circuited.

pub const fn width(&self) -> usize

Column count (cells along x).

pub const fn height(&self) -> usize

Row count (cells along y).

pub fn cell_count(&self) -> usize

Total cells (width * height).

pub fn contains(&self, point: Point) -> bool

Whether point lies inside the grid bounds (walkability is separate).

pub fn cell(&self, point: Point) -> Option<Cell>

Cell state at point, or None when out of bounds.

pub fn set_cell( &mut self, point: Point, cell: Cell, ) -> Result<(), GridEditError>

Sets walkability; clears the cached reachability index when the value changes.

Blocking an open cell hides its traversal cost from queries but retains the stored cost so reopening restores it.

Errors

Returns GridEditError::OutOfBounds if point is outside the grid.

pub fn is_walkable(&self, point: Point) -> bool

In-bounds and Cell::Open; out-of-bounds and blocked cells are not walkable.

pub fn path_is_walkable(&self, points: &[Point]) -> bool

Checks that every point is open and every consecutive pair is an orthogonal unit step.

pub fn segment_is_walkable(&self, start: Point, end: Point) -> bool

Returns whether start and end form a single orthogonal unit edge between open cells.

pub fn traversal_cost(&self, point: Point) -> Option<usize>

Returns the traversal cost for an open cell, or None if blocked or out of bounds.

pub fn set_traversal_cost( &mut self, point: Point, cost: usize, ) -> Result<(), GridEditError>

Sets a positive traversal cost for a walkable cell.

Errors

Returns GridEditError if the cost is zero, the point is outside the grid, or the cell is blocked.

pub fn neighbors4(&self, point: Point) -> Vec<Point>

Walkable 4-connected neighbors of point, in fixed axis order.

Trait Implementations

impl Clone for Grid

fn clone(&self) -> Grid

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Grid

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

Formats the value using the given formatter.

impl Eq for Grid

impl PartialEq for Grid

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Grid