Struct SpatialHashGrid 

pub struct SpatialHashGrid { /* private fields */ }

Dense spatial grid for O(1) entity lookup by position. Grid cells are cell_size x cell_size world units. Uses u64 entity handles — zero-copy, no per-entity String allocation.

Implementations

impl SpatialHashGrid

pub fn new(cell_size: i32) -> Self

Create a new spatial hash grid with the given cell size.

pub fn cell_key(&self, x: i32, y: i32) -> (i32, i32)

Compute the cell key for a world-space position.

pub fn insert(&mut self, entity_id: u64, x: i32, y: i32)

Insert an entity at world position (x, y).

pub fn remove(&mut self, entity_id: u64, x: i32, y: i32)

Remove an entity from its cell at world position (x, y). Removes the first occurrence. No-ops if not present.

pub fn query_radius(&self, cx: i32, cy: i32, radius: i32) -> Vec<u64>

Query all entities within radius world units of (cx, cy). Scans O(radius^2 / cell_size^2) cells.

pub fn query_cell(&self, x: i32, y: i32) -> &[u64]

Return all entity IDs in the cell containing world position (x, y).

pub fn clear(&mut self)

Clear all cells. Retains allocated capacity.

pub fn entity_count(&self) -> usize

Return the total number of entity references across all cells.

pub fn cell_count(&self) -> usize

Return the number of occupied cells.

pub fn cell_size(&self) -> i32

Return the cell size.