treeset

Hi, my code is like this: TreeSet<String> ts=new TreeSet<String>(); ts.add("Testtxt"); ts.add("Testxml"); ts.add("docdoc"); ts.add("ePeoplexml"); ts.add("fantasyxlsx"); ts.add("idaddedgif"); ts.add("idaddedrtf"); System.out.println("Tree set :: "+ts); Output: Tree set :: [Testtxt, Testxml, docdoc, ePeoplexml, fantasyxlsx, idaddedgif, idaddedrtf] It's not sorting all strings in alphabetical order.Can any one help how to achieve an ascending order of the strings in treeset . Thanks Madhu. The sorting is fine. It is done in case-sensitive manner. Since unicode code point of T comes before d , so,

So I've been struggling with a problem for a while now, figured I might as well ask for help here. I'm adding Ticket objects to a TreeSet, Ticket implements Comparable and has overridden equals(), hashCode() and CompareTo() methods. I need to check if an object is already in the TreeSet using contains(). Now after adding 2 elements to the set it all checks out fine, yet after adding a third it gets messed up. running this little piece of code after adding a third element to the TreeSet, Ticket temp2 is the object I'm checking for(verkoopLijst). Ticket temp2 = new Ticket(boeking, TicketType

I have been looking into the speeds of different Java collection types and have come across something weird. I am adding 1,000,000 objects from a static array to a different collection type and returning the time required. This part of the code works fine. Under further investigation I noticed that the TreeSet is not receiving all of the 1,000,000 objects, and is receiving a different amount each time. Below is the method to transfer the objects from an array to the TreeSet : public int treeSet(int num) { Date before = new Date(); for(int i=0; i<num; i++) { treeSet.add(personsArray[i]); } Date

While working with a tree set, I found very peculiar behavior. As per my understanding this program should print two identical lines: public class TestSet { static void test(String... args) { Set<String> s = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER); s.addAll(Arrays.asList("a", "b")); s.removeAll(Arrays.asList(args)); System.out.println(s); } public static void main(String[] args) { test("A"); test("A", "C"); } } but strangely it prints: [b] [a, b] Why is tree set behaving like this? This happens because a SortedSet’s Comparator is used for sorting, but removeAll relies on the equals

I saw the code below from java tutorial oracle. In order to count the number of words between doorbell (inclusive) and pickle (inclusive), the author added \0 after the word pickle . I understand that the effect of adding \0 after pickle , is that the word pickle is now included as part of the subset. But my question is, why use \0 ? Could someone please help me out? Thanks in advance for any help! SortedSet<String> dictionary = new TreeSet<>(entire collection of words from a dictionary); int count = dictionary.subSet("doorbell", "pickle\0").size(); System.out.println(count); Edit: Also, what

I need a Collection that sorts the element, but does not removes the duplicates. I have gone for a TreeSet , since TreeSet actually adds the values to a backed TreeMap : public boolean add(E e) { return m.put(e, PRESENT)==null; } And the TreeMap removes the duplicates using the Comparators compare logic I have written a Comparator that returns 1 instead of 0 in case of equal elements. Hence in the case of equal elements the TreeSet with this Comparator will not overwrite the duplicate and will just sort it. I have tested it for simple String objects, but I need a Set of Custom objects. public