Struct Tilemap 

pub struct Tilemap {
    pub atlas: TextureId,
    pub atlas_size: [u32; 2],
    pub tile_size: [u32; 2],
    pub width: u32,
    pub height: u32,
    pub origin: [f32; 2],
    pub tiles: Vec<u16>,
    pub layer: i16,
    /* private fields */
}

Grid tilemap backed by an atlas. tiles indexes into the atlas left-to-right, top-to-bottom; index 0 is treated as empty and skipped.

The map is split into square chunks (default 32x32 tiles). Each chunk caches its sprite instances and only rebuilds them when a tile in it changes (or the origin moves). On draw, chunks whose world-space AABB does not intersect the camera’s visible rectangle are skipped, so a large map only touches the tiles actually on screen.

Fields

atlas: TextureId

atlas_size: [u32; 2]

tile_size: [u32; 2]

width: u32

height: u32

origin: [f32; 2]

Origin in world space (top-left corner of cell (0,0)).

tiles: Vec<u16>

layer: i16

Implementations

impl Tilemap

pub fn new( atlas: TextureId, atlas_size: [u32; 2], tile_size: [u32; 2], width: u32, height: u32, ) -> Tilemap

pub fn with_chunk_size( atlas: TextureId, atlas_size: [u32; 2], tile_size: [u32; 2], width: u32, height: u32, chunk_size: u32, ) -> Tilemap

Like Tilemap::new but with an explicit chunk size (in tiles).

pub fn set(&mut self, x: u32, y: u32, tile: u16)

pub fn get(&self, x: u32, y: u32) -> u16

pub fn mark_all_dirty(&mut self)

Mark every chunk dirty so the next Tilemap::draw rebuilds all instances. Call this after mutating tiles, atlas_size, or tile_size directly (bypassing set).

pub fn draw(&mut self, painter: &mut Painter<'_>)

Rebuild dirty chunks, then emit the instances of every chunk that overlaps the camera’s visible rectangle into the sprite batcher.