tests if some key maps into the specified value in this hashtable . this operation is more expensive than the containskey method . note that this method is identical in functionality to containsvalue , which is part of the map interface in the collections framework . concode_field_sep Entry table[] concode_elem_sep Entry next concode_elem_sep float loadFactor concode_elem_sep int count concode_elem_sep int threshold concode_elem_sep Object value concode_elem_sep int hash concode_field_sep int size concode_elem_sep boolean containsKey concode_elem_sep Object get concode_elem_sep boolean isEmpty concode_elem_sep void clear concode_elem_sep void rehash concode_elem_sep boolean containsValue concode_elem_sep Object put concode_elem_sep Object remove
boolean function ( Object arg0 ) { if ( arg0 == null ) { throw new NullPointerException ( ) ; } Entry loc0 [ ] = table ; for ( int loc1 = loc0 . length ; loc1 -- > 0 ; ) { for ( Entry loc2 = loc0 [ loc1 ] ; loc2 != null ; loc2 = loc2 . next ) { if ( loc2 . arg0 . equals ( arg0 ) ) { return true ; } } } return false ; }