use crate::kdtree2::KdTree2;
use crate::point_neighbor_searcher2::*;
use crate::vector2::Vector2D;
use std::sync::{RwLock, Arc};
pub struct PointKdTreeSearcher2 {
_tree: KdTree2,
}
impl PointKdTreeSearcher2 {
pub fn new() -> PointKdTreeSearcher2 {
return PointKdTreeSearcher2 {
_tree: KdTree2::new()
};
}
pub fn builder() -> Builder {
return Builder::new();
}
pub fn clone(&self) -> PointKdTreeSearcher2Ptr {
let mut searcher = PointKdTreeSearcher2::new();
searcher.set(self);
return PointKdTreeSearcher2Ptr::new(RwLock::new(searcher));
}
pub fn set(&mut self, other: &PointKdTreeSearcher2) {
self._tree = other._tree.clone();
}
}
impl PointNeighborSearcher2 for PointKdTreeSearcher2 {
fn type_name() -> String {
return "PointKdTreeSearcher2".parse().unwrap();
}
fn build(&mut self, points: &Vec<Vector2D>) {
self._tree.build(points);
}
fn for_each_nearby_point<Callback>(&self, origin: &Vector2D, radius: f64, callback: &mut Callback)
where Callback: ForEachNearbyPointFunc {
self._tree.for_each_nearby_point(origin, radius, callback);
}
fn has_nearby_point(&self, origin: &Vector2D, radius: f64) -> bool {
return self._tree.has_nearby_point(origin, radius);
}
}
pub type PointKdTreeSearcher2Ptr = Arc<RwLock<PointKdTreeSearcher2>>;
pub struct Builder {}
impl Builder {
pub fn build(&self) -> PointKdTreeSearcher2 {
return PointKdTreeSearcher2::new();
}
pub fn make_shared(&self) -> PointKdTreeSearcher2Ptr {
return PointKdTreeSearcher2Ptr::new(RwLock::new(self.build()));
}
pub fn new() -> Builder {
return Builder {};
}
}