void function ( Map < String , List < String >> arg0 ) { for ( String loc0 : arg0 . keySet ( ) ) { SortedSet < String > loc1 = get ( loc0 ) ; if ( loc1 == null ) { loc1 = new TreeSet < String > ( ) ; put ( loc0 , loc1 ) ; } loc1 . addAll ( arg0 . get ( loc0 ) ) ; } }
convenience method to merge a map > . concode_field_sep TreeMap<String,SortedSet<String>> wrappedMap concode_field_sep String getAsQueryString concode_elem_sep Set<java.util.Map.Entry<String,SortedSet<String>>> entrySet concode_elem_sep boolean containsKey concode_elem_sep Collection<SortedSet<String>> values concode_elem_sep boolean isEmpty concode_elem_sep void clear concode_elem_sep SortedSet<String> put concode_elem_sep SortedSet<String> put concode_elem_sep String put concode_elem_sep String put concode_elem_sep boolean containsValue concode_elem_sep SortedSet<String> remove concode_elem_sep int size concode_elem_sep String getFirst concode_elem_sep String getFirst concode_elem_sep void putAll concode_elem_sep void putAll concode_elem_sep void putAll concode_elem_sep SortedSet<String> get concode_elem_sep String getAsHeaderElement concode_elem_sep Set<String> keySet concode_elem_sep String putNull