Struct TileNet

pub struct TileNet<T> { /* private fields */ }

TileNet is the main class in this library

It represents a 2D space with dimensions rows x columns. Each index represents a point in space. Row ‘n’ and column ‘m’ denote the tile from x from n inclusive to n+1 exclusive, and y from m inclusive to m+1 exclusive.

use tile_net::TileNet;
#[derive(Clone, Debug, Default)]
struct Example(i32);
let my_net = TileNet::<Example>::new(10, 10);
println!("{:?}", my_net);

Implementations

impl TileNet<usize>

pub fn sample() -> TileNet<usize>

Create a simple sample grid

impl<T> TileNet<T>

where T: Clone,

pub fn prepare(&mut self) -> TileNetProxy<'_, T>

Create a proxy to be able to get the span of a change

pub fn get_raw(&self) -> &[T]

Get the raw array behind the tilenet

pub fn set_box( &mut self, value: &T, start: (usize, usize), stop: (usize, usize), )

Set a box in the tilenet

pub fn set_row(&mut self, value: &T, row: usize)

Set a row

pub fn set_col(&mut self, value: &T, col: usize)

Set a column

pub fn set(&mut self, value: &T, p: (usize, usize))

Set a single grid point

impl<T> TileNet<T>

where T: Clone + Default,

pub fn new(x: usize, y: usize) -> TileNet<T>

Create a new tilenet of the size (cols, rows)

The tiles will be Default-created

pub fn resize(&mut self, m: (usize, usize))

Resize the grid

If the grid grows, new tiles will be Default-created

impl<T> TileNet<T>

where T: Default,

pub fn from_iter<I>(columns: usize, iter: I) -> TileNet<T>

where I: Iterator<Item = T>,

Create a tilenet from an iterator

Takes a column count and an iterator. If the iterator does not describe the entire box the remaining elements are filled in by Default.

impl<T> TileNet<T>

pub fn row_count(&self) -> usize

Compute the row count

pub fn col_count(&self) -> usize

Get the column count

pub fn get(&self, p: (usize, usize)) -> Option<&T>

Get a reference to a 2D index

pub fn get_size(&self) -> (usize, usize)

Get a tuple that describes the size as (cols, rows)

pub fn view_all(&self) -> TileView<'_, T>

Create a proxy view that iterates over all tiles

pub fn view_center_f32( &self, position: (f32, f32), span: (usize, usize), ) -> TileView<'_, T>

Create a proxy view with a span from the center using a float position

pub fn view_center( &self, position: (usize, usize), span: (usize, usize), ) -> TileView<'_, T>

Create a proxy view with a span from the center using an integer position

pub fn view_box( &self, rectangle: (usize, usize, usize, usize), ) -> TileView<'_, T>

Create a view box that iterates over tiles within that box

pub fn get_mut(&mut self, p: (usize, usize)) -> Option<&mut T>

Get a mutable reference to a tile

pub fn collide_set<I>(&self, list: I) -> TileSet<'_, T, I>

where I: Iterator<Item = (i32, i32)>,

Create an iterator of tiles from an iterator over indices

Trait Implementations

impl<T: Clone> Clone for TileNet<T>

fn clone(&self) -> TileNet<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for TileNet<T>

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

Formats the value using the given formatter.