JDK源码解析 - java.util.HashSet

1.实现接口

public class HashSet<E>
    extends AbstractSet<E>
    implements Set<E>, Cloneable, java.io.Serializable
    //继承了AbstractSet接口，实现了Set接口
{
    static final long serialVersionUID = -5024744406713321676L;
	...
}

2.变量

    private transient HashMap<E,Object> map;

    // Dummy value to associate with an Object in the backing Map
    //存储到map中时的value值，传静态对象 不需要多次创建，从这也可以看出hashset的基于hashmap的实现原理
    private static final Object PRESENT = new Object();

hashSet是基于hashMap，看源码就明白怎么实现的了

3.构造方法

    /**
     * Constructs a new, empty set; the backing <tt>HashMap</tt> instance has
     * default initial capacity (16) and load factor (0.75).
     */
    public HashSet() {
        map = new HashMap<>();//new了一个hashmap
    }
    
    public HashSet(Collection<? extends E> c) {
        map = new HashMap<>(Math.max((int) (c.size()/.75f) + 1, 16)); //16和c.size()* 4/3 挑一个最大值
        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);
    }
    

4.get , remove，clear

    public boolean add(E e) {
        return map.put(e, PRESENT)==null; //hashmap添加数据
    }
    
    public boolean remove(Object o) {
        return map.remove(o)==PRESENT; //hashmap删除数据
    }
    
    public void clear() {
        map.clear();
    }

将静态对象PRESENT作为value值传入hashMap

5.其他方法

    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);
    }
    
    @SuppressWarnings("unchecked")
    public Object clone() {
        try {
            HashSet<E> newSet = (HashSet<E>) super.clone();
            newSet.map = (HashMap<E, Object>) map.clone(); //浅克隆
            return newSet;
        } catch (CloneNotSupportedException e) {
            throw new InternalError(e);
        }
    }
    
    ...

感觉这个类是JDK源码中最简单的一个了 0-0