final Entry < K , V > getEntry ( Object key ) { int hash = ( key == null ) ? 0 : hash ( key ) ; for ( Entry < K , V > e = table [ indexFor ( hash , table . length ) ] ; e != null ; e = e . next ) { if ( e . hash == hash && ( ( e . key ) == key || ( key != null && key . equals ( e . key ) ) ) ) return e ; } return null ; }
Returns the entry associated with the specified key in the HashMap . Returns null if the HashMap contains no mapping for the key .