Struct SpatialHash 

pub struct SpatialHash { /* private fields */ }

A simple spatial hash grid for broad-phase collision detection.

Divides the world into cells of cell_size and assigns colliders to cells. Only tests collisions between objects in the same or neighboring cells.

Implementations

impl SpatialHash

pub fn new(cell_size: f32) -> Self

Create a new spatial hash with the given cell size.

pub fn clear(&mut self)

Clear all entries.

pub fn insert(&mut self, id: usize, pos: Vec2, radius: f32)

Insert a collider at the given position with the given radius.

pub fn query_pairs(&self) -> Vec<(usize, usize)>

Query all potential collision pairs. Returns (id_a, id_b) pairs.

pub fn query_near(&self, point: Vec2, radius: f32) -> Vec<usize>

Query all objects near a point within radius.