Set < T1 > function ( T2 arg0 ) { Set < T1 > loc0 = _reverse . get ( arg0 ) ; if ( null == loc0 ) { return Collections . emptySet ( ) ; } return new HashSet < > ( loc0 ) ; }
search the reverse map for all keys that have been associated with a particular value . concode_field_sep boolean _dirty concode_elem_sep Map<T2,Set<T1>> _reverse concode_elem_sep Map<T1,Set<T2>> _forward concode_field_sep Set<T2> getValues concode_elem_sep boolean valueHasOtherKeys concode_elem_sep boolean containsKey concode_elem_sep boolean clear concode_elem_sep Set<T2> getValueSet concode_elem_sep Set<T1> getKeySet concode_elem_sep void clearDirtyBit concode_elem_sep boolean containsValue concode_elem_sep boolean put concode_elem_sep boolean remove concode_elem_sep boolean checkIntegrity concode_elem_sep boolean isDirty concode_elem_sep boolean keyHasOtherValues concode_elem_sep boolean removeKey concode_elem_sep boolean removeValue concode_elem_sep boolean containsKeyValuePair