自定义一个类:
public class Student {
private String name;
public Student(String name) {
this.name= name;
}
}
在HashSet集合中加入Student类数据:
import java.util.HashSet;
public class Test {
public static void main(String[] args) {
HashSet<Student> set = new HashSet<Student>();
set.add(new Student("Jack"));
set.add(new Student("Jack"));
}
}
add源代码:
public boolean add(E e) {
return map.put(e, PRESENT)==null;
}
HashMap中的put方法:
public V put(K key, V value) {//K key为Jim,V value为常量PRESENT
return putVal(hash(key), key, value, false, true);
}
hash(key):
static final int hash(Object key) {
int h;
return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
//如果key为null,则返回0,否则返回key的处理值
}
由于两次存储对象不同,hashCode值不同,因此两次存储的hash(key)不同。
putVal方法:
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16
transient Node<K,V>[] table;//table=null
final V putVal(int hash, K key, V value, boolean onlyIfAbsent,boolean evict) {
Node<K,V>[] tab; Node<K,V> p; int n, i;
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
else {
Node<K,V> e; K k;
if (p.hash == hash && ((k = p.key) == key || (key != null && key.equals(k))))
e = p;
else if (p instanceof TreeNode)
e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
else {
for (int binCount = 0; ; ++binCount) {
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
treeifyBin(tab, hash);
break;
}
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}
存储第一个Jack的过程在(一)中有所描述,当添加第二个Jack时:
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
由于第一次存储table不为null,tab.length不为0,因此条件为false,继续到下一个if语句。
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
由于两次hash值不相等,因此两次的i = (n - 1) & hash不相等,因此第二次tab[i = (n - 1) & hash]为null,将Jack成功存储进去。