Struct SpatialHash3D 

pub struct SpatialHash3D<T: Clone> {
    pub cell_size: f64,
    pub n_items: usize,
    /* private fields */
}

A uniform-grid spatial hash that maps 3-D positions to arbitrary data.

Items are bucketed by their cell coordinate (floor(x/cell_size), floor(y/cell_size), floor(z/cell_size)).

Fields

cell_size: f64

Side length of each cubic cell.

n_items: usize

Total number of items currently stored.

Implementations

impl<T: Clone> SpatialHash3D<T>

pub fn new(cell_size: f64) -> Self

Creates a new empty spatial hash with the given cell size.

pub fn cell_coord(&self, x: f64) -> i32

Maps a single coordinate to its cell index via floor(x / cell_size).

pub fn cell_key(&self, pos: [f64; 3]) -> (i32, i32, i32)

Returns the 3-D cell key for a world-space position.

pub fn insert(&mut self, id: usize, pos: [f64; 3], data: T) -> (i32, i32, i32)

Inserts (id, data) at pos and returns the cell key it was placed in.

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

Removes the entry with the given id from the cell that contains pos.

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

Returns all items within the cells overlapping a sphere of radius centred at center. Note: without stored positions, exact distance filtering is not possible; use SpatialHashPos3D for exact queries.

pub fn query_cell(&self, key: (i32, i32, i32)) -> Vec<(usize, &T)>

Returns all items stored in the given cell key.

pub fn clear(&mut self)

Removes all items.

pub fn len(&self) -> usize

Returns the total number of items stored.

pub fn is_empty(&self) -> bool

Returns true if no items are stored.

pub fn n_cells(&self) -> usize

Returns the number of non-empty cells.