Re: TreeSet.contains and an OVERLOADED equals...works?

That's cleared me, thank you :). I have written this because I kept
reading instead the javadoc of contains method of TreeSet, which
doesn't mention this:

http://java.sun.com/javase/6/docs/api/java/util/TreeSet.html#contains(java.lang.Object)

Returns true if this set contains the specified element. More
formally, returns true if and only if this set contains an element e
such that (o==null ? e==null : o.equals(e)).

It is strongly recommended (though not required) that natural orderings be consistent with equals.
This is so because sorted sets (and sorted maps) without explicit comparators behave "strangely"
when they are used with elements (or keys) whose natural ordering is inconsistent with equals.
In particular, such a sorted set (or sorted map) violates the general contract for set (or map),
which is defined in terms of the equals method.

For example, if one adds two keys a and b such that (!a.equals(b) && a.compareTo(b) == 0)
to a sorted set that does not use an explicit comparator, the second add operation returns
false (and the size of the sorted set does not increase) because a and b are equivalent from
the sorted set's perspective.