pub fn nearest_neighbor_iter_with_distance_2(
        &self,
        query_point: &<T::Envelope as Envelope>::Point,
    ) -> impl Iterator<Item = (&T, <<T::Envelope as Envelope>::Point as Point>::Scalar)> {
        nearest_neighbor::NearestNeighborDistanceIterator::new(&self.root, *query_point)
    }
/// Returns `(element, distance^2)` tuples of the tree sorted by their distance to a given point.
///
/// The distance is calculated by calling
/// [PointDistance::distance_2](traits.PointDistance.html#method.distance_2).
Returns `(element, distance^2)` tuples of the tree sorted by their distance to a given point.
Returns ` ( element distance^2 ) ` tuples of the tree sorted by their distance to a given point .
pub fn nearest_neighbor_iter_with_distance_2(
        &self,
        query_point: &<T::Envelope as Envelope>::Point,
    ) -> impl Iterator<Item = (&T, <<T::Envelope as Envelope>::Point as Point>::Scalar)> {
        nearest_neighbor::NearestNeighborDistanceIterator::new(&self.root, *query_point)
    }
pub fn nearest_neighbor_iter_with_distance_2 ( & self , query_point : & < T :: Envelope as Envelope > :: Point , ) -> impl Iterator < Item = ( & T , < < T :: Envelope as Envelope > :: Point as Point > :: Scalar ) > { nearest_neighbor :: NearestNeighborDistanceIterator :: new ( & self . root , * query_point ) }
Returns `(element, distance^2)` tuples of the tree sorted by their distance to a given point.
Returns ` ( element distance^2 ) ` tuples of the tree sorted by their distance to a given point .
&self
query_point
&<T::Envelope as Envelope>::Point
&self
query_point
&<T::Envelope as Envelope>::Point