Set的特点是 无序,无下标,元素不可重复,我们看一下它的实现类
HashSet
public static void main(String[] args) {
Set<String> set = new HashSet<String>();
set.add("1");
}
当我们new 一个HashSet的时候
/**
* 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,我们add的时候,
/**
* Adds the specified element to this set if it is not already present.
* More formally, adds the specified element <tt>e</tt> to this set if
* this set contains no element <tt>e2</tt> such that
* <tt>(e==null ? e2==null : e.equals(e2))</tt>.
* If this set already contains the element, the call leaves the set
* unchanged and returns <tt>false</tt>.
*
* @param e element to be added to this set
* @return <tt>true</tt> if this set did not already contain the specified
* element
*/
public boolean add(E e) {
return map.put(e, PRESENT)==null;
}
其实就是将我们要放入的元素作为map的key存放,value是一个object对象
// Dummy value to associate with an Object in the backing Map
private static final Object PRESENT = new Object();
其他的它底层实现就是HashMap,我们知道HashMap的键对象,存储是根据哈希算法,具体可以参考我的另一篇文章
http://blog.csdn.net/xu511739113/article/details/52366754
所以如果是自定义的对象,我们需要重写equals和hashCode方法。
LinkedHashSet的特点是可以保留插入顺序。要注意,如果要使用LinkedHashSet也需要重写equals和hashCode方法。