Struct ParallelSpatialHash 

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

A parallel-build spatial hash.

All entries are inserted in one batch call, making the build trivially parallelisable (simulated here sequentially). Queries are identical to SpatialHashPos3D.

Implementations

impl<T: Clone> ParallelSpatialHash<T>

pub fn build(entries: &[(usize, [f64; 3], T)], cell_size: f64) -> Self

Build from a slice of (id, position, data) tuples.

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 within an AABB.

pub fn len(&self) -> usize

Number of items.

pub fn is_empty(&self) -> bool

Whether the hash is empty.

pub fn n_cells(&self) -> usize

Number of occupied cells.