question: public void put ( Object key , Object value ) { int bucket = ( key . hashCode ( ) & 0x7FFFFFFF ) % fTableSize ; Entry entry = search ( key , bucket ) ; if ( entry != null ) { entry . value = value ; } else { entry = new Entry ( key , value , fBuckets [ bucket ] ) ; fBuckets [ bucket ] = entry ; fNum ++ ; } }
target:  Adds the key/value mapping to the key table. If the key already exists, the previous value associated with this key is overwritten by the new value.