int function ( ) { return children == null ? 1 : 1 + Math . max ( children [ 0 ] . depth ( ) , children [ 1 ] . depth ( ) ) ; }
returns the depth of the tree longest path length from root to leaf . concode_field_sep BoundingBox bb concode_elem_sep float splitValue concode_elem_sep float testLatMin concode_elem_sep boolean splitAtLat concode_elem_sep int maxDepth concode_elem_sep float testLatMax concode_elem_sep int depth concode_elem_sep int maxEntities concode_elem_sep KDTree[] children concode_elem_sep ArrayList<DefaultMapEntity> entities concode_elem_sep float testLonMax concode_elem_sep boolean isTrue concode_elem_sep boolean isSorted concode_elem_sep float testLonMin concode_field_sep void setUnsorted concode_elem_sep void visitEntities concode_elem_sep int compare concode_elem_sep List<double[]> getSplitCoords concode_elem_sep void insertEntity concode_elem_sep void computeSplitValues concode_elem_sep boolean isVisible concode_elem_sep BoundingBox getBoundingBox