Struct UniformGrid2 

pub struct UniformGrid2 {
    pub cell_size: f64,
    /* private fields */
}

Uniform hash-grid indexing points in 2-D by cell coordinate.

Each key is stored under the cell containing its point. Queries inspect only the cells within the requested radius.

Fields

cell_size: f64

Cell edge length (metres).

Implementations

impl UniformGrid2

pub fn new(cell_size: f64) -> Self

Construct a grid with the given cell size (metres).

Panics

Panics if cell_size is not strictly positive.

pub fn clear(&mut self)

Remove every entry.

pub fn insert(&mut self, key: u64, pos: Vec2)

Insert key at pos.

pub fn insert_all<I: IntoIterator<Item = (u64, Vec2)>>(&mut self, iter: I)

Insert many (key, pos) pairs.

pub fn query_radius(&self, center: Vec2, radius: f64) -> Vec<u64>

Return all keys within Euclidean distance radius of center.

pub fn for_each_within<F: FnMut(u64, Vec2)>( &self, center: Vec2, radius: f64, f: F, )

Invoke f(key, pos) for every key within radius of center.

pub fn len(&self) -> usize

Number of entries currently stored.

pub fn is_empty(&self) -> bool

True if the grid is empty.

Trait Implementations

impl Clone for UniformGrid2

fn clone(&self) -> UniformGrid2

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for UniformGrid2

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

Formats the value using the given formatter.