TreeEntry function ( long arg0 ) { ListIterator loc0 = entries . listIterator ( entries . size ( ) ) ; while ( loc0 . hasPrevious ( ) ) { TreeEntry loc1 = ( TreeEntry ) loc0 . previous ( ) ; if ( loc1 . arg0 == arg0 ) { return loc1 ; } if ( loc1 . arg0 < arg0 ) { break ; } } return null ; }
as the entry are always load from the last , so also search it from the last to the first . concode_field_sep long next concode_elem_sep long parent concode_elem_sep long offset concode_elem_sep long previous concode_elem_sep LinkedList entries concode_elem_sep Object value concode_field_sep void addEntry