common: bvh: use sort_by_key
This commit is contained in:
parent
4899003766
commit
aace3bb2a3
@ -86,9 +86,9 @@ fn generate_bvh_node<T>(boxen:Vec<(T,Aabb)>,force:bool)->BvhNode<T>{
|
|||||||
sort_y.push((i,center.y));
|
sort_y.push((i,center.y));
|
||||||
sort_z.push((i,center.z));
|
sort_z.push((i,center.z));
|
||||||
}
|
}
|
||||||
sort_x.sort_by(|tup0,tup1|tup0.1.cmp(&tup1.1));
|
sort_x.sort_by_key(|&(_,c)|c);
|
||||||
sort_y.sort_by(|tup0,tup1|tup0.1.cmp(&tup1.1));
|
sort_y.sort_by_key(|&(_,c)|c);
|
||||||
sort_z.sort_by(|tup0,tup1|tup0.1.cmp(&tup1.1));
|
sort_z.sort_by_key(|&(_,c)|c);
|
||||||
let h=n/2;
|
let h=n/2;
|
||||||
let median_x=sort_x[h].1;
|
let median_x=sort_x[h].1;
|
||||||
let median_y=sort_y[h].1;
|
let median_y=sort_y[h].1;
|
||||||
|
Loading…
x
Reference in New Issue
Block a user