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();
 
  /**
   * 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<>();
  }

 public boolean add(E e) {
    return map.put(e, PRESENT)==null;
  }

public class SetTest {
 
 public class Obj {
 public String name;
 public Obj(String name) {
  this.name=name;
 }
 }
 
 public static void main(String[] args) {
 Set<String> strSet = new HashSet<String>();
 String str1 = new String("123");
 String str2 = new String("123");
 strSet.add(str1);
 strSet.add(str2);
 System.out.println(str1 == str2);
 for(String str : strSet) {
  System.out.println(str);
 }
 Set<Obj> objSet = new HashSet<Obj>();
 Obj o1 = new SetTest().new Obj("1");
 Obj o2 = new SetTest().new Obj("1");
 objSet.add(o1);
 objSet.add(o2);
 for(Obj str : objSet) {
  System.out.println(str.name);
 } 
 } 
}

false
123
1
1

 public V put(K key, V value) {
    return putVal(hash(key), key, value, false, true);
  }

 static final int hash(Object key) {
    int h;
    return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
  }

 /**
   * 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();
 
  /**
   * Constructs a set backed by the specified navigable map.
   */
  TreeSet(NavigableMap<E,Object> m) {
    this.m = m;
  }
/**
   * Constructs a new, empty tree set, sorted according to the
   * natural ordering of its elements. All elements inserted into
   * the set must implement the {@link Comparable} interface.
   * Furthermore, all such elements must be <i>mutually
   * comparable</i>: {@code e1.compareTo(e2)} must not throw a
   * {@code ClassCastException} for any elements {@code e1} and
   * {@code e2} in the set. If the user attempts to add an element
   * to the set that violates this constraint (for example, the user
   * attempts to add a string element to a set whose elements are
   * integers), the {@code add} call will throw a
   * {@code ClassCastException}.
   */
  public TreeSet() {
    this(new TreeMap<E,Object>()); // 將一個(gè)新生成的TreeMap空對(duì)象賦值給m，也就是上一方法
  }

 public TreeMap() {
    comparator = null;
  }

public boolean add(E e) {
    return m.put(e, PRESENT)==null; // 如果返回值為空則表示我們插入了一個(gè)新的元素，如果返回值為非空，則表明我們插入的元素已經(jīng)存在。
  }

 public V put(K key, V value) {
    Entry<K,V> t = root; // 定義t為根節(jié)點(diǎn)
    if (t == null) { // 如果根節(jié)點(diǎn)為空
      compare(key, key); // type (and possibly null) check // 對(duì)自身做對(duì)比，如果有對(duì)比器就用對(duì)比器的規(guī)則進(jìn)行對(duì)比，如果沒有，就用元素自身對(duì)比的規(guī)則進(jìn)行對(duì)比。為0則相等。我覺得這波其實(shí)沒有意義，就是一個(gè)空的對(duì)比。
 
      root = new Entry<>(key, value, null); // 新建一個(gè)空的根節(jié)點(diǎn)
      size = 1; // 設(shè)置大小為1
      modCount++; //對(duì)0做+1
      return null; // 返回空值，表示插入成功。
    }
    int cmp;
    Entry<K,V> parent;
    // split comparator and comparable paths
    Comparator<? super K> cpr = comparator; // 用本treeMap的對(duì)比器對(duì)cpr賦值
    if (cpr != null) { // 如果定義的對(duì)比器不為空（在TreeSet里是為空的，我們之間說到過）
      do {
        parent = t; 
        cmp = cpr.compare(key, t.key);
        if (cmp < 0)
          t = t.left;
        else if (cmp > 0)
          t = t.right;
        else
          return t.setValue(value);
      } while (t != null);
    }
    else { // 如果對(duì)比器為空（在這種情況下是為空的）
      if (key == null) // 如果key為空就拋出錯(cuò)誤
        throw new NullPointerException();
      @SuppressWarnings("unchecked")
      Comparable<? super K> k = (Comparable<? super K>) key;// 生成可比較的對(duì)象Comparable
      do {
        parent = t; 將父節(jié)點(diǎn)（最初是根節(jié)點(diǎn)）賦值給parent
        cmp = k.compareTo(t.key); //對(duì)我們要插入的key與根節(jié)點(diǎn)的keyj進(jìn)行對(duì)比
        if (cmp < 0) // 對(duì)比后值小于0，則表示我們插入的key小于根節(jié)點(diǎn)的key，就讓父節(jié)點(diǎn)往左走，并循環(huán)直至命中
          t = t.left;
        else if (cmp > 0) // 對(duì)比后值大于0，則表示我們插入的key小于根節(jié)點(diǎn)的key，就讓父節(jié)點(diǎn)往右走，并循環(huán)直至命中
          t = t.right;
        else //當(dāng)命中，用我們的值替換原有的值一次保證不插入重復(fù)的key，并返回替換后的對(duì)象
          return t.setValue(value);
      } while (t != null);
    }
    Entry<K,V> e = new Entry<>(key, value, parent); // 如果沒有在樹中命中，則新生成一個(gè)樹節(jié)點(diǎn)此時(shí)parent的父節(jié)點(diǎn)已經(jīng)遍歷到了某個(gè)葉子節(jié)點(diǎn)。
    if (cmp < 0) // 如果你的這個(gè)值是小于葉子節(jié)點(diǎn)的，則插入左邊，大于則插入右邊
      parent.left = e;
    else
      parent.right = e;
    fixAfterInsertion(e); // 對(duì)整棵樹做平衡修正
    size++; // size值加1表示我們插入了一個(gè)值
    modCount++; // modCount也加1
    return null;
  }