protected void removeEntry(HashEntry<K, V> entry, int hashIndex,
            HashEntry<K, V> previous) {
        if (previous == null) {
            data[hashIndex] = entry.next;
        } else {
            previous.next = entry.next;
        }
    }
protected void removeEntry(HashEntry<K, V> entry, int hashIndex,
            HashEntry<K, V> previous) {
        if (previous == null) {
            data[hashIndex] = entry.next;
        } else {
            previous.next = entry.next;
        }
    }
protected void removeEntry ( HashEntry < K , V > entry , int hashIndex , HashEntry < K , V > previous ) { if ( previous == null ) { data [ hashIndex ] = entry . next ; } else { previous . next = entry . next ; } }
Removes an entry from the chain stored in a particular index.
<p/>
This implementation removes the entry from the data storage table. The
size is not updated. Subclasses could override to handle changes to the
map.

@param entry
the entry to remove
@param hashIndex
the index into the data structure
@param previous
the previous entry in the chain
Removes an entry from the chain stored in a particular index . <p / > This implementation removes the entry from the data storage table . The size is not updated . Subclasses could override to handle changes to the map .