question: final Entry < K , V > removeEntryForKey ( Object key ) { int hash = ( key == null ) ? 0 : hash ( key ) ; int i = indexFor ( hash , table . length ) ; Entry < K , V > prev = table [ i ] ; Entry < K , V > e = prev ; while ( e != null ) { Entry < K , V > next = e . next ; Object k ; if ( e . hash == hash && ( ( k = e . key ) == key || ( key != null && key . equals ( k ) ) ) ) { modCount ++ ; size -- ; if ( prev == e ) table [ i ] = next ; else prev . next = next ; e . recordRemoval ( this ) ; return e ; } prev = e ; e = next ; } return e ; }
target:  Removes and returns the entry associated with the specified key in the HashMap.  Returns null if the HashMap contains no mapping for this key.