java-TreeSet问题

TreeSet

今天同事写代码，使用TreeSet的时候遇到了一些问题。我先贴个Set的定义，装一波。因为我实在是记不住这些。

public class TreeSet extends AbstractSetimplements NavigableSet, Cloneable, Serializable
A NavigableSet implementation based on a TreeMap. The elements are ordered using their natural ordering, or by a Comparator provided at set creation time, depending on which constructor is used.
This implementation provides guaranteed log(n) time cost for the basic operations (add, remove and contains).
Note that the ordering maintained by a set (whether or not an explicit comparator is provided) must be consistent with equals if it is to correctly implement the Set interface. (See Comparable or Comparator for a precise definition of consistent with equals.) This is so because the Set interface is defined in terms of the equals operation, but a TreeSet instance performs all element comparisons using its compareTo (or compare) method, so two elements that are deemed equal by this method are, from the standpoint of the set, equal. The behavior of a set is well-defined even if its ordering is inconsistent with equals; it just fails to obey the general contract of the Set interface.
Note that this implementation is not synchronized. If multiple threads access a tree set concurrently, and at least one of the threads modifies the set, it must be synchronized externally. This is typically accomplished by synchronizing on some object that naturally encapsulates the set. If no such object exists, the set should be “wrapped” using the Collections.synchronizedSortedSet method. This is best done at creation time, to prevent accidental unsynchronized access to the set:
SortedSet s = Collections.synchronizedSortedSet(new TreeSet(…));
The iterators returned by this class’s iterator method are fail-fast: if the set is modified at any time after the iterator is created, in any way except through the iterator’s own remove method, the iterator will throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.
This class is a member of the Java Collections Framework.

由这段介绍我们，TreeSet属于不重复有序，非线程安全的集合对象，TreeSet，可以传递Comparator 排序，默认TreeSet是按自然排序的,TreeSet的底层使用TreeMap实现，并且提供了log(n)的基础方法.
当然上面那些都不重要，重要的是记录问题
第一次我是偷懒这样写的，发现有重复数据,重写equals方法也没有用

Set fk=new TreeSet<>((e1,e2)->{
    return e1.getId-e2.getId>0?-1:1;
})

因为这句话没有考虑到a TreeSet instance performs all element comparisons using its compareTo (or compare) method, so two elements that are deemed equal by this method are.由于我们实现了Comparator所以TreeSet去重的时候不在调用equals方法。正确的做法是相同值需要返回0

Set fk=new TreeSet<>((e1,e2)->{
    return e1.getId-e2.getId;
})