Struct Grid 

pub struct Grid<T> { /* private fields */ }

A uniform spatial grid that bins items into cubic cells.

The grid is defined by a bounding box and a cell size. Items are mapped to cells based on their coordinates. This structure is optimized for “fixed-radius” queries, where the search radius is comparable to the cell size.

Performance

• Construction: O(N) where N is the number of items.
• Neighbor queries: O(1) average-case per query, assuming uniform distribution.

Implementations

impl<T> Grid<T>

pub fn new(items: impl IntoIterator<Item = (Point, T)>, cell_size: f64) -> Self

Creates a new grid enclosing the provided points.

The grid dimensions are automatically calculated to encompass all points with a small padding.

Arguments

• items - Iterator yielding (position, item) pairs.
• cell_size - The side length of each spatial bin.

Panics

Panics if cell_size is non-positive.

pub fn neighbors<'a>( &'a self, center: &Point, radius: f64, ) -> GridNeighborhood<'a, T>

Iterates over all items in cells overlapping with the query sphere.

The returned iterator yields items from candidate cells. To filter strictly by Euclidean distance, use the .exact() method on the returned iterator.

Arguments

• center - Center of the search sphere.
• radius - Radius of the search sphere.

pub fn has_neighbor<F>(&self, point: &Point, radius: f64, predicate: F) -> bool

where F: FnMut(&T) -> bool,

Checks if any item in the grid is within radius of point.

This is optimized to return early.

Arguments

• point - The query point.
• radius - The cutoff distance.
• predicate - A closure to filter items (e.g., check exact distance).

Trait Implementations

impl<T: Clone> Clone for Grid<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Grid<T>

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

Formats the value using the given formatter.