pub struct GpuSpatialHashLayout<T: Clone> { /* private fields */ }Expand description
A spatial hash with an interleaved, flat-array layout for GPU upload.
Data is stored as sorted arrays of cell keys and per-item records, matching the layout expected by GPU compute shaders.
Implementations§
Source§impl<T: Clone> GpuSpatialHashLayout<T>
impl<T: Clone> GpuSpatialHashLayout<T>
Sourcepub fn build(entries: &[(usize, [f32; 3], T)], cell_size: f32) -> Self
pub fn build(entries: &[(usize, [f32; 3], T)], cell_size: f32) -> Self
Build the GPU-friendly layout from a slice of (id, position, data).
Sourcepub fn query_cell_flat(&self, cx: i32, cy: i32, cz: i32) -> Vec<(usize, &T)>
pub fn query_cell_flat(&self, cx: i32, cy: i32, cz: i32) -> Vec<(usize, &T)>
Query items in a specific cell.
Sourcepub fn to_flat_f32_buffer(&self) -> Vec<f32>
pub fn to_flat_f32_buffer(&self) -> Vec<f32>
Export all items as a flat f32 buffer for GPU upload.
Format per item: [x, y, z, cell_x_f32, cell_y_f32, cell_z_f32]
Auto Trait Implementations§
impl<T> Freeze for GpuSpatialHashLayout<T>
impl<T> RefUnwindSafe for GpuSpatialHashLayout<T>where
T: RefUnwindSafe,
impl<T> Send for GpuSpatialHashLayout<T>where
T: Send,
impl<T> Sync for GpuSpatialHashLayout<T>where
T: Sync,
impl<T> Unpin for GpuSpatialHashLayout<T>where
T: Unpin,
impl<T> UnsafeUnpin for GpuSpatialHashLayout<T>
impl<T> UnwindSafe for GpuSpatialHashLayout<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.