nl: return the map entries as instances of map.entry in a collection that is safe from concurrent modification . ie . we may safely add new instances to the underlying map during iteration of the entries . concode_field_sep boolean dirty concode_elem_sep Entry<IdentityKey<K>,V>[] entryArray concode_elem_sep Iterator<IdentityKey<K>> identityKeyIterator concode_elem_sep Map<IdentityKey<K>,V> map concode_elem_sep V value concode_elem_sep K key concode_elem_sep int hash concode_field_sep K next concode_elem_sep K getKey concode_elem_sep IdentityMap<K,V> instantiateSequenced concode_elem_sep Set<Entry<K,V>> entrySet concode_elem_sep boolean containsKey concode_elem_sep Collection<V> values concode_elem_sep boolean isEmpty concode_elem_sep void clear concode_elem_sep boolean hasNext concode_elem_sep boolean containsValue concode_elem_sep V put concode_elem_sep V remove concode_elem_sep void remove concode_elem_sep V getValue concode_elem_sep Iterator<K> keyIterator concode_elem_sep int size concode_elem_sep Map.Entry[] entryArray concode_elem_sep int hashCode concode_elem_sep V get concode_elem_sep void putAll concode_elem_sep V setValue concode_elem_sep boolean equals concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep Set<K> keySet concode_elem_sep K getRealKey
code: Map . Entry < K , V > [ ] function ( Map < K , V > arg0 ) { return ( ( IdentityMap < K , V > ) arg0 ) . entryArray ( ) ; }