首先看下hashset大致的结构
private transient HashMap<E,Object> map;
private static final Object PRESENT = new Object();
public HashSet() {
map = new HashMap<>();
}
public HashSet(Collection<? extends E> c) {
map = new HashMap<>(Math.max((int) (c.size()/.75f) + 1, 16));
addAll(c);
}
public HashSet(int initialCapacity, float loadFactor) {
map = new HashMap<>(initialCapacity, loadFactor);
}
public HashSet(int initialCapacity) {
map = new HashMap<>(initialCapacity);
}
HashSet(int initialCapacity, float loadFactor, boolean dummy) {
map = new LinkedHashMap<>(initialCapacity, loadFactor);
}
public Iterator<E> iterator() {
return map.keySet().iterator();
}
public int size() {
return map.size();
}
public boolean isEmpty() {
return map.isEmpty();
}
public boolean contains(Object o) {
return map.containsKey(o);
}
public boolean add(E e) {
return map.put(e, PRESENT)==null;
}
public boolean remove(Object o) {
return map.remove(o)==PRESENT;
}
public void clear() {
map.clear();
}
注意:HashSet(int initialCapacity, float loadFactor, boolean dummy)用构造器来实例化的时候,其底层是通过 LinkedHashMap来实现,及插入是有序的。
其他的构造器就是使用hashmap 来实现,类中有个hashmap对象,一些增删改查都是通过map对象实现的,map的key是set真实的值,value是一个空对象,其他没啥区别
众所周知,hashset里面的元素是不重复的,然后hashmap里面的key也不重复,hashmap key重复时,会把最新对象的value替换老对象的value,hashset也一样,但是hashset新旧对象的value都是一样的,都是PRESENT