Map < V , K > function ( Map < K , V > arg0 ) { Map < V , K > loc0 = new HashMap < V , K > ( ) ; for ( Map . Entry < K , V > loc1 : arg0 . entrySet ( ) ) { loc0 . put ( loc1 . getValue ( ) , loc1 . getKey ( ) ) ; } return loc0 ; }
reversed a map , making the key value and the value key . concode_field_sep PlaceHolder placeHolder concode_field_sep Map<String,String> loadStrictly concode_elem_sep Map<String,String> loadStrictly concode_elem_sep Map<String,String> loadStrictly concode_elem_sep Map<K,V> genericMap concode_elem_sep Map<K,V> genericMap concode_elem_sep boolean approximatelyEqual concode_elem_sep void store concode_elem_sep void store concode_elem_sep void store concode_elem_sep Map<K,V> copyAndRemove concode_elem_sep Map<String,String> toStringMap concode_elem_sep Map<String,String> load concode_elem_sep Map<String,String> load concode_elem_sep Map<String,String> load concode_elem_sep Map<K,V> toMap concode_elem_sep Map<K,V> toMap concode_elem_sep Map<String,String> stringMap concode_elem_sep Map<String,String> stringMap concode_elem_sep void storeStrictly concode_elem_sep void storeStrictly concode_elem_sep void storeStrictly concode_elem_sep Map<String,Object> map concode_elem_sep Map<String,Object> map concode_elem_sep Map<K,V> copyAndPut concode_elem_sep void closeIfNotNull