Struct PersistentSpatialHash 

pub struct PersistentSpatialHash<T: Clone> { /* private fields */ }

A spatial hash that persists across frames.

Tracks the last known position of each object so that insert_or_update correctly removes the object from its old cell before re-inserting.

Implementations

impl<T: Clone> PersistentSpatialHash<T>

pub fn new(cell_size: f64) -> Self

Create a new persistent hash with the given cell size.

pub fn insert_or_update(&mut self, id: usize, pos: [f64; 3], data: T)

Insert a new object or update an existing one.

If the object already exists, it is first removed from its old cell.

pub fn remove(&mut self, id: usize)

Remove an object.

pub fn query_radius(&self, center: [f64; 3], radius: f64) -> Vec<(usize, &T)>

Query all items within radius of center.

pub fn query_aabb(&self, min: [f64; 3], max: [f64; 3]) -> Vec<(usize, &T)>

Query all items in an AABB.

pub fn len(&self) -> usize

Number of objects.

pub fn is_empty(&self) -> bool

Whether the hash is empty.

pub fn advance_frame(&mut self)

Advance the frame counter (call once per simulation step).

pub fn current_frame(&self) -> u64

Current frame number.

pub fn statistics(&self) -> SpatialHashStats

Compute statistics.