PMap < K , V > function ( V arg0 , V arg1 ) { HashPMap < K , V > loc0 = data ; for ( K loc1 : loc0 . keySet ( ) ) { if ( loc0 . get ( loc1 ) . equals ( arg0 ) ) loc0 = loc0 . plus ( loc1 , arg1 ) ; } return new PMap < K , V > ( loc0 ) ; }
replaces the value of all pairs with the given value by the given new one . linear runtime complexity . concode_field_sep HashPMap<K,V> data concode_elem_sep PList<K> keysSorted concode_field_sep PMap<K,V> minus concode_elem_sep Set<java.util.Map.Entry<K,V>> entrySet concode_elem_sep boolean containsKey concode_elem_sep Collection<V> values concode_elem_sep void clear concode_elem_sep boolean isEmpty concode_elem_sep PMap<K,V> plusAll concode_elem_sep V put concode_elem_sep PMap<K,V> plus concode_elem_sep boolean containsValue concode_elem_sep V remove concode_elem_sep K getKeyByValue concode_elem_sep int size concode_elem_sep PMap<K,V> minusValue concode_elem_sep int hashCode concode_elem_sep void putAll concode_elem_sep V get concode_elem_sep boolean equals concode_elem_sep PMap<K,V> pmap concode_elem_sep PMap<K,V> minusAll concode_elem_sep String toString concode_elem_sep Set<K> keySet concode_elem_sep PList<K> keySortedList