Map < K , V > function ( Map < K , V > arg0 , Map < K , V > arg1 ) { if ( arg0 == null ) { return null ; } if ( arg1 == null ) { return arg0 ; } List < K > loc0 = difference ( arg0 . keySet ( ) , arg1 . keySet ( ) ) ; Map < K , V > loc1 = new HashMap < K , V > ( ) ; for ( K loc2 : loc0 ) { loc1 . put ( loc2 , arg0 . get ( loc2 ) ) ; } return loc1 ; }
compute the difference of elements between the 2 given maps concode_field_sep Collection<T> itemsInCommon concode_elem_sep Collection<T> removedItems concode_elem_sep Collection<T> addedItems concode_field_sep MapComparison<K,V> compare concode_elem_sep CollectionComparison<T> compare concode_elem_sep boolean contains concode_elem_sep Map<String,List<String>> toMap concode_elem_sep Map<K,V> intersection concode_elem_sep Collection<T> intersection concode_elem_sep Map<K,V> getItemsInCommon concode_elem_sep Collection<T> getItemsInCommon concode_elem_sep Map<K,V> getAddedItems concode_elem_sep Collection<T> getAddedItems concode_elem_sep T[] append concode_elem_sep Map<K,V> getRemovedItems concode_elem_sep Collection<T> getRemovedItems