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

Issue1 (#3)

Browse Source 
Merged some optimizations.

* up

* Removed comments
This commit is contained in:
Ale 2016-12-27 01:14:57 +01:00 committed by GitHub
parent ab6c6b1174
commit 7f5b320db9
1 changed files with 3 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/kdtree/bounds.rs
View File

@ -1,7 +1,7 @@
use ::kdtree::*; use ::kdtree::*;
pub struct Bounds { pub struct Bounds {
pub bounds: Vec<(f64, f64)>, pub bounds: [(f64,f64);3],
widest_dim : usize, widest_dim : usize,
midvalue_of_widest_dim : f64, midvalue_of_widest_dim : f64,
@ -10,13 +10,11 @@ pub struct Bounds {
impl Bounds { impl Bounds {
pub fn new_from_points<T: KdtreePointTrait>(points: &Vec<T>) -> Bounds { pub fn new_from_points<T: KdtreePointTrait>(points: &Vec<T>) -> Bounds {
let mut bounds = Bounds { let mut bounds = Bounds {
bounds: vec![], bounds: [(0.,0.),(0.,0.),(0.,0.)],
widest_dim : 0, widest_dim : 0,
midvalue_of_widest_dim : 0., midvalue_of_widest_dim : 0.,
}; };
bounds.bounds.resize(points[0].dims().len(), (0., 0.));
for i in 0..points[0].dims().len() { for i in 0..points[0].dims().len() {
bounds.bounds[i].0 = points[0].dims()[i]; bounds.bounds[i].0 = points[0].dims()[i];
bounds.bounds[i].1 = points[0].dims()[i]; bounds.bounds[i].1 = points[0].dims()[i];