深入java集合类-HashSet(jdk1.8)

需要HashMap的知识
深入理解HashMap

1.HashSet 简介

对于HashSet而言，它是基于HashMap来实现的，底层采用HashMap来保存元素。
HashSet 是一个 没有重复元素的集合 。

不保证元素的顺序 ，而且 HashSet允许使用 null 元素 。
HashSet是 非同步的 。

如果多个线程同时访问一个哈希 set，而其中至少一个线程修改了该 set，那么它必须 保持外部同步。这通常是通过对自然封装该 set 的对象执行同步操作来完成的。如果不存在这样的对象，则应该使用 **Collections.synchronizedSet 方法来“包装” set。**最好在创建时完成这一操作，以防止对该 set 进行意外的不同步访问;

2.HashSet源码

dummy: 没有什么用的值,占位值
获取hashset的值,采用迭代器就行

2.1 字段

    private transient HashMap<E,Object> map;

     //用来填充底层数据结构HashMap中的value，因为HashSet只用key存储数据。
    private static final Object PRESENT = new Object();

2.2 构造方法

大家来看看人家是如何进行HashMap的初始化的
Math.max((int) (c.size()/.75f) + 1, 16)

    public HashSet() {
        map = new HashMap<>();
    }
    //Math.max((int) (c.size()/.75f) + 1, 16)
      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);
    }
    
     HashSet(int initialCapacity, float loadFactor, boolean dummy) {
        map = new LinkedHashMap<>(initialCapacity, loadFactor);
    }

2.3 核心方法

 private static final Object PRESENT = new Object();
 //不用多说:
 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();
    }

  public boolean contains(Object o) {
        return map.containsKey(o);
    }

//返回这个HashSet实例:元素的浅拷贝
 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);
        }
    }

把hashmap写入流中,看英文注释就差不多懂了

 private void writeObject(java.io.ObjectOutputStream s)
        throws java.io.IOException {
        // Write out any hidden serialization magic
        s.defaultWriteObject();

        // Write out HashMap capacity and load factor
        s.writeInt(map.capacity());
        s.writeFloat(map.loadFactor());

        // Write out size
        s.writeInt(map.size());

        // Write out all elements in the proper order.
        for (E e : map.keySet())
            s.writeObject(e);
    }

从流中重新构造HashSet实例(即反序列化)。

 private void readObject(java.io.ObjectInputStream s)
        throws java.io.IOException, ClassNotFoundException {
        // Read in any hidden serialization magic
        s.defaultReadObject();

        // Read capacity and verify non-negative.
        int capacity = s.readInt();
        if (capacity < 0) {
            throw new InvalidObjectException("Illegal capacity: " +
                                             capacity);
        }

        // Read load factor and verify positive and non NaN.
        float loadFactor = s.readFloat();
        if (loadFactor <= 0 || Float.isNaN(loadFactor)) {
            throw new InvalidObjectException("Illegal load factor: " +
                                             loadFactor);
        }

        // Read size and verify non-negative.
        int size = s.readInt();
        if (size < 0) {
            throw new InvalidObjectException("Illegal size: " +
                                             size);
        }
        // Set the capacity according to the size and load factor ensuring that
        // the HashMap is at least 25% full but clamping to maximum capacity.
        capacity = (int) Math.min(size * Math.min(1 / loadFactor, 4.0f),
                HashMap.MAXIMUM_CAPACITY);

        // Constructing the backing map will lazily create an array when the first element is
        // added, so check it before construction. Call HashMap.tableSizeFor to compute the
        // actual allocation size. Check Map.Entry[].class since it's the nearest public type to
        // what is actually created.

        SharedSecrets.getJavaOISAccess()
                     .checkArray(s, Map.Entry[].class, HashMap.tableSizeFor(capacity));

        // Create backing HashMap
        map = (((HashSet<?>)this) instanceof LinkedHashSet ?
               new LinkedHashMap<E,Object>(capacity, loadFactor) :
               new HashMap<E,Object>(capacity, loadFactor));

        // Read in all elements in the proper order.
        for (int i=0; i<size; i++) {
            @SuppressWarnings("unchecked")
                E e = (E) s.readObject();
            map.put(e, PRESENT);
        }
    }