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

benches renames

Browse Source
This commit is contained in:
Olek 2016-12-27 02:30:53 +01:00
parent 4b2ce6b173
commit 1631ed096a
1 changed files with 2 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/bench.rs
View File

@ -51,22 +51,19 @@ impl kdtree::kdtree::KdtreePointTrait for Point3WithId {
fn bench_creating_1000_node_tree(b: &mut Bencher) {
let len = 1000usize;
let mut points : Vec<Point2WithId> = vec![];
//let mut kdtree = KdTree::new_with_capacity(3, 16);
for id in 0..len {
let x : f64 = rand::random();
points.push(Point2WithId::new(id as i32, x, x));
// points.push(rand_data());
}
b.iter(|| {
let tree = kdtree::kdtree::Kdtree::new(points.clone());
kdtree::kdtree::Kdtree::new(points.clone());
});
}
fn bench_single_loop_times_for_1000_node_tree(b: &mut Bencher) {
let len = 1000usize;
let mut points : Vec<Point3WithId> = vec![];
//let mut kdtree = KdTree::new_with_capacity(3, 16);
for i in 0..len {
points.push(Point3WithId::new(i as i32, rand::random(),rand::random(),rand::random()))
@ -79,5 +76,5 @@ fn bench_single_loop_times_for_1000_node_tree(b: &mut Bencher) {
b.iter(|| tree.nearest_search(&points[0]));
}
benchmark_group!(benches, a,b);
benchmark_group!(benches, bench_creating_1000_node_tree,bench_single_loop_times_for_1000_node_tree);
benchmark_main!(benches);