Map < V , K > function ( Map < K , V > arg0 ) { Map < V , K > loc0 = new HashMap < > ( arg0 . size ( ) ) ; for ( Map . Entry < K , V > loc1 : arg0 . entrySet ( ) ) { loc0 . put ( loc1 . getValue ( ) , loc1 . getKey ( ) ) ; } return loc0 ; }
returns a map based on the source but with the key & values swapped . concode_field_sep TypeMap COLLECTION_INTERFACES_BY_NAMES concode_elem_sep TypeMap COLLECTION_CLASSES_BY_NAMES concode_field_sep int addWithoutDuplicates concode_elem_sep T[] addWithoutDuplicates concode_elem_sep T[] addWithoutDuplicates concode_elem_sep boolean areEqual concode_elem_sep boolean areSemanticEquals concode_elem_sep boolean valuesAreTransitivelyEqual concode_elem_sep boolean isCollectionType concode_elem_sep boolean isCollectionType concode_elem_sep boolean isEmpty concode_elem_sep boolean isNotEmpty concode_elem_sep Class<?> getCollectionTypeFor concode_elem_sep Set<T> asSet concode_elem_sep boolean arraysAreEqual concode_elem_sep Map<K,V> mapFrom