int function ( ) { int loc0 = 0 ; for ( TreeString loc1 = this ; loc1 != null ; loc1 = loc1 . parent ) { loc0 ++ ; } return loc0 ; }
how many nodes do we have from the root to this node including ` this ' itself ? thus depth of the root node is 1 . concode_field_sep TreeString parent concode_elem_sep char[] label concode_elem_sep long serialVersionUID concode_field_sep String getLabel concode_elem_sep TreeString split concode_elem_sep Object unmarshal concode_elem_sep boolean canConvert concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep TreeString of concode_elem_sep void marshal concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep boolean isBlank concode_elem_sep void dedup