package java.util;
public class HashSet<E>
extends AbstractSet<E>
implements Set<E>, Cloneable, java.io.Serializable
{
static final long serialVersionUID = -5024744406713321676L;
private transient HashMap<E,Object> map;
// Dummy value to associate with an Object in the backing Map
private static final Object PRESENT = new Object();
/**
* HashSet默认构造器,很显然是基于HashMap实现的,将v用Object对象填充掉,只用K做存储
*/
public HashSet() {
map = new HashMap<E,Object>();
}
/**
* Collection参数的构造器
*/
public HashSet(Collection<? extends E> c) {
map = new HashMap<E,Object>(Math.max((int) (c.size()/.75f) + 1, 16));
addAll(c);
}
/**
*
*/
public HashSet(int initialCapacity, float loadFactor) {
map = new HashMap<E,Object>(initialCapacity, loadFactor);
}
/**
*
*/
public HashSet(int initialCapacity) {
map = new HashMap<E,Object>(initialCapacity);
}
/**
*
*/
HashSet(int initialCapacity, float loadFactor, boolean dummy) {
map = new LinkedHashMap<E,Object>(initialCapacity, loadFactor);
}
/**
* 迭代器,其实就是HashMap的keySet迭代器
*/
public Iterator<E> iterator() {
return map.keySet().iterator();
}
/**
* HashSet的大小
*/
public int size() {
return map.size();
}
/**
* 判断HashSet是否为空
*/
public boolean isEmpty() {
return map.isEmpty();
}
/**
*判断一个元素是否在HashSet中
*/
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;
}
/**
* 清空HashSet
*/
public void clear() {
map.clear();
}
/**
* 浅克隆方法
*/
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();
}
}
/**
* 保存一个HashSet对象状态到一个输出流中
*/
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 (Iterator i=map.keySet().iterator(); i.hasNext(); )
s.writeObject(i.next());
}
/**
*从一个输入流中组装一个HashSet
*/
private void readObject(java.io.ObjectInputStream s)
throws java.io.IOException, ClassNotFoundException {
// Read in any hidden serialization magic
s.defaultReadObject();
// Read in HashMap capacity and load factor and create backing HashMap
int capacity = s.readInt();
float loadFactor = s.readFloat();
map = (((HashSet)this) instanceof LinkedHashSet ?
new LinkedHashMap<E,Object>(capacity, loadFactor) :
new HashMap<E,Object>(capacity, loadFactor));
// Read in size
int size = s.readInt();
// Read in all elements in the proper order.
for (int i=0; i<size; i++) {
E e = (E) s.readObject();
map.put(e, PRESENT);
}
}
}
HashSet源代码欣赏
最新推荐文章于 2022-04-04 11:59:00 发布
本文将探讨Java中HashSet的数据结构、实现原理及其源代码分析,包括其内部使用的HashMap、元素添加、删除和查找的效率等方面,帮助读者理解HashSet的底层运作机制。
摘要由CSDN通过智能技术生成