Struct Grid

pub struct Grid<T> {
    pub data: Vec<T>,
    pub width: usize,
    pub height: usize,
}

A 2D grid containing some arbitrary data.

Fields

data: Vec<T>

Logically represents a 2D vector. Row-major ordering.

width: usize

height: usize

Implementations

impl<T: Copy> Grid<T>

pub fn new(width: usize, height: usize, default: T) -> Grid<T>

pub fn idx(&self, x: usize, y: usize) -> usize

Calculate the index from a given (x, y). Doesn’t do any bounds checking.

pub fn xy(&self, idx: usize) -> (usize, usize)

The inverse of idx. No bounds checking.

pub fn orthogonal_neighbors( &self, center_x: usize, center_y: usize, ) -> Vec<(usize, usize)>

From one tile, calculate the 4 orthogonal neighbors. Includes bounds checking.