nl: puts the given collection of keys into this map according to the contract of #put object , object , predicate . the values will be set to null . the keys are added in the order of the collection 's iterator . each key of keys is tested individually with keypredicate and can be added only if the predicate holds . concode_field_sep SortedMap<K,V> kSmallest concode_elem_sep int k concode_field_sep boolean containsKey concode_elem_sep Collection<V> values concode_elem_sep void clear concode_elem_sep boolean isInRange concode_elem_sep boolean put concode_elem_sep boolean put concode_elem_sep boolean put concode_elem_sep V remove concode_elem_sep boolean containsValue concode_elem_sep K getMinKey concode_elem_sep K getMaxKey concode_elem_sep int size concode_elem_sep K firstKey concode_elem_sep V get concode_elem_sep void setAllValues concode_elem_sep K lastKey concode_elem_sep String toString concode_elem_sep Set<K> keySet
code: void function ( final Collection < ? extends K > arg0 , final Predicate < ? super K > arg1 ) { for ( final K loc0 : arg0 ) { put ( loc0 , null , arg1 , null ) ; } }