flushes the given entry from the cache . does nothing if entry does not exist in cache . concode_field_sep LRUCacheEntry<K,V> next concode_elem_sep LRUCacheEntry<K,V> previous concode_elem_sep LRUCacheEntry<K,V> entryQueue concode_elem_sep HashMap<K,LRUCacheEntry<K,V>> entryTable concode_elem_sep int space concode_elem_sep int currentSpace concode_elem_sep LRUCacheEntry<K,V> entryQueueTail concode_elem_sep int spaceLimit concode_elem_sep int timestampCounter concode_elem_sep V value concode_elem_sep int DEFAULT_SPACELIMIT concode_elem_sep K key concode_elem_sep int timestamp concode_field_sep double fillingRatio concode_elem_sep K getKey concode_elem_sep void privateAddEntry concode_elem_sep int getSpaceLimit concode_elem_sep LRUCache<K,V> newInstance concode_elem_sep int spaceFor concode_elem_sep String toStringContents concode_elem_sep void privateRemoveEntry concode_elem_sep V put concode_elem_sep void updateTimestamp concode_elem_sep V peek concode_elem_sep String toStringFillingRation concode_elem_sep void privateNotifyDeletionFromCache concode_elem_sep void privateAdd concode_elem_sep V removeKey concode_elem_sep int getCurrentSpace concode_elem_sep V get concode_elem_sep boolean makeSpace concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep Set<K> keySet concode_elem_sep void setSpaceLimit
void function ( K arg0 ) { LRUCacheEntry < K , V > loc0 = entryTable . get ( arg0 ) ; if ( loc0 == null ) { return ; } privateRemoveEntry ( loc0 , false ) ; }