fn grow_leaf(&mut self, i: usize, bbox: BBox<i64>, pts: &Pos, p: Vec3<i64>) ->
		(usize, BBox<i64>)
	{
		assert!(self.nodes[i].is_leaf());
		assert!(self.nodes[i].is_full());
		if self.nodes[i].all_coincident(pts, p) {
			self.grow_leaf_link(i, bbox)
		} else {
			self.grow_leaf_branch(i, bbox.center, pts);
			self.follow_branch_grow(i, bbox, p)
		}
	}
/// Grow a leaf node into a branch or link
Grow a leaf node into a branch or link
Grow a leaf node into a branch or link
fn grow_leaf(&mut self, i: usize, bbox: BBox<i64>, pts: &Pos, p: Vec3<i64>) ->
		(usize, BBox<i64>)
	{
		assert!(self.nodes[i].is_leaf());
		assert!(self.nodes[i].is_full());
		if self.nodes[i].all_coincident(pts, p) {
			self.grow_leaf_link(i, bbox)
		} else {
			self.grow_leaf_branch(i, bbox.center, pts);
			self.follow_branch_grow(i, bbox, p)
		}
	}
fn grow_leaf ( & mut self , i : usize , bbox : BBox < i64 > , pts : & Pos , p : Vec3 < i64 > ) -> ( usize , BBox < i64 > ) { assert ! ( self nodes [ i ] is_leaf ( ) ) ; assert ! ( self nodes [ i ] is_full ( ) ) ; if self . nodes [ i ] . all_coincident ( pts , p ) { self . grow_leaf_link ( i , bbox ) } else { self . grow_leaf_branch ( i , bbox . center , pts ) ; self . follow_branch_grow ( i , bbox , p ) } }
Grow a leaf node into a branch or link
Grow a leaf node into a branch or link
&mut self
i
usize
bbox
BBox<i64>
pts
&Pos
p
Vec3<i64>