Struct salva3d::geometry::HGrid

source ·
pub struct HGrid<T> { /* private fields */ }
Expand description

A grid based on spacial hashing.

Implementations§

source§

impl<T> HGrid<T>

source

pub fn new(cell_width: Real) -> Self

Initialize a grid where each cell has the width cell_width.

source

pub fn cell_width(&self) -> Real

The width of a cell of this spacial grid.

source

pub fn key(&self, point: &Point<Real>) -> Point<i64>

Computes the logical grid cell containing point.

source

pub fn clear(&mut self)

Removes all elements from this grid.

source

pub fn insert(&mut self, point: &Point<Real>, element: T)

Inserts the given element into the cell containing the given point.

source

pub fn cell_containing_point(&self, point: &Point<Real>) -> Option<&Vec<T>>

Returns the element attached to the cell containing the given point.

Returns None if the cell is empty.

source

pub fn cells(&self) -> impl Iterator<Item = (&Point<i64>, &Vec<T>)>

An iterator through all the non-empty cells of this grid.

The returned tuple include the cell indentifier, and the elements attached to this cell.

source

pub fn inner_table(&self) -> &HashMap<Point<i64>, Vec<T>, DeterministicState>

The underlying hash map of this spacial grid.

source

pub fn cell(&self, key: &Point<i64>) -> Option<&Vec<T>>

Get the content of the logical cell identified by key.

source

pub fn neighbor_cells( &self, cell: &Point<i64>, radius: Real ) -> impl Iterator<Item = (Point<i64>, &Vec<T>)>

An iterator through all the neighbors of the given cell.

The given cell itself will be yielded by this iterator too.

source

pub fn cells_intersecting_aabb( &self, mins: &Point<Real>, maxs: &Point<Real> ) -> impl Iterator<Item = (Point<i64>, &Vec<T>)>

An iterator through all the cells intersecting the given AABB.

Trait Implementations§

source§

impl<T: Clone> Clone for HGrid<T>

source§

fn clone(&self) -> HGrid<T>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<T: Debug> Debug for HGrid<T>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<T: PartialEq> PartialEq for HGrid<T>

source§

fn eq(&self, other: &HGrid<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<T> StructuralPartialEq for HGrid<T>

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for HGrid<T>
where T: RefUnwindSafe,

§

impl<T> Send for HGrid<T>
where T: Send,

§

impl<T> Sync for HGrid<T>
where T: Sync,

§

impl<T> Unpin for HGrid<T>
where T: Unpin,

§

impl<T> UnwindSafe for HGrid<T>
where T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,