JAVA深化篇_20—— 面试必问之 HashSet的源码分析AV

HashSet底层源码分析

成员变量

private transient HashMap<E,Object> map;


// Dummy value to associate with an Object in the backing Map
private static final Object PRESENT = new Object();

添加元素

/**
 * 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&nbsp;?&nbsp;e2==null&nbsp;:&nbsp;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;
}

TreeSet底层源码分析

成员变量

/**
 * The backing map.
 */
private transient NavigableMap<E,Object> m;


// Dummy value to associate with an Object in the backing Map
private static final Object PRESENT = new Object();

构造方法

public TreeSet() {
  this(new TreeMap<E,Object>());
}

添加元素

/**
 * 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&nbsp;?&nbsp;e2==null&nbsp;:&nbsp;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;
}