Question

I have a nested treemap based on the following structure, and then it ofc continues from “2”:{ with the same structure..

http://pastebin.com/uKwAVz5L

And as you can see, it is already sorted by the “c13” sub item (episode number).. but when i use the treemap in my applications, it shows up like this:

http://i50.tinypic.com/15o9vno.png

They are not even remotely sorted.. but i cant see why? :O

Its the same problem when using it in my android app..

Cheers

Answer 1

Here is some valuable infomation on TreeMap:

Red-Black tree based implementation of the SortedMap interface. This
class guarantees that the map will be in ascending key order, sorted
according to the natural order for the key’s class (see Comparable),
or by the comparator provided at creation time, depending on which
constructor is used.

Note that the ordering maintained by a sorted map (whether or not an
explicit comparator is provided) must be consistent with equals if
this sorted map is to correctly implement the Map interface. (See
Comparable or Comparator for a precise definition of consistent with
equals.) This is so because the Map interface is defined in terms of
the equals operation, but a map performs all key comparisons using its
compareTo (or compare) method, so two keys that are deemed equal by
this method are, from the standpoint of the sorted map, equal. The
behavior of a sorted map is well-defined even if its ordering is
inconsistent with equals; it just fails to obey the general contract
of the Map interface.

Have you correctly implemented the methods mentioned above?

There are also different implementations of the Collections framework (An overview is here). If TreeMap doesn’t provide the functionality you want you can implement another one and modify it to your needs.