在自定义类中重写hashCode方法
public class Student {
private String id;
public Student(String id) {
this.id=id;
}@Override
public int hashCode() {
return id.hashCode();//返回id的hash值
}
}
import java.util.HashSet;
public class Test1 {
public static void main(String[] args) {
HashSet<Student> set = new HashSet<Student>();
System.out.println(set.add(new Student("100")));//true
System.out.println(set.add(new Student("100")));//true
}}
HashSet中add方法
public boolean add(E e) {
return map.put(e, PRESENT)==null;
}
HashMap中put方法
public V put(K key, V value) {
return putVal(hash(key), key, value, false, true);
}
HashMap中putVal方法
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) //第二次添加时执行Student中的hashCode方法,返回值相同
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))))//equals方法未重写,equals方法返回值为false
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;//返回null
}
putVal方法返回null
put方法返回null
add方法返回true,添加成功