pub fn validate_consistency(&self) {
        let mut node_counter = 0;

        self._validate_consistency(self.root, &mut node_counter);

        // check we have the expected number of nodes.
        assert_eq!(node_counter, self.nodes.len());
    }
/// Validates the consistency of the tree.  In particular, this function checks that:
///
/// - Every child is contained in the minimum bounding region of its parent, and
/// - The total number of descendants of the root node is equal to the number
///   of nodes in the tree minus one.
Validates the consistency of the tree.  In particular, this function checks that:
Every child is contained in the minimum bounding region of its parent, and
The total number of descendants of the root node is equal to the number
of nodes in the tree minus one.
Validates the consistency of the tree . In particular this function checks that : Every child is contained in the minimum bounding region of its parent and The total number of descendants of the root node is equal to the number of nodes in the tree minus one .
pub fn validate_consistency(&self) {
        let mut node_counter = 0;
        self._validate_consistency(self.root, &mut node_counter);
        // check we have the expected number of nodes.
        assert_eq!(node_counter, self.nodes.len());
    }
pub fn validate_consistency ( & self ) { let mut node_counter = 0 ; self . _validate_consistency ( self . root , & mut node_counter ) ; // check we have the expected number of nodes. assert_eq ! ( node_counter self nodes len ( ) ) ; }
Validates the consistency of the tree.
Validates the consistency of the tree .
&self
&self