/// Print a node and its descendants
Print a node and its descendants
Print a node and its descendants
fn print_node(&self, i: usize, bcube: BCube, t: u32) {
/*		let n = &self.nodes[i];
		print!("\n{:3} ", i + 1);
		for _ in 0 .. t {
			print!("  ");
		}
		if n.is_leaf() {
			print!("leaf:");
			for hnd in n.leaf_children().iter() {
				if *hnd < 1 { continue; }
				let p = self[*hnd].bbox();
				print!(" {:?}_{:?}", *hnd, p);
			}
			print!("\t{:?}", bcube);
			let j = n.link();
			if j > 0 {
				print!("\tCCoincident LLink:");
				self.print_node(j - 1, bcube, t);
			}
		} else {
			print!("{:?}", n);
			print!("\t{:?}", bcube);
			for ch in 0 .. 8 {
				let bb = Node::child_bcube(ch, bcube);
				let k = n.child[ch] as usize;
				if k > 0 {
					self.print_node(k - 1, bb, t + 1);
				}
			}
		}*/
	}
fn print_node ( & self , i : usize , bcube : BCube , t : u32 ) { /*		let n = &self.nodes[i];
		print!("\n{:3} ", i + 1);
		for _ in 0 .. t {
			print!("  ");
		}
		if n.is_leaf() {
			print!("leaf:");
			for hnd in n.leaf_children().iter() {
				if *hnd < 1 { continue; }

				let p = self[*hnd].bbox();
				print!(" {:?}_{:?}", *hnd, p);
			}
			print!("\t{:?}", bcube);
			let j = n.link();
			if j > 0 {
				print!("\tCCoincident LLink:");
				self.print_node(j - 1, bcube, t);
			}
		} else {
			print!("{:?}", n);
			print!("\t{:?}", bcube);
			for ch in 0 .. 8 {
				let bb = Node::child_bcube(ch, bcube);
				let k = n.child[ch] as usize;
				if k > 0 {
					self.print_node(k - 1, bb, t + 1);
				}
			}
		}*/ }
Print a node and its descendants
Print a node and its descendants
&self
<not_specific>
i
usize
<not_specific>
bcube
BCube
<not_specific>
t
u32
<not_specific>