use acap::euclid::Euclidean; use acap::knn::NearestNeighbors; use acap::vp::VpTree; let points = vec![ Euclidean([3, 4]), Euclidean([5, 12]), Euclidean([8, 15]), Euclidean([7, 24]), ]; let tree = VpTree::balanced(points.iter()); let nearest = tree.nearest(&&[7, 7]).unwrap(); assert!(std::ptr::eq(*nearest.item, &points[0]));