Module rtree

Expand description

Re-exports every item from geometry-rtree — the R-tree spatial index (Rtree, Predicate, split strategies, bulk load).

Modules§

bounds: The axis-aligned bounding box used for tree keys.
indexable: The Indexable trait — what can be stored in an Rtree.
nearest_iter: Unbounded nearest-first streaming — the search behind Rtree::nearest_iter.
node: Tree nodes: leaves hold values, branches hold child subtrees.
predicate: Spatial query predicates.
query_iter: Lazy spatial-query iteration.
rtree: The Rtree itself — insert, spatial query, nearest-neighbour, and Sort-Tile-Recursive bulk load.
split: Node-split strategies — the type parameter that governs tree shape.
values: Iteration over all values stored in an R-tree.

AndPredicate: The conjunction of two query predicates.
AsymmetricQuadratic: Quadratic split with independent branch and leaf capacities.
AsymmetricRStarSplit: R*-split selection with independent insertion and bulk capacities.
Bounds: An axis-aligned bounding box in the plane.
Linear: Linear split — cheap inserts, looser trees.
NearestIter: A lazy iterator over ALL values in the tree in exact non-decreasing distance order from a query point — an unbounded ordered stream.
NotPredicate: The logical negation of a query predicate.
Quadratic: Quadratic split — Boost’s textbook default.
QueryIter: A lazy iterator over values whose bounds satisfy a built-in Predicate.
QueryWithIter: A lazy iterator over values accepted by a logical or user-defined QueryPredicate.
RStarSplit: R*-split selection with one capacity for branches and leaves.
Rtree: A spatial index over Indexable values, parameterised by a split strategy.
Satisfies: A value-level query condition corresponding to Boost’s index::satisfies predicate.
Values: A depth-first iterator over every value in an R-tree.

Indexable: A value the Rtree can index — one that exposes an axis-aligned bounding box.
QueryPredicate: A predicate accepted by Rtree::query_with.
SplitParameters: How a full node is partitioned when it overflows.