void function ( final T arg0 ) { if ( this . elementToEntry . containsKey ( arg0 ) ) { this . touch ( arg0 ) ; return ; } final MRUCacheEntry < T > loc0 = new MRUCacheEntry < T > ( arg0 ) ; this . append ( loc0 ) ; this . elementToEntry . put ( arg0 , loc0 ) ; }
append . concode_field_sep MRUCacheEntry<T> last concode_elem_sep MRUCacheEntry<T> currposition concode_elem_sep HashMap<T,MRUCacheEntry<T>> elementToEntry concode_elem_sep MRUCacheEntry<T> prevposition concode_elem_sep MRUCache<T> list concode_elem_sep MRUCacheEntry<T> first concode_field_sep T next concode_elem_sep T removeHead concode_elem_sep Iterator<T> iterator concode_elem_sep int size concode_elem_sep MRUCacheEntry<T> getHead concode_elem_sep void clear concode_elem_sep void touch concode_elem_sep boolean hasNext concode_elem_sep void remove concode_elem_sep void remove