fn add_n(&mut self, hnd: u32, pts: &Pos) {
		assert!(self.n_points > 0);
		let p = pts.pos(hnd).into();
		while !self.bbox.contains(p) {
			self.grow_root(p);
		}
		self.add_inside(hnd, pts);
	}
/// Add a point when not empty
Add a point when not empty
Add a point when not empty
fn add_n(&mut self, hnd: u32, pts: &Pos) {
		assert!(self.n_points > 0);
		let p = pts.pos(hnd).into();
		while !self.bbox.contains(p) {
			self.grow_root(p);
		}
		self.add_inside(hnd, pts);
	}
fn add_n ( & mut self , hnd : u32 , pts : & Pos ) { assert ! ( self n_points 0 ) ; let p = pts . pos ( hnd ) . into ( ) ; while ! self . bbox . contains ( p ) { self . grow_root ( p ) ; } self . add_inside ( hnd , pts ) ; }
Add a point when not empty
Add a point when not empty
&mut self
hnd
u32
pts
&Pos