Struct SpatialIndex 

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

Spatial index for efficient geographic queries.

Uses an R-tree data structure for O(log n) query performance.

Implementations

impl<T: Clone> SpatialIndex<T>

pub fn new() -> Self

Create an empty spatial index.

pub fn from_iter<I, F>(iter: I, location_fn: F) -> Self

where I: IntoIterator<Item = T>, F: Fn(&T) -> &Location,

Create a spatial index from items with a location extractor.

pub fn insert(&mut self, item: T, location: &Location)

Insert an item into the index.

pub fn query_bbox( &self, min_lat: f64, min_lon: f64, max_lat: f64, max_lon: f64, ) -> Vec<&T>

Query items within a bounding box.

Arguments

• min_lat - Minimum latitude
• min_lon - Minimum longitude
• max_lat - Maximum latitude
• max_lon - Maximum longitude

pub fn query_bounds(&self, bounds: &GeoBounds) -> Vec<&T>

Query items within geographic bounds.

pub fn query_radius(&self, lat: f64, lon: f64, radius_degrees: f64) -> Vec<&T>

Query items within a radius of a point.

Note: This uses Euclidean distance in degrees. For accurate great-circle distance, use query_radius_meters.

pub fn query_radius_meters( &self, lat: f64, lon: f64, radius_meters: f64, ) -> Vec<&T>

Query items within a radius in meters.

Uses the Haversine formula for accurate great-circle distance.

pub fn nearest(&self, lat: f64, lon: f64, k: usize) -> Vec<&T>

Find the k nearest neighbors to a point.

pub fn nearest_one(&self, lat: f64, lon: f64) -> Option<&T>

Find the single nearest item to a point.

pub fn len(&self) -> usize

Returns the number of indexed items.

pub fn is_empty(&self) -> bool

Returns true if the index is empty.

pub fn items(&self) -> &[T]

Get all items in the index.

Trait Implementations

impl<T: Debug> Debug for SpatialIndex<T>

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

Formats the value using the given formatter.

impl<T: Clone> Default for SpatialIndex<T>

fn default() -> Self

Returns the “default value” for a type.