Struct RTree 

pub struct RTree<T, C, const D: usize> { /* private fields */ }

R*-tree spatial index.

Stores points with associated payloads and supports range queries, kNN queries, and spatial joins. Uses forced reinsertion on overflow and quadratic splits.

Implementations

impl<T, C: CoordType, const D: usize> RTree<T, C, D>

pub fn new() -> Self

Create an empty R-tree.

pub fn insert_entry(&mut self, point: Point<C, D>, payload: T) -> EntryId

pub fn remove_entry(&mut self, id: EntryId) -> Option<T>

pub fn range_query_impl<'a>( &'a self, bbox: &BBox<C, D>, ) -> Vec<(EntryId, &'a T)>

Return all entries whose points lie within bbox.

pub fn knn_query_impl<'a>( &'a self, point: &Point<C, D>, k: usize, ) -> Vec<(f64, EntryId, &'a T)>

Trait Implementations

impl<T, C: CoordType, const D: usize> Default for RTree<T, C, D>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Send + Sync + 'static, C: CoordType, const D: usize> SpatialBackend<T, C, D> for RTree<T, C, D>

fn insert(&mut self, point: Point<C, D>, payload: T) -> EntryId

Insert a point with an associated payload. Returns the unique EntryId assigned to this entry.

fn remove(&mut self, id: EntryId) -> Option<T>

Remove the entry with the given EntryId. Returns the payload if the entry existed, or None otherwise.

fn range_query(&self, bbox: &BBox<C, D>) -> Vec<(EntryId, &T)>

Return all entries whose positions are contained within bbox.

fn knn_query(&self, point: &Point<C, D>, k: usize) -> Vec<(f64, EntryId, &T)>

Return the k nearest entries to point, ordered by ascending Euclidean distance. Each result is (distance, id, payload_ref).

fn spatial_join( &self, other: &dyn SpatialBackend<T, C, D>, ) -> Vec<(EntryId, EntryId)>

Return all pairs (id_a, id_b) where the bounding box of entry id_a in self intersects the bounding box of entry id_b in other.

fn bulk_load(entries: Vec<(Point<C, D>, T)>) -> Self

Bulk-load a set of (point, payload) pairs into a new backend instance.

fn len(&self) -> usize

Return the number of entries currently stored.

fn kind(&self) -> BackendKind

Return the BackendKind discriminant for this backend.

fn all_entries(&self) -> Vec<(Point<C, D>, EntryId, &T)>

Return all (point, id, payload) triples — used by spatial_join implementations that need to iterate over the other backend’s entries.

fn is_empty(&self) -> bool

Return true if the backend contains no entries.