pub fn num_children(&self) -> usize {
        let mut n = 0;

        for i in 0..self.children.len() {
            n += if self.is_midpoint_at(i) { 1 } else { 0 };
        }

        debug_assert!(
            n == 0 || n > 1,
            "Node must have either no children at all, or at least two otherwise.",
        );

        n
    }
/// Return the number of children that this node has.
Return the number of children that this node has.
Return the number of children that this node has .
pub fn num_children(&self) -> usize {
        let mut n = 0;
        for i in 0..self.children.len() {
            n += if self.is_midpoint_at(i) { 1 } else { 0 };
        }
        debug_assert!(
            n == 0 || n > 1,
            "Node must have either no children at all, or at least two otherwise.",
        );
        n
    }
pub fn num_children ( & self ) -> usize { let mut n = 0 ; for i in 0 .. self . children . len ( ) { n += if self . is_midpoint_at ( i ) { 1 } else { 0 } ; } debug_assert ! ( n 0 n 1 " " ) ; n }
Return the number of children that this node has.
Return the number of children that this node has .
&self
&self