Map < T , V > function ( Map < T , V > arg0 , Collection < T > arg1 ) { Map < T , V > loc0 = new HashMap < > ( ) ; for ( T loc1 : arg1 ) if ( arg0 . containsKey ( loc1 ) ) { loc0 . put ( loc1 , arg0 . get ( loc1 ) ) ; } return loc0 ; }
get all values corresponding to the indices if they exist in the map concode_field_sep PlaceHolder placeHolder concode_field_sep List<Map.Entry<K,V>> sortedEntries concode_elem_sep List<Map.Entry<K,V>> sortedEntries concode_elem_sep Map<Y,X> invert concode_elem_sep Map<Y,Set<X>> invertSet concode_elem_sep void putIntoValueArrayList concode_elem_sep void putIntoValueCollection concode_elem_sep Map<X,Z> compose concode_elem_sep void addAll concode_elem_sep void main concode_elem_sep String toString concode_elem_sep void putIntoValueHashSet concode_elem_sep void toStringSorted concode_elem_sep String toStringSorted concode_elem_sep void removeKeys