Struct RTree 

pub struct RTree { /* private fields */ }

R*-tree spatial index.

Supports insert, delete, range search (bbox intersection), and incremental nearest-neighbor queries. Array-backed nodes for cache friendliness.

References:

• Beckmann et al., “The R*-tree” (1990)
• Hjaltason & Samet, “Distance Browsing in Spatial Databases” (1999)

Implementations

impl RTree

pub fn checkpoint_to_bytes(&self) -> Result<Vec<u8>, RTreeCheckpointError>

Serialize the R-tree to rkyv bytes (with magic header) for checkpointing.

pub fn from_checkpoint(bytes: &[u8]) -> Result<Self, RTreeCheckpointError>

Restore an R-tree from checkpoint bytes.

Auto-detects format: rkyv (magic RKSPT\0) or legacy MessagePack. Uses bulk_load (STR packing) for optimal node packing.

impl RTree

pub fn bulk_load(entries: Vec<RTreeEntry>) -> Self

Bulk load entries using Sort-Tile-Recursive packing.

More efficient than repeated single inserts for large datasets. Produces better packing (less overlap between nodes).

impl RTree

pub fn delete(&mut self, id: EntryId) -> bool

Delete an entry by ID. Returns true if found and removed.

impl RTree

pub fn insert(&mut self, entry: RTreeEntry)

Insert an entry into the R-tree.

impl RTree

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn search(&self, query: &BoundingBox) -> Vec<&RTreeEntry>

Range search: return all entries whose bbox intersects the query bbox.

pub fn search_owned(&self, query: &BoundingBox) -> Vec<RTreeEntry>

Range search returning owned entries.

pub fn nearest(&self, query_lng: f64, query_lat: f64, k: usize) -> Vec<NnResult>

Nearest-neighbor search using incremental distance ordering.

pub fn entries(&self) -> Vec<&RTreeEntry>

Get all entries (for persistence serialization).

Trait Implementations

impl Default for RTree

fn default() -> Self

Returns the “default value” for a type.