The parameters of the add method are custom
public class Student {
private String id;
public Student(String id) {
this.id=id;
}}
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
}}
Add method in HastSet
public boolean add(E e) {
return map.put(e, PRESENT)==null;
}
Put method in HashMap
public V put(K key, V value) {
return putVal(hash(key), key, value, false, true);
}
Hash method in HashMap
static final int hash(Object key) {
int h;
return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
}
PutVal method in HashMap
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)//The table is not empty when adding for the second time, n is not zero n = (tab = resize()).length; //do not execute if ( (p = tab[i = (n-1) & hash]) == null) //The object added for the second time has different hash values from the first time, and p is empty tab[i] = newNode( hash, key, value, null); //Add successfully 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;
}