protected void reuseEntry(HashEntry<K, V> entry, int hashIndex,
            int hashCode, K key, V value) {
        entry.next = data[hashIndex];
        entry.hashCode = hashCode;
        entry.key = key;
        entry.value = value;
    }
protected void reuseEntry(HashEntry<K, V> entry, int hashIndex,
            int hashCode, K key, V value) {
        entry.next = data[hashIndex];
        entry.hashCode = hashCode;
        entry.key = key;
        entry.value = value;
    }
protected void reuseEntry ( HashEntry < K , V > entry , int hashIndex , int hashCode , K key , V value ) { entry . next = data [ hashIndex ] ; entry . hashCode = hashCode ; entry . key = key ; entry . value = value ; }
Reuses an existing key-value mapping, storing completely new data.
<p/>
This implementation sets all the data fields on the entry. Subclasses
could populate additional entry fields.

@param entry
the entry to update, not null
@param hashIndex
the index in the data array
@param hashCode
the hash code of the key to add
@param key
the key to add
@param value
the value to add
Reuses an existing key - value mapping storing completely new data . <p / > This implementation sets all the data fields on the entry . Subclasses could populate additional entry fields .