wood burning stoves 2.0*
The moose likes Programmer Certification (SCJP/OCPJP) and the fly likes TreeSet with compartor constructor Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login


Win a copy of Spring in Action this week in the Spring forum!
JavaRanch » Java Forums » Certification » Programmer Certification (SCJP/OCPJP)
Bookmark "TreeSet with compartor constructor" Watch "TreeSet with compartor constructor" New topic
Author

TreeSet with compartor constructor

Paul Stat
Ranch Hand

Joined: Jan 20, 2009
Posts: 50
Hi folks, I'm having a play again. I have the following code



So I've defined my own order based upon string length, the above gives the following output

First
Second

Where's Third gone? Is it because Third and First have the same length? Therefore one overwrites the other?
Omar Al Kababji
Ranch Hand

Joined: Jan 13, 2009
Posts: 357
of course your comparator is used as an equals() method, so if you return a zero it means that they are equal, and since you are using a SET which dosen't allow duplicates only one can exist.


Omar Al Kababji - Electrical & Computer Engineer
[SCJP - 90% - Story] [SCWCD - 94% - Story] [SCBCD - 80% - Story] | My Blog
Harshit Rastogi
Ranch Hand

Joined: Apr 15, 2008
Posts: 131
you can modify the code to
>


<a href="http://technologiquepanorama.wordpress.com" target="_blank" rel="nofollow">My Techie Blog</a><br /><a href="http://www.java-questions.com" target="_blank" rel="nofollow">Java Questions</a>
Jia Tan
Ranch Hand

Joined: Jan 28, 2009
Posts: 32
The constructor you used for TreeSet is new TreeSet<String>(comp), in Java API it says:

public TreeSet(Comparator<? super E> comparator)

Constructs a new, empty tree set, sorted according to the specified comparator.


And for the Comparator:

The ordering imposed by a comparator c on a set of elements S is said to be consistent with equals if and only if c.compare(e1, e2)==0 has the same boolean value as e1.equals(e2) for every e1 and e2 in S.


Since TreeSet implements SortSet, and in API SortSet notes:

Note that the ordering maintained by a sorted set (whether or not an explicit comparator is provided) must be consistent with equals if the sorted set is to correctly implement the Set interface. (See the Comparable interface or Comparator interface 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 sorted set 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 sorted set, equal. The behavior of a sorted set is well-defined even if its ordering is inconsistent with equals; it just fails to obey the general contract of the Set interface.


When trying to add "Third" to the TreeSet, it compares with existing element "First" and returns 0 and won't be able to sort the set, so it failed.

I have a question though, the TreeSet's add method says:

public boolean add(E e)

Adds the specified element to this set if it is not already present. More formally, adds the specified element e to this set if the set contains no element e2 such that (e==null ? e2==null : e.equals(e2)). If this set already contains the element, the call leaves the set unchanged and returns false.

It does not mention sort or compare stuff, so it seems as long as the new element fulfil the condition (e==null ? e2==null : e.equals(e2)), it should be able to be added. It seems contradictory on this example?



result:
First=Third? false
Add First: true
Add Second: true
Add Third: false
 
 
subject: TreeSet with compartor constructor