Entry(int h,
    K k,
    V v,
    Entry<K, V> n) 
{
            value = v;
            next = n;
            key = k;
            hash = h;
}

Creates new entry.

 public final boolean equals(Object o) 
{
            if (!(o instanceof Map.Entry))
                return false;
            Map.Entry e = (Map.Entry)o;
            Object k1 = getKey();
            Object k2 = e.getKey();
            if (k1 == k2 || (k1 != null && k1.equals(k2))) {
                Object v1 = getValue();
                Object v2 = e.getValue();
                if (v1 == v2 || (v1 != null && v1.equals(v2)))
                    return true;
            }
            return false;
}

 public final K getKey() 
{
            return key;
}

 public final V getValue() 
{
            return value;
}

 public final int hashCode() 
{
            return (key==null   ? 0 : key.hashCode()) ^
                   (value==null ? 0 : value.hashCode());
}

  void recordAccess(HashMap<K, V> m) 
{

}

This method is invoked whenever the value in an entry is overwritten by an invocation of put(k,v) for a key k that's already in the HashMap.

  void recordRemoval(HashMap<K, V> m) 
{

}

This method is invoked whenever the entry is removed from the table.

 public final V setValue(V newValue) 
{
            V oldValue = value;
            value = newValue;
            return oldValue;
}

 public final String toString() 
{
            return getKey() + "=" + getValue();
}