Map < K , V > function ( ) { return new LinkedHashMap < K , V > ( map ) ; }
returns a copy of the current contents of the cache , ordered from least recently accessed to most recently accessed . concode_field_sep int evictionCount concode_elem_sep int putCount concode_elem_sep int hitCount concode_elem_sep int size concode_elem_sep int createCount concode_elem_sep int maxSize concode_elem_sep LinkedHashMap<K,V> map concode_elem_sep int missCount concode_field_sep int evictionCount concode_elem_sep void trimToSize concode_elem_sep int hitCount concode_elem_sep int sizeOf concode_elem_sep int maxSize concode_elem_sep V put concode_elem_sep V remove concode_elem_sep void evictAll concode_elem_sep int putCount concode_elem_sep int size concode_elem_sep int createCount concode_elem_sep V get concode_elem_sep void entryRemoved concode_elem_sep void resize concode_elem_sep V create concode_elem_sep String toString concode_elem_sep int safeSizeOf concode_elem_sep int missCount