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;
}

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 ; }
removes and returns the entry associated with the specified key in the hashmap . returns null if the hashmap contains no mapping for this key .
