Struct RangeTree2D 

pub struct RangeTree2D { /* private fields */ }

A 2D range tree for O(log² n + k) orthogonal range queries.

Implementations

impl RangeTree2D

pub fn new(points: &[Point2D]) -> Self

Build from a slice of points.

pub fn query(&self, x_lo: f64, x_hi: f64, y_lo: f64, y_hi: f64) -> Vec<Point2D>

Query all points in [x_lo, x_hi] × [y_lo, y_hi].

pub fn query_via_tree( &self, x_lo: f64, x_hi: f64, y_lo: f64, y_hi: f64, ) -> Vec<Point2D>

Query using the secondary tree structure (demonstrates the tree interface).

pub fn len(&self) -> usize

Number of points stored

pub fn is_empty(&self) -> bool

True if no points are stored