fn find_leaf_grow(&mut self, p: Vec3<i64>) -> (usize, BBox<i64>) {
		assert!(self.bbox.contains(p));
		let mut i = self.root - 1;
		let mut bbox = self.bbox;
		while self.nodes[i].is_branch() {
			let (j, bb) = self.follow_branch_grow(i, bbox, p);
			i = j;
			bbox = bb;
		}
		(i, bbox)
	}
/// Find the leaf node for a point (grow it if necessary)
Find the leaf node for a point (grow it if necessary)
Find the leaf node for a point ( grow it if necessary )
fn find_leaf_grow(&mut self, p: Vec3<i64>) -> (usize, BBox<i64>) {
		assert!(self.bbox.contains(p));
		let mut i = self.root - 1;
		let mut bbox = self.bbox;
		while self.nodes[i].is_branch() {
			let (j, bb) = self.follow_branch_grow(i, bbox, p);
			i = j;
			bbox = bb;
		}
		(i, bbox)
	}
fn find_leaf_grow ( & mut self , p : Vec3 < i64 > ) -> ( usize , BBox < i64 > ) { assert ! ( self bbox contains ( p ) ) ; let mut i = self . root - 1 ; let mut bbox = self . bbox ; while self . nodes [ i ] . is_branch ( ) { let ( j , bb ) = self . follow_branch_grow ( i , bbox , p ) ; i = j ; bbox = bb ; } ( i , bbox ) }
Find the leaf node for a point (grow it if necessary)
Find the leaf node for a point ( grow it if necessary )
&mut self
p
Vec3<i64>