andrey/kdtree-rust
1
0
Fork 0
mirror of https://github.com/andreytkachenko/kdtree-rust.git synced 2024-11-22 01:16:25 +04:00
Code Issues Projects Releases Wiki Activity

Fixed warnings

Browse Source
This commit is contained in:
Olek 2016-12-31 02:40:46 +01:00
parent 793933521c
commit e6755865f0
2 changed files with 1 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/kdtree/mod.rs
View File

@ -54,7 +54,7 @@ impl<KdtreePoint: KdtreePointTrait> Kdtree<KdtreePoint> {
/// Can be used if you are sure that the tree is degenerated or if you will never again insert the nodes into the tree. /// Can be used if you are sure that the tree is degenerated or if you will never again insert the nodes into the tree.
pub fn gather_points_and_rebuild(&mut self) { pub fn gather_points_and_rebuild(&mut self) {
let mut points : Vec<KdtreePoint> = vec![]; let mut points : Vec<KdtreePoint> = vec![];
let nodes = self.gather_points(0,&mut points); self.gather_points(0,&mut points);
self.rebuild_tree(&mut points); self.rebuild_tree(&mut points);
} }

4
tests/integration_tests.rs
View File

@ -10,10 +10,6 @@ fn gen_random() -> f64 {
rand::thread_rng().gen_range(0., 10000.) rand::thread_rng().gen_range(0., 10000.)
} }
fn gen_random_usize( max_value : usize) -> usize {
rand::thread_rng().gen_range(0usize, max_value)
}
fn find_nn_with_linear_search<'a>(points : &'a Vec<Point3WithId>, find_for : Point3WithId) -> &Point3WithId { fn find_nn_with_linear_search<'a>(points : &'a Vec<Point3WithId>, find_for : Point3WithId) -> &Point3WithId {
let distance_fun = kdtree::kdtree::distance::squared_euclidean; let distance_fun = kdtree::kdtree::distance::squared_euclidean;