boolean function ( final K arg0 , final V arg1 ) { final List < V > loc0 = this . table . get ( arg0 ) ; if ( loc0 == null ) { return false ; } if ( ! loc0 . remove ( arg1 ) ) { return false ; } if ( loc0 . isEmpty ( ) ) { this . table . remove ( arg0 ) ; } return true ; }
removes the key/value pair from the map . if the removed entry was the last entry for this key , the key gets also removed . concode_field_sep Object[] EMPTY_ARRAY concode_elem_sep long serialVersionUID concode_elem_sep HashMap<K,List<V>> table concode_field_sep boolean add concode_elem_sep List<V> createList concode_elem_sep Iterator<V> getAll concode_elem_sep Iterator<K> keys concode_elem_sep boolean containsKey concode_elem_sep void clear concode_elem_sep boolean isEmpty concode_elem_sep int getValueCount concode_elem_sep V getLast concode_elem_sep boolean put concode_elem_sep boolean containsValue concode_elem_sep boolean containsValue concode_elem_sep void removeAll concode_elem_sep V getFirst concode_elem_sep V get concode_elem_sep Object clone concode_elem_sep V[] toArray concode_elem_sep Object[] toArray concode_elem_sep Set<K> keySet