Set集合之HashSet

卖家导航

于 2024-05-13 17:06:51 发布

阅读量669

点赞数 18

分类专栏：程序员文章标签： java 哈希算法开发语言

本文链接：https://blog.csdn.net/2301_79055083/article/details/138810525

版权

程序员专栏收录该内容

295 篇文章 0 订阅

订阅专栏

/**

Constructs a new, empty set; the backing HashMap instance has
the specified initial capacity and default load factor (0.75).
@param initialCapacity the initial capacity of the hash table
@throws IllegalArgumentException if the initial capacity is less
```
        than zero
```

public HashSet(int initialCapacity) {

map = new HashMap<>(initialCapacity);

}

指定初始化容量的HashSet构造器

内部完成map初始化，初始化容量为指定的初始化容量，但是map底层哈希表实际容量为tableSizeFor(initialCapacity)

public HashSet(int initialCapacity, float loadFactor)

/**

Constructs a new, empty set; the backing HashMap instance has
the specified initial capacity and the specified load factor.
@param initialCapacity the initial capacity of the hash map
@param loadFactor the load factor of the hash map
@throws IllegalArgumentException if the initial capacity is less

        than zero, or if the load factor is nonpositive

public HashSet(int initialCapacity, float loadFactor) {

map = new HashMap<>(initialCapacity, loadFactor);

}

指定初始化容量和负载因子的HashSet构造器

内部完成map的初始化，map底层哈希表的初始化容量为tableSizeFor(initialCapacity),负载因子为loadFactor

HashSet(int initialCapacity, float loadFactor, boolean dummy)

/**

Constructs a new, empty linked hash set. (This package private
constructor is only used by LinkedHashSet.) The backing
HashMap instance is a LinkedHashMap with the specified initial
capacity and the specified load factor.
@param initialCapacity the initial capacity of the hash map
@param loadFactor the load factor of the hash map
@param dummy ignored (distinguishes this

        constructor from other int, float constructor.)

@throws IllegalArgumentException if the initial capacity is less

        than zero, or if the load factor is nonpositive

HashSet(int initialCapacity, float loadFactor, boolean dummy) {

map = new LinkedHashMap<>(initialCapacity, loadFactor);

}

该构造器为默认访问权限，即同包访问，即我们日常使用时，无法使用该构造器。

该构造器主要是给HashSet子类LinkedHashSet使用。

成员方法

====

public boolean add(E e)

/**

Adds the specified element to this set if it is not already present.
More formally, adds the specified element e to this set if
this set contains no element e2 such that
(enull ? e2null : e.equals(e2)).
If this set already contains the element, the call leaves the set
unchanged and returns false.
@param e element to be added to this set
@return true if this set did not already contain the specified
element

public boolean add(E e) {

return map.put(e, PRESENT)==null;

}

可以看出HashSet的add方法内部调用HashMap的put方法

HashMap的put方法具有新增和修改功能。其中新增是对于key-valule（返回null），修改是对于value（返回老的value）

而对于HashSet而言，只关注map的key列，value数据永远时PRESENT。所以map的put修改功能对key（HashSet的集合元素）无效果，或者说put修改功能在HashSet体现为永远返回PRESENT。

（注意这里就是为什么将HashSet底层HashMap的value设置为PRESENT,而不是null的原因。如果图方便，将HashSet底层的map的value设置为null，则put重复key时，会导致put方法返回的被覆盖的value值总是null，那么就无法判断HashSet的add方法是否添加key成功了）

所以HashSet新增重复元素时，底层map的key列无变化。此时add方法返回false。

新增不重复元素时，底层map的key会新增元素，此时add方法返回true。

public boolean remove(Object o)

/**

Removes the specified element from this set if it is present.
More formally, removes an element e such that
(onull ? enull : o.equals(e)),
if this set contains such an element. Returns true if
this set contained the element (or equivalently, if this set
changed as a result of the call). (This set will not contain the
element once the call returns.)
@param o object to be removed from this set, if present
@return true if the set contained the specified element

public boolean remove(Object o) {

return map.remove(o)==PRESENT;

}

HashSet的remove方法依赖于底层HashMap的remove方法

我们知道HashMap的remove方法，删除存在的key的键值对时，会将对应的value作为方法返回值，删除不存在的key的键值对时，会直接返回null。

而HashSet底层的HashMap的value永远是PRESENT。所以如果删除的元素(key)存在,则会返回PRESENT，否则返回null。

这就可以帮助HashSet的remove方法判断是否删除成功了。

public void clear()

/**

Removes all of the elements from this set.
The set will be empty after this call returns.

public void clear() {

map.clear();

}

HashSet的clear方法依赖于底层map的clear方法

public boolean contains(Object o)

/**

Returns true if this set contains the specified element.
More formally, returns true if and only if this set
contains an element e such that
(onull ? enull : o.equals(e)).
@param o element whose presence in this set is to be tested
@return true if this set contains the specified element

public boolean contains(Object o) {

return map.containsKey(o);

}

HashSet的contains方法依赖于底层map的containsKey方法

public int size()

/**

Returns the number of elements in this set (its cardinality).
@return the number of elements in this set (its cardinality)

public int size() {

return map.size();

}

HashSet的size方法依赖于底层map的size方法

public boolean isEmpty()

/**

Returns true if this set contains no elements.
@return true if this set contains no elements

public boolean isEmpty() {

return map.isEmpty();

}

HashSet的isEmpty方法依赖于底层map的isEmpty方法

public Object clone()

/**

Returns a shallow copy of this HashSet instance: the elements
themselves are not cloned.
@return a shallow copy of this set

@SuppressWarnings(“unchecked”)

public Object clone() {

try {

HashSet newSet = (HashSet) super.clone();

newSet.map = (HashMap<E, Object>) map.clone();

return newSet;

} catch (CloneNotSupportedException e) {

throw new InternalError(e);

}

可以看出HashSet的clone()方法返回的是浅克隆对象，因为没有针对集合元素对象的克隆

迭代器

===

public Iterator iterator()

/**

Returns an iterator over the elements in this set. The elements
are returned in no particular order.
@return an Iterator over the elements in this set
@see ConcurrentModificationException

public Iterator iterator() {

return map.keySet().iterator();

}

HashSet的迭代器对象通过iterator()方法返回。

而该方法内部依赖于底层map.keySet().iterator()。map.keySet().iterator()返回的是KeyIterator迭代器对象，该类重写next方法。

而KeyIterator类继承了HashIterator，HashIteator提供了hasNext(),remove()方法