Module nearest_iter 

Unbounded nearest-first streaming — the search behind Rtree::nearest_iter.

A best-first stream over this crate’s SearchFrontier: separate node and value frontiers keep each entry to a distance plus one reference. Each next expands nodes until the closest pending value is no farther than the closest unexpanded node, then yields that value. No best-k pruning happens because no k exists; the bounded Rtree::nearest keeps the pruned path for the fixed-k case.

Structs

NearestIter

A lazy iterator over ALL values in the tree in exact non-decreasing distance order from a query point — an unbounded ordered stream.

Constants

DEFAULT_NODE_INLINE_CAPACITY

Default inline entry capacity of a nearest iterator’s node frontier.

DEFAULT_VALUE_INLINE_CAPACITY

Default inline entry capacity of a nearest iterator’s value frontier.